Related papers: Several new quadrature formulas for polynomial int…
In this paper we provide a tetrahedra-free algorithm to compute low-cardinality quadrature rules with a given degree of polynomial exactness, positive weights and interior nodes on a polyhedral element with arbitrary shape. The key tools…
We study the set of image tuples arising from fixed cameras observing varying planar 3-dimensional point configurations. We derive a formula for the number of complex critical points of the triangulation problem, which seeks to reconstruct…
The value of a highly oscillatory integral is typically determined asymptotically by the behaviour of the integrand near a small number of critical points. These include the endpoints of the integration domain and the so-called stationary…
We introduce a new type of quadrature, known as approximate Gaussian quadrature (AGQ) rules using {\epsilon}-quasiorthogonality, for the approximation of integrals of the form \int f(x)d \alpha(x). The measure {\alpha}(\cdot) can be…
In this paper in the space $L_2^{(m)}(0,1)$ the problem of construction of optimal quadrature formulas is considered. Here the quadrature sum consists on values of integrand at nodes and values of first derivative of integrand at the end…
A new method of root finding is formulated that uses a numerical iterative process involving three points. A given function y = f(x) whose roots are desired is fitted and approximated by a polynomial function of the form P(x)= a(x-b)^N that…
The explicit computation of higher-point conformal blocks in any dimension is usually a challenging task. For two-dimensional conformal field theories in Euclidean signature, the oscillator formalism proves to be very efficient. We…
Approximation using Fourier features is a popular technique for scaling kernel methods to large-scale problems, with myriad applications in machine learning and statistics. This method replaces the integral representation of a…
Numerical integration is a classical problem emerging in many fields of science. Multivariate integration cannot be approached with classical methods due to the exponential growth of the number of quadrature nodes. We propose a method to…
Gauss-Lobatto quadrature nodes and weights are optimal for closed summation-by-parts (SBP) formulations based on polynomial approximation spaces in the sense that for a prescribed function space they yield an SBP operator of minimal…
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…
Some mathematical models of applied problems lead to the need of solving boundary value problems with a fractional power of an elliptic operator. In a number of works, approximations of such a nonlocal operator are constructed on the basis…
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…
The polynomial spline collocation method is proposed for solution of Volterra integral equations of the first kind with special piecewise continuous kernels. The Gauss-type quadrature formula is used to approximate integrals during the…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
The polylogarithm function is one of the constellation of important mathematical functions. It has a long history, and many connections to other special functions and series, and many applications, for instance in statistical physics.…
We present simplified formulae for the analytic integration of the Newton potential of polynomials over boxes in two- and three-dimensional space. These are implemented in an easy-to-use C++ library that allows computations in arbitrary…
In molecular physics, it is often necessary to average over the orientation of molecules when calculating observables, in particular when modelling experiments in the liquid or gas phase. Evaluated in terms of Euler angles, this is closely…
We describe a computer algorithm that searches for substitution rules on a set of triangles, the angles of which are all integer multiples of {\pi}/n. We find new substitution rules admitting 7-fold rotational symmetry at many different…
In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of…