Skip to content

Conversation

schillic
Copy link
Member

The old implementation converted to SimpleSparsePolynomialZonotope, but that created new parameters for each independent generator. With splitting in the parameter domain, this could quickly explode. The new implementation simply avoids this conversion (by computing the Minkowski sum directly).

@schillic schillic marked this pull request as ready for review June 11, 2025 21:41
@schillic schillic changed the title Faster overapproximate of SparsePolynomialZonotope with `UnionSetArray{<:Zonotope} Faster overapproximate of SparsePolynomialZonotope with UnionSetArray{<:Zonotope} Jun 26, 2025
@schillic schillic merged commit 34bbe83 into master Jul 24, 2025
7 checks passed
@schillic schillic deleted the schillic/oa_SPZ branch July 24, 2025 11:40
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants