Aleph::Gen_Polynomial< Coefficient >::Xgcd_Result Struct Reference

Extended GCD: computes g, s, t such that \(sa + tb = g\). More...

#include <tpl_polynomial.H>

Collaboration diagram for Aleph::Gen_Polynomial< Coefficient >::Xgcd_Result:

Public Attributes
Gen_Polynomial	g
	Greatest common divisor (monic).
Gen_Polynomial	s
	Bezout coefficient for the first argument.
Gen_Polynomial	t
	Bezout coefficient for the second argument.

Detailed Description

template<typename Coefficient = double>
struct Aleph::Gen_Polynomial< Coefficient >::Xgcd_Result

Extended GCD: computes g, s, t such that \(sa + tb = g\).

Uses the extended Euclidean algorithm. The result g is made monic.

Parameters

[in]	a	First polynomial.
[in]	b	Second polynomial.

Returns

Tuple (g, s, t) with \(sa + tb = \gcd(a, b)\).

Result of the extended GCD algorithm.

Definition at line 1177 of file tpl_polynomial.H.

Member Data Documentation

g

template<typename Coefficient = double>

Gen_Polynomial Aleph::Gen_Polynomial< Coefficient >::Xgcd_Result::g

Greatest common divisor (monic).

Definition at line 1179 of file tpl_polynomial.H.

s

template<typename Coefficient = double>

Gen_Polynomial Aleph::Gen_Polynomial< Coefficient >::Xgcd_Result::s

Bezout coefficient for the first argument.

Definition at line 1180 of file tpl_polynomial.H.

t

template<typename Coefficient = double>

Gen_Polynomial Aleph::Gen_Polynomial< Coefficient >::Xgcd_Result::t

Bezout coefficient for the second argument.

Definition at line 1181 of file tpl_polynomial.H.

---

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

• tpl_polynomial.H