A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
- 1 January 1972
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Contribution to nonserial dynamic programmingJournal of Mathematical Analysis and Applications, 1969
- A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programmingJournal of Mathematical Analysis and Applications, 1969
- Reducing the bandwidth of sparse symmetric matricesPublished by Association for Computing Machinery (ACM) ,1969
- An automatic node-relabeling scheme for bandwidth minimization of stiffness matrices.AIAA Journal, 1968
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- An algorithm for reducing the bandwidth of a matrix of symmetrical configurationThe Computer Journal, 1965
- Two Algorithms for Bipartite GraphsJournal of the Society for Industrial and Applied Mathematics, 1963
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962
- On the inversion of sparse matricesMathematics of Computation, 1962
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961