LazyMath
Complex Conjugate Gradient linear solver and Levenberg-Marquardt minimizer with and without constraints in C++ (by tirimatangi)
SpeciaLUT
Runtime choosing of template specializations using compile-time lookup-tables. Compile all states of a template function, but execute the optimal one at runtime. (by j8asic)
LazyMath | SpeciaLUT | |
---|---|---|
2 | 3 | |
4 | 26 | |
- | - | |
0.0 | 3.4 | |
over 2 years ago | 7 months ago | |
C++ | C++ | |
The Unlicense | BSD 2-clause "Simplified" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
LazyMath
Posts with mentions or reviews of LazyMath.
We have used some of these posts to build our list of alternatives
and similar projects.
-
A good alternative to Matlab's fminsearch?
This library has a minimizer which can be used with and without knowledge of the derivative. See chapter 3 in the description for a simple example.
-
Header-only complex linear solver and function minimizer in C++
Meanwhile, the library and examples can be found here in Github.
SpeciaLUT
Posts with mentions or reviews of SpeciaLUT.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-02.
-
C++ Show and Tell - December 2022
I made SpeciaLUT to convert bool/enum runtime tests to compile-time conditionals — by compiling all branching combinations in hot functions and saving them in a lookup-table, so the optimal one can be called at runtime. Reason: as an HPC consultant I encountered many codes that grew without good architecture, in which features would just be added and branching would propagate through all levels. This yields 10% to 50% performance increase in such codes.
-
Runtime-constant propagation and branching optimization strategy
I have implemented this as a C++ library, where you extract const states as template parameters, and the library compiles all specializations and allows you to choose the optimal one at runtime.
-
Runtime calling of a template specialisation using compile-time LUTs
So here's my C++20 implementation of the above: SpeciaLUT
What are some alternatives?
When comparing LazyMath and SpeciaLUT you can also consider the following projects:
biteopt - Derivative-Free Global Optimization Method (C++, Python binding)