... weakly continuous duality mapping The iterativemethodsfor nonexpansive mappings have recently been applied to solve convex minimization problems; see, for example, 12–14 and the references ... Let U {x ∈ E : x E is said to uniformly convex if, for any ∈ 0, , there exists δ > such that, for any x, y ∈ U, x − y ≥ implies x y /2 ≤ − δ It is known that a uniformly convex Banach space is reflexive ... to be smooth if the limit limt → x ty − x /t exists for all x, y ∈ U It is also said to be uniformly smooth if the limit is attained uniformly for x, y ∈ U By a gauge function ϕ, we mean a continuous...
... existing methods In “Optimum wordlength search using sensitivity information,” K Han and B L Evans propose a fast algorithm for searching for an optimum wordlength by trading off hardware complexity for ... cascade filters for a WCDMA system”, Q.-T Ho et al present an FPGAbased implementation of a multiuser detector for WCDMA transmission systems They exploit a serial interference structure in form of a ... design system for signal processing, and also in the context of target platforms based on the StarCore DSP Retargetability to other algorithm development environments and target platforms is promising...
... methodsfor generalized equilibrium problems and fixed point problems with applications,” Nonlinear Analysis: Theory, Methods & Applications, vol 72, no 1, pp 99–112, 2010 13 W Takahashi, Nonlinear ... mappings is of wide interdisciplinary interest and importance Many iterativemethods are purposed for finding a common element of the solutions of the equilibrium problem and fixed point problem of ... n,j n,j 27 n,j α2 α3 and < η1 ≤ α1 ≤ θ1 < for all n ∈ N, for all j 1, 2, , N − 1, < ηN ≤ α1 n,j n,j n,N α1 ≤ and ≤ α2 , α3 ≤ θ3 < for all n ∈ N, for all j 1, 2, , N Let {xn }, {un }, {vn...
... diagonally dominant L-matrix, and b = Then the solution of linear system (1) satisfies The Bounds on Components of the Solutionfor Consistent LinearSystems 95 d ≤ xi ≤ D, ∀i ∈ N Proof The result ... ∈ R and B is nonnegative It follows from Perron- The Bounds on Components of the Solutionfor Consistent LinearSystems 93 Frobenius Theorem on nonnegative matrices (e.g., see [1]) that there ... the above linear system and presented the following result, on which we make a slight modification Theorem 1.1 Let A be a nonsingular, diagonally dominant Z-matrix Then the solution of linear system...
... iterativemethods and non-stationary iterativemethods 2.1: Overview of IterativeMethods 2.1.1 12 Stationary IterativeMethods Stationary iterativemethods are traditional methodsfor the solution ... Recent advances on solutionmethods of linearsystems show that Krylov subspace iterativemethods have greater potentials than direct solutionmethodsfor large-scale linearsystems However, to ... Krylov iterativemethods are applicable for different linear systems, Figure 2.1 gives the flowchart with suggestion for the selection of iterativemethodsFor classical stationary iterative methods...
... and put ξ1 := Fully parallel methodsforlinear PDAEs In this section we study the numerical solution of the following initial boundary value problems (IBVPs) forlinear PDAEs: Aut + B∆u = f (x, ... m+1,k + (1 − )v m d (18) Note that the linearsystems (17) can be solved by any parallel iterativemethods [5,6,7,8,9] Now we turn to the BVP (12)-(13) For its solution we implement the parallel ... Method for the Solution of Linear Parabolic Problems, Applied Mathematics Research Express No (2005) 117 [5] R.D da Cunha, T.R Hopkins, Parallel Over Relaxation Algorithms forSystems of Linear...
... grammatical formalisms In Proceedings of the 25th Meeting of the Association for Computational Linguistics (ACL’87) Daniel Gildea 2010 Optimal parsing strategies forlinear context-free rewriting systems ... edges for r is defined as Br = {(x, x′ ) | (x, x′ ) ∈ Er , x ≺p r.left, x′ ∈ r} The set of forward edges for r is defined symmetrically as Fr = {(x, x′ ) | (x, x′ ) ∈ Er , x ∈ r, r.right ≺p x′ } For ... Backward and local backward quantities for the expanded range can be expressed as a function of the same quantities for r Therefore if we store our quantities for previously processed ranges, each...
... Linguistics/Association for Computational Linguistics (COLING/ACL-06) Poster Session, pages 279–286 Daniel Gildea 2010 Optimal parsing strategies forLinear Context-Free Rewriting Systems In Proc 2010 ... well-nested linear context-free rewriting systems In Proc 2010 Meeting of the North American chapter of the Association for Computational Linguistics (NAACL-10), pages 276– 284, Los Angeles, California ... Giorgio Satta 2010 Optimal rank reı duction forlinear context-free rewriting systems with fan-out two In Proc 48th Annual Meeting of the Association for Computational Linguistics, pages 525–533,...
... of strings, defining the language of G Linear context-free rewriting systems We briefly summarize here the terminology and notation that we adopt for LCFRS; for detailed definitions, see (Vijay-Shanker ... non-negative integers by N For i, j ∈ N, the interval {k | i ≤ k ≤ j} is denoted by [i, j] We write [i] as a shorthand for [1, i] For an alphabet V , we write V ∗ for the set of all (finite) strings ... However, this algorithm works for a restricted typology of productions, and does not cover all cases in which some binarization is possible Other linear time algorithms for rank reduction are found...
... closed-form solution of the sub-problem With the regularization term, the sub-problems no longer have a closed-form solution We discuss the cost of solving sub-problems by the Newton method, which iteratively ... but it does not perform well in the beginning Conclusions In summary, we create a general framework for explaining IS methods Based on this framework, we develop a new CD method for Maxent It is ... y) and Tw(x) This trick for updating Pw(y|x) has been used in SCGIS (Goodman, 2002) Thus, the first Newton iteration of all methods discussed here takes O(¯ operations For each subsequent l) Newton...
... reliability over the methodsfor the general linear- equation problem Thirdly, in chapter it will be shown that the formation of AT A can lead to loss of information Techniques exist for the solution of ... exists a linear relationship between farm money income and the agricultural use of nitrogen, phosphate, potash and petroleum A model is therefore formulated using, for simplicity, a linear form (money ... p/(v cos φ ) for q > sin φ = sgn(p)[(v – q)/(2v ) ] cos φ = p/(υ sin φ ) ½ for q < (3.23) (3.24) (3.25) (3.26) where } sgn (p) = –1 for p > for p < (3.27) Note that having two forms for the calculation...
... Direct Methodsfor Stability Analysis of Electric Power Systems ffirs.indd i 9/24/2010 2:20:04 PM ffirs.indd ii 9/24/2010 2:20:04 PM Direct Methodsfor Stability Analysis of Electric Power Systems ... Electric power systems are nonlinear in nature Their nonlinear behaviors are difficult to predict due to (1) the extraordinary size of the systems, (2) the nonlinearity in the systems, (3) the ... significant research efforts, for example, those documented in Choi (2006), CIGRE Task Force 38.02.05 (1990), He et al (2006), IEEE Task Force on Load Representation for Dynamic Performance (1993),...
... of Lyapunov forlinear Hamiltonian systems on time scales J Math Anal Appl 381, 695–705 (2011) [11] GSh Guseinov, B Kaymakcalan, Lyapunov inequalities for discrete linear Hamiltonian systems Comput ... Stability criteria forlinear periodic Hamiltonian systems J Math Anal Appl 367, 329–336 (2010) [15] XH Tang, M Zhang, Lyapunov inequalities and stability forlinear Hamiltonian systems J Diff Equ ... Agarwal, M Bohner, P Rehak, Half -linear dynamic equations Nonlinear Anal Appl 1, 1–56 (2003) [8] LQ Jiang, Z Zhou, Lyapunov inequality forlinear Hamiltonian systems on time scales J Math Anal...
... the iterativemethods using for approximation of fixed points of nonlinear mappings, see for instance [1–7] However, there are only a few articles concerning comparison of those iterativemethods ... general iterative method for a finite family of nonexpansive mappings Nonlinear Anal 66, 2676–2687 (2007) [23] Yao, Y, Noor, MA, Liou, Y-C: On iterativemethodsfor equilibrium problems Nonlinear ... of those methods There are many iterativemethodsfor finding a fixed point of g For example, the Mann iteration (see [1]) is defined by x1 ∈ E and xn+1 = (1 − αn )xn + αn g(xn ) (1.3) for all n...
... limit limt→0 x+ty − x t exists for all x, y Î U It is also said to be uniformly smooth if the limit is attained uniformly for x, y Î U Now we collect some useful lemmas for proving the convergence ... Su, Y: General iterativemethodsfor a one-parameter nonexpansive semigroup in Hilbert space Nonlinear Anal 70, 3065–3071 (2009) doi:10.1016/j.na.2008.04.007 16 Takahashi, W: Nonlinear Functional ... Inspired and motivated by the iterative (1.13) given above, we give the following modified general iterative scheme for a nonexpansive semigroup {T(t): t > 0}: for any {T(tn): tn > 0, n Î N}...
... \{0}) for a.e t Î (0, ∞), and therefore, (4.19) holds for h - Now we prove the assertion of the theorem by induction on h Let us consider first the case h = We rewrite (2.6), (2.7) in the form ... non-smooth base Nonlinear Anal TMA 70, 741–756 (2009) doi:10.1016/j.na.2008.01.007 Kokotov, A, Plamenevskii, BA: On the asymptotic on solutions to the Neumann problem for hyperbolic systems in domain ... Cite this article as: Hung et al.: On the regularity of the solutionfor the second initial boundary value problem for hyperbolic systems in domains with conical points Boundary Value Problems...
... alternative equivalent formulation is used to suggest and analyze some iterativemethodsfor solving this system of extended general variational inclusions Several special cases of these iterative algorithms ... ∈ 0, for all n ≥ satisfies some suitable conditions For suitable and appropriate choice of the operators T1 , T2 , A, g, h, g1 and spaces, one can obtain a wide class of iterativemethodsfor solving ... variational inequalities involving five different operators,” Nonlinear Analysis Forum, vol 15, pp 171–179, 2010 24 M A Noor, “On iterativemethodsfor solving a system of mixed variational inequalities,”...