A partir de cette page vous pouvez :
Retourner au premier écran avec les dernières notices... |
Catégories
> 12-XX Field theory and polynomials > 12Y05 Computational aspects of field theory and polynomials
12Y05 Computational aspects of field theory and polynomials
Affiner la recherche
Computer algebra. Systems and algorithms for algebraic computation / Davenport, A. ; Tournier, E. ; Y. Siret
Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 11930 68C05 imprimé / autre CRDM 68/INFORMATIQUE Disponible First leaves : a tutorial introduction to Maple V / Bruce W. Char
Titre : First leaves : a tutorial introduction to Maple V Type de document : texte imprimé Auteurs : Bruce W. Char ; Leong, Benton L. ; Gonnet, Gaston H. ; Keith O. Geddes Editeur : Springer-Verlag Année de publication : 1993 Importance : xviii - 253 p. ISBN/ISSN/EAN : 978-0-387-97621-1 Langues : Anglais Catégories : 12-XX Field theory and polynomials:12Y05 Computational aspects of field theory and polynomials
68-XX Computer science :68-01 Instructional exposition (textbooks, tutorial papers, etc.)
68-XX Computer science :68WXX Algorithms :68W30 Symbolic computation and algebraic computationMots-clés : maple computer algebra systems Index. décimale : 68C Monographie First leaves : a tutorial introduction to Maple V [texte imprimé] / Bruce W. Char ; Leong, Benton L. ; Gonnet, Gaston H. ; Keith O. Geddes . - [S.l.] : Springer-Verlag, 1993 . - xviii - 253 p.
ISBN : 978-0-387-97621-1
Langues : Anglais
Catégories : 12-XX Field theory and polynomials:12Y05 Computational aspects of field theory and polynomials
68-XX Computer science :68-01 Instructional exposition (textbooks, tutorial papers, etc.)
68-XX Computer science :68WXX Algorithms :68W30 Symbolic computation and algebraic computationMots-clés : maple computer algebra systems Index. décimale : 68C Monographie Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 10929 68C237 imprimé / autre CRDM 68/INFORMATIQUE Disponible 16823 68C237 imprimé / autre CRDM 68/INFORMATIQUE Disponible Point estimation of root finding methods / Miodrag Petkovic
Titre : Point estimation of root finding methods Type de document : texte imprimé Auteurs : Miodrag Petkovic, Auteur Editeur : Springer-Verlag Année de publication : 2008 Collection : Lecture Notes in Mathematics, ISSN 0075-8434 num. 1933 Importance : xii, 210 p. Présentation : couv. ill. Format : 24 cm ISBN/ISSN/EAN : 978-3-540-77850-9 Langues : Anglais Catégories : 12-XX Field theory and polynomials:12Y05 Computational aspects of field theory and polynomials
65-XX Numerical analysis:65-02 Research exposition (monographs, survey articles)
65-XX Numerical analysis:65HXX Nonlinear algebraic or transcendental equations:65H05 Single equationsMots-clés : algebraic equations root finding methods point estimation theory convergence textbook polynomial zeros numerical results Index. décimale : LNM Point estimation of root finding methods [texte imprimé] / Miodrag Petkovic, Auteur . - [S.l.] : Springer-Verlag, 2008 . - xii, 210 p. : couv. ill. ; 24 cm. - (Lecture Notes in Mathematics, ISSN 0075-8434; 1933) .
ISBN : 978-3-540-77850-9
Langues : Anglais
Catégories : 12-XX Field theory and polynomials:12Y05 Computational aspects of field theory and polynomials
65-XX Numerical analysis:65-02 Research exposition (monographs, survey articles)
65-XX Numerical analysis:65HXX Nonlinear algebraic or transcendental equations:65H05 Single equationsMots-clés : algebraic equations root finding methods point estimation theory convergence textbook polynomial zeros numerical results Index. décimale : LNM Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 18639 LNM/1933 imprimé / autre CRDM LNS/LECTURES NOTES IN STATISTICS Disponible Polynomial algorithms in computer algebra / Winkler, Franz
Titre : Polynomial algorithms in computer algebra Type de document : texte imprimé Auteurs : Winkler, Franz Editeur : Wien : Sringer-Verlag Année de publication : 1996 Collection : Texts and Monographs in Symbolic Computation Importance : viii - 270 p. ISBN/ISSN/EAN : 978-3-211-82759-8 Langues : Anglais Catégories : 12-XX Field theory and polynomials:12-01 Instructional exposition (textbooks, tutorial papers, etc.)
12-XX Field theory and polynomials:12Y05 Computational aspects of field theory and polynomials
13-XX Commutative rings and algebras:13PXX Computational aspects of commutative algebra :13P10 Polynomial ideals, Gröbner bases
68-XX Computer science :68-01 Instructional exposition (textbooks, tutorial papers, etc.)
68-XX Computer science :68RXX Discrete mathematics in relation to computer science:68R99 None of the above, but in this section
68-XX Computer science :68WXX Algorithms :68W30 Symbolic computation and algebraic computationMots-clés : polynomial algorithms gr?r bases hankel systems linear systems decomposition gcd computation constructive algebraic geometry solution of polynomial equations factorization algebraic curve parametrization computer algebra Index. décimale : 68C Monographie Polynomial algorithms in computer algebra [texte imprimé] / Winkler, Franz . - Wien : Sringer-Verlag, 1996 . - viii - 270 p.. - (Texts and Monographs in Symbolic Computation) .
ISBN : 978-3-211-82759-8
Langues : Anglais
Catégories : 12-XX Field theory and polynomials:12-01 Instructional exposition (textbooks, tutorial papers, etc.)
12-XX Field theory and polynomials:12Y05 Computational aspects of field theory and polynomials
13-XX Commutative rings and algebras:13PXX Computational aspects of commutative algebra :13P10 Polynomial ideals, Gröbner bases
68-XX Computer science :68-01 Instructional exposition (textbooks, tutorial papers, etc.)
68-XX Computer science :68RXX Discrete mathematics in relation to computer science:68R99 None of the above, but in this section
68-XX Computer science :68WXX Algorithms :68W30 Symbolic computation and algebraic computationMots-clés : polynomial algorithms gr?r bases hankel systems linear systems decomposition gcd computation constructive algebraic geometry solution of polynomial equations factorization algebraic curve parametrization computer algebra Index. décimale : 68C Monographie Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 11961 68C08 imprimé / autre CRDM 68/INFORMATIQUE Disponible Polynomials: an algorithmic approach. / Mignotte, Maurice
Titre : Polynomials: an algorithmic approach. Type de document : texte imprimé Auteurs : Mignotte, Maurice ; Stefanescu, Doru Editeur : Singapore : Springer Année de publication : 1999 Importance : xi - 306 p. ISBN/ISSN/EAN : 978-981-4021-51-7 Langues : Anglais Catégories : 11-XX Number theory:11-01 Instructional exposition (textbooks, tutorial papers, etc.)
11-XX Number theory:11CXX Polynomials and matrices:11C08 Polynomials
12-XX Field theory and polynomials:12-01 Instructional exposition (textbooks, tutorial papers, etc.)
12-XX Field theory and polynomials:12DXX Real and complex fields:12D05 Polynomials: factorization
12-XX Field theory and polynomials:12EXX General field theory:12E05 Polynomials (irreducibility, etc.)
12-XX Field theory and polynomials:12Y05 Computational aspects of field theory and polynomials
68-XX Computer science :68WXX Algorithms :68W30 Symbolic computation and algebraic computationMots-clés : upper bounds height length mahler measure polynomial sizes complex polynomials irreducibility criteria polynomial interpolation bezoutian elimination algebraic complexity algorithms polynomials lenstra-lenstra-lov? algorithm norm resultant Index. décimale : 12C Monographie Polynomials: an algorithmic approach. [texte imprimé] / Mignotte, Maurice ; Stefanescu, Doru . - Singapore : Springer, 1999 . - xi - 306 p.
ISBN : 978-981-4021-51-7
Langues : Anglais
Catégories : 11-XX Number theory:11-01 Instructional exposition (textbooks, tutorial papers, etc.)
11-XX Number theory:11CXX Polynomials and matrices:11C08 Polynomials
12-XX Field theory and polynomials:12-01 Instructional exposition (textbooks, tutorial papers, etc.)
12-XX Field theory and polynomials:12DXX Real and complex fields:12D05 Polynomials: factorization
12-XX Field theory and polynomials:12EXX General field theory:12E05 Polynomials (irreducibility, etc.)
12-XX Field theory and polynomials:12Y05 Computational aspects of field theory and polynomials
68-XX Computer science :68WXX Algorithms :68W30 Symbolic computation and algebraic computationMots-clés : upper bounds height length mahler measure polynomial sizes complex polynomials irreducibility criteria polynomial interpolation bezoutian elimination algebraic complexity algorithms polynomials lenstra-lenstra-lov? algorithm norm resultant Index. décimale : 12C Monographie Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 12267 12C45 imprimé / autre CRDM 12/THEORIE DES CORPS ET POLYNOMES Disponible Solving polynomial equation systems II / Teo Mora
PermalinkSymbolic asymptotics / John R. Shackell
Permalink