Developer Reference for Intel® oneAPI Math Kernel Library - C

Developer Reference

  • 0.9
  • 09/09/2020
  • Public Content
Contents

Linear Least Squares (LLS) Problems: LAPACK Driver Routines

This
topic
describes LAPACK driver routines used for solving linear least squares problems. Table
"Driver Routines for Solving LLS Problems"
 lists all such routines.
Driver Routines for Solving LLS Problems
Routine Name
Operation performed
Uses QR or LQ factorization to solve a overdetermined or underdetermined linear system with full rank matrix.
Computes the minimum-norm solution to a linear least squares problem using a complete orthogonal factorization of A.
Computes the minimum-norm solution to a linear least squares problem using the singular value decomposition of A.
Computes the minimum-norm solution to a linear least squares problem using the singular value decomposition of A and a divide and conquer method.

Product and Performance Information

1

Intel's compilers may or may not optimize to the same degree for non-Intel microprocessors for optimizations that are not unique to Intel microprocessors. These optimizations include SSE2, SSE3, and SSSE3 instruction sets and other optimizations. Intel does not guarantee the availability, functionality, or effectiveness of any optimization on microprocessors not manufactured by Intel. Microprocessor-dependent optimizations in this product are intended for use with Intel microprocessors. Certain optimizations not specific to Intel microarchitecture are reserved for Intel microprocessors. Please refer to the applicable product User and Reference Guides for more information regarding the specific instruction sets covered by this notice.

Notice revision #20110804