LASs - Linear Algebra Routines on OmpSs
1.0.0
LASs
|
LASs-DDSs ddss_dtpgetrf routine. More...
#include "../include/lass.h"
Go to the source code of this file.
Functions | |
int | ddss_dtpgetrf (int M, int N, double *A, int LDA, int *IPIV) |
LASs-DDSs ddss_dtpgetrf routine.
LASs-DDSs is a software package provided by: Barcelona Supercomputing Center - Centro Nacional de Supercomputacion
Definition in file ddss_dtpgetrf.c.
int ddss_dtpgetrf | ( | int | M, |
int | N, | ||
double * | A, | ||
int | LDA, | ||
int * | IPIV | ||
) |
Performs the LU factorization with tiled pivoting ( row interchanges ) of a general M-by-N matrix A:
A = P * L * U
where P is a permutation matrix, L is a lower triangular ( lower trapezoidal if M > N ) matrix with unit diagonal elements and U is an upper triangular ( upper trapezoidal if M < N ) matrix.
[in] | M | int. M specifies the number of rows of the matrix A. M >= 0. |
[in] | N | int. N specifies the number of columns of the matrix A. N >= 0. |
[in,out] | A | double *. A is a pointer to a regular matrix of dimension M-by-N. On exit, if return value is Success, the matrix A is overwriten by the factors L and U. The unit diagonal elements of L are not stored. |
[in] | LDA | int. LDA specifies the number of columns of A ( row-major order ). LDA must be at least max( 1, N ). |
[out] | IPIV | int *. ipiv is a pointer to an array of dimesion at least max( 1, min ( M, N ) ). ipiv( i ) = j, 1 <= i <= min( M, N ) implies that rows i and j have been interchanged. |
Success | successful exit |
NoSuccess | unsuccessful exit |
Definition at line 77 of file ddss_dtpgetrf.c.
References kdtpgetrf().