a class to manipulate the L supernodal factor from the SparseLU factorization More...

#include <SparseLU_SupernodalMatrix.h>

Classes
class	InnerIterator
	InnerIterator class to iterate over nonzero values of the current column in the supernodal matrix L. More...

Public Types
typedef _Scalar	Scalar

typedef _StorageIndex	StorageIndex

typedef Matrix< StorageIndex, Dynamic, 1 >	IndexVector

typedef Matrix< Scalar, Dynamic, 1 >	ScalarVector

Public Member Functions
	MappedSuperNodalMatrix (Index m, Index n, ScalarVector &nzval, IndexVector &nzval_colptr, IndexVector &rowind, IndexVector &rowind_colptr, IndexVector &col_to_sup, IndexVector &sup_to_col)

void	setInfos (Index m, Index n, ScalarVector &nzval, IndexVector &nzval_colptr, IndexVector &rowind, IndexVector &rowind_colptr, IndexVector &col_to_sup, IndexVector &sup_to_col)
	Set appropriate pointers for the lower triangular supernodal matrix These infos are available at the end of the numerical factorization FIXME This class will be modified such that it can be use in the course of the factorization.

Index	rows ()
	Number of rows.

Index	cols ()
	Number of columns.

Scalar *	valuePtr ()
	Return the array of nonzero values packed by column. More...

const Scalar *	valuePtr () const

StorageIndex *	colIndexPtr ()
	Return the pointers to the beginning of each column in valuePtr()

const StorageIndex *	colIndexPtr () const

StorageIndex *	rowIndex ()
	Return the array of compressed row indices of all supernodes.

const StorageIndex *	rowIndex () const

StorageIndex *	rowIndexPtr ()
	Return the location in rowvaluePtr() which starts each column.

const StorageIndex *	rowIndexPtr () const

StorageIndex *	colToSup ()
	Return the array of column-to-supernode mapping.

const StorageIndex *	colToSup () const

StorageIndex *	supToCol ()
	Return the array of supernode-to-column mapping.

const StorageIndex *	supToCol () const

Index	nsuper () const
	Return the number of supernodes.

template<typename Dest >
void	solveInPlace (MatrixBase< Dest > &X) const
	Solve with the supernode triangular matrix. More...

Protected Attributes
Index	m_row

Index	m_col

Index	m_nsuper

Scalar *	m_nzval

StorageIndex *	m_nzval_colptr

StorageIndex *	m_rowind

StorageIndex *	m_rowind_colptr

StorageIndex *	m_col_to_sup

StorageIndex *	m_sup_to_col

Detailed Description

template<typename _Scalar, typename _StorageIndex>
class Eigen::internal::MappedSuperNodalMatrix< _Scalar, _StorageIndex >

a class to manipulate the L supernodal factor from the SparseLU factorization

This class contain the data to easily store and manipulate the supernodes during the factorization and solution phase of Sparse LU. Only the lower triangular matrix has supernodes.

NOTE : This class corresponds to the SCformat structure in SuperLU

Member Function Documentation

§ solveInPlace()

template<typename Scalar , typename Index_ >

template<typename Dest >

void Eigen::internal::MappedSuperNodalMatrix< Scalar, Index_ >::solveInPlace ( MatrixBase< Dest > & X ) const

Solve with the supernode triangular matrix.

§ valuePtr()

template<typename _Scalar, typename _StorageIndex>

Scalar* Eigen::internal::MappedSuperNodalMatrix< _Scalar, _StorageIndex >::valuePtr ( )

inline

Return the array of nonzero values packed by column.

The size is nnz

The documentation for this class was generated from the following file:

third-party-libs/eigen3/Eigen/src/SparseLU/SparseLU_SupernodalMatrix.h

Classes

Public Types

Public Member Functions

Protected Attributes

Detailed Description

template<typename _Scalar, typename _StorageIndex> class Eigen::internal::MappedSuperNodalMatrix< _Scalar, _StorageIndex >

Member Function Documentation

§ solveInPlace()

§ valuePtr()

template<typename _Scalar, typename _StorageIndex>
class Eigen::internal::MappedSuperNodalMatrix< _Scalar, _StorageIndex >