A Gray-Code Schmee for Mesh Refinement on Hypercubes. - William Gropp; Ilse C. F. Ipsen (PP, 1987)

Parallel Computation of Algorithms with Uniform Dependences. - Jean-Marc Delosme; Ilse C. F. Ipsen (PP, 1989)

Recursive Mesh Refinement on Hypercubes. - William Gropp; Ilse C. F. Ipsen (BIT, 1989)

Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube. - Ilse C. F. Ipsen; Elizabeth R. Jessup (SIAM J. Sci. Comput., 1990)

Improving the Accuracy of Inverse Iteration. - Elizabeth R. Jessup; Ilse C. F. Ipsen (SIAM J. Sci. Comput., 1992)

On Rank-Revealing Factorisations. - Shivkumar Chandrasekaran; Ilse C. F. Ipsen (SIAM J. Matrix Anal. Appl., 1994)

Uniform Stability of Markov Chains. - Ilse C. F. Ipsen; Carl Dean Meyer (SIAM J. Matrix Anal. Appl., 1994)

On the Sensitivity of Solution Components in Linear Systems of Equations. - S. Chandrasekaran; Ilse C. F. Ipsen (SIAM J. Matrix Anal. Appl., 1995)

Analysis of a QR Algorithm for Computing Singular Values. - S. Chandrasekaran; Ilse C. F. Ipsen (SIAM J. Matrix Anal. Appl., 1995)

Computing an Eigenvector with Inverse Iteration. - Ilse C. F. Ipsen (SIAM Rev., 1997)

Three Absolute Perturbation Bounds for Matrix Eigenvalues Imply Relative Bounds. - Stanley C. Eisenstat; Ilse C. F. Ipsen (SIAM J. Matrix Anal. Appl., 1998)

The Lack of Influence of the Right-Hand Side on the Accuracy of Linear System Solution. - James M. Banoczi; Nan-Chieh Chiu; Grace E. Cho; Ilse C. F. Ipsen (SIAM J. Sci. Comput., 1998)

A Note on Preconditioning Nonsymmetric Matrices. - Ilse C. F. Ipsen (SIAM J. Sci. Comput., 2001)

Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer. - Ilse C. F. Ipsen; Steve Kirkland (SIAM J. Matrix Anal. Appl., 2006)

Communicating Applied Mathematics: Four Examples. - Daniel E. Finkel; Christopher M. Kuster; Matthew S. Lasater; Rachel Levy; Jill P. Reese; Ilse C. F. Ipsen (SIAM Rev., 2006)

PageRank Computation, with Special Attention to Dangling Nodes. - Ilse C. F. Ipsen; Teresa M. Selee (SIAM J. Matrix Anal. Appl., 2007)

Condition Estimates for Pseudo-Arclength Continuation. - K. I. Dickson; C. T. Kelley; Ilse C. F. Ipsen; Ioannis G. Kevrekidis (SIAM J. Numer. Anal., 2007)

Perturbation Bounds for Determinants and Characteristic Polynomials. - Ilse C. F. Ipsen; Rizwana Rehman (SIAM J. Matrix Anal. Appl., 2008)

Ordinal Ranking for Google's PageRank. - Rebecca S. Wills; Ilse C. F. Ipsen (SIAM J. Matrix Anal. Appl., 2008)

Numerical Matrix Analysis - Linear Systems and Least Squares. - Ilse C. F. Ipsen (SIAM, 2009)

Special Issue on Accurate Solution of Eigenvalue Problems. - Ilse C. F. Ipsen (SIAM J. Matrix Anal. Appl., 2009)

Refined Perturbation Bounds for Eigenvalues of Hermitian and Non-Hermitian Matrices. - Ilse C. F. Ipsen; Boaz Nadler (SIAM J. Matrix Anal. Appl., 2009)

Problems and Techniques. - Ilse C. F. Ipsen (SIAM Rev., 2009)

Ergodicity Coefficients Defined by Vector Norms. - Ilse C. F. Ipsen; Teresa M. Selee (SIAM J. Matrix Anal. Appl., 2011)

Computing Characteristic Polynomials from Eigenvalues. - Rizwana Rehman; Ilse C. F. Ipsen (SIAM J. Matrix Anal. Appl., 2011)

Rank-Deficient Nonlinear Least Squares Problems and Subset Selection. - Ilse C. F. Ipsen; C. T. Kelley; S. R. Pope (SIAM J. Numer. Anal., 2011)

Expository Research Papers. - Ilse Ipsen (SIAM Rev., 2011)

Importance Sampling for a Monte Carlo Matrix Multiplication Algorithm, with Application to Information Retrieval. - Sylvester David Eriksson-Bique; Mary Solbrig; Michael Stefanelli; Sarah Warkentin; Ralph Abbey; Ilse C. F. Ipsen (SIAM J. Sci. Comput., 2011)

Research Spotlights. - Ilse Ipsen (SIAM Rev., 2012)

Randomized Matrix Multiplication: Exact Computation and Probabilistic Bounds. - John T. Holodnak; Ilse C. F. Ipsen (CoRR, 2013)

kappa_SQ: A Matlab package for randomized sampling of matrices with orthonormal columns. - Thomas Wentworth; Ilse Ipsen (CoRR, 2014)

The Effect of Coherence on Sampling from Matrices with Orthonormal Columns, and Preconditioned Least Squares Problems. - Ilse C. F. Ipsen; Thomas Wentworth (SIAM J. Matrix Anal. Appl., 2014)

Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds. - John T. Holodnak; Ilse C. F. Ipsen (SIAM J. Matrix Anal. Appl., 2015)

Conditioning of Leverage Scores and Computation by QR Decomposition. - John T. Holodnak; Ilse C. F. Ipsen; Thomas Wentworth (SIAM J. Matrix Anal. Appl., 2015)

Structural Convergence Results for Low-Rank Approximations from Block Krylov Spaces. - Petros Drineas; Ilse Ipsen; Eugenia-Maria Kontopoulou; Malik Magdon-Ismail (CoRR, 2016)

Randomized matrix-free trace and log-determinant estimators. - Arvind K. Saibaba; Alen Alexanderian; Ilse C. F. Ipsen (Numerische Mathematik, 2017)

Randomized Least Squares Regression: Combining Model- and Algorithm-Induced Uncertainties. - Jocelyn T. Chi; Ilse C. F. Ipsen (CoRR, 2018)

Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces. - Petros Drineas; Ilse C. F. Ipsen; Eugenia-Maria Kontopoulou; Malik Magdon-Ismail (SIAM J. Matrix Anal. Appl., 2018)

A Probabilistic Subspace Bound with Application to Active Subspaces. - John T. Holodnak; Ilse C. F. Ipsen; Ralph C. Smith (SIAM J. Matrix Anal. Appl., 2018)

Probabilistic linear solvers: a unifying view. - Simon Bartels; Jon Cockayne; Ilse C. F. Ipsen; Philipp Hennig (Stat. Comput., 2019)

Editorial: special edition on probabilistic numerics. - Mark A. Girolami; Ilse C. F. Ipsen; Chris J. Oates; Art B. Owen; Timothy John Sullivan (Stat. Comput., 2019)

Low-Rank Matrix Approximations Do Not Need a Singular Value Gap. - Petros Drineas; Ilse C. F. Ipsen (SIAM J. Matrix Anal. Appl., 2019)

Multiplicative Perturbation Bounds for Multivariate Multiple Linear Regression in Schatten p-Norms. - Jocelyn T. Chi; Ilse C. F. Ipsen (CoRR, 2020)

A Probabilistic Numerical Extension of the Conjugate Gradient Method. - Tim W. Reid; Ilse C. F. Ipsen; Jon Cockayne; Chris J. Oates (CoRR, 2020)

Probabilistic Error Analysis for Inner Products. - Ilse C. F. Ipsen; Hua Zhou 001 (SIAM J. Matrix Anal. Appl., 2020)

Deterministic and Probabilistic Error Bounds for Floating Point Summation Algorithms. - Eric Hallman; Ilse C. F. Ipsen (CoRR, 2021)

Probabilistic Numerical Methods - From Theory to Implementation (Dagstuhl Seminar 21432). - Philipp Hennig; Ilse C. F. Ipsen; Maren Mahsereci; Tim Sullivan 001 (Dagstuhl Reports, 2021)

Probabilistic Iterative Methods for Linear Systems. - Jon Cockayne; Ilse C. F. Ipsen; Chris J. Oates; Tim W. Reid (J. Mach. Learn. Res., 2021)

Robust Parameter Identifiability Analysis via Column Subset Selection. - Katherine J. Pearce; Ilse C. F. Ipsen; Mansoor A. Haider; Arvind K. Saibaba; Ralph C. Smith (CoRR, 2022)

Statistical Properties of the Probabilistic Numeric Linear Solver BayesCG. - Tim W. Reid; Ilse C. F. Ipsen; Jon Cockayne; Chris J. Oates (CoRR, 2022)

Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix. - Eric Hallman; Ilse C. F. Ipsen; Arvind K. Saibaba (SIAM J. Matrix Anal. Appl., 2023)

Precision-aware deterministic and probabilistic error bounds for floating point summation. - Eric Hallman; Ilse C. F. Ipsen (Numerische Mathematik, 2023)

Statistical properties of BayesCG under the Krylov prior. - Tim W. Reid; Ilse C. F. Ipsen; Jon Cockayne; Chris J. Oates (Numerische Mathematik, 2023)

A randomized preconditioned Cholesky-QR algorithm. - James E. Garrsion; Ilse C. F. Ipsen (CoRR, 2024)

Stable Rank and Intrinsic Dimension of Real and Complex Matrices. - Ilse C. F. Ipsen; Arvind K. Saibaba (CoRR, 2024)

Stochastic Rounding 2.0, with a View towards Complexity Analysis. - Petros Drineas; Ilse C. F. Ipsen (CoRR, 2024)

Small Singular Values Can Increase in Lower Precision. - Christos Boutsikas; Petros Drineas; Ilse C. F. Ipsen (SIAM J. Matrix Anal. Appl., 2024)

Stochastic Rounding Implicitly Regularizes Tall-and-Thin Matrices. - Gregory Dexter; Christos Boutsikas; Linkai Ma; Ilse C. F. Ipsen; Petros Drineas (SIAM J. Matrix Anal. Appl., 2025)

Solution of Least Squares Problems with Randomized Preconditioned Normal Equations. - Ilse C. F. Ipsen (CoRR, 2025)