Ilse C. F. Ipsen - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 46 from 46

2023

Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric MatrixEric Hallman, Ilse C. F. Ipsen, Arvind K. Saibaba. siammax, 44(1):240-269, March 2023. [doi]

Precision-aware deterministic and probabilistic error bounds for floating point summationEric Hallman, Ilse C. F. Ipsen. nm, 155(1):83-119, October 2023. [doi]

Statistical properties of BayesCG under the Krylov priorTim W. Reid, Ilse C. F. Ipsen, Jon Cockayne, Chris J. Oates. nm, 155(3-4):239-288, December 2023. [doi]

2021

Probabilistic Iterative Methods for Linear SystemsJon Cockayne, Ilse C. F. Ipsen, Chris J. Oates, Tim W. Reid. jmlr, 22, 2021. [doi]

Probabilistic Numerical Methods - From Theory to Implementation (Dagstuhl Seminar 21432)Philipp Hennig, Ilse C. F. Ipsen, Maren Mahsereci, Tim Sullivan 0001. dagstuhl-reports, 11(9):102-119, 2021. [doi]

2020

Probabilistic Error Analysis for Inner ProductsIlse C. F. Ipsen, Hua Zhou. siammax, 41(4):1726-1741, 2020. [doi]

2019

Probabilistic linear solvers: a unifying viewSimon Bartels, Jon Cockayne, Ilse C. F. Ipsen, Philipp Hennig. sac, 29(6):1249-1263, 2019. [doi]

Low-Rank Matrix Approximations Do Not Need a Singular Value GapPetros Drineas, Ilse C. F. Ipsen. siammax, 40(1):299-319, 2019. [doi]

Editorial: special edition on probabilistic numericsMark A. Girolami, Ilse C. F. Ipsen, Chris J. Oates, Art B. Owen, Timothy John Sullivan. sac, 29(6):1181-1183, 2019. [doi]

2018

Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov SpacesPetros Drineas, Ilse C. F. Ipsen, Eugenia-Maria Kontopoulou, Malik Magdon-Ismail. siammax, 39(2):567-586, 2018. [doi]

A Probabilistic Subspace Bound with Application to Active SubspacesJohn T. Holodnak, Ilse C. F. Ipsen, Ralph C. Smith. siammax, 39(3):1208-1220, 2018. [doi]

2017

Randomized matrix-free trace and log-determinant estimatorsArvind K. Saibaba, Alen Alexanderian, Ilse C. F. Ipsen. nm, 137(2):353-395, 2017. [doi]

2015

Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic BoundsJohn T. Holodnak, Ilse C. F. Ipsen. siammax, 36(1):110-137, 2015. [doi]

Conditioning of Leverage Scores and Computation by QR DecompositionJohn T. Holodnak, Ilse C. F. Ipsen, Thomas Wentworth. siammax, 36(3):1143-1163, 2015. [doi]

2014

The Effect of Coherence on Sampling from Matrices with Orthonormal Columns, and Preconditioned Least Squares ProblemsIlse C. F. Ipsen, Thomas Wentworth. siammax, 35(4):1490-1520, 2014. [doi]

2011

2009

Numerical Matrix Analysis - Linear Systems and Least SquaresIlse C. F. Ipsen. SIAM, 2009. [doi]

Special Issue on Accurate Solution of Eigenvalue ProblemsIlse C. F. Ipsen. siammax, 31(1), 2009. [doi]

Refined Perturbation Bounds for Eigenvalues of Hermitian and Non-Hermitian MatricesIlse C. F. Ipsen, B. Nadler. siammax, 31(1):40-53, 2009. [doi]

Problems and TechniquesIlse C. F. Ipsen. siamrev, 51(2):337, 2009. [doi]

Problems and TechniquesIlse C. F. Ipsen. siamrev, 51(3):543, 2009. [doi]

Problems and TechniquesIlse C. F. Ipsen. siamrev, 51(1):127, 2009. [doi]

Problems and TechniquesIlse C. F. Ipsen. siamrev, 51(4):705, 2009. [doi]

2008

Perturbation Bounds for Determinants and Characteristic PolynomialsIlse C. F. Ipsen, Rizwana Rehman. siammax, 30(2):762-776, 2008. [doi]

Ordinal Ranking for Google s PageRankRebecca S. Wills, Ilse C. F. Ipsen. siammax, 30(4):1677-1696, 2008. [doi]

2007

Condition Estimates for Pseudo-Arclength ContinuationK. I. Dickson, C. T. Kelley, Ilse C. F. Ipsen, I. G. Kevrekidis. siamnum, 45(1):263-276, 2007. [doi]

PageRank Computation, with Special Attention to Dangling NodesIlse C. F. Ipsen, Teresa M. Selee. siammax, 29(4):1281-1296, 2007. [doi]

2006

Communicating Applied Mathematics: Four ExamplesDaniel E. Finkel, Christopher M. Kuster, Matthew S. Lasater, Rachel Levy, Jill P. Reese, Ilse C. F. Ipsen. siamrev, 48(2):359-389, 2006. [doi]

Special Issue on Accurate Solution Of Eigenvalue ProblemsIlse C. F. Ipsen. siammax, 28(4), 2006. [doi]

Convergence Analysis of a PageRank Updating Algorithm by Langville and MeyerIlse C. F. Ipsen, Steve Kirkland. siammax, 27(4):952-967, 2006. [doi]

2001

A Note on Preconditioning Nonsymmetric MatricesIlse C. F. Ipsen. siamsc, 23(3):1050-1051, 2001. [doi]

1998

The Lack of Influence of the Right-Hand Side on the Accuracy of Linear System SolutionJames M. Banoczi, Nan-Chieh Chiu, Grace E. Cho, Ilse C. F. Ipsen. siamsc, 20(1):203-227, 1998. [doi]

Three Absolute Perturbation Bounds for Matrix Eigenvalues Imply Relative BoundsStanley C. Eisenstat, Ilse C. F. Ipsen. siammax, 20(1):149-158, 1998. [doi]

1997

Computing an Eigenvector with Inverse IterationIlse C. F. Ipsen. siamrev, 39(2):254-291, 1997. [doi]

1995

On the Sensitivity of Solution Components in Linear Systems of EquationsS. Chandrasekaran, Ilse C. F. Ipsen. siammax, 16(1):93-112, 1995. [doi]

Analysis of a QR Algorithm for Computing Singular ValuesS. Chandrasekaran, Ilse C. F. Ipsen. siammax, 16(2):520-535, 1995. [doi]

1994

On Rank-Revealing FactorisationsShivkumar Chandrasekaran, Ilse C. F. Ipsen. siammax, 15(2):592-622, April 1994. [doi]

Uniform Stability of Markov ChainsIlse C. F. Ipsen, Carl Dean Meyer. siammax, 15(4):1061-1074, October 1994. [doi]

1992

Improving the Accuracy of Inverse IterationElizabeth R. Jessup, Ilse C. F. Ipsen. siamsc, 13(2):550-572, 1992. [doi]

1990

Solving the Symmetric Tridiagonal Eigenvalue Problem on the HypercubeIlse C. F. Ipsen, Elizabeth R. Jessup. siamsc, 11(2):203-229, 1990. [doi]

1989

Parallel Computation of Algorithms with Uniform DependencesJean-Marc Delosme, Ilse C. F. Ipsen. ppsc 1990: 319-325

Recursive Mesh Refinement on HypercubesWilliam Gropp, Ilse C. F. Ipsen. bit, 29(2):186-211, 1989.

1987

A Gray-Code Schmee for Mesh Refinement on HypercubesWilliam Gropp, Ilse C. F. Ipsen. ppsc 1989: 202-206

Sign in or sign up to see more results.

runs on WebDSL