Ilse Ipsen

Hallman, E., Ipsen, I. C. F., & Saibaba, A. K. (2023). MONTE CARLO METHODS FOR ESTIMATING THE DIAGONAL OF A REAL SYMMETRIC MATRIX. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 44(1), 240–269. https://doi.org/10.1137/22M1476277

Hallman, E., & Ipsen, I. C. F. (2023, August 30). Precision-aware deterministic and probabilistic error bounds for floating point summation. NUMERISCHE MATHEMATIK, Vol. 8. https://doi.org/10.1007/s00211-023-01370

Hallman, E., & Ipsen, I. C. F. (2023). Precision-aware deterministic and probabilistic error bounds for floating point summation. NUMERISCHE MATHEMATIK, 155(1-2), 83–119. https://doi.org/10.1007/s00211-023-01370-y

Reid, T. W., Ipsen, I. C. F., Cockayne, J., & Oates, C. J. (2023, October 12). Statistical properties of BayesCG under the Krylov prior. NUMERISCHE MATHEMATIK, Vol. 10. https://doi.org/10.1007/s00211-023-01375-7

Chi, J. T., & Ipsen, I. C. F. (2021, August 11). A projector-based approach to quantifying total and excess uncertainties for sketched linear regression. INFORMATION AND INFERENCE-A JOURNAL OF THE IMA, Vol. 8. https://doi.org/10.1093/imaiai/iaab016

Chi, J. T., & Ipsen, I. C. F. (2021). Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten p-norms. LINEAR ALGEBRA AND ITS APPLICATIONS, 624, 87–102. https://doi.org/10.1016/j.laa.2021.03.039

Probabilistic Iterative Methods for Linear Systems. (2021). Journal of Machine Learning Research. Retrieved from http://jmlr.org/papers/v22/21-0031.html

Chi, J. T., Ipsen, I. C. F., Hsiao, T.-H., Lin, C.-H., Wang, L.-S., Lee, W.-P., … Tzeng, J.-Y. (2021). SEAGLE: A Scalable Exact Algorithm for Large-Scale Set-Based Gene-Environment Interaction Tests in Biobank Data. FRONTIERS IN GENETICS, 12. https://doi.org/10.3389/fgene.2021.710055

SEAGLE: A Scalable Exact Algorithm for Large-Scale Set-based GxE Tests in Biobank Data. (2021). https://doi.org/https://doi.org/10.3389/fgene.2021.710055

Ipsen, I. C. F., & Zhou, H. (2020). Probabilistic Error Analysis for Inner Products. SIAM Journal on Matrix Analysis and Applications, 41(4), 1726–1741. https://doi.org/10.1137/19M1270434

Cockayne, J., Oates, C. J., Ipsen, I. C. F., & Girolami, M. (2019). A Bayesian conjugate gradient method. Bayesian Anal., 14(3), 937–1012. https://doi.org/doi:10.1214/19-BA1145

Girolami, M., Ipsen, I. C. F., Oates, C. J., Owen, A. B., & Sullivan, T. J. (2019, November). Editorial: special edition on probabilistic numerics. STATISTICS AND COMPUTING, Vol. 29, pp. 1181–1183. https://doi.org/10.1007/s11222-019-09892-y

Drineas, P., & Ipsen, I. C. F. (2019). LOW-RANK MATRIX APPROXIMATIONS DO NOT NEED A SINGULAR VALUE GAP. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 40(1), 299–319. https://doi.org/10.1137/18M1163658

Bartels, S., Cockayne, J., Ipsen, I. C. F., & Hennig, P. (2019). Probabilistic linear solvers: a unifying view. STATISTICS AND COMPUTING, 29(6), 1249–1263. https://doi.org/10.1007/s11222-019-09897-7

Holodnak, J. T., Ipsen, I. C. F., & Smith, R. C. (2018). A PROBABILISTIC SUBSPACE BOUND WITH APPLICATION TO ACTIVE SUBSPACES. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 39(3), 1208–1220. https://doi.org/10.1137/17M1141503

Frame, D., He, R., Ipsen, I., Lee, D., Lee, D., & Rrapaj, E. (2018). Eigenvector Continuation with Subspace Learning. Physical Review Letters, 121(3). https://doi.org/10.1103/physrevlett.121.032501

Drineas, P., Ipsen, I. C. F., Kontopoulou, E.-M., & Magdon-Ismail, M. (2018). STRUCTURAL CONVERGENCE RESULTS FOR APPROXIMATION OF DOMINANT SUBSPACES FROM BLOCK KRYLOV SPACES. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 39(2), 567–586. https://doi.org/10.1137/16m1091745

Saibaba, A. K., Alexanderian, A., & Ipsen, I. C. F. (2017). Randomized matrix-free trace and log-determinant estimators. NUMERISCHE MATHEMATIK, 137(2), 353–395. https://doi.org/10.1007/s00211-017-0880-z

Gallopoulos, S., Drineas, P., Ipsen, I. C. F., & Mahoney, M. W. (2016). RandNLA, Pythons, and the CUR for your data problems: Reporting from G2S3 in Delphi. SIAM News, 49(1), 7–8.

Holodnak, J. T., Ipsen, I. C. F., & Wentworth, T. (2015). CONDITIONING OF LEVERAGE SCORES AND COMPUTATION BY QR DECOMPOSITION. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 36(3), 1143–1163. https://doi.org/10.1137/140988541

Barlow, J. L., Drma?, Z., Ipsen, I., & Moro, J. (2015). Preface. Linear Algebra and Its Applications, 464, 1–2. https://doi.org/10.1016/j.laa.2014.10.006

Holodnak, J. T., & Ipsen, I. C. F. (2015). RANDOMIZED APPROXIMATION OF THE GRAM MATRIX: EXACT COMPUTATION AND PROBABILISTIC BOUNDS. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 36(1), 110–137. https://doi.org/10.1137/130940116

Ipsen, I. C. F., & Wentworth, T. (2014). THE EFFECT OF COHERENCE ON SAMPLING FROM MATRICES WITH ORTHONORMAL COLUMNS, AND PRECONDITIONED LEAST SQUARES PROBLEMS. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 35(4), 1490–1520. https://doi.org/10.1137/120870748

Ipsen, I. (2012). Research spotlights. SIAM Review, 54(1), 119–120. https://doi.org/10.1137/SIREAD000054000001000119000001

Rehman, R., & Ipsen, I. C. F. (2011). COMPUTING CHARACTERISTIC POLYNOMIALS FROM EIGENVALUES. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 32(1), 90–114. https://doi.org/10.1137/100788392

Ipsen, I. C. F., & Selee, T. M. (2011). ERGODICITY COEFFICIENTS DEFINED BY VECTOR NORMS. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 32(1), 153–200. https://doi.org/10.1137/090752948

Ipsen, I. (2011). Expository Research Papers. SIAM Review, 53(1), 69–69. https://doi.org/10.1137/siread000053000001000069000001

Ipsen, I. (2011). Expository Research Papers. SIAM Review, 53(2), 289–289. https://doi.org/10.1137/siread000053000002000289000001

Ipsen, I. (2011). Expository Research Papers. SIAM Review, 53(4), 721–721. https://doi.org/10.1137/siread000053000004000721000001

Ipsen, I. (2011). Expository Research Papers. SIAM Review, 53(3), 503–503. https://doi.org/10.1137/siread000053000003000503000001

Ipsen, I. (2011). Expository research papers. SIAM Review, Vol. 53. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-84856706336&partnerID=MN8TOARS

Eriksson-Bique, S., Solbrig, M., Stefanelli, M., Warkentin, S., Abbey, R., & Ipsen, I. C. F. (2011). IMPORTANCE SAMPLING FOR A MONTE CARLO MATRIX MULTIPLICATION ALGORITHM, WITH APPLICATION TO INFORMATION RETRIEVAL. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 33(4), 1689–1706. https://doi.org/10.1137/10080659x

Ipsen, I. C. F., Kelley, C. T., & Pope, S. R. (2011). RANK-DEFICIENT NONLINEAR LEAST SQUARES PROBLEMS AND SUBSET SELECTION. SIAM JOURNAL ON NUMERICAL ANALYSIS, 49(3), 1244–1266. https://doi.org/10.1137/090780882

Ipsen, I. (2010). Expository Research Papers. SIAM Review, 52(3), 453–453. https://doi.org/10.1137/siread000052000003000453000001

Ipsen, I. (2010). Expository Research Papers. SIAM Review, 52(2), 267–267. https://doi.org/10.1137/siread000052000002000267000001

Ipsen, I. (2010). Expository Research Papers. SIAM Review, 52(4), 675–675. https://doi.org/10.1137/siread000052000004000675000001

Ipsen, I. (2010). Expository Research Papers. SIAM Review, 52(1), 55–55. https://doi.org/10.1137/siread000052000001000055000001

Ipsen, I. (2010). Expository research papers. SIAM Review, Vol. 52. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-79952956707&partnerID=MN8TOARS

Kelley, C. T., Ipsen, I. C. F., & Pope, S. R. (2010). Rank-deficient and ill-conditioned nonlinear least squares problems. Proceedings of the 2010 East Asian SIAM Conference. Presented at the East Asian Society of Industrial and Applied Mathematics Conference.

Ipsen, I. C. F. (2010). The Eigenproblem and Invariant Subspaces: Perturbation Theory. In G.W. Stewart (pp. 71–93). https://doi.org/10.1007/978-0-8176-4968-5_7

Preface to the 14th ILAS Conference Proceedings Shanghai 2007. (2009). Linear Algebra and Its Applications, 430(5-6). https://doi.org/10.1016/j.laa.2008.10.002

Ipsen, I. (2009). Problems and Techniques. SIAM Review, 51(2), 337–337. https://doi.org/10.1137/siread000051000002000337000001

Ipsen, I. (2009). Problems and Techniques. SIAM Review, 51(3), 543–543. https://doi.org/10.1137/siread000051000003000543000001

Ipsen, I. (2009). Problems and Techniques. SIAM Review, 51(4), 705–705. https://doi.org/10.1137/siread000051000004000705000001

Ipsen, I. (2009, February 5). Problems and Techniques. SIAM Review, Vol. 51, pp. 127–127. https://doi.org/10.1137/siread000051000001000127000001

Ipsen, I. (2009). Problems and techniques. SIAM Review, Vol. 51. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-59749092679&partnerID=MN8TOARS

Ipsen, I. C. F., & Nadler, B. (2009). REFINED PERTURBATION BOUNDS FOR EIGENVALUES OF HERMITIAN AND NON-HERMITIAN MATRICES. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, Vol. 31, pp. 40–53. https://doi.org/10.1137/070682745

Ipsen, I. C. F. (2009). SPECIAL ISSUE ON ACCURATE SOLUTION OF EIGENVALUE PROBLEMS. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, Vol. 31, pp. VII-VII. https://doi.org/10.1137/sjmael000031000001000vii000001

Ipsen, I. C. F. (2009). Special issue on accurate solution of eigenvalue problems. SIAM Journal on Matrix Analysis and Applications, 31(1). Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-73649094469&partnerID=MN8TOARS

Wills, R. S., & Ipsen, I. C. F. (2008). ORDINAL RANKING FOR GOOGLE'S PAGERANK. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 30(4), 1677–1696. https://doi.org/10.1137/070698129

Ipsen, I. C. F., & Rehman, R. (2008). PERTURBATION BOUNDS FOR DETERMINANTS AND CHARACTERISTIC POLYNOMIALS. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 30(2), 762–776. https://doi.org/10.1137/070704770

Ipsen, I. (2008). Problems and Techniques. SIAM Review, 50(2), 273–273. https://doi.org/10.1137/siread000050000002000273000001

Ipsen, I. (2008, January). Problems and Techniques. SIAM Review, Vol. 50, pp. 35–35. https://doi.org/10.1137/siread000050000001000035000001

Ipsen, I. (2008). Problems and Techniques. SIAM Review, 50(4), 721–721. https://doi.org/10.1137/siread000050000004000721000001

Ipsen, I. (2008). Problems and Techniques. SIAM Review, 50(3), 483–483. https://doi.org/10.1137/siread000050000003000483000001

Ipsen, I. C. F. (2008). Problems and techniques. SIAM Review, Vol. 50. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-50949105062&partnerID=MN8TOARS

Dickson, K. I., Kelley, C. T., Ipsen, I. C. F., & Kevrekidis, I. G. (2007). Condition estimates for pseudo-arclength continuation. SIAM JOURNAL ON NUMERICAL ANALYSIS, 45(1), 263–276. https://doi.org/10.1137/060654384

Ipsen, I. C. F. (2007, November 3). First SIAG linear algebra school slated for July 2008. SIAM News, 40(9).

Ipsen, I. C. F., & Selee, T. M. (2007). Pagerank computation, with special attention to dangling nodes. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 29(4), 1281–1296. https://doi.org/10.1137/060664331

Ipsen, I. (2007). Problems and Techniques. SIAM Review, 49(4), 593–593. https://doi.org/10.1137/siread000049000004000593000001

Ipsen, I. (2007, January). Problems and Techniques. SIAM Review, Vol. 49, pp. 209–209. https://doi.org/10.1137/siread000049000002000209000001

Ipsen, I. (2007). Problems and Techniques. SIAM Review, 49(3), 419–420. https://doi.org/10.1137/siread000049000003000419000001

Ipsen, I. (2007). Problems and Techniques. SIAM Review, 49(1), 33–34. https://doi.org/10.1137/siread000049000001000033000001

Ipsen, I. (2007). Problems and techniques. SIAM Review, Vol. 49. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-34249999151&partnerID=MN8TOARS

Ipsen, I. (2007). Problems and techniques: Introduction. SIAM Review, 49(4). Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-37249005235&partnerID=MN8TOARS

Ipsen, I. (2007). Problems and techniques: Introduction. SIAM Review, Vol. 49. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-37249005235&partnerID=MN8TOARS

Finkel, D. E., Kuster, C., Lasater, M., Levy, R., Reese, J. P., & Ipsen, I. C. F. (2006). Communicating Applied Mathematics: Four Examples. SIAM Review, 48(2), 359–389. https://doi.org/10.1137/S0036144504443523

Ipsen, I. C. F., & Kirkland, S. (2006). Convergence analysis of a PageRank updating algorithm by Langville and Meyer. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 27(4), 952–967. https://doi.org/10.1137/S0895479804439808

Ipsen, I. C. F., & Wills, R. S. (2006). Mathematical properties and analysis of Google’s PageRank. Boletin De La Sociedad Espanola De Matematica Aplicada, 34, 191–196.

Ipsen, I. C. F. (2006, December). New ideas for SIAM conferences from Europe. SIAM News, 39(10), 5.

Ipsen, I. (2006). Problems and Techniques. SIAM Review, 48(1), 41–42. https://doi.org/10.1137/siread000048000001000041000001

Ipsen, I. (2006). Problems and Techniques. SIAM Review, 48(3), 485–485. https://doi.org/10.1137/siread000048000003000485000001

Ipsen, I. (2006). Problems and Techniques. SIAM Review, 48(4), 679–680. https://doi.org/10.1137/siread000048000004000679000001

Ipsen, I. (2006). Problems and Techniques. SIAM Review, 48(2), 305–305. https://doi.org/10.1137/siread000048000002000305000001

Ipsen, I. (2006). Problems and techniques. SIAM Review, Vol. 48, pp. 41–42. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-33644586567&partnerID=MN8TOARS

Ipsen, I. C. F. (2006). Problems and techniques: Introduction. SIAM Review, 48(2), 485–486. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-33744920863&partnerID=MN8TOARS

Ipsen, I. C. F. (2006). Problems and techniques: Introduction. SIAM Review, Vol. 48, pp. 485–486. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-33744920863&partnerID=MN8TOARS

Ipsen, I. C. F. (2006). Special issue on accurate solution of eigenvalue problems. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, Vol. 28, pp. IX-IX. https://doi.org/10.1137/sjmael0000280000040000ix000001

Ipsen, I. C. F. (2006). Special issue on accurate solution of eigenvalue problems. SIAM Journal on Matrix Analysis and Applications, 28(4). Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-35348933724&partnerID=MN8TOARS

Ipsen, I. C. F. (2005). How to get SIAM cooperation for your meeting. SIAM News, 38(2).

Ipsen, I. (2005). Problems and Techniques. SIAM Review, 47(4), 707–707. https://doi.org/10.1137/siread000047000004000707000001

Ipsen, I. (2005). Problems and techniques. SIAM Review, Vol. 47. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-28244444106&partnerID=MN8TOARS

Ipsen, I. C. F. (2005, January). Why aren’t SIAM conferences cheaper? SIAM News, 38(1), 1.

Ipsen, I. C. F. (2004, November). Accurate eigenvalues for fast trains. SIAM News, 37(9), 1–2.

Ipsen, I. C. F. (2003, January 1). A note on unifying absolute and relative perturbation bounds. LINEAR ALGEBRA AND ITS APPLICATIONS, Vol. 358, pp. 239–253. https://doi.org/10.1016/S0024-3795(01)00571-7

Beattie, C., & Ipsen, I. C. F. (2003, January 1). Inclusion regions for matrix eigenvalues. LINEAR ALGEBRA AND ITS APPLICATIONS, Vol. 358, pp. 281–291. https://doi.org/10.1016/S0024-3795(02)00279-3

Lee, D. J., & Ipsen, I. C. F. (2003). Zone determinant expansions for nuclear lattice simulations. PHYSICAL REVIEW C, 68(6). https://doi.org/10.1103/physrevc.68.064003

Ipsen, I. C. F. (2001). A note on preconditioning nonsymmetric matrices. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 23(3), 1050–1051. https://doi.org/10.1137/S1064827500377435

Ipsen, I. C. F., & Mehrmann, V. (2001). SIAG/LA and ILAS mark twenty years of progress at joint applied linear algebra meeting. SIAM News, 34(1).

Genin, Y., Ipsen, I., Ştefan, R., & Van Dooren, P. (2001). Stability Radius and Optimal Scaling of Discrete-Time Periodic Systems. IFAC Proceedings Volumes, 34(12), 179–182. https://doi.org/10.1016/s1474-6670(17)34081-8

Ipsen, I. C. F. (2000). A note on a certain class of preconditioners for symmetric indefinite linear systems (Technical Report No. M&CT-TECH-00-005). Mathematics & Computing Technology, Phantom Works Division, The Boeing Company.

Ipsen, I. C. F. (2000, April 15). Absolute and relative perturbation bounds for invariant subspaces of matrices. LINEAR ALGEBRA AND ITS APPLICATIONS, Vol. 309, pp. 45–56. https://doi.org/10.1016/S0024-3795(99)00104-4

Ipsen, I. C. F. (2000). An overview of relative sin Theta theorems for invariant subspaces of complex matrices. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 123(1-2), 131–153. https://doi.org/10.1016/S0377-0427(00)00404-0

Ipsen, I. C. F. (2000). Expressions and bounds for the GMRES residual. BIT, 40(3), 524–535. https://doi.org/10.1023/A:1022371814205

Ipsen, I. C. F. (1998). A different approach to bounding the minimal residual norm in Krylov methods (Technical Report No. CRSC-TR98-19). Raleigh, NC: Center for Research in Scientific Computation, Department of Mathematics, North Carolina State University.

Ipsen, I. C. F. (1998). A note on the field of values of non-normal matrices (Technical Report No. CRSC-TR98-26). Raleigh, NC: Center for Research in Scientific Computation, Department of Mathematics, North Carolina State University.

Cho, G. E., & Ipsen, I. C. F. (1998). If a matrix has a single eigenvalue, how sensitive is this eigenvalue? (Technical Report No. CRSC-TR98-8). Raleigh, NC: Center for Research in Scientific Computation, Department of Mathematics, North Carolina State University.

Eisenstat, S. C., & Ipsen, I. C. F. (1998). Relative perturbation results for eigenvalues and eigenvectors of diagonalisable matrices. BIT, 38(3), 502–509. https://doi.org/10.1007/BF02510256

Ipsen, I. C. F. (1998). Relative perturbation results for matrix eigenvalues and singular values. Acta Numerica, 7, 151–201. https://doi.org/10.1017/s0962492900002828

Ipsen, I. C. F., & Meyer, C. D. (1998). The idea behind Krylov methods. AMERICAN MATHEMATICAL MONTHLY, 105(10), 889–899. https://doi.org/10.2307/2589281

Banoczi, J. M., Chiu, N. C., Cho, G. E., & Ipsen, I. C. F. (1998). The lack of influence of the right-hand side on the accuracy of linear system solution. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 20(1), 203–227. https://doi.org/10.1137/S106482759630526X

Banoczi, J. M., Chiu, N.-C., Cho, G. E., & Ipsen, I. C. F. (1998). The lack of influence of the right-hand side on the accuracy of linear system solution. SIAM Journal on Scientific Computing, 20(1), 203–227. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-0032131636&partnerID=MN8TOARS

Eisenstat, S. C., & Ipsen, I. C. F. (1998). Three absolute perturbation bounds for matrix eigenvalues imply relative bounds. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 20(1), 149–158. https://doi.org/10.1137/S0895479897323282

Ipsen, I. C. F. (1997). Computing an eigenvector with inverse iteration. SIAM REVIEW, 39(2), 254–291. https://doi.org/10.1137/S0036144596300773

Cho, G. E., & Ipsen, I. C. F. (1997). If a matrix has a single eigenvalue, how sensitive is this eigenvalue? (Technical Report No. CRSC-TR97-20). Raleigh, NC: Center for Research in Scientific Computation, Department of Mathematics, North Carolina State University.

Ipsen, I. C. F. (1996). A history of inverse iteration. In H. Wielandt, B. Huppert, & H. Schneider (Eds.), Mathematische Werke. Vol. 2, Linear algebra and analysis : Mathematical works (pp. 464–472). Berlin: Walter de Gruyter.

Campbell, S. L., Ipsen, I. C. F., Kelley, C. T., Meyer, C. D., & Xue, Z. Q. (1996). Convergence Estimates for Solution of Integral Equations with GMRES. Journal of Integral Equations and Applications, 8(1), 19–34. https://doi.org/10.1216/jiea/1181075914

Campbell, S. L., Ipsen, I. C. F., Kelley, C. T., & Meyer, C. D. (1996). GMRES and the minimal polynomial. BIT Numerical Mathematics, 36(4), 664–675. https://doi.org/10.1007/bf01733786

Ipsen, I. C. F. (1996). Helmut Wielandt’s contributions to the numerical solution of complex eigenvalue problems. In B. Huppert & H. Schneider (Eds.), Helmut Wielandt, Mathematische Werke, Mathematical Works, volume 2: Linear Algebra and Analysis (pp. 453–463). Berlin: Walter de Gruyter.

Chandrasekaran, S., & Ipsen, I. C. F. (1995). Analysis of a QR Algorithm for Computing Singular Values. SIAM Journal on Matrix Analysis and Applications, 16(2), 520–535. https://doi.org/10.1137/s0895479892236532

Chandrasekaran, S., & Ipsen, I. C. F. (1995). On the Sensitivity of Solution Components in Linear Systems of Equations. SIAM Journal on Matrix Analysis and Applications, 16(1), 93–112. https://doi.org/10.1137/s0895479892231255

Eisenstat, S. C., & Ipsen, I. C. F. (1995). Relative Perturbation Techniques for Singular Value Problems. SIAM Journal on Numerical Analysis, 32(6), 1972–1988. https://doi.org/10.1137/0732088

Ipsen, I. C. F., & Meyer, C. D. (1995). The Angle Between Complementary Subspaces. The American Mathematical Monthly, 102(10), 904–911. https://doi.org/10.1080/00029890.1995.12004683

Chandrasekaran, S., & Ipsen, I. C. F. (1994). A divide and conquer algorithm for computing singular values. Zeitschrift Für Angewandte Mathematik Und Mechanik, 74(6), 532–534.

Chandrasekaran, S., & Ipsen, I. C. F. (1994). Backward errors for eigenvalue and singular value decompositions. Numerische Mathematik, 68(2), 215–223. https://doi.org/10.1007/s002110050057

Chandrasekaran, S., & Ipsen, I. C. F. (1994). On Rank-Revealing Factorisations. SIAM Journal on Matrix Analysis and Applications, 15(2), 592–622. https://doi.org/10.1137/s0895479891223781

Chandrasekaran, S., & Ipsen, I. C. F. (1994). On the singular value decomposition of triangular matrices. In J. Er-xiong (Ed.), Numerical algebra : proceedings of '92 Shanghai International Numerical Algebra and its Applications Conference (pp. 85–89). Shanghai: China Science and Technology Press.

Eisenstat, S. C., & Ipsen, I. C. F. (1994). Relative perturbation bounds for eigenspaces and singular vector subspaces. In J. G. Lewis (Ed.), Proceedings of the Fifth SIAM Conference on Applied Linear Algebra (pp. 62–65). Philadelphia: SIAM.

Ipsen, I. C. F., & Meyer, C. D. (1994). Uniform Stability of Markov Chains. SIAM Journal on Matrix Analysis and Applications, 15(4), 1061–1074. https://doi.org/10.1137/s0895479892237562

Jessup, E. R., & Ipsen, I. C. F. (1992). Improving the Accuracy of Inverse Iteration. SIAM Journal on Scientific and Statistical Computing, 13(2), 550–572. https://doi.org/10.1137/0913031

Chandrasekaran, S., & Ipsen, I. (1991). Perturbation Theory for the Solution of Systems of Linear Equations. https://doi.org/10.21236/ada254994

Ipsen, I. (1991). Some Remarks on the Generalised Bareiss and Levinson Algorithms. In Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms (pp. 189–214). https://doi.org/10.1007/978-3-642-75536-1_10

Delosme, J.-M., & Ipsen, I. C. F. (1990). From Bareiss' algorithm to the stable computation of partial correlations. In Advances in Parallel Computing (Vol. 1, pp. 53–91). https://doi.org/10.1016/B978-0-444-88621-7.50009-8

Ipsen, I. C. F., & Jessup, E. R. (1990). Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube. SIAM Journal on Scientific and Statistical Computing, 11(2), 203–229. https://doi.org/10.1137/0911013

Gropp, W. D., & Ipsen, I. C. F. (1989). A Gray code scheme for local uniform mesh refinement on hypercubes. In Parallel Processing for Scientific Computing (pp. 202–206). Philadelphia: Society for Industrial and Applied Mathematics.

Delosme, J.-M., & Ipsen, I. C. F. (1989). From Bareiss' algorithm to the stable computation of partial correlations. Journal of Computational and Applied Mathematics, 27(1-2), 53–91. https://doi.org/10.1016/0377-0427(89)90361-0

Delosme, J.-M., & Ipsen, I. C. F. (1989). Parallel computation of algorithms with uniform dependences. In J. Dongarra, P. Messina, D. C. Sorensen, & R. G. Voigt (Eds.), Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing (pp. 319–326). Philadelphia: Society for Industrial and Applied Mathematics.

Gropp, W. D., & Ipsen, I. C. F. (1989). Recursive mesh refinement on hypercubes. BIT, 29(2), 186–211. https://doi.org/10.1007/bf01952675

Delosme, J.-M., & Ipsen, I. (1988). SAGA and CONDENSE: a two-phase approach for the implementation of recurrence equations on multiprocessor architectures. [1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume I: Architecture Track, 126–130. https://doi.org/10.1109/hicss.1988.11756

Ipsen, I. C. F. (1988). Systolic Algorithms for the Parallel Solution of Dense Symmetric Positive-Definite Toeplitz Systems. In The IMA Volumes in Mathematics and Its Applications (pp. 85–108). https://doi.org/10.1007/978-1-4684-6357-6_7

Delosme, J.-M., Ipsen, I. C. F., & Paige, C. C. (1988). The Cholesky factorization, Schur complements, correlation coefficients, angles between vectors, and the QR factorization (Research Report No. 607). New Haven, Connecticut: Department of Computer Science, Yale University.

Ipsen, I. C. F., & Jessup, E. R. (1987). A comparison of Cuppen’s method and multisection for the solution of tridiagonal eigenvalue problems on the hypercube. In Advances in Computer Methods for Partial Differential Equations VI (pp. 425–430). The Institute for Mathematics and Computer Science.

Delosme, J.-M., & Ipsen, I. C. F. (1987). Computing partial correlations from the data matrix (Research Report No. 541). New Haven, Connecticut: Department of Computer Science, Yale University.

Delosme, J.-M., & Ipsen, I. C. F. (1987). Efficient systolic arrays for the solution of Toeplitz systems: An illustration of a methodology for the construction of systolic architectures in VLSI. In Systolic Arrays (pp. 37–46). Adam Hilger.

Hudak, P., Delosme, J.-M., & Ipsen, I. C. F. (1987). ParLance: A para-functional programming environment for parallel and distributed computing (Research Report No. 524). New Haven, Connecticut: Department of Computer Science, Yale University.

Barlow, J. L., & Ipsen, I. F. C. (1987). Scaled Givens Rotations for the Solution of Linear Least Squares Problems on Systolic Arrays. SIAM Journal on Scientific and Statistical Computing, 8(5), 716–733. https://doi.org/10.1137/0908062

Ipsen, I. C. F., & Jessup, E. R. (1987). Two methods for solving the symmetric tridiagonal eigenvalue problem on the hypercube. In Hypercube Multiprocessors (pp. 627–638). Society for Industrial and Applied Mathematics.

Ipsen, I. C. F., Saad, Y., & Schultz, M. H. (1986). Complexity of dense-linear-system solution on a multiprocessor ring. Linear Algebra and Its Applications, 77(C), 205–239. https://doi.org/10.1016/0024-3795(86)90169-2

Delosme, J.-M., & Ipsen, I. C. F. (1986). Design Methodology For Systolic Arrays. In J. M. Speiser (Ed.), Advanced Algorithms and Architectures for Signal Processing I (Vol. 696, pp. 245–259). https://doi.org/10.1117/12.936899

Delosme, J.-M., & Ipsen, I. C. F. (1986). Parallel solution of symmetric positive definite systems with hyperbolic rotations. Linear Algebra and Its Applications, 77(C), 75–111. https://doi.org/10.1016/0024-3795(86)90163-1

Delosme, J.-M., & Ipsen, I. C. F. (1986). Systolic array synthesis: Computability and time cones. In Parallel Algorithms and Architectures (pp. 295–312). Amsterdam: North-Holland Publishing.

Delosme, J.-M., Ipsen, I. C. F., & Masse, J.-R. (1986). Systolic implementation of a Toeplitz system solver (Research Report No. 8607). New Haven, Connecticut: Department of Electrical Engineering, Yale University.

Ipsen, I. C. F., & Saad, Y. (1986). The Impact of Parallel Architectures on The Solution of Eigenvalue Problems. In Large Scale Eigenvalue Problems, Proceedings of the IBM Europe Institute Workshop on Large Scale Eigenvalue Problems (Vol. 127, pp. 37–49). https://doi.org/10.1016/s0304-0208(08)72638-0

Delosme, J.-M., & Ipsen, I. C. F. (1985). An illustration of a methodology for the construction of efficient systolic architectures in VLSI. Proceedings of the Second International Symposium on VLSI Technology, Systems and Applications, 268–273.

Bhatt, S. N., & Ipsen, I. C. F. (1985). How to embed trees in hypercubes (Research Report No. 443). New Haven, Connecticut: Department of Computer Science, Yale University.

Ipsen, I. C. F. (1984). A parallel QR method using fast Givens’ rotations (Research Report No. 299). New Haven, Connecticut: Department of Computer Science, Yale University.

Ipsen, I. (1984). Singular Value Decomposition With Systolic Arrays. In K. Bromley (Ed.), Real-Time Signal Processing VII. https://doi.org/10.1117/12.944004

Heller, D. E., & Ipsen, I. C. F. (1983). Systolic Networks for Orthogonal Decompositions. SIAM Journal on Scientific and Statistical Computing, 4(2), 261–269. https://doi.org/10.1137/0904020

Heller, D. E., & Ipsen, I. C. F. (1982). Systolic networks for orthogonal equivalence transformations and their applications. In P. Penfield (Ed.), Proceedings of the Conference on Advanced Research in VLSI (pp. 113–122). Norwood, MA: Artech House, Inc.