SEARCH · Search NASA

Results for “Balanced convergence rate”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Self-adaptive weights based on balanced residual decay rate for physics-informed neural networks and deep operator networks

Physics-informed deep learning has emerged as a promising alternative for solving partial differential equations. However, for complex problems, training these networks can still be challenging, often resulting in unsatisfactory accuracy and efficiency. In this work, we demonstrate that the failure of plain physics-informed neural networks arises from the significant discrepancy in the convergence rate of residuals at different training points, where the slowest convergence rate dominates the overall solution convergence. Based on these observations, we propose a pointwise adaptive weighting method that balances the residual decay rate across different training points. The performance of our proposed adaptive weighting method is compared with current state-of-the-art adaptive weighting methods on benchmark problems for both physics-informed neural networks and physics-informed deep operator networks. In conclusion, through extensive numerical results we demonstrate that our proposed approach of balanced residual decay rates offers several advantages, including bounded weights, high prediction accuracy, fast convergence rate, low training uncertainty, low computational cost, and ease of hyperparameter tuning.

Balanced convergence rate↗

DOE OSTI2021

Addressing Load Imbalance in Bioinformatics and Biomedical Applications: Efficient Scheduling across Multiple GPUs

Computational bioinformatics and biomedical applications frequently contain heterogeneously sized units of work or tasks, for instance due to variability in the sizes of biological sequences and molecules. Variable-sized workloads lead to load imbalances in parallel implementations which detract from efficiency and performance. Many modern computing resources now have multiple graphics processing units(GPUs) per computer for acceleration. These multiple GPU resources need to be used efficiently through balancing of workloads across the GPUs. OpenMP is a portable directive-based parallel programming API used ubiquitously in bioscience applications to program CPUs; recently, the use of OpenMP directives for GPU acceleration has become possible. Here, motivated by experiences with imbalanced loads in GPU-accelerated bioinformatics applications, we address the load balancing problem using OpenMP task-to-GPU scheduling combined with OpenMP GPU offloading for multiply heterogeneous workloads – loads with both variable input sizes, and simultaneously, variable convergence rates for algorithms with a stochastic component – scheduled across multiple GPUs. We aim to develop strategies which are both easy to use and have lower overheads, and may be incorporated incrementally in existing programs which already make use of OpenMP for CPU-based threading in order to make use of multi-GPU computers. We test different combinations of input size variability and convergence rate variability, and characterize the effects of these different scenarios on the performance of scheduling strategies across multiple GPUs with OpenMP. We present several dynamic scheduling solutions for different parallel patterns, explore optimizations, and provide publicly available example computational kernels to make these strategies easy to use in programs. This work will enable application developers to efficiently and easily use multiple GPUs for imbalanced workloads found in bioinformatics and biomedical applications.

Thavappiragasam, Mathialakan↗

DOE OSTI2025

Self-regulating behavior of hybrid membrane systems as demonstrated in an element-scale forward osmosis-reverse osmosis hybrid system

Hybrid membrane systems can be difficult to design due to the requisite flow rate matching between up- and downstream unit operations. In this work, we use a forward osmosis-reverse osmosis (FO-RO) hybrid system to demonstrate how some membrane systems can exhibit self-regulating behavior due to osmotic coupling. This can reduce the need for complex control systems for flow balancing. We show this behavior using a module-scale test bed that can mimic the behavior of larger scale operations. The system shows permeate flow rate near-convergence between the FO and RO modules after startup or when perturbed by a change in RO module pressure. The behavior of this hybrid system demonstrates that some membrane operations can exploit osmotic interdependence, rather than expensive control systems, to achieve steady state operation.

Debottlenecking↗

DOE OSTI2021

Uniform convergence of an upwind discontinuous Galerkin method for solving scaled discrete-ordinate radiative transfer equations with isotropic scattering

Here we present an error analysis for the discontinuous Galerkin (DG) method applied to the discrete-ordinate discretization of the steady-state radiative transfer equation with isotropic scattering. Under some mild assumptions, we show that the DG method converges uniformly with respect to a scaling parameter which characterizes the strength of scattering in the system. However, the rate is not optimal and can be polluted by the presence of boundary layers. In one-dimensional slab geometries, we demonstrate optimal convergence when boundary layers are not present and analyze a simple strategy for balance interior and boundary layer errors. Some numerical tests are also provided in this reduced setting.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Decentralized Schemes with Overlap for Solving Graph-Structured Optimization Problems

We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it uses overlapping subdomains to promote and accelerate convergence. We show that the algorithm converges if the size of the overlap is sufficiently large and that the convergence rate improves exponentially with the size of the overlap. The proposed approach provides a bridge between fully decentralized and centralized architectures and is flexible in that it enables the implementation of asynchronous schemes, handling of constraints, and balancing of computing, communication, and data privacy needs. The proposed scheme is tested in an estimation problem for a 9241-node power network and we show that it outperforms the alternating direction method of multipliers.

asynchronous↗

DOE OSTI2023

Elevated nocturnal respiratory rates in the mitochondria of CAM plants: current knowledge and unanswered questions

Abstract Crassulacean acid metabolism (CAM) is a metabolic adaptation that has evolved convergently in 38 plant families to aid survival in water-limited niches. Whilst primarily considered a photosynthetic adaptation, CAM also has substantial consequences for nocturnal respiratory metabolism. Here, we outline the history, current state and future of nocturnal respiration research in CAM plants, with a particular focus on the energetics of nocturnal respiratory oxygen consumption. Throughout the 20th century, research interest in nocturnal respiration occurred alongside initial discoveries of CAM, although the energetic and mechanistic implications of nocturnal oxygen consumption and links to the operation of the CAM cycle were not fully understood. Recent flux balance analysis (FBA) models have provided new insights into the role that mitochondria play in the CAM cycle. Several FBA models have predicted that CAM requires elevated nocturnal respiratory rates, compared to C3 species, to power vacuolar malic acid accumulation. We provide physiological data, from the genus Clusia, to corroborate these modelling predictions, thereby reinforcing the importance of elevated nocturnal respiratory rates for CAM. Finally, we outline five unanswered questions pertaining to nocturnal respiration which must be addressed if we are to fully understand and utilize CAM plants in a hotter, drier world.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2023

Determining best practices for using genetic algorithms in molecular discovery

Genetic algorithms (GAs) are a powerful tool to search large chemical spaces for inverse molecular design. However, GAs have multiple hyperparameters that have not been thoroughly investigated for chemical space searches. In this tutorial, we examine the general effects of a number of hyperparameters, such as population size, elitism rate, selection method, mutation rate, and convergence criteria, on key GA performance metrics. Here, we show that using a self-termination method with a minimum Spearman’s rank correlation coefficient of 0.8 between generations maintained for 50 consecutive generations along with a population size of 32, a 50% elitism rate, three-way tournament selection, and a 40% mutation rate provides the best balance of finding the overall champion, maintaining good coverage of elite targets, and improving relative speedup for general use in molecular design GAs.

36 MATERIALS SCIENCE↗

DOE OSTI2026

Two-Level Sketching Alternating Anderson Acceleration for Complex Physics Applications

We present a novel two-level sketching extension of the Alternating Anderson–Picard (AAP) method for accelerating fixed-point iterations in challenging single- and multiphysics simulations governed by discretized PDEs. Our approach combines a static, physics-based projection that reduces the least-squares (LS) problem to the most informative field (e.g., via Schur-complement insight) with a dynamic, algebraic sketching stage driven by a backward stability analysis under Lipschitz continuity. We introduce inexpensive estimators for stability thresholds and cache-aware randomized selection strategies to balance computational cost against memory access overhead. The resulting algorithm solves reduced LS systems in place, minimizes memory footprints, and seamlessly alternates between low-cost Picard updates and Anderson mixing. Implemented in Julia, our two-level sketching AAP achieves up to 50% time-to-solution reductions compared to standard Anderson acceleration—without degrading convergence rates—on benchmark problems including Stokes, 𝑝-Laplacian, bidomain, and Navier–Stokes formulations at varying problem sizes. These results demonstrate the method’s robustness, scalability, and potential for integration into high-performance scientific computing frameworks. Our implementation is available open source in the AAP.jl library.

Barnafi, Nicolas [University of Chile, Santiago]↗

DOE OSTI2024

Arbitrary Order Virtual Element Methods for High‐Order Phase‐Field Modeling of Dynamic Fracture

ABSTRACT Accurate modeling of fracture nucleation and propagation in brittle and ductile materials subjected to dynamic loading is important in predicting material damage and failure under extreme conditions. Phase‐field fracture models have garnered a lot of attention in recent years due to their success in representing damage and fracture processes in a wide class of materials and under a variety of loading conditions. Second‐order phase‐field fracture models are by far the most popular among researchers (and increasingly, among practitioners), but fourth‐order models have started to gain broader acceptance since their more recent introduction. The exact solution corresponding to these high‐order phase‐field fracture models has higher regularity. Thus, numerical solutions of the model equations can achieve improved accuracy and higher spatial convergence rates. In this work, we develop a virtual element framework for the high‐order phase‐field model of dynamic fracture. The virtual element method (VEM) can be regarded as a generalization of the classical finite element method. In addition to many other desirable characteristics, the VEM allows computing on polytopal meshes. Here, we use ‐conforming virtual elements and the generalized‐ time integration method for the momentum balance equation, and adopt ‐conforming virtual elements for the high‐order phase‐field equation. We verify our virtual element framework using classical quasi‐static benchmark problems and demonstrate its capabilities with the aid of numerical simulations of dynamic fracture in brittle materials.

42 ENGINEERING↗

DOE OSTI2020

NSFnets (Navier-Stokes flow nets): Physics-informed neural networks for the incompressible Navier-Stokes equations

In the last 50 years there has been a tremendous progress in solving numerically the Navier-Stokes equations using finite differences, finite elements, spectral, and even meshless methods. Yet, in many real cases, we still cannot incorporate seamlessly (multi-fidelity) data into existing algorithms, and for industrial-complexity applications the mesh generation is time consuming and still an art. Moreover, solving ill-posed problems (e.g., lacking boundary conditions) or inverse problems is often prohibitively expensive and requires different formulations and new computer codes. Here, we employ physics-informed neural networks (PINNs), encoding the governing equations directly into the deep neural network via automatic differentiation, to overcome some of the aforementioned limitations for simulating incompressible laminar and turbulent flows. We develop the Navier-Stokes flow nets (NSFnets) by considering two different mathematical formulations of the Navier-Stokes equations: the velocity-pressure (VP) formulation and the vorticity-velocity (VV) formulation. Since this is a new approach, we first select some standard benchmark problems to assess the accuracy, convergence rate, computational cost and flexibility of NSFnets; analytical solutions and direct numerical simulation (DNS) databases provide proper initial and boundary conditions for the NSFnet simulations. The spatial and temporal coordinates are the inputs of the NSFnets, while the instantaneous velocity and pressure fields are the outputs for the VP-NSFnet, and the instantaneous velocity and vorticity fields are the outputs for the VV-NSFnet. This is unsupervised learning and, hence, no labeled data are required beyond boundary and initial conditions and the fluid properties. The residuals of the VP or VV governing equations, together with the initial and boundary conditions, are embedded into the loss function of the NSFnets. No data is provided for the pressure to the VP-NSFnet, which is a hidden state and is obtained via the incompressibility constraint without extra computational cost. Unlike the traditional numerical methods, NSFnets inherit the properties of neural networks (NNs), hence the total error is composed of the approximation, the optimization, and the generalization errors. Here, we empirically attempt to quantify these errors by varying the sampling (“residual”) points, the iterative solvers, and the size of the NN architecture. For the laminar flow solutions, we show that both the VP and the VV formulations are comparable in accuracy but their best performance corresponds to different NN architectures. The initial convergence rate is fast but the error eventually saturates to a plateau due to the dominance of the optimization error. For the turbulent channel flow, we show that NSFnets can sustain turbulence at , but due to expensive training we only consider part of the channel domain and enforce velocity boundary conditions on the subdomain boundaries provided by the DNS data base. We also perform a systematic study on the weights used in the loss function for balancing the data and physics components, and investigate a new way of computing the weights dynamically to accelerate training and enhance accuracy. In the last part, we demonstrate how NSFnets should be used in practice, namely for ill-posed problems with incomplete or noisy boundary conditions as well as for inverse problems. We obtain reasonably accurate solutions for such cases as well without the need to change the NSFnets and at the same computational cost as in the forward well-posed problems. As a result, we also present a simple example of transfer learning that will aid in accelerating the training of NSFnets for different parameter settings.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

DESC: A stellarator equilibrium solver

In this paper, the new code DESC is presented to solve for fixed-boundary ideal magnetohydrodynamic equilibria in stellarators. The approach directly solves the equilibrium force balance as a system of nonlinear equations in the form f(x) = 0. The independent variables x represent nested magnetic flux surfaces expressed in the inverse representation with toroidal flux coordinates, and the equations f(x) quantify equilibrium force balance errors at discrete points in real space. Discretizing with global Fourier–Zernike basis functions properly treats the magnetic axis and minimizes the number of coefficients needed to describe the flux surfaces. The pseudospectral method provides great flexibility in where the errors are evaluated, and the system of equations is efficiently solved with a Newton–Raphson iteration. Equilibria are computed and compared against VMEC for both axisymmetric and non-axisymmetric examples. The results show fast convergence rates and solutions with low errors throughout the plasma volume.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2021

Numerical Investigation of Enhanced Dehumidification Processes By Using Dielectrophoresis Principles in Moist Airflows

Dispersed particle-laden flows are encountered in many building and industrial applications, such as flow in a fluidized bed, hydrocarbon transportation in pipelines, and the fouling of air-cooled heat exchangers (Kuruneru et al., 2016; Ray et al., 2019; Wang et al., 2019). Computational fluid dynamic (CFD) models have been developed in recent years to depict particle-fluid and particle-particle interactions in laminar or turbulent flows with increasing accuracy and stability. One particular particle-laden system of interest for moisture control is electrically-enhanced condensation in air and water droplet flows. Electrically-enhanced condensation consists of the use of highly charged water droplets injected in the moist air. The droplets become electric seeds that attract polar water vapor molecules to their surfaces and promote condensation. The nucleation and growth of the charged droplets deplete the vapor phase near a droplet, which is compensated for by the dielectrophoresis flow and diffusion. Dielectrophoresis flow involves surrounding vapor at a distance of about 10 to 100 nm for droplets charged by an electrospray compared to ~2 nm for a single electron charge in a droplet. As the vapor molecules collapse on the surface of the droplets, their initial electrical charge decreases with time due to the neutralization of the ions. While the physics of this phenomena is well known, engineering models for predicting the condensation rates are not available. This work computationally investigates dehumidification of moist airflow in a converging rectangular duct. The objective is to develop an engineering model that predicts water vapor condensation by employing dielectrophoresis principles. We construct a Computational Fluid Dynamics (CFD) model of the duct with electrically-enhanced condensation. The model is implemented in the open-source software OpenFOAM. We utilize the Multi-Phase Particle-In-Cell (MP-PIC) method coupled with a Population Balance Equation (PBE) approach to simulate the particle-laden system. This methodology is an Eulerian-Lagrangian approach used to simulate the droplets' behavior in the humid air. The MP-PIC approach (Andrews and O'Rourke, 1996) mitigates the computational cost by parceling several fundamental particles with similar properties (such as types, sizes, and temperature) into one computational particle. Thus, the billions of particles can be substituted by millions of computational particles without significant loss of information. The PBE was considered with the Lagrangian frame to combine the particle distribution function used in MP-PIC (Kim et al., 2020). This approach preserves mass and energy conservation between the phases in the Eulerian and Lagrangian structures. The PBE in this procedure was directly linked to the discrete parcels, making the simulation of the particle distribution computationally efficient and robust. The MP-PIC-PBE approach used in the present work was applied to the dehumidification of air. Water droplets were injected in the air stream and forced to grow according to experimentally derived correlation. The experiments were conducted on a converging duct with the same geometry and boundary conditions used to build the CFD model. This approach enabled us to approximate the effect of dielectrophoresis phenomena on the droplet and air interface. This presentation will discuss the details of the new CFD model built for the duct, the implementation of the model in OpenFOAM CFD programming language, and the experimental validation of the newly developed model. The results revealed a moderate yet measurable increase in droplet diameter due to water vapor condensation at the vapor-liquid interface of the electrically charged droplets' surface. The seed water droplet particles grew in size by capturing the water vapor in the surrounding air. The OpenFOAM model predicted reductions of humidity in the air from 5 to 10 percent.

Yel Mahi, Maliha↗

DOE OSTI2020

FFT-based solver for higher-order and multi-phase-field fracture models applied to strongly anisotropic brittle materials

This paper presents the application of a fast Fourier transform (FFT) based method to solve two phase field models designed to simulate crack growth of strongly anisotropic materials in the brittle regime. By leveraging the ability of the FFT-based solver to generate solutions with higher-order and global continuities, we design two simple algorithms to capture the complex fracture patterns (e.g. sawtooth, and curved crack growth) common in materials with strongly anisotropic surface energy via the multi-phase-field and high-order phase-field frameworks. A staggered operator-split solver is used where both the balance of linear momentum and the phase field governing equations are formulated in the periodic domain. The unit phase field of the initial failure region is prescribed by the penalty method to alleviate the sharp material contrast between the initial failure region and the base material. The discrete frequency vectors are generalized to estimate the second and fourth order gradients such that the Gibbs effect near shape interfaces or jump conditions can be suppressed. Furthermore, a preconditioner is adopted to improve the convergence rate of the iterative linear solver. Three numerical experiments are used to systematically compare the performance of the FFT-based method in the multi-phase-field and high-order phase-field frameworks.

42 ENGINEERING↗

DOE OSTI2025

Optimal sizing of battery energy storage systems for peak shaving and demand response using a degradation-aware Bayesian Optimization-Mixed-Integer Linear Programming framework

The increasing integration of renewable energy and rising electricity demand highlight the importance of battery energy storage systems for peak shaving and demand response. Unlike prior approaches that overlook operational impacts on degradation, this study proposes a Bayesian Optimization–Mixed Integer Linear Programming framework for optimal battery energy storage system sizing. In this framework, Mixed Integer Linear Programming determines short-term scheduling while a calibrated electrochemical model iteratively evaluates degradation. The central hypothesis is that the framework can efficiently identify optimal sizes that yield realistic and economically robust outcomes. The method is tested across three scenarios: peak shaving, peak shaving with energy-reduction demand response, and peak shaving with power-reduction demand response. Results show that the framework converge to the optimum within 20 iterations out of 150 possible sizes. Under baseline conditions, the framework consistently selects the smallest feasible system, minimizing unnecessary degradation costs from oversized storage. Sensitivity analyses reveal that larger systems are favored as demand rates or incentives increase. Comparisons of demand response programs indicate that power-reduction demand response offers greater economic benefits than energy-reduction demand response, although demand savings from peak shaving remain the dominant contributor to overall performance. This study demonstrates that the proposed framework balances computational tractability with degradation fidelity, identifies critical economic thresholds for investment, and offers a practical, flexible tool to guide industrial stakeholders in cost-effective battery energy storage system deployment.

Batteries↗

DOE OSTI2024

A high fidelity and user-friendly equation-oriented optimization model for carbon capture using a novel water-lean solvent

Research Triangle Institute (RTI) International and SLB have developed a novel water-lean solvent technology for carbon capture, demonstrating low specific reboiler duty (SRD) values at capture rates exceeding 90%. At the Technology Centre Mongstad (TCM) pilot plant, the technology achieved an SRD of 2.55 GJ/t-CO2 at 95% capture, utilizing an intercooler and a 5°C temperature approach in the lean/rich solvent cross exchanger. To meet varying carbon capture targets for Front End Engineering and Design (FEED) studies and to enable real-time optimization and advanced process control, an efficient optimization model is required. This model needs to minimize energy demand for a given capture rate and determine optimal operating parameters in response to fluctuating flue gas conditions. While an existing Aspen Plus simulation model, developed by RTI and SLB, accurately matches TCM plant data, its sequential modular (SM) strategy is too slow for real-time applications due to recycle streams and tight heat integration inherent in solvent-based carbon capture processes. Although an equation-oriented (EO) modeling strategy is more suitable for optimizing these processes, its adoption has been limited by several factors: feature limitations in Aspen Plus EO mode (e.g., lack of balance block support), a less user-friendly interface for variable identification and loop solving, complex troubleshooting of convergence issues, and the necessity for accurate initial values.

carbon capture↗

DOE OSTI2022

Load‐Balancing Intense Physics Calculations to Embed Regionalized High‐Resolution Cloud Resolving Models in the E3SM and CESM Climate Models

Abstract We design a new strategy to load‐balance high‐intensity sub‐grid atmospheric physics calculations restricted to a small fraction of a global climate simulation's domain. We show why the current parallel load balancing infrastructure of Community Earth System Model (CESM) and Energy Exascale Earth Model (E3SM) cannot efficiently handle this scenario at large core counts. As an example, we study an unusual configuration of the E3SM Multiscale Modeling Framework (MMF) that embeds a binary mixture of two separate cloud‐resolving model grid structures that is attractive for low cloud feedback studies. Less than a third of the planet uses high‐resolution (MMF‐HR; sub‐km horizontal grid spacing) relative to standard low‐resolution (MMF‐LR) cloud superparameterization elsewhere. To enable MMF runs with Multi‐Domain cloud resolving models (CRMs), our load balancing theory predicts the most efficient computational scale as a function of the high‐intensity work's relative overhead and its fractional coverage. The scheme successfully maximizes model throughput and minimizes model cost relative to precursor infrastructure, effectively by devoting the vast majority of the processor pool to operate on the few high‐intensity (and rate‐limiting) high‐resolution (HR) grid columns. Two examples prove the concept, showing that minor artifacts can be introduced near the HR/low‐resolution CRM grid transition boundary on idealized aquaplanets, but are minimal in operationally relevant real‐geography settings. As intended, within the high (low) resolution area, our Multi‐Domain CRM simulations exhibit cloud fraction and shortwave reflection convergent to standard baseline tests that use globally homogenous MMF‐LR and MMF‐HR. We suggest this approach can open up a range of creative multi‐resolution climate experiments without requiring unduly large allocations of computational resources.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

Multifaceted aerosol effects on precipitation

Aerosols have been proposed to influence precipitation rates and spatial patterns from scales of individual clouds to the globe. However, large uncertainty remains regarding the underlying mechanisms and importance of multiple effects across spatial and temporal scales. Here, in this study, we review the evidence and scientific consensus behind these effects, categorized into radiative effects via modification of radiative fluxes and the energy balance, and microphysical effects via modification of cloud droplets and ice crystals. Broad consensus and strong theoretical evidence exist that aerosol radiative effects (aerosol–radiation interactions and aerosol–cloud interactions) act as drivers of precipitation changes because global mean precipitation is constrained by energetics and surface evaporation. Likewise, aerosol radiative effects cause well-documented shifts of large-scale precipitation patterns, such as the intertropical convergence zone. The extent of aerosol effects on precipitation at smaller scales is less clear. Although there is broad consensus and strong evidence that aerosol perturbations microphysically increase cloud droplet numbers and decrease droplet sizes, thereby slowing precipitation droplet formation, the overall aerosol effect on precipitation across scales remains highly uncertain. Global cloud-resolving models provide opportunities to investigate mechanisms that are currently not well represented in global climate models and to robustly connect local effects with larger scales. This will increase our confidence in predicted impacts of climate change.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2021

Formation and evolution of protostellar accretion discs – II. From 3D simulation to a simple semi-analytic model of Class 0/I discs

Here we use a 3D radiative non-ideal magnetohydrodynamic simulation to investigate the formation and evolution of a young protostellar disc from a magnetized pre-stellar core. The simulation covers the first ${\sim }10\, {\rm kyr}$ after protostar formation and shows a massive, weakly magnetized disc with radius that initially grows and then saturates at ${\sim }30\, {\rm au}$. The disc is gravitationally unstable with prominent large-amplitude spiral arms. We use our simulation results and a series of physical arguments to construct a predictive and quantitative physical picture of Class 0/I protostellar disc evolution from several aspects, including (i) the angular-momentum redistribution in the disc, self-regulated by gravitational instability to make most of the disc marginally unstable; (ii) the thermal profile of the disc, well-approximated by a balance between radiative cooling and accretion heating; and (iii) the magnetic-field strength and magnetic-braking rate inside the disc, regulated by non-ideal magnetic diffusion. Using these physical insights, we build a simple 1D semi-analytic model of disc evolution. We show that this 1D model, when coupled to a computationally inexpensive simulation for the evolution of the surrounding pseudo-disc, can be used reliably to predict disc evolution in the Class 0/I phase. The predicted long-term evolution of disc size, which saturates at ${\sim }30\, {\rm au}$ and eventually shrinks, is consistent with a recent observational survey of Class 0/I discs. Such hierarchical modelling of disc evolution circumvents the computational difficulty of tracing disc evolution through Class 0/I phase with direct, numerically converged simulations.

79 ASTRONOMY AND ASTROPHYSICS↗