نتایج جستجو برای: generalized weak structure

تعداد نتایج: 1828542  

P. Yatakoat S. Suantai

In this paper, we introduce and study a new iterative scheme toapproximate a common xed point for a nite family of generalized asymptoticallyquasi-nonexpansive nonself-mappings in Banach spaces. Several strong and weakconvergence theorems of the proposed iteration are established. The main resultsobtained in this paper generalize and rene some known results in the currentliterature.

2013
Dehui Yuan Xiaoling Liu

In this paper, we give some new generalized convexities with the tool–right upper-Diniderivative which is an extension of directional derivative. Next, we establish not only Karush-KuhnTucker necessary but also sufficient optimality conditions for mathematical programming involving new generalized convex functions. In the end, weak, strong and converse duality results are proved to relate weak ...

Journal: :iranian journal of science and technology (sciences) 2005
b. najafi

the general relatively isotropic mean landsberg metrics contain the general relativelyisotropic landsberg metrics. a class of finsler metrics is given, in which the mentioned two conceptsare equivalent. in this paper, an interpretation of general relatively isotropic mean landsberg metrics isfound by using c-conformal transformations. some necessary conditions for a general relativelyisotropic ...

2005
Peter F. Stadler

The Discrete Nodal Domain Theorem states that an eigenfunction of the k-th largest eigenvalue of a generalized graph Laplacian has at most k (weak) nodal domains. We show that the number of strong nodal domains cannot exceed the size of a maximal induced bipartite subgraph and that this bound is sharp for generalized graph Laplacians. Similarly, the number of weak nodal domains is bounded by th...

2018
Calvin Loncaric Paul G. Allen Michael D. Ernst Emina Torlak

Data structure synthesis is the task of generating data structure implementations from high-level specifications. Recent work in this area has shown potential to save programmer time and reduce the risk of defects. Existing techniques focus on data structures for manipulating subsets of a single collection, but real-world programs often track multiple related collections and aggregate propertie...

Journal: :Joho Chishiki Gakkaishi 2010

2004
Shouchuan Zhang Yao-Zhong Zhang

It is shown that an algebra Λ can be lifted with nilpotent Jacobson radical r = r(Λ) and has a generalized matrix unit {eii}I with each ēii in the center of Λ̄ = Λ/r iff Λ is isomorphic to a generalized path algebra with weak relations. Representations of the generalized path algebras are given. As a corollary, Λ is a finite algebra with non-zero unity element over perfect field k (e.g. a field ...

Journal: :Časopis pro pěstování matematiky 1982

Journal: :Advances in Mathematics 2002

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید