Erin C. Carson

Erin Claire Carson

Numer. Algorithms, June, 2024

The Effect of Approximate Coarsest-Level Solves on the Convergence of Multigrid V-Cycle Methods.

[BibT_eX]

[DOI]

Petr Vacek

Kirk M. Soodhalter

SIAM J. Sci. Comput., 2024

Iterated Gauss-Seidel GMRES.

[BibT_eX]

[DOI]

Katarzyna Swirydowicz

SIAM J. Sci. Comput., 2024

Single-Pass Nyström Approximation in Mixed Precision.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2024

Mixed precision sketching for least-squares problems and its application in GMRES-based iterative refinement.

[BibT_eX]

[DOI]

CoRR, 2024

The Detection and Correction of Silent Errors in Pipelined Krylov Subspace Methods.

[BibT_eX]

[DOI]

Erin Claire Carson

Jakub Hercík

CoRR, 2024

On the backward stability of s-step GMRES.

[BibT_eX]

[DOI]

Yuxin Ma

CoRR, 2024

On the loss of orthogonality in low-synchronization variants of reorthogonalized block classical Gram-Schmidt.

[BibT_eX]

[DOI]

CoRR, 2024

A comparison of mixed precision iterative refinement approaches for least-squares problems.

[BibT_eX]

[DOI]

CoRR, 2024

Reorthogonalized Pythagorean variants of block classical Gram-Schmidt.

[BibT_eX]

[DOI]

CoRR, 2024

Mixed Precision FGMRES-Based Iterative Refinement for Weighted Least Squares.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning.

[BibT_eX]

[DOI]

Noaman Khan

SIAM J. Sci. Comput., June, 2023

Mixed Precision Iterative Refinement with Adaptive Precision Sparse Approximate Inverse Preconditioning.

[BibT_eX]

[DOI]

Noaman Khan

CoRR, 2023

The stability of split-preconditioned FGMRES in four precisions.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Multistage mixed precision iterative refinement.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2022

Mixed precision s-step Lanczos and conjugate gradient algorithms.

[BibT_eX]

[DOI]

Tomás Gergelits

Ichitaro Yamazaki

Numer. Linear Algebra Appl., 2022

70 years of Krylov subspace methods: The journey continues.

[BibT_eX]

[DOI]

Jörg Liesen

Zdenek Strakos

CoRR, 2022

Using Mixed Precision in Low-Synchronization Reorthogonalized Block Classical Gram-Schmidt.

[BibT_eX]

[DOI]

CoRR, 2022

Post-Modern GMRES.

[BibT_eX]

[DOI]

CoRR, 2022

Mixed Precision GMRES-based Iterative Refinement with Recycling.

[BibT_eX]

[DOI]

CoRR, 2022

Mixed Precision $s$-step Conjugate Gradient with Residual Replacement on GPUs.

[BibT_eX]

[DOI]

Ichitaro Yamazaki

Brian Kelley

Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

2021

The Stability of Block Variants of Classical Gram-Schmidt.

[BibT_eX]

[DOI]

Kathryn Lund

Miroslav Rozlozník

SIAM J. Matrix Anal. Appl., 2021

A survey of numerical linear algebra methods utilizing mixed-precision arithmetic.

[BibT_eX]

[DOI]

Int. J. High Perform. Comput. Appl., 2021

Mixed Precision s-step Lanczos and Conjugate Gradient Algorithms.

[BibT_eX]

[DOI]

Tomás Gergelits

CoRR, 2021

2020

Predict-and-Recompute Conjugate Gradient Variants.

[BibT_eX]

[DOI]

Tyler Chen

SIAM J. Sci. Comput., 2020

Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems.

[BibT_eX]

[DOI]

Nicholas J. Higham

Srikara Pranesh

SIAM J. Sci. Comput., 2020

An overview of block Gram-Schmidt methods and their stability properties.

[BibT_eX]

[DOI]

CoRR, 2020

A Survey of Numerical Methods Utilizing Mixed Precision Arithmetic.

[BibT_eX]

[DOI]

CoRR, 2020

2019

An Adaptive $s$-step Conjugate Gradient Algorithm with Dynamic Basis Updating.

[BibT_eX]

[DOI]

CoRR, 2019

2018

The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2018

Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions.

[BibT_eX]

[DOI]

Nicholas J. Higham

SIAM J. Sci. Comput., 2018

The Adaptive s-Step Conjugate Gradient Method.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2018

2017

A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems.

[BibT_eX]

[DOI]

Nicholas J. Higham

SIAM J. Sci. Comput., 2017

2016

Write-Avoiding Algorithms.

[BibT_eX]

[DOI]

Harsha Vardhan Simhadri

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

2015

Communication-Avoiding Krylov Subspace Methods in Theory and Practice.

[BibT_eX]

[DOI]

PhD thesis, 2015

Accuracy of the s-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision.

[BibT_eX]

[DOI]

James Weldon Demmel

SIAM J. Matrix Anal. Appl., 2015

2014

A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of s-Step Krylov Subspace Methods.

[BibT_eX]

[DOI]

James Demmel

SIAM J. Matrix Anal. Appl., 2014

Making tech more inclusive: an interview with Ashe Dryden.

[BibT_eX]

[DOI]

XRDS, 2014

Communication lower bounds and optimal algorithms for numerical linear algebra.

[BibT_eX]

[DOI]

Acta Numer., 2014

Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

2013

Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods.

[BibT_eX]

[DOI]

Nicholas Knight

James Demmel

SIAM J. Sci. Comput., 2013

Exploiting Data Sparsity in Parallel Matrix Powers Computations.

[BibT_eX]

[DOI]

Nicholas Knight