Symbolic-Numeric Computation of Integrals in Successive Galerkin Approximation of Hamilton-Jacobi-Bellman Equation
This paper proposes an efficient symbolic-numeric method to compute the integrals in the successive Galerkin approximation (SGA) of the Hamilton-Jacobi-Bellman (HJB) equation. A solution of the HJB equation is first approximated with a linear combination of the Hermite polynomials. The coefficients of the combination are then computed by iteratively solving a linear equation, which consists of the integrals of the Hermite polynomials multiplied by nonlinear functions. The recursive structure of the Hermite polynomials is inherited by the integrals, and their recurrence relations can be computed by using the symbolic computation of differential operators. By using the recurrence relations, all the integrals can be computed from a part of them that are numerically evaluated. A numerical example is provided to show the efficiency of the proposed method compared to a standard numerical integration method.
Code (0)
등록된 구현이 없습니다.
Tasks
Numerical IntegrationSimilar Papers 제목 키워드 기반
Computing Anti-Derivatives using Deep Neural Networks
This paper presents a novel algorithm to obtain the closed-form anti-derivative of a function using Deep Neural Network architecture. In the past, mathematicians have developed several numerical techniques to approximate…
FormPricing European and American Options under Heston Model using Discontinuous Galerkin Finite Elements
This paper deals with pricing of European and American options, when the underlying asset price follows Heston model, via the interior penalty discontinuous Galerkin finite element method (dGFEM). The advantages of dGFEM…
Uncovering Singularities in Feynman Integrals via Machine Learning
We introduce a machine-learning framework based on symbolic regression to extract the full symbol alphabet of multi-loop Feynman integrals. By targeting the analytic structure rather than reduction, the method is broadly…
Learning, Solving and Optimizing PDEs with TensorGalerkin: an efficient high-performance Galerkin assembly algorithm
We present a unified algorithmic framework for the numerical solution, constrained optimization, and physics-informed learning of PDEs with a variational structure. Our framework is based on a Galerkin discretization of …
Computational EfficiencyDGNN: A Neural PDE Solver Induced by Discontinuous Galerkin Methods
We propose a general framework for the Discontinuous Galerkin-induced Neural Network (DGNN), inspired by the Interior Penalty Discontinuous Galerkin Method (IPDGM). In this approach, the trial space consists of piecewise…