Year: 2016
Type: preprint
Abstract: Starting with the recursive extended Euclid's algorithm, we apply a systematic approach using matrix notation to transform it into an iterative algorithm. The partial correctness proof derived from the transformation turns out to be very elegant, and easy to follow. The paper provides a connection between recursive and iterative versions of extended Euclid's algorithm.
Source: arXiv (Cornell University)
Author: Leung, Hing
Language: English
Subfield: Modeling and Simulation
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2467732993