English
Related papers

Related papers: Stable evaluation of Gaussian radial basis functio…

200 papers

Recently, Haglund and Visontai established the stability of the multivariate Eulerian polynomials as the generating polynomials of the Stirling permutations, which serves as a unification of some results of B\'{o}na, Brenti, Janson, Kuba,…

Combinatorics · Mathematics 2012-08-09 William Y. C. Chen , Robert X. J. Hao , Harold R. L. Yang

A method for evaluating matrix polynomials have recently been developed that require one fewer matrix product ($1M$) than the Paterson--Stockmeyer (PS) method. Since the computational cost for large-scale matrices is asymptotically…

Numerical Analysis · Mathematics 2026-03-25 J. M. Alonso , J. Sastre , J. Ibáñez , E. Defez

Radial basis functions provide highly useful and flexible interpolants to multivariate functions. Further, they are beginning to be used in the numerical solution of partial differential equations. Unfortunately, their construction requires…

Numerical Analysis · Mathematics 2010-06-15 Brad Baxter

We consider interpolation of univariate functions on arbitrary sets of nodes by Gaussian radial basis functions or by exponential functions. We derive closed-form expressions for the interpolation error based on the…

Numerical Analysis · Mathematics 2012-12-18 Dmitry Yarotsky

A new effective solution to the problem of Hermite $G^1$ interpolation with a clothoid curve is here proposed, that is a clothoid that interpolates two given points in a plane with assigned unit tangent vectors. The interpolation problem is…

Numerical Analysis · Mathematics 2016-07-18 Enrico Bertolazzi , Marco Frego

In this paper the author reviews a version of the global Galerkin that was developed and applied in a series of earlier publications. The method is based on divergence-free basis functions satisfying all the linear and homogeneous boundary…

Fluid Dynamics · Physics 2018-04-13 Alexander Gelfgat

In this work, we apply a semi-Lagrangian spectral method for the Vlasov-Poisson system, previously designed for periodic Fourier discretizations, by implementing Legendre polynomials and Hermite functions in the approximation of the…

Numerical Analysis · Mathematics 2018-07-09 Lorella Fatone , Daniele Funaro , Gianmarco Manzini

We introduce a method to reconstruct an element of a Hilbert space in terms of an arbitrary finite collection of linearly independent reconstruction vectors, given a finite number of its samples with respect to any Riesz basis. As we…

Numerical Analysis · Mathematics 2010-12-01 Ben Adcock , Anders C. Hansen

We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…

Numerical Analysis · Mathematics 2012-07-17 Erwan Faou , Fabio Nobile , Christophe Vuillot

A fast and accurate algorithm for the computation of Gauss-Hermite and generalized Gauss-Hermite quadrature nodes and weights is presented. The algorithm is based on Newton's method with carefully selected initial guesses for the nodes and…

Numerical Analysis · Mathematics 2014-10-21 Alex Townsend , Thomas Trogdon , Sheehan Olver

Block-to-block interface interpolation operators are constructed for several common high-order finite difference discretizations. In contrast to conventional interpolation operators, these new interpolation operators maintain the strict…

Numerical Analysis · Mathematics 2009-02-18 K. Mattsson , Mark H. Carpenter

One commonly finds in applications of smooth radial basis functions (RBFs) that scaling the kernels so they are `flat' leads to smaller discretization errors. However, the direct numerical approach for computing with flat RBFs (RBF-Direct)…

Numerical Analysis · Mathematics 2017-01-04 Grady B. Wright , Bengt Fornberg

The fermionic Gaussian operator basis provides a representation for treating strongly correlated fermion systems, as well as playing an important role in random matrix theory. We prove that a resolution of unity exists for any even…

Mathematical Physics · Physics 2015-06-11 Laura E. C. Rosales-Zárate , P. D. Drummond

We prove the convergence of discontinuous Galerkin approximations for the Vlasov-Poisson system written as an hyperbolic system using Hermite polynomials in velocity. To obtain stability properties, we introduce a suitable weighted L 2…

Numerical Analysis · Mathematics 2023-02-07 Marianne Bessemoulin-Chatard , Francis Filbet

We propose a framework that allows us to analyze different variants of HDG methods for the static Maxwell equations using one simple analysis. It reduces all the work to the construction of projections that best fit the structures of the…

Numerical Analysis · Mathematics 2020-02-28 Shukai Du , Francisco-Javier Sayas

This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal $I$. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending…

Symbolic Computation · Computer Science 2008-12-02 Bernard Mourrain , Philippe Trébuchet

We propose an adaptive Hermite spectral method for the Vlasov-Poisson system based on a recently developed frequency indicator that measures the contribution of the high-order expansion coefficients. Precisely, the symmetrically weighted…

Numerical Analysis · Mathematics 2026-05-19 Sihong Shao , Yanli Wang , Jie Wu

We consider positivity conditions both for real-valued functions of several complex variables and for Hermitian forms. We prove a stabilization theorem relating these two notions, and give some applications to proper mappings between balls…

Complex Variables · Mathematics 2008-02-03 David W. Catlin , John P. D'Angelo

In uncertainty quantification, critical parameters of mathematical models are substituted by random variables. We consider dynamical systems composed of ordinary differential equations. The unknown solution is expanded into an orthogonal…

Numerical Analysis · Mathematics 2019-04-10 Roland Pulch , Florian Augustin

In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…

Commutative Algebra · Mathematics 2007-05-23 Vladimir P. Gerdt