ShyLU: A hybrid-hybrid solver for multicore platforms
S Rajamanickam, EG Boman… - 2012 IEEE 26th …, 2012 - ieeexplore.ieee.org
With the ubiquity of multicore processors, it is crucial that solvers adapt to the hierarchical
structure of modern architectures. We present ShyLU, a “hybrid-hybrid” solver for general …
structure of modern architectures. We present ShyLU, a “hybrid-hybrid” solver for general …
Domain decomposition approaches for accelerating contour integration eigenvalue solvers for symmetric eigenvalue problems
V Kalantzis, J Kestyn, E Polizzi… - Numerical Linear Algebra …, 2018 - Wiley Online Library
This paper discusses techniques for computing a few selected eigenvalue–eigenvector
pairs of large and sparse symmetric matrices. A recently developed class of techniques to …
pairs of large and sparse symmetric matrices. A recently developed class of techniques to …
Multiscale modal analysis of fully-loaded spent nuclear fuel canisters
In this paper, an efficient numerical procedure is proposed, which is adapted to the modal
analysis of a fully-loaded spent nuclear fuel canister exhibiting distinct structural levels …
analysis of a fully-loaded spent nuclear fuel canister exhibiting distinct structural levels …
Hybrid Multi-GPU solver based on Schur complement method
S Kopysov, I Kuzmin, N Nedozhogin, A Novikov… - … Conference, PaCT 2013 …, 2013 - Springer
This paper presents a new hybrid solver based on Schur complement method, in which
computations are distributed between multiple CPUs and GPUs. In this solver, the Schur …
computations are distributed between multiple CPUs and GPUs. In this solver, the Schur …
A memory-efficient parallelizable method for computation of Thévenin equivalents used in real-time stability assessment
This paper introduces a factor-solve method that efficiently computes Thévenin equivalents
for all buses in the power system. A range of real-time stability assessment methods relies …
for all buses in the power system. A range of real-time stability assessment methods relies …
Parallel algebraic domain decomposition solver for the solution of augmented systems
We consider the parallel iterative solution of indefinite linear systems given as augmented
systems. Our numerical technique is based on an algebraic non-overlapping domain …
systems. Our numerical technique is based on an algebraic non-overlapping domain …
On the use of low-rank arithmetic to reduce the complexity of parallel sparse linear solvers based on direct factorization techniques
G Pichon - 2018 - inria.hal.science
Solving sparse linear systems is a problem that arises in many scientific applications, and
sparse direct solvers are a time consuming and key kernel for those applications and for …
sparse direct solvers are a time consuming and key kernel for those applications and for …
Domain decomposition algorithms for the solution of sparse symmetric generalized eigenvalue problems
V Kalantzis - 2018 - search.proquest.com
This dissertation focuses on the design, implementation, and evaluation of domain
decomposition techniques for the solution of large and sparse algebraic symmetric …
decomposition techniques for the solution of large and sparse algebraic symmetric …
[HTML][HTML] Параллельные алгоритмы формирования и решения системы дополнения Шура на графических ускорителях
СП Копысов, ИМ Кузьмин, НС Недожогин… - Ученые записки …, 2012 - cyberleninka.ru
В работе рассмотрен параллельный алгоритм вычисления дополнения Шура.
Эффективное применение нескольких графических ускорителей для метода …
Эффективное применение нескольких графических ускорителей для метода …
Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement
The block Cimmino is a parallel hybrid row-block projection iterative method successfully
used for solving general sparse linear systems. However, the convergence of the method …
used for solving general sparse linear systems. However, the convergence of the method …