Abstract

Representative transport PDE problems in one, two, and three dimensions are approximated by a class of high-order compact (HOC) difference schemes and their iterative and parallel performance are studied. The eigenvalues and condition numbers of the HOC schemes are analyzed and the performance of standard Krylov-space methods is compared for HOC, central differencing, and standard first-order upwinding schemes. Finally, CPU times, MFLOP rates, and speedup curves are presented for fixed-problem-size cases and scaled-problem-size cases.

Full Text
Paper version not known

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 call

Disclaimer: 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.