This defines the sparsity pattern, or graph, of a sparse matrix. 更多...

类
class	Graph

class	NonlocalGraph

class	AugmentSparsityPattern
	Abstract base class to be used to add user-defined implicit degree of freedom couplings. 更多...

class	Build
	This helper class can be called on multiple threads to compute the sparsity pattern (or graph) of the sparse matrix resulting from the discretization. 更多...

类型定义
typedef std::vector < dof_id_type, Threads::scalable_allocator < dof_id_type > >	Row

函数
void	_dummy_function (void)

template<typename BidirectionalIterator >
static void	sort_row (const BidirectionalIterator begin, BidirectionalIterator middle, const BidirectionalIterator end)
	Splices the two sorted ranges [begin,middle) and [middle,end) into one sorted range [begin,end). 更多...

详细描述

This defines the sparsity pattern, or graph, of a sparse matrix.

The format is quite simple – the global indices of the nonzero entries in each row are packed into a vector. The global indices (i,j) of the nth nonzero entry of row i are given by j = sparsity_pattern[i][n];

作者: Roy Stogner

日期: 2010 Defines the sparsity pattern of a sparse matrix.

类型定义说明

typedef std::vector<dof_id_type, Threads::scalable_allocator<dof_id_type> > libMesh::SparsityPattern::Row

在文件 sparsity_pattern.h 第 51 行定义.

函数说明

void libMesh::SparsityPattern::_dummy_function ( void )

在文件 sparsity_pattern.C 第 86 行定义.

86 {}

template<typename BidirectionalIterator >

static void libMesh::SparsityPattern::sort_row	(	const BidirectionalIterator	begin,
		BidirectionalIterator	middle,
		const BidirectionalIterator	end
	)

static

Splices the two sorted ranges [begin,middle) and [middle,end) into one sorted range [begin,end).

This method is much like std::inplace_merge except it assumes the intersection of the two sorted ranges is empty and that any element in each range occurs only once in that range. Additionally, this sort occurs in-place, while std::inplace_merge may use a temporary buffer.

参考自 libMesh::SparsityPattern::Build::handle_vi_vj().