| Abstrakt: |
QR factorization is a key tool in mathematics, computer science, operations research, and engineering. This paper presents the roundoff-error-free (REF) QR factorization framework comprising integer-preserving versions of the standard and the thin QR factorizations and associated algorithms to compute them. Specifically, the standard REF QR factorization factors a given matrix A ∈ Z m × n as A = Q D R , where Q ∈ Z m × m has pairwise orthogonal columns, D is a diagonal matrix, and R ∈ Z m × n is an upper trapezoidal matrix; notably, the entries of Q and R are integral, while the entries of D are reciprocals of integers. In the thin REF QR factorization, Q ∈ Z m × n also has pairwise orthogonal columns, and R ∈ Z n × n is also an upper triangular matrix. In contrast to traditional (i.e., floating-point) QR factorizations, every operation used to compute these factors is integral; thus, REF QR is guaranteed to be an exact orthogonal decomposition. Importantly, the bit-length of every entry in the REF QR factorizations (and within the algorithms to compute them) is bounded polynomially. Notable applications of our REF QR factorizations include finding exact least squares or exact basic solutions, x ∈ Q n , to any given full column rank or rank deficient linear system A x = b , respectively. In addition, our exact factorizations can be used as a subroutine within exact and/or high-precision quadratic programming. Altogether, REF QR provides a framework to obtain exact orthogonal factorizations of any rational matrix (as any rational/decimal matrix can be easily transformed into an integral matrix). [ABSTRACT FROM AUTHOR] |
Full text from SpringerLink