Hierarchical Matrices Algorithms And Analysis

Author : Wolfgang Hackbusch
Publisher :
ISBN 13 : 9783662473252
Total Pages : pages
Book Rating : 4.59/5 ( download)

DOWNLOAD NOW!

Download or read book Hierarchical Matrices: Algorithms and Analysis written by Wolfgang Hackbusch and published by . This book was released on 2015 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Author : Wolfgang Hackbusch
Publisher : Springer
ISBN 13 : 3662473240
Total Pages : 511 pages
Book Rating : 4.45/5 ( download)

DOWNLOAD NOW!

Download or read book Hierarchical Matrices: Algorithms and Analysis written by Wolfgang Hackbusch and published by Springer. This book was released on 2015-12-21 with total page 511 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Author : Mario Bebendorf
Publisher : Springer Science & Business Media
ISBN 13 : 3540771476
Total Pages : 303 pages
Book Rating : 4.70/5 ( download)

DOWNLOAD NOW!

Download or read book Hierarchical Matrices written by Mario Bebendorf and published by Springer Science & Business Media. This book was released on 2008-06-25 with total page 303 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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 computed with logarithmic-linear complexity, which can be exploited to setup approximate preconditioners in an efficient and convenient way. Besides the algorithmic aspects of hierarchical matrices, the main aim of this book is to present their theoretical background. The book contains the existing approximation theory for elliptic problems including partial differential operators with nonsmooth coefficients. Furthermore, it presents in full detail the adaptive cross approximation method for the efficient treatment of integral operators with non-local kernel functions. The theory is supported by many numerical experiments from real applications.

Author : Steffen Börm
Publisher : European Mathematical Society
ISBN 13 : 9783037190913
Total Pages : 452 pages
Book Rating : 4.14/5 ( download)

DOWNLOAD NOW!

Download or read book Efficient Numerical Methods for Non-local Operators written by Steffen Börm and published by European Mathematical Society. This book was released on 2010 with total page 452 pages. Available in PDF, EPUB and Kindle. Book excerpt: Hierarchical matrices present an efficient way of treating dense matrices that arise in the context of integral equations, elliptic partial differential equations, and control theory. While a dense $n\times n$ matrix in standard representation requires $n^2$ units of storage, a hierarchical matrix can approximate the matrix in a compact representation requiring only $O(n k \log n)$ units of storage, where $k$ is a parameter controlling the accuracy. Hierarchical matrices have been successfully applied to approximate matrices arising in the context of boundary integral methods, to construct preconditioners for partial differential equations, to evaluate matrix functions, and to solve matrix equations used in control theory. $\mathcal{H}^2$-matrices offer a refinement of hierarchical matrices: Using a multilevel representation of submatrices, the efficiency can be significantly improved, particularly for large problems. This book gives an introduction to the basic concepts and presents a general framework that can be used to analyze the complexity and accuracy of $\mathcal{H}^2$-matrix techniques. Starting from basic ideas of numerical linear algebra and numerical analysis, the theory is developed in a straightforward and systematic way, accessible to advanced students and researchers in numerical mathematics and scientific computing. Special techniques are required only in isolated sections, e.g., for certain classes of model problems.

Author : Rio Yokota
Publisher : Springer
ISBN 13 : 3319699539
Total Pages : 293 pages
Book Rating : 4.30/5 ( download)

DOWNLOAD NOW!

Download or read book Supercomputing Frontiers written by Rio Yokota and published by Springer. This book was released on 2018-03-20 with total page 293 pages. Available in PDF, EPUB and Kindle. Book excerpt: It constitutes the refereed proceedings of the 4th Asian Supercomputing Conference, SCFA 2018, held in Singapore in March 2018. Supercomputing Frontiers will be rebranded as Supercomputing Frontiers Asia (SCFA), which serves as the technical programme for SCA18. The technical programme for SCA18 consists of four tracks: Application, Algorithms & Libraries Programming System Software Architecture, Network/Communications & Management Data, Storage & Visualisation The 20 papers presented in this volume were carefully reviewed nd selected from 60 submissions.

Author : Daniel Alpay
Publisher : Springer Science & Business Media
ISBN 13 : 376438137X
Total Pages : 331 pages
Book Rating : 4.70/5 ( download)

DOWNLOAD NOW!

Download or read book System Theory, the Schur Algorithm and Multidimensional Analysis written by Daniel Alpay and published by Springer Science & Business Media. This book was released on 2007-06-28 with total page 331 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume contains six peer-refereed articles written on the occasion of the workshop Operator theory, system theory and scattering theory: multidimensional generalizations and related topics, held at the Department of Mathematics of the Ben-Gurion University of the Negev in June, 2005. The book will interest a wide audience of pure and applied mathematicians, electrical engineers and theoretical physicists.

Author : Nicolas Gillis
Publisher : SIAM
ISBN 13 : 1611976413
Total Pages : 376 pages
Book Rating : 4.10/5 ( download)

DOWNLOAD NOW!

Download or read book Nonnegative Matrix Factorization written by Nicolas Gillis and published by SIAM. This book was released on 2020-12-18 with total page 376 pages. Available in PDF, EPUB and Kindle. Book excerpt: Nonnegative matrix factorization (NMF) in its modern form has become a standard tool in the analysis of high-dimensional data sets. This book provides a comprehensive and up-to-date account of the most important aspects of the NMF problem and is the first to detail its theoretical aspects, including geometric interpretation, nonnegative rank, complexity, and uniqueness. It explains why understanding these theoretical insights is key to using this computational tool effectively and meaningfully. Nonnegative Matrix Factorization is accessible to a wide audience and is ideal for anyone interested in the workings of NMF. It discusses some new results on the nonnegative rank and the identifiability of NMF and makes available MATLAB codes for readers to run the numerical examples presented in the book. Graduate students starting to work on NMF and researchers interested in better understanding the NMF problem and how they can use it will find this book useful. It can be used in advanced undergraduate and graduate-level courses on numerical linear algebra and on advanced topics in numerical linear algebra and requires only a basic knowledge of linear algebra and optimization.

Author : Steffen Börm
Publisher :
ISBN 13 : 9783037195918
Total Pages : 432 pages
Book Rating : 4.16/5 ( download)

DOWNLOAD NOW!

Download or read book Efficient Numerical Methods for Non-local Operators written by Steffen Börm and published by . This book was released on 2010 with total page 432 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Author : Michele Benzi
Publisher : Springer
ISBN 13 : 3319498878
Total Pages : 406 pages
Book Rating : 4.74/5 ( download)

DOWNLOAD NOW!

Download or read book Exploiting Hidden Structure in Matrix Computations: Algorithms and Applications written by Michele Benzi and published by Springer. This book was released on 2017-01-24 with total page 406 pages. Available in PDF, EPUB and Kindle. Book excerpt: Focusing on special matrices and matrices which are in some sense `near’ to structured matrices, this volume covers a broad range of topics of current interest in numerical linear algebra. Exploitation of these less obvious structural properties can be of great importance in the design of efficient numerical methods, for example algorithms for matrices with low-rank block structure, matrices with decay, and structured tensor computations. Applications range from quantum chemistry to queuing theory. Structured matrices arise frequently in applications. Examples include banded and sparse matrices, Toeplitz-type matrices, and matrices with semi-separable or quasi-separable structure, as well as Hamiltonian and symplectic matrices. The associated literature is enormous, and many efficient algorithms have been developed for solving problems involving such matrices. The text arose from a C.I.M.E. course held in Cetraro (Italy) in June 2015 which aimed to present this fast growing field to young researchers, exploiting the expertise of five leading lecturers with different theoretical and application perspectives.

Author : Guojun Gan
Publisher : SIAM
ISBN 13 : 1611976332
Total Pages : 430 pages
Book Rating : 4.35/5 ( download)

DOWNLOAD NOW!

Download or read book Data Clustering: Theory, Algorithms, and Applications, Second Edition written by Guojun Gan and published by SIAM. This book was released on 2020-11-10 with total page 430 pages. Available in PDF, EPUB and Kindle. Book excerpt: Data clustering, also known as cluster analysis, is an unsupervised process that divides a set of objects into homogeneous groups. Since the publication of the first edition of this monograph in 2007, development in the area has exploded, especially in clustering algorithms for big data and open-source software for cluster analysis. This second edition reflects these new developments, covers the basics of data clustering, includes a list of popular clustering algorithms, and provides program code that helps users implement clustering algorithms. Data Clustering: Theory, Algorithms and Applications, Second Edition will be of interest to researchers, practitioners, and data scientists as well as undergraduate and graduate students.