𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dynamic programming and minimal norm solutions of least squares problems

✍ Scribed by R. Kalaba; H. Natsuyama


Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
433 KB
Volume
48
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Approximating minimum norm solutions of
✍ Achiya Dax; Lars EldΓ©n πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 133 KB πŸ‘ 2 views

In this paper we consider the solution of linear least squares problems min x Ax -b 2 2 where the matrix A ∈ R mΓ—n is rank deficient. Put p = min{m, n}, let Οƒ i , i = 1, 2, . . . , p, denote the singular values of A, and let u i and v i denote the corresponding left and right singular vectors. Then

Least Squares Approximate and Least Norm
✍ Frank-Olme Speck πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 977 KB

Suinmary. Paired operators T = d , P + A 2 & on a HILBERT spzce are studied where P is a projector, P+Q = I , and the coefficients are linear invertible operators. The MOORE-PENXOSE inverse of T can be obtained explicitly from a factorization of the coefficients, which is equivalent to the normal so

Solutions of symmetry-constrained least-
✍ Zhen-Yun Peng πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 161 KB

## Abstract In this paper, two new matrix‐form iterative methods are presented to solve the least‐squares problem: and matrix nearness problem: where matrices $A\in R^{p\times n\_1},B\in R^{n\_2\times q},C\in R^{p\times m\_1},D\in R^{m\_2\times q},E\in R^{p\times q},\widetilde{X}\in R^{n\_1\time

Recursive penalized least squares soluti
✍ Okito Yamashita; Andreas Galka; Tohru Ozaki; Rolando Biscay; Pedro Valdes-Sosa πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 684 KB

## Abstract In the dynamical inverse problem of electroencephalogram (EEG) generation where a specific dynamics for the electrical current distribution is assumed, we can impose general spatiotemporal constraints onto the solution by casting the problem into a state space representation and assumin