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.025zbMATH Open1136.65046OpenAlexW2016891181MaRDI QIDQ2480947FDOQ2480947
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
Recommendations
- A preconditioned block Arnoldi method for large Sylvester matrix equations
- A new projection method for solving large Sylvester equations
- Low rank approximate solutions to large Sylvester matrix equations
- On the numerical solution of large scale Sylvester matrix equations
- New approaches for solving large Sylvester equations
Cites Work
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel iterative methods for sparse linear systems
- A Hessenberg-Schur method for the problem AX + XB= C
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- Title not available (Why is that?)
- A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
- Low Rank Solution of Lyapunov Equations
- Title not available (Why is that?)
- Block Krylov subspace methods for solving large Sylvester equations
- On the numerical solution of \(AX-XB=C\)
- Krylov-subspace methods for the Sylvester equation
- The Sylvester equation and approximate balanced reduction
- Oblique Production Methods for Large Scale Model Reduction
- Exact and inexact breakdowns in the block GMRES method
- A convergence analysis of GMRES and FOM methods for Sylvester equations
- Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
Cited In (7)
- A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
- 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
- On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems
- An iterative method for solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices
- An efficient algorithm for solving general coupled matrix equations and its application
- On the reflexive and anti-reflexive solutions of the generalised coupled Sylvester matrix equations
Uses Software
This page was built for publication: Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480947)
