Crates.io | gcm-lcm |
lib.rs | gcm-lcm |
version | 0.1.0 |
source | src |
created_at | 2023-09-05 01:47:02.723181 |
updated_at | 2023-09-05 01:47:02.723181 |
description | Greatest convex minorant, least concave majorant |
homepage | |
repository | https://github.com/andrewjradcliffe/gcm-lcm/ |
max_upload_size | |
id | 963817 |
size | 49,323 |
Add this to your Cargo.toml
:
[dependencies]
gcm-lcm = "0.1"
Construct the greatest convex minorant (GCM) or least concave majorant (LCM). This may be of use if your computations involve stochastic processes. Alternatively, perhaps you wish to construct a convex (or concave) function approximation for use in an optimization problem, simulation (e.g. inverse transform sampling using the LCM of an empirical cumulative distribution function), or something more creative.
The full description of the algorithm is provided in a pre-print.
Licensed under either of
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.