| Publication | Date of Publication | Type |
|---|
| An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation | 2023-05-31 | Paper |
| Nearly Optimal Block-Jacobi Preconditioning | 2023-03-30 | Paper |
| Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition | 2022-10-10 | Paper |
| Fast bilinear algorithms for symmetric tensor contractions | 2021-11-16 | Paper |
| Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions | 2021-10-20 | Paper |
| Bidiagonal SVD Computation via an Associated Tridiagonal Eigenproblem | 2020-11-10 | Paper |
| Algorithms for Efficient Reproducible Floating Point Summation | 2020-11-10 | Paper |
| A Generalized Randomized Rank-Revealing Factorization | 2019-09-13 | Paper |
| Avoiding Communication in Numerical Linear Algebra | 2019-09-12 | Paper |
| Avoiding Communication in Primal and Dual Block Coordinate Descent Methods | 2019-02-01 | Paper |
| Communication lower bounds and optimal algorithms for numerical linear algebra | 2018-09-26 | Paper |
| Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting | 2018-04-05 | Paper |
| Parallel Reproducible Summation | 2017-05-16 | Paper |
| Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication | 2016-11-18 | Paper |
| Parallelepipeds obtaining HBL lower bounds | 2016-11-17 | Paper |
| Communication Avoiding Rank Revealing QR Factorization with Column Pivoting | 2015-11-27 | Paper |
| On Holder-Brascamp-Lieb inequalities for torsion-free discrete Abelian groups | 2015-10-14 | Paper |
| Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision | 2015-07-21 | Paper |
| Communication-Avoiding Symmetric-Indefinite Factorization | 2015-04-21 | Paper |
| A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of $s$-Step Krylov Subspace Methods | 2014-08-21 | Paper |
| Graph expansion and communication costs of fast matrix multiplication | 2014-02-17 | Paper |
| Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods | 2014-01-21 | Paper |
| LU Factorization with Panel Rank Revealing Pivoting and Its Communication Avoiding Version | 2013-12-13 | Paper |
| Communication lower bounds and optimal algorithms for programs that reference arrays -- Part 1 | 2013-07-31 | Paper |
| Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication | 2013-04-19 | Paper |
| Communication-optimal Parallel and Sequential QR and LU Factorizations | 2012-05-07 | Paper |
| CALU: A Communication Optimal LU Factorization Algorithm | 2012-03-21 | Paper |
| Minimizing Communication in Numerical Linear Algebra | 2012-01-16 | Paper |
| Communication-optimal Parallel and Sequential Cholesky Decomposition | 2011-08-01 | Paper |
| Minimizing Communication for Eigenproblems and the Singular Value Decomposition | 2010-11-12 | Paper |
| Nonnegative Diagonals and High Performance on Low-Profile Matrices from Householder QR | 2010-08-16 | Paper |
| Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials | 2009-11-27 | Paper |
| Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers | 2009-05-28 | Paper |
| Continuation of Invariant Subspaces in Large Bifurcation Problems | 2009-03-27 | Paper |
| Accurate and efficient expression evaluation and linear algebra | 2009-03-03 | Paper |
| Cache efficient bidiagonalization using BLAS 2.5 operators | 2008-12-21 | Paper |
| Implementing Communication-Optimal Parallel and Sequential QR Factorizations | 2008-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5457451 | 2008-04-14 | Paper |
| Global minimization of rational functions and the nearest GCDs | 2008-04-09 | Paper |
| Fast linear algebra is stable | 2007-11-28 | Paper |
| When cache blocking of sparse matrix vector multiply works and why | 2007-09-06 | Paper |
| Fast matrix multiplication is stable | 2007-05-10 | Paper |
| Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals | 2007-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3421276 | 2007-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5393843 | 2006-10-24 | Paper |
| Accurate SVDs of polynomial Vandermonde matrices involving orthonormal polynomials | 2006-09-13 | Paper |
| Minimizing polynomials via sum of squares over the gradient ideal | 2006-06-14 | Paper |
| Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares | 2006-02-20 | Paper |
| Accurate and efficient evaluation of Schur and Jack functions | 2005-12-12 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System | 2005-09-19 | Paper |
| Fast and accurate floating point summation with application to computational geometry | 2005-09-05 | Paper |
| On computing givens rotations reliably and efficiently | 2005-07-22 | Paper |
| Minimizing Polynomials Over Semialgebraic Sets | 2005-02-17 | Paper |
| Accurate SVDs of weakly diagonally dominant M-matrices | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472545 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474888 | 2004-07-22 | Paper |
| Accurate and Efficient Floating Point Summation | 2004-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4549236 | 2002-12-20 | Paper |
| On the complexity of computing error bounds | 2002-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2784760 | 2002-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779298 | 2002-04-15 | Paper |
| Balancing sparse matrices for computing eigenvalues | 2001-02-14 | Paper |
| Computing the singular value decomposition with high relative accuracy | 2001-01-02 | Paper |
| Computing Connecting Orbits via an Improved Algorithm for Continuing Invariant Subspaces | 2000-10-19 | Paper |
| Accurate Singular Value Decompositions of Structured Matrices | 2000-03-20 | Paper |
| Unconstrained energy functionals for electronic structure calculations | 1999-10-28 | Paper |
| Using the Matrix Sign Function to Compute Invariant Subspaces | 1998-05-11 | Paper |
| Stability of block algorithms with fast level-3 BLAS | 1998-02-09 | Paper |
| On computing condition numbers for the nonsymmetric eigenproblem | 1998-01-26 | Paper |
| The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I | 1998-01-26 | Paper |
| The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II | 1998-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348513 | 1997-08-18 | Paper |
| An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems | 1997-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3124727 | 1997-03-13 | Paper |
| The dimension of matrices (matrix pencils) with given Jordan (Kronecker) canonical forms | 1996-08-04 | Paper |
| Stability of block LU factorization | 1996-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325973 | 1995-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288941 | 1994-12-04 | Paper |
| A new algorithm for the symmetric tridiagonal eigenvalue problem | 1994-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139556 | 1994-08-08 | Paper |
| Algorithms for intersecting parametric and algebraic curves I | 1994-07-13 | Paper |
| On swapping diagonal blocks in real Schur form | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279724 | 1994-03-10 | Paper |
| Computing the Generalized Singular Value Decomposition | 1994-01-19 | Paper |
| Faster numerical algorithms via exception handling | 1994-01-01 | Paper |
| On computing accurate singular values and eigenvalues of matrices with acyclic graphs | 1993-06-29 | Paper |
| Improved Error Bounds for Underdetermined System Solvers | 1993-05-16 | Paper |
| Jacobi’s Method is More Accurate than QR | 1993-01-16 | Paper |
| The Componentwise Distance to the Nearest Singular Matrix | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976415 | 1992-06-26 | Paper |
| The Bidiagonal Singular Value Decomposition and Hamiltonian Mechanics | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210771 | 1990-01-01 | Paper |
| Accurate Singular Values of Bidiagonal Matrices | 1990-01-01 | Paper |
| Computing Accurate Eigensystems of Scaled Diagonally Dominant Matrices | 1990-01-01 | Paper |
| ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATION | 1989-01-01 | Paper |
| The Strong Stability of Algorithms for Solving Symmetric Linear Systems | 1989-01-01 | Paper |
| Solving Sparse Linear Systems with Sparse Backward Error | 1989-01-01 | Paper |
| Accurate Solutions of Ill-Posed Problems in control theory | 1988-01-01 | Paper |
| The Probability That a Numerical Analysis Problem is Difficult | 1988-01-01 | Paper |
| On condition numbers and the distance to the nearest ill-posed problem | 1987-01-01 | Paper |
| Three methods for refining estimates of invariant subspaces | 1987-01-01 | Paper |
| Computing stable eigendecompositions of matrix pencils | 1987-01-01 | Paper |
| The geometry of ill-conditioning | 1987-01-01 | Paper |
| The Smallest Perturbation of a Submatrix which Lowers the Rank and Constrained Total Least Squares Problems | 1987-01-01 | Paper |
| A counterexample for two conjectures about stability | 1987-01-01 | Paper |
| Computing stable eigendecompositions of matrices | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742613 | 1986-01-01 | Paper |
| An interval algorithm for solving systems of linear equations to prespecified accuracy | 1985-01-01 | Paper |
| Underflow and the Reliability of Numerical Software | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3969783 | 1983-01-01 | Paper |
| The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3323138 | 1981-01-01 | Paper |
