public class TridiagMatrix extends AbstractMatrix
n
for the diagonal, two of length n-1
for the superdiagonal and
subdiagonal entries.Matrix.Norm
numColumns, numRows
Constructor and Description |
---|
TridiagMatrix(int n)
Constructor for TridiagMatrix
|
TridiagMatrix(Matrix A)
Constructor for TridiagMatrix
|
TridiagMatrix(Matrix A,
boolean deep)
Constructor for TridiagMatrix
|
Modifier and Type | Method and Description |
---|---|
void |
add(int row,
int column,
double value)
A(row,column) += value |
TridiagMatrix |
copy()
Creates a deep copy of the matrix
|
double |
get(int row,
int column)
Returns
A(row,column) |
double[] |
getDiagonal()
Returns the diagonal entries.
|
double[] |
getSubDiagonal()
Returns the sub diagonal entries.
|
double[] |
getSuperDiagonal()
Returns the super diagonal entries.
|
Iterator<MatrixEntry> |
iterator() |
void |
set(int row,
int column,
double value)
A(row,column) = value |
Matrix |
solve(Matrix B,
Matrix X)
X = A\B . |
Vector |
solve(Vector b,
Vector x)
x = A\b . |
Matrix |
transpose()
Transposes the matrix in-place.
|
TridiagMatrix |
zero()
Zeros all the entries in the matrix, while preserving any underlying
structure.
|
add, add, check, checkMultAdd, checkMultAdd, checkRank1, checkRank1, checkRank2, checkRank2, checkSize, checkSolve, checkSolve, checkTransABmultAdd, checkTransAmultAdd, checkTransBmultAdd, checkTransMultAdd, checkTranspose, checkTranspose, checkTransRank1, checkTransRank2, isSquare, max, max, mult, mult, mult, mult, multAdd, multAdd, multAdd, multAdd, norm, norm1, normF, normInf, numColumns, numRows, rank1, rank1, rank1, rank1, rank1, rank1, rank2, rank2, rank2, rank2, scale, set, set, toString, transABmult, transABmult, transABmultAdd, transABmultAdd, transAmult, transAmult, transAmultAdd, transAmultAdd, transBmult, transBmult, transBmultAdd, transBmultAdd, transMult, transMult, transMultAdd, transMultAdd, transpose, transRank1, transRank1, transRank2, transRank2, transSolve, transSolve
public TridiagMatrix(int n)
n
- Size of the matrix. Since the matrix must be square, this
equals both the number of rows and columnspublic TridiagMatrix(Matrix A)
A
- Matrix to copy from. Only the tridiagonal part is copiedpublic TridiagMatrix(Matrix A, boolean deep)
A
- Matrix to copy from. Only the tridiagonal part is copieddeep
- True for a deep copy, else it's shallow. For shallow copies,
A
must be a TridiagMatrix
public double[] getDiagonal()
n
public double[] getSubDiagonal()
n-1
public double[] getSuperDiagonal()
n-1
public void add(int row, int column, double value)
Matrix
A(row,column) += value
add
in interface Matrix
add
in class AbstractMatrix
public double get(int row, int column)
Matrix
A(row,column)
get
in interface Matrix
get
in class AbstractMatrix
public void set(int row, int column, double value)
Matrix
A(row,column) = value
set
in interface Matrix
set
in class AbstractMatrix
public TridiagMatrix copy()
Matrix
copy
in interface Matrix
copy
in class AbstractMatrix
public TridiagMatrix zero()
Matrix
zero
in interface Matrix
zero
in class AbstractMatrix
public Matrix solve(Matrix B, Matrix X)
Matrix
X = A\B
. Not all matrices support this operation, those
that do not throw UnsupportedOperationException
. Note
that it is often more efficient to use a matrix decomposition and its
associated solversolve
in interface Matrix
solve
in class AbstractMatrix
B
- Matrix with the same number of rows as A
, and
the same number of columns as X
X
- Matrix with a number of rows equal A.numColumns()
,
and the same number of columns as B
public Vector solve(Vector b, Vector x)
Matrix
x = A\b
. Not all matrices support this operation, those
that do not throw UnsupportedOperationException
. Note
that it is often more efficient to use a matrix decomposition and its
associated solversolve
in interface Matrix
solve
in class AbstractMatrix
b
- Vector of size A.numRows()
x
- Vector of size A.numColumns()
public Matrix transpose()
Matrix
transpose
in interface Matrix
transpose
in class AbstractMatrix
public Iterator<MatrixEntry> iterator()
iterator
in interface Iterable<MatrixEntry>
iterator
in class AbstractMatrix
Copyright © 2013. All Rights Reserved.