In this note we provide a new proof for the results of Lipton et al. [3] on the existence of an approximate Nash equilibrium with logarithmic support size. Besides its simplicity, the new proof leads to the following contributions: 1. For n-player games, we improve the bound on the size of the support of an approximate Nash equilibrium. 2. We generalize the result of Daskalakis and Papadimitrio...

With the expansion of the scale of linear finite element analyzing data, efficiency of computation is a main technical bottleneck. For solving the bottleneck, parallel computation is playing an increasingly prominent role. At present, the researches on linear finite element parallel computation are mainly concentrated on the preprocessing phase, and goal of these researches is to reduce the com...

unsteady flow through non - homogeneous and anisotropic porous media can be modeled by a partial differential equation.' this-equation cannot be solved analytically. hence, numerical methods. such as the finite element and the finite difference methods might be employed. in this study a mathematical model has been developed using the fully implicit finite difference method with control vol...

T is the second of two papers dealing with the relationship of branchwidth and planar graphs. Branchwidth and branch decompositions, introduced by Robertson and Seymour, have been shown to be beneficial for both proving theoretical results on graphs and solving NP-hard problems modeled on graphs. The first practical implementation of an algorithm of Seymour and Thomas for computing optimal bran...

Tridiagonal matrix inversion is an important operation with many applications. It arises frequently in solving discretized one-dimensional elliptic partial differential equations, and forms the basis for algorithms block tridiagonal PDEs higher-dimensions. In such systems, this often scaling bottleneck parallel computation. paper, we derive a hybrid multigrid-Thomas algorithm designed to effici...

T notion of branch decompositions and its related connectivity invariant for graphs, branchwidth, were introduced by Robertson and Seymour in their series of papers that proved Wagner’s conjecture. Branch decompositions can be used to solve NP-hard problems modeled on graphs, but finding optimal branch decompositions of graphs is also NP-hard. This is the first of two papers dealing with the re...

the adsorption of lead (11) and copper (11) in a fixed bed column using activated carbonprepared from nipa palm nut was investigated. thomas model and yoon and nelson kinetic models were used to analyze the column performance. the rate constant for thomas model increased with increase in flow rate and initial ion concentration but remained constant at varying bed height. adsorption capacity for...

Numerical modelling of the thermodynamic properties plasma mixture is performed using Thomas – Fermi model with two different approaches. For this purpose, a numerical algorithm, as well program realization, developed to solve equations quantum-exchange corrections. first time comparison between methods for taking account heterogeneous composition made and an algorithm estimating corrections mi...