denseLU is the class of dense, row-pivoted LU factorizations of m−by−n real matrices A, having the general form [REMOVE_ME]P1A=LUP1∗A=L∗U[REMOVEME2]
or (equivalently) [REMOVE_ME]A=P1′LUA=P1′∗L∗U[REMOVEME2]
where P1 is an m−by−m permutation matrix, L is an m−by−min(m,n)
unit lower trapezoidal matrix, and U is a min(m,n)−by−n
upper trapezoidal matrix. If m=n, then the factors L and U are triangular.
class
Description
denseLU is the class of dense, row-pivoted LU factorizations of m−by−n real matrices A, having the general form
P1A=LUP1∗A=L∗U
or (equivalently)
A=P1′LUA=P1′∗L∗U
where P1 is an m−by−m permutation matrix, L is an m−by−min(m,n)
unit lower trapezoidal matrix, and U is a min(m,n)−by−n
upper trapezoidal matrix. If m=n, then the factors L and U are triangular.
Slots
Dim, Dimnames: inherited from virtual class MatrixFactorization.
x: a numeric vector of length prod(Dim) storing the triangular L and U factors together in a packed format. The details of the representation are specified by the manual for LAPACK routine dgetrf.
perm: an integer vector of length min(Dim)
specifying the permutation $P1$ as a product of transpositions. The corresponding permutation vector can be obtained as `asPerm(perm)`.
Extends
Class LU, directly. Class MatrixFactorization, by class LU, distance 2.
Instantiation
Objects can be generated directly by calls of the form new("denseLU", ...), but they are more typically obtained as the value of lu(x) for x inheriting from denseMatrix (often dgeMatrix).
Methods
coerce: signature(from = "denseLU", to = "dgeMatrix"): returns a dgeMatrix with the dimensions of the factorized matrix A, equal to L below the diagonal and equal to U on and above the diagonal.
determinant: signature(from = "denseLU", logarithm = "logical"): computes the determinant of the factorized matrix A
or its logarithm.
expand: signature(x = "denseLU"): see expand-methods.
expand1: signature(x = "denseLU"): see expand1-methods.
expand2: signature(x = "denseLU"): see expand2-methods.
solve: signature(a = "denseLU", b = "missing"): see solve-methods.