Algorithms for solving rational interpolation problems related to fast and superfast solvers for Toeplitz systems

Other

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Linearized rational interpolation problems at roots of unity play a crucial role in the fast and superfast Toeplitz solvers that we have developed. Our interpolation algorithm is a sequential algorithm in which a matrix polynomial that satisfies already some of the interpolation conditions is updated to satisfy two additional interpolation conditions. In the algorithm that we have used so far, the updating matrix, which is a matrix polynomial of degree one, is constructed in a two-step process that resembles Gaussian elimination. We briefly recall this approach and then consider two other approaches. The first one is a completely new approach based on an updating matrix that is unitary with respect to a discrete inner product that is based on roots of unity. The second one is an application of an algorithm for solving discrete least squares problems on the unit circle, a problem that has linearized rational interpolation at roots of unity as its limiting case. We conduct a number of numerical experiments to compare the three strategies.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Algorithms for solving rational interpolation problems related to fast and superfast solvers for Toeplitz systems 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 Algorithms for solving rational interpolation problems related to fast and superfast solvers for Toeplitz systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for solving rational interpolation problems related to fast and superfast solvers for Toeplitz systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-1513878

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.