| An active-set algorithm for norm constrained quadratic problems | 0 | 0.34 | 2022 |
| Efficient Semidefinite Programming with Approximate ADMM | 0 | 0.34 | 2022 |
| TWICE IS ENOUGH FOR DANGEROUS EIGENVALUES | 0 | 0.34 | 2022 |
| Exponential Node Clustering At Singularities For Rational Approximation, Quadrature, And Pdes | 0 | 0.34 | 2021 |
| RECIPROCAL-LOG APPROXIMATION AND PLANAR PDE SOLVERS | 0 | 0.34 | 2021 |
| Error Localization Of Best L-1 Polynomial Approximants | 0 | 0.34 | 2021 |
| Vandermonde With Arnoldi | 0 | 0.34 | 2021 |
| Shifted Cholesky QR for Computing the QR Factorization of Ill-Conditioned Matrices. | 0 | 0.34 | 2020 |
| An Algorithm For Real And Complex Rational Minimax Approximation | 1 | 0.37 | 2020 |
| Rational neural networks | 0 | 0.34 | 2020 |
| Approximating the pth root by composite rational functions | 0 | 0.34 | 2019 |
| Massively Parallel Polar Decomposition on Distributed-memory Systems | 1 | 0.35 | 2019 |
| Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint | 1 | 0.36 | 2019 |
| Stable polefinding and rational least-squares fitting via eigenvalues. | 0 | 0.34 | 2018 |
| A Backward Stable Algorithm for Computing the CS Decomposition via the Polar Decomposition | 0 | 0.34 | 2018 |
| Fourth-Order Time-Stepping For Stiff PDEs On The Sphere. | 1 | 0.36 | 2018 |
| Reduction of Matrix Polynomials to Simpler Forms. | 0 | 0.34 | 2018 |
| The AAA Algorithm for Rational Approximation. | 5 | 0.62 | 2018 |
| On orthogonal tensors and best rank-one approximation ratio. | 2 | 0.39 | 2018 |
| Rational Minimax Approximation via Adaptive Barycentric Representations | 1 | 0.36 | 2018 |
| Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach. | 5 | 0.45 | 2017 |
| Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem. | 8 | 0.54 | 2017 |
| Roundoff error analysis of the CholeskyQR2 algorithm in an oblique inner product | 0 | 0.34 | 2016 |
| ON THE STABILITY OF COMPUTING POLYNOMIAL ROOTS VIA CONFEDERATE LINEARIZATIONS | 4 | 0.55 | 2016 |
| Scaled and Squared Subdiagonal Padé Approximation for the Matrix Exponential. | 2 | 0.43 | 2016 |
| Solving Generalized CDT Problems via Two-Parameter Eigenvalues. | 3 | 0.45 | 2016 |
| Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions. | 7 | 0.58 | 2016 |
| Computing the Signed Distance Between Overlapping Ellipsoids | 2 | 0.41 | 2015 |
| Finding a low-rank basis in a matrix subspace. | 1 | 0.37 | 2015 |
| Computing the common zeros of two bivariate functions via Bézout resultants | 6 | 0.55 | 2015 |
| Global Optimization Methods for Extended Fisher Discriminant Analysis. | 3 | 0.40 | 2014 |
| A Logarithmic Minimization Property of the Unitary Polar Factor in the Spectral and Frobenius Norms. | 1 | 0.37 | 2014 |
| Erratum: Perturbation of Partitioned Hermitian Definite Generalized Eigenvalue Problems. | 0 | 0.34 | 2013 |
| Stable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD. | 20 | 1.01 | 2013 |
| dqds with Aggressive Early Deflation | 3 | 0.45 | 2012 |
| On the condition numbers of a multiple eigenvalue of a generalized eigenvalue problem | 0 | 0.34 | 2012 |
| Backward Stability of Iterations for Computing the Polar Decomposition. | 5 | 0.63 | 2012 |
| Gerschgorin's theorem for generalized eigenvalue problems in the Euclidean metric | 0 | 0.34 | 2011 |
| Perturbation of Partitioned Hermitian Definite Generalized Eigenvalue Problems. | 3 | 0.73 | 2011 |
| Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition | 12 | 1.26 | 2010 |
