We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Given an interval matrix A, we can compute A² exactly. This is not true for higher powers. See [1, Section 6] for an algorithm.
A
A²
[1] Olga Kosheleva, Vladik Kreinovich, Günter Mayer, Hung T. Nguyen: Computing the cube of an interval matrix is NP-Hard. SAC 2005. [PDF]
The text was updated successfully, but these errors were encountered:
Merge pull request #80 from JuliaReach/schillic/79
1fb98e5
#79 - Matrix square
schillic
Successfully merging a pull request may close this issue.
Given an interval matrix
A
, we can computeA²
exactly. This is not true for higher powers. See [1, Section 6] for an algorithm.[1] Olga Kosheleva, Vladik Kreinovich, Günter Mayer, Hung T. Nguyen: Computing the cube of an interval matrix is NP-Hard. SAC 2005. [PDF]
The text was updated successfully, but these errors were encountered: