Share This Article:

On the High-Order Quasi Exactly Solvable Differential Equations

Abstract Full-Text HTML XML Download Download as PDF (Size:1725KB) PP. 234-250
DOI: 10.4236/ajcm.2019.94018    57 Downloads   120 Views  


In this paper, we present a new method for solving a class of high-order quasi exactly solvable ordinary differential equations. With this method, the computed solution is expressed as a linear combination of the canonical polynomials associated with the given differential operator. An iterative algorithm summarizing the procedure is presented and its efficiency is demonstrated through considering two applied problems.

1. Introduction

Let us consider the ordinary differential operator D of order,


where is a set of polynomials, for all, where p is a prescribed nonnegative integer called the height of D, with


This paper is concerned with the solution of the following problem: Given and, construct two polynomials, of degree n and of degree p such that the pair satisfies the following ordinary differential equation exactly


When, Equation (3) is called quasi exactly solvable (QES). This class of QES problems has applications in various fields of engineering, chemistry and quantum mechanics. Many different techniques to solve QES equations are reported in the literature: Among these are the Functional Ansatz Method, Constraint polynomial approach, asymptotic iteration method and Lie algebraic method (see [1] - [7] ). The case was also discussed very recently in [8], where the authors developed a new approach based on a special set of polynomials associated with the differential operator D called canonical polynomials. The main objective of this paper is to extend that canonical polynomials approach to solve equations of the form (3) with arbitrary order. More precisely, we present a procedure to construct a pair of polynomials based on the canonical polynomial associated with D. While the existing method for solving QES requires the solution of a nonlinear algebraic system with dimensions depending on the desired degree of y, the canonical polynomial approach presented in [8] requires a nonlinear algebraic system of dimensions depending on p only. This advantage is due to the fact that the sequence of canonical polynomials enjoys the permanence characteristic [9].

The canonical polynomials (to be explained shortly) appeared for the first time in [10] wherein Lanczos developed an efficient method, called the Tau method, to approximate the exact solution of differential equations in terms of a finite number of canonical polynomials. Later on, the concept of the canonical polynomial was generalized in [11] to develop a recursive approach of the Tau method that can apply to more complex differential equations. And it was due to the computational efficiency of the canonical polynomials that makes the Tau method more competitive compared to other existing approximation methods (more details can be found in [12] - [17] ).

Section 2 will concentrate on the construction of the canonical polynomials associated with the th differential operator (1) and on their computation. In Section 3 we present an algorithm that allows to obtain the pair of polynomials in an effective way. Two examples confirming our results are discussed in Section 4.

2. The Canonical Polynomials

Let D be the differential operator defined in (1). In this section we recall the main features of the canonical polynomials associated with D (see [11] ), and we give an algorithm for computing them. First rewrite (3):

That is

where and. So, for the sake of simplicity, we shall hide the asterisk "*" and carry out the analysis for


keeping in mind that involves the unknown coefficients of.

Definition 1. For any integer, is called a kth canonical function of D if.

The following notation will enable us to formulate the next theorem:



Theorem 1. Under the above assumptions and notation, the canonical functions associated with the differential operator (4) are formally generated by the recursion:



In particular, if and, then

Proof. For

Since D is linear, the latter yields:


If, then is an exact solution.

If, then we obtain the desired formula for:

In particular, if then

If, then is an exact solution.

If, then

This completes the proof.

For illustration, when, Equation (7) gives:


Proceeding this way, we find that for

We are able now to formulate one of the main results of this paper:

Theorem 2. For all, each can be written in the form


where is a polynomial of degree k, called a canonical polynomial associated with D, and generated by the self starting recursive formula:


and where is a linear combination of the undefined canonical polynomials, called residual, and written as,

where are sequences of constants given by the self starting recursion


Proof. This follows by an induction argument once (9) is inserted in (10) and the terms are rearranged:

yielding Equations (10) and (11) as required.

3. Construction of Solution

This section is concerned with the construction of the two polynomials that satisfy Equation (4).

Theorem 3. The above notation and assumptions hold. Suppose that the

coefficients of satisfy the following system

consisting of algebraic equations:



where are given by (11). Then


is an exact polynomial solution of Equation (4) where are parameters determined in terms of as defined in (5)-(6), and is a sequence of canonical polynomials associated with D and recursively generated by (10)

Proof. Let. Setting in Equation (8) we get


If condition (12) holds, then (5) implies that and consequently the right hand side of (15) vanishes:

In other words,

becomes an exact solution, but not necessarily an exact polynomial due to the appearance of the undefined canonical polynomials. However, in order to be an exact polynomial, must be independent of the p

undefined canonical functions. This can be achieved by an appropriate

adjustment of the p coefficients of as explained next. Using (9) in we can write:



Working out the coefficients of in (17) we find that due to Equation (13) we get:

Thus reduces to the polynomial (16)


The following corollary follows immediately from the previous theorem:

Corollary 4. If and



is an exact polynomial solution of Equation (4) where


(note that if and therefore all’s are defined).

Computational aspects

For computational purposes, one can reduce the height of D from p to zero by differentiating (4) p times. This is due to the following trivial identity:


Applying this identity to (4) we get


From (20),

Inserting the later in (18) we get


which is a differential operator of order with height 0. Therefore we can apply our results to (22) and reconstruct the solution of the original problem by an antiderivative process. This will reduce the computation cost because the residual subspace of the new operator will be 0.

4. Applications

In the section we solve two applied problems by means of Algorithm ((12)-(13)-(14)-(18)-(19)) formulated in Theorem 3:

Example 1. Modified Manning potential with parameters. Let us consider the Schrodinger’s equation


where the potential is given by

where, are given constant parameters and is an unknown parameter and E is the unknown eigenvalue. We wish to compute E and. This potential describes a double-well potential

whenever, , and which was discussed in ( [6], [7] ).

Equation (23) can be written as a 2nd order QES in the form (4) with height. Setting and

allows to write (23) as



We can reduce the height of Equation (24) from to by taking its first derivative:

which implies that




We solved Equation (25) by Algorithm ((12)-(13)-(14)) with, and.

First we use Equations (10)-(11) to compute the canonical polynomials associated with Equation (25). Here are some of them:

From (12), we have

which gives .

From (26), and therefore where takes the six values:

which are the zeros of the following polynomial

whose the plot is given in Figure 1. Further, for, we obtain obtain for the six values of are

Figure 1. Plot of whose the zeros are. Here.

The graphs of the six functions are shown in Figure 2.Example 2. The Schrodinger’s equation of invariant decatic anharmonic oscillator in N-dimensional spherical coordinates is (27)where R stands for the radial wave function. Setting transforms Equation (27) to

Figure 2. Plot of the wave function for the six values of that are the roots of that appear at the top of each plot..


where, being a positive integer.

Further, consider the transformation

where and are parameters that depend on two unknowns and:

and should computed with the eigenvalue E. This yields a second order ODE of the form (1) with height:



In order to obtain an equation with height, we differentiate it twice to get:



The canonical polynomials are obtained by recursion (10)-(11):



We have applied Algorithm ((12)-(13)-(14)) for different sets of parameters:

1) For, , , , , , , ,;, the unknown are determined by solving the following system:




Note that Equation (31) and Equation (33) are linear in and E respectively. So we compute and E in terms of and substitute their expressions in Equation (32) which gives the values of. As a result we get for two sets of solutions:

For Set 1 we have

and the exact solution of Equation (29) when


Then the wave function for is

which is plotted in Figure 3.

2) For;;;;;;;; we obtain a system of equations with unknown. This system has three sets of solutions:

Figure 3. Plot of wave function for the Set 1 ().

The exact polynomial solution of Equation (29) that corresponds to each set of the computed parameters above are:

Figure 4 shows.

3) For;;;;. Here are the results:

The exact solution that corresponds to Set 1:

Figure 4. Plot of wave function for the Set 1 ().

Figure 5. Plot of wave function for the Set 1 ().

Figure 5 shows.

5. Conclusion

In this paper we have extended the canonical polynomials approach that was developed in [8] to solve QES differential equations of arbitrary high order. While the existing methods for solving QESs require the solution of a nonlinear algebraic system whose dimensions depend on the desired degree of, our new approach requires solving a nonlinear algebraic system of dimensions depending on p, the height of the differential operator. This advantage is due to the fact that the sequence of canonical polynomials enjoys the permanence characteristic.


The financial support of the Public Authority for Applied Education and Training (PAAET), Kuwait, during this research is greatly appreciated.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

Cite this paper

Alzanki, T. , Shaaban, M. and El-Daou, M. (2019) On the High-Order Quasi Exactly Solvable Differential Equations. American Journal of Computational Mathematics, 9, 234-250. doi: 10.4236/ajcm.2019.94018.


[1] Schafke, R. and Schmidt, D. (1980) The Connection Problem for General Linear Ordinary Differential Equations at Two Regular Singular Points with Applications in the Theory of Special Functions. SIAM Journal on Mathematical Analysis, 11, 848-862.
[2] Bender, C.M. and Dunne, G.V. (1996) Quasi-Exactly Solvable Systems and Orthogonal Polynomials. Journal of Mathematical Physics, 37, 6-11.
[3] Sasaki, R., Yang, W.L. and Zhang, Y.Z. (2009) Bethe Ansatz Solutions to Quasi-Exactly Solvable Difference Equations. Symmetry, Integrability and Geometry: Methods and Applications, 5, 104.
[4] Gomez-Ullate, D., Kamran, N. and Milson, R. (2009) An Extended Class of Orthogonal Polynomials Defined by a Sturm-Liouville Problem. Journal of Mathematical Analysis and Applications, 359, 352-367.
[5] Pan, F., Klauder, J.R. and Draayer, J.P. (1999) Quasi-Exactly Solvable Cases of an N-Dimensional Symmetric Decatic Anharmonic Oscillator. Physics Letters A, 262, 131-136.
[6] Moroz, A. and Miroshnichenko, A.E. (2018) Constraint Polynomial Approach—An Alternative to the Functional Bethe Ansatz Method? arXiv:1807.11871v1.
[7] Xie, Q.-T. (2012) New Quasi-Exactly Solvable Double-Well Potentials. Journal of Physics A: Mathematical and Theoretical, 45, Article ID: 175302.
[8] El-Daou, M.K., AlZanki, T.H. and Al-Mutawa, N.S. (2019) Quasi-Exactly Solvable Differential Models: A Canonical Polynomials Approach. American Journal of Computational Mathematics, 9, 48-60.
[9] El-Daou, M.K. (2012) Duality between the Generalized Canonical Polynomials and Some Special Determinants. International Journal of Applied Mathematics, 25, 811-824.
[10] Lanczos, C. (1956) Applied Analysis. Prentice-Hall, Englewood Cliffs, NJ.
[11] Ortiz, E.L. (1969) The Tau Method. SIAM Journal on Numerical Analysis, 6, 480-492.
[12] Froes Bunchaft, M.E. (1997) Some Extensions of the Lanczos-Ortiz Theory of Canonical Polynomials in the Tau Method. Mathematics of Computation, 66, 609-621.
[13] El-Daou, M.K. and Ortiz, E.L. (1994) A Recursive Formulation of Collocation in Terms of Canonical Polynomials. Computing, 52, 177-202.
[14] El-Daou, M.K. and Ortiz, E.L. (1998) A Recursive Formulation of Galerkin Method in Terms of the Tau Method: Bounded and Unbounded Domains. Computers & Mathematics with Applications, 35, 83-94.
[15] El-Daou, M.K. and Al-Hamad, K.M. (2012) Computation of the Canonical Polynomials and Applications to Some Optimal Control Problems. Numerical Algorithms, 61, 545-566.
[16] Alexandros, G. (2016) Paraskevopoulos. Complete Bases of Canonical Polynomials and the Full Recursive Formulation of the Spectral-Tau Method.
[17] Namasivayam, S. and Ortiz, E.L. (1981) Best Approximation and the Numerical Solution of Partial Differential Equations with the Tau Method. Portugaliae mathematica, 40, 97-119.

comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.