JuliaDiff / JuliaDiff/DualNumbers.jl
Support for fft of DualComplex Numbers
Open
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 80
- Forks
- 27
- PR merge metrics
- No merged PRs in 30d
Description
using DualNumbers;
x=[DualComplex256(1,1) for i in 1:10]
fft(x)
I get the following error:
ERROR: MethodError: no method matching plan_fft(::Array{DualNumbers.Dual{Complex
{Float64}},1}, ::UnitRange{Int64})
Closest candidates are:
plan_fft(::Union{Base.ReshapedArray{T<:Union{Complex{Float32}, Complex{Float64
}},N,A,MI} where MI<:Tuple{Vararg{Base.MultiplicativeInverses.SignedMultiplicati
veInverse{Int64},N} where N} where A<:Union{DenseArray, SubArray{T,N,P,I,true} w
here I<:Tuple{Union{Base.Slice, UnitRange},Vararg{Any,N} where N} where P where
N where T}, DenseArray{T<:Union{Complex{Float32}, Complex{Float64}},N}, SubArray
{T<:Union{Complex{Float32}, Complex{Float64}},N,A,I,L} where L} where I<:Tuple{V
ararg{Union{Base.AbstractCartesianIndex, Int64, Range{Int64}},N} where N} where
A<:Union{Base.ReshapedArray{T,N,A,MI} where MI<:Tuple{Vararg{Base.Multiplicative
Inverses.SignedMultiplicativeInverse{Int64},N} where N} where A<:Union{DenseArra
y, SubArray{T,N,P,I,true} where I<:Tuple{Union{Base.Slice, UnitRange},Vararg{Any
,N} where N} where P where N where T} where N where T, DenseArray}, ::Any; flags
, timelimit) where {T<:Union{Complex{Float32}, Complex{Float64}}, N} at fft\FFTW
.jl:596
plan_fft(::AbstractArray{#s262,N} where N where #s262<:Real, ::Any; kws...) at
dft.jl:205
plan_fft(::AbstractArray{#s250,N} where N where #s250<:(Complex{#s249} where #
s249<:Union{Integer, Rational}), ::Any; kws...) at dft.jl:207
...
Stacktrace:
[1] #plan_fft#1(::Array{Any,1}, ::Function, ::Array{DualNumbers.Dual{Complex{Fl
oat64}},1}) at .\dft.jl:58
[2] fft(::Array{DualNumbers.Dual{Complex{Float64}},1}) at .\dft.jl:56
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reproducing the Julia example with DualComplex256 and inspect the fft and plan_fft entry points shown in dft.jl and FFTW.jl. Done means fft(x) works for the demonstrated DualComplex array without the reported MethodError.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100