Related papers: Complex moment-based methods for differential eige…
We consider quadrature formulas of high order in time based on Radau-type, L-stable implicit Runge-Kutta schemes to solve time dependent stiff PDEs. Instead of solving a large nonlinear system of equations, we develop a method that performs…
A new numerical algorithm for solving the symmetric eigenvalue problem is presented. The technique deviates fundamentally from the traditional Krylov subspace iteration based techniques (Arnoldi and Lanczos algorithms) or other…
In this paper, a new type of multi-level correction scheme is proposed for solving eigenvalue problems by finite element method. With this new scheme, the accuracy of eigenpair approximations can be improved after each correction step which…
The calculation of a segment of eigenvalues and their corresponding eigenvectors of a Hermitian matrix or matrix pencil has many applications. A new density-matrix-based algorithm has been proposed recently and a software package FEAST has…
We construct a space-time parallel method for solving parabolic partial differential equations by coupling the Parareal algorithm in time with overlapping domain decomposition in space. The goal is to obtain a discretization consisting of…
When numerical solution of elliptic and parabolic partial differential equations is required to be highly accurate in space, the discrete problem usually takes the form of large-scale and sparse linear systems. In this work, as an…
The study of fractional order differential operators is receiving renewed attention in many scientific fields. In order to accommodate researchers doing work in these areas, there is a need for highly scalable numerical methods for solving…
The (modern) arbitrary derivative (ADER) approach is a popular technique for the numerical solution of differential problems based on iteratively solving an implicit discretization of their weak formulation. In this work, focusing on an ODE…
The numerical solution of partial differential equations (PDEs) is essential in computational physics. Over the past few decades, various quantum-based methods have been developed to formulate and solve PDEs. Solving PDEs incur high time…
In this paper, we present a deep learning-based numerical method for approximating high dimensional stochastic partial differential equations (SPDEs). At each time step, our method relies on a predictor-corrector procedure. More precisely,…
Discrete Element Methods (DEM), i.e.~the simulation of many rigid particles, suffer from very stiff differential equations plus multiscale challenges in space and time. The particles move smoothly through space until they interact almost…
Based on the work of Xu and Zhou [Math.Comput., 69(2000), pp.881-909], we establish new three-level and multilevel finite element discretizations by local defect-correction technique. Theoretical analysis and numerical experiments show that…
This paper is devoted to the analysis of linear second order discrete-time descriptor systems (or singular difference equations (SiDEs) with control). Following the algebraic approach proposed by Kunkel and Mehrmann for pencils of matrix…
Semidefinite programs (SDPs) are a fundamental class of optimization problems with important recent applications in approximation algorithms, quantum complexity, robust learning, algorithmic rounding, and adversarial deep learning. This…
We develop and analyze a posteriori error estimators for a proper orthogonal decomposition-discrete empirical interpolation method (Pod-Deim) reduced order model applied to a parametric Poisson equation posed on a parameter-dependent domain…
In this contribution we derive and analyze a new numerical method for kinetic equations based on a variable transformation of the moment approximation. Classical minimum-entropy moment closures are a class of reduced models for kinetic…
Primal-dual interior-point methods solve constrained convex optimization problems to tight tolerances with speed and robustness. Their solutions are also efficiently differentiable with respect to the problem data through the implicit…
We introduce the Optimizing a Discrete Loss (ODIL) framework for the numerical solution of Partial Differential Equations (PDE) using machine learning tools. The framework formulates numerical methods as a minimization of discrete residuals…
A new algorithm for eigenvalue problems for the fractional Jacobi type ODE is proposed. The algorithm is based on piecewise approximation of the coefficients of the differential equation with subsequent recursive procedure adapted from some…
In this paper, we introduce a new finite expression method (FEX) to solve high-dimensional partial integro-differential equations (PIDEs). This approach builds upon the original FEX and its inherent advantages with new advances: 1) A novel…