Class "spam.chol.NgPeyton"

Description

Result of a Cholesky decomposition with the NgPeyton method

Objects from the Class

Objects are created by calls of the form chol(x,method="NgPeyton", ...) and should not be created directly with a new("spam.chol.NgPeyton", ...) call.
At present, no proper print method is defined. However, the factor can be transformed into a spam object.

Methods

as.spam

signature(x = "spam"): Transform the factor into a spam object

length

signature(x = "spam"): ...

backsolve

signature(r = "spam.chol.NgPeyton"): solving a triangular system, see solve.

forwardsolve

signature(l = "spam.chol.NgPeyton"): solving a triangular system, see solve.

dim

signature(x = "spam"): Retrieve the dimension. Note that "dim<-" is not implemented.

length

signature(x = "spam"): Retrieve the dimension. Note that "dim<-" is not implemented.

c

signature(x = "spam"): Coerce the factor into a vector .

Author(s)

Reinhard Furrer

References

Ng, E. G. and B. W. Peyton (1993), "Block sparse Cholesky algorithms on advanced uniprocessor computers", SIAM J. Sci. Comput., 14, pp. 1034-1056.

See Also

print.spam ordering and chol

Examples

x <- spam( c(4,3,0,3,5,1,0,1,4),3)
cf <- chol( x)
cf
as.spam( cf)

# Modify at own risk...
slotNames(cf)