2 citations · 2 across the 4 of their papers we have counts for
5 papers
A Mixed-Precision Model for Matrix-Splitting Methods
Neil Lindquist, David Appelhans, Chales W. Jackson +1
The performance of stationary iterative methods is memory-bound, due to the low arithmetic intensity. So, we propose a mixed-precision technique to reduce the amount of data moveme…
The Stability of Block Eliminations and Additive Modifications
Neil Lindquist, Piotr Luszczek, Jack Dongarra
The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the nove…
Generalizing Random Butterfly Transforms to Arbitrary Matrix Sizes
Neil Lindquist, Piotr Luszczek, Jack Dongarra
Parker and Lê introduced random butterfly transforms (RBTs) as a preprocessing technique to replace pivoting in dense LU factorization. Unfortunately, their FFT-like recursive stru…
Improving the Performance of the GMRES Method using Mixed-Precision Techniques
Neil Lindquist, Piotr Luszczek, Jack Dongarra
The GMRES method is used to solve sparse, non-symmetric systems of linear equations arising from many scientific applications. The solver performance within a single node is memory…
Replicated Computational Results (RCR) Report for "Code Generation for Generally Mapped Finite Elements"
Neil Lindquist
"Code Generation for Generally Mapped Finite Elements" includes performance results for the finite element methods discussed in that manuscript. The authors provided a Zenodo archi…