Computer Algebra in Scientific Computing

Computer Algebra in Scientific Computing

Author: Vladimir P. Gerdt

Publisher: Springer

Published: 2012-08-30

Total Pages: 374

ISBN-13: 364232973X

DOWNLOAD EBOOK

This book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2012, held in Maribor, Slovenia, in September 2012. The 28 full papers presented were carefully reviewed and selected for inclusion in this book. One of the main themes of the CASC workshop series, namely polynomial algebra, is represented by contributions devoted to new algorithms for computing comprehensive Gröbner and involutive systems, parallelization of the Gröbner bases computation, the study of quasi-stable polynomial ideals, new algorithms to compute the Jacobson form of a matrix of Ore polynomials, a recursive Leverrier algorithm for inversion of dense matrices whose entries are monic polynomials, root isolation of zero-dimensional triangular polynomial systems, optimal computation of the third power of a long integer, investigation of the complexity of solving systems with few independent monomials, the study of ill-conditioned polynomial systems, a method for polynomial root-finding via eigen-solving and randomization, an algorithm for fast dense polynomial multiplication with Java using the new opaque typed method, and sparse polynomial powering using heaps.


Latest Advances in Symbolic Algorithms

Latest Advances in Symbolic Algorithms

Author: Ilias Kotsireas

Publisher: World Scientific

Published: 2007

Total Pages: 220

ISBN-13: 9812778853

DOWNLOAD EBOOK

Written by world-renowned experts, the book is a collection of tutorial presentations and research papers catering to the latest advances in symbolic summation, factorization, symbolic-numeric linear algebra and linear functional equations. The papers were presented at a workshop celebrating the 60th birthday of Sergei Abramov (Russia), whose highly influential contributions to symbolic methods are adopted in many leading computer algebra systems.


Computer Algebra 2006

Computer Algebra 2006

Author: Ilias Kotsireas

Publisher: World Scientific

Published: 2007

Total Pages: 220

ISBN-13: 9812702008

DOWNLOAD EBOOK

Written by world-renowned experts, the book is a collection of tutorial presentations and research papers catering to the latest advances in symbolic summation, factorization, symbolic-numeric linear algebra and linear functional equations. The papers were presented at a workshop celebrating the 60th birthday of Sergei Abramov (Russia), whose highly influential contributions to symbolic methods are adopted in many leading computer algebra systems.


Computer Algebra in Scientific Computing

Computer Algebra in Scientific Computing

Author: François Boulier

Publisher: Springer Nature

Published: 2020-10-17

Total Pages: 644

ISBN-13: 3030600262

DOWNLOAD EBOOK

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 and Polynomials

Computer Algebra and Polynomials

Author: Jaime Gutierrez

Publisher: Springer

Published: 2015-01-20

Total Pages: 222

ISBN-13: 3319150812

DOWNLOAD EBOOK

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.


Numerical and Symbolic Scientific Computing

Numerical and Symbolic Scientific Computing

Author: Ulrich Langer

Publisher: Springer Science & Business Media

Published: 2011-11-19

Total Pages: 361

ISBN-13: 3709107946

DOWNLOAD EBOOK

The book presents the state of the art and results and also includes articles pointing to future developments. Most of the articles center around the theme of linear partial differential equations. Major aspects are fast solvers in elastoplasticity, symbolic analysis for boundary problems, symbolic treatment of operators, computer algebra, and finite element methods, a symbolic approach to finite difference schemes, cylindrical algebraic decomposition and local Fourier analysis, and white noise analysis for stochastic partial differential equations. Further numerical-symbolic topics range from applied and computational geometry to computer algebra methods used for total variation energy minimization.


Computer Mathematics

Computer Mathematics

Author: Ruyong Feng

Publisher: Springer

Published: 2014-09-30

Total Pages: 498

ISBN-13: 3662437996

DOWNLOAD EBOOK

This book covers original research and the latest advances in symbolic, algebraic and geometric computation; computational methods for differential and difference equations, symbolic-numerical computation; mathematics software design and implementation; and scientific and engineering applications based on features, invited talks, special sessions and contributed papers presented at the 9th (in Fukuoka, Japan in 2009) and 10th (in Beijing China in 2012) Asian Symposium on Computer Mathematics (ASCM). Thirty selected and refereed articles in the book present the conference participants’ ideas and views on researching mathematics using computers.


Matrices and Matroids for Systems Analysis

Matrices and Matroids for Systems Analysis

Author: Kazuo Murota

Publisher: Springer Science & Business Media

Published: 2009-10-27

Total Pages: 491

ISBN-13: 3642039944

DOWNLOAD EBOOK

A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis. This book serves also as a comprehensive presentation of the theory and application of mixed matrices, developed primarily by the present author in the 1990's. A mixed matrix is a convenient mathematical tool for systems analysis, compatible with the physical observation that "fixed constants" and "system parameters" are to be distinguished in the description of engineering systems. This book will be extremely useful to graduate students and researchers in engineering, mathematics and computer science. From the reviews: "...The book has been prepared very carefully, contains a lot of interesting results and is highly recommended for graduate and postgraduate students." András Recski, Mathematical Reviews Clippings 2000m:93006


Modular Forms, a Computational Approach

Modular Forms, a Computational Approach

Author: William A. Stein

Publisher: American Mathematical Soc.

Published: 2007-02-13

Total Pages: 290

ISBN-13: 0821839608

DOWNLOAD EBOOK

This marvellous and highly original book fills a significant gap in the extensive literature on classical modular forms. This is not just yet another introductory text to this theory, though it could certainly be used as such in conjunction with more traditional treatments. Its novelty lies in its computational emphasis throughout: Stein not only defines what modular forms are, but shows in illuminating detail how one can compute everything about them in practice. This is illustrated throughout the book with examples from his own (entirely free) software package SAGE, which really bring the subject to life while not detracting in any way from its theoretical beauty. The author is the leading expert in computations with modular forms, and what he says on this subject is all tried and tested and based on his extensive experience. As well as being an invaluable companion to those learning the theory in a more traditional way, this book will be a great help to those who wish to use modular forms in applications, such as in the explicit solution of Diophantine equations. There is also a useful Appendix by Gunnells on extensions to more general modular forms, which has enough in it to inspire many PhD theses for years to come. While the book's main readership will be graduate students in number theory, it will also be accessible to advanced undergraduates and useful to both specialists and non-specialists in number theory. --John E. Cremona, University of Nottingham William Stein is an associate professor of mathematics at the University of Washington at Seattle. He earned a PhD in mathematics from UC Berkeley and has held positions at Harvard University and UC San Diego. His current research interests lie in modular forms, elliptic curves, and computational mathematics.