scholarly journals Contracting Mapping on Normed Linear Space

2012 ◽  
Vol 20 (4) ◽  
pp. 291-301
Author(s):  
Keiichi Miyajima ◽  
Artur Korniłowicz ◽  
Yasunari Shidama

Summary In this article, we described the contracting mapping on normed linear space. Furthermore, we applied that mapping to ordinary differential equations on real normed space. Our method is based on the one presented by Schwarz [29].

2013 ◽  
Vol 21 (4) ◽  
pp. 261-272
Author(s):  
Keiko Narita ◽  
Noboru Endou ◽  
Yasunari Shidama

Abstract In this article, we describe the differential equations on functions from R into real Banach space. The descriptions are based on the article [20]. As preliminary to the proof of these theorems, we proved some properties of differentiable functions on real normed space. For the proof we referred to descriptions and theorems in the article [21] and the article [32]. And applying the theorems of Riemann integral introduced in the article [22], we proved the ordinary differential equations on real Banach space. We referred to the methods of proof in [30].


2019 ◽  
Vol 21 (1) ◽  
Author(s):  
Juan Eduardo Nápoles Valdez

In this paper, we present, briefly, the bifront character of the ordinary differential equations (ODE): on the one hand the theoretical specialization in different areas and on the other, the multiplicity of applications of the same, as well as some reflections on the development of a course of ode in this context.


2005 ◽  
Vol 2005 (24) ◽  
pp. 3963-3977 ◽  
Author(s):  
AL. Narayanan ◽  
S. Vijayabalaji

The primary purpose of this paper is to introduce the notion of fuzzyn-normed linear space as a generalization ofn-normed space. Ascending family ofα-n-norms corresponding to fuzzyn-norm is introduced. Best approximation sets inα-n-norms are defined. We also provide some results on best approximation sets inα-n-normed space.


1957 ◽  
Vol 10 (1) ◽  
pp. 29 ◽  
Author(s):  
JR Philip

A new procedure is developed for the numerical solution of the equation with D and K single-valued functions of ? and the conditions ? = ?n, t=0, x>0; ?=?0 , x = 0, t:> 0. Difficulties inherent in the one method previously suggested are avoided, the problem being reduced to one of solving a set of ordinary differential equations.


2020 ◽  
Vol 11 (4) ◽  
pp. 567-578
Author(s):  
Noorhelyna Razali ◽  
Alias Jedi ◽  
Nuryazmin Ahmat Zainuri

PurposeExtrapolation is a process used to accelerate the convergence of a sequence of approximations to the true value. Different stepsizes are used to obtain approximate solutions, which are combined to increase the order of the approximation by eliminating leading error terms. The smoothing technique is also applied to suppress order reduction and to dampen the oscillatory component in the numerical solution when solving stiff problems. The extrapolation and smoothing technique can be applied in either active, passive or the combination of both active and passive modes. In this paper, the authors investigate the best strategy of implementing extrapolation and smoothing technique and use this strategy to solve stiff ordinary differential equations. Based on the experiment, the authors suggest using passive smoothing in order to reduce the computation time.Design/methodology/approachThe two-step smoothing is a composition of four steps of the symmetric method with different weights. It is used as the final two steps when combined with many steps of the symmetric method. The aim is to preserve symmetry and provide damping for stiff problem and to be more robust than the one-step smoothing. The two-step smoothing is L-stable. The new method is then applied with extrapolation process in passive and active modes to investigate the most efficient and accurate method of implementation.FindingsIn this paper, the authors constructed the two-step smoothing to be more robust than the one-step smoothing. The two-step smoothing is constructed to achieve as high order as possible and able to restore the classical order of particular method compared to the one-step active smoothing that is only able to achieve order-1 condition. The two-step smoothing for ITR is also superior in solving stiff case since it has the super-convergent order-4 behavior. In our experiments with extrapolation, it is proven that the two-step smoothing is more accurate and more efficient than the one-step smoothing, namely 1ASAX. It is also observed that the method with smoothing is comparable if not superior to the existing base method in certain cases. Based on the experiment, the authors would suggest using passive smoothing if the aim is to reduce computation time. It is of interest to conduct more experiment to validate the accuracy and efficiency of the smoothing formula with and without extrapolation.Originality/valueThe implementation of extrapolation on two-step symmetric Runge–Kutta method has not been tested on variety of other test problems yet. The two-step symmetrization is an extension of the one-step symmetrization and has not been constructed by other researchers yet. The method is constructed such that it preserves the asymptotic error expansion in even powers of stepsize, and when used with extrapolation the order might increase by 2 at a time. The method is also L-stable and eliminates the order reduction phenomenon when solving stiff ODEs. It is also of interest to observe other ways of implementing extrapolation using other sequences or with interpolation.


1982 ◽  
Vol 25 (2) ◽  
pp. 173-181 ◽  
Author(s):  
W. A. Light ◽  
J. H. McCabe ◽  
G. M. Phillips ◽  
E. W. Cheney

We shall study a special case of the following abstract approximation problem: givena normed linear space E and two subspaces, M1 and M2, of E, we seek to approximate f ∈ E by elements in the sum of M1 and M2. In particular, we might ask whether closest points to f from M = M1 + M2 exist, and if so, how they are characterised. If we can define proximity maps p1 and p2 for M1 and M2, respectively, then an algorithm analogous to the one given by Diliberto and Straus [4] can be defined by the formulae


2015 ◽  
Vol 21 (1) ◽  
Author(s):  
Masoumeh Aghajani ◽  
Andrzej Smajdor

AbstractThe existence of additive selections of additive correspondences was investigated in [Ark. Mat. 4 (1960), 87–97], [Rev. Roumaine Math. Pures Appl. 28 (1983), 239–242.], [Math. Ser. Univ. Novi Sad 18 (1988), 143–148] and other papers. In this article, we find an existence theorem for additive selections of additive correspondences with convex compact values in a real normed linear space defined on an open convex cone of a real separable normed space.


2012 ◽  
Vol 2012 ◽  
pp. 1-16 ◽  
Author(s):  
Zanariah Abdul Majid ◽  
Nur Zahidah Mokhtar ◽  
Mohamed Suleiman

A direct two-point block one-step method for solving general second-order ordinary differential equations (ODEs) directly is presented in this paper. The one-step block method will solve the second-order ODEs without reducing to first-order equations. The direct solutions of the general second-order ODEs will be calculated at two points simultaneously using variable step size. The method is formulated using the linear multistep method, but the new method possesses the desirable feature of the one-step method. The implementation is based on the predictor and corrector formulas in thePE(CE)mmode. The stability and precision of this method will also be analyzed and deliberated. Numerical results are given to show the efficiency of the proposed method and will be compared with the existing method.


Author(s):  
W. Sarlet

AbstractWe discuss general, time-dependent, linear systems of second-order ordinary differential equations. A study is made of the similarities and discrepancies between the inverse problem of Lagrangian mechanics on the one hand, and the search for linear dynamical symmetries on the other hand.


Sign in / Sign up

Export Citation Format

Share Document