An efficient eigenvalue bounding method: CFL condition revisited

Direct and large-eddy simulations of turbulence are often solved using explicit temporal schemes. However, this imposes very small time-steps because the eigenvalues of the (linearized) dynamical system, re-scaled by the time-step, must lie inside the stability region. In practice, fast and accurate estimations of the spectral radii of both the discrete convective and diffusive terms are therefore needed. This is virtually always done using the so-called CFL condition. On the other hand, the large heterogeneity and complexity of modern supercomputing systems are nowadays hindering the efficient cross-platform portability of CFD codes. In this regard, our leitmotiv reads: relying on a minimal set of (algebraic) kernels is crucial for code portability and maintenance! In this context, this work focuses on the computation of eigenbounds for the above-mentioned convective and diffusive matrices which are needed to determine the time-step à la CFL. To do so, a new inexpensive method, that does not require to re-construct these time-dependent matrices, is proposed and tested. It just relies on a sparse-matrix vector product where only vectors change on time. Hence, both implementation in existing codes and cross-platform portability are straightforward. The effectiveness and robustness of the method are demonstrated for different test cases on both structured Cartesian and unstructured meshes. Finally, the method is combined with a self-adaptive temporal scheme, leading to significantly larger time-steps compared with other more conventional CFL-based approaches. • A new method to compute eigenbounds of convective and diffusive terms is proposed. • It is inexpensive as classical CFL condition but significantly more accurate. • It only relies on a sparse-matrix vector product where only vectors change on time. • Implementation and cross-platform portability are straightforward. • Numerical tests have shown CPU-cost reduction of up to 4 compared with CFL condition.

Authors

Institutions

Publication Details

Journal
Computer Physics Communications
Published
2024-08-23
DOI
https://doi.org/10.1016/j.cpc.2024.109351
Citations
1
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.37

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An efficient eigenvalue bounding method: CFL condition revisited

A. Gorobets, A. Oliva, F. Xavier Trias, Àdel Alsalti-Baldellou et al.
1 citations
Computer Physics Communications
Advanced Numerical Methods in Computational Mathematics
0.37
article

An efficient eigenvalue bounding method: CFL condition revisited

A. Gorobets, A. Oliva, F. Xavier Trias, Àdel Alsalti-Baldellou, Xavier Álvarez-Farré
article en
1 citations

Abstract

Direct and large-eddy simulations of turbulence are often solved using explicit temporal schemes. However, this imposes very small time-steps because the eigenvalues of the (linearized) dynamical system, re-scaled by the time-step, must lie inside the stability region. In practice, fast and accurate estimations of the spectral radii of both the discrete convective and diffusive terms are therefore needed. This is virtually always done using the so-called CFL condition. On the other hand, the large heterogeneity and complexity of modern supercomputing systems are nowadays hindering the efficient cross-platform portability of CFD codes. In this regard, our leitmotiv reads: relying on a minimal set of (algebraic) kernels is crucial for code portability and maintenance! In this context, this work focuses on the computation of eigenbounds for the above-mentioned convective and diffusive matrices which are needed to determine the time-step à la CFL. To do so, a new inexpensive method, that does not require to re-construct these time-dependent matrices, is proposed and tested. It just relies on a sparse-matrix vector product where only vectors change on time. Hence, both implementation in existing codes and cross-platform portability are straightforward. The effectiveness and robustness of the method are demonstrated for different test cases on both structured Cartesian and unstructured meshes. Finally, the method is combined with a self-adaptive temporal scheme, leading to significantly larger time-steps compared with other more conventional CFL-based approaches. • A new method to compute eigenbounds of convective and diffusive terms is proposed. • It is inexpensive as classical CFL condition but significantly more accurate. • It only relies on a sparse-matrix vector product where only vectors change on time. • Implementation and cross-platform portability are straightforward. • Numerical tests have shown CPU-cost reduction of up to 4 compared with CFL condition.

Computer Physics CommunicationsVol. 305
Leitat Technological Center (ES), Hospital de Sabadell (ES), Keldysh Institute of Applied Mathematics (RU)
Ministerio de Ciencia, Innovación y Universidades, Ministerio de Economía y Competitividad, Ministerio de Ciencia e Innovación, Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España, Agència de Gestió d'Ajuts Universitaris i de Recerca, Agencia Estatal de Investigación
Climate action
Openalex Percentile: Top 44%
Advanced Numerical Methods in Computational Mathematics
0.37
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.