Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic optimization”

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.

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

At least 919 records · Page 51

Charging Decision Making for Automated Electric Vehicles

Abstract: Overview/Significance With the emerging of autonomous driving and its application in electric vehicles, the charging decision making should be taken over by the vehicles. Autonomous electric vehicles will require the capability to make charging decisions according to the battery energy state, the travel demand and also the available charging infrastructure. The introduction of autonomous driving technology would remove the challenge of co-locating charging infrastructure with driver destinations and presents a driver-free method for EVs to reach nearby charging stations. This will significantly change the charging behavior of electric vehicles. EV driver will no longer need to be present at charging stations for charging actions. Automated EVs can drive to nearby charging stations to perform charging actions by themselves when necessary. Meanwhile, connected vehicles technology makes electric vehicles have the capability to sense and obtain pertinent information from nearby charging station networks and then calculate the corresponding costs and availability for charging. All these promising capabilities bring new opportunities to construct an automatic charging decision making system and improve energy efficiency of charging actions for automatic electric vehicles. Abstract: Methodology This research introduces optimization tools and case studies on charging decision making for automated electric vehicles under personal usage scenario. The designed optimization tools aim to provide charging strategies, i.e. the optimal choice of charging station outside home and the amount of charged energy, by considering constraints from personal daily itineraries and existing charging infrastructure. Abundant real world EV data is utilized to construct stochastic energy consumption prediction model under realistic driving conditions. Advanced dynamic programming technology is utilized to model and solve the potential multi-stage decision making process by considering realistic uncertainties of EV energy cost and dynamics of itinerary information. Large-scale simulation studies using Chicago itinerary data are demonstrated to illustrate energy benefits from automatic charging decision making for future autonomous EVs. Abstract: Results/Conclusions Optimal automatic charging decision making and its energy benefits have been studied for personal automated electric vehicles. A data-driven method based on large amount of real-world data and the corresponding real-time update algorithm have been proposed to construct multi-channel stochastic energy consumption prediction model. Based on the energy cost prediction, dynamic multi-stage charging decision-making models are established for optimal strategies during a daily itinerary. Derived charging strategies can minimize the monetary and energy cost of charging actions for autonomous vehicles. Simulations and case studies show the potential ability of autonomous electric vehicles to reduce the range anxiety and charging infrastructure dependency. Automatic charging decision making can mitigate the pain from electric vehicle charging necessity outside home. In conclusion, automated electric vehicles equipped with an appropriate automatic charging decision making system will help EV driver to relieve from heavy time cost of recharging, reduce the energy cost of performing charging actions and improve the energy efficiency in future electrified transportation system.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Control Improvement for Jump-Diffusion Processes with Applications to Finance

We consider stochastic control problems with jump-diffusion processes and formulate an algorithm which produces, starting from a given admissible control {pi}, a new control with a better value. If no improvement is possible, then {pi} is optimal. Such an algorithm is well-known for discrete-time Markov Decision Problems under the name Howard's policy improvement algorithm. The idea can be traced back to Bellman. Here we show with the help of martingale techniques that such an algorithm can also be formulated for stochastic control problems with jump-diffusion processes. As an application we derive some interesting results in financial portfolio optimization.

97 MATHEMATICS AND COMPUTING↗

Learning and meta-learning of stochastic advection–diffusion–reaction systems from sparse measurements

Physics-informed neural networks (PINNs) were recently proposed in [18] as an alternative way to solve partial differential equations (PDEs). A neural network (NN) represents the solution, while a PDE-induced NN is coupled to the solution NN, and all differential operators are treated using automatic differentiation. Here, we first employ the standard PINN and a stochastic version, sPINN, to solve forward and inverse problems governed by a non-linear advection–diffusion–reaction (ADR) equation, assuming we have some sparse measurements of the concentration field at random or pre-selected locations. Subsequently, we attempt to optimise the hyper-parameters of sPINN by using the Bayesian optimisation method (meta-learning) and compare the results with the empirically selected hyper-parameters of sPINN. In particular, for the first part in solving the inverse deterministic ADR, we assume that we only have a few high-fidelity measurements, whereas the rest of the data is of lower fidelity. Hence, the PINN is trained using a composite multi-fidelity network, first introduced in [12], that learns the correlations between the multi-fidelity data and predicts the unknown values of diffusivity, transport velocity and two reaction constants as well as the concentration field. For the stochastic ADR, we employ a Karhunen–Loève (KL) expansion to represent the stochastic diffusivity, and arbitrary polynomial chaos (aPC) to represent the stochastic solution. Correspondingly, we design multiple NNs to represent the mean of the solution and learn each aPC mode separately, whereas we employ a separate NN to represent the mean of diffusivity and another NN to learn all modes of the KL expansion. For the inverse problem, in addition to stochastic diffusivity and concentration fields, we also aim to obtain the (unknown) deterministic values of transport velocity and reaction constants. The available data correspond to 7spatial points for the diffusivity and 20 space–time points for the solution, both sampled 2000 times. We obtain good accuracy for the deterministic parameters of the order of 1–2% and excellent accuracy for the mean and variance of the stochastic fields, better than three digits of accuracy. In the second part, we consider the previous stochastic inverse problem, and we use Bayesian optimisation to find five hyper-parameters of sPINN, namely the width, depth and learning rate of two NNs for learning the modes. Here, we obtain much deeper and wider optimal NNs compared to the manual tuning, leading to even better accuracy, i.e., errors less than 1% for the deterministic values, and about an order of magnitude less for the stochastic fields.

97 MATHEMATICS AND COMPUTING↗

Surrogate Modeling for Capacity Planning of Charging Station Equipped with PV and Hydropneumatic Energy Storage

Due to the promising potential for environmental sustainability, there has been a significant increase of electric vehicles (EVs) and plug-in hybrid electric vehicles (PHEV) in the market. To support this increasing demand for EVs and PHEVs, challenges related to capacity planning and investment costs of public charging infrastructure must be addressed. Hence, in this paper, a capacity planning problem for EV charging stations is developed and aims to balance current capital investment costs and future operational revenue. The charging station considered in this work is assumed to be equipped with solar photovoltaic panel (PV) and an energy storage system which could be electric battery or the recently invented hydro-pneumatic energy storage (GLIDES, Ground-Level Integrated Diverse Energy Storage) system. A co-optimization model that minimizes investment and operation cost is established to determine the global optimal solution while combining the capacity and operational decision making. The operational decision making considers EV mobility which is modeled as an Erlang-loss system. Meanwhile, stochastic programming is adopted to capture uncertainties from solar radiation and charging demand of the EV fleet. To provide a more general and computationally efficient model, main configuration parameters are sampled in the design space and then fixed in solving the co-optimization model. The model can be used to provide insights for charging station placement in different practical situations. The sampled parameters include: the total number of EV charging slots, the PV area, the maximum capacity of the energy storage system, and daily mean EV arrival number in the Erlang-loss system. Based on the sampled parameter combinations and its responses, black-box mappings are then constructed using surrogate models (RBF, Kriging etc). The effectiveness of proposed surrogate modeling approach is demonstrated in the numerical experiments.

Chen, Yang↗

Stochastic Thermo-Hydro Modeling and Neural Network Surrogate Development for Thermal Resource Assessment of the Galleries-to-Calories Geobattery

The Galleries-to-Calories Geobattery concept explores the use of abandoned coal mine workings for large-scale thermal energy transport and storage. The system involves injecting waste heat from a supercomputing facility into flooded mine galleries, where groundwater flow can store and transport thermal energy for potential recovery in downgradient district heating and cooling applications. To evaluate the feasibility and performance of the Geobattery under geological and operational uncertainty, we developed a suite of stochastic thermo-hydrological (TH) simulations using Monte Carlo sampling of key uncertain parameters (e.g., permeability, porosity, thermal conductivity, specific heat capacity) and operating conditions (e.g., injection rate, injection temperature). Results identified injection rate and temperature as the most influential parameters governing thermal front propagation, while the geometry of the room-and-pillar structure played a critical role in directing the extent and orientation of thermal advancement. Optimal combinations of material properties for maximizing heat recovery were also determined. To address the high computational cost of coupled-process stochastic modeling, we trained a neural network surrogate model on 24,000 physics-based realizations, achieving an R² > 0.99 and MAE < 0.1 for temperature predictions at monitoring locations. This surrogate enabled an additional 100,000 realizations for global sensitivity analysis and probabilistic thermal resource assessment. The integrated stochastic physics–surrogate modeling framework offers a computationally efficient tool for quantifying uncertainty, identifying key drivers, and informing early-stage design decisions for Geobattery systems.

15 - GEOTHERMAL ENERGY↗

The American Foreign Exchange Option in Time-Dependent One-Dimensional Diffusion Model for Exchange Rate

The classical Garman-Kohlhagen model for the currency exchange assumes that the domestic and foreign currency risk-free interest rates are constant and the exchange rate follows a log-normal diffusion process.In this paper we consider the general case, when exchange rate evolves according to arbitrary one-dimensional diffusion process with local volatility that is the function of time and the current exchange rate and where the domestic and foreign currency risk-free interest rates may be arbitrary continuous functions of time. First non-trivial problem we encounter in time-dependent case is the continuity in time argument of the value function of the American put option and the regularity properties of the optimal exercise boundary. We establish these properties based on systematic use of the monotonicity in volatility for the value functions of the American as well as European options with convex payoffs together with the Dynamic Programming Principle and we obtain certain type of comparison result for the value functions and corresponding exercise boundaries for the American puts with different strikes, maturities and volatilities.Starting from the latter fact that the optimal exercise boundary curve is left continuous with right-hand limits we give a mathematically rigorous and transparent derivation of the significant early exercise premium representation for the value function of the American foreign exchange put option as the sum of the European put option value function and the early exercise premium.The proof essentially relies on the particular property of the stochastic integral with respect to arbitrary continuous semimartingale over the predictable subsets of its zeros. We derive from the latter the nonlinear integral equation for the optimal exercise boundary which can be studied by numerical methods.

97 MATHEMATICS AND COMPUTING↗

Enhancing capillary trapping effectiveness through proper time scheduling of injection of supercritical CO 2 in heterogeneous formations

The impact of geologic heterogeneity on capillary trapping of supercritical CO 2 (scCO 2 ) has been recognized and appraised through laboratory experimentation and modeling. However, how different injection strategies can be optimized to improve capillary trapping has not received adequate attention. Here, we present a study based on stochastic analysis to show the impact of injection scheduling on capillary trapping of scCO 2 in heterogeneous geological formations. Improvement of trapping efficiency consists of maximizing the trapped volume within a predefined secure zone of the storage formation with the goal of avoiding plume intersection with potential leakage pathways. Using knowledge acquired from physical experiments in intermediate-scale tanks with controlled heterogeneity, we conduct numerical simulations following a stochastic approach to extend the observed outcomes to a series of equally probable permeability scenarios. Our simulations involve the same combination of surrogate fluids that are used in the experiments to mimic viscosity and density contrasts between scCO 2 and brine. To account for uncertainty of formation heterogeneity, several permeability fields with three different variances and two horizontal correlation lengths are generated. The same volume of scCO 2 is emplaced using four different modes of injection scheduling. Results suggest that injection strategies aimed at enhancing capillary trapping of scCO 2 and increasing the probability of constraining the plume within a secure zone are strictly related to the specific heterogeneity of the reservoir. Finally, this preliminary theoretical finding suggests the potential for maximizing secure capillary trapping through the proper selection of injection schedule to fit the formation heterogeneity.

58 GEOSCIENCES↗

The triple decomposition of a fluctuating velocity field in a multiscale flow

A new method for the triple decomposition of a multiscale flow, which is based on the novel optimal mode decomposition (OMD) technique, is presented. OMD provides low order linear dynamics, which fits a given data set in an optimal way and is used to distinguish between a coherent (periodic) part of a flow and a stochastic fluctuation. The method needs no external phase indication since this information, separate for coherent structures associated with each length scale introduced into the flow, appears as the output. The proposed technique is compared against two traditional methods of the triple decomposition, i.e., bin averaging and proper orthogonal decomposition. This is done with particle image velocimetry data documenting the near wake of a multiscale bar array. It is shown that both traditional methods are unable to provide a reliable estimation for the coherent fluctuation while the proposed technique performs very well. The crucial result is that the coherence peaks are not observed within the spectral properties of the stochastic fluctuation derived with the proposed method; however, these properties remain unaltered at the residual frequencies. This proves the method’s capability of making a distinction between both types of fluctuations. The sensitivity to some prescribed parameters is checked revealing the technique’s robustness. Additionally, an example of the method application for analysis of a multiscale flow is given, i.e., the phase conditioned transverse integral length is investigated in the near wake region of the multiscale object array.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

HackAttack: Game-Theoretic Analysis of Realistic Cyber Conflicts

Game theory is appropriate for studying cyber conflict because it allows for an intelligent and goal-driven adversary. Applications of game theory have led to a number of results regarding optimal attack and defense strategies. However, the overwhelming majority of applications explore overly simplistic games, often ones in which each participant s actions are visible to every other participant. These simplifications strip away the fundamental properties of real cyber conflicts: probabilistic alerting, hidden actions, unknown opponent capabilities. In this paper, we demonstrate that it is possible to analyze a more realistic game, one in which different resources have different weaknesses, players have different exploits, and moves occur in secrecy, but they can be detected. Certainly, more advanced and complex games are possible, but the game presented here is more realistic than any other game we know of in the scientific literature. While optimal strategies can be found for simpler games using calculus, case-by-case analysis, or, for stochastic games, Q-learning, our more complex game is more naturally analyzed using the same methods used to study other complex games, such as checkers and chess. We define a simple evaluation function and employ multi-step searches to create strategies. We show that such scenarios can be analyzed, and find that in cases of extreme uncertainty, it is often better to ignore one s opponent s possible moves. Furthermore, we show that a simple evaluation function in a complex game can lead to interesting and nuanced strategies.

botnets↗

Release a public version of HERON (HERON 2.0) with improved algorithms for the treatment of energy storage

Integrated energy systems (IESs) are essential for decarbonizing electricity and industrial sectors and fully exploiting these systems requires sophisticated planning, scheduling, and dispatching tools to maximize their socio-economic benefits. The Holistic Energy Resource Optimization Network (HERON) is a generic software plugin for the Risk Analysis Virtual Environment (RAVEN) to perform stochastic technoeconomic analysis of IES with economic drivers. This report summarizes the updates made to HERON 2.0. Particularly, we demonstrate one of the added features, Function-based Control Mechanics, by comparing a price-based dispatch strategy with the original perfect foresight baselines. Our case studies successfully demonstrate that the model is capable to incorporate artificial control algorithm into the dispatch of IES components. In addition, our results from the price-based strategy indicate that the control strategies of IES components are key to the economic and temporal performance of our model; therefore, more sophisticated dispatch strategies are required to improve the model performance.

25 ENERGY STORAGE↗

Contextual Active Online Model Selection with Expert Advice

How can we collect the most useful labels to learn a model selection policy, when presented with arbitrary heterogeneous data streams? In this paper, we formulate this task as a contextual active model selection problem, where at each round the learner receives an unlabeled data point along with a context. The goal is to output the best model for any given context without obtaining an excessive amount of labels. In particular, we focus on the task of selecting pre-trained classifiers, and propose a contextual active model selection algorithm (CAMS), which relies on a novel uncertainty sampling query criterion defined on a given policy class for adaptive model selection. In comparison to prior art, our algorithm does not assume a globally optimal model. We provide rigorous theoretical analysis for the regret and query complexity under both adversarial and stochastic settings. Our experiments on several benchmark classification datasets demonstrate the algorithm’s effectiveness in terms of both regret and query complexity. Notably, to achieve the same accuracy, CAMS incurs less than 10% of the label cost when compared to the best online model selection baselines on CIFAR10.

Liu, Xuefeng↗

Risk-Averse Bi-Level Stochastic Network Interdiction Model for Cyber-Security Risk Management

Security of cyber networks is crucial; recent severe cyber-attacks have had a devastating effect on many large organizations. The attack graph, which maps the potential attack paths of a cyber network, is a popular tool for analyzing cyber system vulnerability. In this study, we propose a bi-level stochastic network interdiction model on an attack graph to enable a risk-averse, resource constrained cyber network defender to optimally deploy security countermeasures that protect against attackers with an uncertain budget. This risk- averse conditional-value-at-risk (CVaR) model minimizes a weighted sum of the expected maximum loss over all scenarios and the expected maximum loss from the most damaging attack scenarios. We develop a customized constraint and column generation algorithm to solve our model as well as several acceleration techniques to improve the computational efficiency. Numerical experiments demonstrate that the acceleration techniques enable the solution of relatively large problems within a reasonable amount of time: applying all the acceleration techniques also reduces the average computation time of the basic algorithm by 71% for 100-node graphs. Using metrics called mean-risk value of stochastic solution and value of risk-aversion, computational results suggest that our stochastic risk-averse model significantly outperforms deterministic and risk-neutral models when 1) the distribution of attacker budget is heavy-right-tailed and 2) the defender is highly risk-averse.

Bhuiyan, Tanveer H.↗

Evaluating the Effects of Missing Values and Mixed Data Types on Social Sequence Clustering Using t-SNE Visualization

© 2019 Association for Computing Machinery. The goal of this work is to investigate the impact of missing values in clustering joint categorical social sequences. Identifying patterns in sociodemographic longitudinal data is important in a number of social science settings. However, performing analytical operations, such as clustering on life course trajectories, is challenging due to the categorical and multidimensional nature of the data, their mixed data types, and corruption by missing and inconsistent values. Data quality issues were investigated previously on single variable sequences. To understand their effects on multivariate sequence analysis, we employ a dataset of mixed data types and missing values, a dissimilarity measure designed for joint categorical sequence data, together with dimensionality reduction methodologies in a systematic design of sequence clustering experiments. Given the categorical nature of our data, we employ an “edit” distance using optimal matching. Because each data record has multiple variables of different types, we investigate the impact of mixing these variables in a single dissimilarity measure. Between variables with binary values and those with multiple nominal values, we find that the ability to overcome missing data problems is more difficult in the nominal domain than in the binary domain. Additionally, alignment of leading missing values can result in systematic biases in dissimilarity matrices and subsequently introduce both artificial clusters and unrealistic interpretations of associated data domains. We demonstrate the usage of t-distributed stochastic neighborhood embedding to visually guide mitigation of such biases by tuning the missing value substitution cost parameter or determining an optimal sequence span.

Lazar, Alina↗

Some Issues in Uncertainty Quantification and Parameter Tuning: A Case Study of Convective Parameterization Scheme in the WRF Regional Climate Model

The current tuning process of parameters in global climate models is often performed subjectively, or treated as an optimization procedure to minimize the difference between model fields and observations. The later approach may be generating a set of tunable parameters that approximate the observed climate but via an unrealistic balance of physical processes and/or compensating errors over different regions in the globe. In this study, we run the Weather Research and Forecasting (WRF) regional model constrained by the reanalysis data over the Southern Great Plains (SGP) where abundant observational data from various resources are available for calibration of the input parameters and validation of the model results. Our goal is to quantify the uncertainty ranges and identify the optimal values of five key input parameters in a new Kain-Frisch (KF) convective parameterization scheme incorporated in the WRF model. A stochastic sampling algorithm, Multiple Very Fast Simulated Annealing (MVFSA), is employed to efficiently sample the input parameters in KF scheme based on the skill score so that the algorithm progressively moves toward regions of the parameter space that minimize model errors. The results based on the WRF simulations with 25-km grid spacing over the SGP show that the model bias for precipitation can be significantly reduced by using five optimal parameters identified by the MVFSA algorithm. The model performance is very sensitive to downdraft and entrainment related parameters and consumption time of Convective Available Potential Energy (CAPE). Simulated convective precipitation decreases as the ratio of downdraft to updraft flux increases. Larger CAPE consumption time results in less convective but more stratiform precipitation. The simulation using optimal parameters obtained by only constraining precipitation generates positive impact on the other output variables, such as temperature and wind. By using the optimal parameters obtained at 25 km simulation, both the magnitude and spatial pattern of simulated precipitation are improved at 12-km spatial resolution. The optimal parameters identified from the SGP region have also improved the simulation of precipitation when moving model domain to another region with a different climate regime (i.e. North America monsoon region). These results suggest the improvement of precipitation simulation by using the optimal parameters remains when the model domain or spatial resolution is changed.

54 ENVIRONMENTAL SCIENCES↗

Shape Stability of Truncated Octahedral fcc Metal Nanocrystals

Metallic nanocrystals (NCs) can be synthesized with tailored nonequilibrium shapes to enhance desired properties, e.g., octahedral fcc metal NCs optimize catalytic activity associated with {111} facets. However, maintenance of optimized properties requires stability against thermal reshaping. Thus, we analyze the reshaping of truncated fcc metal octahedra mediated by surface diffusion using a stochastic atomistic-level model with energetic input parameters for Pd. Furthermore, the model describes NC thermodynamics by an effective nearest-neighbor interaction and includes a realistic treatment of diffusive hopping for undercoordinated surface atoms. Kinetic Monte Carlo simulation reveals that the effective barrier, E eff , for the initial stage of reshaping is strongly tied to the degree of truncation of the vertices in the synthesized initial octahedral shapes. This feature is elucidated via exact analytic determination of the energy variation along the optimal reshaping pathway at low-temperature (T), which involves transfer of atoms from truncated {100} vertex facets to form new layers on {111} side facets. Deviations from predictions of the low-T analysis due to entropic effects are more prominent for higher T and larger NC sizes.

36 MATERIALS SCIENCE↗

Residuals-based distributionally robust optimization with covariate information

We consider data-driven approaches that integrate a machine learning prediction model within distributionally robust optimization (DRO) given limited joint observations of uncertain parameters and covariates. Our framework is flexible in the sense that it can accommodate a variety of regression setups and DRO ambiguity sets. We investigate asymptotic and finite sample properties of solutions obtained using Wasserstein, sample robust optimization, and phi-divergence-based ambiguity sets within our DRO formulations, and explore cross-validation approaches for sizing these ambiguity sets. Through numerical experiments, we validate our theoretical results, study the effectiveness of our approaches for sizing ambiguity sets, and illustrate the benefits of our DRO formulations in the limited data regime even when the prediction model is misspecified.

97 MATHEMATICS AND COMPUTING↗

Stochastic Pricing Game for Aggregated Demand Response Considering Comfort Level

In recent years, demand response (DR) has been explored as a fundamental strategy for demand-side management due to its advantages in mediating intermittency of renewable energy generation, load shifting, etc. To engage customers in DR programs, several deterministic price-based DR strategies have been developed and implemented. However, the stochastic weather conditions and occupants' consumption behaviors often make the deterministic solution less robust to uncertainties. In this paper, with the consideration of the uncertainties, a stochastic Stackelberg game is proposed to model the price-demand negotiation between a distributed system operator and load aggregators, where the virtual battery constraints are extracted from the building thermostatically controlled loads (TCLs)‘ characteristics to guarantee comfortable TCLs' levels. Following the negotiation, a priority-based control method is used to allocate the optimal aggregated power DR profile at the building level and track the power signal. Several groups of experiments have demonstrated the effectiveness and robustness of the stochastic solutions.

Chen, Yang↗

A robust bi-orthogonal/dynamically-orthogonal method using the covariance pseudo-inverse with application to stochastic flow problems

We develop a new robust methodology for the stochastic Navier–Stokes equations based on the dynamically-orthogonal (DO) and bi-orthogonal (BO) methods . Both approaches are variants of a generalized Karhunen–Loève (KL) expansion in which both the stochastic coefficients and the spatial basis evolve according to system dynamics, hence, capturing the low-dimensional structure of the solution. The DO and BO formulations are mathematically equivalent , but they exhibit computationally complimentary properties. Specifically, the BO formulation may fail due to crossing of the eigenvalues of the covariance matrix, while both BO and DO become unstable when there is a high condition number of the covariance matrix or zero eigenvalues. To this end, we combine the two methods into a robust hybrid framework and in addition we employ a pseudo-inverse technique to invert the covariance matrix. The robustness of the proposed method stems from addressing the following issues in the DO/BO formulation: (i) eigenvalue crossing: we resolve the issue of eigenvalue crossing in the BO formulation by switching to the DO near eigenvalue crossing using the equivalence theorem and switching back to BO when the distance between eigenvalues is larger than a threshold value; (ii) ill-conditioned covariance matrix: we utilize a pseudo-inverse strategy to invert the covariance matrix; (iii) adaptivity: we utilize an adaptive strategy to add/remove modes to resolve the covariance matrix up to a threshold value. In particular, we introduce a soft-threshold criterion to allow the system to adapt to the newly added/removed mode and therefore avoid repetitive and unnecessary mode addition/removal. When the total variance approaches zero, we show that the DO/BO formulation becomes equivalent to the evolution equation of the Optimally Time-Dependent modes . We demonstrate the capability of the proposed methodology with several numerical examples, namely (i) stochastic Burgers equation: we analyze the performance of the method in the presence of eigenvalue crossing and zero eigenvalues; (ii) stochastic Kovasznay flow: we examine the method in the presence of a singular covariance matrix; and (iii) we examine the adaptivity of the method for an incompressible flow over a cylinder where for large stochastic forcing thirteen DO/BO modes are active.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗