Algorithmic Variants of QR

Western Oregon University
Talk Abstract
One of the fundamental computations in numerical linear algebra is the QR factorization. A QR factorization decomposes a matrix into the product of an orthogonal matrix and an upper triangular matrix. The algorithms that compute these decompositions can often be costly, and at times, do not perform well for particular matrices. We investigate different methods of computing a QR factorization on a tall and skinny matrix, that is a matrix with more rows than columns. We discuss algorithmic variants and the move to a new family of algorithms based on tiles.
Talk Subject
Numerical Analysis and Scientific Computing
Time Slot
Room Number
STAG 263