Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems / Edition 1

Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems / Edition 1

by Mario Bebendorf
ISBN-10:
3540771468
ISBN-13:
9783540771463
Pub. Date:
06/10/2008
Publisher:
Springer Berlin Heidelberg
ISBN-10:
3540771468
ISBN-13:
9783540771463
Pub. Date:
06/10/2008
Publisher:
Springer Berlin Heidelberg
Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems / Edition 1

Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems / Edition 1

by Mario Bebendorf

Paperback

$179.99
Current price is , Original price is $179.99. You
$179.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.


Overview

Hierarchical matrices are an efficient framework for large-scale fully populated matrices arising, e.g., from the finite element discretization of solution operators of elliptic boundary value problems. In addition to storing such matrices, approximations of the usual matrix operations can be computed with logarithmic-linear complexity, which can be exploited to setup approximate preconditioners in an efficient and convenient way. Besides the algorithmic aspects of hierarchical matrices, the main aim of this book is to present their theoretical background.

The book contains the existing approximation theory for elliptic problems including partial differential operators with nonsmooth coefficients. Furthermore, it presents in full detail the adaptive cross approximation method for the efficient treatment of integral operators with non-local kernel functions. The theory is supported by many numerical experiments from real applications.


Product Details

ISBN-13: 9783540771463
Publisher: Springer Berlin Heidelberg
Publication date: 06/10/2008
Series: Lecture Notes in Computational Science and Engineering , #63
Edition description: 2008
Pages: 296
Product dimensions: 6.00(w) x 9.30(h) x 0.80(d)

Table of Contents

Low-Rank Matrices and Matrix Partitioning.- Hierarchical Matrices.- Approximation of Discrete Integral Operators.- Application to Finite Element Discretizations.
From the B&N Reads Blog

Customer Reviews