Related papers: A numerical algorithm for computing the zeros of p…
Several asymptotic expansions of parabolic cylinder functions are discussed and error bounds for remainders in the expansions are presented. In particular Poincar{\'e}-type expansions for large values of the argument $z$ and uniform…
Based on the characterization of the polyconvex envelope of isotropic functions by their signed singular value representations, we propose a simple algorithm for the numerical approximation of the polyconvex envelope. Instead of operating…
We present algorithms for computing weakly singular and near-singular integrals arising when solving the 3D Helmholtz equation with curved boundary elements. These are based on the computation of the preimage of the singularity in the…
We propose the first linear-time algorithm to compute the conjugate of (nonconvex) bivariate piecewise linear-quadratic (PLQ) functions (bivariate quadratic functions defined on a polyhedral subdivision). Our algorithm starts with computing…
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends previous work of ours to all curves for which a good lift to characteristic zero is known. We develop all the necessary bounds,…
This paper derives new integral representations for products of two parabolic cylinder functions. In particular, expressions are obtained for D_{nu}(x)D_{mu}(y), with x>0 and y>0, that allow for different orders and arguments in the two…
We propose an approach based on quadratic approximations for solving general Mixed-Integer Nonlinear Programming (MINLP) problems. Specifically, our approach entails the global approximation of the epigraphs of constraint functions by means…
A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…
A general numerical method is presented to locate the partition function zeros in the complex beta plane for large lattice sizes. We apply this method to the 2D Ising model and results are reported for square lattice sizes up tp L=64. We…
We provide a simple and efficient algorithm for computing the Euclidean projection of a point onto the capped simplex---a simplex with an additional uniform bound on each coordinate---together with an elementary proof. Both the MATLAB and…
An algorithm is presented for numerical computation of choreographies in spaces of constant negative curvature in a hyperbolic cotangent potential, extending the ideas given in a companion paper for computing choreographies in the plane in…
We propose a new practical algorithm for computing the Feigenbaum constants {\alpha} and {\delta}, having significantly lower time and space complexity than previously used methods. The algorithm builds upon well-known linear algebra…
We present a new procedure to count the number of real zeros of a class of univariate Pfaffian functions of order $1$. The procedure is based on the construction of Sturm sequences for these functions and relies on an oracle for sign…
In this paper we continue the description of the possibilities to use numerical simulations for mathematically rigorous computer assisted analysis of integrability of dynamical systems. We sketch some of the algebraic methods of studying…
We study the counting function of cubic function fields. Specifically, we derive an asymptotic formula for this counting function including a secondary term and an error term of order $\mathcal{O}\big(X^{2/3+\epsilon}\big)$, which matches…
The inverse Langevin function is a fundamental part of the statistical chain models used to describe the behavior of polymeric-like materials, appearing also in other fields such as magnetism, molecular dynamics and even biomechanics. In…
We show that under some widely believed assumptions, there are no higher-order algorithms for basic tasks in computational mathematics such as: Computing integrals with neural network integrands, computing solutions of a Poisson equation…
We study the use of the Euler-Maclaurin formula to numerically evaluate the Hurwitz zeta function $\zeta(s,a)$ for $s, a \in \mathbb{C}$, along with an arbitrary number of derivatives with respect to $s$, to arbitrary precision with…
Near full-null degenerate singular points of analytic vector fields, asymptotic behaviors of orbits are not given by eigenvectors but totally decided by nonlinearities. Especially, in the case of high full-null degeneracy, i.e., the lowest…
We develop an algorithm for the computation of general Fourier integral operators associated with canonical graphs. The algorithm is based on dyadic parabolic decomposition using wave packets and enables the discrete approximate evaluation…