1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.
  2. Anuncie Aqui
    Anuncie aqui você Também: fdantas@4each.com.br

[Python] Least squares GELS LAPACK routine in python - does it exist?

Discussão em 'Python' iniciado por Stack, Setembro 16, 2025.

  1. Stack

    Stack Membro Participativo

    I have been looking at the function numpy.linalg.lstsq and it contains all types of solver that LAPACK provides except for GELS routine that is based on QR decomposition (householder reflectors in the matter of fact as computing the QR with Q is a waste of computation time). The question is there is an implementation for this GELS routine?

    Moreover, in all implementations that I saw in the web for Least squares based on QR, they compute the Q in the QR decomposition, and then use it, but it needs to inefficient as computing Q is a waste, and we need only the reflectores.

    the website of LAPCAK that explain what are the type of Least squares solver: https://www.netlib.org/lapack/lug/node27.html as you can see numpy.linalg.lstsq support only 3 out of the 4.

    Continue reading...

Compartilhe esta Página