A rational approximation of the sinc function based on sampling and the Fourier transforms
In our previous publications we have introduced the cosine product-to-sum identity [17] $$ \prod\limits_{m = 1}^M {\cos \left( {\frac{t}{{{2^m}}} \right)} = \frac{1}{{{2^{M - 1}}}\sum\limits_{m = 1}^{{2^{M - 1}}} {\cos \left( {\frac{{2m - 1}}{{{2^M}}}t} \right)} $$ and applied it for sampling [1, 2]...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2019-10 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Abrarov, S M Quine, B M |
description | In our previous publications we have introduced the cosine product-to-sum identity [17] $$ \prod\limits_{m = 1}^M {\cos \left( {\frac{t}{{{2^m}}} \right)} = \frac{1}{{{2^{M - 1}}}\sum\limits_{m = 1}^{{2^{M - 1}}} {\cos \left( {\frac{{2m - 1}}{{{2^M}}}t} \right)} $$ and applied it for sampling [1, 2] as an incomplete cosine expansion of the sinc function in order to obtain a rational approximation of the Voigt/complex error function that with only \(16\) summation terms can provide accuracy \({\sim 10^{ - 14}}\). In this work we generalize this approach and show as an example how a rational approximation of the sinc function can be derived. A MATLAB code validating these results is presented. |
doi_str_mv | 10.48550/arxiv.1812.10884 |
format | Article |
fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1812_10884</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2161867170</sourcerecordid><originalsourceid>FETCH-LOGICAL-a520-f5d2b43360343bbe33ce13d772661cff263a60a8a01c2e6b70a520af646d98893</originalsourceid><addsrcrecordid>eNotkMtOwzAQRS0kJKrSD2CFJdYJtid-dFlVFCpVYtMVm2iS2OAqL-wElb8nTVnNQ3dG91xCHjhLMyMle8Zw9j8pN1yknBmT3ZCFAOCJyYS4I6sYT4wxobSQEhbkY0MDDr5rsabY96E7-2aeaefo8GVp9G1J3diW87LAaCs6NRGbvvbtJ8W2mnW7bgzeBjoEbKPrQhPvya3DOtrVf12S4-7luH1LDu-v--3mkKAULHGyEkUGoBhkUBQWoLQcKq2FUrx0TihAxdAg46WwqtDscoZOZapaG7OGJXm8vp3B8z5MAOE3vwSQzwFMiqerYsL7Hm0c8tNkdiKOueCKG6W5ZvAHoWleEQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2161867170</pqid></control><display><type>article</type><title>A rational approximation of the sinc function based on sampling and the Fourier transforms</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Abrarov, S M ; Quine, B M</creator><creatorcontrib>Abrarov, S M ; Quine, B M</creatorcontrib><description>In our previous publications we have introduced the cosine product-to-sum identity [17] $$ \prod\limits_{m = 1}^M {\cos \left( {\frac{t}{{{2^m}}} \right)} = \frac{1}{{{2^{M - 1}}}\sum\limits_{m = 1}^{{2^{M - 1}}} {\cos \left( {\frac{{2m - 1}}{{{2^M}}}t} \right)} $$ and applied it for sampling [1, 2] as an incomplete cosine expansion of the sinc function in order to obtain a rational approximation of the Voigt/complex error function that with only \(16\) summation terms can provide accuracy \({\sim 10^{ - 14}}\). In this work we generalize this approach and show as an example how a rational approximation of the sinc function can be derived. A MATLAB code validating these results is presented.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1812.10884</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Approximation ; Computer Science - Numerical Analysis ; Error functions ; Fourier transforms ; Mathematical analysis ; Mathematics - Numerical Analysis ; Sampling</subject><ispartof>arXiv.org, 2019-10</ispartof><rights>2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.1812.10884$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1016/j.apnum.2019.08.030$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Abrarov, S M</creatorcontrib><creatorcontrib>Quine, B M</creatorcontrib><title>A rational approximation of the sinc function based on sampling and the Fourier transforms</title><title>arXiv.org</title><description>In our previous publications we have introduced the cosine product-to-sum identity [17] $$ \prod\limits_{m = 1}^M {\cos \left( {\frac{t}{{{2^m}}} \right)} = \frac{1}{{{2^{M - 1}}}\sum\limits_{m = 1}^{{2^{M - 1}}} {\cos \left( {\frac{{2m - 1}}{{{2^M}}}t} \right)} $$ and applied it for sampling [1, 2] as an incomplete cosine expansion of the sinc function in order to obtain a rational approximation of the Voigt/complex error function that with only \(16\) summation terms can provide accuracy \({\sim 10^{ - 14}}\). In this work we generalize this approach and show as an example how a rational approximation of the sinc function can be derived. A MATLAB code validating these results is presented.</description><subject>Approximation</subject><subject>Computer Science - Numerical Analysis</subject><subject>Error functions</subject><subject>Fourier transforms</subject><subject>Mathematical analysis</subject><subject>Mathematics - Numerical Analysis</subject><subject>Sampling</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotkMtOwzAQRS0kJKrSD2CFJdYJtid-dFlVFCpVYtMVm2iS2OAqL-wElb8nTVnNQ3dG91xCHjhLMyMle8Zw9j8pN1yknBmT3ZCFAOCJyYS4I6sYT4wxobSQEhbkY0MDDr5rsabY96E7-2aeaefo8GVp9G1J3diW87LAaCs6NRGbvvbtJ8W2mnW7bgzeBjoEbKPrQhPvya3DOtrVf12S4-7luH1LDu-v--3mkKAULHGyEkUGoBhkUBQWoLQcKq2FUrx0TihAxdAg46WwqtDscoZOZapaG7OGJXm8vp3B8z5MAOE3vwSQzwFMiqerYsL7Hm0c8tNkdiKOueCKG6W5ZvAHoWleEQ</recordid><startdate>20191022</startdate><enddate>20191022</enddate><creator>Abrarov, S M</creator><creator>Quine, B M</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20191022</creationdate><title>A rational approximation of the sinc function based on sampling and the Fourier transforms</title><author>Abrarov, S M ; Quine, B M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a520-f5d2b43360343bbe33ce13d772661cff263a60a8a01c2e6b70a520af646d98893</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Approximation</topic><topic>Computer Science - Numerical Analysis</topic><topic>Error functions</topic><topic>Fourier transforms</topic><topic>Mathematical analysis</topic><topic>Mathematics - Numerical Analysis</topic><topic>Sampling</topic><toplevel>online_resources</toplevel><creatorcontrib>Abrarov, S M</creatorcontrib><creatorcontrib>Quine, B M</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Abrarov, S M</au><au>Quine, B M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A rational approximation of the sinc function based on sampling and the Fourier transforms</atitle><jtitle>arXiv.org</jtitle><date>2019-10-22</date><risdate>2019</risdate><eissn>2331-8422</eissn><abstract>In our previous publications we have introduced the cosine product-to-sum identity [17] $$ \prod\limits_{m = 1}^M {\cos \left( {\frac{t}{{{2^m}}} \right)} = \frac{1}{{{2^{M - 1}}}\sum\limits_{m = 1}^{{2^{M - 1}}} {\cos \left( {\frac{{2m - 1}}{{{2^M}}}t} \right)} $$ and applied it for sampling [1, 2] as an incomplete cosine expansion of the sinc function in order to obtain a rational approximation of the Voigt/complex error function that with only \(16\) summation terms can provide accuracy \({\sim 10^{ - 14}}\). In this work we generalize this approach and show as an example how a rational approximation of the sinc function can be derived. A MATLAB code validating these results is presented.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1812.10884</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2019-10 |
issn | 2331-8422 |
language | eng |
recordid | cdi_arxiv_primary_1812_10884 |
source | arXiv.org; Free E- Journals |
subjects | Approximation Computer Science - Numerical Analysis Error functions Fourier transforms Mathematical analysis Mathematics - Numerical Analysis Sampling |
title | A rational approximation of the sinc function based on sampling and the Fourier transforms |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T16%3A38%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20rational%20approximation%20of%20the%20sinc%20function%20based%20on%20sampling%20and%20the%20Fourier%20transforms&rft.jtitle=arXiv.org&rft.au=Abrarov,%20S%20M&rft.date=2019-10-22&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1812.10884&rft_dat=%3Cproquest_arxiv%3E2161867170%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2161867170&rft_id=info:pmid/&rfr_iscdi=true |