Solving Nonlinear Transcendental Equations by Iterative Methods with Conformable Derivatives: A General Approach

: In recent years, some Newton-type schemes with noninteger derivatives have been proposed for solving nonlinear transcendental equations by using fractional derivatives (Caputo and Riemann–Liouville) and conformable derivatives. It has also been shown that the methods with conformable derivatives improve the performance of classical schemes. In this manuscript, we design point-to-point higher-order conformable Newton-type and multipoint procedures for solving nonlinear equations and propose a general technique to deduce the conformable version of any classical iterative method with integer derivatives. A convergence analysis is given and the expected orders of convergence are obtained. As far as we know, these are the ﬁrst optimal conformable schemes, beyond the conformable Newton procedure, that have been developed. The numerical results support the theory and show that the new schemes improve the performance of the original methods in some aspects. Additionally, the dependence on initial guesses is analyzed, and these schemes show good stability properties.


Introduction
Fractional calculus dates back to shortly after the appearance of the classical one, when Leibniz and l'Hôpital came up with the concept of the half-derivative in 1695. Since then, some definitions of fractional and non fractional derivatives which preserve many properties of classical calculus have been introduced, and many real problems can be modeled by using these derivatives [1][2][3].
In recent papers, some fractional Newton-type iterative procedures with Caputo and Riemann-Liouville derivatives (see [4][5][6][7][8][9]), and fractal Newton-type iterative methods (see [10]), have been designed in order to find the solutionx ∈ R of a nonlinear function f (x), where f :I ⊆ R → R is a continuous function in I ⊆ R, but the theoretical order of convergence is neither preserved nor held in practice. Additionally, optimal conformable Newton-type schemes were proposed in [11,12] (in scalar and vectorial versions, respectively) by using the conformable derivative/Jacobian, and the order of convergence was obtained in theory and in practice too. As far as we know, there are no optimal conformable multipoint iterative methods in the literature. In using the conformable derivative in this work, we have three targets: obtain high-order optimal conformable Newton-type procedures (in the sense of Kung-Traub's conjecture [13]) based on the method in [11], devise a general technique to obtain the conformable version of any classical scheme, and compare each one of these procedures with its classical version. With the proposed technique, we are able to generate optimal conformable multipoint methods with an arbitrary order of convergence starting with any non-conformable optimal iterative scheme.
First, let us introduce some concepts related to conformable calculus. The left conformable derivative of a function f : [a, ∞) → R starting from a of order α ∈ (0, 1], α, a, x ∈ R, a < x, is defined as [14,15] (T a α f )(x) = lim If the limit in (1) exists, f is said to be α-differentiable. If f is differentiable, (T a α f )(x) = (x − a) 1−α f (x). If f is α-differentiable in (a, b), for some b ∈ R, (T a α f )(a) = lim x→a + (T a α f )(x). The left conformable derivative holds the property of the nonfractional derivative, T a α K = 0, where K is a constant. This derivative does not require the evaluation of special functions, as Gamma or Mittag-Leffler functions do, as it uses fractional derivatives, as in Riemann-Liouville or Caputo functions.
The next result provides a suitable Taylor power series of a function f (x), where the conformal derivatives start from a point a, distinct from another point a 1 where they are evaluated.
The following result states the quadratic order of convergence obtained in [11] by using the Taylor power series (3) for simple roots (multiplicity m = 1).
Theorem 2 (see [11]). Let f : I ⊆ R → R be a continuous function in the interval I ∈ R containing the zerox of f (x). Let (T a α f )(x) be the conformable derivative of f (x) starting from a, of order α, α ∈ (0, 1]. Let us suppose that (T a α f )(x) is continuous and not null atx. If an initial approximation x 0 is sufficiently close tox, then the local order of convergence of the conformable Newton-type method is at least 2, where 0 < α ≤ 1, and the error equation is being C CO , j = 2, 3, 4, . . .
In [12], it is shown that the asymptotic error constant of the error equation in (5) may be expressed as where , j = 2, 3, 4, . . . , with this being the classical asymptotic error constant.
Morover, it is also shown in [12] that the error equation of scheme (4), by using the classical Taylor series, is concluding that error equations in (5) and (7) are equivalents, no matter if the Taylor power series (3) or the classical one are used in convergence analysis. So, we are going to use classical Taylor expansions in convergence analysis later. Moreover, when α = 1, the classical Newton procedure is obtained in (4), as well as its error equation in (5) and (7). Knowing that the asymptotic error constant C of an iterative method φ(x) of order p is defined as (see [17]) the following result allows us to calculate the asymptotic error constant of an iterative scheme of order p if we know the asymptotic error constant of another iterative procedure of order p.
Theorem 3 (Theorem 2-8, [17]). Let φ 1 (x), φ 2 (x) be of order p whose solutionx is of multiplicity m ≥ 1. Let Let C 1 , C 2 be the asymptotic error constants of φ 1 and φ 2 , respectively. Then, We also confirm Theorem 3 for the conformable version of multipoint methods given later. In all our methods, we consider multiplicity m = 1.
In the next section, we derive three higher-order Newton-type schemes. We also provide a technique to obtain the conformable version of any classical method, and it is applied to derive some conformable multipoint schemes. The convergence analysis of all the proposed conformable methods is presented in Section 3; the numerical results and numerical stability are discussed in Section 4, showing good numerical performance and improving the original methods in some aspects of both convergence and stability; and some conclusions are given in Section 5.

From One-Point to Multipoint Conformable Methods
In order to deduce higher-order schemes by means of a modification of the conformable Newton scheme (4), we need its error equation in (7), but up to order four. Let us remark that this expression depends on a and α, In a first approximation, we want to find a value of α that nulls the quadratic term in (11), so By considering α k and iterate x k as approximations of α and the solutionx, respectively, Therefore, we can define a new iterative scheme that can improve the performance of the conformable Newton scheme, which we denote by NeL3: where α k is described by (12). In a second approximation, we use a to improve the order of convergence, so Then, an estimation of a is obtained by means of the expression Replacing a in (4) by (14) we obtain a new procedure, and we denote it as NeA3: where a k is described by (14). However, we can consider simultaneously how to define a and α in order to cancel not only the quadratic but also the cubic term of the error equation of the conformable Newton scheme. Solving the resulting nonlinear system generated, for α and a as unknowns, we obtain Considering α k and iterate x k as approximations of α and the solutionx, respectively, α k can be estimated at each iteration by Moreover, a is So, using x k as an estimation ofx, an iterative estimation of a can be calculated as Replacing α and a in (4) by (16) and (17), respectively, we obtain a new scheme, which we denote by NeLA4: where α k and a k correspond to (16) and (17), respectively. So, we have designed one-point procedures that improve the order of convergence of (4), although they use derivatives of the nonlinear function up to order four.
In [17], Traub proves that any one-point method of order p depends on the first p − 1 derivatives of f . So, in addition to the computational complexity of NeL3, NeA3, and NeLA4, another drawback is the evaluation of higher-order derivatives in their iterative schemes; this is reason why multipoint procedures are widely used in the literature (see [17,18]).
So, in order to devise a general technique to obtain the conformable version of any method, we start from the assumption that any fixed-point function coming from an iterative scheme not using conformable derivatives can be written as (see [17]) where g(x) is finite and not null, andx is a fixed point of φ. If g(x) in (19) is 1/ f (x), the classical Newton procedure is obtained. From (19) we can obtain a general representation of classical Taylor series of f aboutx up to order one, as Considering the conformable Taylor power series (3), we can obtain the conformable version of (20) as If the analytical expression of g(x) includes classical derivatives of f (x), then the analytical expression of g α (x) includes conformable derivatives of f (x). Now, isolating φ(x) from (21), we have As x is considered an estimation ofx, we finally obtain the conformable version of (19) as In (23), if g α (x) = 1/(T a α f )(x), then it corresponds to the fixed point of the conformable Newton scheme (4). So, by using (23), we can obtain the conformable version of any procedure. Therefore, to transfer an iterative scheme to its conformable version, it is necessary to identify its analytical expression of g(x) in the given classical method. In [11], we can see that the theoretical order of convergence of the classical version of Newton's procedure is held when its conformable version is analyzed. Furthermore, sometimes it presents some numerical advantages versus the classical version. By using the conformable version of Newton's scheme in [11], we have observed that • We can find the solution when classical method fails (with α = 1). • Sometimes, the conformable method requires fewer iterations than the classical scheme, and the computational order of convergence can be slightly greater. • It is possible to obtain a different root by choosing distinct values of index α, with the same initial estimation. • Complex roots can be found by starting from real initial estimates. Now, we use the procedure defined in (23) to derive the conformable version of some classical multipoint schemes. Let us consider the third-order Traub scheme [17,18] where the predictor step is In this case, from (24), we deduce that g(x) = 1 f (x) . Hence, As the conformable version of predictor (25) is (4), the conformable version of Traub's procedure is being which we denote by TeCO. On the other hand, let us consider now Chun-Kim's third-order method [18,19] where . So, , and the conformable version of Chun-Kim's scheme denoted by CKeCO is being φ 2 (x) as in (27). Now, let us consider Ostrowski's optimal fourth-order procedure [17,18] (according to Kung-Traub's conjecture [13]), where φ 1 (x) is the fixed-point function of the classical Newton method. In this case, we deduce from (30) that Therefore, , and the conformable version of Ostrowski's scheme, denoted by OeCO, is being φ 2 (x) described by (27). Finally, let us consider another fourth-order optimal procedure, Chun's method designed in [18], where φ 1 (x) is the iteration function of the classical Newton scheme. In this case, we deduce from (32), , and the conformable version of Chun's scheme, denoted by CeCO, is described by being φ 2 (x) defined by (27).
In the next section, the convergence analysis of these procedures, both point-to-point and multipoint, is performed.

Convergence Analysis
First, let us remember that we are going to use classical Taylor expansions in convergence analysis, due to the direct relation between classical and conformable expansions. The requirements guaranteeing the convergence of point-to-point scheme NeL3 are stated in the following result.
Theorem 4. Let f : I ⊆ R → R be a continuous function in the interval I containing the zerox of f (x). Let (T a α k f )(x) be the conformable derivative of f (x) starting from a, with order α k . Let us suppose that (T a α k f )(x) is continuous and not null atx. If an initial approximation x 0 is sufficiently close tox, then the local order of convergence of the conformable Newton-type scheme (NeL3) is at least 3, and its error equation is Proof. This scheme has been designed by replacing α in the conformable Newton scheme by α k . Then, the error equation of NeL3 can be obtained by just replacing α in the error equation given in (11) by the Taylor expansion of α k , defined in (12).
The Taylor expansions of f (x k ) and f (x k ) aroundx can be expressed as The expansion of the product ( Hence, Replacing α in (11) by the Taylor expansion of α k , we finally have This completes the proof.
Now, let us prove the third-order convergence of NeA3 under the conditions stated in the next result.
Theorem 5. Let f : I ⊆ R → R be a continuous function in the interval I containing the zerō x of f (x). Let (T a k α f )(x) be the conformable derivative of f (x) starting from a k , with order α, for any α ∈ (0, 1). Let us suppose that (T a k α f )(x) is continuous and not null atx. If an initial approximation x 0 is sufficiently close tox, then the local order of convergence of the conformable Newton-type scheme (NeA3) is at least 3 for 0 < α < 1, and the error equation is Proof. In a similar way as in Theorem 4, the expansion of the quotient Then, So, the expansion of a k can be expressed as Replacing a in (11) by the Taylor expansion of a k , we have where α = 1. This completes the proof.
Let us remark that when α = 1 in NeA3, we obtain the classical Newton scheme. Analogously, the convergence hypothesis of NeLA4 are stated in the following result.
Theorem 6. Let f : I ⊆ R → R be a continuous function in the interval I containing the zerox of f (x). Let (T a k α k f )(x) be the conformable derivative of f (x) starting from a k , with order α k . Let us suppose that (T a k α k f )(x) is continuous and not null atx. If an initial approximation x 0 is sufficiently close tox, then the local order of convergence of the conformable Newton-type procedure (NeLA4) is at least 4, and the error equation is Proof. The Taylor expansions of f (x k ), f (x k ) and f (x k ) around the rootx allow us to calculate the expansion of the following products: Hence, for α k it results that and for a k we have Replacing α and a in (11) by the Taylor expansions of α k and a k , respectively, we have This completes the proof of the fourth-order of convergence.
Let us notice that, although NeLA4 has an order of convergence of four, it uses four functional evaluations per iteration, so it is not an optimal method. We proceed now with the convergence analysis of those multipoint conformable methods defined in the previous section.
starting from a, with order α, for any α ∈ (0, 1]. Let us suppose that (T a α f )(x) is continuous and not null atx. If an initial approximation x 0 is sufficiently close tox, then the local order of convergence of the conformable Traub-type procedure (TeCO) is at least 3, and the error equation is , for j ≥ 2, such that a < x k , ∀k.
Proof. The generalized binomial Theorem for noninteger powers is given by [20] ( The Taylor expansion of y k up to order three is given by the error equation in (11) as So, the expansion of f (y k ) is Then, By using again the generalized binomial theorem, the expansion of (y k − a) α results in Finally, as x k+1 =x + e k+1 , the error equation is This completes the proof.
Let us now prove the convergence condition for the CKeCO scheme.
Theorem 8. Let f : I ⊆ R → R be a continuous function in the interval I containing the zerox of f (x). Let (T a α f )(x) be the conformable derivative of f (x) starting from a, with order α, for any α ∈ (0, 1]. Let us suppose that (T a α f )(x) is continuous and not null atx. If an initial approximation x 0 is sufficiently close tox, then the local order of convergence of the conformable Chun-Kim-type scheme (CKeCO) is at least 3, and the error equation is , for j ≥ 2, such that a < x k , ∀k.
Proof. Let us use the Taylor expansions calculated in the proof of Theorem 7. So, the expansion of (T a α f )(y k ) is Therefore, Using the generalized binomial Theorem again, Finally, the error equation is and this completes the proof.
Since the error equation of the classical Traub and Chun-Kim procedures are, respectively, and Theorem 3 is confirmed for conformable iterative schemes, and our procedure's ability to transform these non-optimal integer procedures to conformable ones is also supported.
Theorem 9. Let f : I ⊆ R → R be a continuous function in the interval I containing the zerox of f (x). Let (T a α f )(x) be the conformable derivative of f (x) starting from a, with order α, for any α ∈ (0, 1]. Let us suppose that (T a α f )(x) is continuous and not null atx. If an initial approximation x 0 is sufficiently close tox, then the local order of convergence of the conformable Ostrowski-type method (OeCO) is at least 4, and the error equation is , for j ≥ 2, such that a < x k , ∀k.
Proof. Taking profit of the previous expansion, up to order four, we can expand the different factors that compose the iterative expression of the OeCO scheme. Then, and Hence, Using the generalized binomial theorem, the expansion of (y k − a) α results in Therefore, Finally, This completes the proof. Now, we analyze the convergence of the conformable Chun method in the following result.
Theorem 10. Let f : I ⊆ R → R be a continuous function in the interval I containing the zerox of f (x). Let (T a α f )(x) be the conformable derivative of f (x) starting from a, with order α, for any α ∈ (0, 1]. Let us suppose that (T a α f )(x) is continuous and not null atx. If an initial approximation x 0 is sufficiently close tox, then the local order of convergence of the conformable Chun-type method (CeCO) is at least 4, and the error equation is , for j ≥ 2, such that a < x k , ∀k.
Proof. We can make use of the Taylor expansions presented in Theorem 9 so that the calculations of some elements of the iterative expressions are the same. So, Using the generalized binomial theorem again, and finally, This completes the proof.
Since the error equations of the classical Ostrowski and Chun schemes are and respectively, Theorem 3 and our proposed technique are again confirmed for these fourthorder conformable schemes. Moreover, let us remark that OeCO and CeCO are the first optimal multipoint conformable procedures, according to Kung and Traub's conjecture [13]. In next section, we perform some numerical tests with some nonlinear equations, and we study the stability of these methods proposed; in the case of multipoint methods, a comparison with the classical version (when α = 1) is made.

Numerical Tests
The following results were obtained by using Matlab R2020a with the double-precision arithmetic, | f (x k+1 )| < 10 −8 or |x k+1 − x k | < 10 −8 , as the stopping criterion, and at most 500 iterations. We also used the Approximated Computational Order of Convergence (ACOC), denoted by ρ, , k = 2, 3, . . . , and defined in [22], in order to check that the theoretical order of convergence is attained in practice.
We are going to test four nonlinear functions to draw a comparison between one-point and multipoint procedures; we also compare these results with the Matlab Toolbox fsolve. In the case of methods whose a is not computed in each iteration (NeL3, TeCO, CKeCO, OeCO, and CeCO) we choose a = −10 to ensure that a < x k ∀k.
For each test function, we calculate, in addition to its respective conformable derivative, its classical derivatives of orders one, two, and three because they are necessary for schemes NeL3, NeA3, and NeLA4.
For each test function we show two tables: first, the results of one-point procedures (NeA3, NeL3, and NeLA4) and fsolve, then, the results of multipoint methods (TeCO, CKeCO, OeCO, and CeCO). We remark that α is not used by fsolve, and this tool provides x, | f (x k+1 )| and the number of iterations (iter). For each pair of tables, the same initial estimate x 0 is used, as well as equispaced values of α ∈ (0, 1] for schemes whose α is not computed in each iteration (NeA3, TeCO, CKeCO, OeCO, and CeCO).
Our first test function is f 1 (x) = −12.84x 6 − 25.6x 5 + 16.55x 4 − 2.21x 3 + 26.71x 2 − 4.29x − 15.21, with real and complex rootsx 1 = 0.82366 + 0.24769i,x 2 = 0.82366 − 0.24769i, x 3 = −2.62297,x 4 = −0.584,x 5 = −0.21705 + 0.99911i, andx 6 = −0.21705 − 0.99911i. The necessary derivatives for this function are In Table 1, NeA3 can require fewer (but also more) iterations when α = 1 than in the case that α = 1, and the computational order of convergence is around the theoretical third-order of convergence. It may be slightly greater for low values of α. When α = 1, ρ is close to 2 as in this case the scheme is reduced to the classical Newton procedure (see Theorem 5). We also see that NeL3 and NeLA4 improve the classical Newton method as well in the number of iterations required and in the computational order of convergence.
In Table 2, TeCO requires fewer iterations than the classical Traub scheme (when α = 0.8 and α = 0.9 regarding the case that α = 1). ρ is around 3 in most of cases, although it reaches the maximum number of iterations for low values of α. We also observe that the classical Chun-Kim procedure does not find any solution, whereas CKeCO converges for some values of α, and the computational order of convergence is around 3 in most cases. No results are shown when α = 0.1 because it converges to a point which is not a solution of f 1 (x). OeCO presents a similar behavior compared to the classical Ostrowski method, even though ρ is not expected. CeCO can require fewer iterations than the classical Chun scheme, and the computational order of convergence tends to be 4; again, no results are shown when α = 0.1 because it converges to a point which is not a solution of f 1 (x). Table 1. Results of one-point methods and fsolve for f 1 (x), with initial estimate x 0 = 1.

NeA3
Method  Table 2. Results of multipoint methods for f 1 (x), with initial estimate x 0 = 1.  We can see that in Tables 1 and 2 a solution is found in most of cases, whereas fsolve does not find any solution with this initial estimate. Of course, if we change the initial estimation to a complex one, fsolve will find any root.

TeCO Method CKeCO Method
The second test function is f 2 (x) = ix 1.8 − x 0.9 − 16, with complex rootsx 1 = 2.90807 − 4.24908i, andx 2 = −3.85126 + 1.74602i. The necessary derivatives for this function are In Table 3, NeA3 can require fewer iterations when α = 1, ρ is around 3, and the computational order of convergence is 2 when α = 1, supporting the theory. We can observe that NeL3 and NeLA4 improve the classical Newton procedure in the number of iterations required and the estimated order of convergence ρ.
In Table 4, TeCO and CKeCO require fewer iterations than the classical Traub method and Chun-Kim's scheme, respectively (in some cases), and the computational order of convergence is around 3 for any α in both procedures. OeCO does not improve the classical Ostrowski method in terms of the number of iterations and ρ. CeCO presents a similar behavior compared to the classical Chun scheme in some cases, and in other cases the computational order of convergence can be slightly greater.
We can observe that in Tables 3 and 4 our methods converge in fewer iterations than fsolve in many cases.
Our third test function is f 3 (x) = e x − 1, with real rootx 1 = 0. The necessary derivatives for this function are Table 3. Results of one-point methods and fsolve for f 2 (x), with initial estimate x 0 = 0.5.

NeA3
Method  Table 4. Results of multipoint methods for f 2 (x), with initial estimate x 0 = 0.5.

TeCo Method CKeCO
Method  In Table 5, NeA3 requires fewer iterations when α = 1, and ρ is around 3. When α = 1, the computational order of convergence is 2, as expected. We observe that NeL3 improves NeA3 in the number of iterations required, with ρ being around 3. NeLA4 does not work for this function because f 3 (x) = f 3 (x) = f 3 (x), and this involves singularities in (16) and (17).
In Table 6, TeCO, CKeCO, OeCO, and CeCO present a very similar behaviors compared to their classical versions, respectively, and the computational order of convergence is as expected in each case. Table 5. Results of one-point methods and fsolve for f 3 (x), with initial estimate x 0 = 1.5.

NeA3
Method  Table 6. Results of multipoint methods for f 3 (x), with initial estimate x 0 = 1.5.

TeCO Method CKeCO
Method  We can note that in Tables 5 and 6 our methods converge in fewer iterations than fsolve in all cases.
Finally, the fourth test function is f 4 (x) = sin(10x) − 0.5x + 0.2, with real roots In Table 7, NeA3 requires fewer iterations for most of values when α = 1, and ρ is around 3 or greater. When α = 1, the computational order of convergence is around 2. We observe that NeLA4 improves the classical Newton procedure as well in the number of iterations and in terms of the computational order of convergence, ρ. No results are shown for NeL3 because it converges to a point which is not solution of f 4 (x).
In Table 8, TeCO, CKeCO, OeCO, and CeCO present very similar behavior compared to their classical versions, respectively, and the computational order of convergence is greater than expected by using TeCO, CKeCO, and CeCO. ρ cannot be provided when using OeCO because at least three iterations are needed to compute it.
We can see that in Tables 7 and 8 our methods converge in fewer iterations than fsolve in most of cases. Table 7. Results of one-point methods and fsolve for f 4 (x), with initial estimate x 0 = 2.

Numerical Stability
We are now going to analyze the dependence on the initial estimates of the methods proposed in this work. For NeA3, TeCO, CKeCO, OeCO, and CeCO, whose α is fixed in each iteration, we use convergence planes, defined in [23]. In these planes, we use a 400 × 400 grid, where the horizontal axis corresponds to initial estimate x 0 , and the vertical axis corresponds to α ∈ (0, 1]. Each color represents a different solution found with a tolerance of 10 −3 , and it is painted in black when no solution is found in 500 iterations. Moreover, for each convergence plane, we calculate the percentage of converging pairs (x 0 , α) in order to compare the efficiency of the schemes.
In Figure 1, we observe that NeA3 and OeCO almost reach a 100% convergence, TeCO and CeCO attain around 94% convergence, and CKeCO obtains around 77% convergence; all roots are found in each plane.
In Figure 2, we see that every procedure almost reaches 100% convergence, and all roots are found in each plane. In Figure 3, we note that NeA3, TeCO, CKeCO, and CeCO attain between 53% and 59% convergence, whereas OeCO obtains around 74% convergence. In this case, considering that −10 ≤ x 0 ≤ 10, and a = −10, we point out that stability could be slightly improved if we choose a < −10.
In Figure 4, we can see that NeA3 and CKeCO reach between 42% and 48% convergence, TeCO and CeCO attain between 62% and 66% convergence, and OeCO obtains around 74% convergence; again, all roots are found in each plane.         In order to visualize the dependence on the initial estimates of NeL3 and NeLA4, with α k calculated in each iteration, we use dynamical planes. These planes are constructed with the real part of the initial estimate x 0 in the horizontal axis, and the imaginary part in the vertical axis. As in convergence planes, we use a 400 × 400 grid, a tolerance of 10 −3 , and at most 500 iterations. In these cases, we use real and complex polynomials whose roots are known, which are represented with "white crosses" on each plane.
In general, we observe that NeL3 and NeLA4 tend to converge to one root in most planes. NeL3 converges to both roots in Figure 5, but convergence is not guaranteed in most planes because it obtains many nonconverging complex initial estimations (Re(x 0 ), Im(x 0 )), whereas in NeLA4 most initial guesses converge to one root. Performance of methods NeL3 and NeLA4 on p i (z), i = 2, 3, 4 is similar (see Figures 6-8).

Conclusions
In this manuscript, three one-point conformable Newton-type methods have been designed (NeL3, NeA3, and NeLA4), and their convergence analysis has been performed, improving the quadratic order of the starting scheme. None of these procedures are optimal because they require the evaluation of higher-order derivatives. On the other hand, a general technique has been provided so as to obtain the conformable version of any iterative method; later, this technique was used to derive the conformable version of four multipoint classical schemes (TeCO, CKeCO, OeCO, and CeCO), where two of them are the first optimal multipoint conformable procedures in the literature (OeCO and CeCO), holding an order of convergence equal to that of the classical case. So, the technique is supported by the results obtained. Numerical tests were performed, and the dependence on initial estimates was analyzed by visualizing convergence and dynamical planes. We observed that, in general, these methods can converge when the classical ones fail, or in fewer iterations in some cases. Additionally, the theoretical order of convergence is obtained in practice, tending to equal or improve that of classical multipoint schemes. We also see that it is possible to obtain real or complex roots with real initial estimates, and that we can obtain different roots by choosing a different value of α and the same initial estimation. These methods found a solution when fsolve failed, and required fewer iterations than the Matlab Toolbox in most cases. Finally, most of the planes in this work confirm that these procedures have, in general, good stability properties in terms of the wideness of basins of attraction of the roots, and all roots are found in most of such planes.