Uses of Interface no.uib.cipr.matrix.Matrix (Matrix Toolkits for Java 1.0 API)

Packages that use Matrix
Package	Description
no.uib.cipr.matrix	Dense and structured sparse matrices, along with matrix factorisations and solvers.
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
Modifier and Type	Class and Description
`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`	`PermutationMatrix` Matrix that represents a permutation of another matrix's rows / columns.
`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
Modifier and Type	Method and Description
`Matrix`	Matrix.`add(double alpha, Matrix B)` `A = alpha*B + A`.
`Matrix`	AbstractMatrix.`add(double alpha, Matrix B)`
`Matrix`	Matrix.`add(Matrix B)` `A = B + A`.
`Matrix`	AbstractMatrix.`add(Matrix B)`
`Matrix`	Matrix.`copy()` Creates a deep copy of the matrix
`Matrix`	AbstractMatrix.`copy()`
`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`	Matrix.`mult(double alpha, Matrix B, Matrix C)` `C = alphaAB`
`Matrix`	AbstractMatrix.`mult(double alpha, Matrix B, Matrix C)`
`Matrix`	PermutationMatrix.`mult(Matrix B, DenseMatrix C)`
`Matrix`	PermutationMatrix.`mult(Matrix B, Matrix C)`
`Matrix`	Matrix.`mult(Matrix B, Matrix C)` `C = A*B`
`Matrix`	AbstractMatrix.`mult(Matrix B, Matrix C)`
`Matrix`	Matrix.`multAdd(double alpha, Matrix B, Matrix C)` `C = alphaAB + C`
`Matrix`	DenseMatrix.`multAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	AbstractMatrix.`multAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`multAdd(Matrix B, Matrix C)` `C = A*B + C`
`Matrix`	AbstractMatrix.`multAdd(Matrix B, Matrix 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`	Matrix.`rank1(double alpha, Matrix C)` `A = alphaCC^T + A`.
`Matrix`	AbstractMatrix.`rank1(double alpha, Matrix C)`
`Matrix`	Matrix.`rank1(double alpha, Vector x)` `A = alphaxx^T + A`.
`Matrix`	AbstractMatrix.`rank1(double alpha, Vector x)`
`Matrix`	Matrix.`rank1(double alpha, Vector x, Vector y)` `A = alphaxy^T + A`.
`Matrix`	DenseMatrix.`rank1(double alpha, Vector x, Vector y)`
`Matrix`	AbstractMatrix.`rank1(double alpha, Vector x, Vector y)`
`Matrix`	Matrix.`rank1(Matrix C)` `A = C*C^T + A`.
`Matrix`	AbstractMatrix.`rank1(Matrix C)`
`Matrix`	Matrix.`rank1(Vector x)` `A = x*x^T + A`.
`Matrix`	AbstractMatrix.`rank1(Vector x)`
`Matrix`	Matrix.`rank1(Vector x, Vector y)` `A = x*y^T + A`.
`Matrix`	AbstractMatrix.`rank1(Vector x, Vector y)`
`Matrix`	Matrix.`rank2(double alpha, Matrix B, Matrix C)` `A = alphaBC^T + alphaCB^T + A`.
`Matrix`	AbstractMatrix.`rank2(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`rank2(double alpha, Vector x, Vector y)` `A = alphaxy^T + alphayx^T + A`.
`Matrix`	AbstractMatrix.`rank2(double alpha, Vector x, Vector y)`
`Matrix`	Matrix.`rank2(Matrix B, Matrix C)` `A = BC^T + CB^T + A`.
`Matrix`	AbstractMatrix.`rank2(Matrix B, Matrix C)`
`Matrix`	Matrix.`rank2(Vector x, Vector y)` `A = xy^T + yx^T + A`.
`Matrix`	AbstractMatrix.`rank2(Vector x, Vector y)`
`Matrix`	Matrix.`scale(double alpha)` `A = alpha*A`
`Matrix`	AbstractMatrix.`scale(double alpha)`
`Matrix`	Matrix.`set(double alpha, Matrix B)` `A=alpha*B`.
`Matrix`	AbstractMatrix.`set(double alpha, Matrix B)`
`Matrix`	UpperTriangDenseMatrix.`set(Matrix A)`
`Matrix`	Matrix.`set(Matrix B)` `A=B`.
`Matrix`	LowerTriangDenseMatrix.`set(Matrix A)`
`Matrix`	AbstractMatrix.`set(Matrix B)`
`Matrix`	UpperSPDPackMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	UpperSPDDenseMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	UpperSPDBandMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	TridiagMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	SymmTridiagMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	SPDTridiagMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	Matrix.`solve(Matrix B, Matrix X)` `X = A\B`.
`Matrix`	LowerSPDPackMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	LowerSPDDenseMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	LowerSPDBandMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	DenseMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	BandMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	AbstractMatrix.`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`	Matrix.`transABmult(double alpha, Matrix B, Matrix C)` `C = alphaA^TB^T`
`Matrix`	AbstractMatrix.`transABmult(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`transABmult(Matrix B, Matrix C)` `C = A^T*B^T`
`Matrix`	AbstractMatrix.`transABmult(Matrix B, Matrix C)`
`Matrix`	Matrix.`transABmultAdd(double alpha, Matrix B, Matrix C)` `C = alphaA^TB^T + C`
`Matrix`	DenseMatrix.`transABmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	AbstractMatrix.`transABmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`transABmultAdd(Matrix B, Matrix C)` `C = A^T*B^T + C`
`Matrix`	AbstractMatrix.`transABmultAdd(Matrix B, Matrix C)`
`Matrix`	Matrix.`transAmult(double alpha, Matrix B, Matrix C)` `C = alphaA^TB`
`Matrix`	AbstractMatrix.`transAmult(double alpha, Matrix B, Matrix C)`
`Matrix`	PermutationMatrix.`transAmult(Matrix B, DenseMatrix C)`
`Matrix`	PermutationMatrix.`transAmult(Matrix B, Matrix C)`
`Matrix`	Matrix.`transAmult(Matrix B, Matrix C)` `C = A^T*B`
`Matrix`	AbstractMatrix.`transAmult(Matrix B, Matrix C)`
`Matrix`	Matrix.`transAmultAdd(double alpha, Matrix B, Matrix C)` `C = alphaA^TB + C`
`Matrix`	DenseMatrix.`transAmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	AbstractMatrix.`transAmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`transAmultAdd(Matrix B, Matrix C)` `C = A^T*B + C`
`Matrix`	AbstractMatrix.`transAmultAdd(Matrix B, Matrix C)`
`Matrix`	Matrix.`transBmult(double alpha, Matrix B, Matrix C)` `C = alphaAB^T`
`Matrix`	AbstractMatrix.`transBmult(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`transBmult(Matrix B, Matrix C)` `C = A*B^T`
`Matrix`	AbstractMatrix.`transBmult(Matrix B, Matrix C)`
`Matrix`	Matrix.`transBmultAdd(double alpha, Matrix B, Matrix C)` `C = alphaAB^T + C`
`Matrix`	DenseMatrix.`transBmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	AbstractMatrix.`transBmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`transBmultAdd(Matrix B, Matrix C)` `C = A*B^T + C`
`Matrix`	AbstractMatrix.`transBmultAdd(Matrix B, Matrix C)`
`Matrix`	TridiagMatrix.`transpose()`
`Matrix`	SymmTridiagMatrix.`transpose()`
`Matrix`	PermutationMatrix.`transpose()`
`Matrix`	Matrix.`transpose()` Transposes the matrix in-place.
`Matrix`	BandMatrix.`transpose()`
`Matrix`	AbstractMatrix.`transpose()`
`Matrix`	Matrix.`transpose(Matrix B)` Sets the tranpose of this matrix into `B`.
`Matrix`	AbstractMatrix.`transpose(Matrix B)`
`Matrix`	Matrix.`transRank1(double alpha, Matrix C)` `A = alphaC^TC + A` The matrices must be square and of the same size
`Matrix`	AbstractMatrix.`transRank1(double alpha, Matrix C)`
`Matrix`	Matrix.`transRank1(Matrix C)` `A = C^T*C + A` The matrices must be square and of the same size
`Matrix`	AbstractMatrix.`transRank1(Matrix C)`
`Matrix`	Matrix.`transRank2(double alpha, Matrix B, Matrix C)` `A = alphaB^TC + alphaC^TB + A`.
`Matrix`	AbstractMatrix.`transRank2(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`transRank2(Matrix B, Matrix C)` `A = B^TC + C^TB + A`.
`Matrix`	AbstractMatrix.`transRank2(Matrix B, Matrix C)`
`Matrix`	SymmTridiagMatrix.`transSolve(Matrix B, Matrix X)`
`Matrix`	Matrix.`transSolve(Matrix B, Matrix X)` `X = A^T\B`.
`Matrix`	DenseMatrix.`transSolve(Matrix B, Matrix X)`
`Matrix`	AbstractMatrix.`transSolve(Matrix B, Matrix X)`
`Matrix`	UnitUpperTriangDenseMatrix.`zero()`
`Matrix`	UnitUpperTriangBandMatrix.`zero()`
`Matrix`	UnitLowerTriangDenseMatrix.`zero()`
`Matrix`	UnitLowerTriangBandMatrix.`zero()`
`Matrix`	Matrix.`zero()` Zeros all the entries in the matrix, while preserving any underlying structure.
`Matrix`	BandMatrix.`zero()`
`Matrix`	AbstractMatrix.`zero()`

Methods in no.uib.cipr.matrix with parameters of type Matrix
Modifier and Type	Method and Description
`Matrix`	Matrix.`add(double alpha, Matrix B)` `A = alpha*B + A`.
`Matrix`	AbstractMatrix.`add(double alpha, Matrix B)`
`Matrix`	Matrix.`add(Matrix B)` `A = B + A`.
`Matrix`	AbstractMatrix.`add(Matrix B)`
`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 SymmTridiagEVD`	SymmTridiagEVD.`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 SymmDenseEVD`	SymmDenseEVD.`factorize(Matrix A)` Convenience method for computing the full eigenvalue decomposition of the given matrix
`static SVD`	SVD.`factorize(Matrix A)` Convenience method for computing a full SVD
`static RQ`	RQ.`factorize(Matrix A)` Convenience method to compute an RQ decomposition
`static QRP`	QRP.`factorize(Matrix A)` Convenience method to compute a QR decomposition
`static QR`	QR.`factorize(Matrix A)` Convenience method to compute a QR decomposition
`static QL`	QL.`factorize(Matrix A)` Convenience method to compute a QL decomposition
`static PackCholesky`	PackCholesky.`factorize(Matrix A)` Calculates a Cholesky decomposition
`static LQ`	LQ.`factorize(Matrix A)` Convenience method to compute a LQ decomposition
`static EVD`	EVD.`factorize(Matrix A)` Convenience method for computing the complete eigenvalue decomposition of the given matrix
`static DenseLU`	DenseLU.`factorize(Matrix A)` Creates an LU decomposition of the given matrix
`static DenseCholesky`	DenseCholesky.`factorize(Matrix A)` Calculates a Cholesky decomposition
`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 DenseVector`	Matrices.`getColumn(Matrix m, int j)`
`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`	Matrix.`mult(double alpha, Matrix B, Matrix C)` `C = alphaAB`
`Matrix`	AbstractMatrix.`mult(double alpha, Matrix B, Matrix C)`
`Matrix`	PermutationMatrix.`mult(Matrix B, DenseMatrix C)`
`Matrix`	PermutationMatrix.`mult(Matrix B, Matrix C)`
`Matrix`	Matrix.`mult(Matrix B, Matrix C)` `C = A*B`
`Matrix`	AbstractMatrix.`mult(Matrix B, Matrix C)`
`Matrix`	Matrix.`multAdd(double alpha, Matrix B, Matrix C)` `C = alphaAB + C`
`Matrix`	DenseMatrix.`multAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	AbstractMatrix.`multAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`multAdd(Matrix B, Matrix C)` `C = A*B + C`
`Matrix`	AbstractMatrix.`multAdd(Matrix B, Matrix C)`
`static Matrix`	Matrices.`random(Matrix A)` Populates a matrix with random numbers drawn from a uniform distribution between 0 and 1
`Matrix`	Matrix.`rank1(double alpha, Matrix C)` `A = alphaCC^T + A`.
`Matrix`	AbstractMatrix.`rank1(double alpha, Matrix C)`
`Matrix`	Matrix.`rank1(Matrix C)` `A = C*C^T + A`.
`Matrix`	AbstractMatrix.`rank1(Matrix C)`
`Matrix`	Matrix.`rank2(double alpha, Matrix B, Matrix C)` `A = alphaBC^T + alphaCB^T + A`.
`Matrix`	AbstractMatrix.`rank2(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`rank2(Matrix B, Matrix C)` `A = BC^T + CB^T + A`.
`Matrix`	AbstractMatrix.`rank2(Matrix B, Matrix C)`
`double`	PackCholesky.`rcond(Matrix A)` Computes the reciprocal condition number
`double`	DenseCholesky.`rcond(Matrix A)` Computes the reciprocal condition number
`double`	BandCholesky.`rcond(Matrix A)` Computes the reciprocal condition number
`double`	DenseLU.`rcond(Matrix A, Matrix.Norm norm)` Computes the reciprocal condition number, using either the infinity norm of the 1 norm.
`double`	BandLU.`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`	Matrix.`set(double alpha, Matrix B)` `A=alpha*B`.
`Matrix`	AbstractMatrix.`set(double alpha, Matrix B)`
`Matrix`	UpperTriangDenseMatrix.`set(Matrix A)`
`Matrix`	Matrix.`set(Matrix B)` `A=B`.
`Matrix`	LowerTriangDenseMatrix.`set(Matrix A)`
`Matrix`	AbstractMatrix.`set(Matrix B)`
`Matrix`	UpperSPDPackMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	UpperSPDDenseMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	UpperSPDBandMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	TridiagMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	SymmTridiagMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	SPDTridiagMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	Matrix.`solve(Matrix B, Matrix X)` `X = A\B`.
`Matrix`	LowerSPDPackMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	LowerSPDDenseMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	LowerSPDBandMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	DenseMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	BandMatrix.`solve(Matrix B, Matrix X)`
`Matrix`	AbstractMatrix.`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`	Matrix.`transABmult(double alpha, Matrix B, Matrix C)` `C = alphaA^TB^T`
`Matrix`	AbstractMatrix.`transABmult(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`transABmult(Matrix B, Matrix C)` `C = A^T*B^T`
`Matrix`	AbstractMatrix.`transABmult(Matrix B, Matrix C)`
`Matrix`	Matrix.`transABmultAdd(double alpha, Matrix B, Matrix C)` `C = alphaA^TB^T + C`
`Matrix`	DenseMatrix.`transABmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	AbstractMatrix.`transABmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`transABmultAdd(Matrix B, Matrix C)` `C = A^T*B^T + C`
`Matrix`	AbstractMatrix.`transABmultAdd(Matrix B, Matrix C)`
`Matrix`	Matrix.`transAmult(double alpha, Matrix B, Matrix C)` `C = alphaA^TB`
`Matrix`	AbstractMatrix.`transAmult(double alpha, Matrix B, Matrix C)`
`Matrix`	PermutationMatrix.`transAmult(Matrix B, DenseMatrix C)`
`Matrix`	PermutationMatrix.`transAmult(Matrix B, Matrix C)`
`Matrix`	Matrix.`transAmult(Matrix B, Matrix C)` `C = A^T*B`
`Matrix`	AbstractMatrix.`transAmult(Matrix B, Matrix C)`
`Matrix`	Matrix.`transAmultAdd(double alpha, Matrix B, Matrix C)` `C = alphaA^TB + C`
`Matrix`	DenseMatrix.`transAmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	AbstractMatrix.`transAmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`transAmultAdd(Matrix B, Matrix C)` `C = A^T*B + C`
`Matrix`	AbstractMatrix.`transAmultAdd(Matrix B, Matrix C)`
`Matrix`	Matrix.`transBmult(double alpha, Matrix B, Matrix C)` `C = alphaAB^T`
`Matrix`	AbstractMatrix.`transBmult(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`transBmult(Matrix B, Matrix C)` `C = A*B^T`
`Matrix`	AbstractMatrix.`transBmult(Matrix B, Matrix C)`
`Matrix`	Matrix.`transBmultAdd(double alpha, Matrix B, Matrix C)` `C = alphaAB^T + C`
`Matrix`	DenseMatrix.`transBmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	AbstractMatrix.`transBmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`transBmultAdd(Matrix B, Matrix C)` `C = A*B^T + C`
`Matrix`	AbstractMatrix.`transBmultAdd(Matrix B, Matrix C)`
`Matrix`	Matrix.`transpose(Matrix B)` Sets the tranpose of this matrix into `B`.
`Matrix`	AbstractMatrix.`transpose(Matrix B)`
`Matrix`	Matrix.`transRank1(double alpha, Matrix C)` `A = alphaC^TC + A` The matrices must be square and of the same size
`Matrix`	AbstractMatrix.`transRank1(double alpha, Matrix C)`
`Matrix`	Matrix.`transRank1(Matrix C)` `A = C^T*C + A` The matrices must be square and of the same size
`Matrix`	AbstractMatrix.`transRank1(Matrix C)`
`Matrix`	Matrix.`transRank2(double alpha, Matrix B, Matrix C)` `A = alphaB^TC + alphaC^TB + A`.
`Matrix`	AbstractMatrix.`transRank2(double alpha, Matrix B, Matrix C)`
`Matrix`	Matrix.`transRank2(Matrix B, Matrix C)` `A = B^TC + C^TB + A`.
`Matrix`	AbstractMatrix.`transRank2(Matrix B, Matrix C)`
`Matrix`	SymmTridiagMatrix.`transSolve(Matrix B, Matrix X)`
`Matrix`	Matrix.`transSolve(Matrix B, Matrix X)` `X = A^T\B`.
`Matrix`	DenseMatrix.`transSolve(Matrix B, Matrix X)`
`Matrix`	AbstractMatrix.`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
Constructor and Description
`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.sparse

Classes in no.uib.cipr.matrix.sparse that implement Matrix
Modifier and Type	Class and Description
`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
`class`	`LinkedSparseMatrix` A Linked List (with shortcuts to important nodes) implementation of an `n x m` Matrix with `z` elements that has a typical `O(z / m)` insertion / lookup cost and an iterator that traverses columns then rows: a good fit for unstructured sparse matrices.

Methods in no.uib.cipr.matrix.sparse that return Matrix
Modifier and Type	Method and Description
`Matrix`	LinkedSparseMatrix.`copy()`
`Matrix`	FlexCompRowMatrix.`copy()`
`Matrix`	CompDiagMatrix.`copy()`
`Matrix`	CompRowMatrix.`mult(Matrix B, Matrix C)`
`Matrix`	LinkedSparseMatrix.`multAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	LinkedSparseMatrix.`scale(double alpha)`
`Matrix`	FlexCompRowMatrix.`set(Matrix B)`
`Matrix`	CompRowMatrix.`set(Matrix B)`
`Matrix`	LinkedSparseMatrix.`transABmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	LinkedSparseMatrix.`transAmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	LinkedSparseMatrix.`transBmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	LinkedSparseMatrix.`transpose()`
`Matrix`	LinkedSparseMatrix.`zero()`
`Matrix`	CompDiagMatrix.`zero()`

Methods in no.uib.cipr.matrix.sparse with parameters of type Matrix
Modifier and Type	Method and Description
`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`	LinkedSparseMatrix.`multAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	FlexCompRowMatrix.`set(Matrix B)`
`Matrix`	CompRowMatrix.`set(Matrix B)`
`void`	SSOR.`setMatrix(Matrix A)`
`void`	Preconditioner.`setMatrix(Matrix A)` Sets the operator matrix for the preconditioner.
`void`	ILUT.`setMatrix(Matrix A)`
`void`	ILU.`setMatrix(Matrix A)`
`void`	ICC.`setMatrix(Matrix A)`
`void`	DiagonalPreconditioner.`setMatrix(Matrix A)`
`void`	AMG.`setMatrix(Matrix A)`
`Vector`	QMR.`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`	IR.`solve(Matrix A, Vector b, Vector x)`
`Vector`	GMRES.`solve(Matrix A, Vector b, Vector x)`
`Vector`	Chebyshev.`solve(Matrix A, Vector b, Vector x)`
`Vector`	CGS.`solve(Matrix A, Vector b, Vector x)`
`Vector`	CG.`solve(Matrix A, Vector b, Vector x)`
`Vector`	BiCGstab.`solve(Matrix A, Vector b, Vector x)`
`Vector`	BiCG.`solve(Matrix A, Vector b, Vector x)`
`Matrix`	LinkedSparseMatrix.`transABmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	LinkedSparseMatrix.`transAmultAdd(double alpha, Matrix B, Matrix C)`
`Matrix`	LinkedSparseMatrix.`transBmultAdd(double alpha, Matrix B, Matrix C)`

Constructors in no.uib.cipr.matrix.sparse with parameters of type Matrix
Constructor and Description
`ArpackSym(Matrix 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
`LinkedSparseMatrix(Matrix A)`

Uses of Interfaceno.uib.cipr.matrix.Matrix

Uses of Matrix in no.uib.cipr.matrix

Uses of Matrix in no.uib.cipr.matrix.sparse

Uses of Interface
no.uib.cipr.matrix.Matrix