Könyv Discrete Calculus Leo J. Grady

Discrete Calculus

Applied Analysis on Graphs for Computational Science

Nyelv: Angol
Kötés: Kemény kötésű
Elérhetőség: Beszállítói készleten
Küldés 10-13 napon belül
69 465 Ft
The field of discrete calculus, also known as "discrete exterior calculus", focuses on finding a pro...

Információk a könyvről

Nyelv
Angol
Kötés
Könyv - Kemény kötésű
Kiadva
2010
oldal
366
EAN
9781849962896
ISBN
1849962898
Enbook ID
01434407
Súly
811
Méretek
155 x 235 x 28

Teljes leírás

The field of discrete calculus, also known as "discrete exterior calculus", focuses on finding a proper set of definitions and differential operators that make it possible to operate the machinery of multivariate calculus on a finite, discrete space. In contrast to traditional goals of finding an accurate discretization of conventional multivariate calculus, discrete calculus establishes a separate, equivalent calculus that operates purely in the discrete space without any reference to an underlying continuous process.§This unique text brings together into a single framework current research in the three areas of discrete calculus, complex networks, and algorithmic content extraction. Although there have been a few intersections in the literature between these disciplines, they have developed largely independently of one another, yet researchers working in any one of these three areas can strongly benefit from the tools and techniques being used in the others. Many example applications from several fields of computational science are provided to demonstrate the usefulness of this framework to a broad range of problems. Readers are assumed to be familiar with the basics of vector calculus, graph theory, and linear algebra.§Topics and features:Presents a thorough review of discrete calculus, with a focus on key concepts required for successful application§Unifies many standard image processing algorithms into a common framework for viewing a wide variety of standard algorithms in filtering, clustering, and manifold learning that may be applied to processing data associated with a graph or network§Explains how discrete calculus provides a natural definition of "low-frequency" on a graph, which then yields filtering and denoising algorithms§Discusses how filtering algorithms can give rise to clustering algorithms, which can be used to develop manifold learning and data discovery methods§Examines ranking algorithms, as well as algorithms for analyzing the structure of a network§Graduate students and researchers interested in discrete calculus, complex networks, image processing and computer graphics will find this text/reference a clear introduction to the foundations of discrete calculus as well as a useful guide to have readily available for their work.§Dr. Leo J. Grady is a Senior Research Scientist with Siemens Corporate Research in Princeton, New Jersey, USA. Dr. Jonathan R. Polimeni is a Research Fellow at the Massachusetts General Hospital in Boston, Massachusetts, USA, and Instructor in Radiology at Harvard Medical School, Boston, Massachusetts, USA.

Érdekelheti

Tired But Wired

NERINA RAMLAKHAN
5 151 Ft
8 944 Ft
6 821 Ft
7 459 Ft

Soccer Longshot

C. J. Renner
9 286 Ft
12 485 Ft
2 438 Ft

ROTTERS

Carl R. Cart
4 522 Ft

Forestry in Norway

John Croumbie Brown
7 446 Ft
9 443 Ft

Temperance

Henry Anderton
6 092 Ft

Spanking Aunts

Catherine De Bourg
4 765 Ft
3 640 Ft

SINGERS MUSIC THEATRE V3 MEZSOP 2CD

Hal Leonard Publishing Corporation
7 459 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

4 252 Ft

Kód diabetu

Jason Fung
6 164 Ft
15 108 Ft

Křížová cesta

Rudolf Brančovský
3 766 Ft
4 139 Ft
7 234 Ft

Tun!

Mieke Mosmuller
5 822 Ft
9 075 Ft

Jollypower

Alessandro "Jolly" Lamberti
15 364 Ft

Troll

Michal Hvorecky
5 309 Ft
10 685 Ft

Proud času

Zdeněk Stříbrný
3 667 Ft

Aeneis

ergil
5 435 Ft
11 171 Ft

Diagnostik

Othmar Mäser
10 145 Ft
19 904 Ft
2 911 Ft