This paper presents a general and comprehensive description of Optimization Methods, and Algorithms from a novel viewpoint. It is shown, in particular, that Direct Methods, Iterative Methods, and Computer Science Algorithms belong to a well-defined general class of both Finite and Infinite Procedures, characterized by suitable descent directions. [ABSTRACT FROM AUTHOR]
POLYNOMIALS, ALGORITHMS, MATHEMATICS, EUCLIDEAN algorithm, NUMBER theory
Abstract
A simple and efficient algorithm for finding the GCD of a pair of univariate polynomials is derived. The process requires only successive subtraction of two monic polynomials. Amazingly, this approach gives the desired GCD for a pair of test polynomials of very high degree, such as (x + 1)⋀ 1000 and its derivative. [ABSTRACT FROM AUTHOR]