The following pages link to The <i>QR</i> Algorithm Revisited (Q5450282):
Displayed 12 items.
- Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle (Q396051) (← links)
- A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence (Q432772) (← links)
- Kernel polynomials from \(L\)-orthogonal polynomials (Q631925) (← links)
- Using the Cauchy-Binet formula in the convergence proof of the tridiagonal QR algorithm with shifts (Q654558) (← links)
- Efficient alternating least squares algorithms for low multilinear rank approximation of tensors (Q831251) (← links)
- On orthogonal reduction to Hessenberg form with small bandwidth (Q1027782) (← links)
- New exact algorithms for planar maximum covering location by ellipses problems (Q2029953) (← links)
- The dynamical functional particle method for multi-term linear matrix equations (Q2673927) (← links)
- An extended QR-solver for large profiled matrices (Q3649858) (← links)
- Numerical solution of linear eigenvalue problems (Q4608452) (← links)
- Computing the Square Root of a Low-Rank Perturbation of the Scaled Identity Matrix (Q5885808) (← links)
- The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations (Q6180360) (← links)