SPARSPAK

swMATH4309MaRDI QIDQ16489

No author found.

Related Items (38)

Computational experience with numerical methods for nonnegative least-squares problems ⋮ GRSIM: A FORTRAN subroutine for the solution of non-symmetric linear systems ⋮ Unnamed Item ⋮ Parallel homotopy algorithm for symmetric large sparse eigenproblems ⋮ Sparse linear least squares problems in optimization ⋮ Unnamed Item ⋮ A direct method for sparse least squares problems with lower and upper bounds ⋮ On the Use of Structural Zeros in Orthogonal Factorization ⋮ On General Row Merging Schemes for Sparse Givens Transformations ⋮ A perturbation approach for low frequency noise in junction field effect transistors ⋮ The Probability of Large Diagonal Elements in the $QR$ Factorization ⋮ Solution of sparse positive definite systems on a hypercube ⋮ Rank Detection Methods for Sparse Matrices ⋮ Unnamed Item ⋮ Karmarkar's projective method for linear programming: a computational survey ⋮ Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods ⋮ Distributed Sparse Gaussian Elimination and Orthogonal Factorization ⋮ Performance Issues for Iterative Solvers in Device Simulation ⋮ Multiple-Rank Modifications of a Sparse Cholesky Factorization ⋮ Unnamed Item ⋮ Experiments with an ordinary differential equation solver in the parallel solution of method of lines problems on a shared-memory parallel computer ⋮ Sparse matrices, and the estimation of variance components by likelihood methods ⋮ ANOVA Model Fitting via Sparse Matrix Computations: A Fast Direct Method ⋮ On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method ⋮ Bifurcation and stability of forced convection in tightly coiled ducts: multiplicity ⋮ Sparse QR factorization on a massively parallel computer ⋮ A range-space implementation for large quadratic programs with small active sets ⋮ Unnamed Item ⋮ A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems ⋮ Efficient solution of two-stage stochastic linear programs using interior point methods ⋮ Effective Preconditioning through Ordering Interleaved with Incomplete Factorization ⋮ On some properties of the Laplacian matrix revealed by the RCM algorithm ⋮ Unnamed Item ⋮ Iterative methods for linear systems of equations: A brief historical journey ⋮ Sparse Multifrontal Rank Revealing QR Factorization ⋮ The impact of high-performance computing in the solution of linear systems: Trends and problems ⋮ A Non-Interior-Point Continuation Method for Linear Complementarity Problems ⋮ An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations

This page was built for software: SPARSPAK