-
Notifications
You must be signed in to change notification settings - Fork 21
New issue
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
The converging value of g-function is related with the discretization scheme #307
Comments
The non-uniform discretization has two parameters : the number of segments and the end-length-ratio (i.e. the relative legnth of the segments at the edges). Both need to be refined when conducting a discretization-independence study. A good way of doing it is to subdivide a base discretization by splitting each segment into two at each discretization level. You can then use Richardson extrapolation to compare where the two curves converge towards.
|
Thanks! The extrapolation indicates that their converging value have slight difference. Does it mean that the "exact" value of g-function depends on which discretization we use? |
The exact value of the g-function should be unique. Here, I evaluated the extrapolated values using only the last three points in the increasing discretization. We should expect closer values using trend lines on log-scale graphs instead. |
I have a script to test the value of g-function when using a different number of segments and discretization schemes (uniform and non-uniform).
The output is:
The result is a little surprising because as the number of segments increase, g-function s given by non-uniform segmentation and uniform segmentation converge to different values. I wonder which value is more accurate, and should be regarded as the reference.
The text was updated successfully, but these errors were encountered: