Andere Kunden interessierten sich auch für
![Polynomielles Chaos in der Optionsbewertung]( "Polynomielles Chaos in der Optionsbewertung")
Polynomielles Chaos in der Optionsbewertung32,95 €![New Results in Numerical and Experimental Fluid Mechanics II]( "New Results in Numerical and Experimental Fluid Mechanics II")
New Results in Numerical and Experimental Fluid Mechanics II37,99 €![Leitfaden der Interpolation]( "Leitfaden der Interpolation")
Leitfaden der Interpolation54,99 €![Vorkonditionierer für Toeplitzsysteme]( "Vorkonditionierer für Toeplitzsysteme")
Vorkonditionierer für Toeplitzsysteme49,00 €![Charakterisierung der symmetrischen Lösungsmenge]( "Charakterisierung der symmetrischen Lösungsmenge")
Charakterisierung der symmetrischen Lösungsmenge49,00 €![On Partitioned Simulation of Electrical Circuits]( "On Partitioned Simulation of Electrical Circuits")
On Partitioned Simulation of Electrical Circuits51,99 €![Finite Elemente Methoden mit Anwendung auf Probleme der Chemotaxis]( "Finite Elemente Methoden mit Anwendung auf Probleme der Chemotaxis")
Finite Elemente Methoden mit Anwendung auf Probleme der Chemotaxis49,00 €
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.