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

On reduced polynomial-based split algorithms

โœ Scribed by Hari Krishna

Book ID
112494741
Publisher
Springer
Year
1991
Tongue
English
Weight
846 KB
Volume
10
Category
Article
ISSN
0278-081X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On frequency-based menu-splitting algori
On frequency-based menu-splitting algorithms
โœ Ian H. Witten; John G. Cleary; Saul Greenberg ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science โš– 672 KB

If a menu-driven display is to be device-independent, the storage of information must be separated from its presentation by creating menus dynamically. As a first step, this article evaluates menu-construction algorithms for ordered directories whose access profile is specified. The algorithms are e

A fast and stable algorithm for splittin
A fast and stable algorithm for splitting polynomials
โœ G. Malajovich; J.P. Zubelli ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 928 KB

This paper concerns the fast numerical factorization of degree a + b polynomials in a neighborhood of the polynomial x a. We want to obtain the so-called splitting of one such polynomial, i.e., a degree a factor with roots close to zero and a degree b factor with roots close to infinity. An importan