𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An iterative algorithm for a least squares solution of a matrix equation

✍ Scribed by Wang, Minghui; Wei, Musheng; Feng, Yan

Book ID
115490456
Publisher
Taylor and Francis Group
Year
2010
Tongue
English
Weight
161 KB
Volume
87
Category
Article
ISSN
0020-7160

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An iterative algorithm for the least squ
An iterative algorithm for the least squares bisymmetric solutions of the matrix equations
✍ Jing Cai; Guoliang Chen πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 555 KB

In this paper, an iterative algorithm is constructed to solve the minimum Frobenius norm residual problem: min over bisymmetric matrices. By this algorithm, for any initial bisymmetric matrix X 0 , a solution X \* can be obtained in finite iteration steps in the absence of roundoff errors, and the

Dykstra's Algorithm for a Constrained Le
Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
✍ RenΓ© Escalante; Marcos Raydan πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 577 KB

We apply Dykstra's alternating projection algorithm to the constrained least-squares matrix problem that arises naturally in statistics and mathematical economics. In particular, we are concerned with the problem of finding the closest symmetric positive definite bounded and patterned matrix, in the