The following pages link to Ming Gu (Q372855):
Displaying 50 items.
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals (Q372857) (← links)
- Higher order numerical discretizations for exterior and biharmonic type PDEs (Q448446) (← links)
- An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems (Q1358157) (← links)
- (Q1434058) (redirect page) (← links)
- A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices (Q1434059) (← links)
- Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices (Q1579515) (← links)
- Strong rank revealing Cholesky factorization (Q1772035) (← links)
- Strong rank revealing LU factorizations (Q1873693) (← links)
- Finding well-conditioned similarities to block-diagonalize nonsymmetric matrices is NP-hard (Q1908896) (← links)
- A modified Brent's method for finding zeros of functions (Q1938820) (← links)
- Computing the singular value decomposition with high relative accuracy (Q1964330) (← links)
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths (Q2007234) (← links)
- OntCheck: an ontology-driven static correctness checking tool for component-based models (Q2375721) (← links)
- A unified framework for DPLL(T) + certificates (Q2375732) (← links)
- Fast structured LU factorization for nonsymmetric matrices (Q2450863) (← links)
- The Degenerate Bounded Errors-in-Variables Model (Q2719207) (← links)
- (Q2784755) (← links)
- LU Factorization with Panel Rank Revealing Pivoting and Its Communication Avoiding Version (Q2866242) (← links)
- An Improved DQDS Algorithm (Q2878975) (← links)
- An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem (Q2936585) (← links)
- On the Numerical Rank of the Off-Diagonal Blocks of Schur Complements of Discretized Elliptic PDEs (Q3079746) (← links)
- Direction-Preserving and Schur-Monotonic Semiseparable Approximations of Symmetric Positive Definite Matrices (Q3079763) (← links)
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices (Q3079777) (← links)
- Fast algorithms for hierarchically semiseparable matrices (Q3090808) (← links)
- An Algorithm to Compute {\boldmath{$\Sep_{\lambda}$}} (Q3435002) (← links)
- Fast Methods for Estimating the Distance to Uncontrollability (Q3435008) (← links)
- Communication Avoiding Rank Revealing QR Factorization with Column Pivoting (Q3453430) (← links)
- (Q3574026) (← links)
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations (Q3584165) (← links)
- New Fast Algorithms for Structured Linear Least Squares Problems (Q4243503) (← links)
- A Stable and Efficient Algorithm for the Indefinite Linear Least-Squares Problem (Q4243508) (← links)
- Backward Perturbation Bounds for Linear Least Squares Problems (Q4243509) (← links)
- A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem (Q4313377) (← links)
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD (Q4325679) (← links)
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem (Q4325685) (← links)
- (Q4327452) (← links)
- (Q4353202) (← links)
- Parameter Estimation in the Presence of Bounded Data Uncertainties (Q4389072) (← links)
- Stable and Efficient Algorithms for Structured Systems of Linear Equations (Q4389075) (← links)
- (Q4417509) (← links)
- Fast and Stable Algorithms for Banded Plus Semiseparable Systems of Linear Equations (Q4443831) (← links)
- A Stable Divide and Conquer Algorithm for the Unitary Eigenproblem (Q4443834) (← links)
- An Efficient Algorithm for a Bounded Errors-in-Variables Model (Q4702232) (← links)
- Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation (Q4714737) (← links)
- Downdating the Singular Value Decomposition (Q4842565) (← links)
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization (Q4891737) (← links)
- A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling (Q4902924) (← links)
- New Efficient and Robust HSS Cholesky Factorization of SPD Matrices (Q4902926) (← links)
- New Methods for Estimating the Distance to Uncontrollability (Q4943673) (← links)
- Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision (Q4943940) (← links)
