Search NASA⌕ Search

SEARCH · Search NASA

Results for “decomposition algorithms”

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 991 records · Page 55
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

DNTTD (Distributed Non-Negative Tensor Train Decomposition)

The era of exascale computing opens new venues for innovations and discoveries in many scientific, engineering, and commercial fields. However, with the exa flops also come the extra-large high-dimensional data generated by high performance computing. High-dimensional data is presented as multidimensional arrays, aka tensors. The presence of latent (not directly observable) structures in the tensor allows a unique representation and compression of the data by classical tensor factorization techniques. However, the classical tensor methods are not always stable or they can be exponential in their memory requirements, which makes them not suitable for high-dimensional tensors. Tensor train (TT) is a state-of-the-art tensor network introduced for factorization of high-dimensional tensors. TT transforms the initial high-dimensional tensor in a network of three-dimensional tensors that requires only a linear storage. Many real-world data, such as, density, temperature, population, probability, etc., are non-negative and for an easy interpretation, the algorithms preserving non-negativity are preferred. Here, we introduce a distributed non-negative tensor-train and demonstrate its scalability and the compression on synthetic and real world big datasets.

Bhattarai, Manish↗
DOE OSTI2025

A Fundamentally New Coupled Approach to Contact Mechanics via the Dirichlet‐Neumann Schwarz Alternating Method

Contact phenomena are crucial for understanding the behavior of mechanical systems. However, existing computational approaches for simulating mechanical contact often face numerical challenges, such as inaccurate physical predictions, energy conservation errors, and unwanted oscillations. Here, we introduce an alternative technique for simulating dynamic contact based on the non‐overlapping Schwarz alternating method, originally developed for domain decomposition. In multibody contact scenarios, this method treats each body as a separate, non‐overlapping domain and prevents interpenetration using an alternating Dirichlet–Neumann iterative process. This approach has a strong theoretical foundation, eliminates the need for contact constraints, and offers flexibility, making it ideal for multiscale and multiphysics applications. We conducted a numerical comparison between the Schwarz method and traditional methods, such as the Lagrange multiplier and penalty methods, focusing on a benchmark impact problem. Our results indicate that the Schwarz alternating method outperforms traditional methods in several key areas: it provides more accurate predictions for various measurable quantities and demonstrates exceptional energy conservation capabilities. To address unwanted oscillations in contact velocities and forces, we explored various algorithms and stabilization techniques, ultimately opting for the naïve‐stabilized Newmark scheme for its simplicity and effectiveness. Additionally, we validated the efficiency of the Schwarz method in a three‐dimensional impact problem, highlighting its inherent capacity to accommodate different mesh topologies, time‐integration schemes, and time steps for each interacting body.

Schwarz alternating method↗
DOE OSTI2021

PMU-Based Decoupled State Estimation for Unsymmetrical Power Systems

Modal decomposition of measurement equations has already been shown to simplify the formulation and resulting computational complexity of three-phase state estimation of systems where all the transmission lines are three-phase and fully transposed. When there are non-transposed and/or mixed-phase lines, modal decomposition can no longer fully decouple the threephase measurement equations. Here, this paper addresses the above shortcoming by proposing a simple yet practical solution based on the commonly used numerical compensation techniques. Thus, it enables application of the powerful decoupling approach to any type of three-phase networks which may contain non-transposed or mixed-phase lines and are fully observable by PMUs. The proposed procedure modifies the measurement set by deriving additive terms that compensate for the neglected unsymmetrical effects. It will be shown that unbalanced systems including nontransposed and mixed-phase elements, can still be transformed into three decoupled subsystems and solved in parallel by the proposed approach. Performance of the proposed algorithm is validated against several IEEE test cases.

42 ENGINEERING↗
DOE OSTI2016

WE-AB-207A-04: Random Undersampled Cone Beam CT: Theoretical Analysis and a Novel Reconstruction Method

Purpose: Reducing x-ray exposure and speeding up data acquisition motived studies on projection data undersampling. It is an important question that for a given undersampling ratio, what the optimal undersampling approach is. In this study, we propose a new undersampling scheme: random-ray undersampling. We will mathematically analyze its projection matrix properties and demonstrate its advantages. We will also propose a new reconstruction method that simultaneously performs CT image reconstruction and projection domain data restoration. Methods: By representing projection operator under the basis of singular vectors of full projection operator, matrix representations for an undersampling case can be generated and numerical singular value decomposition can be performed. We compared properties of matrices among three undersampling approaches: regular-view undersampling, regular-ray undersampling, and the proposed random-ray undersampling. To accomplish CT reconstruction for random undersampling, we developed a novel method that iteratively performs CT reconstruction and missing projection data restoration via regularization approaches. Results: For a given undersampling ratio, random-ray undersampling preserved mathematical properties of full projection operator better than the other two approaches. This translates to advantages of reconstructing CT images at lower errors. Different types of image artifacts were observed depending on undersampling strategies, which were ascribed to the unique singular vectors of the sampling operators in the image domain. We tested the proposed reconstruction algorithm on a Forbid phantom with only 30% of the projection data randomly acquired. Reconstructed image error was reduced from 9.4% in a TV method to 7.6% in the proposed method. Conclusion: The proposed random-ray undersampling is mathematically advantageous over other typical undersampling approaches. It may permit better image reconstruction at the same undersampling ratio. The novel algorithm suitable for this random-ray undersampling was able to reconstruct high-quality images.

60 APPLIED LIFE SCIENCES↗
NASA NTRS1998

I/O Parallelization for the Goddard Earth Observing System Data Assimilation System (GEOS DAS)

The National Aeronautics and Space Administration (NASA) Data Assimilation Office (DAO) at the Goddard Space Flight Center (GSFC) has developed the GEOS DAS, a data assimilation system that provides production support for NASA missions and will support NASA's Earth Observing System (EOS) in the coming years. The GEOS DAS will be used to provide background fields of meteorological quantities to EOS satellite instrument teams for use in their data algorithms as well as providing assimilated data sets for climate studies on decadal time scales. The DAO has been involved in prototyping parallel implementations of the GEOS DAS for a number of years and is now embarking on an effort to convert the production version from shared-memory parallelism to distributed-memory parallelism using the portable Message-Passing Interface (MPI). The GEOS DAS consists of two main components, an atmospheric General Circulation Model (GCM) and a Physical-space Statistical Analysis System (PSAS). The GCM operates on data that are stored on a regular grid while PSAS works with observational data that are scattered irregularly throughout the atmosphere. As a result, the two components have different data decompositions. The GCM is decomposed horizontally as a checkerboard with all vertical levels of each box existing on the same processing element(PE). The dynamical core of the GCM can also operate on a rotated grid, which requires communication-intensive grid transformations during GCM integration. PSAS groups observations on PEs in a more irregular and dynamic fashion.

Lucchesi, Rob↗
NASA NTRSDate not supplied

Flow field Reconstruction for Inhomogeneous Turbulence using Data and Physics Driven Models

A methodology combining Large Eddy Simulation (LES) trained data and a physics driven wave packet model to obtain a reduced order reconstruction for broadband, three-dimensional, temporally stationary but spatially inhomogeneous, incompressible turbulence. Wake turbulence generated by an axisymmetric dragging disk with a turbulent co-flow serves as the benchmark test case. We begin by studying the proper-orthogonal decomposition of the turbulent fluctuations taken from a high-resolution LES to first identify whether the fields demonstrate a low-rank character. It is argued that the presence of the turbulent co-flow results in a largely broadband character lacking any tonal properties. This is especially true for Strouhal numbers greater than 1 and only a small fraction of energy is contained in the leading order Kelvin-Helmholtz modes. As such reconstructions and reduced order modeling purely relying on data from LES does not appear to be a lucrative solution - contrary to problems with strongly tonal character. To supplement the missing energy from a low order truncated mode expansion, we utilize a physics based super-resolution (enrichment) algorithm that relies on spatio-temporally localized Gabor wave packets whose time evolution is described using a set of ordinary differential equations. The reconstructed flow has single- and two-point correlations that are consistent with the reference high resolution simulation data.

SLS↗
DOE OSTI2022

On the Rapid Calculation of Binding Affinities for Antigen and Antibody Design and Affinity Maturation Simulations

The accurate and efficient calculation of protein-protein binding affinities is an essential component in antibody and antigen design and optimization, and in computer modeling of antibody affinity maturation. Such calculations remain challenging despite advances in computer hardware and algorithms, primarily because proteins are flexible molecules, and thus, require explicit or implicit incorporation of multiple conformational states into the computational procedure. The astronomical size of the amino acid sequence space further compounds the challenge by requiring predictions to be computed within a short time so that many sequence variants can be tested. In this study, we compare three classes of methods for antibody/antigen (Ab/Ag) binding affinity calculations: (i) a method that relies on the physical separation of the Ab/Ag complex in equilibrium molecular dynamics (MD) simulations, (ii) a collection of 18 scoring functions that act on an ensemble of structures created using homology modeling software, and (iii) methods based on the molecular mechanics-generalized Born surface area (MM-GBSA) energy decomposition, in which the individual contributions of the energy terms are scaled to optimize agreement with the experiment. When applied to a set of 49 antibody mutations in two Ab/HIV gp120 complexes, all of the methods are found to have modest accuracy, with the highest Pearson correlations reaching about 0.6. In particular, the most computationally intensive method, i.e., MD simulation, did not outperform several scoring functions. The optimized energy decomposition methods provided marginally higher accuracy, but at the expense of requiring experimental data for parametrization. Within each method class, we examined the effect of the number of independent computational replicates, i.e., modeled structures or reinitialized MD simulations, on the prediction accuracy. We suggest using about ten modeled structures for scoring methods, and about five simulation replicates for MD simulations as a rule of thumb for obtaining reasonable convergence. We anticipate that our study will be a useful resource for practitioners working to incorporate binding affinity calculations within their protein design and optimization process.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1990

A decentralized linear quadratic control design method for flexible structures

A decentralized suboptimal linear quadratic control design procedure which combines substructural synthesis, model reduction, decentralized control design, subcontroller synthesis, and controller reduction is proposed for the design of reduced-order controllers for flexible structures. The procedure starts with a definition of the continuum structure to be controlled. An evaluation model of finite dimension is obtained by the finite element method. Then, the finite element model is decomposed into several substructures by using a natural decomposition called substructuring decomposition. Each substructure, at this point, still has too large a dimension and must be reduced to a size that is Riccati-solvable. Model reduction of each substructure can be performed by using any existing model reduction method, e.g., modal truncation, balanced reduction, Krylov model reduction, or mixed-mode method. Then, based on the reduced substructure model, a subcontroller is designed by an LQ optimal control method for each substructure independently. After all subcontrollers are designed, a controller synthesis method called substructural controller synthesis is employed to synthesize all subcontrollers into a global controller. The assembling scheme used is the same as that employed for the structure matrices. Finally, a controller reduction scheme, called the equivalent impulse response energy controller (EIREC) reduction algorithm, is used to reduce the global controller to a reasonable size for implementation. The EIREC reduced controller preserves the impulse response energy of the full-order controller and has the property of matching low-frequency moments and low-frequency power moments. An advantage of the substructural controller synthesis method is that it relieves the computational burden associated with dimensionality. Besides that, the SCS design scheme is also a highly adaptable controller synthesis method for structures with varying configuration, or varying mass and stiffness properties.

Su, Tzu-Jeng↗
NASA NTRS2005

Gesture Based Control and EMG Decomposition

This paper presents two probabilistic developments for use with Electromyograms (EMG). First described is a new-electric interface for virtual device control based on gesture recognition. The second development is a Bayesian method for decomposing EMG into individual motor unit action potentials. This more complex technique will then allow for higher resolution in separating muscle groups for gesture recognition. All examples presented rely upon sampling EMG data from a subject's forearm. The gesture based recognition uses pattern recognition software that has been trained to identify gestures from among a given set of gestures. The pattern recognition software consists of hidden Markov models which are used to recognize the gestures as they are being performed in real-time from moving averages of EMG. Two experiments were conducted to examine the feasibility of this interface technology. The first replicated a virtual joystick interface, and the second replicated a keyboard. Moving averages of EMG do not provide easy distinction between fine muscle groups. To better distinguish between different fine motor skill muscle groups we present a Bayesian algorithm to separate surface EMG into representative motor unit action potentials. The algorithm is based upon differential Variable Component Analysis (dVCA) [l], [2] which was originally developed for Electroencephalograms. The algorithm uses a simple forward model representing a mixture of motor unit action potentials as seen across multiple channels. The parameters of this model are iteratively optimized for each component. Results are presented on both synthetic and experimental EMG data. The synthetic case has additive white noise and is compared with known components. The experimental EMG data was obtained using a custom linear electrode array designed for this study.

Wheeler, Kevin R.↗
DOE OSTI2022

Pele: An Exascale-Ready Suite of Combustion Codes

High fidelity simulations of realistic combustion devices are extremely demanding computationally because of the requirements to capture complex fuel chemical decomposition, its intricate interactions with turbulent, often multiphase, flows, and the wide separation of space and time scales between the thin flame and the device boundaries. Software required to carry out such computations tends to be extremely complex, particularly when designed to exploit hardware accelerators, and can be difficult to port and maintain. We present Pele, a performance portable suite of tools for the simulation of combustion systems, including codes to evolve reactive multiphase configurations in the low Mach number and compressible flow regimes, along with a set of inter-compatible post processing and in situ analysis tools. The Pele suite of tools is built on top of the AMReX framework for block-structured adaptive mesh refinement, which provides efficient data structures and algorithms that enable the development of a wide variety of efficient mesh and particle based PDE integration schemes. A hierarchical MPI+X parallelism scheme supports CPU-only and accelerated architectures, where X can be OpenMP, CUDA, and HIP based approaches for intra-node computational work distribution. The algorithms and data structures underlying the Pele simulation and analysis tools are highly scalable and performant across a wide variety of high-performance computing platforms, including DOEs newest exascale-class machines, Frontier and Aurora. The simulation and analysis tools are fully documented and freely distributed as open source via GitHub. We present key algorithmic and software challenges, solution strategies, performance and resulting set of capabilities.

AMReX↗
DOE OSTI2026

Machine learning-based bias-corrected future projections of ozone concentrations from a chemistry-climate model

Reliable projection of future near-surface ozone is crucial for air quality management and health risk assessment. However, potential biases in spatial distribution, magnitude and trends in ozone concentrations simulated by global chemistry-climate models limit their applicability in regional-scale evaluations. In this study, LightGBM, a machine learning (ML) algorithm is applied to correct biases in CESM2-simulated ozone concentrations over China, the United States and Europe and calibrate future ozone projections under two diverse Shared Socioeconomic Pathways (SSP1-2.6 and SSP5-8.5) scenarios from 2020 to 2060. The ML-based correction significantly improves the spatial distribution and reduces the model bias by 40%–60%. It also reverses the potentially incorrect trend of ozone change under SSP1-2.6 in eastern China. When applying ML-based bias correction to CESM2 future projections, warm season mean ozone concentrations decrease across China, the United States, and Europe by –13.5, –17.9, and –13.7 µg/m³, respectively, between 2020 and 2060 in SSP1-2.6, while they increase by 9.4, 2.0, and 5.2 µg/m³ in SSP5-8.5. Decomposition analysis show that changes in anthropogenic emissions dominate future ozone changes in both scenarios, while strong climate penalty from ozone changes occurs in polluted eastern China and climate benefit is found in western China, the United States and Europe under SSP5-8.5. These findings demonstrate the value of combining ML with chemistry-climate models to produce more accurate air quality projections, thereby informing more effective and region-specific environmental protection strategies.

Chemistry Model↗
DOE OSTI2018

Deploy threading in Nalu solver stack

The goal of the ExaWind project is to enable predictive simulations of wind farms composed of many MW-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines, and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary code in the ExaWind project is Nalu, which is an unstructured-grid solver for the acousticallyincompressible Navier-Stokes equations, and mass continuity is maintained through pressure projection. The model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as re-initialization of matrices and re-computation of preconditioners is required at every time step In this Milestone, we examine the effect of threading on the solver stack performance against flat-MPI results obtained from previous milestones using Haswell performance data full-turbine simulations. Whereas the momentum equations are solved only with the Trilinos solvers, we investigate two algebraic-multigrid preconditioners for the continuity equations: Trilinos/Muelu and HYPRE/BoomerAMG. These two packages embody smoothed-aggregation and classical Ruge-Stiiben AMG methods, respectively. In our FY18 Q2 report, we described our efforts to improve setup and solve of the continuity equations under flat-MPI parallelism. While significant improvement was demonstrated in the solve phase, setup times remained larger than expected. Starting with the optimized settings described in the Q2 report, we explore here simulation performance where OpenMP threading is employed in the solver stack. For Trilinos, threading is acheived through the Kokkos abstraction where, whereas HYPRE/BoomerAMG employs straight OpenMP. We examined results for our mid-resolution baseline turbine simulation configuration (229M DOF). Simulations on 2048 Haswell cores explored the effect of decreasing the number of MPI ranks while increasing the number of threads. Both HYPRE and Trilinos exhibited similar overal solution times, and both showed dramatic increases in simulation time in the shift from MPI ranks to OpenMP threads. This increase is attributed to the large amount of work per MPI rank starting at the single-thread configuration. Decreasing MPI ranks, while increasing threads, may be increasing simulation time due to thread synchronization and start-up overhead contributing to the latency and serial time in the model. These result showed that an MPI+OpenMP parallel decomposition will be more effective as the amount per MPI rank computation per MPI rank decreases and the communication latency increases. This idea was demonstrated in a strong scaling study of our low-resolution baseline model (29M DOF) with the Trilinos-HYPRE configuration. While MPI-only results showed scaling improvement out to about 1536 cores, engaging threading carried scaling improvements out to 4128 cores — roughly 7000 DOF per core. This is an important result as improved strong scaling is needed for simulations to be executed over sufficiently long simulated durations (i.e., for many timesteps). In addition to threading work described above, the team examined solver-performance improvements by exploring communication-overhead in the HYPRE-GMRES implementation through a communicationoptimal- GMRE algorithm (CO-GMRES), and offloading compute-intensive solver actions to GPUs. To those ends, a HYPRE mini-app was allow us to easily test different solver approaches and HYPRE parameter settings without running the entire Nalu code. With GPU acceleration on the Summitdev supercomputer, a 20x speedup was achieved for the overall preconditioner and solver execution time for the mini-app. A study on Haswell processors showed that CO-GMRES provides benefits as one increases MPI ranks.

17 WIND ENERGY↗
DOE OSTI2025

Spinor representations for fields with any spin: Lorentz tensor basis for operators and covariant multipole decomposition

This paper discusses a framework to parametrize and decompose operator matrix elements for particles with higher spin (j > 1/2) using chiral representations of the Lorentz group, i.e. the (j, 0) and (0, j) representations and their parity-invariant direct sum. Unlike traditional approaches that require imposing constraints to eliminate spurious degrees of freedom, these chiral representations contain exactly the 2j + 1 components needed to describe a spin-j particle. The central objects in the construction are the t-tensors, which are generalizations of the Pauli four-vector σ μ for higher spin. For the generalized spinors of these representations, we demonstrate how the algebra of the t-tensors allows to formulate a generalization of the Dirac matrix basis for any spin. For on-shell bilinears, we show that a set consisting exclusively of covariant multipoles of order 0 ≤ m ≤ 2j forms a complete basis. We provide explicit expressions for all bilinears of the generalized Dirac matrix basis, which are valid for any spin value. As a byproduct of our derivations we present an efficient algorithm to compute the t-tensor matrix elements. The formalism presented here paves the way to use a more unified approach to analyze the non-perturbative QCD structure of hadrons and nuclei across different spin values, with clear physical interpretation of the resulting distributions as covariant multipoles.

Angular momentum of light↗
DOE OSTI2022

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A comparative study of shear band tracking strategies in three-dimensional finite elements with embedded weak discontinuities

We present a computational framework for the treatment of shear localization in metallic materials under dynamic loading, based on the integration of a shear band tracking strategy into an explicit 3D finite element formulation with embedded weak discontinuities. Within this computational framework, an embedded shear band’s mid-surface is represented by an iso-surface of a level set function, which is obtained by solving a heatconduction type boundary value problem (BVP). The solution of this BVP is carried out either globally over the entire problem domain, or locally at the level of individual elements in the mesh. In this paper, we present a detailed comparison of these global and local algorithmic implementations of the shear band tracking strategy. Numerical results obtained using these two implementations, and using a simplified formulation without shear band tracking, are presented and compared. Moreover, we compare the computational efficiency and parallel scaling performance of the local and global implementations. This comparative study shows that both implementations can simulate the initiation of two independent shear bands and their propagation past each other without merging, whereas only the global implementation can successfully simulate the merging of two branches of a single shear band. This study also confirms that the global implementation is more computationally intensive, since it requires a global system of linear equations associated with the level set BVP to be solved at each time step. Both implementations exhibit very good scalability in domain decomposition-based parallel simulations.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Correlated Synthetic Time Series Generation using Fourier and ARMA

As the contribution of renewable energy grows in electricity markets, the complexity nuclear’s place within the energy mix increases, and likewise the need for robust simulation techniques. While decades of wind, solar, and demand pro- files can sometimes be obtained, this is too few samples to provide a statistically meaningful analysis of a system with baseload, peaker, and renewable generation. Synthetic time series generation presents itself as a suitable methodology to meet this need. One approach for synthetic series generation is training a model using Fourier series decomposition for seasonal patterns and Auto-Regressive Moving Average models (ARMA) to describe time-correlated statistical noise about the seasonal patterns. When combined, the Fourier plus ARMA (FARMA) model has been shown to provide an infinite set of independent, identically-distributed sample time series with the same statistical properties as the original data [1]. When considering an energy mix with renewable electricity production, several time series of energy, grid, and weather measurements are needed for each synthetic year modeled to statistically comprehend the efficiency of any given energy mix. These cannot be considered independent series in a given synthetic year. To capture and reproduce the correlations that might exist in the measured histories, the ARMA can further be extended as a Vector ARMA (VARMA). In the VARMA algorithm, covariance in statistical noise is captured both within a history as part of the autoregressive moving average, and with respect to the other variables in the time series. In this work the implementation of the Fourier VARMA in the RAVEN uncertainty quantification and risk analysis software framework [2] is presented, along with examples of correlated synthetic history generation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Computational Framework for Machine-Learning-Enabled 13 C Fluxomics

13 C metabolic flux analysis (MFA) has emerged as a powerful tool for synthetic biology. This optimization-based approach suffers long computation time and unstable solutions depending on the initial guess. Here, we develop a machine-learning-based framework for 13 C fluxomics. Specifically, training and test data sets are generated by metabolic network decomposition and flux sampling, in which flux ratios at metabolic nodes and simulated labeling patterns of metabolites are used as training targets and features, respectively. To improve prediction accuracy and simplify the model, automated processes are developed for flux ratio selection based on solvability and feature screening based on importance. We found that predictive performance can be significantly improved using both amino acids and central carbon metabolites in comparison with amino acids alone. Together with measured external fluxes, the predicted flux ratios determine the mass balance system, yielding global flux distributions. This approach is validated by flux estimation using both simulated and experimental data in comparison with canonical 13 C MFA. The approach represents a reliable fluxomics method readily applicable to high-throughput metabolic phenotyping, which highlights the advances of intelligent learning algorithms in synthetic biology, specifically in the Test and Learn stage of the Design-Build-Test-Learn cycle.

13C metabolic flux analysis↗
DOE OSTI2021

Flow and heat transfer in the wake of a triangular arrangement of spheres

This research work seeks to investigate the influence of spacing and heat transfer on the wake behavior of a triangular arrangement of spheres. Four experimental configurations have been investigated at three Reynolds numbers, Re 1 = 350, Re 2 = 700, and Re 3 = 1050. Two isothermal cases were investigated with spacing between the spheres of zero and one sphere diameter, and two cases were investigated with an applied heat flux at the same spacing conditions. The time resolved particle image velocimetry results revealed various flow phenomena including flow separations, von Karman vortex shedding, and Kelvin–Helmholtz instabilities. The turbulent statistics reveal the effect of proximity and heat transfer on the time averaged values of the wake size, turbulent strengths, and Reynolds shear stress in the wake of each sphere, namely, the laminarization effects from the addition of heat and the suppression of the lead sphere wake from the proximity of the trailing spheres. These results are complemented by the application of proper orthogonal decomposition (POD) to the flow fields, which extracts the coherent structures from the flow. Here the modes that describe the coherent structures are extracted and described in detail, which provide further insight into effects of the experimental conditions on the temporal behavior of the flow. Many of the low order modes are found to be associated in pairs, corresponding to asymmetric structures or advection of a given structure downstream. The capability of POD to produce reduced order models of the flow is then utilized to facilitate vortex identification analysis. A turbulent kinetic energy based mode truncation criteria, which has been found to enhance vortex identification capability, is applied to select the POD modes and temporal coefficients to be used in the reduced order modeling. The reconstructed velocity fields are then analyzed with vortex identification algorithms to extract the vortex cores and boundaries. The combination of these approaches allows the study of the effect of proximity and heat transfer on the vortex characteristics, such as size, strength, and distribution.

42 ENGINEERING↗