A note on the Davison-Man method for Sylvester matrix equations
DOI10.1007/S40314-015-0244-1zbMATH Open1360.65101OpenAlexW985441115MaRDI QIDQ520305FDOQ520305
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
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
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)
Cites Work
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Title not available (Why is that?)
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- A Hessenberg-Schur method for the problem AX + XB= C
- How and Why to Solve the Operator Equation AX −XB = Y
- Title not available (Why is that?)
- Block Krylov subspace methods for large algebraic Riccati equations
- Analysis of the rational Krylov subspace and ADI methods for solving the Lyapunov equation
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- Low rank solution of data-sparse Sylvester equations
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
- A preconditioned block Arnoldi method for large Sylvester matrix equations
- 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
- Direct methods for matrix Sylvester and Lyapunov equations
- Computing real low-rank solutions of Sylvester equations by the factored ADI method
- Low rank approximate solutions to large Sylvester matrix equations
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- Block Krylov subspace methods for solving large Sylvester equations
- The Scaling and Squaring Method for the Matrix Exponential Revisited
- Extended Arnoldi methods for large low-rank Sylvester matrix equations
- On the numerical solution of \(AX-XB=C\)
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Krylov-subspace methods for the Sylvester equation
- Matrix Equation $XA + BX = C$
- An implicit preconditioning strategy for large-scale generalized Sylvester equations
- The Davison-Man method revisited
- An error analysis for rational Galerkin projection applied to the Sylvester equation
- Sylvester's equation: Accuracy and computational stability
- Approximation of the matrix exponential operator by a structure-preserving block Arnoldi-type method
- Iterative Refinement in Floating Point
- Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization
Cited In (1)
Uses Software
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)
