A note on the Davison-Man method for Sylvester matrix equations

DOI10.1007/s40314-015-0244-1zbMath1360.65101OpenAlexW985441115MaRDI QIDQ520305

M. Hached

Publication date: 3 April 2017

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-015-0244-1

zbMATH Keywords

iterative methodSylvester equationKrylov subspacesDavison-Manextended block Arnoldi

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Matrix equations and identities (15A24) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05) Linear equations (linear algebraic aspects) (15A06)

Uses Software

• MATLAB expm
• Algorithm 432

Cites Work

• Unnamed Item
• Unnamed Item
• The Davison-Man method revisited
• An implicit preconditioning strategy for large-scale generalized Sylvester equations
• Extended Arnoldi methods for large low-rank Sylvester matrix equations
• Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization
• A new projection method for solving large Sylvester equations
• ADI preconditioned Krylov methods for large Lyapunov matrix equations
• On the ADI method for Sylvester equations
• Krylov-subspace methods for the Sylvester equation
• Block Krylov subspace methods for large algebraic Riccati equations
• Direct methods for matrix Sylvester and Lyapunov equations
• Sylvester's equation: Accuracy and computational stability
• Computing real low-rank solutions of Sylvester equations by the factored ADI method
• Approximation of the matrix exponential operator by a structure-preserving block Arnoldi-type method
• Low rank approximate solutions to large Sylvester matrix equations
• On the numerical solution of \(AX-XB=C\)
• Analysis of the Rational Krylov Subspace and ADI Methods for Solving the Lyapunov Equation
• An Error Analysis for Rational Galerkin Projection Applied to the Sylvester Equation
• A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
• Low rank solution of data‐sparse Sylvester equations
• A Hessenberg-Schur method for the problem AX + XB= C
• Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
• Krylov Subspace Methods for Solving Large Lyapunov Equations
• How and Why to Solve the Operator Equation AX −XB = Y
• Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
• Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
• A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
• The Scaling and Squaring Method for the Matrix Exponential Revisited
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• A preconditioned block Arnoldi method for large Sylvester matrix equations
• Matrix Equation $XA + BX = C$
• Iterative Refinement in Floating Point
• Block Krylov subspace methods for solving large Sylvester equations

This page was built for publication: A note on the Davison-Man method for Sylvester matrix equations