Generalized companion matrices and matrix representations for generalized Bézoutians
From MaRDI portal
Publication:1318206
DOI10.1016/0024-3795(93)90276-TzbMath0798.15007MaRDI QIDQ1318206
Publication date: 9 November 1994
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Toeplitz matrixHankel matrixmatrix representationscompanion matricesgeneralized Bézoutiansbasis of orthogonal polynomialsChristoffel-Darboux formulas
Hermitian, skew-Hermitian, and related matrices (15B57) Canonical forms, reductions, classification (15A21)
Related Items
Algorithms for finding the minimal polynomials and inverses of resultant matrices, Matrix representations of Bezoutians, A fast algorithm for generalized Hankel matrices arising in finite-moment problems, Bernstein-Bézoutian matrices, A note on matrix displacement representation, DFT representations of Toeplitz-plus-Hankel Bézoutians with application to fast matrix-vector multiplication, \(h\)-space structure in matrix displacement formulas, Fast and stable computation of the barycentric representation of rational interpolants, A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials, Generalized Lyapunov equations, matrices with displacement structure, and generalized Bézoutians
Cites Work
- On the history of the Bézoutian and the resultant matrix
- Generalized Bezoutian and the inversion problem for block matrices, I. General scheme
- On the inverses of Toeplitz-plus-Hankel matrices
- Matrix representations of Toeplitz-plus-Hankel matrix inverses
- Algebraic method for the study of some linear matrix equations
- A companion matrix analogue for orthogonal polynomials
- Inversion of matrices with displacement structure
- Circulants, displacements and decompositions of matrices
- Matrix representations of Bezoutians
- THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
- A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item