The following pages link to UDC (Q32053):
Displayed 19 items.
- Szegő-Lobatto quadrature rules (Q859867) (← links)
- Fast and stable unitary QR algorithm (Q896881) (← links)
- An inexact Krylov-Schur algorithm for the unitary eigenvalue problem (Q935390) (← links)
- Orthogonal Laurent polynomials on the unit circle and snake-shaped matrix factorizations (Q1040856) (← links)
- Perturbation and interlace theorems for the unitary eigenvalue problem (Q1260788) (← links)
- Error bounds in the isometric Arnoldi process (Q1378993) (← links)
- On the construction of Szegő polynomials (Q1802171) (← links)
- The restarted QR-algorithm for eigenvalue computation of structured matrices (Q1860504) (← links)
- Sampling the eigenvalues of random orthogonal and unitary matrices (Q2020693) (← links)
- A CS decomposition for orthogonal matrices with application to eigenvalue computation (Q2346621) (← links)
- Trigonometric orthogonal systems and quadrature formulae (Q2389478) (← links)
- Eigenvalue computation for unitary rank structured matrices (Q2469628) (← links)
- Continuation methods for the computation of zeros of Szegő polynomials (Q2564903) (← links)
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices (Q2566271) (← links)
- Anti-Szego quadrature rules (Q3426023) (← links)
- Corrigendum: Algorithm 730: An implementation of a divide and conquer algorithm for the unitary eigenproblem (Q4371564) (← links)
- An implementation of a divide and conquer algorithm for the unitary eigen problem (Q4371804) (← links)
- Optimally Conditioned Vandermonde-Like Matrices (Q5203966) (← links)
- Polynomial zerofinders based on Szegő polynomials (Q5929291) (← links)