Solutions of symmetry-constrained least-squares problems
From MaRDI portal
Publication:3588917
DOI10.1002/nla.578zbMath1212.65181OpenAlexW2119945032MaRDI QIDQ3588917
No author found.
Publication date: 10 September 2010
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.578
convergencenumerical examplesiterative methodmatrix equationmatrix nearness problemminimum residual problemleast-squares problem
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
An efficient algorithm for the reflexive solution of the quaternion matrix equation \(AXB + CX^HD = F\) ⋮ An efficient method for solving a matrix least squares problem over a matrix inequality constraint ⋮ Iterative algorithm for solving a class of quaternion matrix equation over the generalized \((P, Q)\)-reflexive matrices ⋮ Least squares pure imaginary solution and real solution of the quaternion matrix equation \(A X B + C X D = E\) with the least norm
This page was built for publication: Solutions of symmetry-constrained least-squares problems
