Solving shortest length least-squares problems via dynamic programming (Q1896574)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving shortest length least-squares problems via dynamic programming |
scientific article; zbMATH DE number 792458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving shortest length least-squares problems via dynamic programming |
scientific article; zbMATH DE number 792458 |
Statements
Solving shortest length least-squares problems via dynamic programming (English)
0 references
18 February 1996
0 references
principle of optimality
0 references
rank-deficient matrices
0 references
shortest solution
0 references
least-squares problem
0 references
sequential fashion
0 references
0.8444077968597412
0 references
0.753871500492096
0 references
