comnum-math 0.3.1

Numerical methods of comnum: special functions, Simpson, Gauss–Hermite and Gauss–Legendre quadrature, FFT plans, complex linear algebra, nearest-point search, finite fields, LFSR sequences, NLSE split-step solver

comnum-math

$crates.io$ $docs.rs$

Part of comnum, link-level simulation of digital communication systems, wireless and optical. Layer 0 (the foundation) of the workspace, whose dependencies point downward only (architecture).

The numerical methods without a communication meaning: decibel conversions, special functions, Gauss–Hermite quadrature, FFT plans, complex linear algebra (QR, Cholesky, SVD), nearest-point search, the split-step solvers of the nonlinear Schrödinger and Manakov equations, arithmetic over GF(2) and GF(2^m), exact integers, the Gray code, bisection and golden-section search.

Most users depend on the facade comnum, which re-exports this crate as comnum::math. The API is documented on docs.rs/comnum-math, with the formula that every item implements.

Licence

MIT or Apache-2.0, at your option (LICENSE-MIT, LICENSE-APACHE, shipped in the package).