/ / Article

Research Article | Open Access

Volume 2014 |Article ID 872637 | https://doi.org/10.1155/2014/872637

Samsul Ariffin Abdul Karim, Kong Voon Pang, "Local Control of the Curves Using Rational Cubic Spline", Journal of Applied Mathematics, vol. 2014, Article ID 872637, 12 pages, 2014. https://doi.org/10.1155/2014/872637

# Local Control of the Curves Using Rational Cubic Spline

Accepted07 Jan 2014
Published02 Mar 2014

#### Abstract

This paper discussed the local control of interpolating function by using rational cubic spline (cubic/quadratic) with three parameters originally proposed by the authors. The rational spline has continuity. The bounded properties of the rational cubic interpolants and shape controls of the rational interpolants are discussed in detail. The value control, inflection point control, and convexity control at a point by using the proposed rational cubic spline are constructed. Several numerical results are presented to show the capability of the method. Numerical comparisons with the existing scheme are also further elaborated. From the results, it was indicated that the scheme works well and it is comparable with the established existing scheme.

#### 1. Introduction

Shape preserving is important for the visualization of the given data sets. For example, if the design requires the interpolating curves or surfaces to retain its geometric properties such as convexity, monotonicity, and positivity, any proposed method must be able to fulfill these important criteria. For example, if the data is convex, then the resultant interpolating function must be convex on entire given interval. Common spline polynomial interpolations have a unique interpolation function . If the design requires the modification of the shape of the interpolating curves, the data need to be changed. Thus those mentioned methods are not capable of changing the shape of the curves with the same data points (interpolation points). To meet the needs of industrial expertise, the interpolating function should be able to modify the shape of the interpolating curves by either locally or globally altering the values of its shape parameters. Motivated by this, many researchers have developed many rational interpolants with shape parameters for shape preserving interpolation. For instance, Sarfraz , Sarfraz et al. , Hussain et al. , Shaikh et al. , and Tian et al.  have proposed different types of rational spline interpolants (cubic/cubic or cubic/quadratic form) for the shape control. The main idea is that the sufficient condition on the shape parameters for the monotonicity, convexity, or positivity preserving will be derived while the other parameter(s) will be let as free parameter(s) and we may have many types of interpolating curves with different values of respective shape parameter.

Besides the use of rational spline for shape preserving, there exist many research papers discussing the local control of interpolating curves. Strictly speaking, the rational splines were used to meet the design requirement such as point control, inflection-point control, or convexity control of interpolating function. Bao et al.  have discussed the point control of the interpolating function of the form cubic/quadratic with two parameters. Meanwhile Bao et al.  have proposed a new local method for controlling the shape of interpolating curves by using rational cubic spline of the form cubic/cubic. Duan et al.  have discussed the local control of interpolating function by utilizing the rational cubic spline of the form cubic/linear and Bao et al.  have explored the use of blending interpolator by using the weighted between the rational cubic spline (cubic/linear) and cubic Hermite spline polynomial. These ideas have been extended by Sun et al. . They apply their blending interpolator for value control with minimal strain energy meanwhile Duan et al.  have used rational cubic spline (cubic/quadratic) of Gregory et al.  to control the value, convexity, and inflection-point control of the interpolation. Due to the fact that there are some cases where there are no parameters values that can be used in order to control the final shape of the curves, Bao et al.  and Sun et al.  have proposed blending interpolator that will enable the local control of the interpolating curves. Pan and Sun  have extended the rational cubic spline interpolant of Bao et al.  (cubic/quadratic) with one parameter for local control. Even though many researchers have published many rational splines for the local control of the interpolating curve, there is still one question that is worth asking and may be useful to be considered. If the design requires that the value of the interpolating function at the point , is equal to real number , that is, , the main question is, how to select or choose the value of ? In Duan et al.  the authors did not mention how to ensure that the user will choose the right . Otherwise the user may need to keep changing the values of each shape parameter that satisfies the sufficient condition for the value-point control of the interpolating function. Motivated by this question, in this paper, the authors will discuss the local control (point, convex, and inflection point) by using the recent rational cubic spline originally proposed by Karim and Kong . These rational cubic splines (cubic/quadratic) have three parameters. The main scientific contributions of this paper are summarized as follows.(i)In this paper a new rational cubic spline (cubic/quadratic) with the three parameters initiated by Karim and Kong  has been used for local control of the interpolation data.(ii)Our methods have three parameters while in the work of Duan et al.  they have only two parameters. By having three parameters, the local control of the interpolating function can be achieved with a greater flexibility. The suitable parameter value can be obtained by simply solving linear equation. This can be seen clearly in the numerical examples later.(iii)Our methods are based on function values and the derivative is given and it is different from the works of Bao et al. , Bao et al. , Duan et al. , and Sun et al.  in which they rely on true function values and no derivative is given.(iv)Our method works well with the tested data sets and it is comparable with the works of Duan et al. .(v)Our rational scheme is based on spline function while in Bashir and Alim  the interpolant is based on trigonometric spline.

The remainder of the paper is organized as follows. Section 2 introduces the rational cubic spline with the three parameters originally initiated by Karim and Kong . Section 3 discusses the bounded property of the rational interpolation. The value control of the interpolating function is discussed in Section 4 with numerical examples. Section 5 is devoted to the inflection-point and convexity control of the interpolating curves with numerical examples. This section also includes the comparison between the proposed local control and the work of Duan et al. . A summary and conclusions are given in Section 6.

#### 2. Rational Cubic Spline Interpolant

This section will introduce the rational cubic spline interpolant with the three parameters originally proposed by Karim and Kong . Let us assume that , is a given set of data where . Let , , and a local variable where .

For , where with The parameters , and . When , , the rational cubic interpolant in (1) is a standard cubic Hermite spline given as follows:

The shapes parameters and , are free parameters (independent) while the shape preserving (positivity, monotonicity, and convexity) as well as data constrained modeling are derived from the other parameter (dependent). The two parameters , can be used to refine and modify the final shape of the interpolating curve [21, 24].

#### 3. The Bounded Property of the Interpolation

As mentioned by Duan et al. , in order to study the bounded property of the interpolation, without loss of generality, the interpolation in a subinterval , will be considered. The interpolating function in (1) can be rewritten as follows: where The rational functions , are called interpolating bases of . Now, for Property 1 holds.

Property 1. The interpolation bases have the following properties.(a). (b) + + .(c), , , .Now, and can be rewritten as follows: The following theorem provides the bounded property of the interpolation function .

Theorem 1. Let be the interpolating function defined in (1); whatever the positive values of the shape parameters , , and might be, the values of the interpolating function in , satisfy the following condition: where

Proof. Due to the locality of the interpolation function, we only consider the function in subinterval . Now, from basic calculus and (5), the following expression can be obtained: Equation (10) can be simplified to the following: Let . Now, can be further simplified to the following: The results in (8) are obtained from (10) and (11). This completes the proof of Theorem 1.

Remark 2. The bounded property given by (10) is the same as the bounded property of the rational cubic spline by Duan et al. .

#### 4. Value Control of the Interpolation

It is a common fact that the shape of the interpolation curves depends on the given interpolation data. By having parameters in the description of the rational interpolant defined in (1), the final shape of the interpolation curves can be changed by altering the values of each shape parameter without the need to change the interpolation data itself. Thus, the user may manipulate the values of each of the parameters until the desired interpolating curves are obtained. Karim and Kong  have applied the rational spline defined in (1) for positivity preserving by finding the suitable values of one shape parameter while the other two, and , are free parameters. Motivated by this finding, in this section this rational cubic spline of Karim and Kong  defined by (1) will be used for point-value control for interpolation data.

In what follows, we adopted the ideas from Duan et al.  . It started with the following problem statement.

If the practical design requires the value of the interpolating function defined in (1) at the point (let be its local coordinate) to be equal to a real number , that is, , where is between and , what parameters values ensuring the resulting interpolating function will satisfy this requirement?

The above problem statement can be rewritten as follows: After some simplification, (13) is equivalent to the following: where If there exist positive parameters , , and that satisfy (14), (13) holds. Thus we have the following theorem.

Theorem 3. Given the interpolating data and the interpolating function defined by (1). For each , the sufficient condition for the existing positive parameters , , and to satisfy is that the number of the sign changes of the sequence is not equal to zero.

Example 4. Due to the fact that the interpolation is local and without loss of generality, it is enough to just consider the interpolation in . We test the value control by using the interpolation data from Duan et al. .

In the interpolation interval , it is clear that . Before we can proceed to control the shape of the interpolating curves, we need to consider that, in the sufficient condition given in (14), there are terms involving and . Thus for the simplicity and to ensure the point-value control can be achieved without any difficulties, and to solve the equation given in (14), we need to input two parameters’ value. It can be that the given parameters are either and or and or and , respectively. The remaining parameter will be calculated from (14).

Let , , and ; the interpolating function in the interval is given by Figure 1 shows the graph of the rational interpolation curve with the parameters , , and .

Now from (1), . If the design requires , then (14) becomes Selecting with the parameters , , and which satisfy (14), then the interpolating function in the interval becomes Figure 2 shows the graph of the rational interpolation curve with the parameters , , and . Simple calculation verified that .

Other possible choices of parameters , , and are , , and . These choices also satisfy (14). Now the interpolating function in becomes Figure 3 shows the graph of the rational interpolation curve with the parameters , , and . Simple calculation verified that .

Figure 4 shows the combination of the graphs in Figures 2 and 3.

It can be seen clearly that both interpolation functions and are almost similar. These show that no matter what the positive value of , , and might be, as long as they satisfy (14), the resulting interpolating functions are almost similar to each other. Figure 5 shows the graph of interpolating function of (blue) and (red).

Now if the design requires then (14) becomes Selecting with the parameters , , and which satisfy (14), then the interpolating function in the interval becomes Figure 6 shows the graph of the rational interpolation curve with the parameters , , and . Simple calculation verified that .

Now if the design requires , then (14) becomes Selecting with the parameters , , and which satisfy (14), then the interpolating function in the interval becomes Figure 7 shows the graph of the rational interpolation curve with the parameters , , and . Simple calculation verified that .

Figure 8 shows the graph of the rational interpolation curves (blue), (purple), and (gray), respectively, and Figure 9 shows the graph of the rational interpolation curves (blue), (red), (purple), and (gray), respectively.

Now we arrive at the main objective of this paper. From the sufficient condition in (14), if the users have chosen any suitable value of , then we can obtain the parameters , , and by solving (14). To solve the equation, in this paper two parameters have been preassigned and the remaining parameter is calculated from the solution in (14). But one question still remains to be answered. What the value of might be? To answer this question, we begin with the following assumption. If the interpolating function at has value , that is (the value of can be any positive value in ), then we have the following: Now, if we assigned the value of and , for example, we choose , then (15) becomes Now, if we require , then Equation (26) can be rearranged as follows: Due to the fact that the parameter , thus (27) gives the following constraints to the value of when we choose : Now, if we assigned the value of and , for example, we choose and , then (15) becomes Now, if we require , then Equation (30) can be rearranged as follows: Due to the fact that the parameter , (31) gives the constraints to the value of when we choose and , or .

Similarly if we choose and , then By rearrange (32), Due to the fact that the parameter , (31) gives the following constraints to the value of when we choose and : Thus we have three possible ranges for for the different choices of parameters , , and . We may obtain different values of ranges of for the different values of the parameters. What we want to know is the range for to ensure the user or designer will choose the suitable values of satisfying ; otherwise we may end in solving nonlinear equations without any possible solution in .

Remark 5. From (28) the following can be observed:

#### 5. Inflection-Point and Convexity Control of Curves

From calculus, the convexity and concavity of an interpolating curve depend on the second-order derivative of the interpolating function. The second derivative of the rational cubic spline with three parameters defined by (1) is given in (36) below : where Now let By simple calculation it can be shown that If , the interpolation curve must have inflection point which satisfies at . Thus we have the following Theorem.

Theorem 6. Given the interpolating data , the interpolation function defined by (1) in each subinterval , has inflection point except when both and are equal to zero and except for the case .
From Duan et al. , the inflection point of the interpolating curve can be controlled. If the design requires the inflection point to be at the point , then the positive parameters , , and can be selected from the following equation: where is defined by (38). Similarly if the design requires the convex point (or concave point) to be at , then the positive parameters , , and must satisfy the following condition: Thus, we have our final theorem of inflection-point and convexity (concavity) control of interpolating curves.

Theorem 7. Given the interpolating data , the interpolation function defined by (1) in each subinterval , has inflection point at the point , if there exist positive parameters , , and satisfying (40), and has convex point (or concavity) at , if there exist positive parameters , , and that satisfy (41).

Remark 8. If the data gives or , then we may set . This will result in the rational cubic interpolant in (1) reproducing the linear segment in that interval:

Example 9. Let be the interpolated function for the interpolation data given in Table 1. From Example 4, when , , and , the interpolating function in the interval is given as The second-order derivative of is given by Simple calculation shows that and ; thus for there must exist inflection point for given in (43) above. The root of the equation in is Thus when , the interpolating function is convex and when , the interpolating function is concave. These properties can be verified from the graph of shown in Figure 10.

 3 −1 6 2

Now if the design requires the inflection point to be at , the parameters , , and must be selected to satisfy the requirement . Now from (41), with , the following equation is obtained: Let and ; then becomes The positive root on of the equation is Thus the interpolating function after some simplification is given by It can be seen clearly that from Figures 11 and 22 the has an inflection point at . Figure 12 shows the graph of . Thus for the interpolating function , the graph is convex on and is concave on and the inflection point is .

Similarly, if the design requires the interpolating curve to be convex at , then the suitable value of positive parameters , , and must be chosen from . Now reduces to the following inequality: If we let and , the inequality in (50) becomes The solution for (50) is . Thus the interpolating function when , , and is given by It can be verified that the interpolating curve is convex at (Figure 21). The graph of shows that the interpolating curve is convex on and concave on (Figure 23). Figure 13 shows the graph of . Meanwhile Figure 14 shows the graph of interpolating function . Finally Figures 15 and 16 show the comparison between the graphs of , , and , respectively.

This subsection discusses the comparison between the local control interpolation by using our proposed rational cubic spline with three parameters and the work of Duan et al. . We still use the same data given in Table 1. From Duan et al. , the interpolating function is concave at when and . The interpolating function is given as follows: Similarly the rational interpolating function is convex at when and (Figure 21). The interpolating function with and is given as follows: Figures 17 and 18 show the graph of the interpolating functions and , respectively. Meanwhile Figures 19 and 20 show the comparison between the concave-point control and local convex control by using our proposed rational cubic spline and the work of Duan et al. . By careful inspection to Figures 12, 14, 17, and 18, it can be seen clearly that the local control by using the proposed rational cubic spline with three parameters gives comparable results with the established work by Duan et al. .

Remark 10. If we choose two positive values such as and , then (50) will be cubic functions and any symbolic software can be used to solve the equation. By having three parameters, we avoid any nonlinear equation from (50). In Duan et al. , to obtain the interpolating function in (51), we need to solve the quadratic equation. Furthermore the convexity preserving (for convex data) by using our rational cubic spline with three parameters can be obtained in .

#### 6. Conclusions

The new rational cubic spline with the three parameters proposed by Karim and Kong  has been used for local control of interpolation data. The parameters in the description of the rational interpolant have been selected for the local control of interpolating curves, namely, point-value control, inflection, and convexity control, without the need to change the interpolation data points. The results indicated that, by having more parameters, the local control can be achieved with a greater flexibility and quite more easiness. Since, we have two parameters to choose, the final parameter is calculated from Theorems 1, 3, 6, and 7, respectively. Comparisons between the proposed methods and the work of Duan et al.  also have been made. From careful inspection to all presented graphs, our rational scheme works well and it is comparable with the work of Duan et al. . Furthermore, this work can be extended for the bounded interpolation on surface by using the same idea from the work of Duan et al. . Work on local control by using function values with our rational cubic spline is underway. This will be our main subject for future research.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

The first author would like to acknowledge Universiti Teknologi PETRONAS for the financial support received in the form of a research grant: Short Term Internal Research Funding (STIRF) no. 35/2012. Comments and suggestions from the referees have improved this paper significantly.

1. S. Butt and K. W. Brodlie, “Preserving positivity using piecewise cubic interpolation,” Computers & Graphics, vol. 17, no. 1, pp. 55–64, 1993. View at: Publisher Site | Google Scholar
2. K. W. Brodlie and S. Butt, “Preserving convexity using piecewise cubic interpolation,” Computers & Graphics, vol. 15, no. 1, pp. 15–23, 1991. View at: Publisher Site | Google Scholar
3. R. L. Dougherty, A. S. Edelman, and J. M. Hyman, “Nonnegativity-, monotonicity-, or convexity-preserving cubic and quintic Hermite interpolation,” Mathematics of Computation, vol. 52, no. 186, pp. 471–494, 1989.
4. F. N. Fritsch and R. E. Carlson, “Monotone piecewise cubic interpolation,” SIAM Journal on Numerical Analysis, vol. 17, no. 2, pp. 238–246, 1980.
5. F. N. Fritsch and J. Butland, “A method for constructing local monotone piecewise cubic interpolants,” SIAM Journal on Scientific and Statistical Computing, vol. 5, no. 2, pp. 300–304, 1984.
6. L. L. Schumaker, “On shape preserving quadratic spline interpolation,” SIAM Journal on Numerical Analysis, vol. 20, no. 4, pp. 854–864, 1983.
7. J. W. Schmidt and W. Hess, “Positivity of cubic polynomials on intervals and positive spline interpolation,” BIT, vol. 28, no. 2, pp. 340–352, 1988.
8. M. Sarfraz, “Visualization of positive and convex data by a rational cubic spline interpolation,” Information Sciences, vol. 146, no. 1–4, pp. 239–254, 2002.
9. M. Sarfraz, M. Z. Hussain, and A. Nisar, “Positive data modeling using spline function,” Applied Mathematics and Computation, vol. 216, no. 7, pp. 2036–2049, 2010.
10. M. Z. Hussain, M. Sarfraz, and T. S. Shaikh, “Shape preserving rational cubic spline for positive and convex data,” Egyptian Informatics Journal, vol. 12, no. 3, pp. 231–236, 2011. View at: Publisher Site | Google Scholar
11. T. S. Shaikh, M. Sarfraz, and M. Z. Hussain, “Shape preserving constrained data visualization using rational functions,” Journal of Prime Research in Mathematics, vol. 7, pp. 35–51, 2011.
12. M. Tian, Y. Zhang, J. Zhu, and Q. Duan, “Convexity-preserving piecewise rational cubic interpolation,” Journal of Information and Computational Science, vol. 2, no. 4, pp. 799–803, 2005. View at: Google Scholar
13. F. Bao, Q. Sun, and Q. Duan, “Point control of the interpolating curve with a rational cubic spline,” Journal of Visual Communication and Image Representation, vol. 20, no. 4, pp. 275–280, 2009. View at: Publisher Site | Google Scholar
14. F. Bao, Q. Sun, J. Pan, and Q. Duan, “Point control of rational interpolating curves using parameters,” Mathematical and Computer Modelling, vol. 52, no. 1-2, pp. 143–151, 2010.
15. Q. Duan, F. Bao, S. Du, and E. H. Twizell, “Local control of interpolating rational cubic spline curves,” Computer Aided Design, vol. 41, no. 11, pp. 825–829, 2009. View at: Publisher Site | Google Scholar
16. F. Bao, Q. Sun, J. Pan, and Q. Duan, “A blending interpolator with value control and minimal strain energy,” Computers & Graphics, vol. 34, no. 2, pp. 119–124, 2010. View at: Publisher Site | Google Scholar
17. Q. Sun, F. Bao, J. Pan, and Q. Duan, “Reconstruction of curves with minimal energy using a blending interpolator,” Mathematical Methods in the Applied Sciences, vol. 36, no. 10, pp. 1301–1309, 2013.
18. Q. Duan, X. Liu, and F. Bao, “Local shape control of the rational interpolation curves with quadratic denominator,” International Journal of Computer Mathematics, vol. 87, no. 1–3, pp. 541–551, 2010.
19. J. A. Gregory, M. Sarfraz, and P. K. Yuen, “Interactive curve design using ${C}^{2}$ rational splines,” Computers & Graphics, vol. 18, no. 2, pp. 153–159, 1994. View at: Publisher Site | Google Scholar
20. J. Pan and Q. Sun, “Shape control of the curves using rational cubic spline,” Journal of Computational Information Systems, vol. 9, pp. 5861–5868, 2013. View at: Google Scholar
21. S. A. A. Karim and V. P. Kong, “Shape preserving interpolation using rational cubic spline,” to be published in Research Journal of Applied Sciences, Engineering and Technology, 2014. View at: Google Scholar
22. S. A. A. Karim and V. P. Kong, “Monotonicity-preserving using rational cubic spline interpolation,” to be published in Research Journal of Applied Sciences, 2014. View at: Google Scholar
23. S. A. A. Karim and V. P. Kong, “Convexity-preserving using rational cubic spline interpolation,” to be published in Research Journal of Applied Sciences, Engineering and Technology, 2014. View at: Google Scholar
24. U. Bashir and J. M. Ali, “Data visualization using rational trigonometric spline,” Journal of Applied Mathematics, vol. 2013, Article ID 531497, 10 pages, 2013.
25. Q. Duan, H. Zhang, Y. Zhang, and E. H. Twizell, “Bounded property and point control of a bivariate rational interpolating surface,” Computers & Mathematics with Applications, vol. 52, no. 6-7, pp. 975–984, 2006.