| Package | Description |
|---|---|
| de.gsi.math.matrix | |
| de.gsi.math.spectra |
| Modifier and Type | Method and Description |
|---|---|
MatrixD |
MatrixD.arrayLeftDivide(MatrixD B)
Element-by-element left division, C = A.\B
|
MatrixD |
MatrixD.arrayLeftDivideEquals(MatrixD B)
Element-by-element left division in place, A = A.\B
|
MatrixD |
MatrixD.arrayRightDivide(MatrixD B)
Element-by-element right division, C = A./B
|
MatrixD |
MatrixD.arrayRightDivideEquals(MatrixD B)
Element-by-element right division in place, A = A./B
|
MatrixD |
MatrixD.arrayTimes(MatrixD B)
Element-by-element multiplication, C = A.*B
|
MatrixD |
MatrixD.arrayTimesEquals(MatrixD B)
Element-by-element multiplication in place, A = A.*B
|
static MatrixD |
MatrixFactory.constructWithCopy(double[][] A)
Construct a matrix from a copy of a 2-D array.
|
MatrixD |
MatrixD.copy()
Make a deep copy of a matrix
|
MatrixD |
EigenvalueDecomposition.getD()
Return the block diagonal eigenvalue matrix
|
MatrixD |
SingularValueDecomposition.getEigenSolution(int eigen) |
MatrixD |
SingularValueDecomposition.getEigenValues() |
MatrixD |
SingularValueDecomposition.getEigenVector(int eigen) |
MatrixD |
SingularValueDecomposition.getEigenVectorMatrixU() |
MatrixD |
SingularValueDecomposition.getEigenVectorMatrixV() |
MatrixD |
QRDecomposition.getH()
Return the Householder vectors
|
MatrixD |
SingularValueDecomposition.getInverse() |
MatrixD |
SingularValueDecomposition.getInverse(boolean timer,
int nEigenValues) |
MatrixD |
CholeskyDecomposition.getL()
Return triangular factor.
|
MatrixD |
LUDecomposition.getL()
Return lower triangular factor
|
MatrixD |
SingularValueDecomposition.getMatrix() |
MatrixD |
MatrixD.getMatrix(int[] r,
int[] c)
Get a sub-matrix.
|
MatrixD |
MatrixD.getMatrix(int[] r,
int j0,
int j1)
Get a sub-matrix.
|
MatrixD |
MatrixD.getMatrix(int i0,
int i1,
int[] c)
Get a sub-matrix.
|
MatrixD |
MatrixD.getMatrix(int i0,
int i1,
int j0,
int j1)
Get a sub-matrix.
|
MatrixD |
SingularValueDecomposition.getPseudoInverseEigenvalues() |
MatrixD |
QRDecomposition.getQ()
Generate and return the (economy-sized) orthogonal factor
|
MatrixD |
QRDecomposition.getR()
Return the upper triangular factor
|
MatrixD |
SingularValueDecomposition.getU() |
MatrixD |
LUDecomposition.getU()
Return upper triangular factor
|
MatrixD |
SingularValueDecomposition.getV() |
MatrixD |
EigenvalueDecomposition.getV()
Return the eigenvector matrix
|
static MatrixD |
MatrixFactory.identity(int m,
int n)
Generate identity matrix
|
MatrixD |
MatrixD.inverse()
Matrix inverse or pseudo-inverse
|
MatrixD |
MatrixD.minus(MatrixD B)
C = A - B
|
MatrixD |
MatrixD.minusEquals(MatrixD B)
A = A - B
|
MatrixD |
MatrixD.plus(MatrixD B)
C = A + B
|
MatrixD |
MatrixD.plusEquals(MatrixD B)
A = A + B
|
MatrixD |
MatrixD.pseudoInverse(double condition)
Matrix inversion using the SVD pseudo inverse
|
static MatrixD |
MatrixFactory.random(int m,
int n)
Generate matrix with random elements
|
static MatrixD |
MatrixD.read(BufferedReader input)
Read a matrix from a stream.
|
MatrixD |
CholeskyDecomposition.solve(MatrixD B)
Solve A*X = B
|
MatrixD |
QRDecomposition.solve(MatrixD B)
Least squares solution of A*X = B
|
MatrixD |
MatrixD.solve(MatrixD B)
Solve A*X = B
|
MatrixD |
LUDecomposition.solve(MatrixD B)
Solve A*X = B
|
MatrixD |
MatrixD.solveTranspose(MatrixD B)
Solve X*A = B, which is also A'*X' = B'
|
MatrixD |
MatrixD.times(double s)
Multiply a matrix by a scalar, C = s*A
|
MatrixD |
MatrixD.times(MatrixD B)
Linear algebraic matrix multiplication, A * B
|
MatrixD |
MatrixD.timesEquals(double s)
Multiply a matrix by a scalar in place, A = s*A
|
MatrixD |
MatrixD.transpose()
Matrix transpose.
|
MatrixD |
MatrixD.uminus()
Unary minus
|
| Modifier and Type | Method and Description |
|---|---|
MatrixD |
MatrixD.arrayLeftDivide(MatrixD B)
Element-by-element left division, C = A.\B
|
MatrixD |
MatrixD.arrayLeftDivideEquals(MatrixD B)
Element-by-element left division in place, A = A.\B
|
MatrixD |
MatrixD.arrayRightDivide(MatrixD B)
Element-by-element right division, C = A./B
|
MatrixD |
MatrixD.arrayRightDivideEquals(MatrixD B)
Element-by-element right division in place, A = A./B
|
MatrixD |
MatrixD.arrayTimes(MatrixD B)
Element-by-element multiplication, C = A.*B
|
MatrixD |
MatrixD.arrayTimesEquals(MatrixD B)
Element-by-element multiplication in place, A = A.*B
|
MatrixD |
MatrixD.minus(MatrixD B)
C = A - B
|
MatrixD |
MatrixD.minusEquals(MatrixD B)
A = A - B
|
MatrixD |
MatrixD.plus(MatrixD B)
C = A + B
|
MatrixD |
MatrixD.plusEquals(MatrixD B)
A = A + B
|
void |
MatrixD.setMatrix(int[] r,
int[] c,
MatrixD X)
Set a submatrix.
|
void |
MatrixD.setMatrix(int[] r,
int j0,
int j1,
MatrixD X)
Set a submatrix.
|
void |
MatrixD.setMatrix(int i0,
int i1,
int[] c,
MatrixD X)
Set a submatrix.
|
void |
MatrixD.setMatrix(int i0,
int i1,
int j0,
int j1,
MatrixD X)
Set a submatrix.
|
void |
SingularValueDecomposition.setMatrix(MatrixD inputMatrix)
Sets the input matrix to be decomposed.
|
MatrixD |
CholeskyDecomposition.solve(MatrixD B)
Solve A*X = B
|
MatrixD |
QRDecomposition.solve(MatrixD B)
Least squares solution of A*X = B
|
MatrixD |
MatrixD.solve(MatrixD B)
Solve A*X = B
|
MatrixD |
LUDecomposition.solve(MatrixD B)
Solve A*X = B
|
MatrixD |
MatrixD.solveTranspose(MatrixD B)
Solve X*A = B, which is also A'*X' = B'
|
MatrixD |
MatrixD.times(MatrixD B)
Linear algebraic matrix multiplication, A * B
|
| Constructor and Description |
|---|
CholeskyDecomposition(MatrixD Arg)
Cholesky algorithm for symmetric and positive definite matrix.
|
EigenvalueDecomposition(MatrixD Arg)
Check for symmetry, then construct the eigenvalue decomposition
|
LUDecomposition(MatrixD A)
LU Decomposition
|
QRDecomposition(MatrixD A)
QR Decomposition, computed by Householder reflections.
|
SingularValueDecomposition(MatrixD inputMatrix)
default constructor.
|
| Modifier and Type | Method and Description |
|---|---|
MatrixD |
EEMD.eemd(double[] data,
double rms_noise,
double NE) |
Copyright © 2020 GSI Helmholtzzentrum für Schwerionenforschung GmbH. All rights reserved.