A modified HSS iteration method for solving the complex linear matrix equation AXB = C
From MaRDI portal
Publication:5276752
DOI10.4208/JCM.1601-M2015-0416zbMATH Open1374.65077OpenAlexW2465087040MaRDI QIDQ5276752FDOQ5276752
Author name not available (Why is that?)
Publication date: 14 July 2017
Published in: Journal of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4208/jcm.1601-m2015-0416
Recommendations
- On Hermitian and skew-Hermitian splitting iteration methods for the linear matrix equation \(AXB=C\)
- Parameterized preconditioned Hermitian and skew-Hermitian splitting iteration method for a class of linear matrix equations
- A generalized modified Hermitian and skew-Hermitian splitting (GMHSS) method for solving complex Sylvester matrix equation
- Modified HSS iteration methods for a class of complex symmetric linear systems
- Two-step AOR iteration method for the linear matrix equation \(AXB=C\)
numerical resultslinear matrix equationmodified Hermitian and skew-Hermitian splitting iteration method
Cited In (26)
- A generalized two-step modulus-based matrix splitting iteration method for implicit complementarity problems of H+-matrices
- Efficient single-step preconditioned HSS iteration methods for complex symmetric linear systems
- A single-step iteration method for non-Hermitian positive definite linear systems
- A new single-step iteration method for solving complex symmetric linear systems
- A randomized block Douglas-Rachford method for solving linear matrix equation
- Some relaxed iteration methods for solving matrix equation \(AXB=C\)
- Commuting solutions of the Yang-Baxter-like matrix equation for a class of rank-two updated matrices
- On preconditioned normal and skew-Hermitian splitting iteration method for continuous Sylvester equations AX + XB = C*
- Efficient preconditioned NHSS iteration methods for solving complex symmetric linear systems
- Shift-splitting iteration methods for a class of large sparse linear matrix equations
- Solving shifted linear systems with restarted GMRES augmented with error approximations
- Inverse eigenvalue problems for discrete gyroscopic systems
- Title not available (Why is that?)
- On the parameterized two-step iteration method for solving the matrix equation \(AXB=C\)
- Preconditioned Positive-Definite and Skew-Hermitian Splitting Iteration Methods for Continuous Sylvester Equations AX + XB = C
- The parameterized accelerated iteration method for solving the matrix equation \(AXB=C\)
- The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
- The nonlinear lopsided HSS-like modulus-based matrix splitting iteration method for linear complementarity problems with positive-definite matrices
- A high-order Lie groups scheme for solving the recovery of external force in nonlinear system
- An efficient two-step iterative method for solving a class of complex symmetric linear systems
- On the commuting solutions to the Yang-Baxter-like matrix equation for identity matrix minus special rank-two matrices
- Global-DGMRES method for matrix equationAXB = C
- Generalized AOR method for solving a class of generalized saddle point problems
- The generalized C-to-R method for solving complex symmetric indefinite linear systems
- Linear constraint problem of Hermitian unitary symplectic matrices
- Preconditioned HSS iteration method and its non-alternating variant for continuous Sylvester equations
This page was built for publication: A modified HSS iteration method for solving the complex linear matrix equation \(AXB = C\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276752)