A preconditioned iteration method for solving sylvester equations

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A preconditioned gradient-based iterative method is derived by judicious selection of two auxil- iary matrices. The strategy is based on the Newtons iteration method and can be regarded as a generalization of the splitting iterative method for system of linear equations. We analyze the convergence of the method and illustrate that the approach is able to considerably accelerate the convergence of the gradient-based iterative method. Copyright © 2012 Jituan Zhou et al.

Cite

CITATION STYLE

APA

Zhou, J., Wang, R., & Niu, Q. (2012). A preconditioned iteration method for solving sylvester equations. Journal of Applied Mathematics, 2012. https://doi.org/10.1155/2012/401059

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free