نتایج جستجو برای: l ordered q convergence

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

2010
Youssef Elfoutayeni Mohamed Khaladi

named interior points set of the LCP (M, q) must be nonempty. The aim of this paper is to show that the LCP (M, q) is completely equivalent to a convex quadratic programming problem (CQPP ) under linear constraints. To solve the second problem, we propose an iterative method of interior points which converge in polynomial time to the exact solution; this convergence requires at most o(n0,5L) it...

2002
Ján Jakubík

In this paper we investigate convergence structures on a generalized Boolean algebra and their relations to convergence structures on abelian lattice ordered groups.

Journal: :The Journal of Symbolic Logic 1975

2005
C. Dobrovolny J. Ruiz

We consider the semi-infinite q–state Potts model. We prove, for large q, the existence of a first order surface phase transition between the ordered phase and the the so-called “new low temperature phase” predicted in [27], in which the bulk is ordered whereas the surface is disordered.

Journal: :J. London Math. Society 2014
Francesco Di Plinio Andrei K. Lerner

We prove L(w) bounds for the Carleson operator C, its lacunary version Clac, and its analogue for the Walsh series W in terms of the Aq constants [w]Aq for 1 q p. In particular, we show that, exactly as for the Hilbert transform, ‖C‖Lp(w) is bounded linearly by [w]Aq for 1 q < p. We also obtain L(w) bounds in terms of [w]Ap , whose sharpness is related to certain conjectures (for instance, of K...

2011
Bruno de Malafosse Vladimir Rakočević

In this paper we extend some of our recent results given in [15], so we consider a matrix transformation A = (ank)n,k≥1 and say that a sequence X = (xn)n≥1 is A-statistically convergent to L ∈ V with respect to the intuitionistic fuzzy normed space (IFNS) V if lim n→∞ 1 n |{k ≤ n : ν ([AX]k − L, t) ≥ ε or 1− μ ([AX]k − L, t) ≥ ε}| = 0 for any ε > 0. The aim of this paper is to give conditions o...

In the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} ‎{underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$‎. ‎By this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎When the‎ ‎matrix equation is consistent over...

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

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