124 citations · 666 across the 43 of their papers we have counts for
13 papers · 1 filter
Proxy-surface-based fast direct solver for TE-mode scattering problems on distributed memory systems
Yasuhiro Matsumoto, Rio Yokota
This paper describes an MPI/OpenMP hybrid parallelized fast direct solver for the scattering problem of transverse electric (TE)-mode electromagnetic waves. Because TE-mode scatter…
Computing the k-th Eigenvalue of Symmetric -Matrices
M. Ridwan Apriansyah, Rio Yokota
The numerical solution of eigenvalue problems is essential in various application areas of scientific and engineering domains. In many problem classes, the practical interest is on…
Scalable Linear Time Dense Direct Solver for 3-D Problems Without Trailing Sub-Matrix Dependencies
Qianxiang Ma, Sameer Deshmukh, Rio Yokota
Factorization of large dense matrices are ubiquitous in engineering and data science applications, e.g. preconditioners for iterative boundary integral solvers, frontal matrices in…
Parallel QR Factorization of Block Low-Rank Matrices
M. Ridwan Apriansyah, Rio Yokota
We present two new algorithms for Householder QR factorization of Block Low-Rank (BLR) matrices: one that performs block-column-wise QR, and another that is based on tiled QR. We s…
A Matrix-free Preconditioner for the Helmholtz Equation based on the Fast Multipole Method
Huda Ibeid, Rio Yokota, David Keyes
Fast multipole methods (FMM) were originally developed for accelerating -body problems for particle-based methods. FMM is more than an -body solver, however. Recent efforts t…
Fast Multipole Method as a Matrix-Free Hierarchical Low-Rank Approximation
Rio Yokota, Huda Ibeid, David Keyes
There has been a large increase in the amount of work on hierarchical low-rank approximation methods, where the interest is shared by multiple communities that previously did not i…
Fast Multipole Preconditioners for Sparse Matrices Arising from Elliptic Equations
Huda Ibeid, Rio Yokota, Jennifer Pestana +1
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures…
An FMM Based on Dual Tree Traversal for Many-core Architectures
Rio Yokota
The present work attempts to integrate the independent efforts in the fast N-body community to create the fastest N-body library for many-core and heterogenous architectures. Focus…
Data-Driven Execution of Fast Multipole Methods
Hatem Ltaief, Rio Yokota
Fast multipole methods have O(N) complexity, are compute bound, and require very little synchronization, which makes them a favorable algorithm on next-generation supercomputers. T…
FMM-based vortex method for simulation of isotropic turbulence on GPUs, compared with a spectral method
Rio Yokota, L. A. Barba
The Lagrangian vortex method offers an alternative numerical approach for direct numerical simulation of turbulence. The fact that it uses the fast multipole method (FMM)--a hierar…
Hierarchical N-body simulations with auto-tuning for heterogeneous systems
Rio Yokota, Lorena A. Barba
With the current hybridization of treecodes and FMMs, combined with auto-tuning capabilities on heterogeneous architectures, the flexibility of fast N-body methods has been greatly…
Petascale turbulence simulation using a highly parallel fast multipole method on GPUs
R. Yokota, L. A. Barba, T. Narumi +1
This paper reports large-scale direct numerical simulations of homogeneous-isotropic fluid turbulence, achieving sustained performance of 1.08 petaflop/s on gpu hardware using sing…
A Tuned and Scalable Fast Multipole Method as a Preeminent Algorithm for Exascale Systems
Rio Yokota, Lorena Barba
Among the algorithms that are likely to play a major role in future exascale computing, the fast multipole method (FMM) appears as a rising star. Our previous recent work showed sc…