Simulating accurate and effective solutions of some nonlinear nonlocal two-point BVPs: Clique and QLM-clique matrix methods

This research work deals with two spectral matrix collocation algorithms based on (novel) clique functions to solve two classes of nonlinear nonlocal elliptic two-points boundary value problems (BVPs) arising in diverse physical models. The nonlinearity together with nonlocality makes the models so difficult to solve numerically. In both matrix methods by expanding the unknown solutions in terms of clique polynomials the nonlocality in the models is handled. In the first and direct technique, the clique coefficients are determined in an accurate way through solving an algebraic system of nonlinear equations. To get rid of the nonlinearity of the models and in order to gain efficacy, the quasilinearization method (QLM) is utilized in the second approach. In the latter algorithm named QLM-clique procedure, the first directly clique collocation method is applied to a family of linearized equations in an iterative manner. In particular, we show that the series expansion of clique polynomials is convergent exponentially in a weighted [Formula: see text] norm. Numerous numerical simulations validate the performance of two matrix collocation schemes and demonstrate the accuracy as well as the gain in computational efficiency in terms of elapsed CPU time. The proposed matrix algorithms for computation are easy to implement and straightforward, and provide more accuracy compared to other available computational values in the literature.