Advertisement
| computer algebra: Algorithms for Computer Algebra Keith O. Geddes, Stephen R. Czapor, George Labahn, 1992-09-30 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. |
| computer algebra: Computer Algebra and Symbolic Computation Joel S. Cohen, 2002-07-19 This book provides a systematic approach for the algorithmic formulation and implementation of mathematical operations in computer algebra programming languages. The viewpoint is that mathematical expressions, represented by expression trees, are the data objects of computer algebra programs, and by using a few primitive operations that analyze and |
| computer algebra: Computer Algebra R. Albrecht, B. Buchberger, G.E. Collins, R. Loos, 2012-12-06 this gap. In sixteen survey articles the most important theoretical results, algorithms and software methods of computer algebra are covered, together with systematic references to literature. In addition, some new results are presented. Thus the volume should be a valuable source for obtaining a first impression of computer algebra, as well as for preparing a computer algebra course or for complementary reading. The preparation of some papers contained in this volume has been supported by grants from the Austrian Fonds zur Forderung der wissenschaftlichen For schung (Project No. 3877), the Austrian Ministry of Science and Research (Department 12, Dr. S. Hollinger), the United States National Science Foundation (Grant MCS-8009357) and the Deutsche Forschungsgemeinschaft (Lo-23 1-2). The work on the volume was greatly facilitated by the opportunity for the editors to stay as visitors at the Department of Computer and Information Sciences, University of Delaware, at the General Electric Company Research and Development Center, Schenectady, N. Y. , and at the Mathematical Sciences Department, Rensselaer Polytechnic Institute, Troy, N. Y. , respectively. Our thanks go to all these institutions. The patient and experienced guidance and collaboration of the Springer-Verlag Wien during all the stages of production are warmly appreciated. The editors of the Cooperative editor of Supplementum Computing B. Buchberger R. Albrecht G. Collins R. Loos Contents Loos, R. : Introduction. . . . . . . . . . . . . . . . . . . . . . . . . . 1 Buchberger, B. , Loos, R. : Algebraic Simplification . . . . . . . . . . 11 Neubiiser, J. : Computing with Groups and Their Character Tables. 45 Norman, A. C. : Integration in Finite Terms. . . . . . . . . . . . . . |
| computer algebra: Computer Algebra Edmund A. Lamagna, 2019-01-15 The goal of Computer Algebra: Concepts and Techniques is to demystify computer algebra systems for a wide audience including students, faculty, and professionals in scientific fields such as computer science, mathematics, engineering, and physics. Unlike previous books, the only prerequisites are knowledge of first year calculus and a little programming experience — a background that can be assumed of the intended audience. The book is written in a lean and lively style, with numerous examples to illustrate the issues and techniques discussed. It presents the principal algorithms and data structures, while also discussing the inherent and practical limitations of these systems |
| computer algebra: Computer Algebra and Symbolic Computation Joel S. Cohen, 2003-01-03 Mathematica, Maple, and similar software packages provide programs that carry out sophisticated mathematical operations. Applying the ideas introduced in Computer Algebra and Symbolic Computation: Elementary Algorithms, this book explores the application of algorithms to such methods as automatic simplification, polynomial decomposition, and polyno |
| computer algebra: Computer Algebra Handbook Johannes Grabmeier, Erich Kaltofen, Volker Weispfenning, 2012-12-06 Two ideas lie gleaming on the jeweler's velvet. The first is the calculus, the sec ond, the algorithm. The calculus and the rich body of mathematical analysis to which it gave rise made modern science possible; but it has been the algorithm that has made possible the modern world. -David Berlinski, The Advent of the Algorithm First there was the concept of integers, then there were symbols for integers: I, II, III, 1111, fttt (what might be called a sticks and stones representation); I, II, III, IV, V (Roman numerals); 1, 2, 3, 4, 5 (Arabic numerals), etc. Then there were other concepts with symbols for them and algorithms (sometimes) for ma nipulating the new symbols. Then came collections of mathematical knowledge (tables of mathematical computations, theorems of general results). Soon after algorithms came devices that provided assistancefor carryingout computations. Then mathematical knowledge was organized and structured into several related concepts (and symbols): logic, algebra, analysis, topology, algebraic geometry, number theory, combinatorics, etc. This organization and abstraction lead to new algorithms and new fields like universal algebra. But always our symbol systems reflected and influenced our thinking, our concepts, and our algorithms. |
| computer algebra: Algorithmic Algebra Bhubaneswar Mishra, 2012-12-06 Algorithmic Algebra studies some of the main algorithmic tools of computer algebra, covering such topics as Gröbner bases, characteristic sets, resultants and semialgebraic sets. The main purpose of the book is to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra so that they could do research in computational algebra or understand the algorithms underlying many popular symbolic computational systems: Mathematica, Maple or Axiom, for instance. Also, researchers in robotics, solid modeling, computational geometry and automated theorem proving community may find it useful as symbolic algebraic techniques have begun to play an important role in these areas. The book, while being self-contained, is written at an advanced level and deals with the subject at an appropriate depth. The book is accessible to computer science students with no previous algebraic training. Some mathematical readers, on the other hand, may find it interesting to see how algorithmic constructions have been used to provide fresh proofs for some classical theorems. The book also contains a large number of exercises with solutions to selected exercises, thus making it ideal as a textbook or for self-study. |
| computer algebra: Computer Algebra R. Albrecht, B. Buchberger, G.E. Collins, R. Loos, 2013-06-29 The journal Computing has established a series of supplement volumes the fourth of which appears this year. Its purpose is to provide a coherent presentation of a new topic in a single volume. The previous subjects were Computer Arithmetic 1977, Fundamentals of Numerical Computation 1980, and Parallel Processes and Related Automata 1981; the topic of this 1982 Supplementum to Computing is Computer Algebra. This subject, which emerged in the early nineteen sixties, has also been referred to as symbolic and algebraic computation or formula manipulation. Algebraic algorithms have been receiving increasing interest as a result of the recognition of the central role of algorithms in computer science. They can be easily specified in a formal and rigorous way and provide solutions to problems known and studied for a long time. Whereas traditional algebra is concerned with constructive methods, computer algebra is furthermore interested in efficiency, in implementation, and in hardware and software aspects of the algorithms. It develops that in deciding effectiveness and determining efficiency of algebraic methods many other tools - recursion theory, logic, analysis and combinatorics, for example - are necessary. In the beginning of the use of computers for symbolic algebra it soon became apparent that the straightforward textbook methods were often very inefficient. Instead of turning to numerical approximation methods, computer algebra studies systematically the sources of the inefficiency and searches for alternative algebraic methods to improve or even replace the algorithms. |
| computer algebra: Computer Simulation and Computer Algebra Dietrich Stauffer, Friedrich W Hehl, Volker Winkelmann, John G. Zabolitzky, 2012-12-06 The chapter on statistical-physics simulations has been enlarged, mainly by a dis cussion of multispin coding techniques for the Ising model (bit-by-bit parallel oper ations). In the chapter about Reduce, some details of the presentation have been cor rected or clarified. The new operator MATEIGEN for the computation of eigenvec tors of matrices is explained. The first chapter and the appendix remain unchanged. Needless to say, the field of computational science is advancing so quickly, for ex ample with the development of parallel, as opposed to vectorized, algorithms, that it will not be too long before a further edition is called for. Cologne, March 1989 The authors Preface to the First Edition Computers play an increasingly important role in many of today's activities, and correspondingly physicists find employment after graduation in computer related jobs, often quite remote from their physics education. The present lectures, on the other hand, emphasize how we can use computers for the purposes of fundamental research in physics. Thus we do not deal with programs designed for newspapers, banks, or travel agencies, i.e., word processing and storage of large amounts of data. |
| computer algebra: Computer Algebra Recipes Richard Enns, George C. McGuire, 2013-03-07 Computer algebra systems have the potential to revolutionize the teaching of and learning of science. Not only can students work thorough mathematical models much more efficiently and with fewer errors than with pencil and paper, they can also work with much more complex and computationally intensive models. Thus, for example, in studying the flight of a golf ball, students can begin with the simple parabolic trajectory, but then add the effects of lift and drag, of winds, and of spin. Not only can the program provide analytic solutions in some cases, it can also produce numerical solutions and graphic displays. Aimed at undergraduates in their second or third year, this book is filled with examples from a wide variety of disciplines, including biology, economics, medicine, engineering, game theory, physics, chemistry. The text is organized along a spiral, revisiting general topics such as graphics, symbolic computation, and numerical simulation in greater detail and more depth at each turn of the spiral. The heart of the text is a large number of computer algebra recipes. These have been designed not only to provide tools for problem solving, but also to stimulate the reader's imagination. Associated with each recipe is a scientific model or method and a story that leads the reader through steps of the recipe. Each section of recipes is followed by a set of problems that readers can use to check their understanding or to develop the topic further. |
| computer algebra: Computer Algebra with LISP and REDUCE F. Brackx, D. Constales, 1991-11-30 One service mathematics has rendered the tEL moi, .... si j'avait su comment en revenir. je n'y serais point alle'.' human race. It has put common sense back Jules Verne where it belongs, on the topmost shelf next to the dusty canister labelled 'discarded non sense', The series is divergent; therefore we may be Eric T. Bell able to do something with it. O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and non linearities abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sciences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One service topology has rendered mathematical physics ...'; 'One service logic has rendered com puter science ...'; 'One service category theory has rendered mathematics ,..'. All arguably true. And all statements obtainable this way form part of the raison d'elre of this series. |
| computer algebra: Geometric Algebra for Computer Science Leo Dorst, Daniel Fontijne, Stephen Mann, 2010-07-26 Until recently, almost all of the interactions between objects in virtual 3D worlds have been based on calculations performed using linear algebra. Linear algebra relies heavily on coordinates, however, which can make many geometric programming tasks very specific and complex-often a lot of effort is required to bring about even modest performance enhancements. Although linear algebra is an efficient way to specify low-level computations, it is not a suitable high-level language for geometric programming. Geometric Algebra for Computer Science presents a compelling alternative to the limitations of linear algebra. Geometric algebra, or GA, is a compact, time-effective, and performance-enhancing way to represent the geometry of 3D objects in computer programs. In this book you will find an introduction to GA that will give you a strong grasp of its relationship to linear algebra and its significance for your work. You will learn how to use GA to represent objects and perform geometric operations on them. And you will begin mastering proven techniques for making GA an integral part of your applications in a way that simplifies your code without slowing it down. * The first book on Geometric Algebra for programmers in computer graphics and entertainment computing* Written by leaders in the field providing essential information on this new technique for 3D graphics* This full colour book includes a website with GAViewer, a program to experiment with GA |
| computer algebra: Rational Algebraic Curves J. Rafael Sendra, Franz Winkler, Sonia Pérez-Diaz, 2007-12-10 The central problem considered in this introduction for graduate students is the determination of rational parametrizability of an algebraic curve and, in the positive case, the computation of a good rational parametrization. This amounts to determining the genus of a curve: its complete singularity structure, computing regular points of the curve in small coordinate fields, and constructing linear systems of curves with prescribed intersection multiplicities. The book discusses various optimality criteria for rational parametrizations of algebraic curves. |
| computer algebra: Ideals, Varieties, and Algorithms David Cox, John Little, DONAL OSHEA, 2013-04-17 We wrote this book to introduce undergraduates to some interesting ideas in algebraic geometry and commutative algebra. Until recently, these topics involved a lot of abstract mathematics and were only taught in graduate school. But in the 1960's, Buchberger and Hironaka discovered new algorithms for manipulating systems of polynomial equations. Fueled by the development of computers fast enough to run these algorithms, the last two decades have seen a minor revolution in commutative algebra. The ability to compute efficiently with polynomial equations has made it possible to investigate complicated examples that would be impossible to do by hand, and has changed the practice of much research in algebraic geometry. This has also enhanced the importance of the subject for computer scientists and engineers, who have begun to use these techniques in a whole range of problems. It is our belief that the growing importance of these computational techniques warrants their introduction into the undergraduate (and graduate) mathematics curricu lum. Many undergraduates enjoy the concrete, almost nineteenth century, flavor that a computational emphasis brings to the subject. At the same time, one can do some substantial mathematics, including the Hilbert Basis Theorem, Elimination Theory and the Nullstellensatz. The mathematical prerequisites of the book are modest: the students should have had a course in linear algebra and a course where they learned how to do proofs. Examples of the latter sort of course include discrete math and abstract algebra. |
| computer algebra: Computer Algebra and Differential Equations E. Tournier, 1994-03-03 Selected papers from the Computer Algebra and Differential Equations meeting held in France in June 1992. |
| computer algebra: Computer Algebra Wolfram Koepf, 2021-07-11 This textbook offers an algorithmic introduction to the field of computer algebra. A leading expert in the field, the author guides readers through numerous hands-on tutorials designed to build practical skills and algorithmic thinking. This implementation-oriented approach equips readers with versatile tools that can be used to enhance studies in mathematical theory, applications, or teaching. Presented using Mathematica code, the book is fully supported by downloadable sessions in Mathematica, Maple, and Maxima. Opening with an introduction to computer algebra systems and the basics of programming mathematical algorithms, the book goes on to explore integer arithmetic. A chapter on modular arithmetic completes the number-theoretic foundations, which are then applied to coding theory and cryptography. From here, the focus shifts to polynomial arithmetic and algebraic numbers, with modern algorithms allowing the efficient factorization of polynomials. The final chapters offer extensions into more advanced topics: simplification and normal forms, power series, summation formulas, and integration. Computer Algebra is an indispensable resource for mathematics and computer science students new to the field. Numerous examples illustrate algorithms and their implementation throughout, with online support materials to encourage hands-on exploration. Prerequisites are minimal, with only a knowledge of calculus and linear algebra assumed. In addition to classroom use, the elementary approach and detailed index make this book an ideal reference for algorithms in computer algebra. |
| computer algebra: Perturbation Methods, Bifurcation Theory and Computer Algebra Richard H. Rand, Dieter Armbruster, 2012-12-06 Perturbation methods have always been an important tool for treating nonlinear differential equations. Now the drudgery associated with them has been eliminated! This book offers computer algebra (MACSYMA) programs which implement the most popular perturbation methods. Not only does this avoid the errors associated with hand computation, but the increase in efficiency permits more complicated problems to be tackled. This book is useful both for the beginner learning perturbation methods for the first time, as well as for the researcher. Methods covered include: Lindstedt's method, center manifolds, normal forms, two variable expansion method (method of multiple scales), averaging, Lie transforms and Liapunov-Schmidt reduction. For each method the book includes an introduction and some example problems solved both by hand and by machine. The examples feature common bifurcations such as the pitchfork and the Hopf. The MACSYMA code for each method is given and suggested exercises are provided at the end of each Chapter. An Appendix offers a brief introduction to MACSYMA. |
| computer algebra: Computational Algebra Klaus G. Fischer, 2018-02-19 Based on the fifth Mid-Atlantic Algebra Conference held recently at George Mason University, Fairfax, Virginia. Focuses on both the practical and theoretical aspects of computational algebra. Demonstrates specific computer packages, including the use of CREP to study the representation of theory for finite dimensional algebras and Axiom to study algebras of finite rank. |
| computer algebra: Computer Algebra Recipes for Classical Mechanics Richard H. Enns, George C. McGuire, 2012-12-06 Hundreds of novel and innovative computer algebra recipes will enable readers starting at the second year undergraduate level to easily and rapidly solve and explore most problems they encounter in their classical mechanics studies. Using the powerful computer algebra system MAPLE (Release 8) - no prior knowledge of MAPLE is presumed - the relevant command structures are explained on a need-to-know basis as the recipes are developed. This new problem-solving guide can serve in the classroom or for self-study, for reference, or as a text for an on-line course. |
| computer algebra: Computer Algebra in Quantum Field Theory Carsten Schneider, Johannes Blümlein, 2013-10-05 The book focuses on advanced computer algebra methods and special functions that have striking applications in the context of quantum field theory. It presents the state of the art and new methods for (infinite) multiple sums, multiple integrals, in particular Feynman integrals, difference and differential equations in the format of survey articles. The presented techniques emerge from interdisciplinary fields: mathematics, computer science and theoretical physics; the articles are written by mathematicians and physicists with the goal that both groups can learn from the other field, including most recent developments. Besides that, the collection of articles also serves as an up-to-date handbook of available algorithms/software that are commonly used or might be useful in the fields of mathematics, physics or other sciences. |
| computer algebra: Computer Algebra in Scientific Computing François Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsov, 2020-10-17 This book constitutes the refereed proceedings of the 22nd International Workshop on Computer Algebra in Scientific Computing, CASC 2020, held in Linz, Austria, in September 2020. The conference was held virtually due to the COVID-19 pandemic. The 34 full papers presented together with 2 invited talks were carefully reviewed and selected from 41 submissions. They deal with cutting-edge research in all major disciplines of computer algebra. The papers cover topics such as polynomial algebra, symbolic and symbolic-numerical computation, applications of symbolic computation for investigating and solving ordinary differential equations, applications of CAS in the investigation and solution of celestial mechanics problems, and in mechanics, physics, and robotics. |
| computer algebra: Computer Algebra Fouad Sabry, 2023-07-06 What Is Computer Algebra Computer algebra, also known as symbolic computation or algebraic computation, is a subfield of computer science and mathematics that relates to the research and development of algorithms and software for the purpose of manipulating mathematical expressions and other mathematical objects. Other names for computer algebra include algebraic computation and symbolic computing. Scientific computing is typically based on numerical computation with approximate floating point numbers, whereas symbolic computation places an emphasis on exact computation with expressions containing variables that have no given value and are manipulated as symbols. Despite the fact that computer algebra could be considered a subfield of scientific computing, the two are generally regarded as separate fields. How You Will Benefit (I) Insights, and validations about the following topics: Chapter 1: Computer algebra Chapter 2: Symbolic artificial intelligence Chapter 3: Algebraic geometry Chapter 4: Automated theorem proving Chapter 5: Computer algebra system Chapter 6: Computer-assisted proof Chapter 7: Model checking Chapter 8: Proof assistant Chapter 9: Symbolic-numeric computation Chapter 10: Symbolic simulation (II) Answering the public top questions about computer algebra. (III) Real world examples for the usage of computer algebra in many fields. (IV) 17 appendices to explain, briefly, 266 emerging technologies in each industry to have 360-degree full understanding of computer algebra' technologies. Who This Book Is For Professionals, undergraduate and graduate students, enthusiasts, hobbyists, and those who want to go beyond basic knowledge or information for any kind of computer algebra. |
| computer algebra: Computer Algebra in Scientific Computing François Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsov, 2021-08-16 This book constitutes the proceedings of the 23rd International Workshop on Computer Algebra in Scientific Computing, CASC 2021, held in Sochi, Russia, in September 2021. The 24 full papers presented together with 1 invited talk were carefully reviewed and selected from 40 submissions. The papers cover theoretical computer algebra and its applications in scientific computing. |
| computer algebra: Computer Algebra J. Calmet, 1982-10-08 |
| computer algebra: Some Tapas of Computer Algebra Arjeh M. Cohen, Hans Cuypers, Hans Sterk, 2013-03-09 In the years 1994, 1995, two EIDMA mini courses on Computer Algebra were given at the Eindhoven University of Technology by, apart from ourselves, various invited lecturers. (EIDMA is the Research School 'Euler Institute for Discrete Mathematics and its Applications'.) The idea of the courses was to acquaint young mathematicians with algorithms and software for mathemat ical research and to enable them to incorporate algorithms in their research. A collection of lecture notes was used at these courses. When discussing these courses in comparison with other kinds of courses one might give in a week's time, Joachim Neubüser referred to our courses as 'tapas'. This denomination underlined that the courses consisted of appe tizers for various parts of algorithmic algebra; indeed, we covered such spicy topics as the link between Gröbner bases and integer programming, and the detection of algebraic solutions to differential equations. As a collection, the not es turned out to have some appeal of their own, which is the main reason why the idea came up of transforming them into book form. We feIt however, that the book should be distinguishable from a standard text book on computer algebra in that it retains its appetizing flavour by presenting a variety of topics at an accessible level with a view to recent developments. |
| computer algebra: Boolean Algebra and Its Applications J. Eldon Whitesitt, 2012-05-24 Introductory treatment begins with set theory and fundamentals of Boolean algebra, proceeding to concise accounts of applications to symbolic logic, switching circuits, relay circuits, binary arithmetic, and probability theory. 1961 edition. |
| computer algebra: Computer Algebra Systems Michael J. Wester, 1999-07-16 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. |
| computer algebra: Computational Algebra: Course And Exercises With Solutions Ihsen Yengui, 2021-05-17 This book intends to provide material for a graduate course on computational commutative algebra and algebraic geometry, highlighting potential applications in cryptography. Also, the topics in this book could form the basis of a graduate course that acts as a segue between an introductory algebra course and the more technical topics of commutative algebra and algebraic geometry.This book contains a total of 124 exercises with detailed solutions as well as an important number of examples that illustrate definitions, theorems, and methods. This is very important for students or researchers who are not familiar with the topics discussed. Experience has shown that beginners who want to take their first steps in algebraic geometry are usually discouraged by the difficulty of the proposed exercises and the absence of detailed answers. Therefore, exercises (and their solutions) as well as examples occupy a prominent place in this course.This book is not designed as a comprehensive reference work, but rather as a selective textbook. The many exercises with detailed answers make it suitable for use in both a math or computer science course. |
| computer algebra: Universal Algebra and Applications in Theoretical Computer Science Klaus Denecke, Shelly L. Wismath, 2002-01-18 Over the past 20 years, the emergence of clone theory, hyperequational theory, commutator theory and tame congruence theory has led to a growth of universal algebra both in richness and in applications, especially in computer science. Yet most of the classic books on the subject are long out of print and, to date, no other book has integrated these theories with the long-established work that supports them. Universal Algebra and Applications in Theoretical Computer Science introduces the basic concepts of universal algebra and surveys some of the newer developments in the field. The first half of the book provides a solid grounding in the core material. A leisurely pace, careful exposition, numerous examples, and exercises combine to form an introduction to the subject ideal for beginning graduate students or researchers from other areas. The second half of the book focuses on applications in theoretical computer science and advanced topics, including Mal'cev conditions, tame congruence theory, clones, and commutators. The impact of the advances in universal algebra on computer science is just beginning to be realized, and the field will undoubtedly continue to grow and mature. Universal Algebra and Applications in Theoretical Computer Science forms an outstanding text and offers a unique opportunity to build the foundation needed for further developments in its theory and in its computer science applications. |
| computer algebra: Relativity and Scientific Computing Friedrich W Hehl, Roland A. Puntigam, Hanns Ruder, 2012-12-06 For this set of lectures we assumed that the reader has a reasonable back ground in physics and some knowledge of general relativity, the modern theory of gravity in macrophysics, and cosmology. Computer methods are present ed by leading experts in the three main domains: in numerics, in computer algebra, and in visualization. The idea was that each of these subdisciplines is introduced by an extended set of main lectures and that each is conceived as being of comparable 'importance. Therefpre we believe that the book represents a good introduction into scientific I computing for any student who wants to specialize in relativity, gravitation, and/or astrophysics. We took great care to select lecturers who teach in a comprehensible way and who are, at the same time, at the research front of their respective field. In numerics we had the privilege of having a lecturer from the National Center for Supercomputing Applications (NCSA, Champaign, IL, USA) and some from other leading institutions of the world; visualization was taught by a visualization expert from Boeing; and in com puter algebra we took recourse to practitioners of different computer algebra systems as applied to classical general relativity up to quantum gravity and differential geometry. |
| computer algebra: Universal Algebra for Computer Scientists Wolfgang Wechler, 2012-12-06 A new model-theoretic approach to universal algebra is offered in this book. Written for computer scientists, it presents a systematic development of the methods and results of universal algebra that are useful in a variety of applications in computer science. The notation is simple and the concepts are clearly presented. The book concerns the algebraic characterization of axiomatic classes of algebras (equational, implicational, and universal Horn classes) by closure operators generalizing the famous Birkhoff Variety Theorem, and the algebraic characterization of the related theories. The book also presents a thorough study of term rewriting systems. Besides basic notions, the Knuth-Bendix completion procedure and termination proof methods are considered. A third main topic is that of fixpoint techniques and complete ordered algebras. Algebraic specifications of abstract data types and algebraic semantics of recursive program schemes are treated as applications. The book is self-contained and suitable both as a textbook for graduate courses and as a reference for researchers. |
| computer algebra: The Center and Cyclicity Problems Valery Romanovski, Douglas Shafer, 2009-04-29 Using a computational algebra approach, this comprehensive text addresses the center and cyclicity problems as behaviors of dynamical systems and families of polynomial systems. The book gives the main properties of ideals in polynomial rings and their affine varieties followed by a discussion on the theory of normal forms and stability of differential equations. It contains numerous examples, pseudocode displays of all the computational algorithms, historical notes, nearly two hundred exercises, and an extensive bibliography, making it a suitable graduate textbook as well as research reference. |
| computer algebra: Applications of Computer Algebra Richard Pavelle, 1985 Today, certain computer software systems exist which surpass the computational ability of researchers when their mathematical techniques are applied to many areas of science and engineering. These computer systems can perform a large portion of the calculations seen in mathematical analysis. Despite this massive power, thousands of people use these systems as a routine resource for everyday calculations. These software programs are commonly called Computer Algebra systems. They have names such as MACSYMA, MAPLE, muMATH, REDUCE and SMP. They are receiving credit as a computational aid with in creasing regularity in articles in the scientific and engineering literature. When most people think about computers and scientific research these days, they imagine a machine grinding away, processing numbers arithmetically. It is not generally realized that, for a number of years, computers have been performing non-numeric computations. This means, for example, that one inputs an equa tion and obtains a closed form analytic answer. It is these Computer Algebra systems, their capabilities, and applications which are the subject of the papers in this volume. |
| computer algebra: Computer Algebra With Symbolicc++ Yorick Hardy, Willi-hans Steeb, Kiat Shi Tan, 2008-09-04 This book gives a comprehensive introduction to computer algebra together with advanced topics in this field. It provides a detailed coverage of the mathematics of computer algebra as well as a step-by-step guide to implement a computer algebra system in the object-oriented language C++. The used tools from C++ are introduced in detail.Numerous examples from mathematics, physics and engineering are presented to illustrate the system's capabilities. Computer algebra implementations in LISP and Haskell are also included. In addition, gene expression programming and multiexpression programming with applications to computer algebra are introduced. |
| computer algebra: Modern Computer Algebra Joachim von zur Gathen, Jürgen Gerhard, 2013-04-25 Now in its third edition, this highly successful textbook is widely regarded as the 'bible of computer algebra'. |
| computer algebra: Computer Algebra Systems Victor Aladjev, 2004 Book Description The book represents a library of well-designed software, which well supplements the already available Maple software with the orientation towards the widest circle of the Maple users, greatly enhancing its usability and effectiveness. The current library version contains tools (more than 570 procedures and program modules) that are oriented onto wide enough spheres of computing and information processing. The library is structurally similar to the main Maple library and is supplied with the advanced Help system about the tools located in it. In addition, the library is logically connected with the main Maple library, providing access to the tools contained in it similarly to the package tools. The library will be of special interest above all to those who use Maple of releases 6 - 9.5 not only as a highly intellectual calculator but also as environment for programming of different problems in own professional activities. The represented source codes of the library tools, using both the effective and the non-standard technique, can serve as an useful enough practical programming guide on the Maple language. Author Biography Professor Aladjev V. was born on June 14, 1942 in the town Grodno (Byelorussia). Now, he is the First vice-president of the International Academy of Noosphere and the president of Tallinn Research Group, whose scientific results have received international recognition, first, in the field of mathematical theory of Cellular Automata (CA). He is member of a series of Russian and International Academies. Aladjev V. is the author of more than 300 scientific publications, including 60 books, published in many countries. He participates as a member of the organizing committee and/or a guest lecturer in many international scientific forums in mathematics and cybernetics. Category: NonFiction/Science/Mathematics/Mathematical & Statistical Software/Algebra |
| computer algebra: Applications of Computer Algebra Richard Pavelle, 2012-12-06 Today, certain computer software systems exist which surpass the computational ability of researchers when their mathematical techniques are applied to many areas of science and engineering. These computer systems can perform a large portion of the calculations seen in mathematical analysis. Despite this massive power, thousands of people use these systems as a routine resource for everyday calculations. These software programs are commonly called Computer Algebra systems. They have names such as MACSYMA, MAPLE, muMATH, REDUCE and SMP. They are receiving credit as a computational aid with in creasing regularity in articles in the scientific and engineering literature. When most people think about computers and scientific research these days, they imagine a machine grinding away, processing numbers arithmetically. It is not generally realized that, for a number of years, computers have been performing non-numeric computations. This means, for example, that one inputs an equa tion and obtains a closed form analytic answer. It is these Computer Algebra systems, their capabilities, and applications which are the subject of the papers in this volume. |
Computer | Definition, History, Operating Systems, & Facts
A computer is a programmable device for processing, storing, and displaying information. Learn more in this article about modern digital electronic computers and their design, constituent …
Computer - History, Technology, Innovation | Britannica
Computer - History, Technology, Innovation: A computer might be described with deceptive simplicity as “an apparatus that performs routine calculations automatically.” Such a definition …
Computer - Technology, Invention, History | Britannica
Apr 14, 2025 · Computer - Technology, Invention, History: By the second decade of the 19th century, a number of ideas necessary for the invention of the computer were in the air. First, …
computer - Kids | Britannica Kids | Homework Help
A computer is a device for working with information. The information can be numbers, words, pictures, movies, or sounds. Computer information is also called data.
Personal computer (PC) | Definition, History, & Facts | Britannica
6 days ago · Personal computer, a digital computer designed for use by only one person at a time. A typical personal computer assemblage consists of a central processing unit, which contains …
Computer science | Definition, Types, & Facts | Britannica
May 29, 2025 · Computer science is the study of computers and computing, including their theoretical and algorithmic foundations, hardware and software, and their uses for processing …
Computer - Memory, Storage, Processing | Britannica
Computer - Memory, Storage, Processing: The earliest forms of computer main memory were mercury delay lines, which were tubes of mercury that stored data as ultrasonic waves, and …
Digital computer | Evolution, Components, & Features | Britannica
digital computer, any of a class of devices capable of solving problems by processing information in discrete form. It operates on data, including magnitudes, letters, and symbols, that are …
Computer - Supercomputing, Processing, Speed | Britannica
Apr 14, 2025 · Computer - Supercomputing, Processing, Speed: The most powerful computers of the day have typically been called supercomputers. They have historically been very …
Computer programming language | Types & Examples | Britannica
May 13, 2025 · Computer programming language, any of various languages for expressing a set of detailed instructions for a computer. The earliest programming languages were assembly …
Computer | Definition, History, Operating Systems, & Facts
A computer is a programmable device for processing, storing, and displaying information. Learn more in this article about modern digital electronic computers and their design, constituent …
Computer - History, Technology, Innovation | Britannica
Computer - History, Technology, Innovation: A computer might be described with deceptive simplicity as “an apparatus that performs routine calculations automatically.” Such a definition …
Computer - Technology, Invention, History | Britannica
Apr 14, 2025 · Computer - Technology, Invention, History: By the second decade of the 19th century, a number of ideas necessary for the invention of the computer were in the air. First, …
computer - Kids | Britannica Kids | Homework Help
A computer is a device for working with information. The information can be numbers, words, pictures, movies, or sounds. Computer information is also called data.
Personal computer (PC) | Definition, History, & Facts | Britannica
6 days ago · Personal computer, a digital computer designed for use by only one person at a time. A typical personal computer assemblage consists of a central processing unit, which contains …
Computer science | Definition, Types, & Facts | Britannica
May 29, 2025 · Computer science is the study of computers and computing, including their theoretical and algorithmic foundations, hardware and software, and their uses for processing …
Computer - Memory, Storage, Processing | Britannica
Computer - Memory, Storage, Processing: The earliest forms of computer main memory were mercury delay lines, which were tubes of mercury that stored data as ultrasonic waves, and …
Digital computer | Evolution, Components, & Features | Britannica
digital computer, any of a class of devices capable of solving problems by processing information in discrete form. It operates on data, including magnitudes, letters, and symbols, that are …
Computer - Supercomputing, Processing, Speed | Britannica
Apr 14, 2025 · Computer - Supercomputing, Processing, Speed: The most powerful computers of the day have typically been called supercomputers. They have historically been very …
Computer programming language | Types & Examples | Britannica
May 13, 2025 · Computer programming language, any of various languages for expressing a set of detailed instructions for a computer. The earliest programming languages were assembly …
