|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Matrix | |
---|---|
no.uib.cipr.matrix | Dense and structured sparse matrices, along with matrix factorisations and solvers. |
no.uib.cipr.matrix.distributed | Message passing interface (MPI) for Java. |
no.uib.cipr.matrix.sparse | Unstructured sparse matrices and vectors with iterative solvers and preconditioners. |
Uses of Matrix in no.uib.cipr.matrix |
---|
Classes in no.uib.cipr.matrix that implement Matrix | |
---|---|
class |
AbstractMatrix
Partial implementation of Matrix . |
class |
BandMatrix
Banded matrix. |
class |
DenseMatrix
Dense matrix. |
class |
LowerSPDBandMatrix
Lower symmetrical positive definite banded matrix. |
class |
LowerSPDDenseMatrix
Lower symmetrical positive definite dense matrix. |
class |
LowerSPDPackMatrix
Lower symmetrical positive definite packed matrix. |
class |
LowerSymmBandMatrix
Lower symmetrical banded matrix. |
class |
LowerSymmDenseMatrix
Lower symmetric dense matrix. |
class |
LowerSymmPackMatrix
Lower symmetric packed matrix. |
class |
LowerTriangBandMatrix
Lower triangular banded matrix. |
class |
LowerTriangDenseMatrix
Lower triangular dense matrix. |
class |
LowerTriangPackMatrix
Lower triangular packed matrix. |
class |
SPDTridiagMatrix
Symmetrical positive definite tridiagonal matrix. |
class |
SymmTridiagMatrix
Symmetrical tridiagonal matrix. |
class |
TridiagMatrix
Tridiagonal matrix. |
class |
UnitLowerTriangBandMatrix
Unit lower triangular banded matrix. |
class |
UnitLowerTriangDenseMatrix
Unit lower triangular dense matrix. |
class |
UnitLowerTriangPackMatrix
Unit lower triangular packed matrix. |
class |
UnitUpperTriangBandMatrix
Unit upper triangular banded matrix. |
class |
UnitUpperTriangDenseMatrix
Unit upper triangular dense matrix. |
class |
UnitUpperTriangPackMatrix
Unit upper triangular packed matrix. |
class |
UpperSPDBandMatrix
Upper symmetrical positive definite banded matrix. |
class |
UpperSPDDenseMatrix
Upper symmetrical positive definite dense matrix. |
class |
UpperSPDPackMatrix
Upper symmetrical positive definite packed matrix. |
class |
UpperSymmBandMatrix
Upper symmetrical banded matrix. |
class |
UpperSymmDenseMatrix
Upper symmetrix dense matrix. |
class |
UpperSymmPackMatrix
Upper symmetric packed matrix. |
class |
UpperTriangBandMatrix
Upper triangular banded matrix. |
class |
UpperTriangDenseMatrix
Upper triangular dense matrix. |
class |
UpperTriangPackMatrix
Upper triangular packed matrix. |
Methods in no.uib.cipr.matrix that return Matrix | |
---|---|
Matrix |
AbstractMatrix.add(double alpha,
Matrix B)
|
Matrix |
Matrix.add(double alpha,
Matrix B)
A = alpha*B + A . |
Matrix |
AbstractMatrix.add(Matrix B)
|
Matrix |
Matrix.add(Matrix B)
A = B + A . |
Matrix |
AbstractMatrix.copy()
|
Matrix |
Matrix.copy()
Creates a deep copy of the matrix |
Matrix |
QRP.getP()
Returns the column pivoting matrix. |
static Matrix |
Matrices.getSubMatrix(Matrix A,
int[] row,
int[] column)
Returns a view into the given matrix. |
Matrix |
AbstractMatrix.mult(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.mult(double alpha,
Matrix B,
Matrix C)
C = alpha*A*B |
Matrix |
AbstractMatrix.mult(Matrix B,
Matrix C)
|
Matrix |
Matrix.mult(Matrix B,
Matrix C)
C = A*B |
Matrix |
AbstractMatrix.multAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
DenseMatrix.multAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.multAdd(double alpha,
Matrix B,
Matrix C)
C = alpha*A*B + C |
Matrix |
AbstractMatrix.multAdd(Matrix B,
Matrix C)
|
Matrix |
Matrix.multAdd(Matrix B,
Matrix C)
C = A*B + C |
static Matrix |
Matrices.random(int numRows,
int numColumns)
Creates a random matrix. |
static Matrix |
Matrices.random(Matrix A)
Populates a matrix with random numbers drawn from a uniform distribution between 0 and 1 |
Matrix |
AbstractMatrix.rank1(double alpha,
Matrix C)
|
Matrix |
Matrix.rank1(double alpha,
Matrix C)
A = alpha*C*CT + A . |
Matrix |
AbstractMatrix.rank1(double alpha,
Vector x)
|
Matrix |
Matrix.rank1(double alpha,
Vector x)
A = alpha*x*xT + A . |
Matrix |
AbstractMatrix.rank1(double alpha,
Vector x,
Vector y)
|
Matrix |
DenseMatrix.rank1(double alpha,
Vector x,
Vector y)
|
Matrix |
Matrix.rank1(double alpha,
Vector x,
Vector y)
A = alpha*x*yT + A . |
Matrix |
AbstractMatrix.rank1(Matrix C)
|
Matrix |
Matrix.rank1(Matrix C)
A = C*CT + A . |
Matrix |
AbstractMatrix.rank1(Vector x)
|
Matrix |
Matrix.rank1(Vector x)
A = x*xT + A . |
Matrix |
AbstractMatrix.rank1(Vector x,
Vector y)
|
Matrix |
Matrix.rank1(Vector x,
Vector y)
A = x*yT + A . |
Matrix |
AbstractMatrix.rank2(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.rank2(double alpha,
Matrix B,
Matrix C)
A = alpha*B*CT + alpha*C*BT + A . |
Matrix |
AbstractMatrix.rank2(double alpha,
Vector x,
Vector y)
|
Matrix |
Matrix.rank2(double alpha,
Vector x,
Vector y)
A = alpha*x*yT + alpha*y*xT + A . |
Matrix |
AbstractMatrix.rank2(Matrix B,
Matrix C)
|
Matrix |
Matrix.rank2(Matrix B,
Matrix C)
A = B*CT + C*BT + A . |
Matrix |
AbstractMatrix.rank2(Vector x,
Vector y)
|
Matrix |
Matrix.rank2(Vector x,
Vector y)
A = x*yT + y*xT + A . |
Matrix |
AbstractMatrix.scale(double alpha)
|
Matrix |
Matrix.scale(double alpha)
A = alpha*A |
Matrix |
AbstractMatrix.set(double alpha,
Matrix B)
|
Matrix |
Matrix.set(double alpha,
Matrix B)
A=alpha*B . |
Matrix |
AbstractMatrix.set(Matrix B)
|
Matrix |
Matrix.set(Matrix B)
A=B . |
Matrix |
AbstractMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
BandMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
DenseMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
LowerSPDBandMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
LowerSPDDenseMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
LowerSPDPackMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
Matrix.solve(Matrix B,
Matrix X)
X = A\B . |
Matrix |
SPDTridiagMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
SymmTridiagMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
TridiagMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
UpperSPDBandMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
UpperSPDDenseMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
UpperSPDPackMatrix.solve(Matrix B,
Matrix X)
|
static Matrix |
Matrices.synchronizedMatrix(Matrix A)
Returns a synchronized matrix which wraps the given matrix. |
static Matrix |
Matrices.synchronizedMatrixByColumns(Matrix A)
Returns a synchronized matrix which wraps the given matrix. |
static Matrix |
Matrices.synchronizedMatrixByRows(Matrix A)
Returns a synchronized matrix which wraps the given matrix. |
Matrix |
AbstractMatrix.transABmult(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transABmult(double alpha,
Matrix B,
Matrix C)
C = alpha*AT*BT |
Matrix |
AbstractMatrix.transABmult(Matrix B,
Matrix C)
|
Matrix |
Matrix.transABmult(Matrix B,
Matrix C)
C = AT*BT |
Matrix |
AbstractMatrix.transABmultAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
DenseMatrix.transABmultAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transABmultAdd(double alpha,
Matrix B,
Matrix C)
C = alpha*AT*BT + C |
Matrix |
AbstractMatrix.transABmultAdd(Matrix B,
Matrix C)
|
Matrix |
Matrix.transABmultAdd(Matrix B,
Matrix C)
C = AT*BT + C |
Matrix |
AbstractMatrix.transAmult(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transAmult(double alpha,
Matrix B,
Matrix C)
C = alpha*AT*B |
Matrix |
AbstractMatrix.transAmult(Matrix B,
Matrix C)
|
Matrix |
Matrix.transAmult(Matrix B,
Matrix C)
C = AT*B |
Matrix |
AbstractMatrix.transAmultAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
DenseMatrix.transAmultAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transAmultAdd(double alpha,
Matrix B,
Matrix C)
C = alpha*AT*B + C |
Matrix |
AbstractMatrix.transAmultAdd(Matrix B,
Matrix C)
|
Matrix |
Matrix.transAmultAdd(Matrix B,
Matrix C)
C = AT*B + C |
Matrix |
AbstractMatrix.transBmult(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transBmult(double alpha,
Matrix B,
Matrix C)
C = alpha*A*BT |
Matrix |
AbstractMatrix.transBmult(Matrix B,
Matrix C)
|
Matrix |
Matrix.transBmult(Matrix B,
Matrix C)
C = A*BT |
Matrix |
AbstractMatrix.transBmultAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
DenseMatrix.transBmultAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transBmultAdd(double alpha,
Matrix B,
Matrix C)
C = alpha*A*BT + C |
Matrix |
AbstractMatrix.transBmultAdd(Matrix B,
Matrix C)
|
Matrix |
Matrix.transBmultAdd(Matrix B,
Matrix C)
C = A*BT + C |
Matrix |
AbstractMatrix.transpose()
|
Matrix |
BandMatrix.transpose()
|
Matrix |
Matrix.transpose()
Transposes the matrix in-place. |
Matrix |
SymmTridiagMatrix.transpose()
|
Matrix |
TridiagMatrix.transpose()
|
Matrix |
AbstractMatrix.transpose(Matrix B)
|
Matrix |
Matrix.transpose(Matrix B)
Sets the tranpose of this matrix into B . |
Matrix |
AbstractMatrix.transRank1(double alpha,
Matrix C)
|
Matrix |
Matrix.transRank1(double alpha,
Matrix C)
A = alpha*CT*C + A The matrices must be
square and of the same size |
Matrix |
AbstractMatrix.transRank1(Matrix C)
|
Matrix |
Matrix.transRank1(Matrix C)
A = CT*C + A The matrices must be square and
of the same size |
Matrix |
AbstractMatrix.transRank2(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transRank2(double alpha,
Matrix B,
Matrix C)
A = alpha*BT*C + alpha*CT*B + A . |
Matrix |
AbstractMatrix.transRank2(Matrix B,
Matrix C)
|
Matrix |
Matrix.transRank2(Matrix B,
Matrix C)
A = BT*C + CT*B + A . |
Matrix |
AbstractMatrix.transSolve(Matrix B,
Matrix X)
|
Matrix |
DenseMatrix.transSolve(Matrix B,
Matrix X)
|
Matrix |
Matrix.transSolve(Matrix B,
Matrix X)
X = AT\B . |
Matrix |
SymmTridiagMatrix.transSolve(Matrix B,
Matrix X)
|
Matrix |
AbstractMatrix.zero()
|
Matrix |
BandMatrix.zero()
|
Matrix |
Matrix.zero()
Zeros all the entries in the matrix, while preserving any underlying structure. |
Matrix |
UnitLowerTriangBandMatrix.zero()
|
Matrix |
UnitLowerTriangDenseMatrix.zero()
|
Matrix |
UnitUpperTriangBandMatrix.zero()
|
Matrix |
UnitUpperTriangDenseMatrix.zero()
|
Methods in no.uib.cipr.matrix with parameters of type Matrix | |
---|---|
Matrix |
AbstractMatrix.add(double alpha,
Matrix B)
|
Matrix |
Matrix.add(double alpha,
Matrix B)
A = alpha*B + A . |
Matrix |
AbstractMatrix.add(Matrix B)
|
Matrix |
Matrix.add(Matrix B)
A = B + A . |
void |
GivensRotation.apply(Matrix H,
int column,
int i1,
int i2)
Applies the Givens rotation to two elements in a matrix column |
static int |
Matrices.cardinality(Matrix A)
Returns the number of non-zero entries in the given matrix |
protected void |
AbstractMatrix.checkMultAdd(Matrix B,
Matrix C)
Checks the arguments to mult and multAdd |
protected void |
AbstractMatrix.checkRank1(Matrix C)
Checks that a matrix rank1 update is possible for the given matrix |
protected void |
AbstractMatrix.checkRank2(Matrix B,
Matrix C)
Checks that a rank2 update is legal for the given arguments |
protected void |
AbstractMatrix.checkSize(Matrix B)
Checks that the sizes of this matrix and the given conform |
protected void |
AbstractMatrix.checkSolve(Matrix B,
Matrix X)
Checks that a matrix inversion is legal for the given arguments. |
protected void |
AbstractMatrix.checkTransABmultAdd(Matrix B,
Matrix C)
Checks the arguments to transABmultAdd and
transABmultAdd |
protected void |
AbstractMatrix.checkTransAmultAdd(Matrix B,
Matrix C)
Checks the arguments to transAmult and
transAmultAdd |
protected void |
AbstractMatrix.checkTransBmultAdd(Matrix B,
Matrix C)
Checks the arguments to transBmult and
transBmultAdd |
protected void |
AbstractMatrix.checkTranspose(Matrix B)
Checks that this matrix can be transposed into the given matrix |
protected void |
AbstractMatrix.checkTransRank1(Matrix C)
Checks that a transposed rank1 update is leagal with the given argument |
protected void |
AbstractMatrix.checkTransRank2(Matrix B,
Matrix C)
Checks that a transposed rank2 update is leagal with the given arguments |
static int[] |
Matrices.columnBandwidth(Matrix A)
Finds the number of non-zero entries on each column |
QRP |
QRP.factor(Matrix A)
Executes a QR factorization for the given matrix. |
static DenseCholesky |
DenseCholesky.factorize(Matrix A)
Calculates a Cholesky decomposition |
static DenseLU |
DenseLU.factorize(Matrix A)
Creates an LU decomposition of the given matrix |
static EVD |
EVD.factorize(Matrix A)
Convenience method for computing the complete eigenvalue decomposition of the given matrix |
static LQ |
LQ.factorize(Matrix A)
Convenience method to compute a LQ decomposition |
static PackCholesky |
PackCholesky.factorize(Matrix A)
Calculates a Cholesky decomposition |
static QL |
QL.factorize(Matrix A)
Convenience method to compute a QL decomposition |
static QR |
QR.factorize(Matrix A)
Convenience method to compute a QR decomposition |
static QRP |
QRP.factorize(Matrix A)
Convenience method to compute a QR decomposition |
static RQ |
RQ.factorize(Matrix A)
Convenience method to compute an RQ decomposition |
static SVD |
SVD.factorize(Matrix A)
Convenience method for computing a full SVD |
static SymmDenseEVD |
SymmDenseEVD.factorize(Matrix A)
Convenience method for computing the full eigenvalue decomposition of the given matrix |
static SymmPackEVD |
SymmPackEVD.factorize(Matrix A)
Convenience method for computing the full eigenvalue decomposition of the given matrix |
static SymmTridiagEVD |
SymmTridiagEVD.factorize(Matrix A)
Convenience method for computing the full eigenvalue decomposition of the given matrix |
static SymmBandEVD |
SymmBandEVD.factorize(Matrix A,
int kd)
Convenience method for computing the full eigenvalue decomposition of the given matrix |
static double[][] |
Matrices.getArray(Matrix A)
Returns an array of arrays containing a copy of the given matrix. |
static int |
Matrices.getNumSubDiagonals(Matrix A)
Finds the number of diagonals below the main diagonal. |
static int |
Matrices.getNumSuperDiagonals(Matrix A)
Finds the number of diagonals above the main diagonal. |
static Matrix |
Matrices.getSubMatrix(Matrix A,
int[] row,
int[] column)
Returns a view into the given matrix. |
Matrix |
AbstractMatrix.mult(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.mult(double alpha,
Matrix B,
Matrix C)
C = alpha*A*B |
Matrix |
AbstractMatrix.mult(Matrix B,
Matrix C)
|
Matrix |
Matrix.mult(Matrix B,
Matrix C)
C = A*B |
Matrix |
AbstractMatrix.multAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
DenseMatrix.multAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.multAdd(double alpha,
Matrix B,
Matrix C)
C = alpha*A*B + C |
Matrix |
AbstractMatrix.multAdd(Matrix B,
Matrix C)
|
Matrix |
Matrix.multAdd(Matrix B,
Matrix C)
C = A*B + C |
static Matrix |
Matrices.random(Matrix A)
Populates a matrix with random numbers drawn from a uniform distribution between 0 and 1 |
Matrix |
AbstractMatrix.rank1(double alpha,
Matrix C)
|
Matrix |
Matrix.rank1(double alpha,
Matrix C)
A = alpha*C*CT + A . |
Matrix |
AbstractMatrix.rank1(Matrix C)
|
Matrix |
Matrix.rank1(Matrix C)
A = C*CT + A . |
Matrix |
AbstractMatrix.rank2(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.rank2(double alpha,
Matrix B,
Matrix C)
A = alpha*B*CT + alpha*C*BT + A . |
Matrix |
AbstractMatrix.rank2(Matrix B,
Matrix C)
|
Matrix |
Matrix.rank2(Matrix B,
Matrix C)
A = B*CT + C*BT + A . |
double |
BandCholesky.rcond(Matrix A)
Computes the reciprocal condition number |
double |
DenseCholesky.rcond(Matrix A)
Computes the reciprocal condition number |
double |
PackCholesky.rcond(Matrix A)
Computes the reciprocal condition number |
double |
BandLU.rcond(Matrix A,
Matrix.Norm norm)
Computes the reciprocal condition number, using either the infinity norm of the 1 norm. |
double |
DenseLU.rcond(Matrix A,
Matrix.Norm norm)
Computes the reciprocal condition number, using either the infinity norm of the 1 norm. |
static int[] |
Matrices.rowBandwidth(Matrix A)
Finds the number of non-zero entries on each row |
Matrix |
AbstractMatrix.set(double alpha,
Matrix B)
|
Matrix |
Matrix.set(double alpha,
Matrix B)
A=alpha*B . |
Matrix |
AbstractMatrix.set(Matrix B)
|
Matrix |
Matrix.set(Matrix B)
A=B . |
Matrix |
AbstractMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
BandMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
DenseMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
LowerSPDBandMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
LowerSPDDenseMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
LowerSPDPackMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
Matrix.solve(Matrix B,
Matrix X)
X = A\B . |
Matrix |
SPDTridiagMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
SymmTridiagMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
TridiagMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
UpperSPDBandMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
UpperSPDDenseMatrix.solve(Matrix B,
Matrix X)
|
Matrix |
UpperSPDPackMatrix.solve(Matrix B,
Matrix X)
|
static Matrix |
Matrices.synchronizedMatrix(Matrix A)
Returns a synchronized matrix which wraps the given matrix. |
static Matrix |
Matrices.synchronizedMatrixByColumns(Matrix A)
Returns a synchronized matrix which wraps the given matrix. |
static Matrix |
Matrices.synchronizedMatrixByRows(Matrix A)
Returns a synchronized matrix which wraps the given matrix. |
Matrix |
AbstractMatrix.transABmult(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transABmult(double alpha,
Matrix B,
Matrix C)
C = alpha*AT*BT |
Matrix |
AbstractMatrix.transABmult(Matrix B,
Matrix C)
|
Matrix |
Matrix.transABmult(Matrix B,
Matrix C)
C = AT*BT |
Matrix |
AbstractMatrix.transABmultAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
DenseMatrix.transABmultAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transABmultAdd(double alpha,
Matrix B,
Matrix C)
C = alpha*AT*BT + C |
Matrix |
AbstractMatrix.transABmultAdd(Matrix B,
Matrix C)
|
Matrix |
Matrix.transABmultAdd(Matrix B,
Matrix C)
C = AT*BT + C |
Matrix |
AbstractMatrix.transAmult(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transAmult(double alpha,
Matrix B,
Matrix C)
C = alpha*AT*B |
Matrix |
AbstractMatrix.transAmult(Matrix B,
Matrix C)
|
Matrix |
Matrix.transAmult(Matrix B,
Matrix C)
C = AT*B |
Matrix |
AbstractMatrix.transAmultAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
DenseMatrix.transAmultAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transAmultAdd(double alpha,
Matrix B,
Matrix C)
C = alpha*AT*B + C |
Matrix |
AbstractMatrix.transAmultAdd(Matrix B,
Matrix C)
|
Matrix |
Matrix.transAmultAdd(Matrix B,
Matrix C)
C = AT*B + C |
Matrix |
AbstractMatrix.transBmult(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transBmult(double alpha,
Matrix B,
Matrix C)
C = alpha*A*BT |
Matrix |
AbstractMatrix.transBmult(Matrix B,
Matrix C)
|
Matrix |
Matrix.transBmult(Matrix B,
Matrix C)
C = A*BT |
Matrix |
AbstractMatrix.transBmultAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
DenseMatrix.transBmultAdd(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transBmultAdd(double alpha,
Matrix B,
Matrix C)
C = alpha*A*BT + C |
Matrix |
AbstractMatrix.transBmultAdd(Matrix B,
Matrix C)
|
Matrix |
Matrix.transBmultAdd(Matrix B,
Matrix C)
C = A*BT + C |
Matrix |
AbstractMatrix.transpose(Matrix B)
|
Matrix |
Matrix.transpose(Matrix B)
Sets the tranpose of this matrix into B . |
Matrix |
AbstractMatrix.transRank1(double alpha,
Matrix C)
|
Matrix |
Matrix.transRank1(double alpha,
Matrix C)
A = alpha*CT*C + A The matrices must be
square and of the same size |
Matrix |
AbstractMatrix.transRank1(Matrix C)
|
Matrix |
Matrix.transRank1(Matrix C)
A = CT*C + A The matrices must be square and
of the same size |
Matrix |
AbstractMatrix.transRank2(double alpha,
Matrix B,
Matrix C)
|
Matrix |
Matrix.transRank2(double alpha,
Matrix B,
Matrix C)
A = alpha*BT*C + alpha*CT*B + A . |
Matrix |
AbstractMatrix.transRank2(Matrix B,
Matrix C)
|
Matrix |
Matrix.transRank2(Matrix B,
Matrix C)
A = BT*C + CT*B + A . |
Matrix |
AbstractMatrix.transSolve(Matrix B,
Matrix X)
|
Matrix |
DenseMatrix.transSolve(Matrix B,
Matrix X)
|
Matrix |
Matrix.transSolve(Matrix B,
Matrix X)
X = AT\B . |
Matrix |
SymmTridiagMatrix.transSolve(Matrix B,
Matrix X)
|
static void |
Matrices.zeroColumns(Matrix A,
double diagonal,
int... column)
Sets the selected columns of A equal zero, and puts
diagonal on the diagonal of those columns. |
static void |
Matrices.zeroRows(Matrix A,
double diagonal,
int... row)
Sets the selected rows of A equal zero, and puts
diagonal on the diagonal of those rows. |
Constructors in no.uib.cipr.matrix with parameters of type Matrix | |
---|---|
AbstractMatrix(Matrix A)
Constructor for AbstractMatrix, same size as A. |
|
BandMatrix(Matrix A,
int kl,
int ku)
Constructor for BandMatrix |
|
BandMatrix(Matrix A,
int kl,
int ku,
boolean deep)
Constructor for BandMatrix |
|
DenseMatrix(Matrix A)
Constructor for DenseMatrix |
|
DenseMatrix(Matrix A,
boolean deep)
Constructor for DenseMatrix |
|
LowerSPDBandMatrix(Matrix A,
int kd)
Constructor for LowerSPDBandMatrix |
|
LowerSPDBandMatrix(Matrix A,
int kd,
boolean deep)
Constructor for LowerSPDBandMatrix |
|
LowerSPDDenseMatrix(Matrix A)
Constructor for LowerSPDDenseMatrix |
|
LowerSPDDenseMatrix(Matrix A,
boolean deep)
Constructor for LowerSPDDenseMatrix |
|
LowerSPDPackMatrix(Matrix A)
Constructor for LowerSPDPackMatrix |
|
LowerSPDPackMatrix(Matrix A,
boolean deep)
Constructor for LowerSPDPackMatrix |
|
LowerSymmBandMatrix(Matrix A,
int kd)
Constructor for LowerSymmBandMatrix |
|
LowerSymmBandMatrix(Matrix A,
int kd,
boolean deep)
Constructor for LowerSymmBandMatrix |
|
LowerSymmDenseMatrix(Matrix A)
Constructor for LowerSymmDenseMatrix |
|
LowerSymmDenseMatrix(Matrix A,
boolean deep)
Constructor for LowerSymmDenseMatrix |
|
LowerSymmPackMatrix(Matrix A)
Constructor for LowerSymmPackMatrix |
|
LowerSymmPackMatrix(Matrix A,
boolean deep)
Constructor for LowerSymmPackMatrix |
|
LowerTriangBandMatrix(Matrix A,
int kd)
Constructor for LowerTriangBandMatrix |
|
LowerTriangBandMatrix(Matrix A,
int kd,
boolean deep)
Constructor for LowerTriangBandMatrix |
|
LowerTriangDenseMatrix(Matrix A)
Constructor for LowerTriangDenseMatrix |
|
LowerTriangDenseMatrix(Matrix A,
boolean deep)
Constructor for LowerTriangDenseMatrix |
|
LowerTriangDenseMatrix(Matrix A,
int k)
Constructor for LowerTriangDenseMatrix |
|
LowerTriangDenseMatrix(Matrix A,
int k,
boolean deep)
Constructor for LowerTriangDenseMatrix |
|
LowerTriangPackMatrix(Matrix A)
Constructor for LowerTriangPackMatrix |
|
LowerTriangPackMatrix(Matrix A,
boolean deep)
Constructor for LowerTriangPackMatrix |
|
SPDTridiagMatrix(Matrix A)
Constructor for SPDTridiagMatrix |
|
SPDTridiagMatrix(Matrix A,
boolean deep)
Constructor for SPDTridiagMatrix |
|
SymmTridiagMatrix(Matrix A)
Constructor for SymmTridiagMatrix |
|
SymmTridiagMatrix(Matrix A,
boolean deep)
Constructor for SymmTridiagMatrix |
|
TridiagMatrix(Matrix A)
Constructor for TridiagMatrix |
|
TridiagMatrix(Matrix A,
boolean deep)
Constructor for TridiagMatrix |
|
UnitLowerTriangBandMatrix(Matrix A,
int kd)
Constructor for UnitLowerTriangBandMatrix |
|
UnitLowerTriangBandMatrix(Matrix A,
int kd,
boolean deep)
Constructor for UnitLowerTriangBandMatrix |
|
UnitLowerTriangDenseMatrix(Matrix A)
Constructor for UnitLowerTriangDenseMatrix |
|
UnitLowerTriangDenseMatrix(Matrix A,
boolean deep)
Constructor for UnitLowerTriangDenseMatrix |
|
UnitLowerTriangPackMatrix(Matrix A)
Constructor for UnitLowerTriangPackMatrix |
|
UnitLowerTriangPackMatrix(Matrix A,
boolean deep)
Constructor for UnitLowerTriangPackMatrix |
|
UnitUpperTriangBandMatrix(Matrix A,
int kd)
Constructor for UnitUpperTriangBandMatrix |
|
UnitUpperTriangBandMatrix(Matrix A,
int kd,
boolean deep)
Constructor for UnitUpperTriangBandMatrix |
|
UnitUpperTriangDenseMatrix(Matrix A)
Constructor for UnitUpperTriangDenseMatrix. |
|
UnitUpperTriangDenseMatrix(Matrix A,
boolean deep)
Constructor for UnitUpperTriangDenseMatrix. |
|
UnitUpperTriangPackMatrix(Matrix A)
Constructor for UnitUpperTriangPackMatrix |
|
UnitUpperTriangPackMatrix(Matrix A,
boolean deep)
Constructor for UnitUpperTriangPackMatrix |
|
UpperSPDBandMatrix(Matrix A,
int kd)
Constructor for UpperSPDBandMatrix |
|
UpperSPDBandMatrix(Matrix A,
int kd,
boolean deep)
Constructor for UpperSPDBandMatrix |
|
UpperSPDDenseMatrix(Matrix A)
Constructor for UpperSPDDenseMatrix |
|
UpperSPDDenseMatrix(Matrix A,
boolean deep)
Constructor for UpperSPDDenseMatrix |
|
UpperSPDPackMatrix(Matrix A)
Constructor for UpperSPDPackMatrix |
|
UpperSPDPackMatrix(Matrix A,
boolean deep)
Constructor for UpperSPDPackMatrix |
|
UpperSymmBandMatrix(Matrix A,
int kd)
Constructor for UpperSymmBandMatrix |
|
UpperSymmBandMatrix(Matrix A,
int kd,
boolean deep)
Constructor for UpperSymmBandMatrix |
|
UpperSymmDenseMatrix(Matrix A)
Constructor for UpperSymmDenseMatrix |
|
UpperSymmDenseMatrix(Matrix A,
boolean deep)
Constructor for UpperSymmDenseMatrix |
|
UpperSymmPackMatrix(Matrix A)
Constructor for UpperSymmPackMatrix |
|
UpperSymmPackMatrix(Matrix A,
boolean deep)
Constructor for UpperSymmPackMatrix |
|
UpperTriangBandMatrix(Matrix A,
int kd)
Constructor for UpperTriangBandMatrix |
|
UpperTriangBandMatrix(Matrix A,
int kd,
boolean deep)
Constructor for UpperTriangBandMatrix |
|
UpperTriangDenseMatrix(Matrix A)
Constructor for UpperTriangDenseMatrix |
|
UpperTriangDenseMatrix(Matrix A,
boolean deep)
Constructor for UpperTriangDenseMatrix |
|
UpperTriangDenseMatrix(Matrix A,
int k)
Constructor for UpperTriangDenseMatrix |
|
UpperTriangDenseMatrix(Matrix A,
int k,
boolean deep)
Constructor for UpperTriangDenseMatrix |
|
UpperTriangPackMatrix(Matrix A)
Constructor for UpperTriangPackMatrix |
|
UpperTriangPackMatrix(Matrix A,
boolean deep)
Constructor for UpperTriangPackMatrix |
Uses of Matrix in no.uib.cipr.matrix.distributed |
---|
Classes in no.uib.cipr.matrix.distributed that implement Matrix | |
---|---|
class |
DistColMatrix
Deprecated. the no.uib.cipr.matrix.distributed package has been deprecated because
of a number of hard to fix concurrency bugs. It is distributed only for backwards compatibility,
but is not recommended. The utility of this package is questionable, as it does not allow
distribution of computation between JVMs or across a network. For many people, distributed
computing of multiple matrices can be achieved at a user-level through the
JPPF Framework.
Users who need to deal with few very large matrices may wish to implement their own storage classes
and solvers using JPPF, but this will not be supported directly in matrix-toolkits-java. |
class |
DistRowMatrix
Deprecated. the no.uib.cipr.matrix.distributed package has been deprecated because
of a number of hard to fix concurrency bugs. It is distributed only for backwards compatibility,
but is not recommended. The utility of this package is questionable, as it does not allow
distribution of computation between JVMs or across a network. For many people, distributed
computing of multiple matrices can be achieved at a user-level through the
JPPF Framework.
Users who need to deal with few very large matrices may wish to implement their own storage classes
and solvers using JPPF, but this will not be supported directly in matrix-toolkits-java. |
Methods in no.uib.cipr.matrix.distributed with parameters of type Matrix | |
---|---|
void |
BlockDiagonalPreconditioner.setMatrix(Matrix A)
Deprecated. |
void |
TwoLevelPreconditioner.setMatrix(Matrix A)
Deprecated. |
Constructors in no.uib.cipr.matrix.distributed with parameters of type Matrix | |
---|---|
DistColMatrix(int numRows,
int numColumns,
Communicator comm,
Matrix A,
Matrix B)
Deprecated. Constructor for DistColMatrix |
|
DistRowMatrix(int numRows,
int numColumns,
Communicator comm,
Matrix A,
Matrix B)
Deprecated. Constructor for DistRowMatrix |
Uses of Matrix in no.uib.cipr.matrix.sparse |
---|
Classes in no.uib.cipr.matrix.sparse that implement Matrix | |
---|---|
class |
CompColMatrix
Compressed column storage (CCS) matrix |
class |
CompDiagMatrix
Compressed diagonal storage (CDS) matrix |
class |
CompRowMatrix
Compressed row storage (CRS) matrix |
class |
FlexCompColMatrix
Matrix stored column-wise into sparse vectors |
class |
FlexCompRowMatrix
Matrix stored row-wise into sparse vectors |
Methods in no.uib.cipr.matrix.sparse that return Matrix | |
---|---|
Matrix |
CompDiagMatrix.copy()
|
Matrix |
FlexCompRowMatrix.copy()
|
Matrix |
CompRowMatrix.mult(Matrix B,
Matrix C)
|
Matrix |
CompRowMatrix.set(Matrix B)
|
Matrix |
FlexCompRowMatrix.set(Matrix B)
|
Matrix |
CompDiagMatrix.zero()
|
Methods in no.uib.cipr.matrix.sparse with parameters of type Matrix | |
---|---|
protected void |
AbstractIterativeSolver.checkSizes(Matrix A,
Vector b,
Vector x)
Checks sizes of input data for IterativeSolver.solve(Matrix, Vector, Vector) . |
Matrix |
CompRowMatrix.mult(Matrix B,
Matrix C)
|
Matrix |
CompRowMatrix.set(Matrix B)
|
Matrix |
FlexCompRowMatrix.set(Matrix B)
|
void |
AMG.setMatrix(Matrix A)
|
void |
DiagonalPreconditioner.setMatrix(Matrix A)
|
void |
ICC.setMatrix(Matrix A)
|
void |
ILU.setMatrix(Matrix A)
|
void |
ILUT.setMatrix(Matrix A)
|
void |
Preconditioner.setMatrix(Matrix A)
Sets the operator matrix for the preconditioner. |
void |
SSOR.setMatrix(Matrix A)
|
Vector |
BiCG.solve(Matrix A,
Vector b,
Vector x)
|
Vector |
BiCGstab.solve(Matrix A,
Vector b,
Vector x)
|
Vector |
CG.solve(Matrix A,
Vector b,
Vector x)
|
Vector |
CGS.solve(Matrix A,
Vector b,
Vector x)
|
Vector |
Chebyshev.solve(Matrix A,
Vector b,
Vector x)
|
Vector |
GMRES.solve(Matrix A,
Vector b,
Vector x)
|
Vector |
IR.solve(Matrix A,
Vector b,
Vector x)
|
Vector |
IterativeSolver.solve(Matrix A,
Vector b,
Vector x)
Solves the given problem, writing result into the vector. |
Vector |
QMR.solve(Matrix A,
Vector b,
Vector x)
|
Constructors in no.uib.cipr.matrix.sparse with parameters of type Matrix | |
---|---|
CompColMatrix(Matrix A)
Constructor for CompColMatrix |
|
CompColMatrix(Matrix A,
boolean deep)
Constructor for CompColMatrix |
|
CompDiagMatrix(Matrix A)
Creates a new sparse matrix copied from the given matrix. |
|
CompDiagMatrix(Matrix A,
boolean deep)
Creates a new sparse matrix copied from the given matrix. |
|
CompDiagMatrix(Matrix A,
int[] diagonal)
Creates a new sparse matrix copied from the given matrix. |
|
CompDiagMatrix(Matrix A,
int[] diagonal,
boolean deep)
Creates a new sparse matrix copied from the given matrix. |
|
CompRowMatrix(Matrix A)
Constructor for CompRowMatrix |
|
CompRowMatrix(Matrix A,
boolean deep)
Constructor for CompRowMatrix |
|
FlexCompColMatrix(Matrix A)
Constructor for FlexCompColMatrix |
|
FlexCompColMatrix(Matrix A,
boolean deep)
Constructor for FlexCompColMatrix |
|
FlexCompRowMatrix(Matrix A)
Constructor for FlexCompRowMatrix |
|
FlexCompRowMatrix(Matrix A,
boolean deep)
Constructor for FlexCompRowMatrix |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |