The following pages link to SPARSPAK (Q16489):
Displayed 38 items.
- Sparse QR factorization on a massively parallel computer (Q973426) (← links)
- A direct method for sparse least squares problems with lower and upper bounds (Q1112557) (← links)
- Solution of sparse positive definite systems on a hypercube (Q1124265) (← links)
- Experiments with an ordinary differential equation solver in the parallel solution of method of lines problems on a shared-memory parallel computer (Q1184125) (← links)
- An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations (Q1322460) (← links)
- Sparse linear least squares problems in optimization (Q1363062) (← links)
- The impact of high-performance computing in the solution of linear systems: Trends and problems (Q1591200) (← links)
- Efficient solution of two-stage stochastic linear programs using interior point methods (Q1803648) (← links)
- Parallel homotopy algorithm for symmetric large sparse eigenproblems (Q1900754) (← links)
- A perturbation approach for low frequency noise in junction field effect transistors (Q1914616) (← links)
- A range-space implementation for large quadratic programs with small active sets (Q2277143) (← links)
- Bifurcation and stability of forced convection in tightly coiled ducts: multiplicity (Q2484916) (← links)
- Multiple-Rank Modifications of a Sparse Cholesky Factorization (Q2706302) (← links)
- (Q2733805) (← links)
- On some properties of the Laplacian matrix revealed by the RCM algorithm (Q2828802) (← links)
- Computational experience with numerical methods for nonnegative least-squares problems (Q2889392) (← links)
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method (Q3026741) (← links)
- Sparse Multifrontal Rank Revealing <i>QR</i> Factorization (Q3126195) (← links)
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems (Q3142623) (← links)
- A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems (Q3359649) (← links)
- On the Use of Structural Zeros in Orthogonal Factorization (Q3474201) (← links)
- The Probability of Large Diagonal Elements in the $QR$ Factorization (Q3479443) (← links)
- (Q3480806) (← links)
- Karmarkar's projective method for linear programming: a computational survey (Q3491310) (← links)
- (Q3664299) (← links)
- On General Row Merging Schemes for Sparse Givens Transformations (Q3742616) (← links)
- Sparse matrices, and the estimation of variance components by likelihood methods (Q3816860) (← links)
- ANOVA Model Fitting via Sparse Matrix Computations: A Fast Direct Method (Q3816907) (← links)
- (Q3840333) (← links)
- Rank Detection Methods for Sparse Matrices (Q4021622) (← links)
- (Q4287442) (← links)
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods (Q4594173) (← links)
- (Q4717930) (← links)
- GRSIM: A FORTRAN subroutine for the solution of non-symmetric linear systems (Q4804578) (← links)
- Distributed Sparse Gaussian Elimination and Orthogonal Factorization (Q4859546) (← links)
- Performance Issues for Iterative Solvers in Device Simulation (Q4870641) (← links)
- Iterative methods for linear systems of equations: A brief historical journey (Q4998638) (← links)
- Effective Preconditioning through Ordering Interleaved with Incomplete Factorization (Q5470511) (← links)