Ming Gu

SIAM Rev., 2020

2019

An efficient algorithm for bounded spectral matching with affine constraint.

[BibT_eX]

[DOI]

Yan Dou

Numer. Linear Algebra Appl., 2019

2018

A Robust and Efficient Implementation of LOBPCG.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2018

LSMB: Minimizing the Backward Error for Least-Squares Problems.

[BibT_eX]

[DOI]

Eric Hallman

SIAM J. Matrix Anal. Appl., 2018

Randomized Complete Pivoting for Solving Symmetric Indefinite Linear Systems.

[BibT_eX]

[DOI]

Yuehua Feng

SIAM J. Matrix Anal. Appl., 2018

Low-Rank Matrix Approximations with Flip-Flop Spectrum-Revealing QR Factorization.

[BibT_eX]

[DOI]

Yuehua Feng

CoRR, 2018

2017

Randomized QR with Column Pivoting.

[BibT_eX]

[DOI]

Jed A. Duersch

SIAM J. Sci. Comput., 2017

An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation.

[BibT_eX]

[DOI]

David G. Anderson

Proceedings of the 34th International Conference on Machine Learning, 2017

Fast Parallel Randomized QR with Column Pivoting Algorithms for Reliable Low-Rank Matrix Approximations.

[BibT_eX]

[DOI]

Julien Langou

Proceedings of the 24th IEEE International Conference on High Performance Computing, 2017

2016

An Efficient, Sparsity-Preserving, Online Algorithm for Data Approximation.

[BibT_eX]

[DOI]

David G. Anderson

CoRR, 2016

An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2016

Spectrum-Revealing Cholesky Factorization for Kernel Methods.

[BibT_eX]

[DOI]

Proceedings of the IEEE 16th International Conference on Data Mining, 2016

2015

Subspace Iteration Randomization and Singular Value Problems.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2015

Communication Avoiding Rank Revealing QR Factorization with Column Pivoting.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2015

Gaussian Elimination with Randomized Complete Pivoting.

[BibT_eX]

[DOI]

Christopher Melgaard

CoRR, 2015

Spectral Gap Error Bounds for Improving CUR Matrix Decomposition and the Nyström Method.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, 2015

2014

An Improved DQDS Algorithm.

[BibT_eX]

[DOI]

Shengguo Li

Beresford N. Parlett

SIAM J. Sci. Comput., 2014

An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2014

Fast structured LU factorization for nonsymmetric matrices.

[BibT_eX]

[DOI]

Shengguo Li

Lizhi Cheng

Numerische Mathematik, 2014

An Efficient Algorithm for Unweighted Spectral Graph Sparsification.

[BibT_eX]

[DOI]

David G. Anderson

Christopher Melgaard

CoRR, 2014

2013

LU Factorization with Panel Rank Revealing Pivoting and Its Communication Avoiding Version.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2013

ParNes: a rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals.

[BibT_eX]

[DOI]

Lek-Heng Lim

Cinna Julie Wu

Numer. Algorithms, 2013

A big data approach to analyzing market volatility.

[BibT_eX]

[DOI]

Algorithmic Finance, 2013

Fast Change Point Detection for electricity market analysis.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013

2012

A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling.

[BibT_eX]

[DOI]

Yuanzhe Xi

Karthik Jayaraman Raghuram

SIAM J. Matrix Anal. Appl., 2012

New Efficient and Robust HSS Cholesky Factorization of SPD Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2012

Higher order numerical discretizations for exterior and biharmonic type PDEs.

[BibT_eX]

[DOI]

Joseph Moffitt

Hrushikesh Narhar Mhaskar

J. Comput. Appl. Math., 2012

2011

Higher Order Numerical Discretization Methods with Sobolev Norm Minimization.

[BibT_eX]

[DOI]

Shiv Chandrasekaran

K. R. Jayaraman

Hrushikesh Narhar Mhaskar

J. Mofftt

Proceedings of the International Conference on Computational Science, 2011

2010

Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2010

Direction-Preserving and Schur-Monotonic Semiseparable Approximations of Symmetric Positive Definite Matrices.

[BibT_eX]

[DOI]

Xiaoye S. Li

Panayot S. Vassilevski

SIAM J. Matrix Anal. Appl., 2010

On the Numerical Rank of the Off-Diagonal Blocks of Schur Complements of Discretized Elliptic PDEs.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2010

Fast algorithms for hierarchically semiseparable matrices.

[BibT_eX]

[DOI]

Xiaoye S. Li

Numer. Linear Algebra Appl., 2010

2009

Superfast Multifrontal Method for Large Structured Linear Systems of Equations.

[BibT_eX]

[DOI]

Xiaoye S. Li

SIAM J. Matrix Anal. Appl., 2009

2008

Global minimization of rational functions and the nearest GCDs.

[BibT_eX]

[DOI]

Jiawang Nie

James Demmel

J. Glob. Optim., 2008

2007

Prospectus for a Dense Linear Algebra Software Library.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

A Superfast Algorithm for Toeplitz Systems of Linear Equations.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2007

2006

An Algorithm to Compute Sep<sub>λ</sub>.

[BibT_eX]

[DOI]

Michael L. Overton

SIAM J. Matrix Anal. Appl., 2006

Fast Methods for Estimating the Distance to Uncontrollability.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2006

A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations.

[BibT_eX]

[DOI]

Shiv Chandrasekaran

T. Pals

SIAM J. Matrix Anal. Appl., 2006

A Fast Solver for HSS Representations via Sparse Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2006

Prospectus for the Next LAPACK and ScaLAPACK Libraries.

[BibT_eX]

[DOI]

Proceedings of the Applied Parallel Computing. State of the Art in Scientific Computing, 2006

2005

Some Fast Algorithms for Sequentially Semiseparable Representations.

[BibT_eX]

[DOI]

Alle-Jan van der Veen

Daniel White

SIAM J. Matrix Anal. Appl., 2005

2004

A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices.

[BibT_eX]

[DOI]

Numerische Mathematik, 2004

2003

A Stable Divide and Conquer Algorithm for the Unitary Eigenproblem.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2003

Fast and Stable Algorithms for Banded Plus Semiseparable Systems of Linear Equations.

[BibT_eX]

[DOI]

Shiv Chandrasekaran

SIAM J. Matrix Anal. Appl., 2003

2002

Fast Stable Solver for Sequentially Semi-separable Linear Systems of Equations.

[BibT_eX]

[DOI]

Alle-Jan van der Veen

Proceedings of the High Performance Computing, 2002

2001

The Degenerate Bounded Errors-in-Variables Model.

[BibT_eX]

[DOI]

Keith E. Schubert

SIAM J. Matrix Anal. Appl., 2001

Spectral Relaxation for K-means Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic, 2001

A Min-max Cut Algorithm for Graph Partitioning and Data Clustering.

[BibT_eX]

[DOI]

Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November, 2001

Bipartite Graph Partitioning and Data Clustering.

[BibT_eX]

[DOI]

Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management, 2001

2000

New Methods for Estimating the Distance to Uncontrollability.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2000

Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision.

[BibT_eX]

[DOI]

SIAM J. Optim., 2000

Generalized Hermitian Eigenvalue Problems.

[BibT_eX]

[DOI]

Axel Ruhe

Gerard L. G. Sleijpen

Zhaojun Bai

Ruipeng Li

Proceedings of the Templates for the Solution of Algebraic Eigenvalue Problems, 2000

Hermitian Eigenvalue Problems.

[BibT_eX]

[DOI]

Gerard L. G. Sleijpen

Zhaojun Bai

Ruipeng Li

Proceedings of the Templates for the Solution of Algebraic Eigenvalue Problems, 2000

Non-Hermitian Eigenvalue Problems.

[BibT_eX]

[DOI]

Gerard L. G. Sleijpen

Ruipeng Li

Proceedings of the Templates for the Solution of Algebraic Eigenvalue Problems, 2000

1999

An Efficient Algorithm for a Bounded Errors-in-Variables Model.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 1999

1998

Stable and Efficient Algorithms for Structured Systems of Linear Equations.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., April, 1998

Parameter Estimation in the Presence of Bounded Data Uncertainties.

[BibT_eX]

[DOI]

Gene H. Golub

SIAM J. Matrix Anal. Appl., January, 1998

Backward Perturbation Bounds for Linear Least Squares Problems.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 1998

New Fast Algorithms for Structured Linear Least Squares Problems.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 1998

A Stable and Efficient Algorithm for the Indefinite Linear Least-Squares Problem.

[BibT_eX]

[DOI]

S. Chandrasekaran

SIAM J. Matrix Anal. Appl., 1998

1997

Parameter estimation in the presence of bounded modeling errors.

[BibT_eX]

[DOI]

Gene H. Golub

IEEE Signal Process. Lett., 1997

1996

Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 1996

1995

Downdating the Singular Value Decomposition.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 1995

A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 1995

A Divide-and-Conquer Algorithm for the Bidiagonal SVD.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 1995

Finding Well-Conditioned Similarities to Block-Diagonalize Nonsymmetric Matrices Is NP-Hard.

[BibT_eX]

[DOI]

J. Complex., 1995

Templates for Linear Algebra Problems.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994

A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., October, 1994

An Efficient Algorithm for Dynamic Text Indexing.

[BibT_eX]

[DOI]