4.5k citations · 4.6k across the 10 of their papers we have counts for
3 papers · 1 filter
A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices
Michael Lass, Stephan Mohr, Hendrik Wiebeler +2
We present the submatrix method, a highly parallelizable method for the approximate calculation of inverse p-th roots of large sparse symmetric matrices which are required in diffe…
Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots
Michael Lass, Thomas D. Kühne, Christian Plessl
Approximate computing has shown to provide new ways to improve performance and power consumption of error-resilient applications. While many of these applications can be found in i…
A General Algorithm to Calculate the Inverse Principal -th Root of Symmetric Positive Definite Matrices
Dorothee Richters, Michael Lass, Andrea Walther +2
We address the general mathematical problem of computing the inverse -th root of a given matrix in an efficient way. A new method to construct iteration functions that allow cal…