Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Parallelization of an implicit algorithm for fluid flow problems
Publication

Parallelization of an implicit algorithm for fluid flow problems

Title
Parallelization of an implicit algorithm for fluid flow problems
Type
Article in International Conference Proceedings Book
Year
1997
Authors
dalmeida, fd
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
vasconcelos, pb
(Author)
FEP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Indexing
Publicação em ISI Web of Knowledge ISI Web of Knowledge - 0 Citations
Scientific classification
FOS: Natural sciences > Computer and information sciences
Other information
Authenticus ID: P-001-CT4
Abstract (EN): The test problem used is the steady 2-D incompressible laminar flow in a square lid-driven cavity. We will consider the linear system generated by a coupled discretization and linearization method for the Navier-Stokes equations. This method consists of a discretization of the momentum equations to obtain the velocities at the faces of a finite volume, in terms of the values of these variables at the grid points followed by the integration of the momentum and continuity equations in the finite volumes. This integration leads to equations where the values of the variables at the cell faces are to be replaced by the expressions obtained at the previous stage. The linear system to be solved at each nonlinear iteration connects values of velocities and pressure at each grid point in each equation. The coefficient matrix is large, nonsymmetric, sparse, with non-null entries on the diagonal. The characteristics of these linear systems indicate the use of nonstationary iterative methods, for instance preconditioned GMRES, for their solution. The strategy used to parallelize this method was nonoverlapping domain decomposition. The linear system to be solved at each outer iteration is then equivalent to the solution, on the interfaces separating subdomains, of the Schur complement reduced system followed by the update of the solution in the subdomains. Numerical tests will be reported showing the number of outer iterations and elapsed times of this code on a Transputer based machine, compared to the corresponding results on a cluster of workstations.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 15
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Performance of a QR algorithm implementation on a multicluster of transputers (1995)
Article in International Scientific Journal
ferreira, fj; vasconcelos, pb; dalmeida, fd
A parallel implementation of the Atkinson algorithm for solving a Fredholm equation (2003)
Article in International Scientific Journal
dalmeida, fd; vasconcelos, pb
Integral Operator Spectral Computations using PETSc/SLEPc libraries (2010)
Article in International Conference Proceedings Book
vasconcelos, pb; roman, je; dalmeida, fd
Recommend this page Top
Copyright 1996-2024 © Faculdade de Economia da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z  I Guest Book
Page created on: 2024-08-17 at 03:51:11 | Acceptable Use Policy | Data Protection Policy | Complaint Portal
SAMA2