101 research outputs found
Fast solution methods
International audienceThe standard boundary element method applied to the time harmonic Helmholtz equation yields a numerical method with complexity when using a direct solution of the fully populated system of linear equations. Strategies to reduce this complexity are discussed in this paper. The complexity issuing from the direct solution is first reduced to by using iterative solvers. Krylov subspace methods as well as strategies of preconditioning are reviewed. Based on numerical examples the influence of different parameters on the convergence behavior of the iterative solvers is investigated. It is shown that preconditioned Krylov subspace methods yields a boundary element method of complexity. A further advantage of these iterative solvers is that they do not require the dense matrix to be set up. Only matrixâvector products need to be evaluated which can be done efficiently using a multilevel fast multipole method. Based on real life problems it is shown that the computational complexity of the boundary element method can be reduced to for a problem with unknowns
Fast Numerical Methods for Non-local Operators
[no abstract available
Schnelle Löser fĂŒr partielle Differentialgleichungen
The workshop Schnelle LoÌser fuÌr partielle Differentialgleichungen, organised by Randolph E. Bank (La Jolla), Wolfgang Hackbusch(Leipzig), Gabriel Wittum (Heidelberg) was held May 22nd - May 28th, 2005. This meeting was well attended by 47 participants with broad geographic representation from 9 countries and 3 continents. This workshop was a nice blend of researchers with various backgrounds
Hierarchical matrix techniques for low- and high-frequency Helmholtz problems
In this paper, we discuss the application of hierarchical matrix techniques to the solution of Helmholtz problems with large wave number Îș in 2D. We consider the Brakhage-Werner integral formulation of the problem discretized by the Galerkin boundary-element method. The dense n Ă n Galerkin matrix arising from this approach is represented by a sum of an -matrix and an 2-matrix, two different hierarchical matrix formats. A well-known multipole expansion is used to construct the 2-matrix. We present a new approach to dealing with the numerical instability problems of this expansion: the parts of the matrix that can cause problems are approximated in a stable way by an -matrix. Algebraic recompression methods are used to reduce the storage and the complexity of arithmetical operations of the -matrix. Further, an approximate LU decomposition of such a recompressed -matrix is an effective preconditioner. We prove that the construction of the matrices as well as the matrix-vector product can be performed in almost linear time in the number of unknowns. Numerical experiments for scattering problems in 2D are presented, where the linear systems are solved by a preconditioned iterative metho
Helmholtz-Hodge Decomposition on [0, 1] d by Divergence-free and Curl-free Wavelets
Abstract. This paper deals with the Helmholtz-Hodge decomposition of a vector field in bounded domain. We present a practical algorithm to compute this decomposition in the context of divergence-free and curl-free wavelets satisfying suitable boundary conditions. The method requires the inversion of divergence-free and curl-free wavelet Gram matrices. We propose an optimal preconditioning which allows to solve the systems with a small number of iterations. Finally, numerical examples prove the accuracy and the efficiency of the method
Schnelle Löser fĂŒr Partielle Differentialgleichungen
The workshop Schnelle Löser fĂŒr partielle Differentialgleichungen, organised by Randolph E. Bank (La Jolla), Wolfgang Hackbusch (Leipzig), and Gabriel Wittum (Frankfurt am Main), was held May 22ndâMay 28th, 2011. This meeting was well attended by 54 participants with broad geographic representation from 7 countries and 3 continents. This workshop was a nice blend of researchers with various backgrounds
Novel Computational Methods for Eigenvalue Problems
This dissertation focuses on novel computational method for eigenvalue problems. In Chapter 1, preliminaries of functional analysis related to eigenvalue problems are presented. Some classical methods for matrix eigenvalue problems are discussed. Several PDE eigenvalue problems are covered. The chapter is concluded with a summary of the contributions. In Chapter 2, a novel recursive contour integral method (RIM) for matrix eigenvalue problem is proposed. This method can effectively find all eigenvalues in a region on the complex plane with no a priori spectrum information. Regions that contain eigenvalues are subdivided and tested recursively until the size of region reaches specified precision. The method is robust, which is demonstrated using various examples. In Chapter 3, we propose an improved version of RIM for non-Hermitian eigenvalue problems, called SIM-M. By incorporating Cayley transformation and Arnoldiâs method, the main computation cost of solving linear systems is reduced significantly. The numerical experiments demonstrate that RIM-M gains significant speed-up over RIM. In Chapter 4, we propose a multilevel spectral indicator method (SIM-M) to address the memory requirement for large sparse matrices. We modify the indicator of RIM-M such that it requires much less memory. Matrices from University of Florida Sparse Matrix Collection are tested, suggesting that a parallel version of SIM-M has the potential to be efficient. In Chapter 5, we develop a novel method to solve the elliptic PDE eigenvalue problem. We construct a multi-wavelet basis with Riesz stability in H1 0 ( ). By incorporating multi-grid discretization scheme and sparse grids, the method retains the optimal convergence rate for the smallest eigenvalue with much less computational cost
- âŠ