Approximate varieties, approximate ideals and dimension reduction (Q2458336): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4305609 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interpolation from spaces spanned by monomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2902935 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5689624 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Accuracy and Stability of Numerical Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: H-bases for polynomial interpolation and system solving / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial interpolation of minimal degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Gröbner bases, H–bases and interpolation / rank | |||
Normal rank |
Latest revision as of 11:15, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximate varieties, approximate ideals and dimension reduction |
scientific article |
Statements
Approximate varieties, approximate ideals and dimension reduction (English)
0 references
31 October 2007
0 references
The author discusses a method to compute real algebraic varieties of comparatively low dimension and low degree which contain given points in a numerical, inexact setting. It relies on the notions of \(p\)-approximate ideal \(I_{p,\varepsilon}(\Xi)\) and approximate H-basis associated with a finite set \(\Xi\subset\mathbb R^d\). The former is defined by \(f\in I_{p,\varepsilon}(\Xi) \Leftrightarrow \| f(\Xi)\| _{\ell^p(\Xi)}\leq \varepsilon\| f\| \), where \(\| f\| ^2\) equals the squared sum of coefficients of \(f\), and \(p\in [1,\infty]\). The latter means an H-basis contained in \(I_{p,\varepsilon}(\Xi)\). The main result of the paper is a recursive procedure for the computation of an approximate H-basis, which involves a QR decomposition of Vandermonde matrices. Further, a rather pessimistic a priori error bound is given.
0 references
Buchberger-Möller algorithm
0 references
H-basis
0 references
approximate ideal
0 references
real algebraic varieties
0 references
QR decomposition
0 references
Vandermonde matrices
0 references
a priori error bound
0 references