scientific article; zbMATH DE number 3791534

MaRDI QIDQ3968384zbMATH OpenFDO

Authors Marinus Veldhorst

Publication date 1982

zbMATH Keywords

block partitioncomplexity of algorithmsdata structurelinear least squaresLU decompositionpermutationrowmatsimplex methodsparse matrix storage schemeTORRIX-SPARSEtree storage scheme

Mathematics Subject Classification ID

Factorization of matrices (15A23) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Software, source code, etc. for problems pertaining to numerical analysis (65-04) Numerical smoothing, curve fitting (65D10) Computational methods for sparse matrices (65F50) Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cited in

(1)

• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3968384)