{"id":20500578,"url":"https://github.com/juliaapproximation/genericfft.jl","last_synced_at":"2025-10-12T07:33:09.656Z","repository":{"id":46695064,"uuid":"515527774","full_name":"JuliaApproximation/GenericFFT.jl","owner":"JuliaApproximation","description":"A package for computing the FFT with arbitrary floating point numbers","archived":false,"fork":false,"pushed_at":"2024-11-27T06:30:09.000Z","size":294,"stargazers_count":16,"open_issues_count":9,"forks_count":4,"subscribers_count":9,"default_branch":"main","last_synced_at":"2025-02-23T04:35:22.883Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Julia","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/JuliaApproximation.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-07-19T09:55:59.000Z","updated_at":"2025-02-13T02:34:36.000Z","dependencies_parsed_at":"2024-03-14T07:31:09.442Z","dependency_job_id":"9db2eef5-e623-4b61-8d46-215f5ccd459f","html_url":"https://github.com/JuliaApproximation/GenericFFT.jl","commit_stats":null,"previous_names":[],"tags_count":7,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuliaApproximation%2FGenericFFT.jl","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuliaApproximation%2FGenericFFT.jl/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuliaApproximation%2FGenericFFT.jl/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuliaApproximation%2FGenericFFT.jl/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/JuliaApproximation","download_url":"https://codeload.github.com/JuliaApproximation/GenericFFT.jl/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242092319,"owners_count":20070501,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-15T18:21:42.104Z","updated_at":"2025-10-12T07:33:04.602Z","avatar_url":"https://github.com/JuliaApproximation.png","language":"Julia","funding_links":[],"categories":[],"sub_categories":[],"readme":"# GenericFFT.jl\n\n[![Build Status](https://github.com/JuliaApproximation/GenericFFT.jl/workflows/CI/badge.svg)](https://github.com/JuliaApproximation/GenericFFT.jl/actions?query=workflow%3ACI)\n[![codecov](https://codecov.io/gh/JuliaApproximation/GenericFFT.jl/branch/main/graph/badge.svg?token=TSiBjCYqzb)](https://codecov.io/gh/JuliaApproximation/GenericFFT.jl)\n[![docs-stable](https://img.shields.io/badge/docs-stable-blue.svg)](https://JuliaApproximation.github.io/GenericFFT.jl/stable)\n[![docs-dev](https://img.shields.io/badge/docs-dev-blue.svg)](https://JuliaApproximation.github.io/GenericFFT.jl/dev)\n[![pkgeval](https://juliahub.com/docs/General/BlockArrays/stable/pkgeval.svg)](https://juliaci.github.io/NanosoldierReports/pkgeval_badges/report.html)\n\n`GenericFFT.jl` implements a Fast Fourier Transform for generic floating point number types.\n\nThe transforms provided have the right computational complexity. However, for the time being, the implementations are crude and far from optimal. Please consider contributing improvements to the package and filing issues for missing functionality.\n\n## Installation\n\nInstallation is straightforward:\n```julia\npkg\u003e add GenericFFT\n\njulia\u003e using GenericFFT\n```\n\n## Usage for high-precision FFTs\n\nThe main reason for using `GenericFFT` is high-precision calculations. For example:\n```julia\njulia\u003e using GenericFFT\n\njulia\u003e fft(rand(Complex{BigFloat}, 2))\n2-element Vector{Complex{BigFloat}}:\n 0.8071607526060331187983248443648586158893950448440777116281652091029932491471374 + 1.058204007570364569492040922226041865648762106924785198005758849420721686004251im\n 0.3195699335469630499276014344115859560577992018210584550701583748039853943955188 + 0.196737316420669631800810230623687615407691727320510522950346182385847637522683im\n```\n\nOther packages provide high-precision floating point numbers, including [QuadMath.jl](https://github.com/JuliaMath/Quadmath.jl) and [DoubleFloats.jl](https://github.com/JuliaMath/DoubleFloats.jl).\n```julia\njulia\u003e using GenericFFT, DoubleFloats\n\njulia\u003e fft(rand(Double64, 2))\n2-element Vector{Complex{Double64}}:\n 0.4026739024263829 + 0.0im\n 0.3969515892883767 + 0.0im\n ```\n\n## History\n\nThe code in this package was developed in the [FastTransforms.jl](https://github.com/JuliaApproximation/FastTransforms.jl) package by Mikael Slevinsky. The code was moved to a separate package in July 2022 from [this file](https://github.com/JuliaApproximation/FastTransforms.jl/blob/3bd5a9a2cf744fc26418fe999bbb151b5ccc6634/src/fftBigFloat.jl).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjuliaapproximation%2Fgenericfft.jl","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjuliaapproximation%2Fgenericfft.jl","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjuliaapproximation%2Fgenericfft.jl/lists"}