“…Collocation methods are very popular. They are based on splines [21,29,92,93], general approximate functions [22,82], Chebyshev polynomials [16], shifted Chebyshev polynomials [81], Bernstein polynomials [34,63], Chelyshkov Polynomials [36], Lagrange polynomials [42], Taylor polynomials [47], Fibonacci polynomials [57], Bell polynomials [65], first Boubaker polynomials [60], Müntz-Legendre polynomials [70], generalized Lucas polynomials [87], Jacobi polynomials [89], block-pulse functions [27], hybrid of block-pulse functions and Lagrange polynomials [26], hybrid block-pulse function and Taylor polynomials [41] (see also [73]), block-pulse functions and Bernoulli polynomials [45], hybrid block-pulse functions and Bernstein polynomials [62], Haar wavelets [4,66], rationalized Haar functions [19], Legendre wavelets [13,97], triangular functions [23,100], fuzzy transforms [32], Sinc function [37,40], radial basis functions [35], pseudospectral integration matrices [54] and shifted piecewise cosine basis functions [75]. Galerkin methods are also popular and are commonly used in conjunction with general approximate functions [22,82], Legendre polynomials…”