Related papers: Practical Error Estimates for Reynolds' Lubricatio…
We derive the first exact, rigorous but practical, globally valid remainder terms for asymptotic expansions about saddles and contour endpoints of arbitrary order degeneracy derived from the method of steepest descents. The exact remainder…
This note gives a bound on the error of the leading term of the $t\to 0$ asymptotic expansion of the Hartman-Watson distribution $\theta(r,t)$ in the regime $rt=\rho$ constant. The leading order term has the form…
The Brent-McMillan algorithm is the fastest known procedure for the high-precision computation of Euler's constant $\gamma$ and is based on the modified Bessel functions $I_0(2x)$ and $K_0(2x)$. An error estimate for this algorithm relies…
We study rapidly rotating turbulent flows in a highly elongated domain using an asymptotic expansion at simultaneously low Rossby number $Ro\ll 1$ and large domain height compared to the energy injection scale, $h=H/\ell_{in}\gg 1$. We…
The Reynolds equation, combined with the Elrod algorithm for including the effect of cavitation, resembles a nonlinear convection-diffusion-reaction (CDR) equation. Its solution by finite elements is prone to oscillations in…
This paper investigates a class of non-autonomous highly oscillatory ordinary differential equations characterized by a linear component inversely proportional to a small parameter $\varepsilon$, with purely imaginary eigenvalues, and an…
There are many application papers that solve elliptic boundary value problems by meshless methods, and they use various forms of generalized stiffness matrices that approximate derivatives of functions from values at scattered nodes…
We derive in this note a high-order corrector estimate for the homogenization of a microscopic semi-linear elliptic system posed in perforated domains. The major challenges are the presence of nonlinear volume and surface reaction rates.…
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…
In the present article, we review a continual effort on generalization of the Trotter formula to higher-order exponential product formulas. The exponential product formula is a good and useful approximant, particularly because it conserves…
We obtain an expression for the error in the approximation of $f(A) \boldsymbol{b}$ and $\boldsymbol{b}^T f(A) \boldsymbol{b}$ with rational Krylov methods, where $A$ is a symmetric matrix, $\boldsymbol{b}$ is a vector and the function $f$…
A one-step analysis of Anderson acceleration with general algorithmic depths is presented. The resulting residual bounds within both contractive and noncontractive settings reveal the balance between the contributions from the higher and…
We present a stabilized finite element method for the numerical solution of cavitation in lubrication, modeled as an inequality-constrained Reynolds equation. The cavitation model is written as a variable coefficient saddle-point problem…
For population genetics models with recombination, obtaining an exact, analytic sampling distribution has remained a challenging open problem for several decades. Recently, a new perspective based on asymptotic series has been introduced to…
We derive a priori error estimates for Nitsche's method applied to elliptic problems on approximate domains. Such approximations arise, for example, in unfitted finite element methods, data-driven simulations, and evolving domain problems,…
We study first-order methods for convex optimization problems with functions $f$ satisfying the recently proposed $\ell$-smoothness condition $||\nabla^{2}f(x)|| \le \ell\left(||\nabla f(x)||\right),$ which generalizes the $L$-smoothness…
This paper extends a low-rank tensor decomposition (LRTD) reduced order model (ROM) methodology to simulate viscous flows and in particular to predict a smooth branch of solutions for the incompressible Navier-Stokes equations.…
A regularization algorithm allowing random noise in derivatives and inexact function values is proposed for computing approximate local critical points of any order for smooth unconstrained optimization problems. For an objective function…
The scaling of acceleration statistics in turbulence is examined by combining data from the literature with new data from well-resolved direct numerical simulations of isotropic turbulence, significantly extending the Reynolds number range.…
Many of the fastest known algorithms to compute $\pi$ involve generalized hypergeometric series, such as the Ramanujan-Sato series. In this paper, we investigate the rates of convergence for several such series and we give asymptotic…