. .
Français
France
Livres similaires
Autres livres qui pourraient ressembler au livre recherché:
Outils de recherche
s'inscrire

Connectez-vous avec Facebook:

S'inscrire
Mot de passe oublié?


Historique de recherche
Liste pense-bête
Liens vers eurolivre.fr

Partager ce livre sur…
Livre conseillé
Actualités
Conseils d'eurolivre.fr
Publicité
FILTRE
- 0 Résultats
prix le plus bas: 103,73 €, prix le plus élevé: 130,10 €, prix moyen: 109,17 €
Texts and Monographs in Symbolic Computation: Polynomial Algorithms in Computer Algebra
Livre non disponible
(*)

Texts and Monographs in Symbolic Computation: Polynomial Algorithms in Computer Algebra - Livres de poche

1996, ISBN: 9783211827598

[ED: Taschenbuch / Paperback], [PU: Springer, Wien], AUSFÜHRLICHERE BESCHREIBUNG: For several years now I have been teaching courses in computer algebra at the Universitat Linz, the University of Delaware, and the Universidad de Alcala de Henares. In the summers of 1990 and 1992 I have organized and taught summer schools in computer algebra at the Universitat Linz. Gradually a set of course notes has emerged from these activities. People have asked me for copies of the course notes, and different versions of them have been circulating for a few years. Finally I decided that I should really take the time to write the material up in a coherent way and make a book out of it. Here, now, is the result of this work. Over the years many students have been helpful in improving the quality of the notes, and also several colleagues at Linz and elsewhere have contributed to it. I want to thank them all for their effort, in particular I want to thank B. Buchberger, who taught me the theory of Grabner bases nearly two decades ago, B. F. Caviness and B. D. Saunders, who first stimulated my interest in various problems in computer algebra, G. E. Collins, who showed me how to compute in algebraic domains, and J. R. Sendra, with whom I started to apply computer algebra methods to problems in algebraic geometry. Several colleagues have suggested improvements in earlier versions of this book. However, I want to make it clear that I am responsible for all remaining mistakes. INHALT: 1 Introduction.- 1.1 What is computer algebra?.- 1.2 Program systems in computer algebra.- 1.3 Algebraic preliminaries.- 1.4 Representation of algebraic structures.- 1.5 Measuring the complexity of algorithms.- 1.6 Bibliographic notes.- 2 Arithmetic in basic domains.- 2.1 Integers.- 2.2 Polynomials.- 2.3 Quotient fields.- 2.4 Algebraic extension fields.- 2.5 Finite fields.- 2.6 Bibliographic notes.- 3 Computing by homomorphic images.- 3.1 The Chinese remainder problem and the modular method.- 3.2 p-adic approximation.- 3.3 The fast Fourier transform.- 3.4 Bibliographic notes.- 4 Greatest common divisors of polynomials.- 4.1 Polynomial remainder sequences.- 4.2 A modular gcd algorithm.- 4.3 Computation of resultants.- 4.4 Squarefree factorization.- 4.5 Squarefree partial fraction decomposition.- 4.6 Integration of rational functions.- 4.7 Bibliographic notes.- 5 Factorization of polynomials.- 5.1 Factorization over finite fields.- 5.2 Factorization over the integers.- 5.3 A polynomial-time factorization algorithm over the integers.- 5.4 Factorization over algebraic extension fields.- 5.5 Factorization over an algebraically closed field.- 5.6 Bibliographic notes.- 6 Decomposition of polynomials.- 6.1 A polynomial-time algorithm for decomposition.- 6.2 Bibliographic notes.- 7 Linear algebra solving linear systems.- 7.1 Bareiss s algorithm.- 7.2 Hankel matrices.- 7.3 Application of Hankel matrices to polynomial problems.- 7.4 Bibliographic notes.- 8 The method of Gröbner bases.- 8.1 Reduction relations.- 8.2 Polynomial reduction and Gröbner bases.- 8.3 Computation of Gröbner bases.- 8.4 Applications of Gröbner bases.- 8.5 Speed-ups and complexity considerations.- 8.6 Bibliographic notes.- 9 Quantifier elimination in real closed fields.- 9.1 The problem of quantifier elimination.- 9.2 Cylindrical algebraic decomposition.- 9.3 Bibliographic notes.- 10 Indefinite summation.- 10.1 Gosper s algorithm.- 10.2 Bibliographic notes.- 11 Parametrization of algebraic curves.- 11.1 Plane algebraic curves.- 11.2 A parametrization algorithm.- 11.3 Bibliographic notes.- Solutions of selected exercises.- References., [SC: 0.00], Neuware, gewerbliches Angebot, 254 mm, [GW: 545g]

Nouveaux livres Booklooker.de
Syndikat Buchdienst
Frais d'envoiVersandkostenfrei, Versand nach Deutschland (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Polynomial Algorithms in Computer Algebra
Livre non disponible
(*)
Polynomial Algorithms in Computer Algebra - nouveau livre

ISBN: 9783211827598

ID: 9783211827598

Polynomial Algorithms in Computer Algebra: Paperback: Springer Verlag GmbH: 9783211827598: 01 Jun 1997: Offers an introduction to the mathematical underpinnings of computer algebra. This book treats subjects that range from arithmetic of integers and polynomials to fast factorization methods, Grobner bases, and algorithms in algebraic geometry. It is suitable for both mathematics and computer science students. For several years now I have been teaching courses in computer algebra at the Universitat Linz, the University of Delaware, and the Universidad de Alcala de Henares. In the summers of 1990 and 1992 I have organized and taught summer schools in computer algebra at the Universitat Linz. Gradually a set of course notes has emerged from these activities. People have asked me for copies of the course notes, and different versions of them have been circulating for a few years. Finally I decided that I should really take the time to write the material up in a coherent way and make a book out of it. Here, now, is the result of this work. Over the years many students have been helpful in improving the quality of the notes, and also several colleagues at Linz and elsewhere have contributed to it. I want to thank them all for their effort, in particular I want to thank B. Buchberger, who taught me the theory of Grabner bases nearly two decades ago, B.F. Caviness and B.D. Saunders, who first stimulated my interest in various problems in computer algebra, G.E. Collins, who showed me how to compute in algebraic domains, and J.R. Sendra, with whom I started to apply computer algebra methods to problems in algebraic geometry. Several colleagues have suggested improvements in earlier versions of this book. However, I want to make it clear that I am responsible for all remaining mistakes. Algebra, , , , , , , , , , , ,, [PU: Springer, Wien]

Nouveaux livres Wordery.com
MPN: , SKU 9783211827598 Frais d'envoiPreise variieren je nach Lieferland., Livraison non-comprise
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Polynomial Algorithms in Computer Algebra (Texts  &  Monographs in Symbolic Computation) - Franz Winkler
Livre non disponible
(*)
Franz Winkler:
Polynomial Algorithms in Computer Algebra (Texts & Monographs in Symbolic Computation) - livre d'occasion

1992

ISBN: 3211827595

ID: 6513928

For several years now I have been teaching courses in computer algebra at the Universitat Linz, the University of Delaware, and the Universidad de Alcala de Henares. In the summers of 1990 and 1992 I have organized and taught summer schools in computer algebra at the Universitat Linz. Gradually a set of course notes has emerged from these activities. People have asked me for copies of the course notes, and different versions of them have been circulating for a few years. Finally I decided that I should really take the time to write the material up in a coherent way and make a book out of it. Here, now, is the result of this work. Over the years many students have been helpful in improving the quality of the notes, and also several colleagues at Linz and elsewhere have contributed to it. I want to thank them all for their effort, in particular I want to thank B. Buchberger, who taught me the theory of Grabner bases nearly two decades ago, B. F. Caviness and B. D. Saunders, who first stimulated my interest in various problems in computer algebra, G. E. Collins, who showed me how to compute in algebraic domains, and J. R. Sendra, with whom I started to apply computer algebra methods to problems in algebraic geometry. Several colleagues have suggested improvements in earlier versions of this book. However, I want to make it clear that I am responsible for all remaining mistakes. algorithms,computer science,computers,computers and technology,information theory,math,mathematics,microsoft,modeling and simulation,programming Microsoft, Springer

livre d'occasion Thriftbooks.com
used Frais d'envoizzgl. Versandkosten, Livraison non-comprise
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Polynomial Algorithms in Computer Algebra - Franz Winkler
Livre non disponible
(*)
Franz Winkler:
Polynomial Algorithms in Computer Algebra - nouveau livre

ISBN: 9783211827598

ID: 208334898

For several years now I have been teaching courses in computer algebra at the Universitat Linz, the University of Delaware, and the Universidad de Alcala de Henares. In the summers of 1990 and 1992 I have organized and taught summer schools in computer algebra at the Universitat Linz. Gradually a set of course notes has emerged from these activities. People have asked me for copies of the course notes, and different versions of them have been circulating for a few years. Finally I decided that I should really take the time to write the material up in a coherent way and make a book out of it. Here, now, is the result of this work. Over the years many students have been helpful in improving the quality of the notes, and also several colleagues at Linz and elsewhere have contributed to it. I want to thank them all for their effort, in particular I want to thank B. Buchberger, who taught me the theory of Grabner bases nearly two decades ago, B. F. Caviness and B. D. Saunders, who first stimulated my interest in various problems in computer algebra, G. E. Collins, who showed me how to compute in algebraic domains, and J. R. Sendra, with whom I started to apply computer algebra methods to problems in algebraic geometry. Several colleagues have suggested improvements in earlier versions of this book. However, I want to make it clear that I am responsible for all remaining mistakes. Polynomial Algorithms in Computer Algebra Buch (fremdspr.) Bücher>Fremdsprachige Bücher>Englische Bücher, Springer

Nouveaux livres Thalia.de
No. 1899427 Frais d'envoi, Versandfertig in 2 - 3 Tagen, DE (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Polynomial Algorithms in Computer Algebra - Franz Winkler
Livre non disponible
(*)
Franz Winkler:
Polynomial Algorithms in Computer Algebra - Livres de poche

ISBN: 9783211827598

[ED: Taschenbuch], [PU: Springer], Neuware - For several years now I have been teaching courses in computer algebra at the Universitat Linz, the University of Delaware, and the Universidad de Alcala de Henares. In the summers of 1990 and 1992 I have organized and taught summer schools in computer algebra at the Universitat Linz. Gradually a set of course notes has emerged from these activities. People have asked me for copies of the course notes, and different versions of them have been circulating for a few years. Finally I decided that I should really take the time to write the material up in a coherent way and make a book out of it. Here, now, is the result of this work. Over the years many students have been helpful in improving the quality of the notes, and also several colleagues at Linz and elsewhere have contributed to it. I want to thank them all for their effort, in particular I want to thank B. Buchberger, who taught me the theory of Grabner bases nearly two decades ago, B. F. Caviness and B. D. Saunders, who first stimulated my interest in various problems in computer algebra, G. E. Collins, who showed me how to compute in algebraic domains, and J. R. Sendra, with whom I started to apply computer algebra methods to problems in algebraic geometry. Several colleagues have suggested improvements in earlier versions of this book. However, I want to make it clear that I am responsible for all remaining mistakes., [SC: 0.00], Neuware, gewerbliches Angebot, 254x178x15 mm, [GW: 544g]

Nouveaux livres Booklooker.de
Mein Buchshop
Frais d'envoiVersandkostenfrei, Versand nach Deutschland (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.

< Retour aux résultats de recherche...
Détails sur le livre
Polynomial Algorithms in Computer Algebra
Auteur:

Winkler, Franz

Titre:

Polynomial Algorithms in Computer Algebra

ISBN:

9783211827598

The book gives a thorough introduction to the mathematical underpinnings of computer algebra. The subjects treated range from arithmetic of integers and polynomials to fast factorization methods, Gröbner bases, and algorithms in algebraic geometry. The algebraic background for all the algorithms presented in the book is fully described, and most of the algorithms are investigated with respect to their computational complexity. Each chapter closes with a brief survey of the related literature.

Informations détaillées sur le livre - Polynomial Algorithms in Computer Algebra


EAN (ISBN-13): 9783211827598
ISBN (ISBN-10): 3211827595
Livre de poche
Date de parution: 1996
Editeur: Springer-Verlag KG
288 Pages
Poids: 0,544 kg
Langue: eng/Englisch

Livre dans la base de données depuis 26.10.2007 07:11:54
Livre trouvé récemment le 09.03.2017 15:13:35
ISBN/EAN: 9783211827598

ISBN - Autres types d'écriture:
3-211-82759-5, 978-3-211-82759-8

< Retour aux résultats de recherche...
< pour archiver...
Livres en relation