Implicit multiblock euler computations using a preconditioned GMRES method

Author(s):  
L. Carpintero ◽  
V. Daru
2017 ◽  
Vol 94 (10) ◽  
pp. 2122-2144 ◽  
Author(s):  
Jiaquan Gao ◽  
Kesong Wu ◽  
Yushun Wang ◽  
Panpan Qi ◽  
Guixia He

2015 ◽  
Vol 23 (4) ◽  
Author(s):  
Kirill V. Demyanko ◽  
Yuri M. Nechepurenko ◽  
Miloud Sadkane

AbstractThis work is devoted to computations of deflating subspaces associated with separated groups of finite eigenvalues near specified shifts of large regular matrix pencils. The proposed method is a combination of inexact inverse subspace iteration and Newton’s method. The first one is slow but reliably convergent starting with almost an arbitrary initial subspace and it is used as a preprocessing to obtain a good initial guess for the second method which is fast but only locally convergent. The Newton method necessitates at each iteration the solution of a generalized Sylvester equation and for this task an iterative algorithm based on the preconditioned GMRES method is devised. Numerical properties of the proposed combination are illustrated with a typical hydrodynamic stability problem.


2021 ◽  
Vol 89 (1) ◽  
Author(s):  
Pietro Benedusi ◽  
Paola Ferrari ◽  
Carlo Garoni ◽  
Rolf Krause ◽  
Stefano Serra-Capizzano

AbstractWe consider the space-time discretization of the diffusion equation, using an isogeometric analysis (IgA) approximation in space and a discontinuous Galerkin (DG) approximation in time. Drawing inspiration from a former spectral analysis, we propose for the resulting space-time linear system a multigrid preconditioned GMRES method, which combines a preconditioned GMRES with a standard multigrid acting only in space. The performance of the proposed solver is illustrated through numerical experiments, which show its competitiveness in terms of iteration count, run-time and parallel scaling.


2001 ◽  
Vol 9 (4) ◽  
pp. 195-209 ◽  
Author(s):  
Joanna Płażek ◽  
Krzysztof Banaś ◽  
Jacek Kitowski

In this paper we compare different parallel implementations of the same algorithm for solving nonlinear simulation problems on unstructured meshes. In the first implementation, making use of the message-passing programming model and the PVM system, the domain decomposition of unstructured mesh is implemented, while the second implementation takes advantage of the inherent parallelism of the algorithm by adopting the shared-memory programming model. Both implementations are applied to the preconditioned GMRES method that solves iteratively the system of linear equations. A combined approach, the hybrid programming model suitable for multicomputers with SMP nodes, is introduced. For performance measurements we use compressible fluid flow simulation in which sequences of finite element solutions form time approximations to the Euler equations. The tests are performed on HP SPP1600, HP S2000 and SGI Origin2000 multiprocessors and report wall-clock execution time and speedup for different number of processing nodes and for different meshes. Experimentally, the explicit programming model proves to be more efficient than the implicit model by 20—70%, depends on the mesh and the machine.


Sign in / Sign up

Export Citation Format

Share Document