A study of approximate polynomials. I: Representation and arithmetic

DOI10.1007/BF03167386MaRDI QIDQ1895002zbMATH OpenOpenAlexFDO

Authors 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

algebraic computationalgorithmsapproximate polynomialsdivision algorithmnumerical examplespolynomial arithmetic

Mathematics Subject Classification ID

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

Review text

The author proposes a simple representation and algorithms for the basic arithmetic operations and clarifies some pathological properties of approximate polynomials. He proposes a division algorithm which maintains accuracy as high as possible. Advantages and inconveniences are presented extensively. Some examples demonstrate the efficiency of the algorithm.

Recommendations

• An algebraic approach to approximate evaluation of a polynomial on a set of real points
• scientific article; zbMATH DE number 4110094
• scientific article; zbMATH DE number 3856407
• Analysis of approximate factorization algorithm. I
• Polynomial division with a remainder by means of evaluation and interpolation

Cites work

• A hybrid approach for the integration of a rational function
• A unified method for multivariate polynomial factorizations
• All Algebraic Functions Can Be Computed Fast
• Analysis of approximate factorization algorithm. I
• Approximate eigenvalues, eigenvectors and inverse of a matrix with polynomial entries
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• Fast parallel absolute irreducibility testing
• scientific article; zbMATH DE number 40793 (Why is no real title available?)
• scientific article; zbMATH DE number 62660 (Why is no real title available?)
• scientific article; zbMATH DE number 62668 (Why is no real title available?)
• scientific article; zbMATH DE number 516973 (Why is no real title available?)
• On Euclid's Algorithm and the Theory of Subresultants
• Solving multivariate algebraic equation by Hensel construction
• Subresultants and Reduced Polynomial Remainder Sequences

Cited in

(3)

• scientific article; zbMATH DE number 4016032 (Why is no real title available?)
• Algorithms for computational precision
• scientific article; zbMATH DE number 1376646 (Why is no real title available?)

Describes a project that uses

Uses Software

• Maple

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1895002)