Help solving Simulink numerical oscillation

Tusike
Messages
137
Reaction score
0
Hi!

I posted a new thread about a week ago, but so far no one was able to help me:

https://www.physicsforums.com/showthread.php?t=761892

I wasn't sure if I posted in the right forum, so I'm posting it here hoping to reach a wider audience :)

Any help is greatly appreciated!

-Tusike
 
Mathematics news on Phys.org
Hi!

I think I found a solution to my problem in the case of two chambers connected by a valve.

I can calculate the amplitude of the oscillation that occurres, and have given a condition that leads to the oscillation damping, and my results agree with what I see in Simulink.
If anyone would go over my mathematical formulation given in the attachments, I would greatly appreciate that.

However, I'm having trouble expanding my math to more chambers = higher dimensional cases.
So far, I have been able to calculate the amplitude of oscillation for 3 chambers, but couldn't give a precise formulation of a solution such as in the 1D case. I will upload a document of my calculations for this as soon as I type it in.

I presented some ideas in the 1D case which could be used to expand to higher dimensions. If anyone could give me ideas on how to do that, and if the way I'm trying seems to be correct or not, I would also be very thankful.

Thanks!

-Tusike
 

Attachments

Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top