首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
This paper obtains the 1-soliton solution of three variants of the generalized KdV equation with generalized evolution. The solitary wave ansatz is used to carry out the integration of such equation. The parameter domain is also identified in the process. A couple of conserved quantities are also calculated for each of these variants. The numerical simulations are also carried out.  相似文献   

2.
This paper deals with nonnegative nonsmooth generalized complementarity problem, denoted by GCP(f,g). Starting with H-differentiable functions f and g, we describe H-differentials of some GCP functions and their merit functions. We show how, under appropriate conditions on H-differentials of f and g, minimizing a merit function corresponding to f and g leads to a solution of the generalized complementarity problem. Moreover, we generalize the concepts of monotonicity, P 0-property and their variants for functions and use them to establish some conditions to get a solution for generalized complementarity problem. Our results are generalizations of such results for nonlinear complementarity problem when the underlying functions are C 1, semismooth, and locally Lipschitzian.  相似文献   

3.
This paper presents an application of parallel computing techniques to the solution of an important class of planning problems known as generalized networks. Three parallel primal simplex variants for solving generalized network problems are presented. Data structures used in a sequential generalized network code are briefly discussed and their extension to a parallel implementation of one of the primal simplex variants is given. Computational testing of the sequential and parallel codes, both written in Fortran, was done on the CRYSTAL multicomputer at the University of Wisconsin, and the computational results are presented. Maximum efficiency occurred for multiperiod generalized network problems where a speedup approximately linear in the number of processors was achieved.This research was supported in part by NSF grants DCR-8503148 and CCR-8709952 and by AFOSR grant AFOSR-86-0194.  相似文献   

4.
This paper presents a two-step approach to determine the optimal platform level for a selected set of product families and their variants. The first step employs a multi-objective optimization using an agent-based framework to determine the Pareto-design solutions for a given set of modules. The second step performs a post optimization analysis that includes application of the quality loss function (QLF) to determine the optimal platform level. The post optimization analysis yields the optimal platform level for a related set of product families and their variants. We demonstrate the working of the proposed method by using an example problem.  相似文献   

5.
本引进了一种广义严格拟凸函数的定义,给出了它的一个刻画,证明 了局部极小值点为整体极小值点的函数与本定义的广义严格拟凸函数的等价性。  相似文献   

6.
Necessary optimality conditions for bilevel set optimization problems   总被引:1,自引:0,他引:1  
Bilevel programming problems are hierarchical optimization problems where in the upper level problem a function is minimized subject to the graph of the solution set mapping of the lower level problem. In this paper necessary optimality conditions for such problems are derived using the notion of a convexificator by Luc and Jeyakumar. Convexificators are subsets of many other generalized derivatives. Hence, our optimality conditions are stronger than those using e.g., the generalized derivative due to Clarke or Michel-Penot. Using a certain regularity condition Karush-Kuhn-Tucker conditions are obtained.   相似文献   

7.
We present a model of computation for string functions over single-sorted, total algebraic structures and study some basic features of a general theory of computability within this framework. Our concept generalizes the Blum-Shub-Smale setting of computability over the reals and other rings. By dealing with strings of arbitrary length instead of tuples of fixed length, some suppositions of deeper results within former approaches to generalized recursion theory become superfluous. Moreover, this gives the basis for introducing computational complexity in a BSS-like manner. Relationships both to classical computability and to Friedman's concept of eds computability are established. Two kinds of nondeterminism as well as several variants of recognizability are investigated with respect to interdependencies on each other and on properties of the underlying structures. For structures of finite signatures, there are universal programs with the usual characteristics. For the general case of not necessarily finite signature, this subject will be studied in a separate, forthcoming paper.  相似文献   

8.
This paper obtains the 1-soliton solution of three variants of the generalized KP equation with generalized evolution. The solitary wave ansatz is used to carry out the integration of such equations. The parameter domain is also identified in the process. The numerical simulations are also obtained in this paper.  相似文献   

9.
The paper presents new characterizations of the integer‐valued moving average model. For four model variants, we give moments and probability generating functions. Yule–Walker and conditional least‐squares estimators are obtained and studied by Monte Carlo simulation. A new generalized method of moment estimator based on probability generating functions is presented and shown to be consistent and asymptotically normal. The small sample performance is in some instances better than those of alternative estimators. Copyright © 2001 John Wiley & Sons, Ltd.  相似文献   

10.
In this paper, a risk model where claims arrive according to a Markovian arrival process (MAP) is considered. A generalization of the well-known Gerber-Shiu function is proposed by incorporating the maximum surplus level before ruin into the penalty function. For this wider class of penalty functions, we show that the generalized Gerber-Shiu function can be expressed in terms of the original Gerber-Shiu function (see e.g. [Gerber, Hans U., Shiu, Elias, S.W., 1998. On the time value of ruin. North American Actuarial Journal 2(1), 48-72]) and the Laplace transform of a first passage time which are both readily available. The generalized Gerber-Shiu function is also shown to be closely related to the original Gerber-Shiu function in the same MAP risk model subject to a dividend barrier strategy. The simplest case of a MAP risk model, namely the classical compound Poisson risk model, will be studied in more detail. In particular, the discounted joint density of the surplus prior to ruin, the deficit at ruin and the maximum surplus before ruin is obtained through analytic Laplace transform inversion of a specific generalized Gerber-Shiu function. Numerical illustrations are then examined.  相似文献   

11.
This paper considers the solution of generalized fractional programming (GFP) problem which contains various variants such as a sum or product of a finite number of ratios of linear functions, polynomial fractional programming, generalized geometric programming, etc. over a polytope. For such problems, we present an efficient unified method. In this method, by utilizing a transformation and a two-part linearization method, a sequence of linear programming relaxations of the initial nonconvex programming problem are derived which are embedded in a branch-and-bound algorithm. Numerical results are given to show the feasibility and effectiveness of the proposed algorithm.  相似文献   

12.
Continuing the paper [7], in which the Blum-Shub-Smale approach to computability over the reals has been generalized to arbitrary algebraic structures, this paper deals with computability and recognizability over structures of infinite signature. It begins with discussing related properties of the linear and scalar real structures and of their discrete counterparts over the natural numbers. Then the existence of universal functions is shown to be equivalent to the effective encodability of the underlying structure. Such structures even have universal functions satisfying the s-m-n theorem and related features. The real and discrete examples are discussed with respect to effective encodability. Megiddo structures and computational extensions of effectively encodable structures are encodable, too. As further variants of universality, universal functions with enumerable sets of program codes and such ones with constructible codes are investigated. Finally, the existence of m-complete sets is shown to be independent of the effective encodability of structures, and the linear and scalar structures are discussed once more, under this aspect.  相似文献   

13.
1.IntroductionConsidersmoothcompositionsofmax-typefunctionsoftheform:f(x)=g(x,aestfij(x),'',,T?:fmj(x)),(1.1)wherexER",Ji,i~1,'',marefiniteindexsets,gandfij,jEJi,i=1,'',marecontinuouslydifferentiableonRill 71andR;'respectively.Thisclassofnonsmoothfunct…  相似文献   

14.
In this paper, we analyze the relation between some classes of matrices with variants of the diagonal dominance property. We establish a sufficient condition for a generalized doubly diagonally dominant matrix to be invertible. Sufficient conditions for a matrix to be strictly generalized diagonally dominant are also presented. We provide a sufficient condition for the invertibility of a cyclically diagonally dominant matrix. These sufficient conditions do not assume the irreducibility of the matrix.  相似文献   

15.
Two variants of the essential approximate point spectrum are discussed. We find for example that if one of them coincides with the left Drazin spectrum then the generalized a-Weyl's theorem holds, and conversely for a-isoloid operators. We also study the generalized a-Weyl's theorem for Class A operators.  相似文献   

16.
For the nonstationary quasilinear system one proves theorems of (local) existence and uniqueness of the generalized solution with a finite energy integral ; different variants of regularizing systems are constructed for which the generalized solution with a finite energy integral exists globally.  相似文献   

17.

A generalization of the Cauchy-Riemann condition in complex analysis is described for complex numbers, quaternions and complex quaternions. The generalization called here generalized Cauchy-Riemann-Fueter analycity encompasses not just the left and right-handed versions of quaternion analysis but also generates other variants for complex quaternions. These multiple variants are shown to satisfy an analogue of Cauchy's Theorem and to have similarities with the generalized Cauchy-Riemann conditions that define monogenic functions on R n + 1; they are also similar to Fueter-type operators and the Moisil-Theodoresco operator. The multiple variants are shown to have an interpretation that unifies analycity into a single definition. Thus left and right-handedness in quaternions are shown to be two sides of the same concept, and likewise for complex quaternions. This is then shown to have possible physical interpretation for example in understanding the nature of chirality and the 'arrow of time'.  相似文献   

18.
In the present paper, we introduce and study a new proximal normal cone in reflexive Banach spaces in terms of a generalized projection operator. Two new variants of generalized proximal subdifferentials are also introduced in reflexive smooth Banach spaces. The density theorem for both proximal subdifferentials has been proved in p-uniformly convex and q-uniformly smooth Banach spaces. Various important properties and applications of our concepts are also proved.  相似文献   

19.
In 1973, Shimura (Ann. Math. (2) 97:440–481, 1973) introduced a family of correspondences between modular forms of half-integral weight and modular forms of even integral weight. Earlier, in unpublished work, Selberg explicitly computed a simple case of this correspondence pertaining to those half-integral weight forms which are products of Jacobi’s theta function and level one Hecke eigenforms. Cipra (J. Number Theory 32(1):58–64, 1989) generalized Selberg’s work to cover the Shimura lifts where the Jacobi theta function may be replaced by theta functions attached to Dirichlet characters of prime power modulus, and where the level one Hecke eigenforms are replaced by more generic newforms. Here we generalize Cipra’s results further to cover theta functions of arbitrary Dirichlet characters multiplied by Hecke eigenforms.   相似文献   

20.
We give two generalizations of the induced dimension reduction (IDR) approach for the solution of linear systems. We derive a flexible and a multi‐shift quasi‐minimal residual IDR variant. These variants are based on a generalized Hessenberg decomposition. We present a new, more stable way to compute basis vectors in IDR. Numerical examples are presented to show the effectiveness of these new IDR variants and the new basis compared with existing ones and to other Krylov subspace methods. Copyright © 2014 John Wiley & Sons, Ltd.  相似文献   

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

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