English
Related papers

Related papers: The Error in Rayleigh's Approximative Period

200 papers

Given a pair of strings, the problems of computing their Longest Common Subsequence and Edit Distance have been extensively studied for decades. For exact algorithms, LCS and Edit Distance (with character insertions and deletions) are…

Data Structures and Algorithms · Computer Science 2019-04-12 Aviad Rubinstein , Zhao Song

We study the error induced by the time discretization of a decoupled forward-backward stochastic differential equations $(X,Y,Z)$. The forward component $X$ is the solution of a Brownian stochastic differential equation and is approximated…

Probability · Mathematics 2016-08-16 Emmanuel Gobet , Céline Labart

In this paper, we introduce telescoping continued fractions to find lower bounds for the error term $r_n$ in Stirling's approximation $\displaystyle n! = \sqrt{2\pi}n^{n+1/2}e^{-n}e^{r_n}.$ This improves lower bounds given earlier by…

Classical Analysis and ODEs · Mathematics 2023-07-03 Gaurav Bhatnagar , Krishnan Rajkumar

Let $\mathbf{P}=\{ p_1, p_2, \ldots p_n \}$ and $\mathbf{Q} = \{ q_1, q_2 \ldots q_m \}$ be two point sets in an arbitrary metric space. Let $\mathbf{A}$ represent the $m\times n$ pairwise distance matrix with $\mathbf{A}_{i,j} = d(p_i,…

Data Structures and Algorithms · Computer Science 2018-09-20 Ainesh Bakshi , David P. Woodruff

In the Shortest-Superstring problem, we are given a set of strings S and want to find a string that contains all strings in S as substrings and has minimum length. This is a classical problem in approximation and the best known…

Data Structures and Algorithms · Computer Science 2016-11-11 Marcin Mucha

We present an alternative to the well-known Anderson's formula for the probability that a first exit time from the planar region between two slopping lines -a_1 t -b_1 and a_2 t + b_2 by a standard Brownian motion is greater than T. As the…

Probability · Mathematics 2019-01-23 Dmitry Muravey

We study the scaling of classification error rates with respect to the size of the training dataset. In contrast to classical results where rates are minimax optimal for a problem class, this work starts with the empirical observation that,…

Machine Learning · Statistics 2025-06-04 Pengkun Yang , Jingzhao Zhang

The small angle approximation often fails to explain experimental data, does not even predict if a plane pendulum's period increases or decreases with increasing amplitude. We make a perturbation ansatz for the Conserved Energy Surfaces of…

Classical Physics · Physics 2017-02-07 Bradley Klee

In the standard formulation of the occupancy problem one considers the distribution of r balls in n cells, with each ball assigned independently to a given cell with probability 1/n. Although closed form expressions can be given for the…

Probability · Mathematics 2007-05-23 Paul Dupuis , Carl Nuzman , Phil Whiting

We study the $c$-approximate near neighbor problem under the continuous Fr\'echet distance: Given a set of $n$ polygonal curves with $m$ vertices, a radius $\delta > 0$, and a parameter $k \leq m$, we want to preprocess the curves into a…

Computational Geometry · Computer Science 2021-11-05 Karl Bringmann , Anne Driemel , André Nusser , Ioannis Psarros

We consider semilinear hyperbolic systems with a trilinear nonlinearity. Both the differential equation and the initial data contain the inverse of a small parameter $\varepsilon$, and typical solutions oscillate with frequency proportional…

Analysis of PDEs · Mathematics 2022-07-01 Julian Baumstark , Tobias Jahnke

This article addresses a fundamental concern regarding the incompressible approximation of fluid motions, one of the most widely used approximations in fluid mechanics. Common belief is that its accuracy is $O(\epsilon)$ where $\epsilon$…

Analysis of PDEs · Mathematics 2014-09-01 Bin Cheng

We consider the problem of approximating the Langevin dynamics of inertial particles being transported by a background flow. In particular, we study an acceleration corrected advection-diffusion approximation to the Langevin dynamics, a…

Probability · Mathematics 2026-02-24 Yoichiro Mori , Chanoknun Sintavanuruk , Truong-Son P. Van

This paper investigates the problem of variable-length lossy source coding allowing a positive excess distortion probability and an overflow probability of codeword lengths. Novel one-shot achievability and converse bounds of the optimal…

Information Theory · Computer Science 2018-12-17 Shota Saito , Hideki Yagi , Toshiyasu Matsushima

We derive sharp bounds for the accuracy of approximate eigenvectors (Ritz vectors) obtained by the Rayleigh-Ritz process for symmetric eigenvalue problems. Using information that is available or easy to estimate, our bounds improve the…

Numerical Analysis · Mathematics 2020-01-01 Yuji Nakatsukasa

Chamfer distances play an important role in the theory of distance transforms. Though the determination of the exact Euclidean distance transform is also a well investigated area, the classical chamfering method based upon "small"…

Information Theory · Computer Science 2012-01-05 Andras Hajdu , Lajos Hajdu , Robert Tijdeman

We consider a random variable $Y$ and approximations $Y\_n$, defined on the same probability space with values in the same measurable space as $Y$. We are interested in situations where the approximations $Y\_n$ allow to define a Dirichlet…

Functional Analysis · Mathematics 2007-05-23 Nicolas Bouleau

The aim in model order reduction is to approximate an input-output map described by a large-scale dynamical system with a low-dimensional and cheaper-to-evaluate reduced order model. While high fidelity can be achieved by a variety of…

Dynamical Systems · Mathematics 2023-01-04 Björn Liljegren-Sailer

We consider the general problem of the first passage distribution of particles whose displacements are subject to time delays. We show that this problem gives rise to a \emph{propagation-dispersion equation} which is obtained as the…

Statistical Mechanics · Physics 2009-11-10 Jean Pierre Boon , Patrick Grosfils , James F. Lutsko

We give a priori error estimates of second order in time fully explicit Runge-Kutta discontinuous Galerkin schemes using upwind fluxes to smooth solutions of scalar fractional conservation laws in one space dimension. Under the time step…

Numerical Analysis · Mathematics 2024-02-27 Fabio Leotta , Jan Giesselmann
‹ Prev 1 3 4 5 6 7 10 Next ›