Pseudo expression to manipulate a triangular sparse matrix as a selfadjoint matrix.
More...
|
Index | cols () const |
|
template<typename DestScalar , int StorageOrder> |
void | evalTo (SparseMatrix< DestScalar, StorageOrder, Index > &_dest) const |
|
template<typename DestScalar > |
void | evalTo (DynamicSparseMatrix< DestScalar, ColMajor, Index > &_dest) const |
|
const _MatrixTypeNested & | matrix () const |
|
_MatrixTypeNested & | matrix () |
|
template<typename OtherDerived > |
SparseSparseProduct< typename OtherDerived::PlainObject, OtherDerived > | operator* (const SparseMatrixBase< OtherDerived > &rhs) const |
|
template<typename OtherDerived > |
SparseSelfAdjointTimeDenseProduct< MatrixType, OtherDerived, UpLo > | operator* (const MatrixBase< OtherDerived > &rhs) const |
|
template<typename SrcMatrixType , int SrcUpLo> |
SparseSelfAdjointView & | operator= (const SparseSymmetricPermutationProduct< SrcMatrixType, SrcUpLo > &permutedMatrix) |
|
SparseSelfAdjointView & | operator= (const SparseSelfAdjointView &src) |
|
template<typename SrcMatrixType , unsigned int SrcUpLo> |
SparseSelfAdjointView & | operator= (const SparseSelfAdjointView< SrcMatrixType, SrcUpLo > &src) |
|
template<typename DerivedU > |
SparseSelfAdjointView & | rankUpdate (const SparseMatrixBase< DerivedU > &u, const Scalar &alpha=Scalar(1)) |
|
template<typename DerivedU > |
SparseSelfAdjointView< MatrixType, UpLo > & | rankUpdate (const SparseMatrixBase< DerivedU > &u, const Scalar &alpha) |
|
Index | rows () const |
|
| SparseSelfAdjointView (const MatrixType &matrix) |
|
SparseSymmetricPermutationProduct< _MatrixTypeNested, UpLo > | twistedBy (const PermutationMatrix< Dynamic, Dynamic, Index > &perm) const |
|
void | addTo (Dest &dst) const |
|
void | applyThisOnTheLeft (Dest &dst) const |
|
void | applyThisOnTheRight (Dest &dst) const |
|
Index | cols () const |
|
SparseSelfAdjointView< MatrixType, UpLo > & | const_cast_derived () const |
|
const SparseSelfAdjointView< MatrixType, UpLo > & | const_derived () const |
|
SparseSelfAdjointView< MatrixType, UpLo > & | derived () |
|
const SparseSelfAdjointView< MatrixType, UpLo > & | derived () const |
|
void | evalTo (Dest &dst) const |
|
Index | rows () const |
|
Index | size () const |
|
void | subTo (Dest &dst) const |
|
template<typename MatrixType, unsigned int UpLo>
class Eigen::SparseSelfAdjointView< MatrixType, UpLo >
Pseudo expression to manipulate a triangular sparse matrix as a selfadjoint matrix.
- Parameters
-
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.
- See also
- SparseMatrixBase::selfadjointView()
Definition at line 49 of file SparseSelfAdjointView.h.
template<typename MatrixType, unsigned int UpLo>
template<typename OtherDerived >
- Returns
- an expression of the matrix product between a sparse self-adjoint matrix
*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.
Definition at line 79 of file SparseSelfAdjointView.h.
template<typename MatrixType, unsigned int UpLo>
template<typename OtherDerived >
- Returns
- an expression of the matrix product between a sparse matrix lhs and a sparse self-adjoint 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.
Definition at line 91 of file SparseSelfAdjointView.h.