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

DOI10.1007/S40314-015-0244-1MaRDI QIDQ520305zbMATH OpenOpenAlexFDO

Authors 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

Krylov subspacesiterative methodSylvester equationDavison-Manextended block Arnoldi

Mathematics Subject Classification ID

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

Recommendations

• The Davison-Man method revisited
• Improvement of Bartels-Stewart method for matrix Sylvester equation
• On the numerical solution of large scale Sylvester matrix equations
• A note about the solution of matrix Sylvester equation
• A new version of successive approximations method for solving Sylvester matrix equations

Cites work

• scientific article; zbMATH DE number 1024452 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (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 New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
• A new projection method for solving large Sylvester equations
• A preconditioned block Arnoldi method for large Sylvester matrix equations
• ADI preconditioned Krylov methods for large Lyapunov matrix equations
• Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
• An error analysis for rational Galerkin projection applied to the Sylvester equation
• An implicit preconditioning strategy for large-scale generalized Sylvester equations
• Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization
• Analysis of the rational Krylov subspace and ADI methods for solving the Lyapunov equation
• Approximation of the matrix exponential operator by a structure-preserving block Arnoldi-type method
• Block Krylov subspace methods for large algebraic Riccati equations
• Block Krylov subspace methods for solving large Sylvester equations
• Computing real low-rank solutions of Sylvester equations by the factored ADI method
• Direct methods for matrix Sylvester and Lyapunov equations
• Extended Arnoldi methods for large low-rank Sylvester matrix equations
• Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
• How and Why to Solve the Operator Equation AX −XB = Y
• Iterative Refinement in Floating Point
• Krylov Subspace Methods for Solving Large Lyapunov Equations
• Krylov-subspace methods for the Sylvester equation
• Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
• Low rank approximate solutions to large Sylvester matrix equations
• Low rank solution of data-sparse Sylvester equations
• Matrix Equation $XA + BX = C$
• Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
• On the ADI method for Sylvester equations
• On the numerical solution of \(AX-XB=C\)
• Sylvester's equation: Accuracy and computational stability
• The Davison-Man method revisited
• The Scaling and Squaring Method for the Matrix Exponential Revisited

Cited in

(1)

• The Davison-Man method revisited

Describes a project that uses

Uses Software

• MATLAB expm
• Algorithm 432

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520305)