v0.3.0

MulticomplexNumbers v0.3.0

Diff since v0.2.2

• Add rand and randn array-generating methods
• Add imN(n) for programmatic unit generation
• fft!(A, unit) - unit can be specified as integer or directly as a multicomplex unit
• Add support for ifft!, bfft! and allocating variants (FFTW extension)
• Add tests for rand/randn array generation (vector, matrix, RNG, reproducibility)
• Add new test sets: Conjugation, Absolute value/norm, log/sqrt, Powers, Conversions/promotions, Property tests (isinteger, isfinite, isnan, etc.), Hashing, flipsign

Breaking changes

• There are no breaking changes

Merged pull requests:

• Add imN(n), ifft!/bfft!, and allocating FFT variants (#14) (@chriswaudby)
• Release v0.3.0: random generation, docs improvements, expanded tests (#15) (@chriswaudby)

v0.2.2

MulticomplexNumbers v0.2.2

Diff since v0.2.1

Merged pull requests:

• Fix testset naming error in random stress tests (#11) (@chriswaudby)
• Extend realest and component functions to work with Real and Complex numbers (#12) (@chriswaudby)
• Bump version to v0.2.2 (#13) (@chriswaudby)

v0.2.1

MulticomplexNumbers v0.2.1

Diff since v0.1.0

• no breaking changes
• improved performance
• more complete mathematical operations

Merged pull requests:

• Add comprehensive CLAUDE.md documentation for AI assistants (#3) (@chriswaudby)
• Implement Priority 1 improvements from CLAUDE.md roadmap (#4) (@chriswaudby)
• Fix documentation build error: correct type name references (#5) (@chriswaudby)
• Add fold operator, trigonometric functions, benchmarks, and random generation (#6) (@chriswaudby)
• Reorganize documentation into focused sub-pages (#7) (@chriswaudby)
• Prepare v0.2.0 release (#8) (@chriswaudby)
• Use recursive algorithms for multiplication and division (#9) (@chriswaudby)
• Improve trig functions using recursive algorithms instead of matrix representations (#10) (@chriswaudby)

v0.1.0

MulticomplexNumbers v0.1.0