Computations with quasiseparable polynomials and matrices
From MaRDI portal
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
Cites work
- A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices
- A displacement approach to efficient decoding of algebraic-geometric codes
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A divide and conquer method for unitary and orthogonal eigenproblems
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- A fast Björck-Pereyra-type algorithm for solving Hessenberg-quasiseparable-Vandermonde systems
- A fast QR algorithm for companion matrices
- A Traub-like algorithm for Hessenberg-quasi-separable-Vandermonde matrices of arbitrary order
- Algebraic methods for Toeplitz-like matrices and operators
- An implicit QR algorithm for symmetric semiseparable matrices
- An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
- Analysis of linear time-invariant time-delay systems via orthogonal functions
- Associated Polynomials and Uniform Methods for the Solution of Linear Problems
- Chebyshev-Vandermonde Systems
- Classifications of recurrence relations via subclasses of (H, m)-quasiseparable matrices
- Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
- Direct and inverse eigenvalue problems for diagonal-plus-semiseparable matrices
- Displacement ranks of matrices and linear equations
- Displacement Structure Approach to Discrete-Trigonometric-Transform Based Preconditioners of G.Strang Type and of T.Chan Type
- Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices
- Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations
- Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Fast inversion of Chebyshev-Vandermonde matrices
- Fast inversion of polynomial-Vandermonde matrices for polynomial systems related to order one quasiseparable matrices
- Fast inversion of Vandermonde-like matrices involving orthogonal polynomials
- How bad are Hankel matrices?
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 2134016 (Why is no real title available?)
- scientific article; zbMATH DE number 3131354 (Why is no real title available?)
- scientific article; zbMATH DE number 3947329 (Why is no real title available?)
- scientific article; zbMATH DE number 4051496 (Why is no real title available?)
- scientific article; zbMATH DE number 1183880 (Why is no real title available?)
- scientific article; zbMATH DE number 1350351 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 1974605 (Why is no real title available?)
- scientific article; zbMATH DE number 1821102 (Why is no real title available?)
- Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation
- On a new class of structured matrices
- Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
- Practical improvement of the divide-and-conquer eigenvalue algorithms
- Rational Krylov matrices and QR steps on Hermitian diagonal‐plus‐semiseparable matrices
- Solution of Vandermonde systems of equations
- Stability Analysis of Algorithms for Solving Confluent Vandermonde-Like Systems
- Structural properties of matrix unitary reduction to semiseparable form
- 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
- The fast generalized Parker-Traub algorithm for inversion of Vandermonde and related matrices
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
Cited in
(17)- Computations with infinite Toeplitz matrices and polynomials
- The spectral connection matrix for classical orthogonal polynomials of a single parameter
- The spectral connection matrix for any change of basis within the classical real orthogonal polynomials
- 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
- Classifications of recurrence relations via subclasses of (H, m)-quasiseparable matrices
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
- Fast matrix multiplication and its algebraic neighbourhood
- Transformations of matrix structures work again
- A parallel geometric multifrontal solver using hierarchically semiseparable structure
- Fast approximate computations with Cauchy matrices and polynomials
- Computing the Ehrhart quasi-polynomial of a rational simplex
- A quasiseparable approach to five-diagonal CMV and Fiedler matrices
- Tree quasi-separable matrices: a simultaneous generalization of sequentially and hierarchically semiseparable representations
- On generators of quasiseparable finite block matrices
- Randomized preprocessing of homogeneous linear systems of equations
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)
