Related papers: Numerical cubature and hyperinterpolation over Sph…
We present computational methods for constructing orthogonal/orthonormal polynomials over arbitrary polygonal domains in $\mathbb{R}^2$ using bivariate spline functions. Leveraging a mature MATLAB implementation which generates spline…
Iterative methods with certified convergence for the computation of Gauss--Jacobi quadratures are described. The methods do not require a priori estimations of the nodes to guarantee its fourth-order convergence. They are shown to be…
We describe a new method to compute general cubature formulae. The problem is initially transformed into the computation of truncated Hankel operators with flat extensions. We then analyse the algebraic properties associated to flat…
The problem of interpolation at $(n+1)^2$ points on the unit sphere $\mathbb{S}^2$ by spherical polynomials of degree at most $n$ is proved to have a unique solution for several sets of points. The points are located on a number of circles…
A method of deriving quadrature rules has been developed which gives nodes and weights for a Gaussian-type rule which integrates functions of the form: f(x,y,t) = a(x,y,t)/((x-t)^2+y^2) + b(x,y,t)/([(x-t)^2+y^2]^{1/2}) +…
Integral equation methods for the solution of partial differential equations, when coupled with suitable fast algorithms, yield geometrically flexible, asymptotically optimal and well-conditioned schemes in either interior or exterior…
The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…
This paper presents enhanced reductions of the bounded-weight and exact-weight Syndrome Decoding Problem (SDP) to a system of quadratic equations. Over $\mathbb{F}_2$, we improve on a previous work and study the degree of regularity of the…
We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…
Spherical needlets are highly localized radial polynomials on the sphere $\mathbb{S}^{d}\subset \mathbb{R}^{d+1}$, $d\ge 2$, with centers at the nodes of a suitable cubature rule. The original semidiscrete spherical needlet approximation of…
A new algorithm for the efficient numerical approximation of weakly singular integrals over convex polytopes is introduced. Such integrals appear in the Galerkin discretizations of integral equations and nonlocal partial differential…
In this paper we discuss two different existing algorithms for computing topological entropy and we perform one of them in order to compute the isentropes for cubic polynomials.
A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…
Computing spherical harmonic decompositions is a ubiquitous technique that arises in a wide variety of disciplines and a large number of scientific codes. Because spherical harmonics are defined by integrals over spheres, however, one must…
It is a widely held view that analytical integration is more accurate than the numerical one. In some special cases, however, numerical integration can be more advantageous than analytical integration. In our paper we show this benefit for…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…
Interpolation of jointly infeasible predicates plays important roles in various program verification techniques such as invariant synthesis and CEGAR. Intrigued by the recent result by Dai et al.\ that combines real algebraic geometry and…
We present a unified interpolation scheme that combines compactly-supported positive-definite kernels and multivariate polynomials. This unified framework generalizes interpolation with compactly-supported kernels and also classical…
This paper investigates the role of quadrature exactness in the approximation scheme of hyperinterpolation. Constructing a hyperinterpolant of degree $n$ requires a positive-weight quadrature rule with exactness degree $2n$. We examine the…