The diagonal decomposition technique applied to the dynamic programming solution of elliptic partial differential equations

DOI10.1016/0022-247X(71)90071-0zbMath0227.49009OpenAlexW2089121195MaRDI QIDQ2549501

D. C. Collins, Edward S. Angel

Publication date: 1971

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(71)90071-0

Mathematics Subject Classification ID

Optimality conditions for problems involving partial differential equations (49K20) Dynamic programming in optimal control and differential games (49L20) Decomposition methods (49M27)

Related Items (3)

Discrete invariant imbedding and elliptic boundary-value problems over irregular regions ⋮ A one-sweep numerical method for vector-matrix difference equations with two-point boundary conditions ⋮ Invariant imbedding, difference equations, and elliptic boundary value problems

Cites Work

• Dynamic programming and linear partial differential equations
• Discrete invariant imbedding and elliptic boundary-value problems over irregular regions
• Reduction of dimensionality in dynamic programming via the method of diagonal decomposition
• Dimensional approximation in dynamic programming by structural decomposition
• Dynamic programming and Gaussian elimination
• A Method of Normalized Block Iteration
• Unnamed Item

This page was built for publication: The diagonal decomposition technique applied to the dynamic programming solution of elliptic partial differential equations