chad-fast/src/ForwardAD, branch test-parallelAn implementation of CHAD, towards performance
https://git.tomsmeding.com/chad-fast/atom?h=test-parallel2025-06-18T08:09:56ZComplete pattern matches2025-06-18T08:09:56ZTom Smedingtom@tomsmeding.com2025-06-18T08:09:56Zurn:sha1:62639875102decae2bb96b3847ae48db5d1f8fd0ERecompute2025-05-25T21:35:31ZTom Smedingtom@tomsmeding.com2025-05-25T21:35:31Zurn:sha1:c36849cb6247f957b4e6b093e16d04421c8cea3dReorder TLEither to after TEither2025-04-29T18:38:05ZTom Smedingtom@tomsmeding.com2025-04-29T18:37:06Zurn:sha1:d0eb9a1edfb4233d557d954f46685f25382234d8WIP revamp accumulators again: explicit monoid types2025-04-27T21:34:59ZTom Smedingtom@tomsmeding.com2025-04-27T21:34:59Zurn:sha1:b1664532eaebdf0409ab6d93fc0ba2ef8dfbf372
No more D2 in accumulators! Paving the way for configurable sparsity of
products and arrays. The idea is to make separate monoid types for a
"product cotangent" and an "array cotangent" that can be lowered to
either a sparse monoid or a non-sparse monoid. Downsides of this
approach: lots of API duplication.
Add integer modulo operator2025-04-21T19:56:34ZTom Smedingt.j.smeding@uu.nl2025-04-21T19:56:34Zurn:sha1:c586e7d2343fa735a9b27e0b1a201dd2cb2bc68eCommutativity marker on fold1i2025-03-20T17:32:22ZTom Smedingt.j.smeding@uu.nl2025-03-20T17:32:22Zurn:sha1:d030802dd6d960afa80ac84a5580a46d39c02822Add ext field to remaining AST constructors2025-01-27T14:08:02ZTom Smedingt.j.smeding@uu.nl2025-01-27T14:08:02Zurn:sha1:88fae8c2914b805a733b71de58ab672124e6069cFix forward derivative of 'exp'2024-11-10T21:39:05ZTom Smedingtom@tomsmeding.com2024-11-10T21:39:05Zurn:sha1:4d573fa32997a8e4824bf8326fb675d0c195b1acComplete GMM implementation2024-11-10T09:04:27ZTom Smedingtom@tomsmeding.com2024-11-10T09:04:27Zurn:sha1:42d59947356ab51e5a4070b930f02f4909208d35Some more primitive operators2024-11-09T10:34:04ZTom Smedingtom@tomsmeding.com2024-11-09T10:34:04Zurn:sha1:2b1562d33bb9496aa449ef9d52735af0ec61c15c