Euclid algorithm, orthogonal polynomials, and generalized Routh-Hurwitz algorithm
DOI10.1016/0024-3795(94)00342-4zbMath0879.12001OpenAlexW2002647180MaRDI QIDQ1816934
Publication date: 18 January 1998
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(94)00342-4
orthogonal polynomialsEuclidean algorithmSturm's theoremzero distributionscomplex polynomialgeneralized Routh-Hurwitz algorithmparaevenparaodd
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Certain continued fractions associated with the Padé table
- New algebraic criteria for positive realness
- Pseudo-lossless functions with application to the problem of locating the zeros of a polynomial
- A new general Routh-like algorithm to determine the number of RHP roots of a real or complex polynomial
- Routh-Hurwitz test under vanishing leading array elements
- Displacement structure approach to singular root distribution problems: the imaginary axis case
- The Triangular Decomposition of Hankel Matrices
- On continued fractions of the form 1+𝐾₁^{∞}(𝑏_{𝜈}𝑧/\vphantom{𝑏_{𝜈}𝑧1}.\kern-\nulldelimiterspace1)
This page was built for publication: Euclid algorithm, orthogonal polynomials, and generalized Routh-Hurwitz algorithm