Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C
DOI10.1002/NLA.1971zbMATH Open1363.65079OpenAlexW1821094086MaRDI QIDQ3466254FDOQ3466254
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
algorithmserror boundsnumerical resultsleast squares solutionMoore-Penrose inversematrix equationMatlabverified computationnumerical enclosureINTLABminimum norm least squares solutionVERSOFT
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Matrix equations and identities (15A24) Algorithms with automatic result verification (65G20)
Cites Work
- Title not available (Why is that?)
- Hermitian and Nonnegative Definite Solutions of Linear Matrix Equations
- A polyhedral branch-and-cut approach to global optimization
- The Lorenz attractor exists
- Accuracy and Stability of Numerical Algorithms
- Singular value and generalized singular value decompositions and the solution of linear matrix 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\)
- Least-squares solutions and least-rank solutions of the matrix equation AXA * = B and their relations
- Ranks of Solutions of the Matrix Equation AXB = C
- Title not available (Why is that?)
- Fast enclosure for solutions of Sylvester equations
- Verified bounds for least squares problems and underdetermined linear systems
- Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
- Fast enclosure for solutions in underdetermined systems
- Componentwise enclosure for solutions of least squares problems and underdetermined systems
Cited In (1)
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- A fast algorithm of the minimal norm least squares solution for Loewner-type systems of equations 👍 👎
- Title not available (Why is that?) 👍 👎
- A fast algorithm of minimal norm least squares solution for Loewner-type linear system 👍 👎
- Least-squares solution with the minimum-norm for the matrix equation \(A^T XB + B^T X^T A = D\) and its applications 👍 👎
- Least squares solution with the minimum-norm to general matrix equations via iteration 👍 👎
- Norm-constrained least-squares solutions to the matrix equation \(A X B = C\) 👍 👎
- A fast algorithm of the minimal norm least squares solution for symmetric Loewner linear system 👍 👎
- Fast enclosing the solution set of the parametric Sylvester matrix equations 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3466254)
