Archived OpenModelica forums. Posting is disabled.

Alternative forums include GitHub discussions or StackOverflow (make sure to read the Stack Overflow rules; you need to have well-formed questions)


Forgot password? | Forgot username? | Register

Tearing - Solvability

Tearing - Solvability

I'm reading this paper: "Practical Realization and Adaptation of Cellier’s Tearing Method".

It explains: "The main weakness of Cellier’s method is to assume that every variable is solvable in each equation".

They propose a modified Tarjan algorithm.

Do you know where can I find more information about "Unsolvable variables and equations"?

In other words, how to determine "Impossible assignments".

Thank & Regards

Re: Tearing - Solvability

1. See which variables are present in an equation
2. Try to solve for each of those variables
3. You now have a set of solvable variables

For example:

Code:

x=external_func("str",y,z);

Will say y and z cannot be solved for (since the external C function is not known what it returns and you cannot invert it). While:

Code:

x=sin(y);

Can probably be inverted to y=arcsin(x) so both x and y are solvable.

Re: Tearing - Solvability

Hi sjoelund.se,

Thank you! I understand the analytic concept of solvability.

I want more information about the numeric/automatic treatment.

I found this paper but I couldn't purchase it yet: "Dynamic tearing: efficiency enhancement of tearing methods by consideration of solvability criteria during runtime". Has anyone read this paper? Does it cover the topic?

Any other references?

Regards






There are 0 guests and 0 other users also viewing this topic
You are here: