added new routines [S,D,C,Z]GELST and test code for the least squares#739
added new routines [S,D,C,Z]GELST and test code for the least squares#739langou merged 2 commits intoReference-LAPACK:masterfrom
Conversation
squares algorithm that solves overdetermined or underdetermined systems for GE matrices using QR or LQ factorization with compact WY representation of Q inside the routine. *GELST is similar to *GELS, but unlike *GELS does not compute triangular blocks twice, i.e. runs faster. modified: SRC/Makefile new file: SRC/cgelst.f new file: SRC/dgelst.f new file: SRC/sgelst.f new file: SRC/zgelst.f modified: TESTING/LIN/alahd.f modified: TESTING/LIN/cdrvls.f modified: TESTING/LIN/cerrls.f modified: TESTING/LIN/ddrvls.f modified: TESTING/LIN/derrls.f modified: TESTING/LIN/sdrvls.f modified: TESTING/LIN/serrls.f modified: TESTING/LIN/zdrvls.f
|
@scr2016 Is there a particular reason why your changes are a separate routine and not an upgrade of Edit: I mixed up geqrt and geqrt3. Sorry. Have you considered interleaving the QR factorization and the transform of B, which reduces the workspace to a single triangular factor? Sketched for QR, Then your change is really fully compatible with |
|
I see edits to all So there is no way to check any errors from the double complex code currently. |
modified TESTING/LIN/zerrls.f accordingly. Also fixed comments typo in [S,D,C,Z]GELST. modified: SRC/cgelst.f modified: SRC/dgelst.f modified: SRC/sgelst.f modified: SRC/zgelst.f modified: TESTING/LIN/zerrls.f
|
verify-elf: ERROR: ./usr/lib64/liblapack.so.3.12.0: undefined symbol: cdotc_64_ |
|
probably same as #1147 - if you're building with a non-default BLAS you need to make sure that it has the 64bit integer versions of the functions |
Description
added new routines [S,D,C,Z]GELST and test code for the least squares
squares algorithm that solves overdetermined or underdetermined systems for GE matrices using QR or LQ factorization with compact WY representation of Q inside the routine.
*GELST is similar to *GELS, but unlike *GELS does not compute triangular blocks twice, i.e. runs faster.
modified: SRC/Makefile
new file: SRC/cgelst.f
new file: SRC/dgelst.f
new file: SRC/sgelst.f
new file: SRC/zgelst.f
modified: TESTING/LIN/alahd.f
modified: TESTING/LIN/cdrvls.f
modified: TESTING/LIN/cerrls.f
modified: TESTING/LIN/ddrvls.f
modified: TESTING/LIN/derrls.f
modified: TESTING/LIN/sdrvls.f
modified: TESTING/LIN/serrls.f
modified: TESTING/LIN/zdrvls.f