Pages that link to "Item:Q2778583"
From MaRDI portal
The following pages link to The elimination form of the inverse and its application to linear programming (Q2778583):
Displaying 50 items.
- Differential geometric treewidth estimation in adiabatic quantum computation (Q332093) (← links)
- Sparsity preserving preconditioners for linear systems in interior-point methods (Q493682) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- Making sparse matrices sparser: Computational results (Q751503) (← links)
- Inverse matrix representation with one triangular array (Q796247) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Towards a practical parallelisation of the simplex method (Q970132) (← links)
- Fill-ins number reducing direct solver designed for FIT-type matrix (Q991499) (← links)
- Implementation of successive linear programming algorithms for non-convex goal programming (Q1093528) (← links)
- A survey of the advances in the exploitation of the sparsity in the solution of large problems (Q1099926) (← links)
- Techniques for parallel manipulation of sparse matrices (Q1119337) (← links)
- Computational methods of linear algebra (Q1148099) (← links)
- A direct method for the solution of sparse linear least squares problems (Q1157668) (← links)
- Towards a cost-effective ILU preconditioner with high level fill (Q1198973) (← links)
- Pivot selection and row ordering in Givens reduction on sparse matrices (Q1214736) (← links)
- On solving problems with sparse matrices (Q1245674) (← links)
- Detecting embedded pure network structures in LP problems (Q1265245) (← links)
- Ordering algorithms for irreducible sparse linear systems (Q1309854) (← links)
- Recognizing badly presented \(Z\)-modules (Q1311319) (← links)
- Solving symmetric indefinite systems in an interior-point method for linear programming (Q1321659) (← links)
- A distributed memory parallel algorithm for the efficient computation of sensitivities of differential-algebraic systems (Q1404673) (← links)
- Extracting pure network submatrices in linear programs using signed graphs. (Q1427813) (← links)
- A primal partitioning approach for single and non-simultaneous multicommodity flow problems (Q1569942) (← links)
- The impact of high-performance computing in the solution of linear systems: Trends and problems (Q1591200) (← links)
- iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data (Q1624673) (← links)
- Parallel search paths for the simplex algorithm (Q1642812) (← links)
- Method of fundamental solutions for 3D elasticity with body forces by coupling compactly supported radial basis functions (Q1654813) (← links)
- Distance descending ordering method: an \(O(n)\) algorithm for inverting the mass matrix in simulation of macromolecules with long branches (Q1695352) (← links)
- Tractability of most probable explanations in multidimensional Bayesian network classifiers (Q1726375) (← links)
- On the convergence of iterative solvers for polygonal discontinuous Galerkin discretizations (Q1746923) (← links)
- Complete integration-by-parts reductions of the non-planar hexagon-box via module intersections (Q1797273) (← links)
- Maintaining LU factors of a general sparse matrix (Q1822448) (← links)
- Experiences with sparse matrix solvers in parallel ODE software (Q1921218) (← links)
- An efficient algorithm for sparse null space basis problem using ABS methods (Q1944750) (← links)
- Quantum solutions for densest \(k\)-subgraph problems (Q1983021) (← links)
- Rotation-free Bernstein-Bézier elements for thin plates and shells -- development and validation (Q1987912) (← links)
- A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods (Q2012233) (← links)
- Learning chordal extensions (Q2046324) (← links)
- A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
- Learning tractable Bayesian networks in the space of elimination orders (Q2321308) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- Parallel distributed-memory simplex for large-scale stochastic LP problems (Q2393649) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\) (Q2492665) (← links)
- On the optimal choice of pivots for the Gaussian elimination (Q2557985) (← links)
- A desirable form for sparse matrices when computing their inverse in factored forms (Q2559903) (← links)
- Sparse Gaussian Elimination Modulo p: An Update (Q2829994) (← links)
- Differentiation of matrix functionals using triangular factorization (Q3015047) (← links)
- Computational complexity of some intelligent computing systems (Q3100986) (← links)
- State-of-the-Art Sparse Direct Solvers (Q3300486) (← links)
