A study of approximate polynomials. I: Representation and arithmetic
DOI10.1007/BF03167386zbMATH Open0829.65009OpenAlexW2034587850MaRDI QIDQ1895002FDOQ1895002
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
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
algorithmsnumerical examplesdivision algorithmalgebraic computationpolynomial arithmeticapproximate polynomials
Symbolic computation and algebraic computation (68W30) Numerical interpolation (65D05) Algorithms for approximation of functions (65D15)
Cites Work
- Title not available (Why is that?)
- All Algebraic Functions Can Be Computed Fast
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Theory of Subresultants
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Analysis of approximate factorization algorithm. I
- Solving multivariate algebraic equation by Hensel construction
- A unified method for multivariate polynomial factorizations
- Fast parallel absolute irreducibility testing
- Title not available (Why is that?)
- Approximate eigenvalues, eigenvectors and inverse of a matrix with polynomial entries
- A hybrid approach for the integration of a rational function
Cited In (2)
Uses Software
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)
