ROBUST RATIONAL INTERPOLATION AND LEAST-SQUARES
An efficient and robust algorithm and aMatlab code ratdisk are presented for rational interpolation or linearized least-squares approximation of a function based on its values at points equally spaced on a circle. The use of the singular value decomposition enables the detection and elimination of s...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2011
|
| _version_ | 1797086599214792704 |
|---|---|
| author | Gonnet, P Pachon, R Trefethen, L |
| author_facet | Gonnet, P Pachon, R Trefethen, L |
| author_sort | Gonnet, P |
| collection | OXFORD |
| description | An efficient and robust algorithm and aMatlab code ratdisk are presented for rational interpolation or linearized least-squares approximation of a function based on its values at points equally spaced on a circle. The use of the singular value decomposition enables the detection and elimination of spurious poles or Froissart doublets that commonly complicate such fits without contributing to the quality of the approximation. As an application, the algorithm leads to a method for the stable computation of certain radial basis function interpolants in the difficult case of smoothness parameter ε close to zero. Copyright © 2011, Kent State University. |
| first_indexed | 2024-03-07T02:24:11Z |
| format | Journal article |
| id | oxford-uuid:a5033cc4-4826-4ded-93b9-0d12ef50b9bf |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T02:24:11Z |
| publishDate | 2011 |
| record_format | dspace |
| spelling | oxford-uuid:a5033cc4-4826-4ded-93b9-0d12ef50b9bf2022-03-27T02:37:33ZROBUST RATIONAL INTERPOLATION AND LEAST-SQUARESJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:a5033cc4-4826-4ded-93b9-0d12ef50b9bfEnglishSymplectic Elements at Oxford2011Gonnet, PPachon, RTrefethen, LAn efficient and robust algorithm and aMatlab code ratdisk are presented for rational interpolation or linearized least-squares approximation of a function based on its values at points equally spaced on a circle. The use of the singular value decomposition enables the detection and elimination of spurious poles or Froissart doublets that commonly complicate such fits without contributing to the quality of the approximation. As an application, the algorithm leads to a method for the stable computation of certain radial basis function interpolants in the difficult case of smoothness parameter ε close to zero. Copyright © 2011, Kent State University. |
| spellingShingle | Gonnet, P Pachon, R Trefethen, L ROBUST RATIONAL INTERPOLATION AND LEAST-SQUARES |
| title | ROBUST RATIONAL INTERPOLATION AND LEAST-SQUARES |
| title_full | ROBUST RATIONAL INTERPOLATION AND LEAST-SQUARES |
| title_fullStr | ROBUST RATIONAL INTERPOLATION AND LEAST-SQUARES |
| title_full_unstemmed | ROBUST RATIONAL INTERPOLATION AND LEAST-SQUARES |
| title_short | ROBUST RATIONAL INTERPOLATION AND LEAST-SQUARES |
| title_sort | robust rational interpolation and least squares |
| work_keys_str_mv | AT gonnetp robustrationalinterpolationandleastsquares AT pachonr robustrationalinterpolationandleastsquares AT trefethenl robustrationalinterpolationandleastsquares |