A Fast Sparse QR Factorization for Solving Linear Least Squares Problems in Graphics
Gaming & Interactive
Production & Animation
Research & Education
DescriptionThe direct factorization of least-squares problems encountered in various graphics applications have a special structure: the off-diagonal blocks are low-rank. We leverage this property to produce a fast sparse approximate QR factorization, spaQR (sparsified QR), for these matrices in near-linear time.