Logo

A=B by Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger

Large book cover: A=B

A=B
by

Publisher: AK Peters, Ltd.
ISBN/ASIN: 1568810636
ISBN-13: 9781568810638
Number of pages: 217

Description:
This book introduces the idea of hypergeometric function, the Swiss army knife of combinatorial mathematics, and proceeds to develop algorithms for their computation as well as numerous applications. The authors also reveal what, exactly, computers can help us to decide, what is a "closed form" solution, what are "canonical" and "normal" forms, and inject relevant philosophical digressions that keep the discussions lively and entertaining. The authors also present snippets of "Mathematica" code so that you can try out many of the basic operations yourself.

Home page url

Download or read it online for free here:
Download link
(1.2MB, PDF)

Similar books

Book cover: Algorithms for Modular Elliptic CurvesAlgorithms for Modular Elliptic Curves
by - Cambridge University Press
The author describes the construction of modular elliptic curves giving an algorithm for their computation. Then algorithms for the arithmetic of elliptic curves are presented. Finally, the results of the implementations of the algorithms are given.
(10938 views)
Book cover: Search Algorithms and ApplicationsSearch Algorithms and Applications
by - InTech
This book demonstrates the applicability of search algorithms for the purpose of developing solutions to problems that arise in a variety of domains. It is targeted to a wide group of readers: researchers, graduate students, and practitioners.
(9479 views)
Book cover: Computer Arithmetic of Geometrical Figures: Algorithms and Hardware DesignComputer Arithmetic of Geometrical Figures: Algorithms and Hardware Design
by - MiC
This book describes various processors, designed for affine transformations of many-dimensional figures -- planar and spatial. Designed for students, engineers and developers, who intend to use the computer arithmetic of geometrical figures.
(5402 views)
Book cover: Design and Analysis of Computer AlgorithmsDesign and Analysis of Computer Algorithms
by - University of Maryland
The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.
(12043 views)