An efficient algorithm for Hamilton-Jacobi equations in high dimension

From MaRDI portal
Publication:1780937

DOI10.1007/s00791-004-0124-5zbMath1070.65072OpenAlexW2076729694MaRDI QIDQ1780937

Elisabetta Carlini, Maurizio Falcone, Roberto G. Ferretti

Publication date: 14 June 2005

Published in: Computing and Visualization in Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00791-004-0124-5




Related Items

Optimal Bounds for Numerical Approximations of Infinite Horizon Problems Based on Dynamic Programming ApproachA convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matricesConvergence of meshfree collocation methods for fully nonlinear parabolic equationsA sparse Markov chain approximation of LQ-type stochastic control problems.Max-plus summation of Fenchel-transformed semigroups for solution of nonlinear Bellman equationsApplication of optimal control techniques and advanced computing to the study of enzyme kineticsHJB-RBF based approach for the control of PDEsNumerical solution to optimal feedback control by dynamic programming approach: a local approximation algorithmRecent Results in the Approximation of Nonlinear Optimal Control ProblemsHamilton–Jacobi–Bellman EquationsAn adaptive sparse grid semi-Lagrangian scheme for first order Hamilton-Jacobi Bellman equationsNumerical solution to the optimal feedback control of continuous casting processSuboptimal feedback control of PDEs by solving HJB equations on adaptive sparse gridsUsing dynamic programming with adaptive grid scheme for optimal control problems in economicsAn approximation scheme for stochastic controls in continuous timeError estimation and adaptive discretization for the discrete stochastic Hamilton-Jacobi-Bellman equationOptimal control of molecular dynamics using Markov state modelsAn Efficient DP Algorithm on a Tree-Structure for Finite Horizon Optimal Control ProblemsLocal Minimization Algorithms for Dynamic Programming EquationsFully-Discrete Schemes for the Value Function of Pursuit-Evasion Games with State ConstraintsApproximation schemes for solving disturbed control problems with non-terminal time and state constraintsOn quadratic approximations for Hamilton-Jacobi-Bellman equationsValue iteration convergence of \(\varepsilon\)-monotone schemes for stationary Hamilton-Jacobi equationsDynamic programming using radial basis functions


Uses Software


Cites Work