相关论文: The Voigt and complex error function: Huml\'i\v{c}…

In this paper we propose methods for computing Fresnel integrals based on truncated trapezium rule approximations to integrals on the real line, these trapezium rules modified to take into account poles of the integrand near the real axis.…

We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location problem (UFL), which improves on the previously best known 1.52-approximation algorithm by Mahdian, Ye and Zhang. Note, that the approximability lower…

In computer vision, the estimation of the fundamental matrix is a basic problem that has been extensively studied. The accuracy of the estimation imposes a significant influence on subsequent tasks such as the camera trajectory…

We develop a general framework for estimating the $L_\infty(\mathbb{T}^d)$ error for the approximation of multivariate periodic functions belonging to specific reproducing kernel Hilbert spaces (RHKS) using approximants that are…

The closest vector problem (CVP) is a fundamental optimization problem in lattice-based cryptography and its conjectured hardness underpins the security of lattice-based cryptosystems. Furthermore, Schnorr's lattice-based factoring…

The metric uncapacitated facility location problem (UFL) enjoys a special stature in approximation algorithms as a testbed for various techniques. Two generalizations of UFL are capacitated facility location (CFL) and lower-bounded facility…

We propose a high-order FDTD scheme based on the correction function method (CFM) to treat interfaces with complex geometry without increasing the complexity of the numerical approach for constant coefficients. Correction functions are…

For scientific computations on a digital computer the set of real number is usually approximated by a finite set F of "floating-point" numbers. We compare the numerical accuracy possible with difference choices of F having approximately the…

This work presents a method of computing Voigt functions and their derivatives, to high accuracy, on a uniform grid. It is based on an adaptation of Fourier-transform based convolution. The relative error of the result decreases as the…

In this paper we show that a methodology based on a sampling with the Gaussian function of kind $h\,{e^{ - {{\left( {t/c} \right)}^2}}}/\left( {{c}\sqrt \pi } \right)$, where ${c}$ and $h$ are some constants, leads to the Fourier transform…

In this paper we describe an algorithm and a Fortran 90 module ({\bf Conical}) for the computation of the conical function $P^m_{-\tfrac12+i\tau}(x)$ for $x>-1$, $m \ge 0$, $\tau >0$. These functions appear in the solution of Dirichlet…

Arbitrarily accurate fault-tolerant (FT) universal quantum computation can be carried out using the Clifford gates Z, S, CNOT plus the non-Clifford T gate. Moreover, a recent improvement of the Solovay-Kitaev theorem by Kuperberg implies…

A variety of "pseudo-Voigt" functions, i.e. a linear combination of the Lorentz and Gauss function (occasionally augmented with a correction term), have been proposed as a closed-form approximation for the convolution of the Lorentz and…

Fast convolution algorithms, including Winograd and FFT, can efficiently accelerate convolution operations in deep models. However, these algorithms depend on high-precision arithmetic to maintain inference accuracy, which conflicts with…

A preasymptotic error analysis of the finite element method (FEM) and some continuous interior penalty finite element method (CIP-FEM) for Helmholtz equation in two and three dimensions is proposed. $H^1$- and $L^2$- error estimates with…

Coherent lower previsions are general probabilistic models allowing incompletely specified probability distributions. However, for complete description of a coherent lower prevision -- even on finite underlying sample spaces -- an infinite…

This paper addresses the approximation of fractional harmonic maps. Besides a unit-length constraint, one has to tackle the difficulty of nonlocality. We establish weak compactness results for critical points of the fractional Dirichlet…

A posteriori upper and lower bounds are derived for the linear finite element method (FEM) for the Helmholtz equation with large wave number. It is proved rigorously that the standard residual type error estimator seriously underestimates…

We consider approximate circular pattern matching (CPM, in short) under the Hamming and edit distance, in which we are given a length-$n$ text $T$, a length-$m$ pattern $P$, and a threshold $k>0$, and we are to report all starting positions…

Selman and Kautz's work on ``knowledge compilation'' established how approximation (strengthening and/or weakening) of a propositional knowledge-base can be used to speed up query processing, at the expense of completeness. In this…