A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial

DOI10.1016/S0024-3795(02)00595-5zbMath1027.65063MaRDI QIDQ1874670

Publication date: 25 May 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

algorithm computational complexity spectral factorization numerical experiments cyclic reduction stable polynomials polynomial computations displacement theory Sylvester's resultant matrices

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (1)

Wiener-Hopf and spectral factorization of real polynomials by Newton's method

Uses Software

na12

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Power series remainder sequences and Padé fractions over an integral domain
Inertia characteristics of self-adjoint matrix polynomials
Lyapunov equations for companion matrices
Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
Displacement ranks of matrices and linear equations
Introduction to large truncated Toeplitz matrices
Computations with infinite Toeplitz matrices and polynomials
Improved cyclic reduction for solving queueing problems
Spectral fractorization of Laurent polynomials
Variations on computing reciprocals of power series
Fast computation of contour integrals of rational functions
A Newton-Raphson method for moving-average spectral factorization using the Euclid algorithm
The Euclid algorithm and the fast computation of cross-covariance and autocovariance sequences
Efficient implementation of wilson's algorithm for factorizing a self-reciprocal polynomial
Effective Methods for Solving Banded Toeplitz Systems
The roles of Sylvester and Bezoutian matrices in the historical study of stability of linear discrete-time systems
Subresultants and Reduced Polynomial Remainder Sequences
Factorization of the Covariance Generating Function of a Pure Moving Average Process
On Direct Methods for Solving Poisson’s Equations
On Euclid's Algorithm and the Theory of Subresultants
Computing a Hurwitz factorization of a polynomial
Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations

This page was built for publication: A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial