Developer Reference

Intel® oneAPI Math Kernel Library LAPACK Examples

ID 766877
Date 3/22/2024
Public

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

Document Table of Contents

LAPACK Examples

Routine Description Examples
?geev Computes the eigenvalues and, optionally, the left and/or right eigenvectors of a general matrix.

cgeev

dgeev

sgeev

zgeev

?gels Uses QR or LQ factorization to solve an overdetermined or underdetermined linear system with a full rank matrix.

cgels

dgels

sgels

zgels

?gelsd Computes the minimum norm solution to a linear least squares problem using the singular value decomposition of A and a divide and conquer method.

cgelsd

dgelsd

sgelsd

zgelsd

?gesdd Computes the singular value decomposition of a general rectangular matrix using a divide and conquer algorithm.

cgesdd

dgesdd

sgesdd

zgesdd

?gesv Computes the solution to the system of linear equations with a square matrix A and multiple right-hand sides.

cgesv

dgesv

sgesv

zgesv