Generalized QR factorization and its applications

From MaRDI portal





The concept of generalized \(QR\) factorization (\(GQR\) factorization) considered earlier by S. Hammarling (1986) and C. Paige (1990) is developed. The terminology \(GQR\) factorization refers to the orthogonal transformations that simultaneously transform two matrices \(A\) and \(B\), having the same number of rows, to triangular form. The authors present a more general form of the factorization that relaxes the requirements on the rank of some submatrices in the factored form. It simplifies the development of software and does not limit the class of application problems that can be solved. The \(GQR\) factorization provides the uniform approach to solve the linear equality-constrained least squares problem, and the generalized linear regression model. The conditioning of these problems is estimated and \(GQR\) factorizations with pivoting and without pivoting are distinguished.



Cites work


Cited in
(19)


Describes a project that uses

Uses Software






This page was built for publication: Generalized QR factorization and its applications

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