The following pages link to John K. Reid (Q584076):
Displaying 50 items.
- New crash procedures for large systems of linear constraints (Q584077) (← links)
- (Q758847) (redirect page) (← links)
- Monitoring the stability of the triangular factorization of a sparse matrix (Q758848) (← links)
- (Q1195978) (redirect page) (← links)
- The advantages of Fortran 90 (Q1195979) (← links)
- Implicit scaling of linear least squares problems (Q1569893) (← links)
- Direct Methods for Sparse Matrices (Q2827272) (← links)
- An out-of-core sparse Cholesky solver (Q2989064) (← links)
- Partial factorization of a dense symmetric indefinite matrix (Q2989146) (← links)
- (Q3009031) (← links)
- (Q3028314) (← links)
- The Multifrontal Solution of Unsymmetric Sets of Linear Equations (Q3221277) (← links)
- (Q3308952) (← links)
- An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems (Q3549735) (← links)
- A Note on the Work Involved in No-fill Sparse Matrix Factorization (Q3659023) (← links)
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear (Q3662515) (← links)
- (Q3740904) (← links)
- The Use of Linear Programming for the Solution of Sparse Sets of Nonlinear Equations (Q3776508) (← links)
- (Q3875341) (← links)
- A practicable steepest-edge simplex algorithm (Q3887219) (← links)
- (Q3897923) (← links)
- (Q3914311) (← links)
- Solving Large Full Sets of Linear Equations in a Paged Virtual Store (Q3917421) (← links)
- Tracking the Progress of the Lanczos Algorithm for Large Symmetric Eigenproblems (Q3928917) (← links)
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (Q3955153) (← links)
- (Q3999102) (← links)
- (Q4026776) (← links)
- On the Reduction of Sparse Matrices to Condensed Forms by Similarity Transformations (Q4053781) (← links)
- A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination (Q4066491) (← links)
- (Q4085486) (← links)
- A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations (Q4095774) (← links)
- On George’s Nested Dissection Method (Q4114694) (← links)
- (Q4127260) (← links)
- An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix (Q4171509) (← links)
- Some Design Features of a Sparse Matrix Code (Q4185736) (← links)
- (Q4267252) (← links)
- The design of MA48 (Q4371093) (← links)
- Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems (Q4371094) (← links)
- Remark on “Fast floating-point processing in Common Lisp” (Q4371117) (← links)
- The impact of an efficient linear solver on finite element analyses (Q4513666) (← links)
- (Q4692656) (← links)
- (Q4693137) (← links)
- (Q4723168) (← links)
- (Q4732027) (← links)
- (Q4737845) (← links)
- On the Convergence Rates of Variational Methods II Systems of Type B, C (Q4776807) (← links)
- Reversing the row order for the row-by-row frontal method (Q4814568) (← links)
- (Q4821615) (← links)
- (Q4870477) (← links)
- (Q4888137) (← links)
