Related papers: Dual Algorithms
Explicit integrating factor Runge-Kutta methods are attractive and popular in developing high-order maximum bound principle preserving time-stepping schemes for Allen-Cahn type gradient flows. However, they always suffer from the…
We combine the recent relaxation approach with multiderivative Runge-Kutta methods to preserve conservation or dissipation of entropy functionals for ordinary and partial differential equations. Relaxation methods are minor modifications of…
In this article, we study the numerical solution of the one dimensional nonlinear sine-Gordon by using the modified cubic B-spline differential quadrature method. The scheme is a combination of a modified cubic B spline basis function and…
High-dimensional fractional reaction-diffusion equations have numerous applications in the fields of biology, chemistry, and physics, and exhibit a range of rich phenomena. While classical algorithms have an exponential complexity in the…
Efficient high order numerical methods for evolving the solution of an ordinary differential equation are widely used. The popular Runge--Kutta methods, linear multi-step methods, and more broadly general linear methods, all have a global…
Inspired by Gauss-Newton-like methods, we study the benefit of leveraging the structure of deep learning objectives, namely, the composition of a convex loss function and of a nonlinear network, in order to derive better direction oracles…
We developed a new method to calculate two-photon processes in quantum mechanics that replaces the infinite summation over the intermediate states by a perturbation expansion. This latter consists of a series of commutators that involve…
The partition function by means of the static path approximation (SPA) plus the random-phase approximation (RPA) treatment can be written as a contour integral form without solving the RPA equations for a separable interaction. This method…
An alternative methodology to evaluate two-electron-repulsion integrals based on numerical approximation is proposed. Computational chemistry has branched into two major fields with methodologies based on quantum mechanics and classical…
In this article, we discuss the numerical solution of Boolean polynomial programs by algorithms borrowing from numerical methods for differential equations, namely the Houbolt scheme, the Lie scheme, and a Runge-Kutta scheme. We first…
This paper detailedly discusses the locally one-dimensional numerical methods for efficiently solving the three-dimensional fractional partial differential equations, including fractional advection diffusion equation and Riesz fractional…
Numerical interpolation techniques are widely employed for calculating large rational functions in scattering amplitude computations. It has been observed in recent years that these rational functions greatly simplify upon partial…
High-efficient direct numerical methods are currently in demand for optimization procedures in the fields of both conventional diffractive and metasurface optics. With a view of extending the scope of application of the previously proposed…
Derivatives with respect to the parameters of the integral Mittag-Leffler function and the integral Wright function, recently introduced by us, are calculated. These derivatives can be expressed in the form of infinite sums of quotients of…
In recent years, a distributed Douglas-Rachford splitting method (DDRSM) has been proposed to tackle multi-block separable convex optimization problems. This algorithm offers relatively easier subproblems and greater efficiency for…
A novel class of high-order linearly implicit energy-preserving integrating factor Runge-Kutta methods are proposed for the nonlinear Schr\"odinger equation. Based on the idea of the scalar auxiliary variable approach, the original equation…
In this work, an approximate family of implicit multiderivative Runge-Kutta (MDRK) time integrators for stiff initial value problems is presented. The approximation procedure is based on the recent Approximate Implicit Taylor method (Baeza…
This article extends the theory of dual-consistent summation-by-parts (SBP) and generalized SBP (GSBP) time-marching methods by showing that they are implicit Runge-Kutta schemes. Through this connection, the accuracy theory for the…
Low-storage explicit Runge-Kutta schemes are particularly popular for the numerical integration of time-dependent partial differential equations based on the method-of-lines due to their efficiency and their reduced memory requirements. We…
Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…