› › Computer Algebra And Polynomials

Computer Algebra and Polynomials

Author : Jaime Gutierrez

Publisher : Springer

Page : 222 pages

File Size : 32,83 MB

Release : 2015-01-20

Category : Computers

ISBN : 3319150812

Get eBook

Book Description

Algebra and number theory have always been counted among the most beautiful mathematical areas with deep proofs and elegant results. However, for a long time they were not considered that important in view of the lack of real-life applications. This has dramatically changed: nowadays we find applications of algebra and number theory frequently in our daily life. This book focuses on the theory and algorithms for polynomials over various coefficient domains such as a finite field or ring. The operations on polynomials in the focus are factorization, composition and decomposition, basis computation for modules, etc. Algorithms for such operations on polynomials have always been a central interest in computer algebra, as it combines formal (the variables) and algebraic or numeric (the coefficients) aspects. The papers presented were selected from the Workshop on Computer Algebra and Polynomials, which was held in Linz at the Johann Radon Institute for Computational and Applied Mathematics (RICAM) during November 25-29, 2013, at the occasion of the Special Semester on Applications of Algebra and Number Theory.



Polynomial Algorithms in Computer Algebra

Author : Franz Winkler

Publisher : Springer Science & Business Media

Page : 294 pages

File Size : 21,87 MB

Release : 1996-08-02

Category : Mathematics

ISBN : 9783211827598

Get eBook

Book Description

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 for Computer Algebra

Author : Keith O. Geddes

Publisher : Springer Science & Business Media

Page : 594 pages

File Size : 28,74 MB

Release : 2007-06-30

Category : Computers

ISBN : 0585332479

Get eBook

Book Description

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.



Effective Polynomial Computation

Author : Richard Zippel

Publisher : Springer Science & Business Media

Page : 364 pages

File Size : 25,26 MB

Release : 2012-12-06

Category : Computers

ISBN : 1461531888

Get eBook

Book Description

Effective Polynomial Computation is an introduction to the algorithms of computer algebra. It discusses the basic algorithms for manipulating polynomials including factoring polynomials. These algorithms are discussed from both a theoretical and practical perspective. Those cases where theoretically optimal algorithms are inappropriate are discussed and the practical alternatives are explained. Effective Polynomial Computation provides much of the mathematical motivation of the algorithms discussed to help the reader appreciate the mathematical mechanisms underlying the algorithms, and so that the algorithms will not appear to be constructed out of whole cloth. Preparatory to the discussion of algorithms for polynomials, the first third of this book discusses related issues in elementary number theory. These results are either used in later algorithms (e.g. the discussion of lattices and Diophantine approximation), or analogs of the number theoretic algorithms are used for polynomial problems (e.g. Euclidean algorithm and p-adic numbers). Among the unique features of Effective Polynomial Computation is the detailed material on greatest common divisor and factoring algorithms for sparse multivariate polynomials. In addition, both deterministic and probabilistic algorithms for irreducibility testing of polynomials are discussed.



Polynomial Algorithms in Computer Algebra

Author : Franz Winkler

Publisher : Springer Science & Business Media

Page : 284 pages

File Size : 31,64 MB

Release : 2012-12-06

Category : Mathematics

ISBN : 3709165717

Get eBook

Book Description

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.



Modern Computer Algebra

Author : Joachim von zur Gathen

Publisher : Cambridge University Press

Page : 811 pages

File Size : 12,66 MB

Release : 2013-04-25

Category : Computers

ISBN : 1107039037

Get eBook

Book Description

Now in its third edition, this highly successful textbook is widely regarded as the 'bible of computer algebra'.



Elimination Methods in Polynomial Computer Algebra

Author : V. Bykov

Publisher : Springer Science & Business Media

Page : 254 pages

File Size : 49,56 MB

Release : 2012-12-06

Category : Mathematics

ISBN : 9401153027

Get eBook

Book Description

The subject of this book is connected with a new direction in mathematics, which has been actively developed over the last few years, namely the field of polynomial computer algebra, which lies at the intersection point of algebra, mathematical analysis and programming. There were several incentives to write the book. First of all, there has lately been a considerable interest in applied nonlinear problems characterized by multiple sta tionary states. Practical needs have then in their turn led to the appearance of new theoretical results in the analysis of systems of nonlinear algebraic equations. And finally, the introduction of various computer packages for analytic manipulations has made it possible to use complicated elimination-theoretical algorithms in prac tical research. The structure of the book is accordingly represented by three main parts: Mathematical results driven to constructive algorithms, computer algebra realizations of these algorithms, and applications. Nonlinear systems of algebraic equations arise in diverse fields of science. In particular, for processes described by systems of differential equations with a poly nomial right hand side one is faced with the problem of determining the number (and location) of the stationary states in certain sets.



Numerical Polynomial Algebra

Author : Hans J. Stetter

Publisher : SIAM

Page : 487 pages

File Size : 28,10 MB

Release : 2004-01-01

Category : Mathematics

ISBN : 9780898717976

Get eBook

Book Description

In many important areas of scientific computing, polynomials in one or more variables are employed in the mathematical modeling of real-life phenomena; yet most of classical computer algebra assumes exact rational data. This book is the first comprehensive treatment of the emerging area of numerical polynomial algebra, an area that falls between classical numerical analysis and classical computer algebra but, surprisingly, has received little attention so far. The author introduces a conceptual framework that permits the meaningful solution of various algebraic problems with multivariate polynomial equations whose coefficients have some indeterminacy; for this purpose, he combines approaches of both numerical linear algebra and commutative algebra. For the application scientist, Numerical Polynomial Algebra provides both a survey of polynomial problems in scientific computing that may be solved numerically and a guide to their numerical treatment. In addition, the book provides both introductory sections and novel extensions of numerical analysis and computer algebra, making it accessible to the reader with expertise in either one of these areas.



Mathematics for Computer Algebra

Author : Maurice Mignotte

Publisher : Springer Science & Business Media

Page : 357 pages

File Size : 15,29 MB

Release : 2012-12-06

Category : Computers

ISBN : 1461391717

Get eBook

Book Description

This book corresponds to a mathematical course given in 1986/87 at the University Louis Pasteur, Strasbourg. This work is primarily intended for graduate students. The following are necessary prerequisites : a few standard definitions in set theory, the definition of rational integers, some elementary facts in Combinatorics (maybe only Newton's binomial formula), some theorems of Analysis at the level of high schools, and some elementary Algebra (basic results about groups, rings, fields and linear algebra). An important place is given to exercises. These exercises are only rarely direct applications of the course. More often, they constitute complements to the text. Mostly, hints or references are given so that the reader should be able to find solutions. Chapters one and two deal with elementary results of Number Theory, for example : the euclidean algorithm, the Chinese remainder theorem and Fermat's little theorem. These results are useful by themselves, but they also constitute a concrete introduction to some notions in abstract algebra (for example, euclidean rings, principal rings ... ). Algorithms are given for arithmetical operations with long integers. The rest of the book, chapters 3 through 7, deals with polynomials. We give general results on polynomials over arbitrary rings. Then polynomials with complex coefficients are studied in chapter 4, including many estimates on the complex roots of polynomials. Some of these estimates are very useful in the subsequent chapters.



Computer Algebra Systems

Author : Michael J. Wester

Publisher : Wiley-Blackwell

Page : 464 pages

File Size : 47,3 MB

Release : 1999-07-16

Category : Computers

ISBN :

Get eBook

Book Description

This thorough overview of the major computer algebra (symbolic mathematical) systems compares and contrasts their strengths and weaknesses, and gives tutorial information for using these systems in various ways. * Compares different packages quantitatively using standard 'test suites' * Ideal for assessing the most appropriate package for a particular user or application * Examines the performance and future developments from a user's and developer's viewpoint Internationally recognized specialists overview both the general and special purpose systems and discuss issues such as denesting nested roots, complex number calculations, efficiently computing special polynomials, solving single equations and systems of polynomial equations, computing limits, multiple integration, solving ordinary differential and nonlinear evolution equations, code generation, evaluation and computer algebra in education. The historical origins, computer algebra resources and equivalents for many common operations in seven major packages are also covered. By providing such a comprehensive survey, the experienced user is able to make an informed decision on which system(s) he or she might like to use. It also allows a user new to computer algebra to form an idea of where to begin. Since each system looked at in this book uses a different language, many examples are included to aid the user in adapting to these language differences. These examples can be used as a guide to using the various systems once one understands the basic principles of one CAS. The book also includes contributions which look at the broad issues of the needs of various users and future developments, both from the user's and the developer's viewpoint. The author is a leading figure in the development and analysis of mathematical software and is well known through the 'Wester test suite' of problems which provide a bench mark for measuring the performance of mathematical software systems. The book will help develop our range of titles for applied mathematcians. The book will provide a unique, fully up-to-date and independent assessment of particular systems and will be of interest to users and purchasers of CAS's.