Acceleration of fixed-point approximations to roots of non- linear equations

Date

4-1994

Degree

Bachelor of Science in Applied Mathematics

College

College of Arts and Sciences (CAS)

Adviser/Committee Chair

Ricolindo Cariño

Abstract

The Picard iteration is used to accelerate the convergence of the fixed-point iterates. Its performance is compared to that of the e-algorithm and Levin's u-transformation which are methods used in accelerating convergence of sequences of approximations to integrals. The Aitken's A2 process is found to be inferior to both e-algorithm and Levin's u-transformation in most of the functions tested.

Language

English

Location

UPLB Main Library Special Collections Section (USCS)

Call Number

Thesis

Document Type

Thesis

This document is currently not available here.

Share

COinS