Fuzzy蕴涵代数与有界BCK—代数等价

在[1]中作者给出了下面的定义. 定义1 一个(2,0)型代数(X,→,0)称为FI代数,如果(?) x,y,z∈X,有 (I_1) x→(y→z)=y→(x→z), (I_2) (x→y)→[(y→z)→(x→2)]=1, (I_3) (x→z)=1, (I_4) 若x→y=y→x=1,则x=y, (I_5) 0→x=1,其中 1=0→0. 在[2]中Iseki K引入了BCK-代数,参见[3,4]. 定义2 一个(2,0)型代数(X;*,0)称为BCK-代数,如果(?) x,y,z∈X,有 (Ⅰ) ((x*y)*(x*z))*(z*y)=0, (Ⅱ) (x*(x*y))*y=0, (Ⅲ) x*x=0.     

有相同击中分布的可列马尔可夫过程

文献[2]对满足文献[1]条件(A)的Hunt过程,证明了如下的定理: 设x(t)和x~*(t)是两个Hunt过程,则它们有相同的击中分布的充分必要条件是:存在一个连续的随机时间替换z(t),使得x(z(t))和x~*(t)有相同的转移函数。 本文对有保守Q矩阵的可列状态的马尔可夫过程(一般说,它们是非Hunt过程),     

求解奇异摄动转向点问题的高精度方法

1.引言 本文考察以下奇异摄动转向点问题: Lu≡ε~2u″+xa(x)u′-b(x)u=f(x),x∈I=[-1,1], u(-1)=A,u(1)=B, (1.1)其中参数ε是(0,1]中的常数,函数a(x)∈C~3[I],b(x),f(x)∈C~4[I]且满足a(x)≥a_*>0,b(x)≥b_*>0.在以上假设下,由[1]知,方程(1.1)存在唯一解u_8∈C~5[I]且     

机械工业部机械研究院1985年攻读硕士学位研究生入学试题高等数学(A)

<正> 三、(10分)求曲面az=x~2+y~2(a>0)与曲面z=(x~2+y~2)~(1/2)所围成的均匀物体的重心坐标。四、(10分)设f(x)在[-1,1]上有界,g(x)=f(x)sinx~2,求g’(0),并写出主要步骤的根据。     

ON THE EQUIVALENCE PRINCIPLE FOR CONTRACTIVE MAPPINGS

The main result is:Theorem 1.Let T be a continuous selfmapping of a complete metric space(X,d)andhave the unique fixed point property.If there exists n:X→N(the set of all positive integers)which is locally bounded such that for each x∈X and for all r∈N,r≥n(x),D(O_T(T~(n(x))x,0,r))≤(?)(D(O_T(x,0,r))),orD(O_T(T~(n(x))x,0,r))≤(?)(D(O_T(x,0,r))),where(?),and(?)are contractive gauge functions,then(a)T has a unique fixed point x~*;(b)For each x∈X,T~nx→x~* as n→∞;(e)There exists a neighborhood U(x~*)of x~* such that(?)T~n(U(x~*))={x~*};(d)x~*is stable;(e)For any given C∈(0,1)there exists a metric d~* topologically equivalent to d suchthat T is a Banach contraction under d~* with Lipschitz constant C.By Theorem 1 it is shown that many contractive type mappings defined in[1—26]aretopologically equivalent to each other.     

关于一类三阶非线性系统的全局渐近稳定性

本文考虑三阶非线性系统 x=y-h(x),y=φ(z)-g(x),z=-f(x) (1) 这里g(x)为连续函数,h(x),φ(z),f(x)为连续可微函数。我们改进文[4]中的结果,证明了如下的结论:     

求解奇异摄动转向点问题的一个高阶格式

§1.引言本文考虑以下奇异摄转向点问题: (1.1)这里参数ε是(0,1]中常数,函数α(x)∈C~2[I],b(x),f(x)∈C~3[I],且满足α(x)≥α_*>0,b(x)≥b_*>0,在以上假设下,由[2]可知,方程(1.1)存在唯一解u_ε∈C~4[I],且满足以下不等式     

读“一个分式不等式的再推广”后的思考

宋庆在文[1]中对文[2,3,4]的一个不等式作再推广如下: 如x,y,z,n∈R ,m≥2,x y z=1,则 xm/y(1-yn), ym/z(1-zn) zm/x(1-xn).≥y(1-yn), y/z(1-zn) zm/x(1-xn).≥3n-m 2/3n-1 (1)     

含爆轰波的间断解的渐近性

<正> 在[1]中我们研究了如下的初值问题:/t(u+qz)+/zf(u)=υ ~2u/x~2,(1)z/t=-kφ(u)z,(2)u(x,0)=u_0(x),z(x,0)=z_0(x)(3)当υ=+0,K=+∞时的弱解.其中常数q>0,υ,K,q分别代表了粘性系数、化学反应速率和束缚能,u是一个综合变量,它代表了密度、速度和温度,z是未燃气体的     

基于模糊蕴涵的分配性方程

研究函数方程组I(x,T(y,z))=T(I(x,y),I(x,z)),I(x,y)=I(N(y),N(x))的解,其中T:[0,1]2→[0,1]是一个严格三角模,I:[0,1]2→[0,1]是一个模糊蕴涵算子和N:[0,1]→[0,1]是一个强否定.在I除了在点(0,0),(1,1)不连续的假设下,获得了满足这个函数方程组解的完全刻画.     

A Survey of Quasi-Newton Equations and Quasi-Newton Methods for Optimization

Quasi-Newton equations play a central role in quasi-Newton methods for optimization and various quasi-Newton equations are available. This paper gives a survey on these quasi-Newton equations and studies properties of quasi-Newton methods with updates satisfying different quasi-Newton equations. These include single-step quasi-Newton equations that use only gradient information and that use both gradient and function value information in one step, and multi-step quasi-Newton equations that use the gradient information in last m steps. Main properties of quasi-Newton methods with updates satisfying different quasi-Newton equations are studied. These properties include the finite termination property, invariance, heredity of positive definite updates, consistency of search directions, global convergence and local superlinear convergence properties.     

Partitioned quasi-Newton methods for nonlinear equality constrained optimization

We derive new quasi-Newton updates for the (nonlinear) equality constrained minimization problem. The new updates satisfy a quasi-Newton equation, maintain positive definiteness on the null space of the active constraint matrix, and satisfy a minimum change condition. The application of the updates is not restricted to a small neighbourhood of the solution. In addition to derivation and motivational remarks, we discuss various numerical subtleties and provide results of numerical experiments.Research partially supported by the Applied Mathematical Sciences Research Program (KC-04-02) of the Office of Energy Research of the US Department of Energy under grant DE-FG02-86ER25013.A000, and by the US Army Research Office through the Mathematical Sciences Institute, Cornell University.     

On the Use of Restricted Pseudo-inverses for the Unified Derivation of Quasi-Newton Updates

A new approach for deriving minimum norm quasi-Newton updatesis given. We use restricted pseudo-inverses of a single linearoperator to derive all known useful minimum norm updates, includingthose preserving sparsity and symmetry. This approach is direct,and unifies the theory of minimum norm quasi-Newton updates.We also prove a generalization of a theorem of Dennis &Schnabel using this approach.     

Adjoint-based quasi-Newton methods for partially separable problems

In this paper the concepts of partitioned quasi-Newton methods are applied to adjoint Broyden updates. Consequently a corresponding partitioned adjoint Broyden update is presented and local convergence results are given. Numerical results compare the partitioned adjoint Broyden update methods to the corresponding unpartitioned quasi-Newton method and to Newton's method for nonlinear equations. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Symmetric minimum-norm updates for use in gibbs free energy calculations

This paper examines a type of symmetric quasi-Newton update for use in nonlinear optimization algorithms. The updates presented here impose additional properties on the Hessian approximations that do not result if the usual quasi-Newton updating schemes are applied to certain Gibbs free energy minimization problems. The updates derived in this paper are symmetric matrices that satisfy a given matrix equation and are least squares solutions to the secant equation. A general representation for this class of updates is given. The update in this class that has the minimum weighted Frobenius norm is also presented. This work was done at Sandia National Laboratories and supported by the US Dept. of Energy under contract no. DE-AC04-76DP00789.     

Family of optimally conditioned quasi-Newton updates for unconstrained optimization

In this note, a general optimal conditioning problem for updates which satisfy the quasi-Newton equation is solved. The new solution is a family of updates which contains other known optimally conditioned updates but also includes new formulas of increased rank. A new factorization formula for the Broyden family and some preliminary numerical results are also given.     

Local and superlinear convergence of quasi-Newton methods based on modified secant conditions

For solving unconstrained minimization problems, quasi-Newton methods are popular iterative methods. The secant condition which employs only the gradient information is imposed on these methods. Several researchers paid attention to other secant conditions to get a better approximation of the Hessian matrix of the objective function. Recently, Zhang et al. [New quasi-Newton equation and related methods for unconstrained optimization, J. Optim. Theory Appl. 102 (1999) 147–167] and Zhang and Xu [Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations, J. Comput. Appl. Math. 137 (2001) 269–278] proposed the modified secant condition which uses both gradient and function value information in order to get a higher order accuracy in approximating the second curvature of the objective function. They showed the local and q-superlinear convergence property of the BFGS-like and DFP-like updates based on their proposed secant condition. In this paper, we incorporate one parameter into this secant condition to smoothly switch the standard secant condition and the secant condition of Zhang et al. We consider a modified Broyden family which includes the BFGS-like and the DFP-like updates proposed by Zhang et al. We prove the local and q-superlinear convergence of our method.     

A note about sparsity exploiting quasi-Newton updates

This paper is concerned with two questions relating to quasi-Newton updates for unconstrained optimization that exploit any sparsity present in the second derivative matrix of the objective function. First, a family of such updates is derived, that reduces to any a priori known dense update formula when no sparsity is imposed. This family uses the Frobenius projection of the desired update on the subspace of matrices that satisfy all the needed conditions. In the second part, we prove that, under mild assumptions, a positive definite sparse quasi-Newton update always exists. The proof of this result includes the explicit determination of such an update.     

Improved Hessian approximation with modified secant equations for symmetric rank-one method

Symmetric rank-one (SR1) is one of the competitive formulas among the quasi-Newton (QN) methods. In this paper, we propose some modified SR1 updates based on the modified secant equations, which use both gradient and function information. Furthermore, to avoid the loss of positive definiteness and zero denominators of the new SR1 updates, we apply a restart procedure to this update. Three new algorithms are given to improve the Hessian approximation with modified secant equations for the SR1 method. Numerical results show that the proposed algorithms are very encouraging and the advantage of the proposed algorithms over the standard SR1 and BFGS updates is clearly observed.     

A combined class of self-scaling and modified quasi-Newton methods

Techniques for obtaining safely positive definite Hessian approximations with self-scaling and modified quasi-Newton updates are combined to obtain ??better?? curvature approximations in line search methods for unconstrained optimization. It is shown that this class of methods, like the BFGS method, has the global and superlinear convergence for convex functions. Numerical experiments with this class, using the well-known quasi-Newton BFGS, DFP and a modified SR1 updates, are presented to illustrate some advantages of the new techniques. These experiments show that the performance of several combined methods are substantially better than that of the standard BFGS method. Similar improvements are also obtained if the simple sufficient function reduction condition on the steplength is used instead of the strong Wolfe conditions.