Doolittle.h File Reference

#include "types.h"
#include "mangling.h"

Include dependency graph for Doolittle.h:

Go to the source code of this file.

Functions
void	API_sgedtrf (fortran_int *N, fortran_real *A, fortran_real *L, fortran_real *U, fortran_int *INFO)
void	API_dgedtrf (fortran_int *N, fortran_double *A, fortran_double *L, fortran_double *U, fortran_int *INFO)
void	API_cgedtrf (fortran_int *N, fortran_complex *A, fortran_complex *L, fortran_complex *U, fortran_int *INFO)
void	API_zgedtrf (fortran_int *N, fortran_double_complex *A, fortran_double_complex *L, fortran_double_complex *U, fortran_int *INFO)
void	doolittle (fortran_int *N, fortran_real *A, fortran_real *L, fortran_real *U, fortran_int *INFO)
	Doolittle LU factorization of a general matrix: A = L * U.
void	doolittle (fortran_int *N, fortran_double *A, fortran_double *L, fortran_double *U, fortran_int *INFO)
	Doolittle LU factorization (double-precision).
void	doolittle (fortran_int *N, fortran_complex *A, fortran_complex *L, fortran_complex *U, fortran_int *INFO)
	Doolittle LU factorization (single-precision complex).
void	doolittle (fortran_int *N, fortran_double_complex *A, fortran_double_complex *L, fortran_double_complex *U, fortran_int *INFO)
	Doolittle LU factorization (double-precision complex).

Function Documentation

API_cgedtrf()

void API_cgedtrf	(	fortran_int *	N,
		fortran_complex *	A,
		fortran_complex *	L,
		fortran_complex *	U,
		fortran_int *	INFO
	)

API_dgedtrf()

void API_dgedtrf	(	fortran_int *	N,
		fortran_double *	A,
		fortran_double *	L,
		fortran_double *	U,
		fortran_int *	INFO
	)

API_sgedtrf()

void API_sgedtrf	(	fortran_int *	N,
		fortran_real *	A,
		fortran_real *	L,
		fortran_real *	U,
		fortran_int *	INFO
	)

API_zgedtrf()

void API_zgedtrf	(	fortran_int *	N,
		fortran_double_complex *	A,
		fortran_double_complex *	L,
		fortran_double_complex *	U,
		fortran_int *	INFO
	)

doolittle() [1/4]

void doolittle	(	fortran_int *	N,
		fortran_complex *	A,
		fortran_complex *	L,
		fortran_complex *	U,
		fortran_int *	INFO
	)

Doolittle LU factorization (single-precision complex).

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Parameters

[in]	N	Pointer to the matrix size (N x N).
[in]	A	Flat row-major input matrix of size N*N.
[out]	L	Flat row-major output lower-triangular matrix (unit diagonal).
[out]	U	Flat row-major output upper-triangular matrix.
[out]	INFO	Pointer to the return code.

Definition at line 102 of file Doolittle.h.

doolittle() [2/4]

void doolittle	(	fortran_int *	N,
		fortran_double *	A,
		fortran_double *	L,
		fortran_double *	U,
		fortran_int *	INFO
	)

Doolittle LU factorization (double-precision).

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Parameters

[in]	N	Pointer to the matrix size (N x N).
[in]	A	Flat row-major input matrix of size N*N.
[out]	L	Flat row-major output lower-triangular matrix (unit diagonal).
[out]	U	Flat row-major output upper-triangular matrix.
[out]	INFO	Pointer to the return code.

Definition at line 88 of file Doolittle.h.

doolittle() [3/4]

void doolittle	(	fortran_int *	N,
		fortran_double_complex *	A,
		fortran_double_complex *	L,
		fortran_double_complex *	U,
		fortran_int *	INFO
	)

Doolittle LU factorization (double-precision complex).

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Parameters

[in]	N	Pointer to the matrix size (N x N).
[in]	A	Flat row-major input matrix of size N*N.
[out]	L	Flat row-major output lower-triangular matrix (unit diagonal).
[out]	U	Flat row-major output upper-triangular matrix.
[out]	INFO	Pointer to the return code.

Definition at line 116 of file Doolittle.h.

doolittle() [4/4]

void doolittle	(	fortran_int *	N,
		fortran_real *	A,
		fortran_real *	L,
		fortran_real *	U,
		fortran_int *	INFO
	)

Doolittle LU factorization of a general matrix: A = L * U.

Computes the LU decomposition of a general N x N matrix A using the Doolittle algorithm. A is stored as a flat row-major array. The lower-triangular matrix L (with ones on the diagonal) and the upper-triangular matrix U are written to the output arrays.

Parameters

[in]	N	Pointer to the matrix size (N x N).
[in]	A	Flat row-major input matrix of size N*N.
[out]	L	Flat row-major output lower-triangular matrix (unit diagonal).
[out]	U	Flat row-major output upper-triangular matrix.
[out]	INFO	Pointer to the return code: 0: success < 0: zero diagonal detected in U at column |INFO|

Definition at line 74 of file Doolittle.h.