Extended Euclidean algorithm

Gcd of polynomials in matlab

The following Matlab project contains the source code and Matlab examples used for gcd of polynomials. In the longhand polynomial division given as       P(k) = P(k-2) - P(k-1)*Q(k) The quotient Q(k) and the remainder P(k) are obtained from dividing the dividend P(k-2) by the divisor P(k-1).

Extended euclidean algorithm in matlab

The following Matlab project contains the source code and Matlab examples used for extended euclidean algorithm. -------------------------------------- main executing reference usage: usage_extendedEuclidean.m Please also find simplified example in the folder [documents]. Caveat: For reference purposes. If the utility have more optimal approach, please do not hesitate to suggest and send feedbacks to author. Email: promethevx@yahoo.com. Thank you. Regards, Michael Chan JT
Subscribe to RSS - Extended Euclidean algorithm