๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Polynomial factorization and the Q-D algorithm

โœ Scribed by L. Fox; Linda Hayes

Publisher
Elsevier Science
Year
1968
Tongue
English
Weight
924 KB
Volume
1
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Gauss-Huard algorithm and LU factori
The Gauss-Huard algorithm and LU factorization
โœ Walter Hoffmann ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 341 KB

In this paper we analyze the Gauss-Huard algorithm. From a description of the algorithm in terms of matrix-vector operations we reveal a close relation between the Gauss-Huard algorithm and an LU factorization as constructed in an ikj variant.

Univariate Polynomials: Nearly Optimal A
Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding
โœ Victor Y. Pan ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 552 KB

To approximate all roots (zeros) of a univariate polynomial, we develop two effective algorithms and combine them in a single recursive process. One algorithm computes a basic well isolated zero-free annulus on the complex plane, whereas another algorithm numerically splits the input polynomial of t

Factoring Polynomials and the Knapsack P
Factoring Polynomials and the Knapsack Problem
โœ Mark van Hoeij ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 222 KB

For several decades the standard algorithm for factoring polynomials f with rational coefficients has been the Berlekamp-Zassenhaus algorithm. The complexity of this algorithm depends exponentially on n, where n is the number of modular factors of f . This exponential time complexity is due to a com