Hierarchical Matrices : A Means to Efficiently Solve Elliptic Boundary Value Problems
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 comput...
Enregistré dans:
| Hovedforfatter: | |
|---|---|
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Udgivelse: | 1st ed. 2008. |
| Serier: | Lecture Notes in Computational Science and Engineering
63 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
L'impression du document génère 302 p. Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Hierarchical matrices, a means to efficiently solve elliptic boundary value problems, with 45 figures and 53 tables, Mario Bebendorf, Berlin, Springer, 2008, 1 vol. (xvi-290 p.), Lecture Notes in Computational Science and Engineering, 978-3-540-77146-3 • Hierarchical Matrices, Texte imprimé, 9783540869931 • Hierarchical matrices, a means to efficiently solve elliptic boundary value problems, with 45 figures and 53 tables, Mario Bebendorf, Berlin, Springer, 2008, 1 vol. (xvi-290 p.), Lecture Notes in Computational Science and Engineering, 978-3-540-77146-3 |
Indholdsfortegnelse:
- Low-Rank Matrices and Matrix Partitioning Hierarchical Matrices Approximation of Discrete Integral Operators Application to Finite Element Discretizations