Computations with quasiseparable polynomials and matrices
DOI10.1016/J.TCS.2008.09.008zbMATH Open1152.65043OpenAlexW2069491387MaRDI QIDQ2378490FDOQ2378490
Tom Bella, V. Olshevsky, I. Gohberg, Y. Eidelman
Publication date: 8 January 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.uri.edu/cgi/viewcontent.cgi?article=1042&context=math_facpubs
Recommendations
- Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- On a new class of structured matrices
- \textit{qd}-type methods for quasiseparable matrices
- A quasiseparable approach to five-diagonal CMV and Fiedler matrices
orthogonal polynomialsrecurrence relationsquasiseparable matricesdigital filterssemiseparable matricesQR iterationsignal flow graphsTraub algorithmdivide and conquer eigenvalue algorithmsBjörck-Pereyra algorithmSzegö polynomials
Direct numerical methods for linear systems and matrix inversion (65F05) Factorization of matrices (15A23) Software, source code, etc. for problems pertaining to numerical analysis (65-04) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Cites Work
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast inversion of Chebyshev-Vandermonde matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solution of Vandermonde systems of equations
- Algebraic methods for Toeplitz-like matrices and operators
- Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- An implicit QR algorithm for symmetric semiseparable matrices
- Title not available (Why is that?)
- Analysis of linear time-invariant time-delay systems via orthogonal functions
- How bad are Hankel matrices?
- On a new class of structured matrices
- Rational Krylov matrices and QR steps on Hermitian diagonal‐plus‐semiseparable matrices
- Title not available (Why is that?)
- Displacement Structure Approach to Discrete-Trigonometric-Transform Based Preconditioners of G.Strang Type and of T.Chan Type
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- A Fast Björck–Pereyra-Type Algorithm for Solving Hessenberg-Quasiseparable-Vandermonde Systems
- A fast QR algorithm for companion matrices
- Displacement ranks of matrices and linear equations
- The fast generalized Parker-Traub algorithm for inversion of Vandermonde and related matrices
- Title not available (Why is that?)
- A displacement approach to efficient decoding of algebraic-geometric codes
- Direct and inverse eigenvalue problems for diagonal-plus-semiseparable matrices
- Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations
- Structural properties of matrix unitary reduction to semiseparable form
- An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
- Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
- Stability Analysis of Algorithms for Solving Confluent Vandermonde-Like Systems
- Chebyshev-Vandermonde Systems
- Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines
- Classifications of Recurrence Relations via Subclasses of (H, m)-quasiseparable Matrices
- Fast inversion of Vandermonde-like matrices involving orthogonal polynomials
- A divide and conquer method for unitary and orthogonal eigenproblems
- Associated Polynomials and Uniform Methods for the Solution of Linear Problems
- Title not available (Why is that?)
- Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices
- Fast Inversion of Polynomial-Vandermonde Matrices for Polynomial Systems Related to Order One Quasiseparable Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices
- Practical improvement of the divide-and-conquer eigenvalue algorithms
- Title not available (Why is that?)
- Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation
- Structured matrices in mathematics, computer science, and engineering I. Proceedings of an AMS-IMS-SIAM joint summer research conference, University of Colorado, Boulder, CO, USA, June 27--July 1, 1999
Cited In (14)
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Computations with infinite Toeplitz matrices and polynomials
- Fast matrix multiplication and its algebraic neighbourhood
- A Parallel Geometric Multifrontal Solver Using Hierarchically Semiseparable Structure
- The spectral connection matrix for any change of basis within the classical real orthogonal polynomials
- The spectral connection matrix for classical orthogonal polynomials of a single parameter
- Transformations of matrix structures work again
- Remarks on two symmetric polynomials and some matrices
- Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations
- Data-dependent orthogonal polynomials on generalized circles: a unified approach applied to \(\delta \)-domain identification
- Fast approximate computations with Cauchy matrices and polynomials
- Randomized preprocessing of homogeneous linear systems of equations
- On generators of quasiseparable finite block matrices
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
This page was built for publication: Computations with quasiseparable polynomials and matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378490)