Go to  Advanced Search

Jacobi polynomial truncations and approximate solutions to classes of nonlinear differential equations

Show simple item record

dc.contributor.author Dodd, Ronald Edward
dc.date.accessioned 2011-09-29T20:50:45Z
dc.date.available 2011-09-29T20:50:45Z
dc.date.copyright 1966
dc.date.issued 2011-09-29
dc.identifier.uri http://hdl.handle.net/2429/37717
dc.description.abstract Solutions to classes of second-order, nonlinear differential equations of the form [formula omitted] + f(x) + 0, x(0) = 1, x(∙)(0) = 0 are approximated in this work. The techniques which are developed involve the replacement of the characteristic, f(x), in the nonlinear model by piecewise-linear or piecewise-cubic approximations. From these, closed-form time solutions in terms of the circular trigonometric functions or the Jacobian elliptic functions may be obtained. Particular examples in which f(x) is grossly nonlinear and asymmetric are considered. The orthogonal Jacobi and shifted Jacobi polynomials are introduced for the approximation in order to satisfy criteria which are imposed on the error and on the use of symmetry. Error bounds are then developed which demonstrate that the maximum error in the normalized time solution is bounded, no matter how large the coefficients of the non-linear terms in the model become. Because of these error-bound results, an heuristic measure of the departure from linearity is defined for classes of symmetric oscillations, and the weighting of convergence of the Jacobi and shifted Jacobi polynomial expansions is set according to this measure. For asymmetric conservative models, shifted Chebychev polynomials are used to obtain near-uniform approximations to the characteristic in the nonlinear differential equation. Based on the equivalence of the classical approximation techniques which is given for the symmetric, conservative models, extension of the polynomial approximation to classes of non-conservative models is considered. Throughout the work, by comparison with classical approximation methods, the polynomial approximation techniques are shown to provide an improved, direct and more general attack on the approximation problem with a decrease in tedious labor. en_US
dc.language.iso eng en_US
dc.publisher University of British Columbia en
dc.relation.ispartofseries UBC Retrospective Theses Digitization Project [http://www.library.ubc.ca/archives/retro_theses/] en
dc.title Jacobi polynomial truncations and approximate solutions to classes of nonlinear differential equations en_US
dc.type Electronic Thesis or Dissertation en
dc.degree.name Master of Applied Science - MASc en_US
dc.degree.discipline Electrical and Computer Engineering en_US
dc.degree.grantor University of British Columbia en
dc.degree.campus UBCV en_US
dc.description.scholarlevel Graduate en


Files in this item

Files Size Format Description   View
UBC_1966_A7 D63.pdf 4.694Mb Adobe Portable Document Format   View/Open
 

This item appears in the following Collection(s)

Show simple item record

All items in cIRcle are protected by copyright, with all rights reserved.

UBC Library
1961 East Mall
Vancouver, B.C.
Canada V6T 1Z1
Tel: 604-822-6375
Fax: 604-822-3893