Abstract
An efficient predictor/multi-corrector algorithm for the high-order accurate time-discontinuous Galerkin (TDG) method is presented. The algorithm overcomes the demanding storage and computational effort of the direct solution of the TDG matrix equations. The success of the block matrix iterative solution method is a result of a specific form of time approximation. An analysis shows that the algorithm needs only a few iteration passes with a single matrix factorization of size equal to the number of spatial degrees-of-freedom to reach the 2 p + 1 order of accuracy of the parent TDG solution obtained from a direct solve. For linear ( p = 1 ) and quadratic ( p = 2 ) approximations in time, each iteration pass retains the unconditional and asymptotic stability of the TDG parent solution. Numerical results demonstrate the efficiency and accuracy of the time-integration algorithm over second-order accurate single-step/single-solve (SS/SS) methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
