Pages that link to "Item:Q4371804"
From MaRDI portal
The following pages link to An implementation of a divide and conquer algorithm for the unitary eigen problem (Q4371804):
Displaying 15 items.
- A case against a divide and conquer approach to the nonsymmetric eigenvalue problem (Q685968) (← links)
- Szegő-Lobatto quadrature rules (Q859867) (← 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)
- 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)
- Orthogonal matrix polynomials and applications (Q1919056) (← links)
- Sampling the eigenvalues of random orthogonal and unitary matrices (Q2020693) (← 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)
- Optimally Conditioned Vandermonde-Like Matrices (Q5203966) (← links)
- Polynomial zerofinders based on Szegő polynomials (Q5929291) (← links)
