Efficient polynomial reduction
DOI10.1007/S10444-004-7208-0zbMATH Open1109.13024OpenAlexW2020977746MaRDI QIDQ878085FDOQ878085
Publication date: 26 April 2007
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10444-004-7208-0
Recommendations
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)
Cites Work
- Title not available (Why is that?)
- Accuracy and Stability of Numerical Algorithms
- On multivariate polynomial interpolation
- Polynomial interpolation in several variables
- H-bases for polynomial interpolation and system solving
- Gröbner bases, H-bases and interpolation
- Computational aspects of multivariate polynomial interpolation
- Simultaneous backward stability of Gauss and Gauss–Jordan elimination
- Computational aspects of multivariate polynomial interpolation: Indexing the coefficients
- On the Multivariate Horner Scheme
- Scaled Pivots and Scaled Partial Pivoting Strategies
Cited In (9)
- Gröbner bases, H-bases and interpolation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation of the controls for the beam equation with vanishing viscosity
- A note on polynomial reduction
- Computing H-bases via minimal bases for syzygy modules
- Title not available (Why is that?)
- Minimal homogeneous bases for polynomial ideals
- An algorithm for implicit interpolation
Uses Software
This page was built for publication: Efficient polynomial reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878085)
