• The Pure and Applied Mathematics
• /
• v.20 no.4
• /
• pp.277-286
• /
• 2013

In this paper, we suggest and analyze a family of multi-step iterative methods which do not involve the high-order differentials of the function for solving nonlinear equations using a different type of decomposition (mainly due to Noor and Noor [15]). We also discuss the convergence of the new proposed methods. Several numerical examples are given to illustrate the efficiency and the performance of the new iterative method. Our results can be considered as an improvement and refinement of the previous results.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.4
• /
• pp.881-894
• /
• 2022

In this paper, we consider a class of random generalized nonlinear mixed variational inclusions with random fuzzy mappings and random relaxed cocoercive mappings in real Hilbert spaces. We suggest and analyze an iterative algorithm for finding the approximate solution of this class of inclusions. Further, we discuss the convergence analysis of the iterative algorithm under some appropriate conditions. Our results can be viewed as a refinement and improvement of some known results in the literature.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2004.10a
• /
• pp.79-82
• /
• 2004

In this study, a new refinement technique for 3-dimensional hexahedral element mesh is proposed, which is aimed at the control of mesh density. With the proposed scheme the mesh is refined adaptively to the elemental error which is estimated by 'a posteriori' error estimator based on the energy norm. A desired accuracy of an analysis i.e. a limit of error defines the new desired mesh density map on the current mesh. To obtain the desired mesh density, the refinement procedure is repeated iteratively until no more elements to be refined exist. In the algorithm, at first the regions of mesh to be refined are defined and, then, the zero-thickness element layers are inserted into the interfaces between the regions. All the meshes in the regions, in which the zero-thickness layers are inserted, are to be regularized in order to improve the shape of the slender elements on the interfaces. This algorithm is tested on a simple shape of 2-d quadrilateral element mesh and 3-d hexahedral element mesh. A numerical example of elastic deformation of a plate with a hole shows the effectiveness of the proposed refinement scheme.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.4 no.1
• /
• pp.79-92
• /
• 2000

We investigate numerical properties of Newton's algorithm for improving an eigenpair of a real matrix A using only fixed precision arithmetic. We show that under natural assumptions it produces an eigenpair of a componentwise small relative perturbation of the data matrix A.

• School Mathematics
• /
• v.9 no.4
• /
• pp.467-486
• /
• 2007

In mathematical modeling activity modeling process is usually an iterative process. When model can not be solved, the model needs to be simplified by treating some variables as constants, or by ignoring some variables. On the other hand, when the results from the model are not precise enough, the model needs to be refined by considering additional conditions. In this study we investigate the role of spreadsheet model in model refinement and modeling process. In detail, we observed that by using spreadsheet model students can solve model which can not be solved in paper-pencil environment. And so they need not go back to model simplification process but continue model refinement. By transforming mathematical model to spreadsheet model, the students can predict or explain the real word situations directly without passing the mathematical conclusions step in modeling process.

• Journal of Digital Convergence
• /
• v.12 no.12
• /
• pp.337-343
• /
• 2014

There have been many efforts to find a new way to combine software reuse and agile software development methods. This paper studies the integration of software reuse techniques in agile methods, such as Scrum. Agile methods have the advantage of accepting frequent requirement changes, while software reuse reduces development time. Despite the rapid acceptance of the Scrum method in industry, not much emphasis has been placed on active reuse in the Scrum method, and most studies have focused on introducing agile practices into software product line engineering. However, the iterative development and backlog refinement activities of the Scrum method present the advantage of facilitating software reuse. In this paper, we identify sprint characteristics and components for reuse and suggest extended backlog refinement steps. Based on the results of this research, we integrate a backlog factoring technique into backlog refinement to support reuse in agile methods. In addition, we apply the proposed technique and demonstrate a prototype of product backlog reuse in backlog refinement for an Internet shopping mall application.

• Journal of Information Technology and Architecture
• /
• v.9 no.4
• /
• pp.357-363
• /
• 2012

Ontologies are being used in order to define common vocabularies to describe the elements of schemas involved in a particular application. The problem of finding correspondences between ontologies concepts, called ontology matching, consists in the discovery of correspondences between terms of vocabularies (represented by ontologies) used by various applications. The majority of solutions proposed in the literature, despite being fully automatic, has heuristic nature and may produce nonsatisfactory results. The problem intensifies when dealing with large data sources. The goal of this paper is to propose a method for generation and incremental refinement of correspondences between ontologies. The proposed approach uses filtering techniques, as well as user feedback to support the generation and refinement of such matches. For validation purposes, a tool was developed and some experiments were conducted.

• Korean Journal of Remote Sensing
• /
• v.39 no.1
• /
• pp.111-127
• /
• 2023

In visual slam and 3D data modeling, the Iterative Closest Point method is a primary fundamental algorithm, and many technical fields have used this method. However, it relies on search methods that take a high search time. This paper solves this problem by applying an effective point cloud refinement method. And this paper also accelerates the point cloud registration process with an indexing scheme using the spatial decomposition method. Through some experiments, the results of this paper show that the proposed point cloud refinement method helped to produce better performance.

• East Asian mathematical journal
• /
• v.26 no.1
• /
• pp.59-67
• /
• 2010

In this paper, we suggest and analyze some three step iterative scheme for finding the common elements of the set of the solutions of the extended general variational inequalities involving three operators and the set of the fixed points of nonexpansive mappings. We also consider the convergence analysis of suggested iterative schemes under some mild conditions. Since the extended general variational inequalities include general variational inequalities and several other classes of variational inequalities as special cases, results obtained in this paper continue to hold for these problems. Results obtained in this paper may be viewed as a refinement and improvement of the previously known results.

• The Pure and Applied Mathematics
• /
• v.11 no.4
• /
• pp.337-348
• /
• 2004

In this paper, we suggest and analyze Noor (three-step) iterative scheme for solving nonlinear strongly accretive operator equation Tχ = f. The results obtained in this paper represent an extension as well as refinement of previous known results.