A global variant of the COCR method for the complex symmetric Sylvester matrix equation \(AX+XB=C\)
From MaRDI portal
Publication:2027605
DOI10.1016/j.camwa.2021.04.026OpenAlexW3163404846MaRDI QIDQ2027605
Publication date: 27 May 2021
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2021.04.026
smoothing techniqueSylvester matrix equationcomplex symmetric matrixGl-COCR methodglobal complex symmetric \(\mathcal{M}\)-Lanczos process
Computational methods for sparse matrices (65F50) Matrix equations and identities (15A24) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items
A parametric approach of partial eigenstructure assignment for high-order linear systems via proportional plus derivative state feedback ⋮ Block-row and block-column iterative algorithms for solving linear matrix equation ⋮ A noise tolerant parameter-variable zeroing neural network and its applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theoretical results on the global GMRES method for solving generalized Sylvester matrix equations
- Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides
- On positive-definite and skew-Hermitian splitting iteration methods for continuous Sylvester equation \(AX+XB=C\)
- The modified conjugate gradient methods for solving a class of generalized coupled Sylvester-transpose matrix equations
- On normal and skew-Hermitian splitting iteration methods for large sparse continuous Sylvester equations
- A minimal residual norm method for large-scale Sylvester matrix equations
- Iterative algorithms for solving a class of complex conjugate and transpose matrix equations
- An efficient algorithm for solving general coupled matrix equations and its application
- Extended Arnoldi methods for large low-rank Sylvester matrix equations
- Finite iterative solutions to a class of complex matrix equations with conjugate and transpose of the unknowns
- LSQR iterative method for generalized coupled Sylvester matrix equations
- A COCR method for solving complex symmetric linear systems
- Oblique projection methods for linear systems with multiple right-hand sides
- A new projection method for solving large Sylvester equations
- Modified HSS iteration methods for a class of complex symmetric linear systems
- Preconditioning Helmholtz linear systems
- On the ADI method for Sylvester equations
- Inertia characteristics of self-adjoint matrix polynomials
- Iterative solution of the Lyapunov matrix equation
- Model reduction for control system design
- A convergence analysis of GMRES and FOM methods for Sylvester equations
- A matrix CRS iterative method for solving a class of coupled Sylvester-transpose matrix equations
- On modified HSS iteration methods for continuous Sylvester equations
- A generalization of the Hermitian and skew-Hermitian splitting iteration method for solving Sylvester equations
- Eigenanalysis of some preconditioned Helmholtz problems
- Global FOM and GMRES algorithms for matrix equations
- Optimal sampled-data control systems
- A generalized modified Hermitian and skew-Hermitian splitting (GMHSS) method for solving complex Sylvester matrix equation
- Preconditioning of complex linear systems from the Helmholtz equation
- An alternative extended block Arnoldi method for solving low-rank Sylvester equations
- On global Hessenberg based methods for solving Sylvester matrix equations
- The double-step scale splitting method for solving complex Sylvester matrix equation
- Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations
- A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications
- Computing real low-rank solutions of Sylvester equations by the factored ADI method
- On the global Krylov subspace methods for solving general coupled matrix equations
- New approaches for solving large Sylvester equations
- Low rank approximate solutions to large Sylvester matrix equations
- Convergence properties of some block Krylov subspace methods for multiple linear systems
- Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
- On Hermitian and Skew-Hermitian Splitting Ietration Methods for the Continuous Sylvester Equations
- Computational Methods for Linear Matrix Equations
- Block preconditioning of real-valued iterative algorithms for complex linear systems
- A Hessenberg-Schur method for the problem AX + XB= C
- Residual Smoothing Techniques for Iterative Methods
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- A Class of Iterative Solvers for the Helmholtz Equation: Factorizations, Sweeping Preconditioners, Source Transfer, Single Layer Potentials, Polarized Traces, and Optimized Schwarz Methods
- Real valued iterative methods for solving complex symmetric linear systems
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Gradient based iterative algorithms for solving a class of matrix equations
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- A preconditioned block Arnoldi method for large Sylvester matrix equations
- Explicit Solutions of Linear Matrix Equations
- Block Krylov subspace methods for solving large Sylvester equations
