This book presents contributions of international and local experts from the African Institute for Mathematical Sciences (AIMS-Cameroon) and also from other local universities in the domain of orthogonal polynomials and applications. The topics addressed range from univariate to multivariate orthogonal polynomials, from multiple orthogonal polynomials and random matrices to orthogonal polynomials and Painleve equations. The contributions are based on lectures given at the AIMS-Volkswagen Stiftung Workshop on Introduction of Orthogonal Polynomials and Applications held on October 5-12, 2018 in Douala, Cameroon. This workshop, funded within the framework of the Volkswagen Foundation Initiative "Symposia and Summer Schools", was aimed globally at promoting capacity building in terms of research and training in orthogonal polynomials and applications, discussions and development of new ideas as well as development and enhancement of networking including south-south cooperation.

This book presents contributions of international and local experts from the African Institute for Mathematical Sciences (AIMS-Cameroon) and also from other local universities in the domain of orthogonal polynomials and applications. The topics addressed range from univariate to multivariate orthogonal polynomials, from multiple orthogonal polynomials and random matrices to orthogonal polynomials and Painleve equations. The contributions are based on lectures given at the AIMS-Volkswagen Stiftung Workshop on Introduction of Orthogonal Polynomials and Applications held on October 5-12, 2018 in Douala, Cameroon. This workshop, funded within the framework of the Volkswagen Foundation Initiative "Symposia and Summer Schools", was aimed globally at promoting capacity building in terms of research and training in orthogonal polynomials and applications, discussions and development of new ideas as well as development and enhancement of networking including south-south cooperation.

This book constitutes the proceedings of the 16th International Workshop on Computer Algebra in Scientific Computing, CASC 2014, held in Warsaw, Poland, in September 2014. The 33 full papers presented were carefully reviewed and selected for inclusion in this book. The papers address issues such as Studies in polynomial algebra are represented by contributions devoted to factoring sparse bivariate polynomials using the priority queue, the construction of irreducible polynomials by using the Newton index, real polynomial root finding by means of matrix and polynomial iterations, application of the eigenvalue method with symmetry for solving polynomial systems arising in the vibration analysis of mechanical structures with symmetry properties, application of Groebner systems for computing the (absolute) reduction number of polynomial ideals, the application of cylindrical algebraic decomposition for solving the quantifier elimination problems, certification of approximate roots of overdetermined and singular polynomial systems via the recovery of an exact rational univariate representation from approximate numerical data, new parallel algorithms for operations on univariate polynomials (multi-point evaluation, interpolation) based on subproduct tree techniques.

Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are developed here and carefully implemented in the computer algebra system Maple (TM). The algorithms of Fasenmyer, Gosper, Zeilberger, Petkovsek and van Hoeij for hypergeometric summation and recurrence equations, efficient multivariate summation as well as q-analogues of the above algorithms are covered. Similar algorithms concerning differential equations are considered. An equivalent theory of hyperexponential integration due to Almkvist and Zeilberger completes the book. The combination of these results gives orthogonal polynomials and (hypergeometric and q-hypergeometric) special functions a solid algorithmic foundation. Hence, many examples from this very active field are given. The materials covered are suitable for an introductory course on algorithmic summation and will appeal to students and researchers alike.

This book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2013, held in Berlin, Germany, in September 2013. The 33 full papers presented were carefully reviewed and selected for inclusion in this book.

The papers address issues such as polynomial algebra; the solution of tropical linear systems and tropical polynomial systems; the theory of matrices; the use of computer algebra for the investigation of various mathematical and applied topics related to ordinary differential equations (ODEs); applications of symbolic computations for solving partial differential equations (PDEs) in mathematical physics; problems arising at the application of computer algebra methods for finding infinitesimal symmetries; applications of symbolic and symbolic-numeric algorithms in mechanics and physics; automatic differentiation; the application of the CAS Mathematica for the simulation of quantum error correction in quantum computing; the application of the CAS GAP for the enumeration of Schur rings over the group A5; constructive computation of zero separation bounds for arithmetic expressions; the parallel implementation of fast Fourier transforms with the aid of the Spiral library generation system; the use of object-oriented languages such as Java or Scala for implementation of categories as type classes; a survey of industrial applications of approximate computer algebra.

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 Groebner and involutive systems, parallelization of the Groebner 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.

This book constitutes the refereed proceedings of the 13th International Workshop on Computer Algebra in Scientific Computing, CASC 2011, held in Kassel, Germany, in September 2011. The 26 full papers included in the book were carefully reviewed and selected from numerous submissions. The articles are organized in topical sections on the development of object oriented computer algebra software for the modeling of algebraic structures as typed objects; matrix algorithms; the investigation with the aid of computer algebra; the development of symbolic-numerical algorithms; and the application of symbolic computations in applied problems of physics, mechanics, social science, and engineering.

This book constitutes the refereed proceedings of the 21st International Workshop on Computer Algebra in Scientific Computing, CASC 2019, held in Moscow, Russia, in August 2019. The 28 full papers presented together with 2 invited talks were carefully reviewed and selected from 44 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 CASs in the investigation and solution of celestial mechanics problems, and in mechanics, physics, and robotics.

This book constitutes the proceedings of the 20th International Workshop on Computer Algebra in Scientific Computing, CASC 2018, held in Lille, France, in September 2018. The 24 full papers of this volume presented with an abstract of an invited talk and one paper corresponding to another invited talk were carefully reviewed and selected from 29 submissions. They deal with cutting-edge research in all major disciplines of computer algebra in sciences such as physics, chemistry, life sciences, and engineering. Chapter "Positive Solutions of Systems of Signed Parametric Polynomial Inequalities" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

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.

This book constitutes the proceedings of the 19th International Workshop on Computer Algebra in Scientific Computing, CASC 2017, held in Beijing, China, in September 2017. The 28 full papers presented in this volume were carefully reviewed and selected from 33 submissions. They deal with cutting-edge research in all major disciplines of Computer Algebra.

This book constitutes the proceedings of the 18th International Workshop on Computer Algebra in Scientific Computing, CASC 2016, held in Bucharest, Romania, in September 2016. The 32 papers presented in this volume were carefully reviewed and selected from 39 submissions. They deal with cutting-edge research in all major disciplines of Computer Algebra.

Der Tagungsband gibt einen breiten Uberblick uber Ziele, Kursszenarien und Lehr-Lernkonzepte, Unterstutzungsmassnahmen in der Studieneingangsphase, Moglichkeiten des Assessments und der Diagnostik sowie einen Ausblick zur Zukunft von mathematischen Vor- und Bruckenkursen. Zudem werden aktuelle Vor- und Bruckenkursprojekte vorgestellt und der aktuelle empirische und theoretisch-konzeptionelle didaktische Forschungsstand in diesem Bereich abgebildet. "

Computeralgebra-Systeme spielen in Zukunft im Mathematikunterricht der Sekundarstufe II eine wichtige Rolle. Dieses Buch ist auf den Schulstoff der Sekundarstufe II ausgerichtet und richtet sich an Lehramtsstudenten und interessierte Lehrer, die sich in das Programm DERIVE einarbeiten mochten, um es dann im Unterricht, insbesondere in Leistungskursen Mathematik, zu verwenden."

Dieses Lehrbuch gibt eine Einfuhrung in das moderne Gebiet der Computeralgebra. Wahrend die ersten 9 Kapitel den Standardkanon abdecken, werden in den restlichen 3 Kapiteln Themen behandelt, welche in dieser Form noch nicht in Lehrbuchform erschienen sind und sich fur eine weiterfuhrende Vorlesung anbieten.
Die betrachteten Algorithmen werden in Sitzungen mit dem Computeralgebrasystem Mathematica programmiert und getestet. Alle Sitzungen werden alternativ auch als Worksheets fur Maple und MuPAD im Internet bereitgestellt, so dass Mathematica ganzlich durch Maple oder MuPAD ersetzt werden kann.
Durch die Verwendung realer Implementierungen anstelle von Pseudocode werden die betrachteten Algorithmen sofort anwendbar und uberprufbar.
Kenntnisse der hoheren Algebra werden nicht vorausgesetzt, dennoch werden alle Beweise gefuhrt. Da das Buch elementar gehalten ist und einen sehr ausfuhrlichen Index besitzt, ist es auch als Nachschlagewerk uber Algorithmen der Computeralgebra gut geeignet."

Dieses Lehrbuch fuhrt prazise, exakt und in leicht nachvollziehbaren Schritten in den Aufbau der reellen Zahlen ein. Es ist daher die ideale Erganzung zur Analysisvorlesung und bestens geeignet fur ein Proseminar uber reelle Zahlen. Zunachst wird eine axiomatische Charakterisierung erstellt. Mit drei verschiedenen Konstruktionen wird dann das facettenreiche Bild der reellen Zahlen entwickelt. Am Beispiel der metrischen Raume wird die Moglichkeit der Verallgemeinerung bewahrter Konvergenzkonzepte aufgezeigt, wobei die Cantorkonstruktion eine wichtige Rolle spielt. Mit der ebenso vertrauten wie praktisch nutzlichen Dezimaldarstellung der reellen Zahlen schliesst das Buch."