Normal view MARC view ISBD view

Hierarchical Matrices [electronic resource] :A Means to Efficiently Solve Elliptic Boundary Value Problems / by Mario Bebendorf.

by Bebendorf, Mario [author.]; SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computational Science and Engineering: 63Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.Description: XVI, 296 p. online resource.ISBN: 9783540771470.Subject(s): Mathematics | Differential equations, partial | Computer science -- Mathematics | Numerical analysis | Mathematics | Computational Mathematics and Numerical Analysis | Numerical Analysis | Partial Differential EquationsDDC classification: 518 | 518 Online resources: Click here to access online
Contents:
Low-Rank Matrices and Matrix Partitioning -- Hierarchical Matrices -- Approximation of Discrete Integral Operators -- Application to Finite Element Discretizations.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode
MAIN LIBRARY
QA71-90 (Browse shelf) Available

Low-Rank Matrices and Matrix Partitioning -- Hierarchical Matrices -- Approximation of Discrete Integral Operators -- Application to Finite Element Discretizations.

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.

There are no comments for this item.

Log in to your account to post a comment.
@ Jomo Kenyatta University Of Agriculture and Technology Library

Powered by Koha