首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
A model for the dynamic, adhesive, frictionless contact between a viscoelastic body and a deformable foundation is described. The adhesion process is modeled by a bonding field on the contact surface. The contact is described by a modified normal compliance condition. The tangential shear due to the bonding field is included. The problem is formulated as a coupled system of a variational equality for the displacements and a differential equation for the bonding field. The existence of a unique weak solution for the problem is established, together with a partial regularity result. The existence proof proceeds by construction of an appropriate mapping which is shown to be a contraction on a Hilbert space.  相似文献   

2.
A problem of uniqueness for series over multiplicative systems of functions and for multiplicative transforms is considered. It is shown that each set of uniqueness for a multiplicative transform is specified by a countable collection of sets of uniqueness for series over the corresponding multiplicative system of functions. Each set of uniqueness for a series over a multiplicative system of functions is a portion on [0, 1) of some set of uniqueness for the corresponding multiplicative transform.  相似文献   

3.
A boundary value problem is considered for an equation of mixed type in a rectangle. An energy method is used to prove uniqueness for appropriate boundary conditions. Similar considerations for the adjoint problem allow one to prove the existence of a generalized solution to the problem. It is also shown that the energy method leads naturally to a finite element method. The method is described for a special case and convergence is shown for the resulting numerical procedure.  相似文献   

4.
研究了马氏环境中的可数马氏链,主要证明了过程于小柱集上的回返次数是渐近地服从Poisson分布。为此,引入熵函数h,首先给出了马氏环境中马氏链的Shannon-Mc Millan-Breiman定理,还给出了一个非马氏过程Posson逼近的例子。当环境过程退化为一常数序列时,便得到可数马氏链的Poisson极限定理。这是有限马氏链Pitskel相应结果的拓广。  相似文献   

5.
This paper studies relationships between coupled-expanding maps and one-sided symbolic dynamical systems. The concept of coupled-expanding map is extended to a more general one: coupled-expansion for a transitive matrix. It is found that the subshift for a transitive matrix is strictly coupled-expanding for the matrix in certain disjoint compact subsets; the topological conjugacy of a continuous map in its compact invariant set of a metric space to a subshift for a transitive matrix has a close relationship with that the map is strictly coupled-expanding for the matrix in some disjoint compact subsets. A certain relationship between strictly coupled-expanding maps for a transitive matrix in disjoint bounded and closed subsets of a complete metric space and their topological conjugacy to the subshift for the matrix is also obtained. Dynamical behaviors of subshifts for irreducible matrices are then studied and several equivalent statements to chaos are obtained; especially, chaos in the sense of Li–Yorke is equivalent to chaos in the sense of Devaney for the subshift, and is also equivalent to that the domain of the subshift is infinite. Based on these results, several new criteria of chaos for maps are finally established via strict coupled-expansions for irreducible transitive matrices in compact subsets of metric spaces and in bounded and closed subsets of complete metric spaces, respectively, where their conditions are weaker than those existing in the literature.  相似文献   

6.
A minimax terminal state estimation problem is posed for a linear plant and a generalized quadratic loss function. Sufficient conditions are developed to insure that a Kalman filter will provide a minimax estimate for the terminal state of the plant. It is further shown that this Kalman filter will not generally be a minimax estimate for the terminal state if the observation interval is arbitrarily long. Consequently, a subminimax estimate is defined, subject to a particular existence condition. This subminimax estimate is related to the Kalman filter, and it may provide a useful estimate for the terminal state when the performance of the Kalman filter is no longer satisfactory.  相似文献   

7.
讨论了二维非定常不可压Navier-Stokes方程的两重网格方法.此方法包括在粗网格上求解一个非线性问题,在细网格上求解一个Stokes问题.采用一种新的全离散(时间离散用Crank-Nicolson格式,空间离散用混合有限元方法)格式数值求解N-S方程.证明了该全离散格式的稳定性.给出了L2误差估计.对比标准有限元方法,在保持同样精度的前提下,TGM能节省大量的计算量.  相似文献   

8.
A matrix is sought that solves a given dual pair of systems of linear algebraic equations. Necessary and sufficient conditions for the existence of solutions to this problem are obtained, and the form of the solutions is found. The form of the solution with the minimal Euclidean norm is indicated. Conditions for this solution to be a rank one matrix are examined. On the basis of these results, an analysis is performed for the following two problems: modifying the coefficient matrix for a dual pair of linear programs (which can be improper) to ensure the existence of given solutions for these programs, and modifying the coefficient matrix for a dual pair of improper linear programs to minimize its Euclidean norm. Necessary and sufficient conditions for the solvability of the first problem are given, and the form of its solutions is described. For the second problem, a method for the reduction to a nonlinear constrained minimization problem is indicated, necessary conditions for the existence of solutions are found, and the form of solutions is described. Numerical results are presented.  相似文献   

9.
Hall's theorem for bipartite graphs gives a necessary and sufficientcondition for the existence of a matching in a given bipartitegraph. Aharoni and Ziv have generalized the notion of matchabilityto a pair of possibly infinite matroids on the same set andgiven a condition that is sufficient for the matchability ofa given pair (M, W) of finitary matroids, where the matroidM is SCF (a sum of countably many matroids of finite rank).The condition of Aharoni and Ziv is not necessary for matchability.The paper gives a condition that is necessary for the existenceof a matching for any pair of matroids (not necessarily finitary)and is sufficient for any pair (M, W) of finitary matroids,where the matroid M is SCF.  相似文献   

10.
Comprehensive results are provided for the creeping flow arounda spherical particle in a viscous fluid close to a plane wall,when the external velocity is parallel to the wall and variesas a second degree polynomial in the coordinates. By linearityof Stokes equations, the solution is a sum of flows for typicalunperturbed flows: a pure shear flow, a ‘modulated shearflow’, for which the rate of shear varies linearly inthe direction normal to the wall, and a quadratic flow. Solutionsconsidered here use the bipolar coordinates technique. Theycomplement the accurate results of Chaoui and Feuillebois (2003)for the pure shear flow. The solution of Goren and O'Neill (1971)for the quadratic flow is reconsidered and a new analyticalsolution is derived for the ambient modulated shear flow. Theperturbed flow fields for these two cases are presented in detailand discussed. Results for the force and torque friction factorsare provided with a 5 x 10–17 accuracy as a reference.For the quadratic flow, there is a force and a torque on a fixedsphere. A minimum value of the torque is found for a gap ofabout 0·18a, where a is the sphere radius. This minimumis interpreted in term of the corresponding flow structure.For the modulated shear flow, there is only a torque. The freemotion of a sphere in an ambient quadratic flow is also determined.  相似文献   

11.
Cocycles of general form on an arbitrary metric space are considered. The notion of determining modes for cocycles on a Hilbert space is introduced, and a theorem on the existence of finitely many determining modes for such cocycles is proved. The existence of a B-pullback attractor in the problem of microwave heating of a material is proved. The notion of almost periodic integral for a cocycle is introduced, and the existence of such an integral for a certain class of cocycles is proved.  相似文献   

12.
The paper is concerned with equipment which is being phased out because it is superseded by a technologically more advanced product. It nevertheless still requires efficient handling for the rest of its life span.An inventory lot size model without backlogs for a single commodity with a vanishing market is used. The vanishing market is represented by- a demand function that decreases with time and eventually reaches zero, implying that the planning horizon is finite and known. It is assumed that there is no lead time for replenishments. The problem is to devise an optimal management scheme for this inventory system, namely, to determine the number of replenishments and their schedule over the predicted survival time horizon of the product.The problem is completely solved for the class of demand functions which can be approximated to by positive powers of time. The solution is given in a nearly closed form and is proven to be unique.  相似文献   

13.
This report describes a methodology for obtaining optimal operating rules for the equipment influencing the climatic conditions inside a greenhouse. The optimization is based on an economic criterion which takes into account the expected income from the crops versus the cost of operating and maintaining the greenhouse.The optimal control function is characterized and the analytic conditions for optimality are derived. A numerical scheme for obtaining the desired control is described and a sensitivity analysis is then carried out. This analysis enables derivation of simple operating rules for a real greenhouse.  相似文献   

14.
Vehicle scheduling for a fixed time-table is easy to formulate and solve as a minimal-cost-flow problem. Normally, however, there is considerable flexibility in the time-table. We propose here a method for exploiting this flexibility in order to improve the vehicle scheduling.A given set of trips must be assigned to a fleet of identical vehicles, starting from a common garage. Each trip is characterized by initial stop, final stop, duration, earliest departure time, and latest departure time.The problem is to decide which vehicle should be assigned to each individual trip and when the trip should start, so that a generalized cost is minimized.The minimum-cost-flow problem is first solved for the ‘kernels’ of every trip in order to make clear when the critical time-periods occur and obtain a lower bound for the solution. The kernel is defined as a trip that starts at the latest possible departure time and finishes at the earliest possible arriving time.The departure time for each trip is then chosen, thereby increasing the chances of obtaining a good schedule. The minimum-cost-flow problem is then solved for this fixed time-table.Finally, the departure times for each vehicle are adjusted (blocked) so that each vehicle (and driver) is efficiently used. This method is used as an integral part of the Volvo Traffic Planning Package.  相似文献   

15.
A cellular-automata (CA) approach for investigating properties of porous media with tortuous channels and different smoothness of pore walls is proposed. This approach is aimed at combining two different CA models: the first one is intended for constructing the morphology of a porous material; the second, for simulating a fluid flow through it. The porous media morphology is obtained as a result of evolution of a cellular automaton, forming a “steady pattern.” The result is then used for simulating a fluid flow through a porous medium by applying the Lattice Gas CA model. The method has been tested on a small fragment of a porous material and implemented for investigating a carbon electrode of a hydrogen fuel cell on a multiprocessor cluster.  相似文献   

16.
A general non-axisymmetric Stokes flow past a porous sphere in a viscous, incompressible fluid is considered. The flow inside the sphere is governed by Brinkman's equations. A representation for velocity and pressure for the Brinkman's equations is suggested and a method of finding the flow quantities is given. Faxén's laws for drag and torque for the flow past a porous sphere are also given.  相似文献   

17.
Usually, a reliability function is defined by a failure rate which is a real function taking the non-negative real values. In this paper the failure rate is assumed to be a stochastic process with non-negative and right continuous trajectories. The reliability function is defined as an expectation of a function of that random process. Particularly, the failure rate defined by the semi-Markov processes is considered here. The theorems dealing with the renewal equations for the conditional reliability functions with a semi-Markov process as a failure rate are presented in this paper. A system of that kind of equations for the discrete state space semi-Markov process is applied for calculating the reliability function for the 3-states semi-Markov random walk. Using the introduced system of renewal equations for the countable state space, the reliability function for the Furry-Yule failure rate process is obtained.  相似文献   

18.
19.
A general approach is developed for integrating an invertible dynamical system defined by the composition of two involutions, i.e., a nonlinear one which is a standard Cremona transformation, and a linear one. By the Noether theorem, the integration of these systems is the foundation for integrating a broad class of Cremona dynamical systems. We obtain a functional equation for invariant homogeneous polynomials and sufficient conditions for the algebraic integrability of the systems under consideration. It is proved that Siegel's linearization theorem is applicable if the eigenvalues of the map at a fixed point are algebraic numbers.  相似文献   

20.
In this paper, a scalar game is derived from a zero-sum multicriteria matrix game, and it is proved that the solution of the new game with strictly positive scalarization is a necessary and sufficient condition for a strategy to be a Pareto-optimal security strategy (POSS) for one of the players in the original game. This is done by proving that a certain set, which is the extension of the set of security level vectors in the criterion function space, is convex and polyhedral. It is also established that only a finite number of scalarizations are necessary to obtain all the POSS for a player. An example is included to illustrate the main steps in the proof.This work was done while the author was a Research Associate in the Department of Electrical Engineering at the Indian Institute of Science and was financially supported by the Council of Scientific and Industrial Research, Delhi, India.The author wishes to express his gratefulness to Professor U. R. Prasad for helpful discussions and to two anonymous referees for suggestions which led to an improved presentation.  相似文献   

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

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