Analysis of approximate factorization algorithm. I
From MaRDI portal
Publication:1202761
DOI10.1007/BF03167271zbMath0808.12001MaRDI QIDQ1202761
Tateaki Sasaki, Teluhiko Hilano, Tomokatsu Saito
Publication date: 16 February 1993
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
algorithm; approximate factorization; factorization of polynomials; multivariate polynomial; several indeterminates
12D05: Polynomials in real and complex fields: factorization
Related Items
The integer Chebyshev problem, Computing monodromy via continuation methods on random Riemann surfaces, A unified method for multivariate polynomial factorizations, A study of approximate polynomials. I: Representation and arithmetic, Obtaining exact value by approximate computations, Approximate factorization of multivariate polynomials using singular value decomposition, Sharp precision in Hensel lifting for bivariate polynomial factorization, Regularization and Matrix Computation in Numerical Polynomial Algebra
Cites Work