Discrete Calculus
applied analysis on graphs for computational science
$558.41
- Hardcover
366 pages
- Release Date
2 August 2010
Summary
The goal of this book is to present the topic of discrete calculus to scientists and - gineers and to show how the theory can be applied to solving a wide variety of re- world problems. We feel that discrete calculus allows us to unify many approaches to data analysis and content extraction while being accessible enough to be widely applied in many ?elds and disciplines. This project initially began as a tutorial on discrete calculus and its applications, and we hope that this work can provid…
Book Details
| ISBN-13: | 9781849962896 |
|---|---|
| ISBN-10: | 1849962898 |
| Author: | Leo J. Grady, Jonathan R. Polimeni |
| Publisher: | Springer London Ltd |
| Imprint: | Springer London Ltd |
| Format: | Hardcover |
| Number of Pages: | 366 |
| Edition: | 2010th |
| Release Date: | 2 August 2010 |
| Weight: | 811g |
| Dimensions: | 235mm x 155mm |
You Can Find This Book In
What They're Saying
Critics Review
From the reviews:
“The book introduces some best practices and advanced techniques in the field of discrete calculus. The articles are written by a team of experts in the field and are aimed at scientists and engineers. The book shows how the theory can be applied to solving a wide variety of real-world problems. … All the examples are well described and illustrated with source code and screen shots. I recommend this book to anyone interested in discrete calculus and its application.” (Todor Jordanov Todorov, Mathematical Reviews, Issue 2012 d)
“This book illustrates the concepts of discrete calculus with examples in circuit theory, chosen because of its natural connection to algebraic topology and maturity. … this is a unique book that brings together research in complex networks and algorithm content extraction. I have no doubt that the book will be a valuable addition to the libraries of many researchers and graduate students working in the areas of complex networks, graphics, and algorithm design.” (Alexander Tzanov, ACM Computing Reviews, July, 2011)
Returns
This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.