A survey of parallelization techniques for multigrid solvers
This chapter surveys the techniques that are necessary for constructing computationally
efficient parallel multigrid solvers. Both geometric and algebraic methods are considered …
efficient parallel multigrid solvers. Both geometric and algebraic methods are considered …
Learning to super-resolve blurry face and text images
We present an algorithm to directly restore a clear high-resolution image from a blurry low-
resolution input. This problem is highly ill-posed and the basic assumptions for existing …
resolution input. This problem is highly ill-posed and the basic assumptions for existing …
OpenMDAO: An open-source framework for multidisciplinary design, analysis, and optimization
Multidisciplinary design optimization (MDO) is concerned with solving design problems
involving coupled numerical models of complex engineering systems. While various MDO …
involving coupled numerical models of complex engineering systems. While various MDO …
Efficient management of parallelism in object-oriented numerical software libraries
Parallel numerical software based on the message passing model is enormously
complicated. This paper introduces a set of techniques to manage the complexity, while …
complicated. This paper introduces a set of techniques to manage the complexity, while …
hypre: A Library of High Performance Preconditioners
RD Falgout, UM Yang - International Conference on computational …, 2002 - Springer
Abstract hypre is a software library for the solution of large, sparse linear systems on
massively parallel computers. Its emphasis is on modern powerful and scalable …
massively parallel computers. Its emphasis is on modern powerful and scalable …
BoomerAMG: A parallel algebraic multigrid solver and preconditioner
UM Yang - Applied Numerical Mathematics, 2002 - Elsevier
Driven by the need to solve linear systems arising from problems posed on extremely large,
unstructured grids, there has been a recent resurgence of interest in algebraic multigrid …
unstructured grids, there has been a recent resurgence of interest in algebraic multigrid …
Parallel multilevel k-way partitioning scheme for irregular graphs
In this paper we present a parallel formulation of a multilevel k-way graph partitioning
algorithm. The multilevel k-way partitioning algorithm reduces the size of the graph by …
algorithm. The multilevel k-way partitioning algorithm reduces the size of the graph by …
What color is your Jacobian? Graph coloring for computing derivatives
Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian
and Hessian matrices using either finite differences or automatic differentiation. Several …
and Hessian matrices using either finite differences or automatic differentiation. Several …
GraphBIG: understanding graph computing in the context of industrial solutions
With the emergence of data science, graph computing is becoming a crucial tool for
processing big connected data. Although efficient implementations of specific graph …
processing big connected data. Although efficient implementations of specific graph …
Preconditioning for sparse linear systems at the dawn of the 21st century: History, current developments, and future perspectives
M Ferronato - International Scholarly Research Notices, 2012 - Wiley Online Library
Iterative methods are currently the solvers of choice for large sparse linear systems of
equations. However, it is well known that the key factor for accelerating, or even allowing for …
equations. However, it is well known that the key factor for accelerating, or even allowing for …