| Publication | Date of Publication | Type |
|---|
On multilinear inequalities of Hölder-Brascamp-Lieb type for torsion-free discrete abelian groups
Journal of Logic and Analysis | 2024-08-30 | Paper |
An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation
SIAM Journal on Matrix Analysis and Applications | 2023-05-31 | Paper |
Nearly Optimal Block-Jacobi Preconditioning
SIAM Journal on Matrix Analysis and Applications | 2023-03-30 | Paper |
| Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition | 2022-10-10 | Paper |
Fast bilinear algorithms for symmetric tensor contractions
Computational Methods in Applied Mathematics | 2021-11-16 | Paper |
Communication lower bounds of bilinear algorithms for symmetric tensor contractions
SIAM Journal on Scientific Computing | 2021-10-20 | Paper |
Bidiagonal SVD Computation via an Associated Tridiagonal Eigenproblem
ACM Transactions on Mathematical Software | 2020-11-10 | Paper |
Algorithms for efficient reproducible floating point summation
ACM Transactions on Mathematical Software | 2020-11-10 | Paper |
| A Generalized Randomized Rank-Revealing Factorization | 2019-09-13 | Paper |
Avoiding communication in numerical linear algebra
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Avoiding Communication in Primal and Dual Block Coordinate Descent Methods
SIAM Journal on Scientific Computing | 2019-02-01 | Paper |
Communication lower bounds and optimal algorithms for numerical linear algebra
Acta Numerica | 2018-09-26 | Paper |
Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
SIAM Journal on Scientific Computing | 2018-04-05 | Paper |
Parallel Reproducible Summation
IEEE Transactions on Computers | 2017-05-16 | Paper |
Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
SIAM Journal on Scientific Computing | 2016-11-18 | Paper |
| Parallelepipeds obtaining HBL lower bounds | 2016-11-17 | Paper |
Communication avoiding rank revealing QR factorization with column pivoting
SIAM Journal on Matrix Analysis and Applications | 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
SIAM Journal on Matrix Analysis and Applications | 2015-07-21 | Paper |
Communication-avoiding symmetric-indefinite factorization
SIAM Journal on Matrix Analysis and Applications | 2015-04-21 | Paper |
A residual replacement strategy for improving the maximum attainable accuracy of \(s\)-step Krylov subspace methods
SIAM Journal on Matrix Analysis and Applications | 2014-08-21 | Paper |
Graph expansion and communication costs of fast matrix multiplication
Journal of the ACM | 2014-02-17 | Paper |
Avoiding communication in nonsymmetric Lanczos-based Krylov subspace methods
SIAM Journal on Scientific Computing | 2014-01-21 | Paper |
LU factorization with panel rank revealing pivoting and its communication avoiding version
SIAM Journal on Matrix Analysis and Applications | 2013-12-13 | Paper |
LU factorization with panel rank revealing pivoting and its communication avoiding version
SIAM Journal on Matrix Analysis and Applications | 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
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Graph expansion analysis for communication costs of fast rectangular matrix multiplication
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Communication-optimal parallel and sequential QR and LU factorizations
SIAM Journal on Scientific Computing | 2012-05-07 | Paper |
CALU: A communication optimal LU factorization algorithm
SIAM Journal on Matrix Analysis and Applications | 2012-03-21 | Paper |
Minimizing communication in numerical linear algebra
SIAM Journal on Matrix Analysis and Applications | 2012-01-16 | Paper |
Communication-optimal parallel and sequential Cholesky decomposition
SIAM Journal on Scientific Computing | 2011-08-01 | Paper |
Communication-optimal parallel and sequential Cholesky decomposition
SIAM Journal on Scientific Computing | 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
SIAM Journal on Scientific Computing | 2010-08-16 | Paper |
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
SIAM Journal on Optimization | 2009-11-27 | Paper |
Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
SIAM Journal on Scientific Computing | 2009-05-28 | Paper |
Continuation of Invariant Subspaces in Large Bifurcation Problems
SIAM Journal on Scientific Computing | 2009-03-27 | Paper |
Accurate and efficient expression evaluation and linear algebra
Acta Numerica | 2009-03-03 | Paper |
Cache efficient bidiagonalization using BLAS 2.5 operators
ACM Transactions on Mathematical Software | 2008-12-21 | Paper |
| Implementing Communication-Optimal Parallel and Sequential QR Factorizations | 2008-09-14 | Paper |
| Accurate and efficient algorithms for floating point computation | 2008-04-14 | Paper |
Global minimization of rational functions and the nearest GCDs
Journal of Global Optimization | 2008-04-09 | Paper |
Fast linear algebra is stable
Numerische Mathematik | 2007-11-28 | Paper |
When cache blocking of sparse matrix vector multiply works and why
Applicable Algebra in Engineering, Communication and Computing | 2007-09-06 | Paper |
Fast matrix multiplication is stable
Numerische Mathematik | 2007-05-10 | Paper |
Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
Journal of Pure and Applied Algebra | 2007-02-12 | Paper |
scientific article; zbMATH DE number 5124811 (Why is no real title available?)
(available as arXiv preprint) | 2007-02-12 | Paper |
Shape optimization of transfer functions
(available as arXiv preprint) | 2006-10-24 | Paper |
Accurate SVDs of polynomial Vandermonde matrices involving orthonormal polynomials
Linear Algebra and its Applications | 2006-09-13 | Paper |
Minimizing polynomials via sum of squares over the gradient ideal
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
Journal of Global Optimization | 2006-02-20 | Paper |
Accurate and efficient evaluation of Schur and Jack functions
Mathematics of Computation | 2005-12-12 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
SIAM Journal on Matrix Analysis and Applications | 2005-09-19 | Paper |
Fast and accurate floating point summation with application to computational geometry
Numerical Algorithms | 2005-09-05 | Paper |
On computing givens rotations reliably and efficiently
ACM Transactions on Mathematical Software | 2005-07-22 | Paper |
| Minimizing Polynomials Over Semialgebraic Sets | 2005-02-17 | Paper |
Accurate SVDs of weakly diagonally dominant M-matrices
Numerische Mathematik | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2080291 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2079090 (Why is no real title available?) | 2004-07-22 | Paper |
Accurate and Efficient Floating Point Summation
SIAM Journal on Scientific Computing | 2004-01-20 | Paper |
scientific article; zbMATH DE number 1789925 (Why is no real title available?)
(available as arXiv preprint) | 2002-12-20 | Paper |
On the complexity of computing error bounds
Foundations of Computational Mathematics | 2002-11-05 | Paper |
| Necessary and sufficient conditions for accurate and efficient rational function evaluation and factorizations of rational matrices | 2002-09-26 | Paper |
| scientific article; zbMATH DE number 1728268 (Why is no real title available?) | 2002-04-15 | Paper |
| scientific article; zbMATH DE number 1728262 (Why is no real title available?) | 2002-04-15 | Paper |
Balancing sparse matrices for computing eigenvalues
Linear Algebra and its Applications | 2001-02-14 | Paper |
Computing the singular value decomposition with high relative accuracy
Linear Algebra and its Applications | 2001-01-02 | Paper |
Computing Connecting Orbits via an Improved Algorithm for Continuing Invariant Subspaces
SIAM Journal on Scientific Computing | 2000-10-19 | Paper |
Accurate Singular Value Decompositions of Structured Matrices
SIAM Journal on Matrix Analysis and Applications | 2000-03-20 | Paper |
Unconstrained energy functionals for electronic structure calculations
Journal of Computational Physics | 1999-10-28 | Paper |
Using the Matrix Sign Function to Compute Invariant Subspaces
SIAM Journal on Matrix Analysis and Applications | 1998-05-11 | Paper |
Stability of block algorithms with fast level-3 BLAS
ACM Transactions on Mathematical Software | 1998-02-09 | Paper |
On computing condition numbers for the nonsymmetric eigenproblem
ACM Transactions on Mathematical Software | 1998-01-26 | Paper |
The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
ACM Transactions on Mathematical Software | 1998-01-26 | Paper |
The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
ACM Transactions on Mathematical Software | 1998-01-26 | Paper |
| scientific article; zbMATH DE number 1049347 (Why is no real title available?) | 1997-08-18 | Paper |
An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
Numerische Mathematik | 1997-06-30 | Paper |
| scientific article; zbMATH DE number 991426 (Why is no real title available?) | 1997-03-13 | Paper |
The dimension of matrices (matrix pencils) with given Jordan (Kronecker) canonical forms
Linear Algebra and its Applications | 1996-08-04 | Paper |
Stability of block LU factorization
Numerical Linear Algebra with Applications | 1996-03-31 | Paper |
| scientific article; zbMATH DE number 733664 (Why is no real title available?) | 1995-03-13 | Paper |
| scientific article; zbMATH DE number 556482 (Why is no real title available?) | 1994-12-04 | Paper |
A new algorithm for the symmetric tridiagonal eigenvalue problem
Journal of Complexity | 1994-08-31 | Paper |
| scientific article; zbMATH DE number 434716 (Why is no real title available?) | 1994-08-08 | Paper |
Algorithms for intersecting parametric and algebraic curves I
ACM Transactions on Graphics | 1994-07-13 | Paper |
On swapping diagonal blocks in real Schur form
Linear Algebra and its Applications | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 503385 (Why is no real title available?) | 1994-03-10 | Paper |
Computing the Generalized Singular Value Decomposition
SIAM Journal on Scientific Computing | 1994-01-19 | Paper |
Faster numerical algorithms via exception handling
IEEE Transactions on Computers | 1994-01-01 | Paper |
On computing accurate singular values and eigenvalues of matrices with acyclic graphs
Linear Algebra and its Applications | 1993-06-29 | Paper |
Improved Error Bounds for Underdetermined System Solvers
SIAM Journal on Matrix Analysis and Applications | 1993-05-16 | Paper |
Jacobi’s Method is More Accurate than QR
SIAM Journal on Matrix Analysis and Applications | 1993-01-16 | Paper |
The Componentwise Distance to the Nearest Singular Matrix
SIAM Journal on Matrix Analysis and Applications | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 18990 (Why is no real title available?) | 1992-06-26 | Paper |
The Bidiagonal Singular Value Decomposition and Hamiltonian Mechanics
SIAM Journal on Numerical Analysis | 1992-06-26 | Paper |
Accurate Singular Values of Bidiagonal Matrices
SIAM Journal on Scientific and Statistical Computing | 1990-01-01 | Paper |
Computing Accurate Eigensystems of Scaled Diagonally Dominant Matrices
SIAM Journal on Numerical Analysis | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4192958 (Why is no real title available?) | 1990-01-01 | Paper |
Solving Sparse Linear Systems with Sparse Backward Error
SIAM Journal on Matrix Analysis and Applications | 1989-01-01 | Paper |
The Strong Stability of Algorithms for Solving Symmetric Linear Systems
SIAM Journal on Matrix Analysis and Applications | 1989-01-01 | Paper |
ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATION
International Journal of High Speed Computing | 1989-01-01 | Paper |
| The Probability That a Numerical Analysis Problem is Difficult | 1988-01-01 | Paper |
Accurate Solutions of Ill-Posed Problems in control theory
SIAM Journal on Matrix Analysis and Applications | 1988-01-01 | Paper |
Three methods for refining estimates of invariant subspaces
Computing | 1987-01-01 | Paper |
The Smallest Perturbation of a Submatrix which Lowers the Rank and Constrained Total Least Squares Problems
SIAM Journal on Numerical Analysis | 1987-01-01 | Paper |
On condition numbers and the distance to the nearest ill-posed problem
Numerische Mathematik | 1987-01-01 | Paper |
Computing stable eigendecompositions of matrix pencils
Linear Algebra and its Applications | 1987-01-01 | Paper |
The geometry of ill-conditioning
Journal of Complexity | 1987-01-01 | Paper |
A counterexample for two conjectures about stability
IEEE Transactions on Automatic Control | 1987-01-01 | Paper |
Computing stable eigendecompositions of matrices
Linear Algebra and its Applications | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3978277 (Why is no real title available?) | 1986-01-01 | Paper |
An interval algorithm for solving systems of linear equations to prespecified accuracy
Computing | 1985-01-01 | Paper |
Underflow and the Reliability of Numerical Software
SIAM Journal on Scientific and Statistical Computing | 1984-01-01 | Paper |
The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils
SIAM Journal on Numerical Analysis | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3793316 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3854300 (Why is no real title available?) | 1981-01-01 | Paper |
An efficient algorithm for locating and continuing connecting orbits
(available as arXiv preprint) | N/A | Paper |
Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor Decomposition
(available as arXiv preprint) | N/A | Paper |
Generalized Pseudospectral Shattering and Inverse-Free Matrix Pencil Diagonalization
(available as arXiv preprint) | N/A | Paper |
CholeskyQR with Randomization and Pivoting for Tall Matrices (CQRRPT)
(available as arXiv preprint) | N/A | Paper |
