Erin Claire Carson

I am a PhD candidate in Computer Science at U.C. Berkeley, advised by James Demmel and Armando Fox.

I am affiliated with the Berkeley Benchmarking and Optimization Group (BeBOp) within the ASPIRE Lab.

I am also a student in the Designated Emphasis in Computational Science and Engineering Program.

My research sits at the intersection of high performance computing, parallel algorithms, scientific computing, and numerical linear algebra.

The course of my life (so far).



Office

586E Soda Hall
Computer Science Division
University of California at Berkeley
Berkeley, CA 94720-1776
Email: carson@cs.berkeley.edu

Publications

My Google Scholar profile

Journal Papers

  • E. Carson and J. Demmel, Accuracy of the s-step Lanczos Method for the Symmetric Eigenproblem in Finite Precision, SIAM J. Matrix Anal. Appl. (submitted).
  • E. Solomonik, E. Carson, N. Knight, and J. Demmel, Tradeoffs between Synchronization, Communication, and Computation in Parallel Linear Algebra Computations, ACM Trans. Parallel Comput. (submitted).
  • G. Ballard, E. Carson, J. Demmel, M. Hoemmen, N. Knight, and O.Schwartz, Communication Lower Bounds and Optimal Algorithms for Numerical Linear Algebra, Acta Numerica, 23 (2014), pp. 1-155.
  • N. Knight, E. Carson and J. Demmel. Exploiting Data Sparsity in Parallel Matrix Powers Computations, in Parallel Processing and Applied Mathematics, R. Wyrzykowski, J. Dongarra, K. Karczewski, and J. Waniewski, eds., Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2014, pp.15-25.
  • E. Carson and J. Demmel. A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of s-Step Krylov Subspace Methods. SIAM J. Matrix Anal. Appl. 35(1), 2014.
  • E. Carson, N. Knight, and J. Demmel. Avoiding Communication in Nonsymmetric Lanczos-based Krylov Subspace Methods. SIAM J. Sci. Comp. 35 (5), 2013.

Conference Papers

  • E. Solomonik, E. Carson, N. Knight, and J. Demmel. Tradeoffs Between Synchronization, Communication, and Work in Parallel Linear Algebra Computations. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2014.
  • S. Williams, E. Carson, M. Lijewski, N. Knight, A. Almgren, B. Van Straalen, and J. Demmel. s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid. In Proceedings of the 28th IEEE International Parallel and Distributed Processing Symposium, 2014.

Technical Reports

  • E. Carson and J. Demmel. Accuracy of the s-Step Lanczos Method for the Symmetric Eigenproblem. Technical Report UCB/EECS-2014-165, U.C. Berkeley, September 2014. [pdf]
  • E. Carson and J. Demmel. Error Analysis of the s-Step Lanczos Method in Finite Precision. Technical Report UCB/EECS-2014-55, U.C. Berkeley, May 2014. [pdf]
  • E. Carson and J. Demmel. Analysis of the Finite Precision s-step Biconjugate Gradient Method. Technical Report UCB/EECS-2014-18, EECS Dept., U.C. Berkeley, March 2014. [pdf]
  • E. Solomonik, E. Carson, N. Knight, and J. Demmel. Tradeoffs between Synchronization, Communication, and Work in Parallel Linear Algebra Computations. Technical Report UCB/EECS-2014-8, EECS Dept., U.C. Berkeley, January 2014. [pdf]
  • E. Carson and J. Demmel. A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of s-step Krylov Subspace Methods. Technical Report UCB/EECS-2012-197, EECS Dept., U.C. Berkeley, September 2012. [pdf]
  • E. Carson, N. Knight, and J. Demmel. Avoiding Communication in Two-sided Krylov Subspace Methods. Technical Report UCB/EECS-2011-93, EECS Dept., U.C. Berkeley, August 2011. [pdf]

Talks and Extended Abstracts

  • "Avoiding Communication in Bottom Solvers for Geometric Multigrid Methods", 8th International Workshop on Parallel Matrix Algorithms and Applications, Lugano, Switzerland, July 2-4, 2014. [pdf]
  • "Improving the Maximum Attainable Accuracy of Communication-Avoiding Krylov Subspace Methods", Householder Symposium XIX, Spa, Belgium, June 8-13, 2014. [pptx]
  • S. Williams, E. Carson, N. Knight, M. Lijewski, A. Almgren, B. van Straalen and J. Demmel. "Avoiding synchronization in geometric multigrid". SIAM Parallel Processing for Scientific Computing, Portland, Oregon, February 18-21, 2014. [abstract][pptx]
  • "Communication-Avoiding Krylov Subspace Methods in Finite Precision", Bay Area Scientific Computing Day, December 11, 2013. [abstract][pptx]
  • E. Carson and J. Demmel. "Efficient Deflation for Communication-Avoiding Krylov Methods" (extended abstract). Numerical Analysis and Scientific Computation with Applications, Calais, France, June 24-26, 2013. [pdf]
  • E. Carson, N. Knight, and J. Demmel. "Improving the Stability of Communication-Avoiding Krylov Subspace Methods", SIAM Conference on Applied Linear Algebra, Valencia, Spain, June 18-22, 2012.
  • E. Carson, N. Knight, and J. Demmel. "Exploiting Low-Rank Structure in Computing Matrix Powers with Applications to Preconditioning", SIAM Conference on Parallel Processing for Scientific Computing, Savannah, Georgia, February 15-17, 2012 [ pdf | pptx ]
  • E. Carson and J. Demmel. "A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of Communication-Avoiding Krylov Subspace Methods", 9th International Workshop on Accurate Solution of Eigenvalue Problems, Napa Valley, CA, June 4-7, 2012.
  • E. Carson, N. Knight, and J. Demmel. "Hypergraph partitioning for Computing Matrix Powers" (extended abstract), Fifth SIAM Workshop on Comb. Sci. Comput., pages 3133, Darmstadt, Germany, May 2011. [pdf]
  • "Recent Progress in Communication-Avoiding Krylov Subspace Methods", Bay Area Scientific Computing Day, Palo Alto, California, May 11, 2011.
  • "Recent Work in Communication-Avoiding Krylov Subspace Methods for Solving Linear Systems", Matrix Computations Seminar, Berkeley, California, October 27, 2010.

Past Projects


Teaching

U.C. Berkeley

  • CS 70: Discrete Mathematics and Probability Theory, Fall 2014. Instructor: Anant Sahai. Topics: Logic, infinity, and induction; applications include undecidability and stable marriage problem. Modular arithmetic and GCDs; applications include primality testing and cryptography. Polynomials; examples include error correcting codes and interpolation. Probability including sample spaces, independence, random variables, law of large numbers; examples include load balancing, existence arguments, Bayesian inference.
  • Math 54: Linear Algebra and Differential Equations, Spring 2011. Instructor: Constantin Teleman. Topics: Basic linear algebra; matrix arithmetic and determinants. Vector spaces; inner product as spaces. Eigenvalues and eigenvectors; linear transformations. Homogeneous ordinary differential equations; first-order differential equations with constant coefficients. Fourier series and partial differential equations.

University of Virginia


Activities

Since 2009, I've served as a Feature Editor for ACM's XRDS Magazine.