public class KeanuLapack
extends java.lang.Object
This is a wrapper around a few LAPACK functions used directly in Keanu
| Modifier and Type | Class and Description |
|---|---|
static class |
KeanuLapack.Triangular |
| Constructor and Description |
|---|
KeanuLapack() |
| Modifier and Type | Method and Description |
|---|---|
static int |
dgetrf(int m,
int n,
double[] buffer,
int[] ipiv)
https://software.intel.com/en-us/mkl-developer-reference-c-getrf
|
static int |
dgetri(int N,
double[] buffer,
int[] ipiv)
https://software.intel.com/en-us/mkl-developer-reference-c-getri
|
static int |
dpotrf(KeanuLapack.Triangular upperLower,
int N,
double[] buffer)
https://software.intel.com/en-us/mkl-developer-reference-c-potrf
|
public static int dpotrf(KeanuLapack.Triangular upperLower, int N, double[] buffer)
Computes the Cholesky factorization of a symmetric (Hermitian) positive-definite matrix.
upperLower - either upper triangular or lower triangular specifies format of resultN - length of one dimension in the square matrix to operate onbuffer - matrix to take cholesky decoposition of and buffer to store resultpublic static int dgetrf(int m,
int n,
double[] buffer,
int[] ipiv)
Computes the LU factorization of a general m-by-n matrix.
m - row dimension of matrixn - column dimensino of matrixbuffer - buffer that represents the matrix for LU factorizationipiv - The pivot indicespublic static int dgetri(int N,
double[] buffer,
int[] ipiv)
Computes the inverse of an LU-factored general matrix.
N - length of one dimension in the square matrix to operate onbuffer - buffer of data that represents square matrixipiv - The pivot indices