Prefer a chat interface with context about you and your work?
An implicit <i>QR</i> algorithm for symmetric semiseparable matrices
Abstract The QR algorithm is one of the classical methods to compute the eigendecomposition of a matrix. If it is applied on a dense n × n matrix, this algorithm requires O ( n 3 ) operations per iteration step. To reduce this complexity for a symmetric matrix to O …