UDC
From MaRDI portal
Cited in
(22)- Polynomial zerofinders based on Szegő polynomials
- Eigenvalue computation for unitary rank structured matrices
- Orthogonal Laurent polynomials on the unit circle and snake-shaped matrix factorizations
- Perturbation and interlace theorems for the unitary eigenvalue problem
- Continuation methods for the computation of zeros of Szegő polynomials
- The restarted QR-algorithm for eigenvalue computation of structured matrices
- Fast and stable unitary QR algorithm
- Trigonometric orthogonal systems and quadrature formulae
- Corrigendum: Algorithm 730: An implementation of a divide and conquer algorithm for the unitary eigenproblem
- Szegő-Lobatto quadrature rules
- OrthogonalPolynomials
- Algorithm 730
- On the construction of Szegő polynomials
- OCVdM
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
- A CS decomposition for orthogonal matrices with application to eigenvalue computation
- An implementation of a divide and conquer algorithm for the unitary eigen problem
- An inexact Krylov-Schur algorithm for the unitary eigenvalue problem
- Optimally Conditioned Vandermonde-Like Matrices
- Sampling the eigenvalues of random orthogonal and unitary matrices
- Error bounds in the isometric Arnoldi process
- Anti-Szego quadrature rules
This page was built for software: UDC
