sturmseq Namespace Reference

Functions
template<class C, class UPoly, class SEQ>
void	init (STD mthd, SturmSeq< C, UPoly, SEQ > &tab, const UPoly &a, const UPoly &b)
template<class C, class UPoly, class SEQ>
void	init (EUCLIDEAN mth, SturmSeq< C, UPoly, SEQ > &tab, const UPoly &a, const UPoly &b)
template<class C, class UPoly, class SEQ>
void	init (REDUCED mth, SturmSeq< C, UPoly, SEQ > &tab, const UPoly &a, const UPoly &b)
template<class C, class UPoly, class SEQ>
void	init (SUBRES, SturmSeq< C, UPoly, SEQ > &tab, const UPoly &a, const UPoly &b)
template<class C, class Pol, class TAB_TYPE>
void	init (HABICHT mth, SturmSeq< C, Pol, TAB_TYPE > &tab, const Pol &a, const Pol &b)

---

Function Documentation

template<class C, class Pol, class TAB_TYPE>

void sturmseq::init	(	HABICHT	mth,
		SturmSeq< C, Pol, TAB_TYPE > &	tab,
		const Pol &	a,
		const Pol &	b
	)

Construct a Sturm-Habicht sequence of a and b, using Lalo algorithm.

Definition at line 245 of file SturmSeq.h.

References degree(), Prem(), and SturmSeq< C, UPoly, SEQ >::resize().

Referenced by MATRIX::init(), MatrDse< Seq< OCTREE::NODE_TYPE > >::MatrDse(), MATRIX::mul(), and Rg< T >::Rg().

template<class C, class UPoly, class SEQ>

void sturmseq::init	(	SUBRES	,
		SturmSeq< C, UPoly, SEQ > &	tab,
		const UPoly &	a,
		const UPoly &	b
	)

Construct a Sturm sequence of a and b, using the optimized Subresultant algorithm from Collins and Brown.

Definition at line 188 of file SturmSeq.h.

References EUCLIDIAN::prem(), SturmSeq< C, UPoly, SEQ >::resize(), and SturmSeq< C, UPoly, SEQ >::size().

template<class C, class UPoly, class SEQ>

void sturmseq::init	(	REDUCED	mth,
		SturmSeq< C, UPoly, SEQ > &	tab,
		const UPoly &	a,
		const UPoly &	b
	)

Construct a Sturm sequence of a and b, using the reduced algorithm from Collins and Brown.

Definition at line 152 of file SturmSeq.h.

References EUCLIDIAN::prem().

template<class C, class UPoly, class SEQ>

void sturmseq::init	(	EUCLIDEAN	mth,
		SturmSeq< C, UPoly, SEQ > &	tab,
		const UPoly &	a,
		const UPoly &	b
	)

Construct the Sturm sequence of two polynomials a and b, using pseudo-remainders. We have exponential growth of the coefficients.

Definition at line 131 of file SturmSeq.h.

References degree(), EUCLIDIAN::prem(), and SturmSeq< C, UPoly, SEQ >::resize().

template<class C, class UPoly, class SEQ>

void sturmseq::init	(	STD	mthd,
		SturmSeq< C, UPoly, SEQ > &	tab,
		const UPoly &	a,
		const UPoly &	b
	)

Construct the Sturm sequence of two polynomials a and b, using the standard method. Works only for rational number types.

Definition at line 109 of file SturmSeq.h.

References isNull(), SturmSeq< C, UPoly, SEQ >::resize(), and SturmSeq< C, UPoly, SEQ >::size().

Referenced by SturmSeq< NT >::SturmSeq().