Related papers: On optimal truncation of divergent series solution…
In the context of bounding probability of small deviation, there are limited general tools. However, such bounds have been widely applied in graph theory and inventory management. We introduce a common approach to substantially sharpen such…
Singularly-perturbed ordinary differential equations often exhibit Stokes' phenomenon, which describes the appearance and disappearance of oscillating exponentially small terms across curves in the complex plane known as Stokes curves.…
We study the Stokes phenomenon for the solutions of general homogeneous linear moment partial differential equations with constant coefficients in two complex variables under condition that the Cauchy data are holomorphic on the complex…
We investigate Runge-type approximation theorems for solutions to the 3D unsteady Stokes system. More precisely, we establish that on any compact set with connected complement, local smooth solutions to the 3D unsteady Stokes system can be…
This paper deals with subsampled spectral gradient methods for minimizing finite sum. Subsample function and gradient approximations are employed in order to reduce the overall computational cost of the classical spectral gradient methods.…
A \emph{double extrema form} of the calculus of variations is put forward in which only the smallest one of the finite differences is physically meaningful to represent the variational derivatives defined on the discrete points. The most…
An explicit perturbative solution to all orders is given for a general class of nonlinear differential equations. This solution is written as a sum indexed by rooted trees and uses the Green function of a linearization of the equations. The…
We present a new algorithm for solving optimization problems with objective functions that are the sum of a smooth function and a (potentially) nonsmooth regularization function, and nonlinear equality constraints. The algorithm may be…
We present a new algorithm for automatically bounding the Taylor remainder series. In the special case of a scalar function $f: \mathbb{R} \to \mathbb{R}$, our algorithm takes as input a reference point $x_0$, trust region $[a, b]$, and…
We provide a primer to numerical methods based on Taylor series expansions such as generalized finite difference methods and collocation methods. We provide a detailed benchmarking strategy for these methods as well as all data files…
In this article we obtain an optimal best approximation type result for fully discrete approximations of the transient Stokes problem. For the time discretization we use the discontinuous Galerkin method and for the spatial discretization…
The main purpose of this paper is to propose a variance-based Bregman extragradient algorithm with line search for solving stochastic variational inequalities, which is robust with respect an unknown Lipschitz constant. We prove the almost…
In this work, we analyze an unfitted discontinuous Galerkin discretization for the numerical solution of the Stokes system based on equal higher-order discontinuous velocities and pressures. This approach combines the best from both worlds,…
This paper shows that the implicit bias of gradient descent on linearly separable data is exactly characterized by the optimal solution of a dual optimization problem given by a smoothed margin, even for general losses. This is in contrast…
Recall that a Stirling permutation is a permutation on the multiset $\{1,1,2,2,\ldots,n,n\}$ such that any numbers appearing between repeated values of $i$ must be greater than $i$. We call a Stirling permutation ``flattened'' if the…
In this paper, we propose some accelerated methods for solving optimization problems under the condition of relatively smooth and relatively Lipschitz continuous functions with an inexact oracle. We consider the problem of minimizing the…
Model order reduction algorithms for large-scale descriptor systems are proposed using balanced truncation, in which symmetry or block skew symmetry (reciprocity) and the positive realness of the original transfer matrix are preserved. Two…
The problem of minimization of the sum of two convex functions has various theoretical and real-world applications. One of the popular methods for solving this problem is the proximal gradient method (proximal forward-backward algorithm). A…
We prove an existence and uniqueness theorem for exact WKB solutions of general singularly perturbed linear second-order ODEs in the complex domain. These include the one-dimensional time-independent complex Schr\"odinger equation. Notably,…
We establish the existence theory of several commonly used finite element (FE) nonlinear fully discrete solutions, and the convergence theory of a linearized iteration. First, it is shown for standard FE, SUPG and edge-averaged method…