The Principal Maxmin Matrix Transversal Strategy

Given a fully irreducible matrix Y, we present a new matrix transversal strategy for the finding of a permutation matrix Q such that the condition numbers of the leading block A and its Schur complement D-CA-1B in a 2 × 2 block form of YQ are as small as possible with respect to the i∞-norm. Our notion of principal maxmin transversal of a matrix is a special case of an important combinatorial mathematics notion introduced by P. Hall more than 40 years ago.

[1]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[2]  R. Cottle.  Manifestations of the Schur complement , 1974 .

[3]  Eli Hellerman,et al.  The Partitioned Preassigned Pivot Procedure (P4) , 1972 .

[4]  R. Willoughby.  Sparse matrices and their applications , 1972 .

[5]  C. Desoer,et al.  Input-output stability theory of interconnected systems using decomposition techniques , 1976 .

[6]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[7]  Alberto Sangiovanni-Vincentelli.  AN OPTIMIZATION PROBLEM ARISING FROM TEARING METHODS , 1976 .

[8]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[9]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[10]  Marshall Hall,et al.  An Algorithm for Distinct Representatives , 1956 .

[11]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[12]  P. Hall.  On Representatives of Subsets , 1935 .

[13]  N. S. Mendelsohn,et al.  Two Algorithms for Bipartite Graphs , 1963 .

[14]  Aram Kevorkian,et al.  Erratum: Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal , 1979, J. Graph Theory.

[15]  J. Gillis,et al.  Matrix Iterative Analysis , 1961 .

[16]  G. Forsythe,et al.  Computer solution of linear algebraic systems , 1969 .

[17]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[18]  J. Tomlin.  Pivoting for Size and Sparsity in Linear Programming Inversion Routes , 1972 .

[19]  D. R. Fulkerson,et al.  A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem , 1957, Canadian Journal of Mathematics.

[20]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[21]  D. V. Steward.  On an Approach to Techniques for the Analysis of the Structure of Large Systems of Equations , 1962 .

[22]  Eli Hellerman,et al.  Reinversion with the preassigned pivot procedure , 1971, Math. Program..

[23]  Michael A. Saunders,et al.  A FAST, STABLE IMPLEMENTATION OF THE SIMPLEX METHOD USING BARTELS-GOLUB UPDATING , 1976 .

[24]  Petar V. Kokotovic,et al.  Singular perturbations and order reduction in control theory - An overview , 1975, at - Automatisierungstechnik.

[25]  Harvey J. Greenberg,et al.  Determining GUB sets via an invert agenda algorithm , 1974, Math. Program..

[26]  Gene H. Golub,et al.  The simplex method of linear programming using LU decomposition , 1969, Commun. ACM.

[27]  F. Gustavson.  FINDING THE BLOCK LOWER TRIANGULAR FORM OF A SPARSE MATRIX , 1976 .

[28]  George B. Dantzig,et al.  Generalized Upper Bounding Techniques , 1967, J. Comput. Syst. Sci..

[29]  Richard D. McBride,et al.  The factorization approach to large-scale linear programming , 1976, Math. Program..

[30]  J. Uhlig.  C. Forsythe and C. B. Moler, Computer Solution of Linear Algebraic Systems. (Series in Automatic Computation) XI + 148 S. Englewood Cliffs, N.J. 1967. Prentice-Hall, Inc. Preis geb. 54 s. net , 1972 .

[31]  A. Kevorkian.  On bordered triangular or lower N forms of an irreducible matrix , 1976 .

[32]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .