Tony Shardlow
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Tony Shardlow has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
- Federico Cornalba
Department of Mathematical Sciences , University of Bath
8 shared publications - Johannes Zimmer
Technische Universität München
6 shared publications - Eike Hermann Müller
University of Bath
5 shared publications - Gabriel James Lord
Department of Mathematics, IMAPP, Radboud University, Nijmegen, The Netherlands
3 shared publications - Hamzah Alzubaidi
Department of Pharmacy Practice and Pharmacotherapeutics, University of Sharjah, Sharjah, United Arab Emirates
3 shared publications - Teo Deveney
University of Bath
3 shared publications
Latest Publications
- 25 February 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 19 (1) , 327-363
Compression of Currents and Varifolds
We derive an algorithm for compression of the currents and varifolds representations of shapes using Ridge Leverage Score sampling and the theory of Nystrom approximation in Reproducing Kernel Hilbert Spaces. Our method is faster than existing compression techniques and comes with theoretical guarantees on the rate of convergence of the compressed approximation as a function of the smoothness of the associated shape representation. The obtained compressions are shown to be useful for down-line tasks such as nonlinear shape registration in the Large Deformation Diffeomorphic Metric Mapping (LDDMM) framework, even for very high compression ratios. The performance of our algorithm is demonstrated on large-scale shape data from modern geometry processing datasets and is shown to be fast and scalable with rapid error decay.
- 25 February 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 19 (1) , 327-363
Compression of Currents and Varifolds
We derive an algorithm for compression of the currents and varifolds representations of shapes using Ridge Leverage Score sampling and the theory of Nystrom approximation in Reproducing Kernel Hilbert Spaces. Our method is faster than existing compression techniques and comes with theoretical guarantees on the rate of convergence of the compressed approximation as a function of the smoothness of the associated shape representation. The obtained compressions are shown to be useful for down-line tasks such as nonlinear shape registration in the Large Deformation Diffeomorphic Metric Mapping (LDDMM) framework, even for very high compression ratios. The performance of our algorithm is demonstrated on large-scale shape data from modern geometry processing datasets and is shown to be fast and scalable with rapid error decay.
- Open Access
- 1 January 2026
- Published by IOP Publishing in Medical Engineering & Physics
- Vol. 147 (1) , 015009
Gaussian process diffeomorphic statistical shape modelling for assessment of hip dysplasia
Dysplasia is a recognized risk factor for osteoarthritis (OA) of the hip, early diagnosis of dysplasia is important to provide opportunities for surgical interventions aimed at reducing the risk of hip OA. We have developed a pipeline for semi-automated classification of dysplasia using 3D surface models obtained from volumetric CT scans of patients' hips and a minimal set of four clinically annotated landmarks on the acetabular rim (the most proximal, distal, anterior and posterior aspects), combining the framework of the Gaussian process latent variable model with diffeomorphism to create a statistical shape model (SSM), which we termed the Gaussian process diffeomorphic SSM (GPDSSM). We used 192 CT scans, 100 for model training and 92 for testing. The GPDSSM effectively distinguishes dysplastic samples from controls while also highlighting regions of the underlying surface that show dysplastic variations. As well as improving classification accuracy compared to angle-based methods (AUC 96.2% vs 91.2%), the GPDSSM can save time for clinicians by removing the need to manually measure angles and interpreting 2D scans for possible markers of dysplasia.
- 1 January 2026
- Published by IOP Publishing in Medical Engineering & Physics
- Vol. 147 (1) , 015009
Open AccessGaussian process diffeomorphic statistical shape modelling for assessment of hip dysplasia
Dysplasia is a recognized risk factor for osteoarthritis (OA) of the hip, early diagnosis of dysplasia is important to provide opportunities for surgical interventions aimed at reducing the risk of hip OA. We have developed a pipeline for semi-automated classification of dysplasia using 3D surface models obtained from volumetric CT scans of patients' hips and a minimal set of four clinically annotated landmarks on the acetabular rim (the most proximal, distal, anterior and posterior aspects), combining the framework of the Gaussian process latent variable model with diffeomorphism to create a statistical shape model (SSM), which we termed the Gaussian process diffeomorphic SSM (GPDSSM). We used 192 CT scans, 100 for model training and 92 for testing. The GPDSSM effectively distinguishes dysplastic samples from controls while also highlighting regions of the underlying surface that show dysplastic variations. As well as improving classification accuracy compared to angle-based methods (AUC 96.2% vs 91.2%), the GPDSSM can save time for clinicians by removing the need to manually measure angles and interpreting 2D scans for possible markers of dysplasia.
- Open Access
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (6) , 1-25
Curvature Enthusiasm: Correspondence-Free Interpolation and Matching of Articulated 3D Shapes using Compressed Normal Cycles
We present an unsupervised framework for physically plausible shape interpolation and dense correspondence estimation between 3D articulated shapes. Our approach intentionally focuses upon pose variation within the same identity, which we believe is a meaningful and challenging problem in its own right. Our method uses Neural Ordinary Differential Equations (NODEs) to generate smooth flow fields that define diffeomorphic transformations, ensuring topological consistency and preventing self-intersections while accommodating hard constraints, such as volume preservation. By incorporating a lightweight skeletal structure, we impose kinematic constraints that resolve symmetries without requiring manual skinning or predefined poses. We enhance physical realism by interpolating skeletal motion with dual quaternions and applying constrained optimisation to align the flow field with the skeleton, preserving local rigidity. Additionally, we employ an efficient formulation of Normal Cycles, a metric from geometric measure theory, to capture higher-order surface details like curvature, enabling precise alignment between complex articulated structures and recovery of accurate dense correspondence mapping. Evaluations on multiple benchmarks show notable improvements over state-of-the-art methods in both interpolation quality and correspondence accuracy, with consistent performance across different skeletal configurations, demonstrating broad utility for shape matching and animation tasks.
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (6) , 1-25
Open AccessCurvature Enthusiasm: Correspondence-Free Interpolation and Matching of Articulated 3D Shapes using Compressed Normal Cycles
We present an unsupervised framework for physically plausible shape interpolation and dense correspondence estimation between 3D articulated shapes. Our approach intentionally focuses upon pose variation within the same identity, which we believe is a meaningful and challenging problem in its own right. Our method uses Neural Ordinary Differential Equations (NODEs) to generate smooth flow fields that define diffeomorphic transformations, ensuring topological consistency and preventing self-intersections while accommodating hard constraints, such as volume preservation. By incorporating a lightweight skeletal structure, we impose kinematic constraints that resolve symmetries without requiring manual skinning or predefined poses. We enhance physical realism by interpolating skeletal motion with dual quaternions and applying constrained optimisation to align the flow field with the skeleton, preserving local rigidity. Additionally, we employ an efficient formulation of Normal Cycles, a metric from geometric measure theory, to capture higher-order surface details like curvature, enabling precise alignment between complex articulated structures and recovery of accurate dense correspondence mapping. Evaluations on multiple benchmarks show notable improvements over state-of-the-art methods in both interpolation quality and correspondence accuracy, with consistent performance across different skeletal configurations, demonstrating broad utility for shape matching and animation tasks.
- Open Access
Compressed online Sinkhorn
The use of optimal transport (OT) distances, and in particular entropic-regularised OT distances, is an increasingly popular evaluation metric in many areas of machine learning and data science. Their use has largely been driven by the availability of efficient algorithms such as the Sinkhorn algorithm. One of the drawbacks of the Sinkhorn algorithm for large-scale data processing is that it is a two-phase method, where one first draws a large stream of data from the probability distributions, before applying the Sinkhorn algorithm to the discrete probability measures. More recently, there have been several works developing stochastic versions of Sinkhorn that directly handle continuous streams of data. In this work, we revisit the recently introduced online Sinkhorn algorithm of [Mensch and Peyré, 2020]. Our contributions are twofold: We improve the convergence analysis for the online Sinkhorn algorithm, the new rate that we obtain is faster than the previous rate under certain parameter choices. We also present numerical results to verify the sharpness of our result. Secondly, we propose the compressed online Sinkhorn algorithm which combines measure compression techniques with the online Sinkhorn algorithm. We provide numerical experiments to show practical numerical gains, as well as theoretical guarantees on the efficiency of our approach.
Open AccessCompressed online Sinkhorn
The use of optimal transport (OT) distances, and in particular entropic-regularised OT distances, is an increasingly popular evaluation metric in many areas of machine learning and data science. Their use has largely been driven by the availability of efficient algorithms such as the Sinkhorn algorithm. One of the drawbacks of the Sinkhorn algorithm for large-scale data processing is that it is a two-phase method, where one first draws a large stream of data from the probability distributions, before applying the Sinkhorn algorithm to the discrete probability measures. More recently, there have been several works developing stochastic versions of Sinkhorn that directly handle continuous streams of data. In this work, we revisit the recently introduced online Sinkhorn algorithm of [Mensch and Peyré, 2020]. Our contributions are twofold: We improve the convergence analysis for the online Sinkhorn algorithm, the new rate that we obtain is faster than the previous rate under certain parameter choices. We also present numerical results to verify the sharpness of our result. Secondly, we propose the compressed online Sinkhorn algorithm which combines measure compression techniques with the online Sinkhorn algorithm. We provide numerical experiments to show practical numerical gains, as well as theoretical guarantees on the efficiency of our approach.
- Open Access
The Regularised Inertial Dean-Kawasaki equation: discontinuous Galerkin approximation and modelling for low-density regime
The Regularised Inertial Dean-Kawasaki model (RIDK) -- introduced by the authors and J. Zimmer in earlier works -- is a nonlinear stochastic PDE capturing fluctuations around the mean-field limit for large-scale particle systems in both particle density and momentum density. We focus on the following two aspects. Firstly, we set up a Discontinuous Galerkin (DG) discretisation scheme for the RIDK model: we provide suitable definitions of numerical fluxes at the interface of the mesh elements which are consistent with the wave-type nature of the RIDK model and grant stability of the simulations, and we quantify the rate of convergence in mean square to the continuous RIDK model. Secondly, we introduce modifications of the RIDK model in order to preserve positivity of the density (such a feature only holds in a ''high-probability sense'' for the original RIDK model). By means of numerical simulations, we show that the modifications lead to physically realistic and positive density profiles. In one case, subject to additional regularity constraints, we also prove positivity. Finally, we present an application of our methodology to a system of diffusing and reacting particles. Our Python code is available in open-source format.
Open AccessThe Regularised Inertial Dean-Kawasaki equation: discontinuous Galerkin approximation and modelling for low-density regime
The Regularised Inertial Dean-Kawasaki model (RIDK) -- introduced by the authors and J. Zimmer in earlier works -- is a nonlinear stochastic PDE capturing fluctuations around the mean-field limit for large-scale particle systems in both particle density and momentum density. We focus on the following two aspects. Firstly, we set up a Discontinuous Galerkin (DG) discretisation scheme for the RIDK model: we provide suitable definitions of numerical fluxes at the interface of the mesh elements which are consistent with the wave-type nature of the RIDK model and grant stability of the simulations, and we quantify the rate of convergence in mean square to the continuous RIDK model. Secondly, we introduce modifications of the RIDK model in order to preserve positivity of the density (such a feature only holds in a ''high-probability sense'' for the original RIDK model). By means of numerical simulations, we show that the modifications lead to physically realistic and positive density profiles. In one case, subject to additional regularity constraints, we also prove positivity. Finally, we present an application of our methodology to a system of diffusing and reacting particles. Our Python code is available in open-source format.
- Open Access
- 1 September 2023
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 57 (5) , 3061-3090
The regularised inertial Dean–Kawasaki equation: discontinuous Galerkin approximation and modelling for low-density regime
The Regularised Inertial Dean–Kawasaki model (RIDK) – introduced by the authors and J. Zimmer in earlier works – is a nonlinear stochastic PDE capturing fluctuations around the meanfield limit for large-scale particle systems in both particle density and momentum density. We focus on the following two aspects. Firstly, we set up a Discontinuous Galerkin (DG) discretisation scheme for the RIDK model: we provide suitable definitions of numerical fluxes at the interface of the mesh elements which are consistent with the wave-type nature of the RIDK model and grant stability of the simulations, and we quantify the rate of convergence in mean square to the continuous RIDK model. Secondly, we introduce modifications of the RIDK model in order to preserve positivity of the density (such a feature only holds in a “high-probability sense” for the original RIDK model). By means of numerical simulations, we show that the modifications lead to physically realistic and positive density profiles. In one case, subject to additional regularity constraints, we also prove positivity. Finally, we present an application of our methodology to a system of diffusing and reacting particles. Our Python code is available in open-source format.
- 1 September 2023
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 57 (5) , 3061-3090
Open AccessThe regularised inertial Dean–Kawasaki equation: discontinuous Galerkin approximation and modelling for low-density regime
The Regularised Inertial Dean–Kawasaki model (RIDK) – introduced by the authors and J. Zimmer in earlier works – is a nonlinear stochastic PDE capturing fluctuations around the meanfield limit for large-scale particle systems in both particle density and momentum density. We focus on the following two aspects. Firstly, we set up a Discontinuous Galerkin (DG) discretisation scheme for the RIDK model: we provide suitable definitions of numerical fluxes at the interface of the mesh elements which are consistent with the wave-type nature of the RIDK model and grant stability of the simulations, and we quantify the rate of convergence in mean square to the continuous RIDK model. Secondly, we introduce modifications of the RIDK model in order to preserve positivity of the density (such a feature only holds in a “high-probability sense” for the original RIDK model). By means of numerical simulations, we show that the modifications lead to physically realistic and positive density profiles. In one case, subject to additional regularity constraints, we also prove positivity. Finally, we present an application of our methodology to a system of diffusing and reacting particles. Our Python code is available in open-source format.
- 28 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM/ASA Journal on Uncertainty Quantification
- Vol. 11 (3) , 970-995
Deep Surrogate Accelerated Delayed-Acceptance Hamiltonian Monte Carlo for Bayesian Inference of Spatio-Temporal Heat Fluxes in Rotating Disc Systems
We introduce a deep learning accelerated methodology to solve PDE-based Bayesian inverse problems with guaranteed accuracy. This is motivated by solving the ill-posed problem of inferring a spatio-temporal heat-flux parameter known as the Biot number in a PDE model given temperature data; however, the methodology is generalizable to other settings. To achieve accelerated Bayesian inference we develop a novel training scheme that uses data to adaptively train a neural-network surrogate simulating the parametric forward model. By simultaneously identifying an approximate posterior distribution over the Biot number and weighting a physics-informed training loss according to this, our approach approximates a forward and inverse solution together without any need for external solves. Using a random Chebyshev series, we outline how to approximate a Gaussian process prior, and using the surrogate we apply Hamiltonian Monte Carlo (HMC) to sample from the posterior distribution. We derive convergence of the surrogate posterior to the true posterior distribution in the Hellinger metric as our adaptive loss approaches zero. Additionally, we describe how this surrogate-accelerated HMC approach can be combined with traditional PDE solvers in a delayed-acceptance scheme to a priori control the posterior accuracy. This overcomes a major limitation of deep learning-based surrogate approaches, which do not achieve guaranteed accuracy a priori due to their nonconvex training. Biot number calculations are involved in turbo-machinery design, which is safety critical and highly regulated, and therefore it is important that our results have such mathematical guarantees. Our approach achieves fast mixing in high-dimensional parameter spaces, while retaining the convergence guarantees of a traditional PDE solver, and without the burden of evaluating this solver for proposals that are likely to be rejected. A range of numerical results is given using real and simulated data that compare adaptive and general training regimes and various gradient-based Markov chain Monte Carlo sampling methods.
- 28 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM/ASA Journal on Uncertainty Quantification
- Vol. 11 (3) , 970-995
Deep Surrogate Accelerated Delayed-Acceptance Hamiltonian Monte Carlo for Bayesian Inference of Spatio-Temporal Heat Fluxes in Rotating Disc Systems
We introduce a deep learning accelerated methodology to solve PDE-based Bayesian inverse problems with guaranteed accuracy. This is motivated by solving the ill-posed problem of inferring a spatio-temporal heat-flux parameter known as the Biot number in a PDE model given temperature data; however, the methodology is generalizable to other settings. To achieve accelerated Bayesian inference we develop a novel training scheme that uses data to adaptively train a neural-network surrogate simulating the parametric forward model. By simultaneously identifying an approximate posterior distribution over the Biot number and weighting a physics-informed training loss according to this, our approach approximates a forward and inverse solution together without any need for external solves. Using a random Chebyshev series, we outline how to approximate a Gaussian process prior, and using the surrogate we apply Hamiltonian Monte Carlo (HMC) to sample from the posterior distribution. We derive convergence of the surrogate posterior to the true posterior distribution in the Hellinger metric as our adaptive loss approaches zero. Additionally, we describe how this surrogate-accelerated HMC approach can be combined with traditional PDE solvers in a delayed-acceptance scheme to a priori control the posterior accuracy. This overcomes a major limitation of deep learning-based surrogate approaches, which do not achieve guaranteed accuracy a priori due to their nonconvex training. Biot number calculations are involved in turbo-machinery design, which is safety critical and highly regulated, and therefore it is important that our results have such mathematical guarantees. Our approach achieves fast mixing in high-dimensional parameter spaces, while retaining the convergence guarantees of a traditional PDE solver, and without the burden of evaluating this solver for proposals that are likely to be rejected. A range of numerical results is given using real and simulated data that compare adaptive and general training regimes and various gradient-based Markov chain Monte Carlo sampling methods.
- Open Access
Deep surrogate accelerated delayed-acceptance HMC for Bayesian inference of spatio-temporal heat fluxes in rotating disc systems
We introduce a deep learning accelerated methodology to solve PDE-based Bayesian inverse problems with guaranteed accuracy. This is motivated by the ill-posed problem of inferring a spatio-temporal heat-flux parameter known as the Biot number given temperature data, however the methodology is generalisable to other settings. To accelerate Bayesian inference, we develop a novel training scheme that uses data to adaptively train a neural-network surrogate simulating the parametric forward model. By simultaneously identifying an approximate posterior distribution over the Biot number, and weighting a physics-informed training loss according to this, our approach approximates forward and inverse solution together without any need for external solves. Using a random Chebyshev series, we outline how to approximate a Gaussian process prior, and using the surrogate we apply Hamiltonian Monte Carlo (HMC) to sample from the posterior distribution. We derive convergence of the surrogate posterior to the true posterior distribution in the Hellinger metric as our adaptive loss approaches zero. Additionally, we describe how this surrogate-accelerated HMC approach can be combined with traditional PDE solvers in a delayed-acceptance scheme to a-priori control the posterior accuracy. This overcomes a major limitation of deep learning-based surrogate approaches, which do not achieve guaranteed accuracy a-priori due to their non-convex training. Biot number calculations are involved in turbo-machinery design, which is safety critical and highly regulated, therefore it is important that our results have such mathematical guarantees. Our approach achieves fast mixing in high dimensions whilst retaining the convergence guarantees of a traditional PDE solver, and without the burden of evaluating this solver for proposals that are likely to be rejected. Numerical results are given using real and simulated data.
Open AccessDeep surrogate accelerated delayed-acceptance HMC for Bayesian inference of spatio-temporal heat fluxes in rotating disc systems
We introduce a deep learning accelerated methodology to solve PDE-based Bayesian inverse problems with guaranteed accuracy. This is motivated by the ill-posed problem of inferring a spatio-temporal heat-flux parameter known as the Biot number given temperature data, however the methodology is generalisable to other settings. To accelerate Bayesian inference, we develop a novel training scheme that uses data to adaptively train a neural-network surrogate simulating the parametric forward model. By simultaneously identifying an approximate posterior distribution over the Biot number, and weighting a physics-informed training loss according to this, our approach approximates forward and inverse solution together without any need for external solves. Using a random Chebyshev series, we outline how to approximate a Gaussian process prior, and using the surrogate we apply Hamiltonian Monte Carlo (HMC) to sample from the posterior distribution. We derive convergence of the surrogate posterior to the true posterior distribution in the Hellinger metric as our adaptive loss approaches zero. Additionally, we describe how this surrogate-accelerated HMC approach can be combined with traditional PDE solvers in a delayed-acceptance scheme to a-priori control the posterior accuracy. This overcomes a major limitation of deep learning-based surrogate approaches, which do not achieve guaranteed accuracy a-priori due to their non-convex training. Biot number calculations are involved in turbo-machinery design, which is safety critical and highly regulated, therefore it is important that our results have such mathematical guarantees. Our approach achieves fast mixing in high dimensions whilst retaining the convergence guarantees of a traditional PDE solver, and without the burden of evaluating this solver for proposals that are likely to be rejected. Numerical results are given using real and simulated data.
- Open Access
- 1 May 2022
- Published by AIP Publishing in Physics of Fluids
- Vol. 34 (5) , 056108
Use of Bayesian statistics to calculate transient heat fluxes on compressor disks
Future gas turbine engines require improved understanding of the heat transfer between compressor disks and air in compressor cavities under transient operating conditions. Calculation of transient heat fluxes from temperature measurements on compressor disks is a typical ill-posed inverse problem where small uncertainties of measurements can lead to large uncertainties of the calculated fluxes. This paper develops a Bayesian model for the heat flux to reduce the adverse nature of the problem by using a Gaussian prior distribution with Matérn covariance. To efficiently find the maximum a posterior, a neural network was used to solve the heat equation for compressor disks for any choice of parameters, allowing fast evaluation of the solution to the forward model for any heat flux of interest. The power of the Bayesian model is first demonstrated using numerically simulated data. Subsequently, the model is used to calculate heat fluxes from measurements of transient temperature collected from the Compressor Cavity Rig at the University of Bath. During these transient tests, the periphery of the rotating compressor disk was initially heated to a steady-state condition and then cooled rapidly by the ambient air. The fluxes for four transient cycles were calculated, with the operating range of , and , where , and χ are the rotational Reynolds number, the buoyancy parameter, and the compressibility parameter, respectively. The results show that, for all four cases, the flow and the heat transfer in the closed cavity were initially dominated by buoyancy effects, with heat transferred from the disk to the cavity air in the outer region and reversed in the inner region. The initial heat fluxes at were higher than those at owing to a compressibility effect. During the cooling transient, for cases with , the magnitudes of the heat fluxes gradually decreased and eventually reached virtually zero. This indicated that the flow was first governed by the buoyancy effects and then became stratified. At , where the rotational speed was at its maximum, buoyancy-induced flow dominated the entirety of the transient process due to significant frictional heating at the periphery of the rig. The calculated fluxes present evidence for future theoretical and computational modeling of transient disk heat transfer, and the Bayesian model provides guidance for transient temperature data analysis.- 1 May 2022
- Published by AIP Publishing in Physics of Fluids
- Vol. 34 (5) , 056108
Open AccessUse of Bayesian statistics to calculate transient heat fluxes on compressor disks
Future gas turbine engines require improved understanding of the heat transfer between compressor disks and air in compressor cavities under transient operating conditions. Calculation of transient heat fluxes from temperature measurements on compressor disks is a typical ill-posed inverse problem where small uncertainties of measurements can lead to large uncertainties of the calculated fluxes. This paper develops a Bayesian model for the heat flux to reduce the adverse nature of the problem by using a Gaussian prior distribution with Matérn covariance. To efficiently find the maximum a posterior, a neural network was used to solve the heat equation for compressor disks for any choice of parameters, allowing fast evaluation of the solution to the forward model for any heat flux of interest. The power of the Bayesian model is first demonstrated using numerically simulated data. Subsequently, the model is used to calculate heat fluxes from measurements of transient temperature collected from the Compressor Cavity Rig at the University of Bath. During these transient tests, the periphery of the rotating compressor disk was initially heated to a steady-state condition and then cooled rapidly by the ambient air. The fluxes for four transient cycles were calculated, with the operating range of , and , where , and χ are the rotational Reynolds number, the buoyancy parameter, and the compressibility parameter, respectively. The results show that, for all four cases, the flow and the heat transfer in the closed cavity were initially dominated by buoyancy effects, with heat transferred from the disk to the cavity air in the outer region and reversed in the inner region. The initial heat fluxes at were higher than those at owing to a compressibility effect. During the cooling transient, for cases with , the magnitudes of the heat fluxes gradually decreased and eventually reached virtually zero. This indicated that the flow was first governed by the buoyancy effects and then became stratified. At , where the rotational speed was at its maximum, buoyancy-induced flow dominated the entirety of the transient process due to significant frictional heating at the periphery of the rig. The calculated fluxes present evidence for future theoretical and computational modeling of transient disk heat transfer, and the Bayesian model provides guidance for transient temperature data analysis. - Open Access
- 1 May 2021
- Published by Elsevier in Journal of Differential Equations
- Vol. 284, 253-283
Well-posedness for a regularised inertial Dean–Kawasaki model for slender particles in several space dimensions
- 1 May 2021
- Published by Elsevier in Journal of Differential Equations
- Vol. 284, 253-283
Open AccessWell-posedness for a regularised inertial Dean–Kawasaki model for slender particles in several space dimensions