- Join over
**1.5M+ people** - Join over
**100K+ communities** - Free
**without limits** - Create
**your own community**

- 19:35mforets synchronize #25
- 19:35
mforets on fix_docs

fix docs build (compare)

- 19:21
mforets on gh-pages

build based on 7faf8cbc (compare)

- 19:20
mforets on master

Create docs.yml (compare)

- 19:17mforets commented #2012
- 19:16mforets commented #2012
- 19:16mforets opened #2012
- 19:15
mforets on 2004

generalize vertices type in VPoβ¦ (compare)

- 19:09mforets opened #25
- 19:09
mforets on fix_docs

fix docs build (compare)

- 18:43
schillic on 1911

- 18:43
schillic on master

#1911 - Type instability in genβ¦ (compare)

- 18:43schillic closed #1981
- 18:43schillic closed #1911
- 18:39
mforets on master

Create TagBot.yml (compare)

- 18:38
mforets on master

Create CompatHelper.yml (compare)

- 18:27
mforets on gh-pages

build based on 83a553ff (compare)

- 17:56mforets opened #2011
- 17:54mforets opened #2010

perhaps my question is: what is the result (set type) of

`minkowski_difference(P, W)`

using LazySets

```
function maximal_RPI_set(S, π²::LazySet, π::LazySet)
S_inv = inv(S)
π« = π
k = 0
while true
k +=1
# concrete set operations (S_invβ
π« β π²) β© π
π«βΊ = intersection(linear_map(S_inv, minkowski_difference(π«,π²)), π)
if (π«βΊ β π« && π« β π«βΊ)
break
end
π« = π«βΊ
end
return π«, k
end
n = 2
W = BallInf(zeros(n), 0.25)
D = BallInf(zeros(n), 5.0)
# Schur Matrix S
S = [0.755 0.7; 0.0 0.75]
@time maximal_RPI_set(S, W, D)
```

where $X$ is the minkowski difference

And also, I'd like to figure out, how the computational complexity of

And to do that, I first wanted to have a really performant code.

`linear_map`

growths with the number of constraints?And to do that, I first wanted to have a really performant code.

can't we use the information to quickly compute the action of the linear map to the HPOlytope

i think we had an open issue for this

@schillic this was your idea ?

For example, for the

Or does it make totally sense, that the

`minkowski_difference`

I know that I solve #constraint linear programs (therefore, it is linear in the number of constraints) and I was surprised, that the `linear_map`

does take significantly more time than the `minkowski_differnence`

and now, I try to figure out why exactly.Or does it make totally sense, that the

`linear_map`

takes more time?
they are very fast if the sets are zonotopic

since then linear maps are just the action over the generators

yes, to have an option to pass the inverted matrix

if the matrix is invertible then the linear map can be computed *without* passing to the vrep

it is easy, just see how it transforms each constraints

in the general case (the matrix is not invertible) you have to pass to the vertex representation and this can be expensive

`linear_map`

inverts again
there should be an option to pass

`S`

directly
and still

if we pass

`S`

to `linear_map`

there should be an option to pass S directly

maybe our messages crossed

because you just pass it to

`linear_map`

but would not use it
because you know it's invertible and the inverse is

`S`

hmm this is related but not the same?

we didn't speak about passing the inverse matrix there