Krylov-subspace methods for the Sylvester equation
From MaRDI portal
Publication:1194527
DOI10.1016/0024-3795(92)90031-5zbMath0777.65028MaRDI QIDQ1194527
Publication date: 27 September 1992
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(92)90031-5
Krylov subspace method; parallel computers; Sylvester matrix equation; Arnoldi process; Galerlin method; minimal residual algorithms
DB lookup for MSC labels failed
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative solution of the Lyapunov matrix equation
- Controllability, observability and the solution of AX-XB=C
- SOR for \(AX-XB=C\)
- Adaptive Lanczos methods for recursive condition estimation
- Nonsingular solutions of TA-BT=C
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
- Krylov Subspace Methods on Supercomputers
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Alternating Direction Implicit Methods
- A Hessenberg-Schur method for the problem AX + XB= C
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Alternating Direction Implicit Iteration for Systems with Complex Spectra
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- A Newton basis GMRES implementation
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
