Hierarchical Matrices: Algorithms and Analysis

CHF 201.25
Auf Lager
SKU
OJRHSDHP42N
Stock 1 Verfügbar
Geliefert zwischen Mi., 29.04.2026 und Do., 30.04.2026

Details

This self-contained monograph presents matrix algorithms and their analysis. The new technique enables not only the solution of linear systems but also the approximation of matrix functions, e.g., the matrix exponential. Other applications include the solution of matrix equations, e.g., the Lyapunov or Riccati equation. The required mathematical background can be found in the appendix.

The numerical treatment of fully populated large-scale matrices is usually rather costly. However, the technique of hierarchical matrices makes it possible to store matrices and to perform matrix operations approximately with almost linear cost and a controllable degree of approximation error. For important classes of matrices, the computational cost increases only logarithmically with the approximation error. The operations provided include the matrix inversion and LU decomposition.

Since large-scale linear algebra problems are standard in scientific computing, the subject of hierarchicalmatrices is of interest to scientists in computational mathematics, physics, chemistry and engineering.


Matrix algorithms of almost linear cost Application to matrix equations and matrix functions Self-contained contents by means of five appendices Includes supplementary material: sn.pub/extras

Autorentext
The author is a very well-known author of Springer, working in the field of numerical mathematics for partial differential equations and integral equations. He has published numerous books in the SSCM series, e.g., about the multi-grid method, about the numerical analysis of elliptic pdes, about iterative solution of large systems of equation, and a book in German about the technique of hierarchical matrices. Hackbusch is member of the editorial board of Springer' s book series "Advances in Numerical Mathematics", "The International Cryogenics Monograph Series" and has now joined as new member of the editorial board of "Springer Series of Computational Mathematics".

Inhalt
Preface.- Part I: Introductory and Preparatory Topics.- 1. Introduction.- 2. Rank-r Matrices.- 3. Introductory Example.- 4. Separable Expansions and Low-Rank Matrices.- 5. Matrix Partition.- Part II: H-Matrices and Their Arithmetic.- 6. Definition and Properties of Hierarchical Matrices.- 7. Formatted Matrix Operations for Hierarchical Matrices.- 8. H2-Matrices.- 9. Miscellaneous Supplements.- Part III: Applications.- 10. Applications to Discretised Integral Operators.- 11. Applications to Finite Element Matrices.- 12. Inversion with Partial Evaluation.- 13. Eigenvalue Problems.- 14. Matrix Functions.- 15. Matrix Equations.- 16. Tensor Spaces.- Part IV: Appendices.- A. Graphs and Trees.- B. Polynomials.- C. Linear Algebra and Functional Analysis.- D. Sinc Functions and Exponential Sums.- E. Asymptotically Smooth Functions.- References.- Index.

Weitere Informationen

  • Allgemeine Informationen
    • GTIN 09783662568941
    • Sprache Englisch
    • Auflage Softcover reprint of the original 1st edition 2015
    • Größe H235mm x B155mm x T29mm
    • Jahr 2019
    • EAN 9783662568941
    • Format Kartonierter Einband
    • ISBN 3662568942
    • Veröffentlichung 14.03.2019
    • Titel Hierarchical Matrices: Algorithms and Analysis
    • Autor Wolfgang Hackbusch
    • Untertitel Springer Series in Computational Mathematics 49
    • Gewicht 809g
    • Herausgeber Springer Berlin Heidelberg
    • Anzahl Seiten 540
    • Lesemotiv Verstehen
    • Genre Mathematik

Bewertungen

Schreiben Sie eine Bewertung
Nur registrierte Benutzer können Bewertungen schreiben. Bitte loggen Sie sich ein oder erstellen Sie ein Konto.
Made with ♥ in Switzerland | ©2025 Avento by Gametime AG
Gametime AG | Hohlstrasse 216 | 8004 Zürich | Schweiz | UID: CHE-112.967.470
Kundenservice: customerservice@avento.shop | Tel: +41 44 248 38 38