class Fac_LU[MatT <: MatriD] extends Factorization with Error
The Fac_LU class provides methods to factor an 'm-by-n' matrix into its
lower and upper triangular products:
A = LU when partial pivoting is not needed PA = LU where P is the permutation matrix A = QLU where Q = P.inverse
where 'a' is the given matrix, 'l' is an 'm-by-n' lower triangular matrix, and 'u' is an 'n-by-n' upper triangular matrix. The permutation matrix is represented by the 'piv' vector. Once factored, can be used to solve a system of linear equations.
Solve for x in Ax = b: Ax = QLUx = b => LUx = Pb using steps (1) and (2) (1) Solve Ly = Pb using forward substitution for y (2) Solve Ux = y using backward substitution for x
- Alphabetic
- By Inheritance
- Fac_LU
- Error
- Factorization
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
Fac_LU(a: MatT)
- a
the given m-by-n rectangular matrix
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
bsolve(y: VectoD): VectorD
Solve for 'x' using back substitution in the equation 'u*x = y' where matrix 'u' is upper triangular.
Solve for 'x' using back substitution in the equation 'u*x = y' where matrix 'u' is upper triangular.
- y
the constant vector
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
det: Double
Compute the determinant of matrix 'a'.
Compute the determinant of matrix 'a'. The value of the determinant indicates, among other things, whether there is a unique solution to a system of linear equations (a nonzero determinant).
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
factor(): Fac_LU[MatT]
Factor matrix 'a' into the product of 'l' and 'u'.
Factor matrix 'a' into the product of 'l' and 'u'.
- Definition Classes
- Fac_LU → Factorization
-
def
factor1(): MatriD
Factor a matrix into the product of two matrices, e.g., 'a = l * l.t', returning only the first matrix.
Factor a matrix into the product of two matrices, e.g., 'a = l * l.t', returning only the first matrix.
- Definition Classes
- Factorization
-
def
factor12(): (MatriD, MatriD)
Factor a matrix into the product of two matrices, e.g., 'a = l * l.t' or a = q * r, returning both the first and second matrices.
Factor a matrix into the product of two matrices, e.g., 'a = l * l.t' or a = q * r, returning both the first and second matrices.
- Definition Classes
- Factorization
-
def
factor2(): MatriD
Factor a matrix into the product of two matrices, e.g., 'a = l * l.t', returning only the second matrix.
Factor a matrix into the product of two matrices, e.g., 'a = l * l.t', returning only the second matrix.
- Definition Classes
- Factorization
-
val
factored: Boolean
Flag indicating whether the matrix has been factored
Flag indicating whether the matrix has been factored
- Attributes
- protected
- Definition Classes
- Factorization
-
def
factors: (MatriD, MatriD)
Return the 'l' and 'u' matrices.
Return the 'l' and 'u' matrices.
- Definition Classes
- Fac_LU → Factorization
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
flaw(method: String, message: String): Unit
Show the flaw by printing the error message.
Show the flaw by printing the error message.
- method
the method where the error occurred
- message
the error message
- Definition Classes
- Error
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
inverse: MatriD
Compute the inverse of matrix 'a' from the LU Factorization.
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
permute(d: VectoD): VectoD
Permute vector 'd', equivalent to 'pd', i.e., multiplying by the permutation matrix 'p'.
Permute vector 'd', equivalent to 'pd', i.e., multiplying by the permutation matrix 'p'.
- d
the vector to permute
-
def
permute(c: MatriD): Unit
Permute matrix 'c', equivalent to 'qc', i.e., multiplying by the inverse of the permutation matrix 'p'.
Permute matrix 'c', equivalent to 'qc', i.e., multiplying by the inverse of the permutation matrix 'p'.
- c
the matrix to permute
-
def
rank: Int
Return the rank (number of independent columns) of 'm-by-n' matrix 'a', by counting the number of non-zero diagonal elements in 'u'.
Return the rank (number of independent columns) of 'm-by-n' matrix 'a', by counting the number of non-zero diagonal elements in 'u'. If 'rank < n', then 'a' is singular.
- See also
Fac_QR_RRorSVDen.wikipedia.org/wiki/Rank_%28linear_algebra%29
-
def
solve(b: VectoD): VectoD
Solve for 'x' in the equation 'l*u*x = b' via 'l*y = b' and 'u*x = y'.
Solve for 'x' in the equation 'l*u*x = b' via 'l*y = b' and 'u*x = y'. Return the solution vector 'x'.
- b
the constant vector
- Definition Classes
- Fac_LU → Factorization
-
def
split(): Unit
Split 'l' into lower and upper triangular matrices by placing the upper portion in 'u' and clearing, so 'l' is properly lower triangular.
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )