LazySets.jl is a Julia package for calculus with convex sets. The aim is to provide a scalable library for solving complex set-based problems, such as those encountered in differential inclusions or reachability analysis techniques in the domain of formal verification. Typically, one is confronted with a set-based recurrence with a given initial set and/or input sets, and for visualization purposes, the final result has to be obtained through an adequate projection onto low dimensions. This library implements types to construct set formulas and methods to efficiently and accurately approximate the projection in low dimensions.
Features
- Examples available
- This library has been applied in a number of scientific works
- Several projects in the Julia technical computing stack use this library
- Scalable Symbolic-Numeric Set Computations
- Documentation available
- LazySets.jl is a registered Julia package and as such you can install it by activating the pkg mode
Categories
MathematicsLicense
MIT LicenseFollow LazySets.jl
You Might Also Like
Gen AI apps are built with MongoDB Atlas
MongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of LazySets.jl!