首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 78 毫秒
1.
We consider a differential system based on the coupling of the Navier–Stokes and Darcy equations for modeling the interaction between surface and porous-media flows. We formulate the problem as an interface equation, we analyze the associated (nonlinear) Steklov–Poincaré operators, and we prove its well-posedness. We propose and analyze iterative methods to solve a conforming finite element approximation of the coupled problem.  相似文献   

2.
We consider a model of a multipath routing system where arriving customers are routed to a set of identical, parallel, single server queues according to balancing policies operating without state information. After completion of service, customers are required to leave the system in their order of arrival, thus incurring an additional resequencing delay. We are interested in minimizing the end-to-end delay (including time at the resequencing buffer) experienced by arriving customers. To that end we establish the optimality of the Round–Robin routing assignment in two asymptotic regimes, namely heavy and light traffic: In heavy traffic, the Round–Robin customer assignment is shown to achieve the smallest (in the increasing convex stochastic ordering) end-to-end delay amongst all routing policies operating without queue state information. In light traffic, and for the special case of Poisson arrivals, we show that Round–Robin is again an optimal (in the strong stochastic ordering) routing policy. We illustrate the stochastic comparison results by several simulation examples. The work of the first author was supported through an ARCHIMEDES grant by the Greek Ministry of Education. The work of the second author was prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U.S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government.  相似文献   

3.
Many physical and scientific phenomena are modeled by nonlinear partial differential equations (NPDEs); it is difficult to handle nonlinear part of these equations. Recently some analytical methods are applied to solve such equations. In this work, modified Camassa–Holm and Degasperis–Procesi equation is studied. Adomian’s decomposition method (ADM) is applied to obtain solution of this equation. The results are compared to those of homotopy perturbation method (HPM) and exact solution. The study highlights the significant features of the employed method and its ability to handle nonlinear partial differential equations.  相似文献   

4.
In this paper, a classification of Riemann–Cartan manifolds based on the orthogonal decomposition of the torsion tensor is given. Problems on the existence of two classes ℘1 ⨁ ℘2 and ℘3 of Riemann–Cartan spaces are discussed.  相似文献   

5.
In order to take advantage of the attractive features of Polak–Ribière–Polyak and Fletcher–Reeves conjugate gradient methods, two hybridizations of these methods are suggested, using a quadratic relaxation of a hybrid conjugate gradient parameter proposed by Gilbert and Nocedal. In the suggested methods, the hybridization parameter is computed based on a conjugacy condition. Under proper conditions, it is shown that the proposed methods are globally convergent for general objective functions. Numerical results are reported; they demonstrate the efficiency of one of the proposed methods in the sense of the performance profile introduced by Dolan and Moré.  相似文献   

6.
The aim of this paper is to define the Besov–Morrey spaces and the Triebel– Lizorkin–Morrey spaces and to present a decomposition of functions belonging to these spaces. Our results contain an answer to the conjecture proposed by Mazzucato. The first author is supported by Research Fellowships of the Japan Society for the Promotion of Science for Young Scientists. The second author is supported by Fūjyukai foundation and the 21st century COE program at Graduate School of Mathematical Sciences, the University of Tokyo.  相似文献   

7.
Two nonoverlapping domain decomposition algorithms are proposed for convection dominated convection–diffusion problems. In each subdomain, artificial boundary conditions are used on the inflow and outflow boundaries. If the flow is simple, each subdomain problem only needs to be solved once. If there are closed streamlines, an iterative algorithm is needed and the convergence is proved. Analysis and numerical tests reveal that the methods are advantageous when the diffusion parameter ɛ is small. In such cases, the error introduced by the domain decomposition methods is negligible in comparison with the error in the singular layers, and it allows easy and efficient grid refinement in the singular layers. This revised version was published online in August 2006 with corrections to the Cover Date.  相似文献   

8.
We prove that every Ariki–Koike algebra is Morita equivalent to a direct sum of tensor products of smaller Ariki–Koike algebras which have q–connected parameter sets. A similar result is proved for the cyclotomic q–Schur algebras. Combining our results with work of Ariki and Uglov, the decomposition numbers for the Ariki–Koike algebras defined over fields of characteristic zero are now known in principle. Received: 22 March 2000; in final form: 19 September 2001 / Published online: 29 April 2002  相似文献   

9.
The problem of deleting a row from a Q–R factorization (called downdating) using Gram–Schmidt orthogonalization is intimately connected to using classical iterative methods to solve a least squares problem with the orthogonal factor as the coefficient matrix. Past approaches to downdating have focused upon accurate computation of the residual of that least squares problem, then finding a unit vector in the direction of the residual that becomes a new column for the orthogonal factor. It is also important to compute the solution vector of the related least squares problem accurately, as that vector must be used in the downdating process to maintain good backward error in the new factorization. Using this observation, new algorithms are proposed. One of the new algorithms proposed is a modification of one due to Yoo and Park [BIT, 36:161–181, 1996]. That algorithm is shown to be a Gram–Schmidt procedure. Also presented are new results that bound the loss of orthogonality after downdating. An error analysis shows that the proposed algorithms’ behavior in floating point arithmetic is close to their behavior in exact arithmetic. Experiments show that the changes proposed in this paper can have a dramatic impact upon the accuracy of the downdated Q–R decomposition. AMS subject classification (2000) 65F20, 65F25  相似文献   

10.
The weak approximation of the solution of a system of Stratonovich stochastic differential equations with a m–dimensional Wiener process is studied. Therefore, a new class of stochastic Runge–Kutta methods is introduced. As the main novelty, the number of stages does not depend on the dimension m of the driving Wiener process which reduces the computational effort significantly. The colored rooted tree analysis due to the author is applied to determine order conditions for the new stochastic Runge–Kutta methods assuring convergence with order two in the weak sense. Further, some coefficients for second order stochastic Runge–Kutta schemes are calculated explicitly. AMS subject classification (2000)  65C30, 65L06, 60H35, 60H10  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号