Some Results on Sparse Matrices

DOI10.2307/2004627zbMATH Open0233.65022OpenAlexW4237657905MaRDI QIDQ5641963FDOQ5641963

Authors: Fred G. Gustavson, Ralph A. Willoughby, Robert K. Brayton 

Publication date: 1971

Full work available at URL: https://doi.org/10.2307/2004627

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Decomposition Algorithm for Linear Programs
• Title not available (Why is that?)
• Algorithms for the Assignment and Transportation Problems
• Title not available (Why is that?)
• Error Analysis of Direct Methods of Matrix Inversion
• Decomposition Principle for Linear Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Evolution of linear programming computing techniques
• The Use of Linear Graphs in Gauss Elimination
• On Pre-Conditioning of Matrices
• Solving linear least squares problems by Gram-Schmidt orthogonalization
• Optimally scaled matrices
• Title not available (Why is that?)
• ROUNDING-OFF ERRORS IN MATRIX PROCESSES
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the number of multiplications necessary to compute certain functions
• The elimination form of the inverse and its application to linear programming
• Title not available (Why is that?)
• The Analysis of Large Structural Systems
• Numerical Linear Algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithm for reducing the bandwidth of a matrix of symmetrical configuration
• Title not available (Why is that?)
• On the Inversion of Sparse Matrices
• An Algorithm for Scaling Matrices
• On Best Conditioned Matrices
• On the Product Form of Inverses of Sparse Matrices
• Title not available (Why is that?)
• The Product Form for the Inverse in the Simplex Method
• Two Algorithms for Bipartite Graphs
• Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
• A Survey of Some Closed Methods for Inverting Matrices
• The Product Form of Inverses of Sparse Matrices and Graph Theory
• Solution of linear equations with coefficient matrix in band form
• A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous Equations
• Graphs and Matrices
• A graph theoretic approach to matrix inversion by partitioning
• Minimization of the number of arithmetic operations in the solution of linear algebraic systems of equations
• Row-column permutation of sparse matrices
• Title not available (Why is that?)
• Solution of real and complex systems of linear equations
• Admissible Solutions of Linear Systems with Not Sharply Defined Coefficients
• Computable Error Bounds for Direct Solution of Linear Equations
• Optimal elimination for sparse symmetric systems as a graph problem.
• An empirical estimate of the relative error of the computed solution x of Ax = b
• Solution of a system of simultaneous linear equations with a sparse coefficient matrix by elimination methods
• The Decomposition of Economic Production Systems
• Title not available (Why is that?)
• Solution of Certain Large Sets of Equations on Pegasus using Matrix Methods
• A Note on Systems of Linear Equations
• The Inversion of Sparse Matrices by a Strategy Derived from their Graphs
• A Graph Technique for Inverting Certain Matrices
• Title not available (Why is that?)
• The Inversion of Matrices by Flow Graphs
• Title not available (Why is that?)

Cited In (8)

• On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices
• On solving problems with sparse matrices
• A survey of the advances in the exploitation of the sparsity in the solution of large problems
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• On the efficient computation of the nonlinear full-information maximum- likelihood estimator
• Predicting the structure of sparse orthogonal factors
• Degree switching operations in networks and large scale systems assignment problems
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method

This page was built for publication: Some Results on Sparse Matrices

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