Erin C. Carson

Orcid: 0000-0001-9469-7467

Affiliations:
  • Charles University, Prague, Czech Republic


According to our database1, Erin C. Carson authored at least 37 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2023
Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning.
SIAM J. Sci. Comput., June, 2023

Mixed Precision Iterative Refinement with Adaptive Precision Sparse Approximate Inverse Preconditioning.
CoRR, 2023

The effect of approximate coarsest-level solves on the convergence of multigrid V-cycle methods.
CoRR, 2023

Mixed Precision Rayleigh Quotient Iteration for Total Least Squares Problems.
CoRR, 2023

The stability of split-preconditioned FGMRES in four precisions.
CoRR, 2023

2022
Multistage mixed precision iterative refinement.
Numer. Linear Algebra Appl., 2022

Mixed precision s-step Lanczos and conjugate gradient algorithms.
Numer. Linear Algebra Appl., 2022

70 years of Krylov subspace methods: The journey continues.
CoRR, 2022

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

Single-pass Nyström approximation in mixed precision.
CoRR, 2022

Post-Modern GMRES.
CoRR, 2022

Mixed Precision GMRES-based Iterative Refinement with Recycling.
CoRR, 2022

Mixed Precision $s$-step Conjugate Gradient with Residual Replacement on GPUs.
Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

2021
The Stability of Block Variants of Classical Gram-Schmidt.
SIAM J. Matrix Anal. Appl., 2021

A survey of numerical linear algebra methods utilizing mixed-precision arithmetic.
Int. J. High Perform. Comput. Appl., 2021

Mixed Precision s-step Lanczos and Conjugate Gradient Algorithms.
CoRR, 2021

2020
Predict-and-Recompute Conjugate Gradient Variants.
SIAM J. Sci. Comput., 2020

Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems.
SIAM J. Sci. Comput., 2020

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

A Survey of Numerical Methods Utilizing Mixed Precision Arithmetic.
CoRR, 2020

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

2018
The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology.
SIAM J. Sci. Comput., 2018

Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions.
SIAM J. Sci. Comput., 2018

The Adaptive s-Step Conjugate Gradient Method.
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.
SIAM J. Sci. Comput., 2017

2016
Write-Avoiding Algorithms.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

2015
Communication-Avoiding Krylov Subspace Methods in Theory and Practice.
PhD thesis, 2015

Accuracy of the s-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision.
SIAM J. Matrix Anal. Appl., 2015

2014
A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of s-Step Krylov Subspace Methods.
SIAM J. Matrix Anal. Appl., 2014

Making tech more inclusive: an interview with Ashe Dryden.
XRDS, 2014

Communication lower bounds and optimal algorithms for numerical linear algebra.
Acta Numer., 2014

Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

2013
Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods.
SIAM J. Sci. Comput., 2013

Exploiting Data Sparsity in Parallel Matrix Powers Computations.
Proceedings of the Parallel Processing and Applied Mathematics, 2013

2007
Using flexible points in a developing simulation of selective dissolution in alloys.
Proceedings of the Winter Simulation Conference, 2007


  Loading...