Related papers: Computing Fresnel Integrals via Modified Trapezium…
In this paper we extend the theory of optimal approximations of functions $f: \R \to \R$ in the $L^1(\R)$-metric by entire functions of prescribed exponential type (bandlimited functions). We solve this problem for the truncated and the odd…
We present a family of high order trapezoidal rule-based quadratures for a class of singular integrals, where the integrand has a point singularity. The singular part of the integrand is expanded in a Taylor series involving terms of…
In this paper we present two efficient approximations for the complex error function $w \left( {z} \right)$ with small imaginary argument $\operatorname{Im}{\left[ { z } \right]} < < 1$ over the range $0 \le \operatorname{Re}{\left[ { z }…
Two quadrature-based algorithms for computing the matrix fractional power $A^\alpha$ are presented in this paper. These algorithms are based on the double exponential (DE) formula, which is well-known for its effectiveness in computing…
In this preliminary study, we provide two methods for estimating the gradients of functions of real value. Both methods are built on derivative estimations that are calculated using the standard method or the Squire-Trapp method for any…
We consider the finite element approximation of fractional powers of regularly accretive operators via the Dunford-Taylor integral approach. We use a sinc quadrature scheme to approximate the Balakrishnan representation of the negative…
In this paper, we develop a general theory of truncated inverse binomial sampling. In this theory, the fixed-size sampling and inverse binomial sampling are accommodated as special cases. In particular, the classical Chernoff-Hoeffding…
In this paper, we establish several new inequalities for some twice differantiable mappings. Then, we apply these inequalities to obtain new midpoint, trapezoid and perturbed trapezoid rules. Finally, some applications for special means of…
One of the most popular and important first-order iterations that provides optimal complexity of the classical proximal gradient method (PGM) is the "Fast Iterative Shrinkage/Thresholding Algorithm" (FISTA). In this paper, two inexact…
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…
We present a new rational approximation algorithm based on the empirical interpolation method for interpolating a family of parametrized functions to rational polynomials with invariant poles, leading to efficient numerical algorithms for…
In this work we consider sums of primes that converging very slow. We set as a base, a reformulation of analytic prime number theorem and we use the values of Riemann Zeta function for the approximation. We also give the truncation error of…
This paper examines the construction of rth-order truncated balanced realizations via tangential interpolation at r specified interpolation points. It is demonstrated that when the truncated Hankel singular values are negligible-that is,…
Statistical applications often involve the calculation of intractable multidimensional integrals. The Laplace formula is widely used to approximate such integrals. However, in high-dimensional or small sample size problems, the shape of the…
Recently, we developed the projective truncation approximation for the equation of motion of two-time Green's functions (P. Fan et al., Phys. Rev. B 97, 165140 (2018)). In that approximation, the precision of results depends on the…
Purpose of writing this paper is to solve a transcendental function containing a product of a variable and its double exponential by a unique method of approximation. If the value of the said product is given, then its inverse function is…
Let $T$ be a square matrix with a real spectrum, and let $f$ be an analytic function. The problem of the approximate calculation of $f(T)$ is discussed. Applying the Schur triangular decomposition and the reordering, one can assume that $T$…
Fractional physics-informed neural networks (fPINNs) have been successfully introduced in [Pang, Lu and Karniadakis, SIAM J. Sci. Comput. 41 (2019) A2603-A2626], which observe relative errors of $10^{-3} \, \sim \, 10^{-4}$ for the…
Gauss-Legendre quadrature and the trapezoidal rule are powerful tools for numerical integration of analytic functions. For nearly singular problems, however, these standard methods become unacceptably slow. We discuss and generalize some…
We present a novel generalized convolution quadrature method that accurately approximates convolution integrals. During the late 1980s, Lubich introduced convolution quadrature techniques, which have now emerged as a prevalent methodology…