A new version of successive approximations method for solving Sylvester matrix equations
From MaRDI portal
(Redirected from Publication:876643)
Recommendations
- A new parameter iterative method for solving Sylvester matrix equation \(AXB^T + BXA^T = F\)
- Block linear method for large scale Sylvester equations
- Minimal residual methods augmented with eigenvectors for solving Sylvester equations and generalized Sylvester equations
- A Hessenberg method for the numerical solutions to types of block Sylvester matrix equations
- A relaxed gradient based algorithm for solving Sylvester equations
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- 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]
- Approximate inverse preconditioner by computing approximate solution of Sylvester equation
- Block Krylov subspace methods for solving large Sylvester equations
- Explicit Solutions of Linear Matrix Equations
- Fields of values and iterative methods
- Fields of values and the ADI method for non-normal matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations
- Iterative Solution Methods
- Krylov-subspace methods for the Sylvester equation
- On the numerical solution of \(AX-XB=C\)
- The Sensitivity of the Stable Lyapunov Equation
Cited in
(20)- Solving SDGE models: a new algorithm for the Sylvester equation
- New SOR-like methods for solving the Sylvester equation
- Gradient-descent iterative algorithm for solving a class of linear matrix equations with applications to heat and Poisson equations
- A Hessenberg method for the numerical solutions to types of block Sylvester matrix equations
- The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)
- Solutions to a family of matrix equations by using the Kronecker matrix polynomials
- Iterative procedure for the solution of Sylvester generalized matrix equation
- On RGI algorithms for solving Sylvester tensor equations
- LSQR iterative common symmetric solutions to matrix equations \(AXB = E\) and \(CXD = F\)
- A modified gradient based algorithm for solving Sylvester equations
- A generalization of Jameson's method for Sylvester's matrix equation
- A new parameter iterative method for solving Sylvester matrix equation \(AXB^T + BXA^T = F\)
- A note on the Davison-Man method for Sylvester matrix equations
- On two classes of mixed-type Lyapunov equations
- Sherman-Morrison-Woodbury formula for Sylvester and \(T\)-Sylvester equations with applications
- The dynamical functional particle method for multi-term linear matrix equations
- New results of the IO iteration algorithm for solving Sylvester matrix equation
- Approximate inverse preconditioner by computing approximate solution of Sylvester equation
- A new version of the Smith method for solving Sylvester equation and discrete-time Sylvester equation
- Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle
This page was built for publication: A new version of successive approximations method for solving Sylvester matrix equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876643)
