Numerical computation of H-bases
From MaRDI portal
Publication:1999711
DOI10.1007/s10543-018-0733-xzbMath1420.13061arXiv1803.06203OpenAlexW2963036176WikidataQ57726956 ScholiaQ57726956MaRDI QIDQ1999711
Masoumeh Javanbakht, Thomas Sauer
Publication date: 27 June 2019
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.06203
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast recursive orthogonalization scheme for the Macaulay matrix
- On the null spaces of the Macaulay matrix
- Prony's method in several variables
- Graded syzygies
- Approximate computation of zero-dimensional polynomial ideals
- The multivariate Horner scheme revisited
- Computational aspects of multivariate polynomial interpolation: Indexing the coefficients
- H-bases for polynomial interpolation and system solving
- Approximate varieties, approximate ideals and dimension reduction
- Über das Macaulaysche inverse System und dessen Bedeutung für die Theorie der linearen Differentialgleichungen mit konstanten Koeffizienten
- Gröbner bases, H–bases and interpolation
- Communication Avoiding Rank Revealing QR Factorization with Column Pivoting
- Rank-Deficient and Discrete Ill-Posed Problems
- Accuracy and Stability of Numerical Algorithms
- Numerical Polynomial Algebra
- Computing H-bases via minimal bases for syzygy modules
- The Canonical Decomposition of $\mathcal{C}^n_d$ and Numerical Gröbner and Border Bases
- A Rank-Revealing Method with Updating, Downdating, and Applications
- Multivariate polynomial system solving using intersections of eigenspaces.
