Alex Druinsky

Orcid: 0000-0001-8003-0506

According to our database1, Alex Druinsky authored at least 16 papers between 2011 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Spectral condition-number estimation of large sparse matrices.
Numer. Linear Algebra Appl., 2019

2018
Wilkinson's inertia-revealing factorization and its application to sparse matrices.
Numer. Linear Algebra Appl., 2018

2016
Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication.
ACM Trans. Parallel Comput., 2016

Improving the Numerical Stability of Fast Matrix Multiplication.
SIAM J. Matrix Anal. Appl., 2016

Tuning the Coarse Space Construction in a Spectral AMG Solver.
Proceedings of the International Conference on Computational Science 2016, 2016

2015
Revisiting Asynchronous Linear Solvers: Provable Convergence Rate through Randomization.
J. ACM, 2015

Improving the numerical stability of fast matrix multiplication algorithms.
CoRR, 2015

Brief Announcement: Hypergraph Partitioning for Parallel Sparse Matrix-Matrix Multiplication.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Comparative Performance Analysis of Coarse Solvers for Algebraic Multigrid on Multicore and Manycore Architectures.
Proceedings of the Parallel Processing and Applied Mathematics, 2015

2014
Communication-Avoiding Symmetric-Indefinite Factorization.
SIAM J. Matrix Anal. Appl., 2014

2013
A Randomized Asynchronous Linear Solver with Provable Convergence Rate
CoRR, 2013

Reliable Iterative Condition-Number Estimation
CoRR, 2013

Experiences with a Lanczos Eigensolver in High-Precision Arithmetic.
Proceedings of the Parallel Processing and Applied Mathematics, 2013

Implementing a Blocked Aasen's Algorithm with a Dynamic Scheduler on Multicore Architectures.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

2012
How Accurate is inv(A)*b?
CoRR, 2012

2011
The Growth-Factor Bound for the Bunch-Kaufman Factorization Is Tight.
SIAM J. Matrix Anal. Appl., 2011


  Loading...