REBIUN - ODA

Descripción del título

Hierarchical Matrices: Algo...

Hierarchical Matrices: Algorithms and Analysis

Hackbusch, Wolfgang.,

Springer Berlin Heidelberg 2015

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

Ver

Libros electrónicos Recursos electrónicos

Monografía

monografia Rebiun17580683 https://catalogo.rebiun.org/rebiun/record/Rebiun17580683 cr c||||||||| 151221s2015 gw o 001 0 eng d 9783662473245 978-3-662-47324-5 10.1007/978-3-662-47324-5 doi UPVA 997151083903706 UAM 991007713034904211 CBUC 991005190856606711 UAL. spa. UAL. rdc PBKS bicssc MAT021000 bisacsh MAT006000 bisacsh 518 23 Hackbusch, Wolfgang. author Hierarchical Matrices: Algorithms and Analysis by Wolfgang Hackbusch 1st ed. 2015 Berlin, Heidelberg Springer Berlin Heidelberg Imprint: Springer 2015 Berlin, Heidelberg Berlin, Heidelberg Springer Berlin Heidelberg Imprint: Springer 1 recurso en línea 1 recurso en línea XXV, 511 p. 87 illus., 27 illus. in color XXV, 511 p. 87 illus., 27 illus. in color Springer Series in Computational Mathematics 0179-3632 49 Springer eBooks 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 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 Modo de acceso: World Wide Web Mathematics Matrix theory Álgebra Integral equations Partial differential equations Algorithms Numerical analysis Mathematics Numerical Analysis Algorithms Partial Differential Equations Integral Equations Linear and Multilinear Algebras, Matrix Theory Libros electrónicos Recursos electrónicos SpringerLink (Online service) Springer Series in Computational Mathematics 0179-3632 49

• Localizaciones: 14
• Préstamo interbibliotecario

• Exportar
  • Dublin Core
  • Google scholar
  • RIS
  • RefWorks
• Favorito
• Compartir

Información Sólo puedes introducir una dirección de email ×

Introduce un email para compartir el título

Email Pon el email de la persona con la que deseas compartir este contenido

Error .alert.alert-info

Cerrar Compartir por email

Información Haz clic en el cuadro de texto para seleccionar el contenido y copiarlo al portapapeles

Enlace permanente https://catalogo.rebiun.org/rebiun/record/Rebiun17580683

Cerrar

monografia Rebiun17580683 https://catalogo.rebiun.org/rebiun/record/Rebiun17580683 cr c||||||||| 151221s2015 gw o 001 0 eng d 9783662473245 978-3-662-47324-5 10.1007/978-3-662-47324-5 doi UPVA 997151083903706 UAM 991007713034904211 CBUC 991005190856606711 UAL. spa. UAL. rdc PBKS bicssc MAT021000 bisacsh MAT006000 bisacsh 518 23 Hackbusch, Wolfgang. author Hierarchical Matrices: Algorithms and Analysis by Wolfgang Hackbusch 1st ed. 2015 Berlin, Heidelberg Springer Berlin Heidelberg Imprint: Springer 2015 Berlin, Heidelberg Berlin, Heidelberg Springer Berlin Heidelberg Imprint: Springer 1 recurso en línea 1 recurso en línea XXV, 511 p. 87 illus., 27 illus. in color XXV, 511 p. 87 illus., 27 illus. in color Springer Series in Computational Mathematics 0179-3632 49 Springer eBooks 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 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 Modo de acceso: World Wide Web Mathematics Matrix theory Álgebra Integral equations Partial differential equations Algorithms Numerical analysis Mathematics Numerical Analysis Algorithms Partial Differential Equations Integral Equations Linear and Multilinear Algebras, Matrix Theory Libros electrónicos Recursos electrónicos SpringerLink (Online service) Springer Series in Computational Mathematics 0179-3632 49