Related papers: Gram quadrature: numerical integration with Gram p…
A fast non-polynomial interpolation is proposed in this paper for functions with logarithmic singularities. It can be executed fast with the discrete cosine transform. Based on this interpolation, a new quadrature is proposed for a kind of…
Zernike polynomials are a basis of orthogonal polynomials on the unit disk that are a natural basis for representing smooth functions. They arise in a number of applications including optics and atmospheric sciences. In this paper, we…
The Zernike radial polynomials are a system of orthogonal polynomials over the unit interval with weight x. They are used as basis functions in optics to expand fields over the cross section of circular pupils. To calculate the roots of…
Newton's method is used to approximate roots of complex valued functions f by creating a sequence of points that converges to a root of f in the usual topology. For any field K equipped with a set of pairwise inequivalent absolute values…
An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves the square root of an elliptic operator of second order. Finite element approximation in space is employed.…
Many problems in applied mathematics require root finding algorithms. Unfortunately, root finding methods have limitations. Firstly, regarding the convergence, there is a trade-off between the size of it's domain and it's rate. Secondly the…
Sometimes it is necessary to obtain a numerical integration using only discretised data. In some cases, the data contains singularities which position is known but does not coincide with a discretisation point, and the jumps in the function…
Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.
An algorithm for integration of polynomial functions with variable weight is considered. It provides extension of the Gaussian integration, with appropriate scaling of the abscissas and weights. Method is a good alternative to usually…
The work reported in this article presents a high-order, stable, and efficient Gegenbauer pseudospectral method to solve numerically a wide variety of mathematical models. The proposed numerical scheme exploits the stability and the…
We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest…
Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…
Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum…
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on…
We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…
We investigate a Gaussian quadrature rule and the corresponding orthogonal polynomials for the oscillatory weight function $e^{i\omega x}$ on the interval $[-1,1]$. We show that such a rule attains high asymptotic order, in the sense that…
This work presents arbitrary high order well balanced finite volume schemes for the Euler equations with a prescribed gravitational field. It is assumed that the desired equilibrium solution is known, and we construct a scheme which is…
We revisit the problem of extending quadrature formulas for general weight functions, and provide a generalization of Patterson's method for the constant weight function. The method can be used to compute a nested sequence of quadrature…
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…