A modified HSS iteration method for solving the complex linear matrix equation AXB = C
From MaRDI portal
Publication:5276752
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
Cited in
(28)- Preconditioned HSS iteration method and its non-alternating variant for continuous Sylvester equations
- 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
- Some relaxed iteration methods for solving matrix equation \(AXB=C\)
- A randomized block Douglas-Rachford method for solving linear matrix equation
- A generalized two-step modulus-based matrix splitting iteration method for implicit complementarity problems of H_+-matrices
- Commuting solutions of the Yang-Baxter-like matrix equation for a class of rank-two updated matrices
- 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
- scientific article; zbMATH DE number 7589107 (Why is no real title available?)
- On the parameterized two-step iteration method for solving the matrix equation AXB=C
- The parameterized accelerated iteration method for solving the matrix equation AXB=C
- A unified preconditioned minimal residual (PMR) algorithm for matrix problems: linear systems, multiple right-hand sides linear systems, least squares problems, inversion and pseudo-inversion with application to color image encryption
- The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
- The quaternion relaxed greedy randomized Kaczmarz method with adaptive parameters for solving quaternion matrix equation
- 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
- Preconditioned positive-definite and skew-Hermitian splitting iteration methods for continuous Sylvester equations AX+XB=C
- On preconditioned normal and skew-Hermitian splitting iteration method for continuous Sylvester equations AX + XB = C^
- 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
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)
