# Simple rational approximation

﻿
Simple rational approximation

Simple rational approximation (SRA) is a subset of interpolating methods using rational functions. Especially, SRA interpolates a given function with a specific rational function whose poles and zeros are simple, which means that there is no multiplicity in poles and zeros. Sometimes, it only implies simple poles.

The main application of SRA lies in finding the zeros of secular functions. A divide-and-conquer algorithm to find the eigenvalues and eigenvectors for various kinds of matrices is well-known in numerical analysis. In a strict sense, SRA implies a specific interpolation using simple rational functions as a part of the divide-and-conquer algorithm. Since such secular functions consist of a series of rational functions with simple poles, SRA is the best candidate to interpolate the zeros of the secular function. Moreover, based on previous researches, a simple zero that lies between two adjacent poles can be considerably well interpolated by using a two-dominant-pole rational function as an approximating function.

One-point third-order iterative method: Halley's formula

The origin of the interpolation with rational functions can be found in the previous work done by Edmond Halley. Halley's formula is known as one-point third-order iterative method to solve $,f\left(x\right)=0$ by means of approximating a rational function defined by:$h\left(z\right)=frac\left\{a\right\}\left\{z+b\right\}+c.$We can determine a, b, and c so that :$h^\left\{\left(i\right)\right\}\left(x\right)=f^\left\{\left(i\right)\right\}\left(x\right), qquad i=0,1,2.$Then solving $,h\left(z\right)=0$ yields the iteration:$x_\left\{n+1\right\}=x_\left\{n\right\}-frac\left\{f\left(x_n\right)\right\}\left\{f\text{'}\left(x_n\right)\right\} left\left(\left\{frac\left\{1\right\}\left\{1-frac\left\{f\left(x_n\right)f"\left(x_n\right)\right\}\left\{2\left(f\text{'}\left(x_n\right)\right)^2\right\} ight\right).$This is referred to as Halley's formula.This "geometrical interpretation" $h\left(z\right)$ was derived by Gander(1978), where the equivalent iteration also was derived by applying Newton's method to:$g\left(x\right)=frac\left\{f\left(x\right)\right\}\left\{sqrt\left\{f\text{'}\left(x\right)=0.$We call this "algebraic interpretation" $g\left(x\right)$ of Halley's formula.

One-point second-order iterative method: Simple rational approximation

Similarly, we can derive a variation of Halley's formula based on a one-point "second-order" iterative method to solve $,f\left(x\right)=alpha\left( eq 0\right)$ using simple rational approximation by:$h\left(z\right)=frac\left\{a\right\}\left\{z+b\right\}.$Then we need to evaluate:$h^\left\{\left(i\right)\right\}\left(x\right)=f^\left\{\left(i\right)\right\}\left(x\right), qquad i=0,1.$Thus we have:$x_\left\{n+1\right\}=x_\left\{n\right\}-frac\left\{f\left(x_n\right)-alpha\right\}\left\{f\text{'}\left(x_n\right)\right\} left\left(frac\left\{f\left(x_n\right)\right\}\left\{alpha\right\} ight\right).$The algebraic interpretation of this iteration is obtained by solving :$g\left(x\right)=1-frac\left\{alpha\right\}$f(x)=0.This one-point second-order method is known to show a locally quadratic convergence if the root of equation is simple.SRA strictly implies this one-opint second-order interpolation by a simple rational function.

We can notice that even third order method is a variation of Newton's method. We see the Newton's steps are multiplied by some factors. These factors are called the "convergence factors" of the variations, which are useful for analyzing the rate of convergence. See Gander(1978).

References

* James W. Demmel, "Applied numerical linear algebra," Society for Industrial and Applied Mathematics, 1997. ISBN 0-89871-389-7
* S. Elhay, G. H. Golub and Y.M. Ram, "The spectrum of a modified linear pencil", "Computers and Mathematics with Applications", vol. 46, pp. 1413-1426, 2003.
* M. Gu and S. Eisenstat, "A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem," "SIMAX", vol. 16, no. 1, pp. 172-191, 1995.
* Walter Gander, "On the linear least squares problem with a quadratic constraint," Stanford University, School of Humanities and Sciences, Computer Science Dept., 1978.

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Approximation in algebraic groups — In mathematics, strong approximation in linear algebraic groups is an important arithmetic property of matrix groups. In rough terms, it explains to what extent there can be an extension of the Chinese remainder theorem to various kinds of… …   Wikipedia

• List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

• List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

• Characteristic polynomial — This article is about the characteristic polynomial of a matrix. For the characteristic polynomial of a matroid, see Matroid. For that of a graded poset, see Graded poset. In linear algebra, one associates a polynomial to every square matrix: its …   Wikipedia

• Continued fraction — Finite continued fraction, where a0 is an integer, any other ai are positive integers, and n is a non negative integer. In mathematics, a continued fraction is an expression obtained through an iterative process of representing a number as the… …   Wikipedia

• Indian mathematics — mdash;which here is the mathematics that emerged in South Asia from ancient times until the end of the 18th century mdash;had its beginnings in the Bronze Age Indus Valley civilization (2600 1900 BCE) and the Iron Age Vedic culture (1500 500 BCE) …   Wikipedia

• Methods of computing square roots — There are several methods for calculating the principal square root of a nonnegative real number. For the square roots of a negative or complex number, see below. Contents 1 Rough estimation 2 Babylonian method 2.1 Example …   Wikipedia

• Approximations of π — Timeline of approximations for pi …   Wikipedia

• Mathematical coincidence — This article is about numerical curiosities. For the technical mathematical concept of coincidence, see coincidence point. A mathematical coincidence can be said to occur when two expressions show a near equality that lacks direct theoretical… …   Wikipedia

• Squaring the circle — Squaring the circle: the areas of this square and this circle are equal. In 1882, it was proven that this figure cannot be constructed in a finite number of steps with an idealized compass and straightedge …   Wikipedia