$treeview $search $mathjax
Eigen
3.2.5
$projectbrief
|
$projectbrief
|
$searchbox |
Pseudo expression to manipulate a triangular sparse matrix as a selfadjoint matrix. More...
Public Member Functions | |
Index | cols () const |
const SparseSelfAdjointView < MatrixType, UpLo > & | derived () const |
SparseSelfAdjointView < MatrixType, UpLo > & | derived () |
template<typename OtherDerived > | |
SparseSelfAdjointTimeDenseProduct < MatrixType, OtherDerived, UpLo > | operator* (const MatrixBase< OtherDerived > &rhs) const |
template<typename OtherDerived > | |
SparseSparseProduct< typename OtherDerived::PlainObject, OtherDerived > | operator* (const SparseMatrixBase< OtherDerived > &rhs) const |
template<typename DerivedU > | |
SparseSelfAdjointView & | rankUpdate (const SparseMatrixBase< DerivedU > &u, const Scalar &alpha=Scalar(1)) |
Index | rows () const |
Index | size () const |
SparseSymmetricPermutationProduct < _MatrixTypeNested, UpLo > | twistedBy (const PermutationMatrix< Dynamic, Dynamic, Index > &perm) const |
Friends | |
template<typename OtherDerived > | |
DenseTimeSparseSelfAdjointProduct < OtherDerived, MatrixType, UpLo > | operator* (const MatrixBase< OtherDerived > &lhs, const SparseSelfAdjointView &rhs) |
template<typename OtherDerived > | |
SparseSparseProduct < OtherDerived, typename OtherDerived::PlainObject > | operator* (const SparseMatrixBase< 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.
Index cols | ( | void | ) | const [inline] |
Reimplemented from EigenBase< SparseSelfAdjointView< MatrixType, UpLo > >.
const SparseSelfAdjointView< MatrixType, UpLo > & derived | ( | ) | const [inline, inherited] |
SparseSelfAdjointView< MatrixType, UpLo > & derived | ( | ) | [inline, inherited] |
SparseSelfAdjointTimeDenseProduct<MatrixType,OtherDerived,UpLo> operator* | ( | const MatrixBase< OtherDerived > & | rhs | ) | const [inline] |
Efficient sparse self-adjoint matrix times dense vector/matrix product
SparseSparseProduct<typename OtherDerived::PlainObject, OtherDerived> operator* | ( | const SparseMatrixBase< OtherDerived > & | rhs | ) | const [inline] |
*this
and a sparse matrix rhs.Note that there is no algorithmic advantage of performing such a product compared to a general sparse-sparse matrix product. Indeed, the SparseSelfadjointView operand is first copied into a temporary SparseMatrix before computing the product.
References EigenBase< Derived >::derived().
SparseSelfAdjointView< MatrixType, UpLo > & rankUpdate | ( | const SparseMatrixBase< DerivedU > & | u, | |
const Scalar & | alpha = Scalar(1) | |||
) | [inline] |
Perform a symmetric rank K update of the selfadjoint matrix *this
: where u is a vector or matrix.
*this
To perform you can simply call this function with u.adjoint().
Index rows | ( | void | ) | const [inline] |
Reimplemented from EigenBase< SparseSelfAdjointView< MatrixType, UpLo > >.
Index size | ( | ) | const [inline, inherited] |
SparseSymmetricPermutationProduct<_MatrixTypeNested,UpLo> twistedBy | ( | const PermutationMatrix< Dynamic, Dynamic, Index > & | perm | ) | const [inline] |
DenseTimeSparseSelfAdjointProduct<OtherDerived,MatrixType,UpLo> operator* | ( | const MatrixBase< OtherDerived > & | lhs, | |
const SparseSelfAdjointView< MatrixType, UpLo > & | rhs | |||
) | [friend] |
Efficient dense vector/matrix times sparse self-adjoint matrix product
SparseSparseProduct<OtherDerived, typename OtherDerived::PlainObject > operator* | ( | const SparseMatrixBase< OtherDerived > & | lhs, | |
const SparseSelfAdjointView< MatrixType, UpLo > & | rhs | |||
) | [friend] |
Note that there is no algorithmic advantage of performing such a product compared to a general sparse-sparse matrix product. Indeed, the SparseSelfadjointView operand is first copied into a temporary SparseMatrix before computing the product.