An implicit preconditioning strategy for large-scale generalized Sylvester equations
From MaRDI portal
Publication:546059
DOI10.1016/j.amc.2011.03.148zbMath1218.65032OpenAlexW1981845727MaRDI QIDQ546059
Jean-Paul Chehab, Marcos Raydan
Publication date: 24 June 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.03.148
numerical experimentsmatrix functionsgeneralized Sylvester equationsdirect factorization methodsimplicit preconditioningKrylov-type iterative methodsresidual methods
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations ⋮ A residual approach for balanced truncation model reduction (BTMR) of compartmental systems ⋮ Sparse approximations of matrix functions via numerical integration of ODEs ⋮ Inexact Newton's method with inner implicit preconditioning for algebraic Riccati equations ⋮ Least-squares symmetric and skew-symmetric solutions of the generalized Sylvester matrix equation \(\sum_{i = 1}^s A_i X B_i + \sum_{j = 1}^t C_j Y D_j = E\) ⋮ A modified gradient based algorithm for solving Sylvester equations ⋮ The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\) ⋮ A note on the Davison-Man method for Sylvester matrix equations
Cites Work
- Convex constrained optimization for large-scale generalized Sylvester equations
- Block linear method for large scale Sylvester equations
- Implicitly preconditioned and globalized residual method for solving steady fluid flows
- Krylov-subspace methods for the Sylvester equation
- Iterative methods for \(X-AXB=C\)
- Global FOM and GMRES algorithms for matrix equations
- Krylov subspace methods for the generalized Sylvester equation
- Sylvester Tikhonov-regularization methods in image restoration
- A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications
- Implicit and adaptive inverse preconditioned gradient methods for nonlinear problems
- Projection methods for large Lyapunov matrix equations
- Low rank approximate solutions to large Sylvester matrix equations
- On the numerical solution of \(AX-XB=C\)
- R-linear convergence of the Barzilai and Borwein gradient method
- Numerical solution of large‐scale Lyapunov equations, Riccati equations, and linear‐quadratic optimal control problems
- Direct methods and ADI‐preconditioned Krylov subspace methods for generalized Lyapunov equations
- Two-Point Step Size Gradient Methods
- Accurate Solutions of Ill-Posed Problems in control theory
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- Preconditioned Krylov Subspace Methods for Lyapunov Matrix Equations
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- On the Barzilai and Borwein choice of steplength for the gradient method
- Block Krylov subspace methods for solving large Sylvester equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An implicit preconditioning strategy for large-scale generalized Sylvester equations
