Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations
From MaRDI portal
Publication:2480947
DOI10.1016/j.apnum.2007.01.025zbMath1136.65046MaRDI QIDQ2480947
Publication date: 7 April 2008
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2007.01.025
15A24: Matrix equations and identities
Related Items
A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line, An efficient algorithm for solving general coupled matrix equations and its application, Extended Arnoldi methods for large low-rank Sylvester matrix equations, An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation, An iterative method for solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices, On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems, On the reflexive and anti-reflexive solutions of the generalised coupled Sylvester matrix equations
Uses Software
Cites Work
- Exact and inexact breakdowns in the block GMRES method
- Krylov-subspace methods for the Sylvester equation
- Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
- A convergence analysis of GMRES and FOM methods for Sylvester equations
- The Sylvester equation and approximate balanced reduction
- On the numerical solution of \(AX-XB=C\)
- A Hessenberg-Schur method for the problem AX + XB= C
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
- Low Rank Solution of Lyapunov Equations
- Oblique Production Methods for Large Scale Model Reduction
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Block Krylov subspace methods for solving large Sylvester equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
