Abstract
We consider large sparse linear systems Ax = b with complex symmetric coefficient matrices A = AT which arise, e.g., from the discretization of partial differential equations with complex coefficients. For the solution of such systems we present a new conjugate gradient-type iterative method, CSYM, which is based on unitary equivalence transformations of A to symmetric tridiagonal form. An analysis of CSYM shows that its convergence depends on the singular values of A and that it has both, the minimal residual property and constant costs per iteration step. We compare the algorithm with other methods for solving large sparse complex symmetric systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
