Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations
CERMICS, École des Ponts（巴黎路桥学院）；INRIA Rocquencourt（法国国家信息与自动化研究所罗克安库尔中心）；Laboratoire J.L.-Lions, Université Pierre et Marie Curie（皮埃尔和玛丽居里大学J.L.朗之万实验室）
We investigate mathematically a nonlinear approximation type approach recently introduced in [A. Ammar et al., J. Non-Newtonian Fluid Mech., 2006] to solve high dimensional partial differential equations. We show the link between the approach and the greedy algorithms of approximation theory studied e.g. in [R.A. DeVore and V.N. Temlyakov, Adv. Comput. Math., 1996]. On the prototypical case of the Poisson equation, we show that a variational version of the approach, based on minimization of energies, converges. On the other hand, we show various theoretical and numerical difficulties arising with the non variational version of the approach, consisting of simply solving the first order optimality equations of the problem. Several unsolved issues are indicated in order to motivate further research.
A splitting scheme for backward doubly stochastic differential equations is proposed. The main idea is to decompose a backward doubly stochastic differential equation into a backward stochastic differential equation and a stochastic differential equation. The backward stochastic differential equation and the stochastic differential equation are then approximated by first order finite difference schemes, which results in a first order scheme for the backward doubly stochastic differential equation. Numerical experiments are conducted to illustrate the convergence rate of the proposed scheme.
In this paper, we propose a tensor type of discretization and optimization process for solving high dimensional partial differential equations. First, we design the tensor type of trial function for the high dimensional partial differential equations. Based on the tensor structure of the trial functions, we can do the direct numerical integration of the approximate solution without the help of Monte-Carlo method. Then combined with the Ritz or Galerkin method, solving the high dimensional partial differential equation can be transformed to solve a concerned optimization problem. Some numerical…
This article presents several numerical techniques for solving Laplace equation. A numerical FORTRAN solver is developed to solve the 2D laplace equation. The numerical approaches implemented in the solver include Jacobi, Gauss-Siedel, Successive Over Relaxation, Alternating Direct Implicit and Multigrid methods. Detailed comparison between different numerical methods is presented and discussed
The aim of the present paper is to introduce a new numerical method for solving nonlinear Volterra integro-differential equations involving delay. We apply trapezium rule to the integral involved in the equation. Further, Daftardar-Gejji and Jafari method (DGJ) is employed to solve the implicit equation. Existence-uniqueness theorem is derived for solutions of such equations and the error and convergence analysis of the proposed method is presented. We illustrate efficacy of the newly proposed method by constructing examples.
In this paper we consider a class of fourth order nonlinear integro-differential equations with Navier boundary conditions. By the reduction of the problem to operator equation we establish the existence and uniqueness of solution and construct a numerical method for solving it. We prove that the method is of second order accuracy and obtain an estimate for total error. Some examples demonstrate the validity of the obtained theoretical results and the efficiency of the numerical method.
In the present paper, we introduce a new family of $ θ-$methods for solving delay differential equations. New methods are developed using a combination of decomposition technique viz. new iterative method proposed by Daftardar Gejji and Jafari and existing implicit numerical methods. Using Butcher tableau, we observed that new methods are non Runge-Kutta methods. Further, convergence of new methods is investigated along with its stability analysis. Applications to variety of problems indicates that the proposed family of methods is more efficient than existing methods.
A new penalty-free neural network method, PFNN-2, is presented for solving partial differential equations, which is a subsequent improvement of our previously proposed PFNN method [1]. PFNN-2 inherits all advantages of PFNN in handling the smoothness constraints and essential boundary conditions of self-adjoint problems with complex geometries, and extends the application to a broader range of non-self-adjoint time-dependent differential equations. In addition, PFNN-2 introduces an overlapping domain decomposition strategy to substantially improve the training efficiency without sacrificing ac…
This paper presents a novel semi-analytical collocation method to solve multi-term variable-order time fractional partial differential equations (VOTFPDEs). In the proposed method it employs the Fourier series expansion for spatial discretization, which transforms the original multi-term VOTFPDEs into a sequence of multi-term variable-order time fractional ordinary differential equations (VOTFODEs). Then these VOTFODEs can be solved by using the recent-developed backward substitution method. Several numerical examples verify the accuracy and efficiency of the proposed numerical approach in the…
Solving differential and integral equations with Tau method
Instituto Superior de Engenharia do Porto（波尔图高等工程学院）；Centro de Matemática da Universidade do Porto（波尔图大学数学中心）；Faculdade de Ciências da Universidade do Porto（波尔图大学理学院）
Moving sample method for solving time-dependent partial differential equations
The Institute of Mathematical Sciences, ShanghaiTech University（上海科技大学数学科学学院）；Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院计算数学与科学工程计算研究所）；School of Mathematical Sciences, University of Chinese Academy of Sciences（中国科学院大学数学科学学院）；Department of Mathematics, School of Sciences, Great Bay University（大湾区大学理学院数学系）；Department of Mathematics, Center for Computation and Technology, Louisiana State University（路易斯安那州立大学计算与技术中心数学系）
The $q$-fractional differential equation usually describe the physics process imposed on the time scale set $T_q$. In this paper, we first propose a difference formula for discretizing the fractional $q$-derivative $^cD_q^αx(t)$ on the time scale set $T_q$ with order $0<α<1$ and scale index $0<q<1$. We establish a rigours truncation error boundness and prove that this difference formula is unconditionally stable. Then, we consider the difference method for solving the initial problem of $q$-fractional differential equation: $^cD_q^αx(t)=f(t,x(t))$ on the time scale set. We prove the unique exi…
Differential algebraic Riccati equations are at the heart of many applications in control theory. They are time-depent, matrix-valued, and in particular nonlinear equations that require special methods for their solution. Low-rank methods have been used heavily computing a low-rank solution at every step of a time-discretization. We propose the use of an all-at-once space-time solution leading to a large nonlinear space-time problem for which we propose the use of a Newton-Kleinman iteration. Approximating the space-time problem in low-rank form requires fewer applications of the discretized d…
In this work, in order to obtain higher-order schemes for solving forward backward stochastic differential equations, we adopt the high-order multi-step method in [W. Zhao, Y. Fu and T. Zhou, SIAM J. Sci. Comput., 36(4) (2014), pp.A1731-A1751] by combining multi-steps. Two reference ordinary differential equations containing the conditional expectations and their derivatives are derived from the backward component. These derivatives are approximated by finite difference methods with multi-step combinations. The resulting scheme is a semi-discretization in the time direction involving condition…
The purpose of this paper is to show and explain a new formula that indicates with finality the derivatives of Shifted Monic Ultraspherical polynomials (SMUPs) of any degree and for any fractional-order using the shifted Monic Ultraspherical polynomials themselves. We also create a direct method solution for the linear or nonlinear multi-order fractional differential equations (FDEs) with constant coefficients involving a spectral Galerkin method. The spatial approximation with its fractional order derivatives (described in the Caputo sense) are built using shifted Monic Ultraspherical polynom…
We present a novel method for using Neural Networks (NNs) for finding solutions to a class of Partial Differential Equations (PDEs). Our method builds on recent advances in Neural Radiance Field research (NeRFs) and allows for a NN to converge to a PDE solution much faster than classic Physically Informed Neural Network (PINNs) approaches.
We develop a randomized Newton's method for solving differential equations, based on a fully connected neural network discretization. In particular, the randomized Newton's method randomly chooses equations from the overdetermined nonlinear system resulting from the neural network discretization and solves the nonlinear system adaptively. We prove theoretically that the randomized Newton's method has a quadratic convergence locally. We also apply this new method to various numerical examples, from one- to high-dimensional differential equations, in order to verify its feasibility and efficienc…
The University of Arizona（亚利桑那大学）；Massachusetts Institute of Technology（麻省理工学院）
This study presents a novel unsupervised convolutional Neural Network (NN) architecture with nonlocal interactions for solving Partial Differential Equations (PDEs). The nonlocal Peridynamic Differential Operator (PDDO) is employed as a convolutional filter for evaluating derivatives the field variable. The NN captures the time-dynamics in smaller latent space through encoder-decoder layers with a Convolutional Long-short Term Memory (ConvLSTM) layer between them. The ConvLSTM architecture is modified by employing a novel activation function to improve the predictive capability of the learning…
Many eigenvalue problems arising in practice are often of the generalized form $A\x=λB\x$. One particularly important case is symmetric, namely $A, B$ are Hermitian and $B$ is positive definite. The standard algorithm for solving this class of eigenvalue problems is to reduce them to Hermitian eigenvalue problems. For a quantum computer, quantum phase estimation is a useful technique to solve Hermitian eigenvalue problems. In this work, we propose a new quantum algorithm for symmetric generalized eigenvalue problems using ordinary differential equations. The algorithm has lower complexity than…
San Diego State University（圣地亚哥州立大学）；Korea University（高丽大学）
Nonlinear differential equations are challenging to solve numerically and are important to understanding the dynamics of many physical systems. Deep neural networks have been applied to help alleviate the computational cost that is associated with solving these systems. We explore the performance and accuracy of various neural architectures on both linear and nonlinear differential equations by creating accurate training sets with the spectral element method. Next, we implement a novel Legendre-Galerkin Deep Neural Network (LGNet) algorithm to predict solutions to differential equations. By co…
Indian Institute of Technology, Varanasi（印度理工学院（瓦拉纳西））；Harvard University（哈佛大学）
Neural network-based methods for solving differential equations have been gaining traction. They work by improving the differential equation residuals of a neural network on a sample of points in each iteration. However, most of them employ standard sampling schemes like uniform or perturbing equally spaced points. We present a novel sampling scheme which samples points adversarially to maximize the loss of the current solution estimate. A sampler architecture is described along with the loss terms used for training. Finally, we demonstrate that this scheme outperforms pre-existing schemes by …
