Pseudo expression to manipulate a triangular sparse matrix as a selfadjoint matrix. More...
Public Member Functions | |
Index | cols () const |
template<typename OtherDerived > | |
SparseSelfAdjointTimeDenseProduct < MatrixType, OtherDerived, UpLo > | operator* (const MatrixBase< OtherDerived > &rhs) const |
template<typename DerivedU > | |
SparseSelfAdjointView & | rankUpdate (const SparseMatrixBase< DerivedU > &u, Scalar alpha=Scalar(1)) |
Index | rows () const |
SparseSymmetricPermutationProduct < _MatrixTypeNested, UpLo > | twistedBy (const PermutationMatrix< Dynamic > &perm) const |
Friends | |
template<typename OtherDerived > | |
DenseTimeSparseSelfAdjointProduct < OtherDerived, MatrixType, UpLo > | operator* (const MatrixBase< OtherDerived > &lhs, const SparseSelfAdjointView &rhs) |
Pseudo expression to manipulate a triangular sparse matrix as a selfadjoint matrix.
MatrixType | the type of the dense matrix storing the coefficients |
UpLo | can be either Lower or Upper |
This class is an expression of a sefladjoint matrix from a triangular part of a matrix with given dense storage of the coefficients. It is the return type of MatrixBase::selfadjointView() and most of the time this is the only way that it is used.
|
inline |
Reimplemented from EigenBase< SparseSelfAdjointView< MatrixType, UpLo > >.
|
inline |
Efficient sparse self-adjoint matrix times dense vector/matrix product
SparseSelfAdjointView< MatrixType, UpLo > & rankUpdate | ( | const SparseMatrixBase< DerivedU > & | u, |
Scalar | alpha = Scalar(1) |
||
) |
Perform a symmetric rank K update of the selfadjoint matrix \c *this:
where u is a vector or matrix.
\returns a reference to \c *this Note that it is faster to set alpha=0 than initializing the matrix to zero and then keep the default value alpha=1. To perform \form#36 you can simply call this function with u.adjoint().
|
inline |
Reimplemented from EigenBase< SparseSelfAdjointView< MatrixType, UpLo > >.
|
inline |
|
friend |
Efficient dense vector/matrix times sparse self-adjoint matrix product