Factorization of second-order elliptic boundary value problems by dynamic programming

DOI10.1016/j.na.2004.05.022zbMath1114.35059OpenAlexW2004340777MaRDI QIDQ1763680

Jacques Henry, Angel Manuel Ramos

Publication date: 22 February 2005

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2004.05.022

zbMATH Keywords

Riccati equationFactorizationBoundary value problemInvariant embeddingDirichlet-to-Neumann (DtN) operatorNeumann-to-Dirichlet (NtD) operator

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Boundary value problems for second-order elliptic equations (35J25) Discrete approximations in optimal control (49M25)

Related Items (9)

A factorization method for elliptic problems in a circular domain ⋮ Adaptive Runge-Kutta regularization for a Cauchy problem of a modified Helmholtz equation ⋮ Factorization of linear elliptic boundary value problems in non-cylindrical domains ⋮ New interpretation of elliptic Boundary value problems via invariant embedding approach and Yosida regularization ⋮ Factorization by Invariant Embedding of a Boundary Value Problem for the Laplace Operator ⋮ Analysis of the factorization method for elliptic differential equations ⋮ Study of the initial value problems appearing in a method of factorization of second-order elliptic boundary value problems ⋮ Missing boundary data reconstruction by the factorization method ⋮ Analysis of the ECGI inverse problem solution with respect to the measurement boundary size and the distribution of noise

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• One-way large range step methods for Helmholtz waveguides
• Initial-value transformations for elliptic boundary value problems

This page was built for publication: Factorization of second-order elliptic boundary value problems by dynamic programming