Related papers: An explicit third-order one-step method for autono…
We propose a novel quantum algorithm for solving linear autonomous ordinary differential equations (ODEs) using the Pad\'e approximation. For linear autonomous ODEs, the discretized solution can be represented by a product of matrix…
The numerical analysis of variational integrators relies on variational error analysis, which relates the order of accuracy of a variational integrator with the order of approximation of the exact discrete Lagrangian by a computable…
The DPG method with optimal test functions for solving linear quadratic optimal control problems with control constraints is studied. We prove existence of a unique optimal solution of the nonlinear discrete problem and characterize it…
We present a methodology for establishing the existence of quadratic Lyapunov inequalities for a wide range of first-order methods used to solve convex optimization problems. In particular, we consider i) classes of optimization problems of…
In this paper, we introduce a new iterative method which we call one step back approach: the main idea is to anticipate the consequence of the iterative computation per coordinate and to optimize on the choice of the sequence of the…
A classical method for risk-sensitive nonlinear control is the iterative linear exponential quadratic Gaussian algorithm. We present its convergence analysis from a first-order optimization viewpoint. We identify the objective that the…
In this paper we introduce a numerical method for solving nonlinear Volterra integro-differential equations. In the first step, we apply implicit trapezium rule to discretize the integral in given equation. Further, the Daftardar-Gejji and…
To broaden the range of applicability of variable-order fractional differential models, reliable numerical approaches are needed to solve the model equation. In this paper, we develop Laguerre spectral collocation methods for solving…
This paper presents a state and state-input constrained variant of the discrete-time iterative Linear Quadratic Regulator (iLQR) algorithm, with linear time-complexity in the number of time steps. The approach is based on a projection of…
The article is devoted to the construction of explicit one-step numerical methods with the strong orders of convergence 2.0, 2,5, and 3.0 for Ito stochastic differential equations with multidimensional non-commutative noise. We consider the…
The optimal error estimate that depending only on the polynomial degree of $ \varepsilon^{-1}$ is established for the temporal semi-discrete scheme of the Cahn-Hilliard equation, which is based on the scalar auxiliary variable (SAV)…
This paper describes an updated exponential Fourier based split-step method that can be applied to a greater class of partial differential equations than previous methods would allow. These equations arise in physics and engineering, a…
A new class of fully decoupled consistent splitting schemes for the Navier-Stokes equations are constructed and analyzed in this paper. The schemes are based on the Taylor expansion at $t^{n+\beta}$ with $\beta\ge 1$ being a free parameter.…
We propose and analyze an adaptive step-size variant of the Davis-Yin three operator splitting. This method can solve optimization problems composed by a sum of a smooth term for which we have access to its gradient and an arbitrary number…
Time-fractional parabolic equations with a Caputo time derivative are considered. For such equations, we explore and further develop the new methodology of the a-posteriori error estimation and adaptive time stepping proposed in [7]. We…
Parallel transport is an important step in many discrete algorithms for statistical computing on manifolds. Numerical methods based on Jacobi fields or geodesics parallelograms are currently used in geometric data processing. In this last…
We consider transport processes that are modeled by first order hyperbolic partial differential equations. Our goal is to find a full state feedback that makes a given reference profile locally asymptotically stable. To accomplish this we…
In this short communication we introduce a rather simple autonomous system of 2 nonlinearly-coupled first-order Ordinary Differential Equations (ODEs), whose initial-values problem is explicitly solvable by algebraic operations. Its ODEs…
Gradient-free/zeroth-order methods for black-box convex optimization have been extensively studied in the last decade with the main focus on oracle calls complexity. In this paper, besides the oracle complexity, we focus also on iteration…
In this paper, we introduce an algorithm that provides approximate solutions to semi-linear ordinary differential equations with highly oscillatory solutions, which, after an appropriate change of variables, can be rewritten as…