H-bases for polynomial interpolation and system solving
DOI10.1023/A:1018937723499zbMATH Open0943.65059OpenAlexW1571225315MaRDI QIDQ1968637FDOQ1968637
Authors: Tomas Sauer, Hans-Michael Möller
Publication date: 21 March 2000
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018937723499
Recommendations
interpolationeigenvectorspolynomial zerosmultivariate polynomialssystems of polynomial equationsideal basesH-bases conceptGröbner bases
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10)
Cited In (31)
- Properties of Generalized Polynomial Spaces in Three Variables
- Prony's method in several variables
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
- Using symmetries in the eigenvalue method for polynomial systems
- A multivariate generalization of Prony's method
- The properly posed set of nodes of multivariate Lagrange interpolation along algebraic manifold
- Gröbner bases, H-bases and interpolation
- Polynomial interpolation, ideals and approximation order of multivariate refinable functions
- Nearest multivariate system with given root multiplicities
- Simultaneous triangularization of commuting matrices for the solution of polynomial equations
- Symmetry in multivariate ideal interpolation
- Multivariate interpolation: preserving and exploiting symmetry
- Prony's method in several variables: symbolic solutions by universal interpolation
- Numerical computation of H-bases
- On one class of Hermite projectors
- Efficient polynomial reduction
- Expected term bases for generic multivariate Hermite interpolation
- An algorithm to compute the H-bases for ideals of subalgebras
- Solving polynomial systems via truncated normal forms
- Computing H-bases via minimal bases for syzygy modules
- Approximate varieties, approximate ideals and dimension reduction
- Approximate computation of zero-dimensional polynomial ideals
- Applications of the Connection between Approximation Theory and Algebra
- Lagrange interpolation on subgrids of tensor product grids
- Algorithms for fundamental invariants and equivariants of finite groups
- Standard bases for modules over polynomial subalgebras
- Title not available (Why is that?)
- General solution of the scattering equations
- Stable normal forms for polynomial system solving
- On the singularity of multivariate Hermite interpolation
- An algorithm for implicit interpolation
This page was built for publication: H-bases for polynomial interpolation and system solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968637)