Orthogonal polynomials in Sobolev spaces: Computational methods
Abstract
In this thesis, I present algorithms for computing orthogonal polynomials of Sobolev type in the Sobolev space $H\sb1(R,d\lambda\sb0,d\lambda\sb1),$ and I also present sensitivity analysis for these methods. Based on this study, the behavior of the algorithms in the presence of small perturbation on the input modified moments, as observed in a number of numerical experiments, can be explained successfully. Besides, algorithms have been applied to explore the distribution of zeros of orthogonal polynomials of Sobolev type in any given Sobolev space $H\sb1(R,d\lambda\sb0,d\lambda\sb1)$ and respective conjectures have been formulated.
Degree
Ph.D.
Advisors
Gautschi, Purdue University.
Subject Area
Mathematics
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.