Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C
From MaRDI portal
Publication:3466254
DOI10.1002/nla.1971zbMath1363.65079OpenAlexW1821094086MaRDI QIDQ3466254
Publication date: 1 February 2016
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.1971
algorithmsnumerical resultserror boundsMoore-Penrose inversematrix equationMatlableast squares solutionINTLABverified computationnumerical enclosureminimum norm least squares solutionVERSOFT
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fast enclosure for solutions of Sylvester equations
- Analogs of Cramer's rule for the minimum norm least squares solutions of some matrix equations
- On interval systems \([x = [A][x] + [b]\) and the powers of interval matrices in complex interval arithmetics]
- Ranks of least squares solutions of the matrix equation \(AXB=C\)
- Fast enclosure for solutions in underdetermined systems
- Singular value and generalized singular value decompositions and the solution of linear matrix equations
- A polyhedral branch-and-cut approach to global optimization
- Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
- Componentwise enclosure for solutions of least squares problems and underdetermined systems
- Verified Bounds for Least Squares Problems and Underdetermined Linear Systems
- Least-squares solutions and least-rank solutions of the matrix equation AXA * = B and their relations
- Hermitian and Nonnegative Definite Solutions of Linear Matrix Equations
- The Lorenz attractor exists
- Ranks of Solutions of the Matrix Equation AXB = C
- Accuracy and Stability of Numerical Algorithms
This page was built for publication: Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C
