Related papers: Computing with functions in the ball
The decompositions of an element of a finite von Neumann algebra into the sum of a normal operator plus an s.o.t.-quasinilpotent operator, obtained using the Haagerup--Schultz hyperinvariant projections, behave well with respect to…
In this paper, we propose a numerical method of computing an integral whose integrand is a slowly decaying oscillatory function. In the proposed method, we consider a complex analytic function in the upper-half complex plane, which is…
Our goal is to find accurate and efficient algorithms, when they exist, for evaluating rational expressions containing floating point numbers, and for computing matrix factorizations (like LU and the SVD) of matrices with rational…
The development of accurate and fast numerical schemes for the five fold Boltzmann collision integral represents a challenging problem in scientific computing. For a particular class of interactions, including the so-called hard spheres…
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 present a MATLAB function for the numerical evaluation of the Faddeyeva function w(z). The function is based on a newly developed accurate algorithm. In addition to its higher accuracy, the software provides a flexible accuracy vs…
In spite of considerable progress, computing curvature in Volume of Fluid (VOF) methods continues to be a challenge. The goal is to develop a function or a subroutine that returns the curvature in computational cells containing an interface…
We introduce a new algorithm for computing the periods of a smooth complex projective hypersurface. The algorithm intertwine with a new method for computing an explicit basis of the singular homology of the hypersurface. It is based on…
We present a novel class of methods to compute functions of matrices or their action on vectors that are suitable for parallel programming. Solving appropriate simple linear systems of equations in parallel (or computing the inverse of…
We study smooth function spaces of Gelfand-Shilov type, with global behavior governed through a translation-invariant Banach function space and localized via a weight function system. We clarify the roles of the translation-invariant Banach…
In this work we describe a fast and stable algorithm for the computation of the orthogonal moments of an image. Indeed, orthogonal moments are characterized by a high discriminative power, but some of their possible formulations are…
Fold functions are a general mechanism for computing over recursive data structures. First-order folds compute results bottom-up. With higher-order folds, computations that inherit attributes from above can also be expressed. In this paper,…
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…
The theoretical computing of special values assumed by the hypergeometric functions has a high interest not only on its own, but also in sight of the remarkable implications to both pure Mathematics and Mathematical Physics. Accordingly, in…
In computer graphics, smooth data reconstruction on 2D or 3D manifolds usually refers to subdivision problems. Such a method is only valid based on dense sample points. The manifold usually needs to be triangulated into meshes (or patches)…
We investigate the possibilities to calculate vector partition functions by means of iterated partial fraction decomposition, as suggested by Beck (2004). Particularly, for an important type of families of rational functions, we describe an…
Regarding quaternions as normal matrices, we first characterize the $2\times 2$ matrix-valued functions, defined on subsets of quaternions, whose values are quaternions. Then we investigate the regularity of quaternionic-valued functions,…
A broad range of inverse problems can be abstracted into the problem of minimizing the sum of several convex functions in a Hilbert space. We propose a proximal decomposition algorithm for solving this problem with an arbitrary number of…
This paper presents a method for the accurate and efficient computations on scalar, vector and tensor fields in three-dimensional spherical polar coordinates. The methods uses spin-weighted spherical harmonics in the angular directions and…
Consider an oracle which takes a point $x$ and returns the minimizer of a convex function $f$ in an $\ell_2$ ball of radius $r$ around $x$. It is straightforward to show that roughly $r^{-1}\log\frac{1}{\epsilon}$ calls to the oracle…