scientific article; zbMATH DE number 17465

From MaRDI portal
Publication:3974785





[For the entire collection see Zbl 0728.00018.] A general theory of \(GR\) algorithms which subsumes the theory of \(QR\) and \(LR\) algorithms is described, and its convergence properties are discussed. The \(GR\)-algorithm is defined generally. It allows multiple \(GR\) step of any multiplicity. Every \(GR\) algorithm is a form of subspace iteration in which a change of coordinate system is made at each step. A generic chasing algorithm is described and shows that its implicity performs a generic \(QR\) step. The convergence of all \(GR\) algorithms is based on the convergence of subspace iterations. The generic \(GR\) algorithm is based on a generic \(QR\) decomposition whose \(Q\) is nonsingular and \(R\) is upper triangular.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974785)