Related papers: Rational methods for abstract linear, non-homogene…
A method for enhancing the stability and robustness of explicit schemes in computational fluid dynamics is presented. The method is based in reformulating explicit schemes in matrix form, which cane modified gradually into semi or…
In this paper we study $p$-order methods for unconstrained minimization of convex functions that are $p$-times differentiable ($p\geq 2$) with $\nu$-H\"{o}lder continuous $p$th derivatives. We propose tensor schemes with and without…
We examine the elliptic system given by {equation} \label{system_abstract} -\Delta u = v^p, \qquad -\Delta v = u^\theta, \qquad \{in} \IR^N, {equation} for $ 1 < p \le \theta$ and the fourth order scalar equation {equation}…
The problem of characterizing which automatic sets of integers are stable is here solved. Given a positive integer $d$ and a subset $A\subseteq \mathbb{Z}$ whose set of representations base $d$ is recognized by a finite automaton, a…
In this paper we consider efficient algorithms for solving the algebraic equation ${\mathcal A}^\alpha {\bf u}={\bf f}$, $0< \alpha <1$, where ${\mathcal A}$ is a symmetric and positive definite matrix obtained form finite difference or…
Splitting methods are widely used for solving initial value problems (IVPs) due to their ability to simplify complicated evolutions into more manageable subproblems which can be solved efficiently and accurately. Traditionally, these…
A numerical method for solving elliptic PDEs with variable coefficients on two-dimensional domains is presented. The method is based on high-order composite spectral approximations and is designed for problems with smooth solutions. The…
In this paper, we establish lower bounds for the oracle complexity of the first-order methods minimizing regularized convex functions. We consider the composite representation of the objective. The smooth part has H\"older continuous…
We consider a family of conforming space-time finite element discretizations for the wave equation based on splines of maximal regularity in time. Traditional techniques may require a CFL condition to guarantee stability. Recent works by O.…
Contrary to widespread perception, there is ever since 1994 a unified, general type independent theory for the existence of solutions for very large classes of nonlinear systems of PDEs. This solution method is based on the Dedekind order…
We consider the variational discretization of a linear-quadratic optimal control problem with pointwise control and state constraints. In order to allow for a Fr\'echet smooth norm, the problem is reformulated by means of a reflexive…
This work uses a linear relaxation method to develop efficient numerical schemes for the time-fractional Allen-Cahn and Cahn-Hilliard equations. The L1+-CN formula is used to discretize the fractional derivative, and an auxiliary variable…
In this paper we study general $l_p$ regularized unconstrained minimization problems. In particular, we derive lower bounds for nonzero entries of first- and second-order stationary points, and hence also of local minimizers of the $l_p$…
We investigate iterated Tikhonov methods coupled with a Kaczmarz strategy for obtaining stable solutions of nonlinear systems of ill-posed operator equations. We show that the proposed method is a convergent regularization method. In the…
We introduce a provably stable variant of neural ordinary differential equations (neural ODEs) whose trajectories evolve on an energy functional parametrised by a neural network. Stable neural flows provide an implicit guarantee on…
This work is devoted to the study of the existence of at least one (non-zero) solution to a problem involving the discrete $p$-Laplacian. As a special case, we derive an existence theorem for a second-order discrete problem, depending on a…
A simple alternative to the conjugate gradient(CG) method is presented; this method is developed as a special case of the more general iterated Ritz method (IRM) for solving a system of linear equations. This novel algorithm is not based on…
A reduced-order model algorithm, called ALP, is proposed to solve nonlinear evolution partial differential equations. It is based on approximations of generalized Lax pairs. Contrary to other reduced-order methods, like Proper Orthogonal…
Fast algorithms for approximation by rational functions exist for both barycentric and Thiele continued fraction (TCF) representations. We present the first numerically stable methods for derivative evaluation in the barycentric…
In this note we consider the continuous Galerkin time stepping method of arbitrary order as a possible discretization scheme of nonlinear initial value problems. In addition, we develop and generalize a well known existing result for the…