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

Matrix computations and polynomial root-finding with preprocessing

โœ Scribed by Victor Y. Pan; Guoliang Qian; Ai-Long Zheng; Zhao Chen

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
371 KB
Volume
434
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On splitting sets in block designs and f
On splitting sets in block designs and finding roots of polynomials
โœ P.C. Van Oorschot; S.A. Vanstone ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1006 KB

The general notion of t-splitting sets is introduced within the context of combinatorial block designs. A greatest lower bound on cardinality of such sets, and an upper bound on cardinality of the smallest such set in a given design are established. The abstraction of t-splitting sets is shown to pr

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