A study of approximate polynomials. I: Representation and arithmetic

DOI10.1007/BF03167386zbMath0829.65009OpenAlexW2034587850MaRDI QIDQ1895002

Tateaki Sasaki

Publication date: 21 January 1996

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03167386

zbMATH Keywords

algorithmsnumerical examplesdivision algorithmalgebraic computationpolynomial arithmeticapproximate polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical interpolation (65D05) Algorithms for approximation of functions (65D15)

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified method for multivariate polynomial factorizations
• Fast parallel absolute irreducibility testing
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• A hybrid approach for the integration of a rational function
• Analysis of approximate factorization algorithm. I
• Solving multivariate algebraic equation by Hensel construction
• Approximate eigenvalues, eigenvectors and inverse of a matrix with polynomial entries
• All Algebraic Functions Can Be Computed Fast
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Theory of Subresultants

This page was built for publication: A study of approximate polynomials. I: Representation and arithmetic