An efficient algorithm for sparse null space basis problem using ABS methods (Q1944750): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SPARSE-QR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CSparse / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UMFPACK / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NETLIB LP Test Set / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11075-012-9599-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976967329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of direct methods for linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to compute a sparse basis of the null space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block computation and representation of a sparse nullspace basis of a rectangular matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of Sparse Jacobian Matrices and Graph Coloring Blems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of sparse hessian matrices and graph coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Null Space Problem I. Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Null Space Problem II. Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Methods for Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Sparse Basis for the Null Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separators and structure prediction in sparse orthogonal factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining LU factors of a general sparse matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Solution of Navier–Stokes Problems by the Dual Variable Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Orthogonal Schemes for Structural Optimization Using the Force Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal null-space affine-scaling method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computational procedures for the force method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multifrontal Computation with the Orthogonal Factors of Sparse Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Elimination form of the Inverse and its Application to Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse QR factorization in MATLAB / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substructuring Methods for Computing the Nullspace of Equilibrium Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: ABS methods for continuous and integer linear equations and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: ABS methods and ABSPACK for linear systems and optimization: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested Dissection for Sparse Nullspace Bases / rank
 
Normal rank

Latest revision as of 08:20, 6 July 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for sparse null space basis problem using ABS methods
scientific article

    Statements

    An efficient algorithm for sparse null space basis problem using ABS methods (English)
    0 references
    27 March 2013
    0 references
    sparse matrix
    0 references
    null space basis
    0 references
    extended ABS algorithm
    0 references
    Markowitz criterion
    0 references
    numerical results
    0 references
    linear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references