Approximate varieties, approximate ideals and dimension reduction

DOI10.1007/S11075-007-9112-4zbMath1135.65010OpenAlexW2021642647MaRDI QIDQ2458336

Thomas Sauer

Publication date: 31 October 2007

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-007-9112-4

zbMATH Keywords

QR decompositiona priori error boundVandermonde matricesreal algebraic varietiesBuchberger-Möller algorithmH-basisapproximate ideal

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computational aspects of higher-dimensional varieties (14Q15)

Related Items (9)

Adjusted least squares fitting of algebraic hypersurfaces ⋮ Verification of a low-degree polynomial vanishing at empirical points ⋮ Simple varieties for limited precision points ⋮ Stable monomial basis for multivariate Birkhoff interpolation problems ⋮ Numerical computation of H-bases ⋮ Prony's method in several variables ⋮ Stable border bases for ideals of points ⋮ Multivariate polynomial interpolation with perturbed data ⋮ Almost vanishing polynomials for sets of limited precision points

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpolation from spaces spanned by monomials
• Polynomial interpolation of minimal degree
• H-bases for polynomial interpolation and system solving
• Gröbner bases, H–bases and interpolation
• Accuracy and Stability of Numerical Algorithms

This page was built for publication: Approximate varieties, approximate ideals and dimension reduction