The Balancing Domain Decomposition algorithm uses in each iteration solution of local problems on the subdomains coupled with a coarse problem that is used to propagate the error globally and to guarantee that the possibly singular local problems are consistent. The abstract theory introduced recently by the first-named author is used to develop condition number bounds for conforming linear elements in two and three dimensions. The bounds are independent of arbitrary coefficient jumps between subdomains and of the number of subdomains, and grow only as the squared logarithm of the mesh size . Computational experiments for two- and three-dimensional problems confirm the theory.
An expansion of finite plasma clots into the background neutral gas is studied numerically. The presented model includes the quasineutrality violation as well as the interpenetration of plasma and neutral gas at the boundary of the plasma. We estimate the region of plasma parameters where the model is correct. Space distributions of main plasma parameters, cooling of electrons and the process of inter-penetration of the plasma and the neutral gas are analysed as well as an empiric formula for electron temperature is found. Finally, it is shown that the most intensive plasma-gas inter-penetration occurs in the case where the initial plasma and gas densities are the same. 相似文献
We study a problem of scheduling deteriorating jobs, i.e. jobs whose processing times are an increasing function of their starting times. We consider the case of a single machine and linear job-independent deterioration. The objective is to minimize the sum of weighted completion times, with weights proportional to the basic processing times. The optimal schedule is shown to be Λ-shaped, i.e. the sequence of the basic processing times has a single local maximum. Moreover, we show that the problem is solved in O(N log N) time. In the last section we test heuristics for the case of general weights. 相似文献
A (right -) module is said to be a Whitehead test module for projectivity (shortly: a p-test module) provided for each module , implies is projective. Dually, i-test modules are defined. For example, is a p-test abelian group iff each Whitehead group is free. Our first main result says that if is a right hereditary non-right perfect ring, then the existence of p-test modules is independent of ZFC + GCH. On the other hand, for any ring , there is a proper class of i-test modules. Dually, there is a proper class of p-test modules over any right perfect ring.
A non-semisimple ring is said to be fully saturated (-saturated) provided that all non-projective (-generated non-projective) modules are i-test. We show that classification of saturated rings can be reduced to the indecomposable ones. Indecomposable 1-saturated rings fall into two classes: type I, where all simple modules are isomorphic, and type II, the others. Our second main result gives a complete characterization of rings of type II as certain generalized upper triangular matrix rings, . The four parameters involved here are skew-fields and , and natural numbers . For rings of type I, we have several partial results: e.g. using a generalization of Bongartz Lemma, we show that it is consistent that each fully saturated ring of type I is a full matrix ring over a local quasi-Frobenius ring. In several recent papers, our results have been applied to Tilting Theory and to the Theory of -modules.
This paper deals with approximate analysis methods for open queueing networks. External and internal flows from and to the nodes are characterized by renewal processes with discrete time distributions of their interarrival times. Stationary distributions of the waiting time, the queue size and the interdeparture times are obtained using efficient discrete time algorithms for single server (GI/G/1) and multi-server (GI/D/c) nodes with deterministic service. The network analysis is extended to semi-Markovian representations of each flow among the nodes, which include parameters of the autocorrelation function. 相似文献
The paper presents an application oriented procedure for solving the project management duration/resource tradeoff problem. A procedure is presented for reducing a project from a normal to a crash duration state at a minimum amount of additional resource expenditure assuming a linear utilization functions. The procedure is network based using a graphical Cut Search Approach to locate the minimal resource level at each reduction in total project duration. Activity-on-arc networks and flow networks are utilized. The paper is presented for practical application and for conceptual development as compared to a theoretical treatment. 相似文献
The acid-catalyzed and water-catalyzed solvolysis ofbenzoylphenyldiazomethane (1) have been studied in water and in t-butanol-water mixtures, the mole fraction of water (nH2O) being varied from 0·75-1·00. Increasing t-butanol concentrations produce a pronounced decrease in both kH⊕ and kH2O. In the “water reaction” mutually compensatory changes of AH and AS are associated with the rate variations, with minima in AH and AS at about nH2O = 0·95. In addition it was found that the magnitude of the salt effect of (n-Bu)4NCl on the rate of hydrolysis of 1 in water at 25° is much larger than that of LiCl, NaCl and NaBr. Assuming that the rate of the “water reaction” is largely determined by water acidity, the data are suggestive for the existence of a relation between water acidity and solvent structural integrity in highly aqueous t-butanol-water solutions. 相似文献
The cosmic numbers are considered, with emphasis on the relationN2. (HereN is the number of nucleons in the universe, and, its radius in atomic units.) This relation is interpreted in terms of a quantum mechanical model. 相似文献
