Optimizing the size of array for modern discrete Fourier transform libraries

Optimizing the size of array for modern discrete Fourier transform libraries

The problem of optimization of the array size for modern discrete Fourier transform libraries is considered and reformulated as an integer linear programming problem. Acceleration of finding an optimal solution using standard freely available library with respect to brute force approach is demonstra...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2023-08
1. Verfasser: Korotkevich, Alexander O
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Arrays
Fourier transforms
Integer programming
Libraries
Linear programming
Optimization
Programming languages
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 Korotkevich, Alexander O
description The problem of optimization of the array size for modern discrete Fourier transform libraries is considered and reformulated as an integer linear programming problem. Acceleration of finding an optimal solution using standard freely available library with respect to brute force approach is demonstrated. Ad hoc recursive algorithm of finding the optimal solution is proposed, complexity scaling of the algorithm is estimated analytically. The problem can be used in a linear programming class as an example of purely integer programming problem (continuous linear programming solution has no sense), simple enough to be solved using even interpreting programming languages like Python or Matlab.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2852166052</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2852166052</sourcerecordid><originalsourceid>FETCH-proquest_journals_28521660523</originalsourceid><addsrcrecordid>eNqNi7EKwjAURYMgWLT_8MC5EFNTu4vFQXBxL9G-akqb1PfSwX69GfwApwvnnLsQicrzXVbulVqJlLmTUqrioLTOE3G5jsEOdrbuCeGFwHZG8C0YIvOB1hMMvkFy0Fh-EAaEyk9kkSCQcRyDAXp7JxMZb8SyNT1j-tu12Fan2_GcjeTfE3Kou3h2UdWq1GpXFFKr_L_qC5BRPgk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2852166052</pqid></control><display><type>article</type><title>Optimizing the size of array for modern discrete Fourier transform libraries</title><source>Freely Accessible Journals</source><creator>Korotkevich, Alexander O</creator><creatorcontrib>Korotkevich, Alexander O</creatorcontrib><description>The problem of optimization of the array size for modern discrete Fourier transform libraries is considered and reformulated as an integer linear programming problem. Acceleration of finding an optimal solution using standard freely available library with respect to brute force approach is demonstrated. Ad hoc recursive algorithm of finding the optimal solution is proposed, complexity scaling of the algorithm is estimated analytically. The problem can be used in a linear programming class as an example of purely integer programming problem (continuous linear programming solution has no sense), simple enough to be solved using even interpreting programming languages like Python or Matlab.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Arrays ; Fourier transforms ; Integer programming ; Libraries ; Linear programming ; Optimization ; Programming languages</subject><ispartof>arXiv.org, 2023-08</ispartof><rights>2023. 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><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>780,784</link.rule.ids></links><search><creatorcontrib>Korotkevich, Alexander O</creatorcontrib><title>Optimizing the size of array for modern discrete Fourier transform libraries</title><title>arXiv.org</title><description>The problem of optimization of the array size for modern discrete Fourier transform libraries is considered and reformulated as an integer linear programming problem. Acceleration of finding an optimal solution using standard freely available library with respect to brute force approach is demonstrated. Ad hoc recursive algorithm of finding the optimal solution is proposed, complexity scaling of the algorithm is estimated analytically. The problem can be used in a linear programming class as an example of purely integer programming problem (continuous linear programming solution has no sense), simple enough to be solved using even interpreting programming languages like Python or Matlab.</description><subject>Algorithms</subject><subject>Arrays</subject><subject>Fourier transforms</subject><subject>Integer programming</subject><subject>Libraries</subject><subject>Linear programming</subject><subject>Optimization</subject><subject>Programming languages</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNi7EKwjAURYMgWLT_8MC5EFNTu4vFQXBxL9G-akqb1PfSwX69GfwApwvnnLsQicrzXVbulVqJlLmTUqrioLTOE3G5jsEOdrbuCeGFwHZG8C0YIvOB1hMMvkFy0Fh-EAaEyk9kkSCQcRyDAXp7JxMZb8SyNT1j-tu12Fan2_GcjeTfE3Kou3h2UdWq1GpXFFKr_L_qC5BRPgk</recordid><startdate>20230815</startdate><enddate>20230815</enddate><creator>Korotkevich, Alexander O</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>PTHSS</scope></search><sort><creationdate>20230815</creationdate><title>Optimizing the size of array for modern discrete Fourier transform libraries</title><author>Korotkevich, Alexander O</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_28521660523</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Arrays</topic><topic>Fourier transforms</topic><topic>Integer programming</topic><topic>Libraries</topic><topic>Linear programming</topic><topic>Optimization</topic><topic>Programming languages</topic><toplevel>online_resources</toplevel><creatorcontrib>Korotkevich, Alexander O</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; 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>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Korotkevich, Alexander O</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Optimizing the size of array for modern discrete Fourier transform libraries</atitle><jtitle>arXiv.org</jtitle><date>2023-08-15</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>The problem of optimization of the array size for modern discrete Fourier transform libraries is considered and reformulated as an integer linear programming problem. Acceleration of finding an optimal solution using standard freely available library with respect to brute force approach is demonstrated. Ad hoc recursive algorithm of finding the optimal solution is proposed, complexity scaling of the algorithm is estimated analytically. The problem can be used in a linear programming class as an example of purely integer programming problem (continuous linear programming solution has no sense), simple enough to be solved using even interpreting programming languages like Python or Matlab.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2023-08
issn 2331-8422
language eng
recordid cdi_proquest_journals_2852166052
source Freely Accessible Journals
subjects Algorithms
Arrays
Fourier transforms
Integer programming
Libraries
Linear programming
Optimization
Programming languages
title Optimizing the size of array for modern discrete Fourier transform libraries
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T07%3A00%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Optimizing%20the%20size%20of%20array%20for%20modern%20discrete%20Fourier%20transform%20libraries&rft.jtitle=arXiv.org&rft.au=Korotkevich,%20Alexander%20O&rft.date=2023-08-15&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2852166052%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2852166052&rft_id=info:pmid/&rfr_iscdi=true