Bültmann & Gerriets
Space-Filling Curves
An Introduction with Applications in Scientific Computing
von Michael Bader
Verlag: Springer Berlin Heidelberg
Reihe: Texts in Computational Science and Engineering Nr. 9
E-Book / PDF
Kopierschutz: PDF mit Wasserzeichen

Hinweis: Nach dem Checkout (Kasse) wird direkt ein Link zum Download bereitgestellt. Der Link kann dann auf PC, Smartphone oder E-Book-Reader ausgeführt werden.
E-Books können per PayPal bezahlt werden. Wenn Sie E-Books per Rechnung bezahlen möchten, kontaktieren Sie uns bitte.

ISBN: 978-3-642-31046-1
Auflage: 2013
Erschienen am 13.10.2012
Sprache: Englisch
Umfang: 285 Seiten

Preis: 96,29 €

Biografische Anmerkung
Inhaltsverzeichnis
Klappentext

Michael Bader is professor for computer science at Technische Universität München, where he leads a research group on hardware-aware algorithms and software for high performance computing (located at the Leibniz Supercomputing Centre). His focus in research and teaching is on algorithmic challenges imposed by modern
computing platforms. A large part of his work is dedicated to exploiting locality properties of space-filling curves for simulation tasks in science and engineering.





Two Motivating Examples.- How to Construct Space-Filling Curves.- Grammar-Based Description of Space-Filling Curves.- Arithmetic Representation of Space-Filling Curves.- Approximating Polygons.- Sierpinski Curves.- Further Space-Filling Curves.- Space-Filling Curves in 3D.- Refinement Trees and Space-Filling Curves.- Parallelisation with Space-Filling Curves.- Locality Properties of Space-Filling Curves.- Sierpinski Curves on Triangular and Tetrahedral Meshes.- Case Study: Cache Efficient Algorithms for Matrix Operations.- Case Study: Numerical Simulation on Spacetree Grids Using Space-Filling Curves.- Further Applications of Space-Filling Curves.- Solutions to Selected Exercises.- References.- Index 
¿



­The present book provides an introduction to using space-filling curves (SFC) as tools in scientific computing. Special focus is laid on the representation of SFC and on resulting algorithms. For example, grammar-based techniques are introduced for traversals of Cartesian and octree-type meshes, and arithmetisation of SFC is explained to compute SFC mappings and indexings.

­

The locality properties of SFC are discussed in detail, together with their importance for algorithms. Templates for parallelisation and cache-efficient algorithms are presented to reflect the most important applications of SFC in scientific computing. Special attention is also given to the interplay of adaptive mesh refinement and SFC, including the structured refinement of triangular and tetrahedral grids. For each topic, a short overview is given on the most important publications and recent research activities.


andere Formate
weitere Titel der Reihe