Algorithms Computer Algebra by Geddes Keith (42 results)

Condition: New. In.

Hardcover. Octavo, x, xii, xiii, xviii, xiv, 585 pages. In Very Good condition. Bound in the publisher's dark blue cloth bearing yellow and white lettering to the spine. Boards have light wear including minimal scuffs and few bumps to the edges with mild cocking to the spine. Text block has very slight wear including sparse, minor soiling to the edges. Illustrated. NOTE: Shelved in Locked Annex, Column Y. 1407330. FP New Rockville Stock.

hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!

Soft cover. Condition: Near Fine. Nera Fine to Near Fine- lightly edgeworn and bumped oversize trade paperback, clean and unmarked.

Condition: New.

Condition: New.

Hardcover. Condition: new. Hardcover. "Algorithms for Computer Algebra" is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Numerous examples are integrated into the text as an aid to understanding the mathematical development. The algorithms developed for each topic are presented in a Pascal-like computer language. An extensive set of exercises is presented at the end of each chapter. "Algorithms for Computer Algebra" is suitable for use as a textbook for a course on algebraic algorithms at the third-year, fourth-year, or graduate level.Although the mathematical development uses concepts from modern algebra, the book is self-contained in the sense that a one-term undergraduate course introducing students to rings and fields is the only prerequisite assumed. The book also serves well as a supplementary textbook for a traditional modern algebra course, by presenting concrete applications to motivate the understanding of the theory of rings and fields. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condition: New.

Condition: New.

Condition: New. In.

Condition: New. In.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: Like New. Like New. book.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.

Condition: New. pp. 608.

Condition: New. A comprehensive textbook on the topic of computational symbolic mathematics. It first develops the foundational material from modern algebra that is required for subsequent topics, then presents a development of computational algorithms for such problems as multivariate polynomial arithmetic. Num Pages: 586 pages, biography. BIC Classification: PBF; UYT. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 33. Weight in Grams: 1023. . 1992. Hardback. . . . .

Buch. Condition: Neu. Neuware -Algorithms for Computer Algebra is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Numerous examples are integrated into the text as an aid to understanding the mathematical development. The algorithms developed for each topic are presented in a Pascal-like computer language. An extensive set of exercises is presented at the end of each chapter.Algorithms for Computer Algebra is suitable for use as a textbook for a course on algebraic algorithms at the third-year, fourth-year, or graduate level. Although the mathematical development uses concepts from modern algebra, the book is self-contained in the sense that a one-term undergraduate course introducing students to rings and fields is the only prerequisite assumed. The book also serves well as a supplementary textbook for a traditional modern algebra course, by presenting concrete applications to motivate the understanding of the theory of rings and fields.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 608 pp. Englisch.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: Like New. Like New. book.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Algorithms for Computer Algebra is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Numerous examples are integrated into the text as an aid to understanding the mathematical development. The algorithms developed for each topic are presented in a Pascal-like computer language. An extensive set of exercises is presented at the end of each chapter. Algorithms for Computer Algebra is suitable for use as a textbook for a course on algebraic algorithms at the third-year, fourth-year, or graduate level. Although the mathematical development uses concepts from modern algebra, the book is self-contained in the sense that a one-term undergraduate course introducing students to rings and fields is the only prerequisite assumed. The book also serves well as a supplementary textbook for a traditional modern algebra course, by presenting concrete applications to motivate the understanding of the theory of rings and fields.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Algorithms for Computer Algebra is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Numerous examples are integrated into the text as an aid to understanding the mathematical development. The algorithms developed for each topic are presented in a Pascal-like computer language. An extensive set of exercises is presented at the end of each chapter. Algorithms for Computer Algebra is suitable for use as a textbook for a course on algebraic algorithms at the third-year, fourth-year, or graduate level. Although the mathematical development uses concepts from modern algebra, the book is self-contained in the sense that a one-term undergraduate course introducing students to rings and fields is the only prerequisite assumed. The book also serves well as a supplementary textbook for a traditional modern algebra course, by presenting concrete applications to motivate the understanding of the theory of rings and fields.

Paperback. Condition: Brand New. reprint edition. 608 pages. 9.25x6.10x1.37 inches. In Stock.

Condition: As New. Unread book in perfect condition.

Condition: New. A comprehensive textbook on the topic of computational symbolic mathematics. It first develops the foundational material from modern algebra that is required for subsequent topics, then presents a development of computational algorithms for such problems as multivariate polynomial arithmetic. Num Pages: 586 pages, biography. BIC Classification: PBF; UYT. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 33. Weight in Grams: 1023. . 1992. Hardback. . . . . Books ship from the US and Ireland.

Hardcover. Condition: new. Hardcover. "Algorithms for Computer Algebra" is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Numerous examples are integrated into the text as an aid to understanding the mathematical development. The algorithms developed for each topic are presented in a Pascal-like computer language. An extensive set of exercises is presented at the end of each chapter. "Algorithms for Computer Algebra" is suitable for use as a textbook for a course on algebraic algorithms at the third-year, fourth-year, or graduate level.Although the mathematical development uses concepts from modern algebra, the book is self-contained in the sense that a one-term undergraduate course introducing students to rings and fields is the only prerequisite assumed. The book also serves well as a supplementary textbook for a traditional modern algebra course, by presenting concrete applications to motivate the understanding of the theory of rings and fields. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.