Abstract
A numerical solution of a 3D linear transport equation on parallelepipedic computational grids is considered. By the technique of splitting in coordinates, compact grid-characteristic schemes of higher orders of accuracy are generalized to the 3D case. The influence of particular steps of the computational algorithm on the accuracy of the resulting scheme is investigated. The approach for retaining the order of convergence of a scheme on a smooth solution and minimizing nonphysical oscillations on a discontinuous solution in the 3D case is proposed.
Paper version not known (
Free)
Published Version
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.
