Developer Reference

Intel® oneAPI Math Kernel Library LAPACK Examples

ID 766877
Date 12/20/2021
Public

A newer version of this document is available. Customers should click here to go to the newest version.

Visible to Intel only — GUID: GUID-7F39F033-2016-4805-B1D1-4A65728967EF

Document Table of Contents

CGELSD Example

The routine computes the minimum norm solution to a complex linear least squares problem: minimize ||b - A*x|| using the singular value decomposition (SVD) of a rectangular matrix A, which may be rank-deficient.

Several right-hand side vectors b and solution vectors x can be handled in a single call; they are stored as the columns of the right-hand side matrix B and the solution matrix X.

The effective rank of A equals the number of the singular values, which are greater than rcond multiplied by the largest singular value.

C Interface

Please refer to the Matrix Layout section of the C Interface Conventions for the description of Row Major (C default) and Column Major (Fortran default).