Hierarchical Matrices PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Hierarchical Matrices PDF full book. Access full book title Hierarchical Matrices by Mario Bebendorf. Download full books in PDF and EPUB format.
Author: Mario Bebendorf
Publisher: Springer Science & Business Media
ISBN: 3540771476
Category : Mathematics
Languages : en
Pages : 303
Get Book Here
Book Description
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: Wolfgang Hackbusch
Publisher: Springer
ISBN: 3662473240
Category : Mathematics
Languages : en
Pages : 532
Get Book Here
Book Description
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: 3540771476
Category : Mathematics
Languages : en
Pages : 303
Get Book Here
Book Description
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: Thomas Mach
Publisher: Thomas Mach
ISBN:
Category : Mathematics
Languages : en
Pages : 173
Get Book Here
Book Description
This thesis is on the numerical computation of eigenvalues of symmetric hierarchical matrices. The numerical algorithms used for this computation are derivations of the LR Cholesky algorithm, the preconditioned inverse iteration, and a bisection method based on LDL factorizations. The investigation of QR decompositions for H-matrices leads to a new QR decomposition. It has some properties that are superior to the existing ones, which is shown by experiments using the HQR decompositions to build a QR (eigenvalue) algorithm for H-matrices does not progress to a more efficient algorithm than the LR Cholesky algorithm. The implementation of the LR Cholesky algorithm for hierarchical matrices together with deflation and shift strategies yields an algorithm that require O(n) iterations to find all eigenvalues. Unfortunately, the local ranks of the iterates show a strong growth in the first steps. These H-fill-ins makes the computation expensive, so that O(n³) flops and O(n²) storage are required. Theorem 4.3.1 explains this behavior and shows that the LR Cholesky algorithm is efficient for the simple structured Hl-matrices. There is an exact LDLT factorization for Hl-matrices and an approximate LDLT factorization for H-matrices in linear-polylogarithmic complexity. This factorizations can be used to compute the inertia of an H-matrix. With the knowledge of the inertia for arbitrary shifts, one can compute an eigenvalue by bisectioning. The slicing the spectrum algorithm can compute all eigenvalues of an Hl-matrix in linear-polylogarithmic complexity. A single eigenvalue can be computed in O(k²n log^4 n). Since the LDLT factorization for general H-matrices is only approximative, the accuracy of the LDLT slicing algorithm is limited. The local ranks of the LDLT factorization for indefinite matrices are generally unknown, so that there is no statement on the complexity of the algorithm besides the numerical results in Table 5.7. The preconditioned inverse iteration computes the smallest eigenvalue and the corresponding eigenvector. This method is efficient, since the number of iterations is independent of the matrix dimension. If other eigenvalues than the smallest are searched, then preconditioned inverse iteration can not be simply applied to the shifted matrix, since positive definiteness is necessary. The squared and shifted matrix (M-mu I)² is positive definite. Inner eigenvalues can be computed by the combination of folded spectrum method and PINVIT. Numerical experiments show that the approximate inversion of (M-mu I)² is more expensive than the approximate inversion of M, so that the computation of the inner eigenvalues is more expensive. We compare the different eigenvalue algorithms. The preconditioned inverse iteration for hierarchical matrices is better than the LDLT slicing algorithm for the computation of the smallest eigenvalues, especially if the inverse is already available. The computation of inner eigenvalues with the folded spectrum method and preconditioned inverse iteration is more expensive. The LDLT slicing algorithm is competitive to H-PINVIT for the computation of inner eigenvalues. In the case of large, sparse matrices, specially tailored algorithms for sparse matrices, like the MATLAB function eigs, are more efficient. If one wants to compute all eigenvalues, then the LDLT slicing algorithm seems to be better than the LR Cholesky algorithm. If the matrix is small enough to be handled in dense arithmetic (and is not an Hl(1)-matrix), then dense eigensolvers, like the LAPACK function dsyev, are superior. The H-PINVIT and the LDLT slicing algorithm require only an almost linear amount of storage. They can handle larger matrices than eigenvalue algorithms for dense matrices. For Hl-matrices of local rank 1, the LDLT slicing algorithm and the LR Cholesky algorithm need almost the same time for the computation of all eigenvalues. For large matrices, both algorithms are faster than the dense LAPACK function dsyev.
Author: Rio Yokota
Publisher: Springer
ISBN: 3319699539
Category : Computers
Languages : en
Pages : 301
Get Book Here
Book Description
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: Raf Vandebril
Publisher: JHU Press
ISBN: 0801896797
Category : Mathematics
Languages : en
Pages : 594
Get Book Here
Book Description
In recent years several new classes of matrices have been discovered and their structure exploited to design fast and accurate algorithms. In this new reference work, Raf Vandebril, Marc Van Barel, and Nicola Mastronardi present the first comprehensive overview of the mathematical and numerical properties of the family's newest member: semiseparable matrices. The text is divided into three parts. The first provides some historical background and introduces concepts and definitions concerning structured rank matrices. The second offers some traditional methods for solving systems of equations involving the basic subclasses of these matrices. The third section discusses structured rank matrices in a broader context, presents algorithms for solving higher-order structured rank matrices, and examines hybrid variants such as block quasiseparable matrices. An accessible case study clearly demonstrates the general topic of each new concept discussed. Many of the routines featured are implemented in Matlab and can be downloaded from the Web for further exploration.
Author: Daniel Alpay
Publisher: Springer Science & Business Media
ISBN: 3764381361
Category : Mathematics
Languages : en
Pages : 331
Get Book Here
Book Description
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: Huw Jones
Publisher: Springer Science & Business Media
ISBN: 9781852334222
Category : Computers
Languages : en
Pages : 1078
Get Book Here
Book Description
This book introduces the mathematical concepts that underpin computer graphics. It is written in an approachable way, without burdening readers with the skills of ow to do'things. The author discusses those aspects of mathematics that relate to the computer synthesis of images, and so gives users a better understanding of the limitations of computer graphics systems. Users of computer graphics who have no formal training and wish to understand the essential foundations of computer graphics systems will find this book very useful, as will mathematicians who want to understand how their subject is used in computer image synthesis. '
Author: Lutz Lehmann
Publisher: Springer Science & Business Media
ISBN: 3540711090
Category : Science
Languages : en
Pages : 185
Get Book Here
Book Description
This book presents theoretical fundamentals and applications of a new numerical model that has the ability to simulate wave propagation. Coverage examines linear waves in ideal fluids and elastic domains. In addition, the book includes a numerical simulation of wave propagation based on scalar and vector wave equations, as well as fluid-structure interaction and soil-structure interaction.
Author: Yong Shi
Publisher: Springer Science & Business Media
ISBN: 3540725830
Category : Computers
Languages : en
Pages : 1310
Get Book Here
Book Description
Annotation The four-volume set LNCS 4487-4490 constitutes the refereed proceedings of the 7th International Conference on Computational Science, ICCS 2007, held in Beijing, China in May 2007. More than 2400 submissions were made to the main conference and its 35 topical workshops. The 80 revised full papers and 11 revised short papers of the main track were carefully reviewed and selected from 360 submissions and are presented together with 624 accepted workshop papers in four volumes. According to the ICCS 2007 theme "Advancing Science and Society through Computation" the papers cover a large volume of topics in computational science and related areas, from multiscale physics, to wireless networks, and from graph theory to tools for program development. The papers are arranged in topical sections on efficient data management, parallel monte carlo algorithms, simulation of multiphysics multiscale systems, dynamic data driven application systems, computer graphics and geometric modeling, computer algebra systems, computational chemistry, computational approaches and techniques in bioinformatics, computational finance and business intelligence, geocomputation, high-level parallel programming, networks theory and applications, collective intelligence for semantic and knowledge grid, collaborative and cooperative environments, tools for program development and analysis in CS, intelligent agents in computing systems, CS in software engineering, computational linguistics in HCI, internet computing in science and engineering, workflow systems in e-science, graph theoretic algorithms and applications in cs, teaching CS, high performance data mining, mining text, semi-structured, Web, or multimedia data, computational methods in energy economics, risk analysis, advances in computational geomechanics and geophysics, meta-synthesis and complex systems, scientific computing in electronics engineering, wireless and mobile systems, high performance networked media and services, evolution toward next generation internet, real time systems and adaptive applications, evolutionary algorithms and evolvable systems.
Author: Ralf Kornhuber
Publisher: Springer Science & Business Media
ISBN: 3540268251
Category : Mathematics
Languages : en
Pages : 686
Get Book Here
Book Description
Domain decomposition is an active, interdisciplinary research area that is devoted to the development, analysis and implementation of coupling and decoupling strategies in mathematics, computational science, engineering and industry. A series of international conferences starting in 1987 set the stage for the presentation of many meanwhile classical results on substructuring, block iterative methods, parallel and distributed high performance computing etc. This volume contains a selection from the papers presented at the 15th International Domain Decomposition Conference held in Berlin, Germany, July 17-25, 2003 by the world's leading experts in the field. Its special focus has been on numerical analysis, computational issues,complex heterogeneous problems, industrial problems, and software development.
