Related papers: Symmetric Triangle Quadrature Rules for Arbitrary …
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
We use the fermionic construction of two-matrix model partition functions to evaluate integrals over rational symmetric functions. This approach is complementary to the one used in the paper ``Integrals of Rational Symmetric Functions,…
It is shown in this paper that non-conforming finite elements on the triangle using $P^{1}$-nonconforming polynomials and $P^{2}$ -conforming polynomials can be easily built and used.They appear as an 'enriched' version of the standard…
Several problems in magnetically confined fusion, such as the computation of exterior vacuum fields or the decomposition of the total magnetic field into separate contributions from the plasma and the external sources, are best formulated…
In this paper, we identify families of quadrature rules that are exact for sufficiently smooth spline spaces on uniformly refined triangles in $\mathbb{R}^2$. Given any symmetric quadrature rule on a triangle $T$ that is exact for…
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…
We provide an algorithm for computing the number of integral points lying in certain triangles that do not have integral vertices. We use techniques from Algebraic Geometry such as the Riemann-Roch formula for weighted projective planes and…
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…
The paper develops applications of symmetric orbit functions, known from irreducible representations of simple Lie groups, in numerical analysis. It is shown that these functions have remarkable properties which yield to cubature formulas,…
The well-known spatial integration schemes in molecular electronic structure theory, immune to cusps and point singularities of some kind at atomic positions, use a set of weighting functions to split the integrand into a sum of…
Quadrature rules using higher order digital nets and sequences are known to exploit the smoothness of a function for numerical integration and to achieve an improved rate of convergence as compared to classical digital nets and sequences…
In this paper, we propose a new trigonometric interpolation algorithm and establish relevant convergent properties. The method adjusts an existing trigonometric interpolation algorithm such that it can better leverage Fast Fourier Transform…
The problem of estimating single- and multi-dimensional integrals, with or without end-point singularities, is prevalent in all fields of scientific research, and in particular in physics. Although tanh-sinh quadrature is known to handle…
This paper presents a high-order accurate numerical quadrature algorithm for evaluating integrals over curved surfaces and regions defined implicitly via a level set of a given function restricted to a hyperrectangle. The domain is divided…
We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…
We study multivariate integration over the $s$-dimensional unit cube in a weighted space of infinitely differentiable functions. It is known from a recent result by Suzuki that there exists a good quasi-Monte Carlo (QMC) rule which achieves…
The suitable basis functions for approximating periodic function are periodic, trigonometric functions. When the function is not periodic, a viable alternative is to consider polynomials as basis functions. In this paper we will point out…
A formula for calculating Extensions of (mainly integral) Polynomial Functors is established, based upon projective resolutions. Sample computations are performed, which, in particular, exhibit a surprising non-trivial extension of Divided…
This document describes an attempt to develop a compiler-based approach for computations with symmetric tensors. Given a computation and the symmetries of its input tensors, we derive formulas for random access under a storage scheme that…
In this paper, a class of optimization problems with nonlinear inequality constraints is discussed. Based on the ideas of sequential quadratic programming algorithm and the method of strongly sub-feasible directions, a new superlinearly…