chaincon/homgvf3.h File Reference

Homology gradient vector field computation: Algorithm 3, using the SNF. More...

#include <istream>
#include <ostream>
#include "chomp/system/config.h"
#include "chomp/system/timeused.h"
#include "chomp/system/textfile.h"
#include "chomp/struct/hashsets.h"
#include "chomp/struct/multitab.h"
#include "chomp/struct/integer.h"
#include "chomp/homology/chains.h"
#include "chaincon/combchain.h"
#include "chaincon/comblinmap.h"

Go to the source code of this file.

Functions
bool	is_identity (const chomp::homology::mmatrix< chomp::homology::integer > &M)
	Verifies if the given mmatrix is an identity.
template<class CellT , class CellArray1 , class CellArray2 >
void	homologyGVF3 (const CellArray1 &K, CellArray2 &H, tCombLinMap< CellT, CellT > &pi, tCombLinMap< CellT, CellT > &incl, tCombLinMap< CellT, CellT > &phi)
	Computes the homology gradient vector field for the given filtered finite cell complex "K".

---

Detailed Description

Homology gradient vector field computation: Algorithm 3, using the SNF.

Definition in file homgvf3.h.

---

Function Documentation

template<class CellT , class CellArray1 , class CellArray2 >

void homologyGVF3	(	const CellArray1 &	K,
		CellArray2 &	H,
		tCombLinMap< CellT, CellT > &	pi,
		tCombLinMap< CellT, CellT > &	incl,
		tCombLinMap< CellT, CellT > &	phi
	)

Computes the homology gradient vector field for the given filtered finite cell complex "K".

Cells that represent homology generators are appended to the vector "H". The projection map "pi", the inclusion from "H" to the complex "K", and the homology gradient vector field "phi" are assumed to be initially zero and are constructed.

Definition at line 78 of file homgvf3.h.

References is_identity().

Referenced by homologyGVF().

bool is_identity

(

const chomp::homology::mmatrix< chomp::homology::integer > &

M )

[inline]

Verifies if the given mmatrix is an identity.

Definition at line 55 of file homgvf3.h.

Referenced by homologyGVF3().