... follows In Section 2, we specify some hypotheses, precise sense of the weak solution, then we state the main results and some Lemmas that needed in the sequel In Section 3, by the Rothe–Galerkin method, ... problems were investigated In general, existence of solutions for a class of nonlinear evolution equations of second order is proved by studying a full discretization The article is organized as follows ... method, we construct approximate solutions to problem (P) Some a priori estimates for the approximations are derived In Section 4, we prove the main results Hypothesis and mean results To solve problem...
... Analysis, Addison-Wesley, Reading, Mass, USA, 1969 ¨ 12 R Saadati, M Dehghan, S M Vaezpour, and M Saravi, “The convergence of He s variational iteration methodforsolving integral equations, ” ... is T -stable Acknowledgments The authors would like to thank referees and area editor Professor Nan-jing Huang for giving useful comments and suggestions for the improvement of this paper This ... Applications Substituting 2.22 into 2.21 , we have the following results: u1 x sin ax u2 x λ sin ax π/2a a λ cos ax sin at dt a π/2a cos ax sin ax λ sin ax a λ cos at dt cos ax sin at sin ax u3 x λ cos...
... have several steps to prove this theorem as follows: Step We first show that Cn+1 is closed and convex for each n ≥ Indeed, it is obvious that C1 = C is closed and convex Suppose that Ci is closed ... respective helpful discussions and suggestions in preparation of this article This research was supported by grant under the program Strategic Scholarships for Frontier Research Network for the Joint ... Hilbert spaces, the class of (asymptotically) quasi-j-nonexpansive mappings is reduced to the class of (asymptotically) quasi-nonexpansive mappings Let T be a nonlinear mapping, T is said to be uniformly...
... constants Equation 2.1 can be solved easily using methods such as the HAM and the SHAM In each of these methods, an initial approximation f0(h) is sought, which satisfies the boundary conditions ... solved using the ISHAM The ISHAM is a modified version of the SHAM [24,25] One strength of the SHAM is that it removes restrictions of the HAM such as the requirement for the solution to conform ... previous iterations), the equation can easily be solved using numerical methods such as finite differences, finite elements, Runge-Kutta-based shooting methods or collocation methods In this article,...
... while the first author was staying at Kyungnam University for the NRF Postdoctoral Fellowship for Foreign Researchers And the second author was supported by Kyungnam University Research Fund, ... computational results see, the Table 10−6 , we obtained the Acknowledgments The authors would like to thank the referees for their useful comments, remarks and suggestions This work was completed ... condition Section deals with some preliminary results of the proposed methods Preliminaries First, let us recall the well-known concepts of monotonicity that will be used in the sequel see 24 ...
... Mathematics Student, vol 63, no 1–4, pp 123–145, 1994 18 T Suzuki, “Strong convergence of Krasnoselskii and Mann s type sequences for one-parameter nonexpansive semigroups without Bochner integrals,” ... obtaining the result that limn → ∞ xn − However, many authors have used Suzuki s lemma 18 for obtaining the result that xn in the process of studying the similar algorithms For example, see limn → ... Applications, vol 143, no 1, pp 37–58, 2009 S. -S Chang, Y J Cho, and J K Kim, “Approximation methods of solutions for equilibrium problem in Hilbert spaces,” Dynamic Systems and Applications, vol...
... Arts RMUTR Research Fund and King Mongkut s Diamond scholarship for fostering special academic skills by KMUTT The second author was supported by the Thailand Research Fund and the Commission ... converges strongly to some z ∈ F S ∩ V I C, B Iterative methods for nonexpansive mappings have recently been applied to solve convex minimization problems; see, for example, 21–24 and the references ... ρA ≤ − ργ Forsolving the equilibrium problem for a bifunction F : C × C → R, let us assume that F satisfies the following conditions: A1 F x, x for all x ∈ C; A2 F is monotone, that is, F x, y...
... Inequalities and Applications Recall that a mapping S : C → C is called nonexpansive if Sx − Sy ≤ x − y for all x, y ∈ C The set of all fixed points of S is denoted by F S , that is, F S {x ∈ C : x Sx} ... the set of solutions of the variational inequality for the inverse-strongly monotone mapping B in a real Hilbert space which solves some variational inequalities Secondly, by using the first results, ... and {f xn }, {ASyn } are bounded, we have xn − Syn → as n → ∞ Since xn − Syn ≤ xn − xn xn − Syn , 3.17 it implies that xn − Syn → as n → ∞ Since xn − Sxn ≤ xn − Syn ≤ xn − Syn Syn − Sxn yn − xn...
... forms of the phase function for some typical cases in both SAR and ISAR systems (1) For nonmoving targets in SAR systems and for constant velocity targets in ISAR systems, the phase function can ... (2) So, the received signal is a 2D complex sinusoid (2) Phase function of moving targets in the SAR systems is analyzed in [1] Similar results are observed in some ISAR systems with uniform ... ISAR targets with fast and 3D maneuvers can produce phase function of the form SIGNAL MODEL In both SAR and ISAR systems series of signals is transmitted toward radar target Commonly, these signals...
... comparison with the other formal method requires the analysis of its results We conclude with Section Main result 2.1 Formal asymptotic solution In this section, we develop a perturbation method ... Perturbation methodfor difference equations Proof From (3.12) and (3.20), we deduce (0) (− (− ( s+ m (0) (0) ys(0) = yt ,s + w0 ,s s) + w1 ,s s+1) + · · · + wm−1 ,s −1) = yt ,s + ws ,s = s , s = 0,1, ,m ... applications: an overview, Dynamics of Continuous, Discrete & Impulsive Systems Series B Applications & Algorithms (2002), no 2, 233–278 [10] D S Naidu and A J Calise, Singular perturbations and time scales...
... functions 4.2 Popular approaches forsolving nonlinear Equations System There are several standard known techniques to solve nonlinear equations system Some popular techniques are as follows: Newton- type ... solutions! PDS algorithm is very efficient forsolvingequations systems The algorithm has the abilities to overcome local optimal solutions and to obtain global optimal solutions Conclusions ... Nonlinear Equations in Several Variables, New York: Academic 11 Verschelde J., Verlinden P and Cools R (1994), “Homotopies exploiting Newton polytopes forsolving sparse polynomial systems”, SIAM...
... ghost point, and solving (5.5) for the ghost cells simultaneously with the flow equations on the fluid domain solves the system This method has been quite successful for simulating viscous flows ... accomplished When flow problems involve very stiff or rigid bodies, continuous forcing is likely to cause trouble since most methods give rise to ”stiff” numerical systems Satisfactory results have ... thesis is the result of a literature study on Immersed Boundary Methods (IBMs) The literature study is based on a selected number of articles, presentations and conversations Its purpose is not...
... and loss of neurons (Fig 7C), with a similar loss evident for all peptides Discussion Because extensive evidence supports a crucial role for Ab in Alzheimer s disease pathogenesis, there is huge ... urea Mass spectrometry, amino acid analysis and sequencing Amino acid analysis was performed at the Amino Acid Analysis Center, University of Uppsala, Sweden Sequence analysis was performed using ... monomer for fibrillation assays For fibrillation assays, it is essential to start with a uniform monomeric peptide sample Solutions of monomeric Ab were prepared by dissolving lyophilized peptides in...
... It is shown in [5] that the class of asymptotically κ-strictly pseudocontractive mappings and the class of κ-strictly pseudocontractive mappings are independent A mapping T is said to be uniformly ... modified Mann iterative processes for this class of mappings Moreover, a strong convergence theorem was also established in a real Hilbert space by hybrid projection method They proved the following ... processes for asymptotically nonexpansive mappings Proc Am Math Soc 122(3), 733–739 (1994) [11] Huang, Z: Mann and Ishikawa iterations with errors for asymptotically nonexpansive mappings Comput...
... Saud University—Science In press 20 A S Bataineh, M S M Noorani, and I Hashim, Solving systems of ODEs by homotopy analysis method, ” Communications in Nonlinear Science and Numerical Simulation, ... Integro-Differential equations 13 , nonlinear dispersive K m, n, equations 14 , Long Porous Slider equation 15 , and Navier-Stokes equations 16 It can be said that He s homotopy perturbation method is a universal ... applications discussed above, were performed by MATHEMATICA The NHPM is very simple in application and is less computational more accurate in comparison with other mentioned methods By using this method, ...
... otherwise difficult to model Among various kinds of fuzzy methods, Takagi-Sugeno T -S fuzzy model provides a successful method to describe certain complex nonlinear systems using some local linear subsystems ... fuzzy drive and response systems, is proposed for time delayed chaotic systems with unknown parameters Based on Lyapunov-Krasovskii stability theory and LMI formulation, the proposed scheme can guarantee ... model-based chaos control and synchronization, most works were restricted to chaotic systems without time-delay Due to finite signal transmission times, switching speeds and memory effects, time...
... One of the simplest ways to derive such methods consists of using a class of special meshes such as Bakhvalov meshes; see, e.g., 18–24 , which is constructed a priori and depend on the perturbation ... is considered and a comparison of the numerical and exact solutions is presented In the works of Amiraliyev and Erdogan , special meshes Shishkin mesh have been used The method that we propose ... t rs ≤ s ≤ m for small values of ε In the present paper we discretize 1.1 - 1.2 using a numerical method which is composed of an implicit finite difference scheme on special Bakhvalov meshes for...
... respectively Thus, 1,T 3.14 It follows from the definition of K that T Φy t G1 t, s r s f s, ys t∈ 1,T t∈ 1,T ≥m us s T r s f s, ys us s ≥ ≥ which implies that Φ K ⊂ K m T Ms max G1 t, s 1 s, t≤T ... 1 s, t≤T r s f s, ys T m max G1 t, s r s f s, ys M t∈ 1,T s m Φy , M us us 3.15 Boundary Value Problems 13 Lemma 3.4 Suppose that (H1 ) holds Then Φ : K → K is completely continuous We assume that ... well-posedness of BVP 1.9 , since the function f depends on the term ut i.e., past values of u As usual, a sequence {u −τ , , u T } is said to be a positive solution of BVP 1.9 if it satisfies...