The rise and fall of the vector epsilon algorithm

Simple item page
dc.contributor.authorCoope, Ian D.
dc.contributor.authorGraves-Morris, P.R.
dc.date.accessioned2015-10-16T01:42:34Z
dc.date.available2015-10-16T01:42:34Z
dc.date.issued1992en
dc.description.abstractThe performance of the vector epsilon is governed by two important mathematical theorems which are briefly reviewed in context. We note that the performance of the vector epsilon algorithm is inevitably qualitatively incorrect for sequences whose generating functions have poles near unity. This difficulty is avoided by the use of hybrid vector Pade approximants.en
dc.identifier.urihttp://hdl.handle.net/10092/11191
dc.language.isoen
dc.publisherUniversity of Canterbury. Dept. of Mathematicsen
dc.relation.isreferencedbyNZCUen
dc.rightsCopyright Ian D. Coopeen
dc.rights.urihttps://canterbury.libguides.com/rights/thesesen
dc.subject.anzsrcField of Research::01 - Mathematical Sciencesen
dc.titleThe rise and fall of the vector epsilon algorithmen
dc.typeDiscussion / Working Papers
thesis.degree.grantorUniversity of Canterburyen
thesis.degree.levelResearch Reporten
thesis.degree.nameResearch Reporten
uc.bibnumber388176en
uc.collegeFaculty of Engineeringen
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
coope_graves-morris_report_no71_1992.pdf
Size:
466.09 KB
Format:
Adobe Portable Document Format
Download
Collections
Engineering: Reports