Hierarchical Matrices A Means To Efficiently Solve Elliptic Boundary Value Problems 2008 Edition at Meripustak

Hierarchical Matrices A Means To Efficiently Solve Elliptic Boundary Value Problems 2008 Edition

Books from same Author: Mario Bebendorf

Books from same Publisher: Springer

Related Category: Author List / Publisher List


  • Retail Price: ₹ 16047/- [ 0.00% off ]

    Seller Price: ₹ 16047

Sold By: T K Pandey      Click for Bulk Order

Offer 1: Get ₹ 111 extra discount on minimum ₹ 500 [Use Code: Bharat]

Offer 2: Get 0.00 % + Flat ₹ 100 discount on shopping of ₹ 1500 [Use Code: IND100]

Offer 3: Get 0.00 % + Flat ₹ 300 discount on shopping of ₹ 5000 [Use Code: MPSTK300]

Free Shipping (for orders above ₹ 499) *T&C apply.

In Stock

Free Shipping Available



Click for International Orders
  • Provide Fastest Delivery

  • 100% Original Guaranteed
  • General Information  
    Author(s)Mario Bebendorf
    PublisherSpringer
    ISBN9783540771463
    Pages296
    BindingPaperback
    LanguageEnglish
    Publish YearJuly 2008

    Description

    Springer Hierarchical Matrices A Means To Efficiently Solve Elliptic Boundary Value Problems 2008 Edition by Mario Bebendorf

    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. Table of contents : Low-Rank Matrices and Matrix Partitioning.- Hierarchical Matrices.- Approximation of Discrete Integral Operators.- Application to Finite Element Discretizations.