#include "types.h"
#include "mangling.h"
Go to the source code of this file.
|
| void | API_sgectrf (fortran_int *N, fortran_real *A, fortran_real *L, fortran_real *U, fortran_int *INFO) |
| |
| void | API_dgectrf (fortran_int *N, fortran_double *A, fortran_double *L, fortran_double *U, fortran_int *INFO) |
| |
| void | API_cgectrf (fortran_int *N, fortran_complex *A, fortran_complex *L, fortran_complex *U, fortran_int *INFO) |
| |
| void | API_zgectrf (fortran_int *N, fortran_double_complex *A, fortran_double_complex *L, fortran_double_complex *U, fortran_int *INFO) |
| |
| void | crout (fortran_int *N, fortran_real *A, fortran_real *L, fortran_real *U, fortran_int *INFO) |
| | Crout LU factorization of a general matrix: A = L * U.
|
| |
| void | crout (fortran_int *N, fortran_double *A, fortran_double *L, fortran_double *U, fortran_int *INFO) |
| | Crout LU factorization (double-precision).
|
| |
| void | crout (fortran_int *N, fortran_complex *A, fortran_complex *L, fortran_complex *U, fortran_int *INFO) |
| | Crout LU factorization (single-precision complex).
|
| |
| void | crout (fortran_int *N, fortran_double_complex *A, fortran_double_complex *L, fortran_double_complex *U, fortran_int *INFO) |
| | Crout LU factorization (double-precision complex).
|
| |
◆ API_cgectrf()
◆ API_dgectrf()
◆ API_sgectrf()
◆ API_zgectrf()
◆ crout() [1/4]
Crout 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. |
| [out] | U | Flat row-major output upper-triangular matrix (unit diagonal). |
| [out] | INFO | Pointer to the return code. |
Definition at line 102 of file Crout.h.
◆ crout() [2/4]
Crout 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. |
| [out] | U | Flat row-major output upper-triangular matrix (unit diagonal). |
| [out] | INFO | Pointer to the return code. |
Definition at line 88 of file Crout.h.
◆ crout() [3/4]
Crout 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. |
| [out] | U | Flat row-major output upper-triangular matrix (unit diagonal). |
| [out] | INFO | Pointer to the return code. |
Definition at line 116 of file Crout.h.
◆ crout() [4/4]
Crout LU factorization of a general matrix: A = L * U.
Computes the LU decomposition of a general N x N matrix A using the Crout algorithm. A is stored as a flat row-major array. The lower-triangular matrix L and the upper-triangular matrix U (with ones on the diagonal) 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. |
| [out] | U | Flat row-major output upper-triangular matrix (unit diagonal). |
| [out] | INFO | Pointer to the return code:
- 0: success
- < 0: zero diagonal detected in L at column |INFO|
|
Definition at line 74 of file Crout.h.