Developing the CGLS algorithm for the least squares solutions of the general coupled matrix equations
From MaRDI portal
Publication:5256507
DOI10.1002/mma.3017zbMath1323.65041OpenAlexW2115559787MaRDI QIDQ5256507
Publication date: 17 June 2015
Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mma.3017
linear systemconjugate gradient methodleast squares methodgeneral coupled matrix equationsconjugate gradient least squares (CGLS) methodblock system
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (19)
Convergence Results of the Biconjugate Residual Algorithm for Solving Generalized Sylvester Matrix Equation ⋮ Least squares solution of the linear operator equation ⋮ Symmetric solutions of the coupled generalized Sylvester matrix equations via BCR algorithm ⋮ Generalized conjugate direction algorithm for solving the general coupled matrix equations over symmetric matrices ⋮ An iterative algorithm for the least Frobenius norm Hermitian and generalized skew Hamiltonian solutions of the generalized coupled Sylvester-conjugate matrix equations ⋮ Matrix form of Biconjugate Residual Algorithm to Solve the Discrete‐Time Periodic Sylvester Matrix Equations ⋮ Biconjugate residual algorithm for solving general Sylvester-transpose matrix equations ⋮ A shifted complex global Lanczos method and the quasi-minimal residual variant for the Stein-conjugate matrix equation \(X + A \overline{X} B = C\) ⋮ On the least squares generalized Hamiltonian solution of generalized coupled Sylvester-conjugate matrix equations ⋮ New Finite Algorithm for Solving the Generalized Nonhomogeneous Yakubovich-Transpose Matrix Equation ⋮ Generalized reflexive and anti-reflexive solutions of the coupled Sylvester matrix equations via CD algorithm ⋮ An iterative algorithm for generalized Hamiltonian solution of a class of generalized coupled Sylvester-conjugate matrix equations ⋮ On the convergence of conjugate direction algorithm for solving coupled Sylvester matrix equations ⋮ A numerical solution of a class of periodic coupled matrix equations ⋮ An iterative algorithm for solving the generalized Sylvester-conjugate matrix equation ⋮ Developing BiCOR and CORS methods for coupled Sylvester-transpose and periodic Sylvester matrix equations ⋮ Computing symmetric solutions of general Sylvester matrix equations via Lanczos version of biconjugate residual algorithm ⋮ GRADIENT BASED ITERATIVE ALGORITHM TO SOLVE GENERAL COUPLED DISCRETE-TIME PERIODIC MATRIX EQUATIONS OVER GENERALIZED REFLEXIVE MATRICES ⋮ Modified CGLS iterative algorithm for solving the generalized Sylvester-conjugate matrix equation
Uses Software
Cites Work
- Finite iterative algorithms for solving generalized coupled Sylvester systems. I: One-sided and generalized coupled Sylvester matrix equations over generalized reflexive solutions
- Finite iterative algorithms for solving generalized coupled Sylvester systems. II: Two-sided and generalized coupled Sylvester matrix equations over reflexive solutions
- Analysis of an iterative algorithm to solve the generalized coupled Sylvester matrix equations
- Finite iterative algorithms for a common solution to a group of complex matrix equations
- LSQR iterative method for generalized coupled Sylvester matrix equations
- Consistency for bi(skew)symmetric solutions to systems of generalized Sylvester equations over a finite central algebra
- Stability by Liapunov's direct method. With applications
- The general coupled matrix equations over generalized bisymmetric matrices
- Linear restriction problem of Hermitian reflexive matrices and its approximation
- The reflexive and anti-reflexive solutions of a linear matrix equation and systems of matrix equations
- Weighted least squares solutions to general coupled Sylvester matrix equations
- Ranks and the least-norm of the general solution to a system of quaternion matrix equations
- Gradient based iterative algorithm for solving coupled matrix equations
- Computing stable eigendecompositions of matrix pencils
- A system of matrix equations and a linear matrix equation over arbitrary regular rings with identity
- The generalized QMRCGSTAB algorithm for solving Sylvester-transpose matrix equations
- On the generalized Sylvester mapping and matrix equations
- Bisymmetric and centrosymmetric solutions to systems of real quaternion matrix equations
- The general solution to a system of real quaternion matrix equations
- Iterative least-squares solutions of coupled sylvester matrix equations
- Numerical solution of \(AXB=C\) for \((R,S)\)-symmetric matrices
- On approximation problems with zero-trace matrices
- Preconditioners for nonsymmetric block Toeplitz-like-plus-diagonal linear systems
- On Hermitian and Skew-Hermitian Splitting Ietration Methods for the Continuous Sylvester Equations
- Numerical solutions of AXB = C for centrosymmetric matrix X under a specified submatrix constraint
- On the generalized bisymmetric and skew-symmetric solutions of the system of generalized Sylvester matrix equations
- On Iterative Solutions of General Coupled Matrix Equations
- An iterative algorithm for a least squares solution of a matrix equation
- Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- Inverse Problem of Linear Optimal Control
- Generalized Schur methods with condition estimators for solving the generalized Sylvester equation
- On the solution to the Sylvester matrix equation AV+BW=EVF
- Two parametric approaches for eigenstructure assignment in second-order linear systems
- Gradient based iterative algorithms for solving a class of matrix equations
- Solution to the second-order Sylvester matrix equation MVF/sup 2/+DVF+KV=BW
- On Preconditioned Iterative Methods for Burgers Equations
This page was built for publication: Developing the CGLS algorithm for the least squares solutions of the general coupled matrix equations