Pages that link to "Item:Q3685073"

The following pages link to Modification of the minimum-degree algorithm by multiple elimination (Q3685073):

Displaying 33 items.

• Asymptotic properties of multivariate tapering for estimation and prediction (Q290722) (← links)
• A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
• Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287) (← links)
• Effective preconditioning through minimum degree ordering interleaved with incomplete factorization (Q482688) (← links)
• Computational experience with a primal-dual interior point method for linear programming (Q808184) (← links)
• On the row merge tree for sparse LU factorization with partial pivoting (Q878210) (← links)
• Task scheduling for parallel sparse Cholesky factorization (Q915427) (← links)
• Fill-ins number reducing direct solver designed for FIT-type matrix (Q991499) (← links)
• A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix (Q1015916) (← links)
• Householder reflections versus Givens rotations in sparse orthogonal decomposition (Q1089725) (← links)
• Solution of sparse positive definite systems on a shared-memory multiprocessor (Q1101182) (← links)
• Solution of sparse positive definite systems on a hypercube (Q1124265) (← links)
• A parallel interior point algorithm for linear programming on a network of transputers (Q1309858) (← links)
• Recovering an optimal LP basis from an interior point solution (Q1342078) (← links)
• Matrix enlarging methods and their application (Q1371659) (← links)
• A parallel solver for the \(hp\)-version of finite element methods (Q1371905) (← links)
• FaSa: A fast and stable quadratic placement algorithm (Q1415932) (← links)
• A parallel multi-\(p\) method (Q1569994) (← links)
• Decomposition in multidimensional Boolean-optimization problems with sparse matrices (Q1647455) (← links)
• Experiments with sparse Cholesky using a sequential task-flow implementation (Q1713223) (← links)
• New parallel sparse direct solvers for multicore architectures (Q1736591) (← links)
• Preconditioning techniques for large linear systems: A survey (Q1868569) (← links)
• Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives (Q1954336) (← links)
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949) (← links)
• An overlapping domain decomposition preconditioning method for monolithic solution of shear bands (Q2309078) (← links)
• A primal-dual interior-point algorithm for quadratic programming (Q2502230) (← links)
• A Frisch-Newton algorithm for sparse quantile regression (Q2508013) (← links)
• Improving parallel ordering of sparse matrices using genetic algorithms (Q2576753) (← links)
• A Sparse Symmetric Indefinite Direct Solver for GPU Architectures (Q2828161) (← links)
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method (Q3026741) (← links)
• The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures (Q3300489) (← links)
• Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes (Q3382788) (← links)
• The effect of ordering on preconditioned GMRES algorithm, for solving the compressible Navier‐Stokes equations (Q4696329) (← links)