A Fast and Numerically Stable Euclidean-like Algorithm for Detecting Relatively Prime Numerical Polynomials

ISSN： 0747-7171

Source： Journal of Symbolic Computation, Vol.26, Iss.6, 1998-12, pp. : 691-714

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

When are Two Numerical Polynomials Relatively Prime?

By Beckermann B. Labahn G.

Journal of Symbolic Computation, Vol. 26, Iss. 6, 1998-12 ,pp. : 677-689

Academic Press

Access to resources Recommend Favorite

Fast RLS-Like Algorithm for Generalized Eigendecomposition and its Applications

Journal of VLSI Signal Processing, Vol. 37, Iss. 2-3, 2004-06 ,pp. : 333-344

Springer Publishing Company

Access to resources Recommend Favorite

Partial Evaluation of the Euclidean Algorithm, Revisited

By Lee C.S.

LISP and Symbolic Computation, Vol. 12, Iss. 2, 1999-09 ,pp. : 203-212

Springer Publishing Company

Access to resources Recommend Favorite

A Parallel Euclidean Distance Transformation Algorithm

By Embrechts H. Roose D.

Computer Vision and Image Understanding, Vol. 63, Iss. 1, 1996-01 ,pp. : 15-26

Academic Press

Access to resources Recommend Favorite

Multi-population co-genetic algorithm with double chain-like agents structure for parallel global numerical optimization

By Li Yongming Zeng Xiaoping

Applied Intelligence, Vol. 32, Iss. 3, 2010-06 ,pp. : 292-310

Springer Publishing Company

Access to resources Recommend Favorite