共查询到16条相似文献,搜索用时 62 毫秒
1.
基础R0-代数的性质及在L*系统中的应用 总被引:5,自引:1,他引:4
研究了王国俊教授建立的模糊命题演算的形式演绎系统L*和与之在语义上相关的R0-代数,提出了基础R0-代数的观点并讨论了其中的一些性质,在将L*系统中的推演证明转化为相应的R0-代数中的代数运算方面作了一些尝试,作为它的一个应用,证明了L*系统中的模糊演绎定理。 相似文献
2.
3.
4.
关于格上蕴涵代数及其对偶代数 总被引:2,自引:0,他引:2
给出了格蕴涵代数、MV代数、R0代数等一些格上蕴涵代数之间的关系,并建立了它们的对偶代数.其结果描述了这些代数内部结构的特征,同时也为从语义的角度进一步研究格值逻辑系统提供了一个新的途径. 相似文献
5.
本文定义了一个由范畴 RMRl到范畴A Grn0 的函子G,并证明了函子G保持分量正合及全正合,关于范畴AGGrn0 证明了定理: 相似文献
6.
命题公式集F(S)的基于R0-算子的16类分划 总被引:1,自引:0,他引:1
利用R0-蕴涵算子对命题公式集F(S)进行分类,得出了F(S)的一个16类分划,并证明了这种分类关于非运算是同余分类.最后讨论了各类关于MP运算与HS运算的封闭性. 相似文献
7.
本文主要利用分段连续的Lyapunov函数得到脉冲比较微分系统(2)的φ0-稳定性,并且通过比较方程,得到脉冲微分系统(1)的稳定性. 相似文献
8.
9.
10.
11.
The paper generalizes the Mangasarian–Ren (Ref. 1) error bounds forlinear complementarity problems (LCPs) to nonlinear complementarity problems(NCPs). This is done by extending the concept of R
0-matrixto several R
0-type functions, which include a subset ofmonotone functions as a special case. Both local and global error bounds areobtained for R
0-type NCPs and some monotone NCPs. 相似文献
12.
We introduce the notion of weak dually residuated lattice ordered semi-groups (WDRL-semigroups) and investigate the relation
between R
0-algebras and WDRL-semigroups. We prove that the category of R
0-algebras is equivalent to the category of some bounded WDRL-semigroups. Moreover, the connection between WDRL-semigroups
and DRL-semigroups is studied. 相似文献
13.
Wallace C. Pye 《Mathematical Programming》1992,57(1-3):439-444
This paper demonstrates that within the class of thosen × n real matrices, each of which has a negative determinant, nonnegative proper principal minors and inverse with at least one positive entry, the class ofQ-matrices coincides with the class of regular matrices. Each of these classes of matrices plays an important role in the theory of the linear complementarity problem. Lastly, analogous results are obtained for nonsingular matrices which possess only nonpositive principal minors. 相似文献
14.
This paper deals with the class of Q-tensors, that is, a Q-tensor is a real tensor A such that the tensor complementarity problem(q, A):finding an x ∈ R~n such that x ≥ 0, q+Ax~(m-1)≥ 0, and x~T(q+Ax~(m-1)) = 0,has a solution for each vector q ∈ R~n. Several subclasses of Q-tensors are given: P-tensors, R-tensors, strictly semi-positive tensors and semi-positive R_0-tensors. We prove that a nonnegative tensor is a Q-tensor if and only if all of its principal diagonal entries are positive, and so the equivalence of Q-tensor,R-tensors, strictly semi-positive tensors was showed if they are nonnegative tensors. We also show that a tensor is an R_0-tensor if and only if the tensor complementarity problem(0, A) has no non-zero vector solution, and a tensor is a R-tensor if and only if it is an R_0-tensor and the tensor complementarity problem(e, A) has no non-zero vector solution, where e =(1, 1 ···, 1)~T. 相似文献
15.
Stochastic Nonlinear Complementarity Problem and?Applications to?Traffic Equilibrium under?Uncertainty 总被引:1,自引:0,他引:1
The expected residual minimization (ERM) formulation for the stochastic nonlinear complementarity problem (SNCP) is studied
in this paper. We show that the involved function is a stochastic R
0 function if and only if the objective function in the ERM formulation is coercive under a mild assumption. Moreover, we model
the traffic equilibrium problem (TEP) under uncertainty as SNCP and show that the objective function in the ERM formulation
is a stochastic R
0 function. Numerical experiments show that the ERM-SNCP model for TEP under uncertainty has various desirable properties.
This work was partially supported by a Grant-in-Aid from the Japan Society for the Promotion of Science. The authors thank
Professor Guihua Lin for pointing out an error in Proposition 2.1 on an earlier version of this paper. The authors are also
grateful to the referees for their insightful comments. 相似文献
16.
Mariya Ishteva Lieven De Lathauwer P.-A. Absil Sabine Van Huffel 《Numerical Algorithms》2009,51(2):179-194
An increasing number of applications are based on the manipulation of higher-order tensors. In this paper, we derive a differential-geometric
Newton method for computing the best rank-(R
1, R
2, R
3) approximation of a third-order tensor. The generalization to tensors of order higher than three is straightforward. We illustrate
the fast quadratic convergence of the algorithm in a neighborhood of the solution and compare it with the known higher-order
orthogonal iteration (De Lathauwer et al., SIAM J Matrix Anal Appl 21(4):1324–1342, 2000). This kind of algorithms are useful for many problems.
This paper presents research results of the Belgian Network DYSCO (Dynamical Systems, Control, and Optimization), funded by
the Interuniversity Attraction Poles Programme, initiated by the Belgian State, Science Policy Office. The scientific responsibility
rests with its authors. Research supported by: (1) Research Council K.U.Leuven: GOA-Ambiorics, CoE EF/05/006 Optimization
in Engineering (OPTEC), (2) F.W.O.: (a) project G.0321.06, (b) Research Communities ICCoS, ANMMM and MLDM, (3) the Belgian
Federal Science Policy Office: IUAP P6/04 (DYSCO, “Dynamical systems, control and optimization”, 2007–2011), (4) EU: ERNSI.
M. Ishteva is supported by a K.U.Leuven doctoral scholarship (OE/06/25, OE/07/17, OE/08/007), L. De Lathauwer is supported
by “Impulsfinanciering Campus Kortrijk (2007–2012)(CIF1)” and STRT1/08/023. 相似文献