Repository logo
 

Some results concerning the fundamental nature of Wynn's vector epsilon algorithm

dc.contributor.committeeMemberDolovich, Allan T.en_US
dc.creatorSteele, John Arthuren_US
dc.date.accessioned2008-12-12T13:14:20Zen_US
dc.date.accessioned2013-01-04T05:10:19Z
dc.date.available2009-12-16T08:00:00Zen_US
dc.date.available2013-01-04T05:10:19Z
dc.date.created2001-01en_US
dc.date.issued2001-01-01en_US
dc.date.submittedJanuary 2001en_US
dc.description.abstractIn this thesis, Wynn's Vector Epsilon Algorithm (VEA) is examined. Although the usefulness of this sequence-to-sequence transformation for inducing and enhancing convergence in vector sequences has been amply demonstrated by others, it is still not well understood. After reviewing some known important theoretical results for the VEA and its kernel (the full set of vector sequences which the VEA transforms to give a constant vector sequence), the author provides a sufficient and necessary condition for membership of a vector sequence in the real part of the kernel of the 1st order VEA. This kernel is shown to be the set of all real vector sequences {xn} converging toward, orbiting, or diverging away from some vector x where each term of the error sequence {xn-x} is a scaled and/or rotated version of the previous term of the error sequence, called λR sequences. This result is contrasted with one by McLeod and Graves-Morris. It is then shown that λR sequences may also be described as those sequences {xn} whose terms satisfy xn = x + znw + zn w where z ≠ 0, z ≠ 1, ||w|| > 0, and < w, w >= 0. Numerical experiments by the author on vector sequences generated by the formula xn=Axn-1+b are reported. Circumstances are found under which the VEA order of such sequences is lower than the upper bound given by Brezinski. The reduction is triggered by the presence of certain orthogonal relationships between eigenvector and generalised eigenvector components whose corresponding Jordan blocks in the Jordan canonical form of A have complex conjugate eigenvalues. This empirical result anticipates the complex kernel of the 1st order VEA which is shown to be every sequence {xn} whose terms satisfy xn = x + znw₁ + znw₂ with z ≠ 0, z ≠ 1, ||w₁|| + ||w₂|| > 0, and < w₁,w₂ > = 0 and no others. Some remaining open questions are noted in the final chapter.en_US
dc.identifier.urihttp://hdl.handle.net/10388/etd-12122008-131420en_US
dc.language.isoen_USen_US
dc.titleSome results concerning the fundamental nature of Wynn's vector epsilon algorithmen_US
dc.type.genreThesisen_US
dc.type.materialtexten_US
thesis.degree.departmentMechanical Engineeringen_US
thesis.degree.disciplineMechanical Engineeringen_US
thesis.degree.grantorUniversity of Saskatchewanen_US
thesis.degree.levelDoctoralen_US
thesis.degree.nameDoctor of Philosophy (Ph.D.)en_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Steele_John_Arthur_2002.pdf
Size:
4.82 MB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
905 B
Format:
Plain Text
Description: