RESEARCH COMMONS
LIBRARY

A New Algorithm for Unstable Three Terms Recurrence Relations

ResearchCommons/Manakin Repository

A New Algorithm for Unstable Three Terms Recurrence Relations

Show simple item record

dc.contributor.author Sivasundaram, S. en
dc.contributor.author Trigiante, D. en
dc.date.accessioned 2010-06-08T16:55:46Z en
dc.date.available 2010-06-08T16:55:46Z en
dc.date.issued 1985-09 en
dc.identifier.uri http://hdl.handle.net/10106/2382 en
dc.description.abstract A modified version of Miller's and Olver's algorithm based on the "double sweep" method is presented. It is very stable in both directions and automatically controls the maximum number of steps to be used. en
dc.language.iso en_US en
dc.publisher University of Texas at Arlington en
dc.relation.ispartofseries Technical Report;237 en
dc.subject Double sweep method en
dc.subject Miller's algorithm en
dc.subject Numerical analysis en
dc.subject Algorithm en
dc.subject.lcsh Mathematics Research en
dc.title A New Algorithm for Unstable Three Terms Recurrence Relations en
dc.type Technical Report en
dc.publisher.department Department of Mathematics en

Files in this item

Files Size Format View Description
MathTechReport237.pdf 400.0Kb PDF View/Open PDF

This item appears in the following Collection(s)

Show simple item record

Browse

My Account

Statistics

About Us