A parallel preconditioned modified conjugate gradient method for large Sylvester matrix equation
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1341938
- On the numerical solution of large scale Sylvester matrix equations
- A preconditioned block Arnoldi method for large Sylvester matrix equations
- Preconditioned Galerkin and minimal residual methods for solving Sylvester equations
- A parallel two-stage iteration method for solving continuous Sylvester equations
Cites work
- A new projection method for solving large Sylvester equations
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation \(AXB\)=\(C\)
- An iterative algorithm for solving a pair of matrix equations \(AYB=E\), \(CYD=F\) over generalized centro-symmetric matrices
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Approximation of Large-Scale Dynamical Systems
- Block Krylov subspace methods for solving large Sylvester equations
- Cross-Gramian based model reduction for data-sparse systems
- scientific article; zbMATH DE number 5733269 (Why is no real title available?)
- scientific article; zbMATH DE number 1999210 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- On Iterative Solutions of General Coupled Matrix Equations
- The ADI minimax problem for complex spectra
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- The Sylvester equation and approximate balanced reduction
This page was built for publication: A parallel preconditioned modified conjugate gradient method for large Sylvester matrix equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1718751)
