177 citations · 189 across the 18 of their papers we have counts for
4 papers · 1 filter
Fast and exact fixed-radius neighbor search based on sorting
Xinye Chen, Stefan Güttel
Fixed-radius near neighbor search is a fundamental data operation that retrieves all data points within a user-specified distance to a query point. There are efficient algorithms t…
Randomized sketching of nonlinear eigenvalue problems
Stefan Güttel, Daniel Kressner, Bart Vandereycken
Rational approximation is a powerful tool to obtain accurate surrogates for nonlinear functions that are easy to evaluate and linearize. The interpolatory adaptive Antoulas--Anders…
Randomized sketching for Krylov approximations of large-scale matrix functions
Stefan Güttel, Marcel Schweitzer
The computation of f(A)b, the action of a matrix function on a vector, is a task arising in many areas of scientific computing. In many applications, the matrix A is sparse but so…
Fast and explainable clustering based on sorting
Xinye Chen, Stefan Güttel
We introduce a fast and explainable clustering method called CLASSIX. It consists of two phases, namely a greedy aggregation phase of the sorted data into groups of nearby data poi…