Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 19 of 19 for “"Fast multipole methods"”.

  1. Broadband Multilevel Fast Multipole Methods

    … classes of algorithms consists of the so-called Fast Multipole Methods. These methods use a subdivision of the geometry into boxes on multiple levels, in combination with a decomposition of the Green function. For high frequency simulations, where the wavelength is smaller then the smallest …

    ghent Repository record for Broadband Multilevel Fast Multipole Methods (opens in a new tab)

  2. Scalable Fast Multipole Methods on Heterogeneous Architecture

    … Our algorithmic approach is to use the Fast Multipole Method (FMM), which is a divide-and-conquer algorithm that performs a fast N-body sum using a spatial decomposition and is often used in a time-stepping or iterative loop, to reduce such quadratic complexity to linear with guaranteed …

    maryland Repository record for Scalable Fast Multipole Methods on Heterogeneous Architecture (opens in a new tab)

  3. Improving Radial Basis Function Interpolation via Random SVD Preconditioners and Fast Multipole Methods

    Recent research in fast-multipole algorithms for the Helmholtz equation has yielded approximation algorithms that compute matrix vector products of specific matrices to any specified accuracy in linear time. A first purpose of this thesis is to combine this with recent research in randomized …

    maryland Repository record for Improving Radial Basis Function Interpolation via Random SVD Preconditioners and Fast Multipole Methods (opens in a new tab)

  4. A C++ based MPI-enabled Tasking Framework to Efficiently Parallelize Fast Multipole Methods for Molecular Dynamics

    Today's supercomputers gain their performance through a rapidly increasing number of cores per node. To tackle issues arising from those developments new parallelization approaches guided by modern software engineering are inevitable. The concept of task-based parallelization is a promising …

    qucosa-diss

  5. A distributed kernel summation framework for machine learning and scientific applications

    … kernel summations appear in popular kernel methods which can model nonlinear structures in data. Kernel methods include many non-parametric methods such as kernel density estimation, kernel regression, Gaussian process regression, kernel PCA, and kernel support vector machines (SVM). In …

    gatech Repository record for A distributed kernel summation framework for machine learning and scientific applications (opens in a new tab)

  6. Efficient Algorithms for Clustering and Interpolation of Large Spatial Data Sets

    … of data clustering and interpolation methods for large spatial data sets, and the application of these methods to geostatistics and remote sensing. In particular, I have developed fast implementations of ISODATA clustering and kriging interpolation algorithms. These implementations …

    maryland Repository record for Efficient Algorithms for Clustering and Interpolation of Large Spatial Data Sets (opens in a new tab)

  7. Algorithms for scientific computing

    … We are concernedwith two areaswithin this field: fastmultipolemethods andmeshlessmethods. Since Greengard and Rokhlin’s seminal paper in 1987, considerable interest has arisen in fast multipole methods for finding the energy of particle systems in two and three dimensions, and more recently in …

    soton Download PDF for Algorithms for scientific computing (opens in a new tab)

  8. Integral Equation Methodologies for the Signal Integrity Analysis of PCB and Interconnect Structures in Layered Media From DC to Multi-Ghz Frequencies

    … model. While under quasi-static assumptions, fast multipole methods and precorrected FFT methods have been proven very successful in dealing with the computational complexity of such problems. Their extension to the electrodynamic, however, has been hindered by issues such as low frequency …

    uiuc Repository record for Integral Equation Methodologies for the Signal Integrity Analysis of PCB and Interconnect Structures in Layered Media From DC to Multi-Ghz Frequencies (opens in a new tab)

  9. Efficient parallelization of non-uniform fast multipole algorithms

    … large and (ii) highly non-uniform. A variety of fast multipole algorithms have been devised to reduce the cost from $\mathcal{O}(N^2)$ to $\mathcal{O}(N \log N)$ or $\mathcal{O}(N)$ for oscillatory and non-oscillatory problems, respectively. The issue of non-uniformity, however, presents …

    msu

  10. Fast Fourier Transform and Fast Multipole

    … of problems very expensive. Therefore, finding methods to reduce the number of total calculations needed is of great importance. Main focus of this project is to investigate the effect of using two well known mathemati- cal methods, Fast Fourier Transform and Fast Multipole Methods, in speeding …

    chalmers Repository record for Fast Fourier Transform and Fast Multipole (opens in a new tab)

  11. Numerical methods for fast simulation of a red blood cell

    … accessible to further acceleration using the fast multipole methods (FMMs).

    texas Repository record for Numerical methods for fast simulation of a red blood cell (opens in a new tab)

  12. The science of high performance algorithms for hierarchical matrices

    … (H-matrices in brief). H-matrix approximation methods are more general and scalable than solely using a sparse or low-rank matrix approximation. Classical numerical linear algebra operations on H-matrices—multiplication, factorization, and eigenvalue decomposition—can be accelerated by many …

    texas Repository record for The science of high performance algorithms for hierarchical matrices (opens in a new tab)

  13. Fast algorithms for Brownian dynamics simulation with hydrodynamic interactions

    … In this dissertation, we first present two fast multipole methods (FMM) for computing Du. The first FMM is a simple application of the kernel independent FMM (KIFMM) developed by Ying, Biros, and Zorin [3], which requires 9 scalar FMM calls. The second FMM, similar to the FMM for Stokeslet …

    njit Repository record for Fast algorithms for Brownian dynamics simulation with hydrodynamic interactions (opens in a new tab)

  14. Fast, Parallel Techniques for Time-Domain Boundary Integral Equations

    … techniques, namely, the high-frequency fast multipole method (HF FMM) and H-matrices. The applicability of both techniques for the discretization of the Helmholtz boundary single-layer operators with complex wavenumbers is analyzed. It is shown that the presence of decay can favorably …

    qucosa-diss

  15. Fast algorithms for frequency domain wave propagation

    … be used. In this dissertation, I will present fast algorithms which, in conjunction with GMRES, allow the solution of the forward problem in O(N) or O(N log N) time.

    texas Repository record for Fast algorithms for frequency domain wave propagation (opens in a new tab)