Symmetric subresultants and applications
DOI10.1016/j.jsc.2007.07.001zbMath1157.65372arXivcs/0612119OpenAlexW2061555898MaRDI QIDQ2470062
Philippe Saux Picart, Cyril Brunie
Publication date: 13 February 2008
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0612119
fast Fourier transformsubresultantToeplitz matricesmatrix inversionEuclidean divisionfraction-free algorithmpolynomial root counting
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Polynomials, factorization in commutative rings (13P05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Cites Work
- Cauchy index computation
- Fast inversion of Hankel and Toeplitz matrices
- Computing the inertia of Bézout and Hankel matrices
- The Schur-Cohn algorithm revisited
- Solving Hankel systems over the integers
- A fast version of the Schur-Cohn algorithm.
- Fast computation of continued fraction expansions.
- A Newton-Raphson method for moving-average spectral factorization using the Euclid algorithm
- The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- A Generalization of a Theorem of Bôcher
- Sylvester-Habicht sequences and fast Cauchy index computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item