Related papers: Chebyshev collocation for linear, periodic ordinar…
We consider a linear scalar delay differential equation (DDE), consisting of two arbitrary distributed time delays. We formulate necessary conditions for stability of the trivial solution which are independent of the distributions. For the…
We study a deflation method to reduce and to solve linear dfferential-algebraic equations (DAEs). It consists to define a sequence of DAEs with index reduction of one unit by step. This is simultaneously performed by substitution and…
We derive a posteriori error estimates for a fully discrete finite element approximation of the stochastic Cahn-Hilliard equation. The a posteriori bound is obtained by a splitting of the equation into a linear stochastic partial…
We consider a Bayesian nonparametric approach to a family of linear inverse problems in a separable Hilbert space setting with Gaussian noise. We assume Gaussian priors, which are conjugate to the model, and present a method of identifying…
For a generic discrete-time algorithm (DTA): $z^+=g(z,s)$, where $s$ is the step size, Lu (Math. Program., 194(1):1061--1112, 2022) proposed an $O(s^r)$-resolution ordinary differential equation (ODE) framework based on the backward error…
In this paper we analyze a posteriori error estimates for a mixed formulation of the linear elasticity eigenvalue problem. A posteriori estimators for the nearly and perfectly compressible elasticity spectral problems are proposed. With a…
The paper is devoted to the study of stability of equilibrium solutions of a delay differential equation that models leukemia. The equation was previously studied in [5] and [6], where the emphasis is put on the numerical study of periodic…
A new explicit stabilized scheme of weak order one for stiff and ergodic stochastic differential equations (SDEs) is introduced. In the absence of noise, the new method coincides with the classical deterministic stabilized scheme (or…
We establish local and global well-posedness for the initial value problem associated to the one-dimensional Schrodinger-Debye (SD) system for data in the Sobolev spaces with low regularity. To obtain local results we prove two new sharp…
This paper studies the continuous-time dynamics of primal-dual algorithms for linearly constrained convex optimization problems and provides a quantitative convergence analysis using the Lyapunov functions. With the growing prevalence of…
Recently, the efficient numerical solution of Hamiltonian problems has been tackled by defining the class of energy-conserving Runge-Kutta methods named Hamiltonian Boundary Value Methods (HBVMs). Their derivation relies on the expansion of…
We derive efficient and reliable goal-oriented error estimations, and devise adaptive mesh procedures for the finite element method that are based on the localization of a posteriori estimates. In our previous work [SIAM J. Sci. Comput.,…
The paper is concerned with a posteriori error bounds for a wide class of numerical schemes, for $n\times n$ hyperbolic conservation laws in one space dimension. These estimates are achieved by a "post-processing algorithm", checking that…
Delay coordinates are a widely used technique to pass from observations of a dynamical system to a representation of the dynamical system as an embedding in Euclidean space. Current proofs show that delay coordinates of a given dynamical…
Spectral deferred corrections (SDC) are a class of iterative methods for the numerical solution of ordinary differential equations. SDC can be interpreted as a Picard iteration to solve a fully implicit collocation problem, preconditioned…
Algorithms for bilevel optimization often encounter Hessian computations, which are prohibitive in high dimensions. While recent works offer first-order methods for unconstrained bilevel problems, the constrained setting remains relatively…
The roots of a monic polynomial expressed in a Chebyshev basis are known to be the eigenvalues of the so-called colleague matrix, which is a Hessenberg matrix that is the sum of a symmetric tridiagonal matrix and a rank-1 matrix. The…
Direct factorization methods for the solution of large, sparse linear systems that arise from PDE discretizations are robust, but typically show poor time and memory scalability for large systems. In this paper, we describe an efficient…
We generalize the theory of underlying one-step methods to strictly stable general linear methods (GLMs) solving nonautonomous ordinary differential equations (ODEs) that satisfy a global Lipschitz condition. We combine this theory with the…
An integro-differential equation of hyperbolic type, with mixed boundary conditions, is considered. A continuous space-time finite element method of degree one is formulated. A posteriori error representations based on space-time cells is…