A new algorithm for computing Pade approximants

Details A new algorithm for computing Pade approximants A new algorithm for computing Pade approximants

2011-12-24

arxiv.org/abs/1112.5694v1

Mathematics

Complex Variables

Scientific paper

In paper a new definition of reduced Pade approximant and algorithm for its computing is proposed. Our approach is based on the investigation of the kernel structure of the Toeplitz matrix. It is shown that the reduced Pade approximant always has nice properties which classical Pade approximant possesses only in the normal case. The new algorithm allows us to avoid Froissart doublets appearance induced by computer roundoff in the non-normal Pade table.

Affiliated with

Also associated with

No associations

Rating

A new algorithm for computing Pade approximants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new algorithm for computing Pade approximants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new algorithm for computing Pade approximants will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-590612