An efficient algorithm for sparse null space basis problem using ABS methods
type: Item
instance of: scholarly article
title: An efficient algorithm for sparse null space basis problem using ABS methods
zbMATH Open document ID: 1262.65055
author: Nezam Mahdavi-Amiri
author: M. Khorramizadeh
published in: Numerical Algorithms
publication date: 2013-03-27T00:00:00Z
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6149000
zbMATH Keywords: sparse matrix
zbMATH Keywords: null space basis
zbMATH Keywords: extended ABS algorithm
zbMATH Keywords: Markowitz criterion
zbMATH Keywords: numerical results
zbMATH Keywords: linear programming
describes a project that uses: SPARSE-QR
describes a project that uses: CSparse
describes a project that uses: UMFPACK
describes a project that uses: NETLIB LP Test Set
describes a project that uses: Matlab
MaRDI profile type: Publication
full work available at URL: s11075-012-9599-1
OpenAlex ID: W1976967329
cites work: A class of direct methods for linear systems
cites work: Q3995754
cites work: An algorithm to compute a sparse basis of the null space
cites work: Block computation and representation of a sparse nullspace basis of a rectangular matrix
cites work: Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
cites work: Estimation of sparse hessian matrices and graph coloring problems
cites work: The Null Space Problem I. Complexity
cites work: The Null Space Problem II. Algorithms
cites work: Algorithm 832
cites work: Direct Methods for Sparse Linear Systems
cites work: Computing a Sparse Basis for the Null Space
cites work: Separators and structure prediction in sparse orthogonal factorization
cites work: Maintaining LU factors of a general sparse matrix
cites work: Numerical Solution of Navier–Stokes Problems by the Dual Variable Method
cites work: Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
cites work: A primal null-space affine-scaling method
cites work: On computational procedures for the force method
cites work: Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
cites work: The elimination form of the inverse and its application to linear programming
cites work: Sparse QR factorization in MATLAB
cites work: Substructuring Methods for Computing the Nullspace of Equilibrium Matrices
cites work: A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
cites work: ABS methods for continuous and integer linear equations and optimization
cites work: ABS methods and ABSPACK for linear systems and optimization: A review
cites work: Nested Dissection for Sparse Nullspace Bases
DOI: 10.1007/S11075-012-9599-1
description: scientific article; zbMATH DE number 6149000