|
[Sponsors] |
Local DG predictor and polynomial reconstruction |
|
LinkBack | Thread Tools | Search this Thread | Display Modes |
![]() |
![]() |
#1 |
New Member
Join Date: Aug 2021
Posts: 3
Rep Power: 4 ![]() |
Hi,
I am new here and in numerical methods as well. I’m trying to write some one-dimensional finite volume code for two-phase flows. My goal was to make it of high order accuracy and this ultimately brought me to local Discontinous Galerkin predictor. I think I quite understand now finite volume method, however, Galerkin methods are something I have problems with. As I have no degree in mathematics or numerical methods it is hard for me to understand every equation used to obtain the predictor. I hope some of you could explain me this issue in more comprehensible form, as I would like to learn this. I use this lecture notes as a basis and I will refer to them when pointing where I have problems: http://www.olindozanotti.net/wp-cont...-Frankfurt.pdf I have also access to some other papers, including those appearing in references in above notes. For every problem below, assume one spatial dimension and polynomials of degree 2. My problems start at the polynomial reconstruction step. Could you explain me, how do I get the system of linear equations from eq (1.42)? I know integration by gaussian quadrature and Einstein summation convention, but I don’t understand how this should give me different equations for each cell inside stencil. Moreover, eqs (1.42) and (1.43) are very confusing for me. As above, I understand the summation convention, but here, with multiple indices, it’s hard to me to figure out how to calculate it. Going to the calculations of predictor itself, there are two functions theta - basis function with index p and test function with index q. Should I assume them as the same? And how do I get the polynomial psi for time variable in eq (1.49)? I’m sorry for these beginner’s questions, but I couldn’t find any answer yet, so eventually I decided to seek some help. Probably I will have other questions once I find solutions to those above. |
|
![]() |
![]() |
|
|