Related papers: Two Optimized Symmetric Eight-Step Implicit Method…
The object of the present paper is to extend the third-order iterative method for solving nonlinear equations into systems of nonlinear equations. Since our motive is to develop the method which improve the order of convergence of Newton's…
In this paper, we propose a numerical method to approximate the solution of the time-dependent Schr\"odinger equation with periodic boundary condition in a high-dimensional setting. We discretize space by using the Fourier pseudo-spectral…
This paper investigates numerical methods for solving stochastic linear quadratic (SLQ) optimal control problems governed by stochastic partial differential equations (SPDEs). Two distinct approaches, the open-loop and closed-loop ones, are…
We discuss a new approach to solve the low lying states of the Schroedinger equation. For a fairly large class of problems, this new approach leads to convergent iterative solutions, in contrast to perturbative series expansions. These…
Explicit stabilized methods are an efficient alternative to implicit schemes for the time integration of stiff systems of differential equations in large dimension. In this paper, we derive explicit stabilized integrators of orders one and…
In this paper, we develop a Localized Orthogonal Decomposition (LOD) method for the two-dimensional time-dependent nonlinear Schr\"{o}dinger equation with a wave operator. We prove that our method preserves conservation laws and admits a…
We present a parametric family of semi-implicit second order accurate numerical methods for non-conservative and conservative advection equation for which the numerical solutions can be obtained in a fixed number of forward and backward…
We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest…
Newton's method may exhibit slower convergence than vanilla Gradient Descent in its initial phase on strongly convex problems. Classical Newton-type multilevel methods mitigate this but, like Gradient Descent, achieve only linear…
Newton's method may exhibit slower convergence than vanilla Gradient Descent in its initial phase on strongly convex problems. Classical Newton-type multilevel methods mitigate this but, like Gradient Descent, achieve only linear…
We develop two novel stochastic variance-reduction methods to approximate solutions of a class of nonmonotone [generalized] equations. Our algorithms leverage a new combination of ideas from the forward-reflected-backward splitting method…
We consider the numerical integration of non-autonomous separable parabolic equations using high order splitting methods with complex coefficients (methods with real coefficients of order greater than two necessarily have negative…
We provide new gradient-based methods for efficiently solving a broad class of ill-conditioned optimization problems. We consider the problem of minimizing a function $f : \mathbb{R}^d \rightarrow \mathbb{R}$ which is implicitly…
In this paper we propose a method to improve the accuracy of trajectory optimization for dynamic robots with intermittent contact by using orthogonal collocation. Until recently, most trajectory optimization methods for systems with…
In this paper, a novel stochastic extra-step quasi-Newton method is developed to solve a class of nonsmooth nonconvex composite optimization problems. We assume that the gradient of the smooth part of the objective function can only be…
Three new iteration methods, namely the squared-operator method, the modified squared-operator method, and the power-conserving squared-operator method, for solitary waves in general scalar and vector nonlinear wave equations are proposed.…
Among the family of fourth-order time integration schemes, the two-stage Gauss--Legendre method, which is an implicit Runge--Kutta method based on collocation, is the only superconvergent. The computational cost of this implicit scheme for…
In this paper, we propose two linearized finite difference schemes for solving the logarithmic Schr\"odinger equation (LogSE) without the need for regularization of the logarithmic term. These two schemes employ the first-order and the…
We consider elliptic equations of Schr\"odinger type with a right-hand side fixed and with the linear part of order zero given by a potential V . The main goal is to study the optimization problem for an integral cost depending on the…
In this study, we propose high-order implicit and semi-implicit schemes for solving ordinary differential equations (ODEs) based on Taylor series expansion. These methods are designed to handle stiff and non-stiff components within a…