A numerical investigation of matrix-free implicit time-stepping methods for large CFD simulations. (15th December 2017)

• Record Type: Journal Article
• Authors: Sarshar, Arash; Tranquilli, Paul; Pickering, Brent; McCall, Andrew; Roy, Christopher J.; Sandu, Adrian
• Is Part Of: Computers & fluids. Volume 159(2017)
• Page Start: 53
• Page End: 63
• Publication Date: 2017-12-15
• Subjects: Initial value problems -- Computational fluid dynamics -- Implicit time integration; 65L05 -- 65L07; Fluid dynamics -- Data processing -- Periodicals; 532.050285
• DOI: 10.1016/j.compfluid.2017.09.014
• Languages: English
• ISSNs: 0045-7930

Abstract

Highlights: Solving unsteady Navier–Stokes equations requires efficient time integration methods. We investigates numerical performance of matrix-free implicit time discretizations. Traditional matrix-free implicit methods suffer from loss of computational efficiency. Lightly-implicit methods provide fast computations and larger-than-explicit timesteps. Abstract: This paper is concerned with development and testing of advanced time-stepping methods for large unsteady CFD problems in the method of lines approach, where the semi-discretization in space is performed first. The performance of several time discretization methods is studied numerically with regards to computational efficiency, order of accuracy, and stability, as well as the ability to effectively treat stiff problems. We consider matrix-free implementations, a popular approach for time-stepping methods applied to large CFD applications due to its adherence to scalable matrix-vector operations and a small memory footprint. We compare explicit methods with matrix-free implementations of implicit, linearly-implicit, as well as Rosenbrock–Krylov methods. We show that Rosenbrock–Krylov methods are competitive with existing techniques excelling for a number of problem types and settings.