FREE SHIPPING on Orders of $40 or More!
Lx = b
The ability to solve a system of linear equations lies at the heart of areas like optimization, scientific computing, and computer science and has traditionally been a central topic of research in the area of numerical linear algebra. An important class of instances that arise in practice has the form Lx=b where L is the Laplacian of an undirected graph. After decades of sustained research and combining tools from disparate areas, we now have Laplacian solvers that run in time nearly-linear in the sparsity of the system, which is a distant goal for general systems. Surprisingly, Laplacian solvers are impacting the theory of fast algorithms for fundamental graph problems. In this monograph, the emerging paradigm of employing Laplacian solvers to design novel fast algorithms for graph problems is illustrated through a small but carefully chosen set of examples. A significant part of this monograph is also dedicated to developing the ideas that go into the construction of near-linear time Laplacian solvers. An understanding of these methods, which marry techniques from linear algebra and graph theory, will not only enrich the tool-set of an algorithm designer but will also provide the ability to adapt these methods to design fast algorithms for other fundamental problems. This monograph can be used as the text for a graduate-level course, or act as a supplement to a course on spectral graph theory or algorithms. The writing style, which deliberately emphasizes the presentation of key ideas over rigor, will make it accessible to advanced undergraduates.
1301763038
Lx = b
The ability to solve a system of linear equations lies at the heart of areas like optimization, scientific computing, and computer science and has traditionally been a central topic of research in the area of numerical linear algebra. An important class of instances that arise in practice has the form Lx=b where L is the Laplacian of an undirected graph. After decades of sustained research and combining tools from disparate areas, we now have Laplacian solvers that run in time nearly-linear in the sparsity of the system, which is a distant goal for general systems. Surprisingly, Laplacian solvers are impacting the theory of fast algorithms for fundamental graph problems. In this monograph, the emerging paradigm of employing Laplacian solvers to design novel fast algorithms for graph problems is illustrated through a small but carefully chosen set of examples. A significant part of this monograph is also dedicated to developing the ideas that go into the construction of near-linear time Laplacian solvers. An understanding of these methods, which marry techniques from linear algebra and graph theory, will not only enrich the tool-set of an algorithm designer but will also provide the ability to adapt these methods to design fast algorithms for other fundamental problems. This monograph can be used as the text for a graduate-level course, or act as a supplement to a course on spectral graph theory or algorithms. The writing style, which deliberately emphasizes the presentation of key ideas over rigor, will make it accessible to advanced undergraduates.
99.0 Out Of Stock
Lx = b

Lx = b

by Nisheeth K. Vishnoi
Lx = b

Lx = b

by Nisheeth K. Vishnoi

Overview

The ability to solve a system of linear equations lies at the heart of areas like optimization, scientific computing, and computer science and has traditionally been a central topic of research in the area of numerical linear algebra. An important class of instances that arise in practice has the form Lx=b where L is the Laplacian of an undirected graph. After decades of sustained research and combining tools from disparate areas, we now have Laplacian solvers that run in time nearly-linear in the sparsity of the system, which is a distant goal for general systems. Surprisingly, Laplacian solvers are impacting the theory of fast algorithms for fundamental graph problems. In this monograph, the emerging paradigm of employing Laplacian solvers to design novel fast algorithms for graph problems is illustrated through a small but carefully chosen set of examples. A significant part of this monograph is also dedicated to developing the ideas that go into the construction of near-linear time Laplacian solvers. An understanding of these methods, which marry techniques from linear algebra and graph theory, will not only enrich the tool-set of an algorithm designer but will also provide the ability to adapt these methods to design fast algorithms for other fundamental problems. This monograph can be used as the text for a graduate-level course, or act as a supplement to a course on spectral graph theory or algorithms. The writing style, which deliberately emphasizes the presentation of key ideas over rigor, will make it accessible to advanced undergraduates.

Product Details

ISBN-13: 9781601989468
Publisher: Now Publishers
Publication date: 05/23/2013
Series: Foundations and Trends in Theoretical Computer Science Series , #22
Pages: 168
Product dimensions: 6.14(w) x 9.21(h) x 0.36(d)

Table of Contents

Notation 1: Introduction. Part I Basics 2: Basic Linear Algebra 3: The Graph Laplacian 4: Laplacian Systems and Solvers 5: Graphs as Electrical Networks Part II Applications 6: Graph Partitioning I The Normalized Laplacian 7: Graph Partitioning II A Spectral Algorithm for Conductance 8: Graph Partitioning III Balanced Cuts 9: Graph Partitioning IV Computing the Second Eigenvector 10: The Matrix Exponential and Random Walks 11: Graph Sparsification I Sparsification via Effective Resistances 11: Graph Sparsification II Computing Electrical Quantities 13: Cuts and Flows. Part III Tools 14: Cholesky Decomposition Based Linear Solvers 15: Iterative Linear Solvers I The Kaczmarz Method 16: Iterative Linear Solvers II The Gradient Method 17: Iterative Linear Solvers III The Conjugate Gradient Method 18: Preconditioning for Laplacian Systems 19: Solving a Laplacian System in Õ(m) Time 20: Beyond Ax=b The Lanczos Method 20: References.
From the B&N Reads Blog
Page 1 of

Customer Reviews