Related papers: Computing with functions in the ball
This article presents novel numerical algorithms based on pseudodifferential operators for fast, direct, solution of the Helmholtz equation in 1D, 2D, and 3D inhomogeneous unbounded media. The proposed approach relies on an Operator Fourier…
The goal of this paper is to introduce and study some geometric properties of slice regular functions of quaternion variable like univalence, subordination, starlikeness, convexity and spirallikeness in the unit ball. We prove a number of…
We present two algorithms, one quantum and one classical, for estimating partition functions of quantum spin Hamiltonians. The former is a DQC1 (Deterministic quantum computation with one clean qubit) algorithm, and the first such for…
If f is a smooth function on a Hodge manifold, we construct a canonical sequence of real algebraic functions that converge to f in the smooth topology. The definition of of the approximants is inspired by Berezin-Toeplitz quantization. The…
We show how to extrapolate an analytic function (or a smooth signal) by multiplying and dividing its values on geometric sequences that collapse to a point.
The two-dimensional Helmholtz equation separates in elliptic coordinates based on two distinct foci, a limit case of which includes polar coordinate systems when the two foci coalesce. This equation is invariant under the Euclidean group of…
Classical density functional theory (DFT) of fluids is a valuable tool to analyze inhomogeneous fluids. However, few numerical solution algorithms for three-dimensional systems exist. Here we present an efficient numerical scheme for fluids…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
In the article we outline the set of Matlab functions that enable the computation of elliptic Integrals and Jacobian elliptic functions for real arguments. Correctness, robustness, efficiency and accuracy of the functions are discussed in…
In the articles [1] and [2] of D. Finch, M. Haltmeier, S. Patch and D. Rakesh inversion formulas were found in any dimension $n\geq2$ for recovering a smooth function with compact support in the unit ball from spherical means centered on…
A new analytical characterization of balls in the Euclidean space $\RR^m$ is obtained. Unlike previous results of this kind, using either harmonic functions or solutions to the modified Helmholtz equation, the present one is based on…
The maximum function, on vectors of real numbers, is not differentiable. Consequently, several differentiable approximations of this function are popular substitutes. We survey three smooth functions which approximate the maximum function…
Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…
In the present work, an attempted was made to develop a numerical algorithm by the use of new orthogonal hybrid functions formed from hybrid of piecewise constant orthogonal sample-and-hold functions and piecewise linear orthogonal…
We prove a Cauchy-type integral representation for classes of functions holomorphic in four priviledged tuboid domains of the complexified one-sheeted two-dimensional hyperboloid. From a physical viewpoint, this hyperboloid can be used for…
We present the first computation of the complete two-loop, fully-differential soft function describing the production of a heavy-quark pair in association with a color-singlet system at hadron colliders. This result constitutes one of the…
In our recent publication [1] we presented an exponential series approximation suitable for highly accurate computation of the complex error function in a rapid algorithm. In this Short Communication we describe how a simplified…
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…
The error function of real argument can be uniformly approximated to a given accuracy by a single closed-form expression for the whole variable range either in terms of addition, multiplication, division, and square root operations only, or…
The $\mathcal{VU}$-algorithm is a superlinearly convergent method for minimizing nonsmooth, convex functions. At each iteration, the algorithm works with a certain $\mathcal{V}$-space and its orthogonal $\U$-space, such that the…