Related papers: A fast and simple algorithm for the computation of…
We examine the use of the Euler-Maclaurin formula and new derived uniform asymptotic expansions for the numerical evaluation of the Lerch transcendent $\Phi(z, s, a)$ for $z, s, a \in \mathbb{C}$ to arbitrary precision. A detailed analysis…
Methods for the computation of classical Gaussian quadrature rules are described which are effective both for small and large degree. These methods are reliable because the iterative computation of the nodes has guaranteed convergence, and…
We consider the computation of the matrix logarithm by using numerical quadrature. The efficiency of numerical quadrature depends on the integrand and the choice of quadrature formula. The Gauss--Legendre quadrature has been conventionally…
In this article, we focus on the error that is committed when computing the matrix logarithm using the Gauss--Legendre quadrature rules. These formulas can be interpreted as Pad\'e approximants of a suitable Gauss hypergeometric function.…
We describe a strategy for rigorous arbitrary-precision evaluation of Legendre polynomials on the unit interval and its application in the generation of Gauss-Legendre quadrature rules. Our focus is on making the evaluation practical for a…
This paper introduces a very fast method for the computation of the resolvent of fractional powers of operators. The analysis is kept in the continuous setting of (potentially unbounded) self adjoint positive operators in Hilbert spaces.…
Iterative methods with certified convergence for the computation of Gauss--Jacobi quadratures are described. The methods do not require a priori estimations of the nodes to guarantee its fourth-order convergence. They are shown to be…
Algorithms for computing the classical Gaussian quadrature rules (Gauss--Jacobi, Gauss--Laguerre, and Gauss--Hermite) are presented, based on globally convergent fourth-order iterative methods combined with asymptotic approximations, which…
The use of average kernel method based on the Laplace transformation can significantly simplify the procedure for obtaining approximate analytical solution of Smoluchowski equation. However, this method also has its own shortcomings, one of…
A fast and accurate algorithm for the computation of Gauss-Hermite and generalized Gauss-Hermite quadrature nodes and weights is presented. The algorithm is based on Newton's method with carefully selected initial guesses for the nodes and…
We derive new reduction formulas for the incomplete beta function and the Lerch transcendent in terms of elementary functions. As an application, we calculate some new integrals. Also, we use these reduction formulas to test the performance…
To address the computational challenges posed by nonlinear collision kernels in the Smoluchowski equation, this study proposes a universal preprocessing algorithm for the average kernel method based on the Gauss-Laguerre quadrature for…
The quadrature error associated with a regular quadrature rule for evaluation of a layer potential increases rapidly when the evaluation point approaches the surface and the integral becomes nearly singular. Error estimates are needed to…
Any practical attempt to solve the Regge equations, these being a large system of non-linear algebraic equations, will almost certainly employ a Newton-Raphson like scheme. In such cases it is essential that efficient algorithms be used…
The sparse difference resultant introduced in \citep{gao-2015} is a basic concept in difference elimination theory. In this paper, we show that the sparse difference resultant of a generic Laurent transformally essential system can be…
In this contribution we deal with Gaussian quadrature rules based on orthogonal polynomials associated with a weight function $w(x)= x^{\alpha} e^{-x}$ supported on an interval $(0,z)$, $z>0.$ The modified Chebyshev algorithm is used in…
We consider the approximation of the inverse square root of regularly accretive operators in Hilbert spaces. The approximation is of rational type and comes from the use of the Gauss-Legendre rule applied to a special integral formulation…
The Golub-Welsch algorithm [ Math. Comp., 23: 221-230 (1969)] has long been assumed symmetric for estimating quadratic forms. Recent research indicates that asymmetric quadrature nodes may be more often and the existence of a practical…
The Lagrange-mesh method is a powerful method to solve eigenequations written in configuration space. It is very easy to implement and very accurate. Using a Gauss quadrature rule, the method requires only the evaluation of the potential at…
We suggest a method for simultaneously generating high order quadrature weights for integrals over Lipschitz domains and their boundaries that requires neither meshing nor moment computation. The weights are determined on pre-defined…