Three algorithms (classical GS, modified GS, and Householder) for QR factorisation written in Julia. Included is a standard backsubstitution algorithm also for Julia.
-
Updated
Jul 14, 2017 - Julia
#
qr-factorisation
Here are 3 public repositories matching this topic...
Python wrapper for the sparse QR decomposition in SuiteSparseQR.
python wrapper numpy python3 bindings scipy sparse-linear-systems python2 sparse-matrix python27 python34 suitesparse qr-decomposition sparse-linear-solver qr-factorisation
-
Updated
Aug 31, 2017 - Python
My solutions to the first assignment for Case Studies in High-Performance Computing during my M.Sc. in High-Performance Computing at Trinity College Dublin.
-
Updated
Mar 11, 2025 - C
Improve this page
Add a description, image, and links to the qr-factorisation topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the qr-factorisation topic, visit your repo's landing page and select "manage topics."