The following pages link to Jennifer Scott (Q634120):
Displaying 50 items.
- The importance of structure in incomplete factorization preconditioners (Q634121) (← links)
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
- New parallel sparse direct solvers for multicore architectures (Q1736591) (← links)
- Solving large linear least squares problems with linear equality constraints (Q2098770) (← links)
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block (Q2159428) (← links)
- Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems (Q2419539) (← links)
- (Q2709663) (← links)
- (Q2760352) (← links)
- A Sparse Symmetric Indefinite Direct Solver for GPU Architectures (Q2828161) (← links)
- Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations (Q2831075) (← links)
- On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization (Q2874998) (← links)
- Compressed Threshold Pivoting for Sparse Symmetric Indefinite Systems (Q2923371) (← links)
- An efficient analyse phase for element problems (Q2931513) (← links)
- A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints (Q2952141) (← links)
- Level-set topology optimization with many linear buckling constraints using an efficient and robust eigensolver (Q2952986) (← links)
- An out-of-core sparse Cholesky solver (Q2989064) (← links)
- A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems (Q2989100) (← links)
- Scaling and pivoting in an out-of-core sparse direct solver (Q2989102) (← links)
- Partial factorization of a dense symmetric indefinite matrix (Q2989146) (← links)
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems (Q3133587) (← links)
- Pivoting strategies for tough sparse indefinite systems (Q3189697) (← links)
- A frontal solver for the 21st century (Q3423252) (← links)
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices (Q3466259) (← links)
- Experiences of sparse direct symmetric solvers (Q3549179) (← links)
- A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations (Q3549203) (← links)
- An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems (Q3549735) (← links)
- Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers (Q3600008) (← links)
- (Q3700714) (← links)
- On the Exact Order of Convergence of Discrete Methods for Volterra-type Equations (Q3833524) (← links)
- (Q4216232) (← links)
- (Q4254153) (← links)
- (Q4261039) (← links)
- (Q4327555) (← links)
- The design of a new frontal code for solving sparse, unsymmetric systems (Q4371086) (← links)
- Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration (Q4371533) (← links)
- Corrigendum: Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration (Q4371604) (← links)
- (Q4375648) (← links)
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques (Q4389261) (← links)
- A frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications (Q4518219) (← links)
- Preordering saddle‐point systems for sparse <i>L</i><i>D</i><i>L</i><sup><i>T</i></sup> factorization without pivoting (Q4558715) (← links)
- Numerically Aware Orderings for Sparse Symmetric Indefinite Linear Systems (Q4581369) (← links)
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods (Q4594173) (← links)
- Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners (Q4599015) (← links)
- A comparative study of null‐space factorizations for sparse symmetric saddle point systems (Q4637390) (← links)
- Multilevel hybrid spectral element ordering algorithms (Q4680507) (← links)
- Reversing the row order for the row-by-row frontal method (Q4814568) (← links)
- (Q4951614) (← links)
- Level-based heuristics and hill climbing for the antibandwidth maximization problem (Q4982954) (← links)
- Strengths and Limitations of Stretching for Least-squares Problems with Some Dense Rows (Q5025215) (← links)
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems (Q5066598) (← links)
