Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations

DOI10.1016/J.APNUM.2007.01.025MaRDI QIDQ2480947zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

zbMATH Keywords

numerical examplesSylvester equationsblock GMRESblock Arnoldi algorithminexact breakdowns

Mathematics Subject Classification ID

Matrix equations and identities (15A24)

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

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 1999210 (Why is no real title available?)
• scientific article; zbMATH DE number 4187010 (Why is no real title available?)
• A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
• A Hessenberg-Schur method for the problem AX + XB= C
• A convergence analysis of GMRES and FOM methods for Sylvester equations
• Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
• Block Krylov subspace methods for solving large Sylvester equations
• Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
• Exact and inexact breakdowns in the block GMRES method
• Krylov Subspace Methods for Solving Large Lyapunov Equations
• Krylov-subspace methods for the Sylvester equation
• Low Rank Solution of Lyapunov Equations
• Oblique Production Methods for Large Scale Model Reduction
• On the numerical solution of \(AX-XB=C\)
• Parallel iterative methods for sparse linear systems
• The Sylvester equation and approximate balanced reduction

Cited in

(7)

• On the reflexive and anti-reflexive solutions of the generalised coupled Sylvester matrix equations
• On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems
• A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
• An iterative method for solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices
• An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation
• Extended Arnoldi methods for large low-rank Sylvester matrix equations
• An efficient algorithm for solving general coupled matrix equations and its application

Describes a project that uses

Uses Software

• Algorithm 432

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)