Related papers: An explicit third-order one-step method for autono…
For large-scale eigenvalue problems requiring many mutually orthogonal eigenvectors, traditional numerical methods suffer substantial computational and communication costs with limited parallel scalability, primarily due to explicit…
We derive a fully discrete Inverse Scattering Transform as a method for solving the initial-value problem for the Q3$_\delta$ lattice (difference-difference) equation for real-valued solutions. The initial condition is given on an infinite…
We describe an extension of the Taylor method for the numerical solution of ODEs that uses Pad\'e approximants to obtain extremely precise numerical results. The accuracy of the results is essentially limited only by the computer time and…
We present a paradigm for developing arbitrarily high order, linear, unconditionally energy stable numerical algorithms for gradient flow models. We apply the energy quadratization (EQ) technique to reformulate the general gradient flow…
This paper presents the non-linear generalization of a previous work on matrix differential models. It focusses on the construction of approximate solutions of first-order matrix differential equations Y'(x)=f(x,Y(x)) using matrix-cubic…
An optimal control problem is studied for a linear mean-field stochastic differential equation with a quadratic cost functional. The coefficients and the weighting matrices in the cost functional are all assumed to be deterministic.…
In this paper, we first establish the convergence criteria of the residual iteration method for solving quadratic eigenvalue problem- s. We analyze the impact of shift point and the subspace expansion on the convergence of this method. In…
We propose and study a class of novel algorithms that aim at solving bilinear and quadratic inverse problems. Using a convex relaxation based on tensorial lifting, and applying first-order proximal algorithms, these problems could be solved…
We propose adaptive, line search-free second-order methods with optimal rate of convergence for solving convex-concave min-max problems. By means of an adaptive step size, our algorithms feature a simple update rule that requires solving…
We analyze the complexity of single-loop quadratic penalty and augmented Lagrangian algorithms for solving nonconvex optimization problems with functional equality constraints. We consider three cases, in all of which the objective is…
We show how the standard (St{\"o}rmer-Verlet) splitting method for differential equations of Hamiltonian mechanics (with accuracy of order $\tau^2$ for a timestep of length $\tau$) can be improved in a systematic manner without using the…
The present paper proposes an inf-sup stable divergence free virtual element method and associated a priori, and a posteriori error analysis to approximate the eigenvalues and eigenfunctions of the Stokes spectral problem in one shot. For…
We introduce a new approach to deriving approximate analytical solutions of a harmonic oscillator damped by purely nonlinear, or combinations of linear and nonlinear damping forces. Our approach is based on choosing a suitable trial…
We propose a new algorithm for computing validated bounds for the solutions to the first order variational equations associated to ODEs. These validated solutions are the kernel of numerics computer-assisted proofs in dynamical systems…
Improved local numerical solution for the ADER-DG numerical method with a local DG predictor for solving the initial value problem for a first-order ODE system is proposed. The improved local numerical solution demonstrates convergence…
In this paper we present an algorithm to find the discrete Lagrangian for an autonomous recurrence relation of arbitrary even order $2k$ with $k>1$. The method is based on the existence of a set of differential operators called annihilation…
The Hilfer fractional derivative generalizes and interpolates between the commonly used Riemann-Liouville and Caputo fractional derivative. In general, solutions to Hilfer fractional derivative initial value problems are singular for $t…
In this paper, we introduce the Adaptive Inertial Method (AIM), a novel framework for accelerated first-order methods through a customizable inertial term. We provide a rigorous convergence analysis establishing a global convergence rate of…
We are concerned with efficient numerical methods for stochastic continuous-time algebraic Riccati equations (SCARE). Such equations frequently arise from the state-dependent Riccati equation approach which is perhaps the only systematic…
We consider first-order linear systems of ordinary differential equations with periodic coefficients. Supposing that right-hand sides of equations are not known and subjected to some quadratic restrictions, we obtain optimal, in certain…