Premium
Real valued iterative methods for solving complex symmetric linear systems
Author(s) -
Axelsson Owe,
Kucherov Andrey
Publication year - 2000
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/1099-1506(200005)7:4<197::aid-nla194>3.0.co;2-s
Subject(s) - mathematics , positive definite matrix , iterative method , bounded function , matrix (chemical analysis) , linear system , ordinary differential equation , system of linear equations , polynomial , symmetric matrix , mathematical analysis , differential equation , mathematical optimization , eigenvalues and eigenvectors , physics , materials science , quantum mechanics , composite material
Complex valued systems of equations with a matrix R + 1 S where R and S are real valued arise in many applications. A preconditioned iterative solution method is presented when R and S are symmetric positive semi‐definite and at least one of R, S is positive definite. The condition number of the preconditioned matrix is bounded above by 2, so only very few iterations are required. Applications when solving matrix polynomial equation systems, linear systems of ordinary differential equations, and using time‐stepping integration schemes based on Padé approximation for parabolic and hyperbolic problems are also discussed. Numerical comparisons show that the proposed real valued method is much faster than the iterative complex symmetric QMR method. Copyright © 2000 John Wiley & Sons, Ltd.