complex-bessel 0.1.0-alpha.1

Pure Rust implementation of complex Bessel functions (J, Y, I, K, H, Airy) based on Amos Algorithm 644

Coverage
100%
46 out of 46 items documented0 out of 24 items with examples
Size
Source code size: 39.95 kB This is the summed size of all the files inside the crates.io package for this release.
Documentation size: 3.2 MB This is the summed size of all files generated by rustdoc for all configured targets
Ø build duration
this release: 23s Average build duration of successful builds.
all releases: 28s Average build duration of successful builds in releases after 2024-10-23.
Links
elgar328/complex-bessel
5 0 0
crates.io
Dependencies
Versions
Owners

complex-bessel

Pure Rust implementation of complex Bessel functions based on Amos Algorithm 644 (TOMS 644).

Alpha: This crate is in early development. Function signatures are defined but implementations are not yet available.

Planned Functions

Function	Description
`besselj`	Bessel function of the first kind, J_ν(z)
`bessely`	Bessel function of the second kind, Y_ν(z)
`besseli`	Modified Bessel function of the first kind, I_ν(z)
`besselk`	Modified Bessel function of the second kind, K_ν(z)
`hankel`	Hankel functions, H_ν^{(1)(z) and H_ν}(2)(z)
`airy`	Airy function Ai(z) and derivative Ai'(z)
`biry`	Airy function Bi(z) and derivative Bi'(z)

Features

Generic over f32 and f64
Sequence computation for consecutive orders ν, ν+1, ..., ν+n-1
Exponential scaling option to prevent overflow/underflow
no_std compatible (with alloc)

License

Licensed under either of

Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
MIT License (LICENSE-MIT or http://opensource.org/licenses/MIT)

at your option.