Dynamic programming and pseudo-inverses

DOI10.1016/S0096-3003(02)00191-1zbMath1027.65046OpenAlexW2083659424MaRDI QIDQ1406191

Robert E. Kalaba, Yueyue Fan

Publication date: 9 September 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(02)00191-1

zbMATH Keywords

numerical examplesDynamic programmingpseudo-inversesLeast squaresGeneralized inverseGreville's algorithm

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (8)

Symbolic computation of weighted Moore-Penrose inverse using partitioning method ⋮ Effective partitioning method for computing weighted Moore-Penrose inverse ⋮ Symbolic and recursive computation of different types of generalized inverses ⋮ About the generalized \(LM\)-inverse and the weighted Moore-Penrose inverse ⋮ Differentiation of generalized inverses for rational and polynomial matrices ⋮ Arriving on time ⋮ Dynamic programming and diagnostic classification ⋮ Is analytical dynamics a theoretical or an experimental science?

Cites Work

• Algorithms for generalized inverses
• An alternative proof of the Greville formula
• Dynamic programming and minimal norm solutions of least squares problems
• Solving shortest length least-squares problems via dynamic programming
• ON A NEW APPROACH TO THE NUMERICAL SOLUTION OF A CLASS OF PARTIAL DIFFERENTIAL INTEGRAL EQUATIONS OF TRANSPORT THEORY

This page was built for publication: Dynamic programming and pseudo-inverses