排序方式: 共有34条查询结果,搜索用时 15 毫秒
1.
Many physical phenomena develop singular, or nearly singular behavior in localized regions, e.g. boundary layers or blowup solutions. Using uniform grids for such problems becomes computationally prohibitive as the solution approaches singularity. Ren and Wang developed a semi-static adaptive grid method [W. Ren, X.P. Wang, An iterative grid redistribution method for singular problems in multiple dimensions, J. Comput. Phys. 159 (2000) 246–273] for the solution of these problems, known as the iterative grid redistribution (IGR) method. In this study we develop a theoretical basis for semi-static adaptive grid method for singular problems. Based on this theory, we obtain the key result of this study – a methodology for designing robust weight functionals which ensures grid resolution in the singular region, as well as control of the maximal grid spacing in the outer region. Using this methodology, we introduce a semi-static adaptive grid method, which does not involve an iterative procedure for grid redistribution, as in the IGR method. We demonstrate the efficacy of this method with numerical examples of solutions which localize by more than nine orders of magnitude. 相似文献
2.
3.
The consistency principle for games in strategic form 总被引:1,自引:0,他引:1
We start with giving an axiomatic characterization of the Nash equilibrium (NE) correspondence in terms of consistency, converse consistency, and one-person rationality. Then axiomatizations are given of the strong NE correspondence, the coalition-proof NE correspondence and the semi-strong NE. In all these characterizations consistency and suitable variants of converse consistency play a role. Finally, the dominant NE correspondence is characterized. We also indicate how to generalize our results to Bayesian and extensive games. 相似文献
4.
The 0–1 integer programming problem and its special case, the 0–1 knapsack problem are frequently encountered in modeling various design and decision making processes. This paper is a follow-up paper to [4] and deals with the development of an effective solution procedure for 0–1 integer programs with few constraints. Detailed computational experiments are carried out and different separation, branching and bounding rules are compared using an experimental branch and bound code. An efficient branch and bound procedure is developed, tested and compared with previously developed optimal algorithms. It is suggested that this procedure may also be used as a heuristic method for large problems by early termination of the tree search. This scheme is tested and found to be very effective. 相似文献
5.
General quantum restrictions on the noise performance of linear transistor amplifiers are used to identify the region in parameter space where the quantum-limited performance is achievable and to construct a practical procedure for approaching it experimentally using only the knowledge of directly measurable quantities: the gain, (differential) conductance, and the output noise. A specific example of resonant barrier transistors is discussed. 相似文献
6.
Bezalel Peleg 《Israel Journal of Mathematics》1971,9(2):222-234
We consider an economy described by a setY of feasible consumption plans and a utility functionu.Y is assumed to be a convex and compact subset of s+, the non-negative cone of the spaces of all real sequences.u is assumed to be concave, increasing and continuous (in an appropriate sense) on the cone spanned byY. Our main result is that a point ofY is optimal iff it is competitive.
Prepared under NSF Grant 2530 to Stanford University. 相似文献
7.
We analyze the tour partitioning heuristics for the Capacitated Minimum Spanning Tree problem. Lower bounds for the worst-case performance ratios of these heuristics are obtained by using worst-case examples. We also generalize the heuristics to the multi-center case with the same worst-case bounds.The work of the first author was supported by a Dean Summer Research Grant from Owen Graduate School of Management, Vanderbilt University.Work done in part in the Department of Industrial Engineering and Operations Research at Columbia University.The work of the last two authors was supported in part by ONR contract N00014-90-J-1649, NSF contract DDM-8922712 and the Center for Telecommunications Research under NSF contract CDR 84-21402. 相似文献
8.
We develop a method to determine the topology of a network that interconnects a number of token rings using source routing bridges. The purpose is to compute a topology that provides low response delays for network users at a minimal cost of bridge installations. We formulate this network design problem as a mixed binary integer linear program. We develop effective heuristic algorithms. The algorithms exploit the topology and routing solutions of the linear programming relaxation in a sophisticated manner which we believe is new in the literature. The model incorporates performance issues, such as network stability, bridge overflow, back pressure effect and broadcast storm, that are specific to the underlying communication technology. By formally incorporating these performance issues, we tighten the model formulation and improve the quality of the LP bound considerably. Computational results are reported for problems with up to 20 token rings and 190 potential bridge locations. 相似文献
9.
We present a systematic study of singular vortex solutions of the critical and supercritical two-dimensional nonlinear Schrödinger equation. In particular, we study the critical power for collapse and the asymptotic blowup profile of singular vortices. 相似文献
10.
Jens Leth Hougaard Bezalel Peleg Lars Thorlund-Petersen 《International Journal of Game Theory》2001,30(2):147-165
This paper considers the set of Lorenz-maximal imputations in the core of a balanced cooperative game as a solution concept.
It is shown that the Lorenz-solution concept satisfies a number of suitable properties such as desirability, continuity and
the reduced game property. Moreover, the paper consideres alternative characterizations where it is shown that Lorenz-fairness
is tantamount to the existence of an additive, strictly increasing and concave social welfare function. Finally the paper
also provides axiomatic characterizations as well as two examples of application.
Received: February 1999/Final version: June 2001 相似文献