132 citations · 249 across the 19 of their papers we have counts for
5 papers · 1 filter
High Performance Block Incomplete LU Factorization
Matthias Bollhöfer, Olaf Schenk, Fabio Verbosio
Many application problems that lead to solving linear systems make use of preconditioned Krylov subspace solvers to compute their solution. Among the most popular preconditioning a…
New frontiers in Bayesian modeling using the INLA package in R
Janet van Niekerk, Haakon Bakka, Haavard Rue +1
The INLA package provides a tool for computationally efficient Bayesian modeling and inference for various widely used models, more formally the class of latent Gaussian models. It…
A Recursive Algebraic Coloring Technique for Hardware-Efficient Symmetric Sparse Matrix-Vector Multiplication
Christie L. Alappat, Georg Hager, Olaf Schenk +5
The symmetric sparse matrix-vector multiplication (SymmSpMV) is an important building block for many numerical linear algebra kernel operations or graph traversal applications. Par…
Structure Exploiting Interior Point Methods
Juraj Kardoš, Drosos Kourounis, Olaf Schenk
Interior point methods are among the most popular techniques for large scale nonlinear optimization, owing to their intrinsic ability of scaling to arbitrary large problem sizes. T…
State-of-The-Art Sparse Direct Solvers
Matthias Bollhöfer, Olaf Schenk, Radim Janalík +2
In this chapter we will give an insight into modern sparse elimination methods. These are driven by a preprocessing phase based on combinatorial algorithms which improve diagonal d…