English
Related papers

Related papers: A simple pseudo-Voigt/complex error function

200 papers

In this paper we consider error sums of the form \[\sum_{m=0}^{\infty} \varepsilon_m\Big( \,b_m\alpha - \frac{a_m}{c_m}\,\Big) \,,\] where $\alpha$ is a real number, $a_m$, $b_m$, $c_m$ are integers, and $\varepsilon_m=1$ or $\varepsilon_m…

Number Theory · Mathematics 2016-02-23 Thomas Baruchel , Carsten Elsner

The paper proposes an approximate expression for calculating very complex one-dimensional integrals depending on the parameter $a$. These integrals often occur in computational problems theory of magnetic solitons. The resulting analytical…

General Physics · Physics 2023-02-27 D. Kovalenko , A. A. Zhmudsky

In this paper we discuss a closed-form approximation of the likelihood functions of an arbitrary diffusion process. The approximation is based on an exponential ansatz of the transition probability for a finite time step $\Delta t$, and a…

Physics and Society · Physics 2008-12-10 Luca Capriotti

The variable change w=exp(u) is applied to establish novel integral representations of the incomplete gamma-function, hypergeometric F-function,confluent hypergeometric /Phi-function and beta-function, and to analyze these functionsas as…

Functional Analysis · Mathematics 2010-01-15 Sergey K. Sekatskii

We investigate deep composite polynomial approximations of continuous but non-differentiable functions with algebraic cusp singularities. The functions in focus consist of finitely many cusp terms of the form $|x-a_j|^{\alpha_j}$ with…

Numerical Analysis · Mathematics 2026-01-01 Kingsley Yeon , Steven B. Damelin , Michael Werman

We have looked at the evaluation of the Riemann Zeta function at odd arguments and have provided a simple formula to approximate the value with exponential convergence. We have compared it with various other formulae present in literature.…

Number Theory · Mathematics 2015-03-19 Srinivasan Arunachalam

We present a rational approximation for the Dawson's integral of real argument and show how it can be implemented for accurate and rapid computation of the Voigt function at small $y < < 1$. The algorithm based on this approach enables…

Numerical Analysis · Mathematics 2015-05-19 S. M. Abrarov , B. M. Quine

An important question in evolutionary computation is how good solutions evolutionary algorithms can produce. This paper aims to provide an analytic analysis of solution quality in terms of the relative approximation error, which is defined…

Neural and Evolutionary Computing · Computer Science 2016-11-28 Jun He

Evaluation of the Voigt function, a convolution of a Lorentzian and a Gaussian profile, is essential in various fields such as spectroscopy, atmospheric science, and astrophysics. Efficient computation of the function is crucial, especially…

Instrumentation and Methods for Astrophysics · Physics 2024-11-05 Mofreh R. Zaghloul , Jacques Le Bourlot

We prove that almost all real numbers (with respect to Lebesgue measure) are approximated by the convergents of their $\beta$-expansions with the exponential order $\beta^{-n}$. Moreover, the Hausdorff dimensions of sets of the real numbers…

Number Theory · Mathematics 2016-07-25 Lulu Fang , Min Wu , Bing Li

We consider the problem of the approximation of the solution of a one-dimensional SDE with non-globally Lipschitz drift and diffusion coefficients behaving as $x^\alpha$, with $\alpha>1$. We propose an (semi-explicit) exponential-Euler…

Probability · Mathematics 2022-11-30 Mireille Bossy , Jean Francois Jabir , Kerlyns Martinez

In this paper a spline based integral approximation is utilized to propose a sequence of approximations to the error function that converge at a significantly faster manner than the default Taylor series. The approximations can be improved…

General Mathematics · Mathematics 2022-07-27 Roy M. Howard

We present a new simple algorithm for efficient, and relatively accurate computation of the Faddeyeva function w(z). The algorithm carefully exploits previous approximations by Hui et al [1978] and Humlicek [1982] along with asymptotic…

Instrumentation and Methods for Astrophysics · Physics 2017-11-16 Mofreh R. Zaghloul

Recently, the present authors derived new asymptotic expansions for linear differential equations having a simple turning point. These involve Airy functions and slowly varying coefficient functions, and were simpler than previous…

Classical Analysis and ODEs · Mathematics 2020-04-28 T. M. Dunster , A. Gil , J. Segura

Subadditive set functions play a pivotal role in computational economics (especially in combinatorial auctions), combinatorial optimization or artificial intelligence applications such as interpretable machine learning. However, specifying…

Machine Learning · Computer Science 2026-03-12 Martin Černý , David Sychrovský , Filip Úradník , Jakub Černý

We revisit the Karagiannidis-Lioumpas (KL) approximation of the Q-function by optimizing its coefficients in terms of absolute error, relative error and total error. For minimizing the maximum absolute/relative error, we describe the…

Signal Processing · Electrical Eng. & Systems 2021-01-20 Islam M. Tanash , Taneli Riihonen

The secondary zeta function is defined as a generalized zeta series over the imaginary parts of non-trivial zeros assuming (RH). This function admits Laurent series expansion at the double pole at $s=1$. In this article, we derive a new…

Number Theory · Mathematics 2026-03-24 Artur Kawalec

In this paper, we introduce a multiscale framework based on adaptive edge basis functions to solve second-order linear elliptic PDEs with rough coefficients. One of the main results is that we prove the proposed multiscale method achieves…

Numerical Analysis · Mathematics 2021-08-19 Yifan Chen , Thomas Y. Hou , Yixuan Wang

In this paper we construct an approximation algorithm for the Minimum Vertex Cover Problem (Min-VC) with an expected approximation ratio of 2-f(beta) for random Power Law Graphs (PLG) in the (alpha,beta)-model of Aiello et. al., where…

Data Structures and Algorithms · Computer Science 2012-04-06 Mikael Gast , Mathias Hauptmann

We study the complexity of approximating the vertex expansion of graphs $G = (V,E)$, defined as \[ \Phi^V := \min_{S \subset V} n \cdot \frac{|N(S)|}{|S| |V \backslash S|}. \] We give a simple polynomial-time algorithm for finding a subset…

Computational Complexity · Computer Science 2013-11-12 Anand Louis , Prasad Raghavendra , Santosh Vempala