Bicompact Schemes on Locally Adaptive Cartesian Grids for the Convection–Diffusion Equation

High-order accurate bicompact schemes for the multidimensional convection–diffusion equation with constant coefficients are considered. A substitution of dependent variables and simplified boundary conditions are used to construct a new implementation of these schemes on regular Cartesian grids. In contrast to a previous implementation, this one is based on multidimensional space marching computations, which allow on-the-fly interpolation of the sought functions on cell edges and faces, i.e., interpolation in the course of traversing the cells. Due to this property, the new implementation is generalized to hierarchical Cartesian grids with solution-based local adaptive mesh refinement. The computational algorithm is tested in wide ranges of the Courant number and the number of adaptation levels, and the test results demonstrate a high (third) order of accuracy.

Authors

Institutions

Publication Details

Journal
Computational Mathematics and Mathematical Physics
Published
2025-04-01
DOI
https://doi.org/10.1134/s0965542525700022
Primary Topic
Computational Fluid Dynamics and Aerodynamics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bicompact Schemes on Locally Adaptive Cartesian Grids for the Convection–Diffusion Equation

М. Д. Брагин
Computational Mathematics and Mathematical Physics
Computational Fluid Dynamics and Aerodynamics
article

Bicompact Schemes on Locally Adaptive Cartesian Grids for the Convection–Diffusion Equation

М. Д. Брагин
article en

Abstract

High-order accurate bicompact schemes for the multidimensional convection–diffusion equation with constant coefficients are considered. A substitution of dependent variables and simplified boundary conditions are used to construct a new implementation of these schemes on regular Cartesian grids. In contrast to a previous implementation, this one is based on multidimensional space marching computations, which allow on-the-fly interpolation of the sought functions on cell edges and faces, i.e., interpolation in the course of traversing the cells. Due to this property, the new implementation is generalized to hierarchical Cartesian grids with solution-based local adaptive mesh refinement. The computational algorithm is tested in wide ranges of the Courant number and the number of adaptation levels, and the test results demonstrate a high (third) order of accuracy.

Computational Mathematics and Mathematical PhysicsVol. 65(4)
Keldysh Institute of Applied Mathematics (RU)
Climate action
Openalex Percentile: Top 85%
Computational Fluid Dynamics and Aerodynamics
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.