Effects of Jacobi polynomials on the numerical solution of the pellet equation using the orthogonal collocation, Galerkin, tau and least squares methods

2012 ◽  
Vol 39 ◽  
pp. 1-21 ◽  
Author(s):  
Jannike Solsvik ◽  
Hugo A. Jakobsen
Author(s):  
Jannike Solsvik ◽  
Hugo Jakobsen

Two numerical methods in the family of weighted residual methods; the orthogonal collocation and least squares methods, are used within the spectral framework to solve a linear reaction-diffusion pellet problem with slab and spherical geometries. The node points are in this work taken as the roots of orthogonal polynomials in the Jacobi family. Two Jacobi polynomial parameters, alpha and beta, can be used to tune the distribution of the roots within the domain. Further, the internal points and the boundary points of the boundary-value problem can be given according to: i) Gauss-Lobatto-Jacobi points, or ii) Gauss-Jacobi points plus the boundary points. The objective of this paper is thus to investigate the influence of the distribution of the node points within the domain adopting the orthogonal collocation and least squares methods. Moreover, the results of the two numerical methods are compared to examine whether the methods show the same sensitivity and accuracy to the node point distribution. The notifying findings are as follows: i) The Legendre polynomial, i.e., alpha=beta=0, is a very robust Jacobi polynomial giving the better condition number of the coefficient matrix and the polynomial also give good behavior of the error as a function of polynomial order. This polynomial gives good results for small and large gradients within both slab and spherical pellet geometries. This trend is observed for both of the weighted residual methods applied. ii) Applying the least squares method the error decreases faster with increasing polynomial order than observed with the orthogonal collocation method. However, the orthogonal collocation method is not so sensitive to the choice of Jacobi polynomial and the method also obtains lower error values than the least squares method due to favorable lower condition numbers of the coefficient matrices. Thus, for this particular problem, the orthogonal collocation method is recommended above the least squares method. iii) The orthogonal collocation method show minor differences between Gauss-Lobatto-Jacobi points and Gauss-Jacobi plus boundary points.


Author(s):  
John Locker ◽  
P. M. Prenter

AbstractLet L, T, S, and R be closed densely defined linear operators from a Hubert space X into X where L can be factored as L = TS + R. The equation Lu = f is equivalent to the linear system Tv + Ru = f and Su = v. If Lu = f is a two-point boundary value problem, numerical solution of the split system admits cruder approximations than the unsplit equations. This paper develops the theory of such splittings together with the theory of the Methods of Least Squares and of Collocation for the split system. Error estimates in both L2 and L∞ norms are obtained for both methods.


2004 ◽  
Vol 4 (2) ◽  
pp. 206-214 ◽  
Author(s):  
Abedallah Rababah

Abstract In this paper we derive the matrix of transformation of the Jacobi polynomial basis form into the Bernstein polynomial basis of the same degree n and vice versa. This enables us to combine the superior least-squares performance of the Jacobi polynomials with the geometrical insight of the Bernstein form. Application to the inversion of the Bézier curves is given.


Sign in / Sign up

Export Citation Format

Share Document