| |
|
Linear solvers for large and sparse systems are a key element of scientific applications, and their efficient implementation is necessary to harness the computational power of current computers. Algebraic Multigrid (AMG) Preconditioners are a popular ingredient of such linear solvers; this is the… |
| |
|
In this paper we propose a new approach to detect clusters in undirected graphs with attributed vertices. The aim is to group vertices which are similar
not only in terms of structural connectivity but also in terms of attribute values.
We incorporate structural and attribute similarities between… |
| |
|
The diffusive behaviour of simple random-walk proposals of many Markov Chain
Monte Carlo (MCMC) algorithms results in slow exploration of the state space making inefficient
the convergence to a target distribution. Hamiltonian/Hybrid Monte Carlo (HMC), by introducing fictious momentum variables,… |
| |
|
In this paper, we describe some work aimed at upgrading the Alya code with up-to-date parallel linear solvers capable of achieving reliability, efficiency, and scalability in the computation of the pressure field at each time step of the numerical procedure for solving an LES formulation of the… |
| |
|
This paper proposed improving the solve time of the bootstrap AMG proposed previously by the authors. This is achieved by incorporating the information, set of algebraically smooth vectors, generated by the bootstrap algorithm, in a single hierarchy by using sufficiently large aggregates, and these… |
| |
|
Convergence of new quadrature rules for approximating the Hilbert transform are given. Numerical tests show the goodness of such approximations |
