A preconditioned conjugate gradient method for ax + xb = c

DOI10.1080/00207169308804232zbMath0802.65030OpenAlexW1982510549MaRDI QIDQ4297208

Chunru Wan, David J. Evans

Publication date: 18 December 1994

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169308804232

zbMATH Keywords

complexitynumerical experimentspreconditionersPoisson equationfinite differenceconjugate gradientSylvester matrix equationlarge sparse matrices

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Finite difference methods for boundary value problems involving PDEs (65N06)

Related Items (2)

Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning ⋮ An iterative method for solving the continuous sylvester equation by emphasizing on the skew-hermitian parts of the coefficient matrices

Cites Work

• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• Matrix Equation $XA + BX = C$
• Unnamed Item

This page was built for publication: A preconditioned conjugate gradient method for ax + xb = c