AMCA: CO(q,r) and GCO(q,r): How These Generalizations of Consistent Orderings of Matrices Can be Viewed From Graph Theory for Partitioned Matrices by Richard S. Varga

Atlas Mathematical Conference Abstracts || Conferences | Abstracts | for Organizers | About AMCA

5th IMACS Conference on Iterative Methods in Scientific Computing
May 28-31, 2001
Foundation for Research and Technology - Hellas (FORTH)
Heraklion, Crete, Greece

Organizers
Apostolos Hadjidimos, Elias Houstis, Emmanuel Vavalis

View Abstracts
Conference Homepage

CO(q, r) and GCO(q, r): How These Generalizations of Consistent Orderings of Matrices Can be Viewed From Graph Theory for Partitioned Matrices
by
Richard S. Varga
Institute for Computational Mathematics, Kent State University, Kent Ohio 44242, USA
Coauthors: Apostolos Hadjidimos University of Crete

We show here that the CO(q, r) and GCO(q, r) generalizations for consistent orderings, as discussed by Broyden, Verner and Bernal, and Young, can all be covered by the use of graph theory applied to partitioned matrices.

Author's Web Page

Date received: March 21, 2001

Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Mathematical Conference Abstracts. Document # cagm-33.