Dynamic programming and pseudo-inverses

DOI10.1016/S0096-3003(02)00191-1MaRDI QIDQ1406191zbMATH OpenOpenAlexFDO

Authors Yueyue Fan, R. E. Kalaba

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 examplespseudo-inversesDynamic programmingLeast squaresGeneralized inverseGreville's algorithm

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites work

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

Cited in

(12)

• Arriving on time
• From dynamic programming to bynamic programming
• Differentiation of generalized inverses for rational and polynomial matrices
• Is analytical dynamics a theoretical or an experimental science?
• Dynamic programming and diagnostic classification
• Symbolic and recursive computation of different types of generalized inverses
• On the connections between PCTL and dynamic programming
• Dynamic programming and inequalities
• About the generalized LM-inverse and the weighted Moore-Penrose inverse
• Symbolic computation of weighted Moore-Penrose inverse using partitioning method
• Two dynamic programming algorithms for which interpreted pebbling helps
• Effective partitioning method for computing weighted Moore-Penrose inverse

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406191)