The parameterized accelerated iteration method for solving the matrix equation AXB=C
From MaRDI portal
The parameterized accelerated iteration method for solving the matrix equation \(AXB=C\)
Recommendations
- On the parameterized two-step iteration method for solving the matrix equation AXB=C
- Some relaxed iteration methods for solving matrix equation \(AXB=C\)
- The optimal parameter analysis on parameter iterative method for solving matrix equation
- On parameter iterative method for solving matrix equation AXB+CXD=F.
- The Jacobi and Gauss-Seidel-type iteration methods for the matrix equation A X B = C
Cites work
- A modified HSS iteration method for solving the complex linear matrix equation \(AXB = C\)
- An iterative method for the skew-symmetric solution and the optimal approximate solution of the matrix equation \(AXB=C\)
- Analysis and design of optimization algorithms via integral quadratic constraints
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- scientific article; zbMATH DE number 3720254 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 1932411 (Why is no real title available?)
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- Kronecker Products, Unitary Matrices and Signal Processing Applications
- Matrix Analysis and Computations
- Matrix iterative analysis
- Modified HSS iteration methods for a class of complex symmetric linear systems
- More on modifications and improvements of classical iterative schemes for \(M\)-matrices
- On Hermitian and skew-Hermitian splitting iteration methods for the linear matrix equation \(AXB=C\)
- On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation A X B = C
- On the parameterized two-step iteration method for solving the matrix equation AXB=C
- Progressive iterative approximation for regularized least square bivariate B-spline surface fitting
- Some methods of speeding up the convergence of iteration methods
- Some relaxed iteration methods for solving matrix equation \(AXB=C\)
- Some remarks on Jacobi and Gauss-Seidel-type iteration methods for the matrix equation \(A X B = C\)
- Stationary splitting iterative methods for the matrix equation AXB=C
- The general inner-outer iteration method based on regular splittings for the PageRank problem
- The Jacobi and Gauss-Seidel-type iteration methods for the matrix equation A X B = C
- Two-step AOR iteration method for the linear matrix equation AXB=C
Cited in
(4)- On the parameterized two-step 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
- New gradient-based iterative-like algorithms for solving a class of Sylvester tensor equations
- Several accelerated gradient-based iteration methods for solving AXB=C with application to tensor surface fitting
This page was built for publication: The parameterized accelerated iteration method for solving the matrix equation \(AXB=C\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618231)