Finding exact minimal polynomial by approximations
DOI10.1145/1577190.1577211zbMATH Open1356.65039arXiv0902.0828OpenAlexW2000161988WikidataQ130990562 ScholiaQ130990562MaRDI QIDQ2959025FDOQ2959025
Authors: Xiaolin Qin, Yong Feng, Jingwei Chen, Jingzhong Zhang
Publication date: 3 February 2017
Published in: Proceedings of the 2009 conference on Symbolic numeric computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0902.0828
Recommendations
- A complete algorithm to find exact minimal polynomial by approximations
- A Method to Compute Minimal Polynomials
- On the computation of minimal polynomials
- Reconstructing a minimal polynomial from approximate algebraic numbers
- scientific article; zbMATH DE number 811988
- Near minimax polynomial approximation
- Computing and using minimal polynomials
- An algorithm for a result on minimal polynomials
- scientific article; zbMATH DE number 4162881
- Minimizing polynomial functions
minimal polynomialalgebraic numbersymbolic-numerical computationnumerical approximate computationinteger relation algorithm
Symbolic computation and algebraic computation (68W30) Algorithms for approximation of functions (65D15)
Cited In (5)
Uses Software
This page was built for publication: Finding exact minimal polynomial by approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959025)