Hierarchical Matrices: Algorithms and Analysis

Wolfgang Hackbusch

ISBN 10: 3662473232 / ISBN 13: 9783662473238

Verlag: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2015

Beschreibung

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.

Bestandsnummer des Verkäufers LU-9783662473238

Bibliografische Details

• Titel: Hierarchical Matrices: Algorithms and Analysis
• Verlag: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE
• Erscheinungsjahr: 2015
• Sprache: Englisch
• ISBN-10: 3662473232
• ISBN-13: 9783662473238
• Einband: Hardback
• Auflage: 1st ed. 2015.
• Zustand: New

Über diesen Titel

Inhaltsangabe

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 hierarchical matrices is of interest to scientists in computational mathematics, physics, chemistry and engineering.

Über die Autorin bzw. den Autor

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".