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.
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.
 
Hierarchical Matrices: Algorithms and Analysis
511 
Hierarchical Matrices: Algorithms and Analysis
511Hardcover(1st ed. 2015)
Product Details
| ISBN-13: | 9783662473238 | 
|---|---|
| Publisher: | Springer Berlin Heidelberg | 
| Publication date: | 12/14/2015 | 
| Series: | Springer Series in Computational Mathematics , #49 | 
| Edition description: | 1st ed. 2015 | 
| Pages: | 511 | 
| Product dimensions: | 6.10(w) x 9.25(h) x (d) | 
