2026-06-29T08:02:14Zhttps://docta.ucm.es/rest/oai/requestoai:docta.ucm.es:20.500.14352/585762023-08-27T02:00:56Zcom_20.500.14352_14col_20.500.14352_15
An efficient iterative solution method for the Chebyshev collocation of advection-dominated transport problems
Pinelli, Alfredo
Couzy, W.
Deville, M. O.
Benocci, C.
51
advection-diffusion
collocation
Chebyshev
preconditioning
finite difference
staggered grid
Matemáticas (Matemáticas)
12 Matemáticas
A new Chebyshev collocation algorithm is proposed for the iterative solution of advection-diffusion problems. The main features of the method lie in the original way in which a finite-difference preconditioner is built and in the fact that the solution is collocated on a set of nodes matching the standard Gauss-Lobatto-Chebyshev set only in the case of pure diffusion problems. The key point of the algorithm is the capability of the preconditioner to represent the high-frequency modes when dealing with advection-dominated problems. The basic idea is developed for a one-dimensional case and is extended to two-dimensional problems. A series of numerical experiments is carried out to demonstrate the efficiency of the algorithm. The proposed algorithm can also be used in the context of the incompressible Navier-Stokes equations.
SPPS (Services du Premier Ministre, Programmation de la Politique Scientifique)
Depto. de Análisis Matemático y Matemática Aplicada
Fac. de Ciencias Matemáticas
TRUE
pub
2023-06-20T18:46:27Z
2023-06-20T18:46:27Z
1996
journal article
https://hdl.handle.net/20.500.14352/58576
1064-8275
10.1137/S1064827593253835
eng
Belgian Incentive Program "Information Technology-Computer Science ofthe Future"
open access
application/pdf
Society for Industrial and Applied Mathematics