Computational existence proofs for spherical \(t\)-designs
From MaRDI portal
Publication:623336
DOI10.1007/s00211-010-0332-5zbMath1208.65032OpenAlexW2036738119MaRDI QIDQ623336
Bruno Lang, Andreas Frommer, Xiaojun Chen
Publication date: 14 February 2011
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-010-0332-5
algorithmnonlinear systemnumerical examplesinterval arithmeticquadrature rulesinterval enclosurespherical \(t\)-designs
Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30) Multidimensional problems (41A63) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32) Algorithms with automatic result verification (65G20)
Related Items
Design theory from the viewpoint of algebraic combinatorics ⋮ A smoothing trust region filter algorithm for nonsmooth least squares problems ⋮ Explicit spherical designs ⋮ Spherical $t_\epsilon $-designs for approximations on the sphere ⋮ Sobolev estimates for constructive uniform-grid FFT interpolatory approximations of spherical functions ⋮ QMC designs: Optimal order Quasi Monte Carlo integration schemes on the sphere ⋮ Modular forms and ellipsoidal \(T\)-designs ⋮ Optimal asymptotic bounds for spherical designs ⋮ Point sets on the sphere \(\mathbb{S}^{2}\) with small spherical cap discrepancy ⋮ The Laurent-Horner method for validated evaluation of Chebyshev expansions ⋮ Sparse grid quadrature on products of spheres ⋮ VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities ⋮ Spherical Framelets from Spherical Designs ⋮ Explicit Families of Functions on the Sphere with Exactly Known Sobolev Space Smoothness ⋮ Efficient Spherical Designs with Good Geometric Properties ⋮ On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms ⋮ Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere ⋮ Quadrature rules with neighborhood of spherical designs on the two-sphere ⋮ Enclosing Chebyshev Expansions in Linear Time ⋮ Numerical construction of spherical \(t\)-designs by Barzilai-Borwein method ⋮ Verified error bounds for singular solutions of nonlinear systems ⋮ An improved verification algorithm for nonlinear systems of equations based on Krawczyk operator ⋮ Numerical computation of triangular complex spherical designs with small mesh ratio ⋮ Distributing many points on spheres: minimal energy and designs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A variational characterisation of spherical designs
- A survey on spherical designs and algebraic combinatorics on spheres
- Averaging sets: A generalization of mean values and spherical designs
- Spherical codes and designs
- Extremal systems of points and numerical integration on the sphere
- McLaren's improved snub cube and other new spherical designs in three dimensions
- Parametric interval linear solver
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Zur Berechnung von verlässlichen Außen- und Inneneinschließungen bei parameterabhängigen linearen Gleichungssystemen
- Expansion and estimation of the range of nonlinear functions
- Spherical faraday cage for the case of equal point charges and chebyshev-type quadrature on the sphere
- Existence of Solutions to Systems of Underdetermined Equations and Spherical Designs
