Efficient polynomial reduction

DOI10.1007/s10444-004-7208-0zbMath1109.13024OpenAlexW2020977746MaRDI QIDQ878085

Juan Manuel Peña, Thomas Sauer

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

zbMATH Keywords

numerical stabilitypolynomial reductionH-bases

Mathematics Subject Classification ID

Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) 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)

Related Items (4)

Unnamed Item ⋮ Computing H-bases via minimal bases for syzygy modules ⋮ An algorithm for implicit interpolation ⋮ Approximation of the controls for the beam equation with vanishing viscosity

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Computational aspects of multivariate polynomial interpolation
• Computational aspects of multivariate polynomial interpolation: Indexing the coefficients
• H-bases for polynomial interpolation and system solving
• Polynomial interpolation in several variables
• On multivariate polynomial interpolation
• Gröbner bases, H–bases and interpolation
• Scaled Pivots and Scaled Partial Pivoting Strategies
• On the Multivariate Horner Scheme
• Accuracy and Stability of Numerical Algorithms
• Simultaneous backward stability of Gauss and Gauss–Jordan elimination

This page was built for publication: Efficient polynomial reduction