- We will send in 10–14 business days.
/images/books/13187955/9783639387551.jpg)
- Author: Erbert Normen Tobias
- Publisher: AV Akademikerverlag
- Year: 2012
- Pages: 144
- ISBN-10: 3639387554
- ISBN-13: 9783639387551
- Format: 15.2 x 22.9 x 0.9 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
Systems of polynomial equations play an important role in many scientific applications. But it is often rather complex and time-consuming to find all -real and complex- solutions. This book describes an efficient algorithm, which uses eigenvalues to compute all solutions of a given system of polynomial equations. For this, the theory of Gröbner bases is combined with numerical linear algebra. Also, a comparison to the performance of existing algorithms is given. Furthermore, a new algorithm to compute the primary decomposition of a zero-dimensional ideal and an algorithm to compute the number of real respectively complex roots of a system of polynomial equations using the quadratic form is delineated. All described algorithms are implemented in the computer algebra system SINGULAR.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.12:45:04
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Erbert Normen Tobias
- Publisher: AV Akademikerverlag
- Year: 2012
- Pages: 144
- ISBN-10: 3639387554
- ISBN-13: 9783639387551
- Format: 15.2 x 22.9 x 0.9 cm, minkšti viršeliai
- Language: English English
Systems of polynomial equations play an important role in many scientific applications. But it is often rather complex and time-consuming to find all -real and complex- solutions. This book describes an efficient algorithm, which uses eigenvalues to compute all solutions of a given system of polynomial equations. For this, the theory of Gröbner bases is combined with numerical linear algebra. Also, a comparison to the performance of existing algorithms is given. Furthermore, a new algorithm to compute the primary decomposition of a zero-dimensional ideal and an algorithm to compute the number of real respectively complex roots of a system of polynomial equations using the quadratic form is delineated. All described algorithms are implemented in the computer algebra system SINGULAR.
Reviews