default search action
Ilse C. F. Ipsen
Person information
- affiliation: North Carolina State University, Raleigh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j65]Christos Boutsikas
, Petros Drineas
Small Singular Values Can Increase in Lower Precision. SIAM J. Matrix Anal. Appl. 45(3): 1518-1540 (2024) - [i19]Gregory Dexter, Christos Boutsikas, Linkai Ma, Ilse C. F. Ipsen, Petros Drineas:
Stochastic Rounding Implicitly Regularizes Tall-and-Thin Matrices. CoRR abs/2403.12278 (2024) - [i18]James E. Garrsion, Ilse C. F. Ipsen:
A randomized preconditioned Cholesky-QR algorithm. CoRR abs/2406.11751 (2024) - [i17]Ilse C. F. Ipsen, Arvind K. Saibaba:
Stable Rank and Intrinsic Dimension of Real and Complex Matrices. CoRR abs/2407.21594 (2024) - [i16]Petros Drineas, Ilse C. F. Ipsen:
Stochastic Rounding 2.0, with a View towards Complexity Analysis. CoRR abs/2410.10517 (2024) - 2023
- [j64]Eric Hallman, Ilse C. F. Ipsen:
Precision-aware deterministic and probabilistic error bounds for floating point summation. Numerische Mathematik 155(1-2): 83-119 (2023) - [j63]Tim W. Reid, Ilse C. F. Ipsen, Jon Cockayne
Statistical properties of BayesCG under the Krylov prior. Numerische Mathematik 155(3-4): 239-288 (2023) - [j62]Eric Hallman
Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix. SIAM J. Matrix Anal. Appl. 44(1): 240-269 (2023) - [i15]Christos Boutsikas, Petros Drineas, Ilse C. F. Ipsen:
Small singular values can increase in lower precision. CoRR abs/2303.03547 (2023) - 2022
- [i14]Eric Hallman, Ilse C. F. Ipsen, Arvind K. Saibaba:
Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix. CoRR abs/2202.02887 (2022) - [i13]Eric Hallman, Ilse C. F. Ipsen:
Precision-aware Deterministic and Probabilistic Error Bounds for Floating Point Summation. CoRR abs/2203.15928 (2022) - [i12]Katherine J. Pearce, Ilse C. F. Ipsen, Mansoor A. Haider, Arvind K. Saibaba, Ralph C. Smith:
Robust Parameter Identifiability Analysis via Column Subset Selection. CoRR abs/2205.04203 (2022) - [i11]Tim W. Reid, Ilse C. F. Ipsen, Jon Cockayne, Chris J. Oates:
Statistical Properties of the Probabilistic Numeric Linear Solver BayesCG. CoRR abs/2208.03885 (2022) - 2021
- [j61]Jon Cockayne, Ilse C. F. Ipsen, Chris J. Oates, Tim W. Reid
Probabilistic Iterative Methods for Linear Systems. J. Mach. Learn. Res. 22: 232:1-232:34 (2021) - [i10]Eric Hallman, Ilse C. F. Ipsen:
Deterministic and Probabilistic Error Bounds for Floating Point Summation Algorithms. CoRR abs/2107.01604 (2021) - [i9]Philipp Hennig, Ilse C. F. Ipsen, Maren Mahsereci, Tim Sullivan:
Probabilistic Numerical Methods - From Theory to Implementation (Dagstuhl Seminar 21432). Dagstuhl Reports 11(9): 102-119 (2021) - 2020
- [j60]Ilse C. F. Ipsen
Probabilistic Error Analysis for Inner Products. SIAM J. Matrix Anal. Appl. 41(4): 1726-1741 (2020) - [i8]Jocelyn T. Chi, Ilse C. F. Ipsen:
Multiplicative Perturbation Bounds for Multivariate Multiple Linear Regression in Schatten p-Norms. CoRR abs/2007.06099 (2020) - [i7]Tim W. Reid
A Probabilistic Numerical Extension of the Conjugate Gradient Method. CoRR abs/2008.03225 (2020) - [i6]Jon Cockayne
Probabilistic Iterative Methods for Linear Systems. CoRR abs/2012.12615 (2020)
2010 – 2019
- 2019
- [j59]Mark A. Girolami
Editorial: special edition on probabilistic numerics. Stat. Comput. 29(6): 1181-1183 (2019) - [j58]Simon Bartels, Jon Cockayne
Probabilistic linear solvers: a unifying view. Stat. Comput. 29(6): 1249-1263 (2019) - [j57]Petros Drineas
Low-Rank Matrix Approximations Do Not Need a Singular Value Gap. SIAM J. Matrix Anal. Appl. 40(1): 299-319 (2019) - [i5]Ilse C. F. Ipsen, Hua Zhou:
Probabilistic Error Analysis for Inner Products. CoRR abs/1906.10465 (2019) - 2018
- [j56]Petros Drineas
Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces. SIAM J. Matrix Anal. Appl. 39(2): 567-586 (2018) - [j55]John T. Holodnak, Ilse C. F. Ipsen
A Probabilistic Subspace Bound with Application to Active Subspaces. SIAM J. Matrix Anal. Appl. 39(3): 1208-1220 (2018) - [i4]Jocelyn T. Chi, Ilse C. F. Ipsen:
Randomized Least Squares Regression: Combining Model- and Algorithm-Induced Uncertainties. CoRR abs/1808.05924 (2018) - 2017
- [j54]Arvind K. Saibaba
Randomized matrix-free trace and log-determinant estimators. Numerische Mathematik 137(2): 353-395 (2017) - 2016
- [i3]Petros Drineas, Ilse Ipsen, Eugenia-Maria Kontopoulou, Malik Magdon-Ismail:
Structural Convergence Results for Low-Rank Approximations from Block Krylov Spaces. CoRR abs/1609.00671 (2016) - 2015
- [j53]John T. Holodnak, Ilse C. F. Ipsen
Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds. SIAM J. Matrix Anal. Appl. 36(1): 110-137 (2015) - [j52]John T. Holodnak, Ilse C. F. Ipsen
Conditioning of Leverage Scores and Computation by QR Decomposition. SIAM J. Matrix Anal. Appl. 36(3): 1143-1163 (2015) - 2014
- [j51]Ilse C. F. Ipsen
The Effect of Coherence on Sampling from Matrices with Orthonormal Columns, and Preconditioned Least Squares Problems. SIAM J. Matrix Anal. Appl. 35(4): 1490-1520 (2014) - [i2]Thomas Wentworth, Ilse Ipsen:
kappa_SQ: A Matlab package for randomized sampling of matrices with orthonormal columns. CoRR abs/1402.0642 (2014) - 2013
- [i1]John T. Holodnak, Ilse C. F. Ipsen:
Randomized Matrix Multiplication: Exact Computation and Probabilistic Bounds. CoRR abs/1310.1502 (2013) - 2012
- [j50]Ilse Ipsen
Research Spotlights. SIAM Rev. 54(1): 119 (2012) - 2011
- [j49]Rizwana Rehman, Ilse C. F. Ipsen
Computing Characteristic Polynomials from Eigenvalues. SIAM J. Matrix Anal. Appl. 32(1): 90-114 (2011) - [j48]Ilse C. F. Ipsen
Ergodicity Coefficients Defined by Vector Norms. SIAM J. Matrix Anal. Appl. 32(1): 153-200 (2011) - [j47]Ilse C. F. Ipsen
Rank-Deficient Nonlinear Least Squares Problems and Subset Selection. SIAM J. Numer. Anal. 49(3): 1244-1266 (2011) - [j46]Ilse Ipsen:
Expository Research Papers. SIAM Rev. 53(1): 69 (2011) - [j45]Ilse Ipsen:
Expository Research Papers. SIAM Rev. 53(2): 289 (2011) - [j44]Ilse Ipsen:
Expository Research Papers. SIAM Rev. 53(3): 503 (2011) - [j43]Ilse Ipsen:
Expository Research Papers. SIAM Rev. 53(4): 721 (2011) - [j42]Sylvester David Eriksson-Bique
Importance Sampling for a Monte Carlo Matrix Multiplication Algorithm, with Application to Information Retrieval. SIAM J. Sci. Comput. 33(4): 1689-1706 (2011) - 2010
- [j41]Ilse Ipsen:
Expository Research Papers. SIAM Rev. 52(1): 55 (2010) - [j40]Ilse Ipsen:
Expository Research Papers. SIAM Rev. 52(2): 267 (2010) - [j39]Ilse Ipsen:
Expository Research Papers. SIAM Rev. 52(3): 453 (2010) - [j38]Ilse Ipsen:
Expository Research Papers. SIAM Rev. 52(4): 675 (2010)
2000 – 2009
- 2009
- [b1]Ilse C. F. Ipsen:
Numerical Matrix Analysis - Linear Systems and Least Squares. SIAM 2009, ISBN 978-0-89871-676-4, pp. I-XIII, 1-128 - [j37]Ilse C. F. Ipsen
Special Issue on Accurate Solution of Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 31(1) (2009) - [j36]Ilse C. F. Ipsen
Refined Perturbation Bounds for Eigenvalues of Hermitian and Non-Hermitian Matrices. SIAM J. Matrix Anal. Appl. 31(1): 40-53 (2009) - [j35]Ilse C. F. Ipsen:
Problems and Techniques. SIAM Rev. 51(1): 127 (2009) - [j34]Ilse C. F. Ipsen:
Problems and Techniques. SIAM Rev. 51(2): 337 (2009) - [j33]Ilse C. F. Ipsen:
Problems and Techniques. SIAM Rev. 51(3): 543 (2009) - [j32]Ilse C. F. Ipsen:
Problems and Techniques. SIAM Rev. 51(4): 705 (2009) - 2008
- [j31]Ilse C. F. Ipsen
Perturbation Bounds for Determinants and Characteristic Polynomials. SIAM J. Matrix Anal. Appl. 30(2): 762-776 (2008) - [j30]Rebecca S. Wills, Ilse C. F. Ipsen
Ordinal Ranking for Google's PageRank. SIAM J. Matrix Anal. Appl. 30(4): 1677-1696 (2008) - [j29]Ilse Ipsen:
Problems and Techniques. SIAM Rev. 50(1): 35 (2008) - [j28]Ilse Ipsen:
Problems and Techniques. SIAM Rev. 50(2): 273 (2008) - [j27]Ilse Ipsen:
Problems and Techniques. SIAM Rev. 50(3): 483 (2008) - [j26]Ilse Ipsen:
Problems and Techniques. SIAM Rev. 50(4): 721 (2008) - 2007
- [j25]Ilse C. F. Ipsen
PageRank Computation, with Special Attention to Dangling Nodes. SIAM J. Matrix Anal. Appl. 29(4): 1281-1296 (2007) - [j24]K. I. Dickson, C. T. Kelley, Ilse C. F. Ipsen, Ioannis G. Kevrekidis:
Condition Estimates for Pseudo-Arclength Continuation. SIAM J. Numer. Anal. 45(1): 263-276 (2007) - [j23]Ilse Ipsen:
Problems and Techniques. SIAM Rev. 49(1): 33-34 (2007) - [j22]Ilse Ipsen:
Problems and Techniques. SIAM Rev. 49(2): 209 (2007) - [j21]Ilse Ipsen:
Problems and Techniques. SIAM Rev. 49(3): 419-420 (2007) - [j20]Ilse Ipsen:
Problems and Techniques. SIAM Rev. 49(4): 593 (2007) - 2006
- [j19]Ilse C. F. Ipsen
Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer. SIAM J. Matrix Anal. Appl. 27(4): 952-967 (2006) - [j18]Ilse C. F. Ipsen
Special Issue on Accurate Solution Of Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 28(4) (2006) - [j17]Ilse Ipsen:
Problems and Techniques. SIAM Rev. 48(1): 41-42 (2006) - [j16]Ilse Ipsen:
Problems and Techniques. SIAM Rev. 48(2): 305 (2006) - [j15]Daniel E. Finkel, Christopher M. Kuster, Matthew S. Lasater, Rachel Levy, Jill P. Reese, Ilse C. F. Ipsen
Communicating Applied Mathematics: Four Examples. SIAM Rev. 48(2): 359-389 (2006) - [j14]Ilse Ipsen:
Problems and Techniques. SIAM Rev. 48(3): 485 (2006) - [j13]Ilse Ipsen:
Problems and Techniques. SIAM Rev. 48(4): 679-680 (2006) - 2005
- [j12]Ilse Ipsen:
Problems and Techniques. SIAM Rev. 47(4): 707 (2005) - 2001
- [j11]Ilse C. F. Ipsen
A Note on Preconditioning Nonsymmetric Matrices. SIAM J. Sci. Comput. 23(3): 1050-1051 (2001)
1990 – 1999
- 1998
- [j10]Stanley C. Eisenstat, Ilse C. F. Ipsen
Three Absolute Perturbation Bounds for Matrix Eigenvalues Imply Relative Bounds. SIAM J. Matrix Anal. Appl. 20(1): 149-158 (1998) - [j9]James M. Banoczi, Nan-Chieh Chiu, Grace E. Cho, Ilse C. F. Ipsen:
The Lack of Influence of the Right-Hand Side on the Accuracy of Linear System Solution. SIAM J. Sci. Comput. 20(1): 203-227 (1998) - 1997
- [j8]Ilse C. F. Ipsen:
Computing an Eigenvector with Inverse Iteration. SIAM Rev. 39(2): 254-291 (1997) - 1995
- [j7]S. Chandrasekaran, Ilse C. F. Ipsen:
On the Sensitivity of Solution Components in Linear Systems of Equations. SIAM J. Matrix Anal. Appl. 16(1): 93-112 (1995) - [j6]S. Chandrasekaran, Ilse C. F. Ipsen:
Analysis of a QR Algorithm for Computing Singular Values. SIAM J. Matrix Anal. Appl. 16(2): 520-535 (1995) - 1994
- [j5]Shivkumar Chandrasekaran, Ilse C. F. Ipsen:
On Rank-Revealing Factorisations. SIAM J. Matrix Anal. Appl. 15(2): 592-622 (1994) - [j4]Ilse C. F. Ipsen, Carl Dean Meyer:
Uniform Stability of Markov Chains. SIAM J. Matrix Anal. Appl. 15(4): 1061-1074 (1994) - 1992
- [j3]Elizabeth R. Jessup, Ilse C. F. Ipsen:
Improving the Accuracy of Inverse Iteration. SIAM J. Sci. Comput. 13(2): 550-572 (1992) - 1990
- [j2]Ilse C. F. Ipsen, Elizabeth R. Jessup:
Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube. SIAM J. Sci. Comput. 11(2): 203-229 (1990)
1980 – 1989
- 1989
- [j1]William Gropp
Recursive Mesh Refinement on Hypercubes. BIT 29(2): 186-211 (1989) - [c2]Jean-Marc Delosme, Ilse C. F. Ipsen:
Parallel Computation of Algorithms with Uniform Dependences. PP 1989: 319-325 - 1987
- [c1]William Gropp, Ilse C. F. Ipsen:
A Gray-Code Schmee for Mesh Refinement on Hypercubes. PP 1987: 202-206
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 20:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: