TITLE

A Parallel Network Equilibration Algorithm for a Class of Constrained Matrix Problems

AUTHOR(S)
Nagurney, Anna; Eydeland, Alexander
PUB. DATE
February 1992
SOURCE
Transportation Science;Feb92, Vol. 26 Issue 1, p59
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In this paper we propose a network equilibration algorithm for the solution of a class of constrained matrix problems with transportation-type constraints. The algorithm decomposes the problem into two series of supply and demand network equilibrium problems with special structure which can then be solved exactly and in parallel. The theoretical results obtained include the proof of convergence, the rate of convergence, and computational complexity analysis, and are obtained by interpreting the algorithm as a dual method. Computational results on datasets illustrate the theory and the efficiency of this approach.
ACCESSION #
4454697

 

Related Articles

  • Fast hybrid matrix multiplication algorithms. Jelfimova, L. D. // Cybernetics & Systems Analysis;Jul2010, Vol. 46 Issue 4, p563 

    New hybrid algorithms for matrix multiplication are proposed that have the lowest computational complexity in comparison with well-known matrix multiplication algorithms. Based on the proposed algorithms, efficient algorithms are developed for the basic operation $ D = C + \sum\limits_{l...

  • Models and algorithms for fair layout optimization problems. Fernandes Muritiba, Albert E.; Iori, Manuel; Martello, Silvano; Negreiros Gomes, Marcos J. // Annals of Operations Research;Sep2010, Vol. 179 Issue 1, p5 

    Given a non-convex two-dimensional area and identical rectangular stands, we consider the problem of placing the maximum number of stands in the area, by satisfying a number of operational constraints. We present linear programming models and show the total unimodularity of the matrices...

  • A Newton-SOR Method for Spatial Price Equilibrium. Marcotte, Patrice; Marquis, Gérald; Zubieta, Lourdes // Transportation Science;Feb92, Vol. 26 Issue 1, p36 

    In this paper we propose an efficient Newton-SOR algorithm for solving the separable spatial price equilibrium problem. Although an active set strategy is implemented for solving for blocks of variables associated with origin nodes, global convergence of the iterates is not dependent on...

  • COMPUTING COURNOT-NASH EQUILIBRIA. Kolstad, Charles D.; Mathiesen, Lars // Operations Research;Sep/Oct91, Vol. 39 Issue 5, p739 

    This paper examines convergence criteria of an algorithm for the computation of Cournot-Nash economic equilibria. The method is based on formulating the equilibrium problem as that of finding a solution to a nonlinear complementarity problem, solved by sequential linearization and Lemke's...

  • Species Boundary of Bionic Theory in Provincial Domain Financial Configuration Effectiveness Analysis. Dai Zhi-Min; Guo Lu; Zhang Heng-Feng // Information Technology Journal;2013, Vol. 12 Issue 18, p3710 

    From the perspective of financial and ecological, market, legality and government are three different ecosystems; the system functions must be clear according to bionics species boundaries clear request. If the three border fuzzy, market, government and legality will occur with alienation,...

  • Migration among Multicities. Ming Guan // International Journal of Human & Social Sciences;Summer2011, Vol. 6 Issue 3, p144 

    This paper proposes a simple model of economic geography within the Dixit-Stiglitz-Iceberg framework that may be used to analyze migration patterns among three cities. The cost--benefit tradeoffs affecting incentives for three types of migration, including echelon migration, are discussed. This...

  • New fast hybrid matrix multiplication algorithms. Jelfimova, L. // Cybernetics & Systems Analysis;Nov2011, Vol. 47 Issue 6, p881 

    New hybrid algorithms are proposed for multiplying ( n × n) matrices. They are based on Laderman's algorithm for multiplying (3 × 3)-matrices. As compared with well-known hybrid matrix multiplication algorithms, the new algorithms are characterized by the minimum computational...

  • An inversion algorithm for general tridiagonal matrix. Rui-sheng Ran; Ting-zhu Huang; Xing-ping Liu; Tong-xiang Gu // Applied Mathematics & Mechanics;Feb2009, Vol. 30 Issue 2, p247 

    An algorithm for the inverse of a general tridiagonal matrix is presented. For a tridiagonal matrix having the Doolittle factorization, an inversion algorithm is established. The algorithm is then generalized to deal with a general tridiagonal matrix without any restriction. Comparison with...

  • DETERMINANTS AND INVERSES OF SKEW AND SKEW LEFT CIRCULANT MATRICES INVOLVING THE k-LUCAS NUMBERS IN COMMUNICATIONS - II. Xiao-Yu Jiang; Yun Gao; Zhao-Lin Jiang // Far East Journal of Mathematical Sciences;Jul2013, Vol. 78 Issue 1, p1 

    In this paper, we consider the skew circulant and skew left circulant matrices with the k-Lucas numbers in communications. First, we discuss the invertibility of the skew circulant matrix and present the determinant and the inverse matrix by constructing the transformation matrices. Furthermore,...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics