Papers › Heat transport in a hierarchy of reduced-order convection models
Heat transport in a hierarchy of reduced-order convection models
Matthew L. Olson, Charles R. Doering
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Reduced-order models (ROMs) are systems of ordinary differential equations (ODEs) designed to approximate the dynamics of partial differential equations (PDEs). In this work, a distinguished hierarchy of ROMs is constructed for Rayleigh's 1916 model of natural thermal convection. These models are distinguished in the sense that they preserve energy and vorticity balances derived from the governing equations, and each is capable of modeling zonal flow. Various models from the hierarchy are analyzed to determine the maximal heat transport in a given model, measured by the dimensionless Nusselt number, for a given Rayleigh number. Lower bounds on the maximal heat transport are ascertained by computing the Nusselt number among equilibria of the chosen model using numerical continuation. A method known as sum-of-squares optimization is applied to construct upper bounds on the time-averaged Nusselt number. In this case, the sum-of-squares approach involves constructing a polynomial quantity whose global nonnegativity implies the upper bound along all solutions to a chosen ROM. The minimum such bound is determined through a type of convex optimization called semidefinite programming. For the ROMs studied in this work, the Nusselt number is maximized by equilibria whenever the Rayleigh number is sufficiently small. In this range of Rayleigh number, the equilibria maximizing heat transport are those that bifurcate first from the zero state. Analyzing this primary equilibrium branch provides a possible mechanism for the increase in heat transport near the onset of convection.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections