✦ LIBER ✦

Library representation of numbers and polynomials in a system of computer algebra

✍ Scribed by O. Ya. Grinchishin; K. N. Yaremus

Book ID: 110611612
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 681 KB
Volume: 34
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf02667161

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algebraic computation of the number of z

Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation

✍ B. Gleyse; A. Larabi; M. Moflih 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 224 KB

We present a general method for the exact computation of the number of zeros of a complex polynomial inside the unit disk, assuming that the polynomial does not vanish on the unit circle. We prove the existence of a polynomial sequence. This sequence involves a reduced number of arithmetic operation

Hall Polynomials and Composition Algebra

Hall Polynomials and Composition Algebra of Representation Finite Algebras

✍ A. R. Nasr-Isfahani 📂 Article 📅 2013 🏛 Springer Netherlands 🌐 English ⚖ 316 KB

On the computation of Kazhdan-Lusztig po

On the computation of Kazhdan-Lusztig polynomials and representations of Hecke algebras

✍ Jens Rosenboom 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 892 KB

Algebra of Polynomials in Several Variab

Algebra of Polynomials in Several Variables for a Digital Computer

✍ Williams, Leland H. 📂 Article 📅 1962 🏛 Association for Computing Machinery 🌐 English ⚖ 823 KB

Polynomials with small discriminants and

Polynomials with small discriminants and regular systems of real algebraic numbers

✍ V. I. Bernik; O. S. Kukso 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 363 KB

Numerical computation of the number of z

Numerical computation of the number of zeros of real polynomials in the open unit disk using a Chebyshev polynomials representation

✍ B. Gleyse; A. Larabi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 195 KB

We present a general and efficient numerical method with low computational complexity for computing the number of zeros of a real polynomial in the unit disk.