Title

Algorithmic Variants of QR

Date

5-26-2016 9:45 AM

End Time

26-5-2016 10:00 AM

Location

MNB 104

Department

Mathematics

Session Chair

Matthew Nabity

Session Title

Mathematics Senior Project Presentations

Faculty Sponsor(s)

Matthew Nabity

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.

This document is currently not available here.

Share

COinS
 
May 26th, 9:45 AM May 26th, 10:00 AM

Algorithmic Variants of QR

MNB 104

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.