Closed phuongle0701 closed 2 years ago
In this case, we don't do the Cartesian produce of u and y. For each u, we only know the solution G(u)(y) for one y. So, if you have 60 u, you need also to have 60 y. For the first u, you know the solution G(u)(y) ONLY on the first y, etc. Note that each data point is a triple, as discussed in page 5 "Data generation." paragraph, and also SI S3, and Table S2.
Of course, you can allow that for each u, we know the solution G(u)(y) for multiple y. To do this, you can repeat the same u for multiple times.
Hi, First of all, thank you very much for your excellent work.
I tried to test the dimension-match in system.py for the case of simple linear ODE with the following parameters:
However, I get the dimension for s which value of G(u)(y) is an array of 40-by-1. Should this value have to be an array of (m_u * m_y)-by-1 which is in this case 2400-by-1?
This is my modified part:
I look forward to hearing from you soon.
Best Regards.