Multifrontral multithreaded rank-revealing sparse QR factorization

Author Timothy Davis

Thumbnail PDF


  • Filesize: 83 kB
  • 3 pages

Document Identifiers

Author Details

Timothy Davis

Cite AsGet BibTex

Timothy Davis. Multifrontral multithreaded rank-revealing sparse QR factorization. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


SuiteSparseQR is a sparse multifrontal QR factorization algorithm. Dense matrix methods within each frontal matrix enable the method to obtain high performance on multicore architectures. Parallelism across different frontal matrices is handled with Intel's Threading Building Blocks library. Rank-detection is performed within each frontal matrix using Heath's method, which does not require column pivoting. The resulting sparse QR factorization obtains a substantial fraction of the theoretical peak performance of a multicore computer.
  • Sparse matrix algorithms
  • QR factorization
  • multifrontal


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads