A complete algorithm to find exact minimal polynomial by approximations
From MaRDI portal
Publication:4902848
DOI10.1080/00207160.2012.716199zbMath1257.41017arXiv1001.0649OpenAlexW1888522205MaRDI QIDQ4902848
Jing-Zhong Zhang, Jingwei Chen, Xiaolin Qin, Yong Feng
Publication date: 18 January 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.0649
minimal polynomialsymbolic-numerical computationerror controllable algorithminteger relation construction
Symbolic computation and algebraic computation (68W30) Uniqueness of best approximation (41A52) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Related Items
Computing the determinant of a matrix with polynomial entries by approximation, Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
Cites Work
- Unnamed Item
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Applications of integer relation algorithms
- Approximate gcds of polynomials and sparse SOS relaxations
- From an approximate to an exact absolute polynomial factorization
- Obtaining exact value by approximate computations
- Emerging Tools for Experimental Mathematics
- Error Estimates for the Approximation of a Class of Optimal Control Systems Governed by Linear PDEs
- Ten Problems in Experimental Mathematics
- Analysis of PSLQ, an integer relation finding algorithm
- A fourth order Runge–Kutta RK(4,4) method with error control
- Approximate solution for a variable-coefficient semilinear heat equation with nonlocal boundary conditions
