A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
From MaRDI portal
Publication:4610021
DOI10.1007/978-3-319-56932-1_24zbMath1396.13028OpenAlexW2739046436MaRDI QIDQ4610021
Sirani M. Perera, Vadim Olshevsky
Publication date: 5 April 2018
Published in: Applications of Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56932-1_24
fast algorithmsSchur algorithmdisplacement structurequasiseparable matricesEuclid algorithmBezoutians
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bernstein-Bézoutian matrices
- Algebraic methods for Toeplitz-like matrices and operators
- On the history of the Bézoutian and the resultant matrix
- On the inverses of Toeplitz-plus-Hankel matrices
- Matrix representations of Toeplitz-plus-Hankel matrix inverses
- Polynomials with respect to a general basis. I: Theory
- Displacement ranks of matrices and linear equations
- Approximate GCD and its application to ill-conditioned algebraic equations
- A companion matrix analogue for orthogonal polynomials
- When are two numerical polynomials relatively prime?
- A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials
- A matrix Euclidean algorithm induced by state space realization
- Fast inversion of Vandermonde-like matrices involving orthogonal polynomials
- Generalized companion matrices and matrix representations for generalized Bézoutians
- Fast inversion of Chebyshev-Vandermonde matrices
- Displacement-structure approach to polynomial Vandermonde and related matrices
- Euclid algorithm, orthogonal polynomials, and generalized Routh-Hurwitz algorithm
- Computation of approximate polynomial GCDs and an extension
- Matrix representations of Bezoutians
- Fast algorithms for Toeplitz and Hankel matrices
- Approximate factorization of multivariate polynomials using singular value decomposition
- Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations
- Greatest common divisor of two polynomials
- Fast Inversion of Polynomial-Vandermonde Matrices for Polynomial Systems Related to Order One Quasiseparable Matrices
- Classifications of Recurrence Relations via Subclasses of (H, m)-quasiseparable Matrices
- Greatest common divisor via generalized Sylvester and Bezout matrices
- Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
- New Fast Algorithms for Toeplitz-Plus-Hankel Matrices
- Stable factorization for Hankel and Hankel‐like matrices
- Displacement Structure: Theory and Applications
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- A Note on the Bezoutian Matrix
- Nearly optimal computations with structured matrices
- Polynomial Bézoutian matrix with respect to a general basis
This page was built for publication: A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials