There are several ways that can be used to classify or compare iterative methods for nonlinear equations,for instance;order of convergence,informational efficiency,and efficiency index.In this work,we use another way,...There are several ways that can be used to classify or compare iterative methods for nonlinear equations,for instance;order of convergence,informational efficiency,and efficiency index.In this work,we use another way,namely the basins of attraction of the method.The purpose of this study is to compare several iterative schemes for nonlinear equations.All the selected schemes are of the third-order of convergence and most of them have the same efficiency index.The comparison depends on the basins of attraction of the iterative techniques when applied on several polynomials of different degrees.As a comparison,we determine the CPU time(in seconds)needed by each scheme to obtain the basins of attraction,besides,we illustrate the area of convergence of these schemes by finding the number of convergent and divergent points in a selected range for all methods.Comparisons confirm the fact that basins of attraction differ for iterative methods of different orders,furthermore,they vary for iterative methods of the same order even if they have the same efficiency index.Consequently,this leads to the need for a new index that reflects the real efficiency of the iterative scheme instead of the commonly used efficiency index.展开更多
This paper discusses scattered data interpolation using cubic trigonometric Bézier triangular patches with C1 continuity everywhere.We derive the C1 condition on each adjacent triangle.On each triangular patch,we...This paper discusses scattered data interpolation using cubic trigonometric Bézier triangular patches with C1 continuity everywhere.We derive the C1 condition on each adjacent triangle.On each triangular patch,we employ convex combination method between three local schemes.The final interpolant with the rational corrected scheme is suitable for regular and irregular scattered data sets.We tested the proposed scheme with 36,65,and 100 data points for some well-known test functions.The scheme is also applied to interpolate the data for the electric potential.We compared the performance between our proposed method and existing scattered data interpolation schemes such as Powell–Sabin(PS)and Clough–Tocher(CT)by measuring the maximum error,root mean square error(RMSE)and coefficient of determination(R^(2)).From the results obtained,our proposed method is competent with cubic Bézier,cubic Ball,PS and CT triangles splitting schemes to interpolate scattered data surface.This is very significant since PS and CT requires that each triangle be splitting into several micro triangles.展开更多
The convergence results of block iterative schemes from the EG (Explicit Group) family have been shown to be one of efficient iterative methods in solving any linear systems generated from approximation equations. A...The convergence results of block iterative schemes from the EG (Explicit Group) family have been shown to be one of efficient iterative methods in solving any linear systems generated from approximation equations. Apart from block iterative methods, the formulation of the MSOR (Modified Successive Over-Relaxation) method known as SOR method with red-black ordering strategy by using two accelerated parameters, ω and ω′, has also improved the convergence rate of the standard SOR method. Due to the effectiveness of these iterative methods, the primary goal of this paper is to examine the performance of the EG family without or with accelerated parameters in solving second order two-point nonlinear boundary value problems. In this work, the second order two-point nonlinear boundary value problems need to be discretized by using the second order central difference scheme in constructing a nonlinear finite difference approximation equation. Then this approximation equation leads to a nonlinear system. As well known that to linearize nonlinear systems, the Newton method has been proposed to transform the original system into the form of linear system. In addition to that, the basic formulation and implementation of 2 and 4-point EG iterative methods based on GS (Gauss-Seidel), SOR and MSOR approaches, namely EGGS, EGSOR and EGMSOR respectively are also presented. Then, combinations between the EG family and Newton scheme are indicated as EGGS-Newton, EGSOR-Newton and EGMSOR-Newton methods respectively. For comparison purpose, several numerical experiments of three problems are conducted in examining the effectiveness of tested methods. Finally, it can be concluded that the 4-point EGMSOR-Newton method is more superior in accelerating the convergence rate compared with the tested methods.展开更多
基金We are grateful for the financial support from UKM’s research Grant GUP-2019-033。
文摘There are several ways that can be used to classify or compare iterative methods for nonlinear equations,for instance;order of convergence,informational efficiency,and efficiency index.In this work,we use another way,namely the basins of attraction of the method.The purpose of this study is to compare several iterative schemes for nonlinear equations.All the selected schemes are of the third-order of convergence and most of them have the same efficiency index.The comparison depends on the basins of attraction of the iterative techniques when applied on several polynomials of different degrees.As a comparison,we determine the CPU time(in seconds)needed by each scheme to obtain the basins of attraction,besides,we illustrate the area of convergence of these schemes by finding the number of convergent and divergent points in a selected range for all methods.Comparisons confirm the fact that basins of attraction differ for iterative methods of different orders,furthermore,they vary for iterative methods of the same order even if they have the same efficiency index.Consequently,this leads to the need for a new index that reflects the real efficiency of the iterative scheme instead of the commonly used efficiency index.
基金This research was fully supported by Universiti Teknologi PETRONAS(UTP)and Ministry of Education,Malaysia through research grant FRGS/1/2018/STG06/UTP/03/1/015 MA0-020(New rational quartic spline interpolation for image refinement)and UTP through a research grant YUTP:0153AA-H24(Spline Triangulation for Spatial Interpolation of Geophysical Data).
文摘This paper discusses scattered data interpolation using cubic trigonometric Bézier triangular patches with C1 continuity everywhere.We derive the C1 condition on each adjacent triangle.On each triangular patch,we employ convex combination method between three local schemes.The final interpolant with the rational corrected scheme is suitable for regular and irregular scattered data sets.We tested the proposed scheme with 36,65,and 100 data points for some well-known test functions.The scheme is also applied to interpolate the data for the electric potential.We compared the performance between our proposed method and existing scattered data interpolation schemes such as Powell–Sabin(PS)and Clough–Tocher(CT)by measuring the maximum error,root mean square error(RMSE)and coefficient of determination(R^(2)).From the results obtained,our proposed method is competent with cubic Bézier,cubic Ball,PS and CT triangles splitting schemes to interpolate scattered data surface.This is very significant since PS and CT requires that each triangle be splitting into several micro triangles.
文摘The convergence results of block iterative schemes from the EG (Explicit Group) family have been shown to be one of efficient iterative methods in solving any linear systems generated from approximation equations. Apart from block iterative methods, the formulation of the MSOR (Modified Successive Over-Relaxation) method known as SOR method with red-black ordering strategy by using two accelerated parameters, ω and ω′, has also improved the convergence rate of the standard SOR method. Due to the effectiveness of these iterative methods, the primary goal of this paper is to examine the performance of the EG family without or with accelerated parameters in solving second order two-point nonlinear boundary value problems. In this work, the second order two-point nonlinear boundary value problems need to be discretized by using the second order central difference scheme in constructing a nonlinear finite difference approximation equation. Then this approximation equation leads to a nonlinear system. As well known that to linearize nonlinear systems, the Newton method has been proposed to transform the original system into the form of linear system. In addition to that, the basic formulation and implementation of 2 and 4-point EG iterative methods based on GS (Gauss-Seidel), SOR and MSOR approaches, namely EGGS, EGSOR and EGMSOR respectively are also presented. Then, combinations between the EG family and Newton scheme are indicated as EGGS-Newton, EGSOR-Newton and EGMSOR-Newton methods respectively. For comparison purpose, several numerical experiments of three problems are conducted in examining the effectiveness of tested methods. Finally, it can be concluded that the 4-point EGMSOR-Newton method is more superior in accelerating the convergence rate compared with the tested methods.