Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “dynamical orthogonality”

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 55 records · Page 3

Cycle equivalence classes, orthogonal Weingarten calculus, and the mean field theory of memristive systems

Abstract It has been recently noted that for a class of dynamical systems with explicit conservation laws represented via projector operators, the dynamics can be understood in terms of lower dimensional equations. This is the case, for instance, of memristive circuits. Memristive systems are important classes of devices with wide-ranging applications in electronic circuits, artificial neural networks, and memory storage. We show that such mean-field theories can emerge from averages over the group of orthogonal matrices, interpreted as cycle-preserving transformations applied to the projector operator describing Kirchhoff’s laws. Our results provide insights into the fundamental principles underlying the behavior of resistive and memristive circuits and highlight the importance of conservation laws for their mean-field theories. In addition, we argue that our results shed light on the nature of the critical avalanches observed in quasi-two-dimensional nanowires as boundary phenomena.

97 MATHEMATICS AND COMPUTING↗

Bayesian inference of structured latent spaces from neural population activity with the orthogonal stochastic linear mixing model

The brain produces diverse functions, from perceiving sounds to producing arm reaches, through the collective activity of populations of many neurons. Determining if and how the features of these exogenous variables (e.g., sound frequency, reach angle) are reflected in population neural activity is important for understanding how the brain operates. Often, high-dimensional neural population activity is confined to low-dimensional latent spaces. However, many current methods fail to extract latent spaces that are clearly structured by exogenous variables. This has contributed to a debate about whether or not brains should be thought of as dynamical systems or representational systems. Here, we developed a new latent process Bayesian regression framework, the orthogonal stochastic linear mixing model (OSLMM) which introduces an orthogonality constraint amongst time-varying mixture coefficients, and provide Markov chain Monte Carlo inference procedures. We demonstrate superior performance of OSLMM on latent trajectory recovery in synthetic experiments and show superior computational efficiency and prediction performance on several real-world benchmark data sets. We primarily focus on demonstrating the utility of OSLMM in two neural data sets: μ ECoG recordings from rat auditory cortex during presentation of pure tones and multi-single unit recordings form monkey motor cortex during complex arm reaching. We show that OSLMM achieves superior or comparable predictive accuracy of neural data and decoding of external variables (e.g., reach velocity). Most importantly, in both experimental contexts, we demonstrate that OSLMM latent trajectories directly reflect features of the sounds and reaches, demonstrating that neural dynamics are structured by neural representations. Together, these results demonstrate that OSLMM will be useful for the analysis of diverse, large-scale biological time-series datasets.

59 BASIC BIOLOGICAL SCIENCES↗

Modal dynamics of wind turbine wake meandering from lidar observations

Horizontal scans from nacelle-mounted lidars provide time series measurements of wind turbine wakes across diverse atmospheric conditions, enabling analysis of coherent turbulent structures that influence wake meandering through proper orthogonal decomposition (POD). While low-order modes capture the most energetic turbulent structures, our analysis reveals that they do not necessarily dominate wake meandering dynamics. We evaluate more than 16,000 combinatorial reconstructions of the flow field for each inflow case, demonstrating that mode relevance depends on mode symmetry, turbulent kinetic energy content, and inflow characteristics. Cases with low turbulence intensity and large integral timescales show stronger correlations between POD modes and wake meandering, whereas higher turbulence conditions (turbulence intensity > 7%) are less effectively described by reduced-order models. However, the qualitative similarity of POD modes across varied atmospheric conditions suggests the potential existence of a semi-universal basis for representing wind turbine wakes, with implications for improving engineering wake models.

17 WIND ENERGY↗

Flow-driven spectral chaos (FSC) method for simulating long-time dynamics of arbitrary-order non-linear stochastic dynamical systems

Uncertainty quantification techniques such as the time-dependent generalized polynomial chaos (TD-gPC) use an adaptive orthogonal basis to better represent the stochastic part of the solution space (aka random function space) in time. However, because the random function space is constructed using tensor products, TD-gPC-based methods are known to suffer from the curse of dimensionality. Here, we introduce a new numerical method called the flow-driven spectral chaos (FSC) which overcomes this curse of dimensionality at the random-function-space level. The proposed method is not only computationally more efficient than existing TD-gPC-based methods but is also far more accurate. The FSC method uses the concept of enriched stochastic flow maps to track the evolution of a finite-dimensional random function space efficiently in time. To transfer the probability information from one random function space to another, two approaches are developed and studied herein. In the first approach, the probability information is transferred in the mean-square sense, whereas in the second approach the transfer is done exactly using a new theorem that was developed for this purpose. The FSC method can quantify uncertainties with high fidelity, especially for the long-time response of stochastic dynamical systems governed by ODEs of arbitrary order. Six representative numerical examples, including a nonlinear problem (the Van-der-Pol oscillator), are presented to demonstrate the performance of the FSC method and corroborate the claims of its superior numerical properties. Finally, a parametric, high-dimensional stochastic problem is used to demonstrate that when the FSC method is used in conjunction with Monte Carlo integration, the curse of dimensionality can be overcome altogether.

(nonlinear) stochastic dynamical systems↗

Data-driven recovery of hidden physics in reduced order modeling of fluid flows

In this article, we introduce a modular hybrid analysis and modeling (HAM) approach to account for hidden physics in reduced order modeling (ROM) of parameterized systems relevant to fluid dynamics. The hybrid ROM framework is based on using first principles to model the known physics in conjunction with utilizing the data-driven machine learning tools to model the remaining residual that is hidden in data. This framework employs proper orthogonal decomposition as a compression tool to construct orthonormal bases and Galerkin projection (GP) as a model to build the dynamical core of the system. Our proposed methodology hence compensates structural or epistemic uncertainties in models and utilizes the observed data snapshots to compute true modal coefficients spanned by these bases. The GP model is then corrected at every time step with a data-driven rectification using a long short-term memory (LSTM) neural network architecture to incorporate hidden physics. A Grassmannian manifold approach is also adopted for interpolating basis functions to unseen parametric conditions. The control parameter governing the system's behavior is thus implicitly considered through true modal coefficients as input features to the LSTM network. The effectiveness of the HAM approach is then discussed through illustrative examples that are generated synthetically to take hidden physics into account. Furthermore, our approach thus provides insights addressing a fundamental limitation of the physics-based models when the governing equations are incomplete to represent underlying physical processes.

42 ENGINEERING↗

LaSDI: Parametric Latent Space Dynamics Identification

Enabling fast and accurate physical simulations with data has become an important area of computational physics to aid in inverse problems, design-optimization, uncertainty quantification, and other various decision-making applications. This paper presents a data-driven framework for parametric latent space dynamics identification procedure that enables fast and accurate simulations. The parametric model is achieved by building a set of local latent space model and designing an interaction among them. An individual local latent space dynamics model achieves accurate solution in a trust region. By letting the set of trust region to cover the whole parameter space, our model shows an increase in accuracy with an increase in training data. Herein we introduce two different types of interaction mechanisms, i.e., point-wise and region-based approach. Both linear and nonlinear data compression techniques are used. We illustrate the framework of Latent Space Dynamics Identification (LaSDI) enable a fast and accurate solution process on various partial differential equations, i.e., Burgers’ equations, radial advection problem, and nonlinear heat conduction problem, achieving 0 (100)x speed-up and 0 (1)% relative error with respect to the corresponding full order models.

97 MATHEMATICS AND COMPUTING↗

Reduced-order modeling of advection-dominated systems with recurrent neural networks and convolutional autoencoders

A common strategy for the dimensionality reduction of nonlinear partial differential equations (PDEs) relies on the use of the proper orthogonal decomposition (POD) to identify a reduced subspace and the Galerkin projection for evolving dynamics in this reduced space. However, advection-dominated PDEs are represented poorly by this methodology since the process of truncation discards important interactions between higher-order modes during time evolution. In this study, we demonstrate that encoding using convolutional autoencoders (CAEs) followed by a reduced-space time evolution by recurrent neural networks overcomes this limitation effectively. We demonstrate that a truncated system of only two latent space dimensions can reproduce a sharp advecting shock profile for the viscous Burgers equation with very low viscosities, and a six-dimensional latent space can recreate the evolution of the inviscid shallow water equations. Additionally, the proposed framework is extended to a parametric reduced-order model by directly embedding parametric information into the latent space to detect trends in system evolution. Furthermore, our results show that these advection-dominated systems are more amenable to low-dimensional encoding and time evolution by a CAE and recurrent neural network combination than the POD-Galerkin technique.

97 MATHEMATICS AND COMPUTING↗

An Orthogonal Recursive Bisection (ORB) Based Time Advancement Algorithm for CFD-DEM Solvers

The time integration of the granular phase in coupled computational fluid dynamics (CFD) – discrete element method (DEM) simulations presents a unique computational challenge brought about by the large variations in particle collisional time scales. Particles in the dilute regions of the computational domain can be advanced with large time steps while dense regions require much smaller time increments. However, the time step size in most solvers is globally set as the limit for accuracy and stability imposed by the collisions and is typically orders of magnitude less than that required away from collisions. This work addresses this precise issue and provides a strategy to avoid the use of a global conservative small time step size for the entire set of particles.A novel time stepping algorithm for CFD-DEM solvers using a partitioning approach using orthogonal recursive bisection (ORB) that allows for variable time steps among particles is described and its computational performance is compared against baseline explicit methods, typically used in several CFD-DEM solvers. ORB has advantages of being relatively quick and easy to update incrementally and has the required heuristic behavior (i.e., it will split the region in half with a cluster on each side) when groups of particles are well separated (clustered). The algorithm presented in this work uses a local time stepping approach to resolve collisional time scales for subsets of particles that are present at the leaves of the ORB, thereby resulting in substantial reduction of computational cost. The parallel implementation of this method where a ``knapsack” algorithm is used in tandem with ORB for effective load-balancing is also presented, where a best possible partitioning is obtained based on number of particles and local time-stepping costs. The algorithm is tested against benchmark problems with varying particle distributions that include fluidized bed and riser flow scenarios. Preliminary results indicate that the approach is 2-3X faster than traditional explicit methods for problems that involve both dense and dilute regions, while maintaining the same level of accuracy.

adaptive timestepping↗

Implications of Shear and Thermal Stratification on Wind Turbine Tip-Vortex Stability

The interaction between wind turbines in a wind farm through their wakes is a phenomenon that has been studied for decades and is still relevant today. Turbines clustered together in arrays will often operate in the wake of other upstream turbines which may lead to significant power losses and fatigue loads. For modern large-scale wind turbines, the mean shear velocity profile and thermal stratification are major components of the atmospheric boundary layer so it is important to understand their impact on near-wake development. Additionally, veer is present due to the rotation of the Earth. The impact of shear, thermal stratification and veer on the stable wake length of turbines with a dynamic control strategy is studied numerically in this work using a suite of highly resolved large-eddy simulations. Instantaneous flow fields are extracted from the simulations and used to conduct proper orthogonal decomposition (POD) and compute the mean kinetic energy fluxes by different POD modes to better understand the tip-vortex instability mechanisms. Our findings show that the dynamic pitch control scheme is able to shorten the stable wake length to about 1.5R in uniform flow. Shear can significantly affect the break up of wind turbine tip-vortices as well as the shape and stable length of the wake, whereas thermal stratification seems to only have limited contribution to the spatial development of the near-wake field. Veer causes the wake boundary to skew but has a limited impact on the wake length.

length thermal stratification↗

Neural-network learning of SPOD latent dynamics

Here, we aim to reconstruct the latent space dynamics of high dimensional, quasi-stationary systems using model order reduction via the spectral proper orthogonal decomposition (SPOD). The proposed method is based on three fundamental steps: in the first, once that the mean flow field has been subtracted from the realizations (also referred to as snapshots), we compress the data from a high-dimensional representation to a lower dimensional one by constructing the SPOD latent space; in the second, we build the time-dependent coefficients by projecting the snapshots containing the fluctuations onto the SPOD basis and we learn their evolution in time with the aid of recurrent neural networks; in the third, we reconstruct the high-dimensional data from the learnt lower -dimensional representation. The proposed method is demonstrated on two different test cases, namely, a compressible jet flow, and a geophysical problem known as the Madden-Julian Oscillation. An extensive comparison between SPOD and the equivalent POD-based counterpart is provided and differences between the two approaches are highlighted. The numerical results suggest that the proposed model is able to provide low rank predictions of complex statistically stationary data and to provide insights into the evolution of phenomena characterized by specific range of frequencies. The comparison between POD and SPOD surrogate strategies highlights the need for further work on the characterization of the interplay of error between data reduction techniques and neural network forecasts.

97 MATHEMATICS AND COMPUTING↗

A fourth-order Lagrangian discontinuous Galerkin method using a hierarchical orthogonal basis on curvilinear grids

The existing high-order Lagrangian discontinuous Galerkin (DG) hydrodynamic methods are restricted to using quadratic meshes with quadratic polynomials (P2), which in turn, yield up to third-order accuracy. Additionally, these existing DG hydrodynamic schemes, when extended to work with cubic meshes and cubic polynomials (P3), can be unstable on strong-shock problems. Therefore, this paper presents a new Lagrangian discontinuous Galerkin (DG) hydrodynamic method to simulate compressible material dynamics ( e.g., gasses, fluids, and solids) with strong-shocks using cubic meshes and cubic polynomials, and delivers up to fourth-order accuracy on smooth flows. The stability on shock problems is achieved using new hierarchical orthogonal basis functions and a new subcell mesh stabilization (SMS) scheme for cubic meshes. The accuracy and robustness of the new high-order accurate Lagrangian DG hydrodynamic method is demonstrated by simulating a diverse suite of challenging test problems covering gas and solid dynamic problems on curvilinear meshes.

97 MATHEMATICS AND COMPUTING↗

Hydrodynamic and frictional modulation of deformations in switchable colloidal crystallites

Displacive transformations in colloidal crystals may offer a pathway for increasing the diversity of accessible configurations without the need to engineer particle shape or interaction complexity. To date, binary crystals composed of spherically symmetric particles at specific size ratios have been formed that exhibit floppiness and facile routes for transformation into more rigid structures that are otherwise not accessible by direct nucleation and growth. There is evidence that such transformations, at least at the micrometer scale, are kinetically influenced by concomitant solvent motion that effectively induces hydrodynamic correlations between particles. Here, we study quantitatively the impact of such interactions on the transformation of binary bcc-CsCl analog crystals into close-packed configurations. We first employ principal-component analysis to stratify the explorations of a bcc-CsCl crystallite into orthogonal directions according to displacement. We then compute diffusion coefficients along the different directions using several dynamical models and find that hydrodynamic correlations, depending on their range, can either enhance or dampen collective particle motions. These two distinct effects work synergistically to bias crystallite deformations toward a subset of the available outcomes.

42 ENGINEERING↗

Three-dimensional single-shot ptychography

Here we introduce three-dimensional single-shot ptychography (3DSSP). 3DSSP leverages an additional constraint unique to the single-shot geometry to deconvolve multiple 2D planes of a 3D object. Numeric simulations and analytic calculations demonstrate that 3DSSP reconstructs multiple planes in an extended 3D object with a minimum separation consistent with the depth of field for a conventional microscope. We experimentally demonstrate 3DSSP by reconstructing orthogonal hair strands axially separated by 5 mm. 3DSSP provides a pathway towards volumetric imaging of dynamically evolving systems on ultrafast timescales.

3DSSP↗

Fermionic mean-field dynamics for spin systems beyond free fermions

We introduce the fermionized time-dependent Hartree–Fock (fTDHF), a real-time quantum dynamics method for spin-1/2 Hamiltonians following their mapping to fermions via the Jordan-Wigner transformation. fTDHF is formally equivalent to exact dynamics in the case of free fermions, and can efficiently handle non-local string operators arising from long-range interactions via transition matrix elements between non-orthogonal Slater determinants. We show that the fTDHF method can be implemented on a classical computer with a cost that scales polynomially with system size, and linearly with the time steps. We benchmark fTDHF against exact dynamics on three separate spin-1/2 models, representing adiabatic preparation of states with long-range correlations, disorder-driven observation of many-body localization, and particle production in the Schwinger model. For each of these systems, fTDHF is shown to reproduce the qualitative dynamics generated by the exact evolutions, while maintaining a simple physical picture due to its mean-field nature.

Dutta, Rishab↗

Rewritable Surface‐Grafted Polymer Brushes with Dynamic Covalent Linkages

Abstract Surface grafting of polymer brushes drastically modifies surface properties, including wettability, compatibility, responsiveness, etc. A broad variety of functionalities can be introduced to the surface via different types of polymers. Bringing together properties of two or more types of polymer brushes to one surface opens up even more possibilities in brush‐modified materials. However, while it is generally feasible to introduce several chemical compositions along the brushes via copolymerization, it is challenging to vary the types of polymer brushes along a surface. Although previous studies have demonstrated binary brushes via orthogonal polymerization techniques or partial deactivation/regrafting, they commonly limit the number of polymer types to two. Here, we propose a strategy to introduce dynamic covalent diketoenamine linkages at the root of polymer brushes. The grafting density could be precisely tuned during surface functionalization. The surface‐anchored polymer brushes were cleaved by the addition of small molecule amines. New polymer brushes can be regrafted from the surface following refunctionalization of exposed sites. The maneuverability allows tuning of the types and densities of the polymer brushes, pointing the way to the preparation of a new generation of well‐defined brush‐modified materials with mixed grafts, with potential applications in the design of smart materials and surfaces.

Cui, Feichen↗

A parallel p ‐adaptive discontinuous Galerkin method for the Euler equations with dynamic load‐balancing on tetrahedral grids

Abstract A novel p ‐adaptive discontinuous Galerkin (DG) method has been developed to solve the Euler equations on three‐dimensional tetrahedral grids. Hierarchical orthogonal basis functions are adopted for the DG spatial discretization while a third order TVD Runge‐Kutta method is used for the time integration. A vertex‐based limiter is applied to the numerical solution in order to eliminate oscillations in the high order method. An error indicator constructed from the solution of order and is used to adapt degrees of freedom in each computational element, which remarkably reduces the computational cost while still maintaining an accurate solution. The developed method is implemented with under the Charm++ parallel computing framework. Charm++ is a parallel computing framework that includes various load‐balancing strategies. Implementing the numerical solver under Charm++ system provides us with access to a suite of dynamic load balancing strategies. This can be efficiently used to alleviate the load imbalances created by p ‐adaptation. A number of numerical experiments are performed to demonstrate both the numerical accuracy and parallel performance of the developed p ‐adaptive DG method. It is observed that the unbalanced load distribution caused by the parallel p ‐adaptive DG method can be alleviated by the dynamic load balancing from Charm++ system. Due to this, high performance gain can be achieved. For the testcases studied in the current work, the parallel performance gain ranged from 1.5× to 3.7×. Therefore, the developed p ‐adaptive DG method can significantly reduce the total simulation time in comparison to the standard DG method without p ‐adaptation.

97 MATHEMATICS AND COMPUTING↗

Influence of non-adiabatic effects on linear absorption spectra in the condensed phase: Methylene blue

Modeling linear absorption spectra of solvated chromophores is highly challenging as contributions are present both from coupling of the electronic states to nuclear vibrations and from solute–solvent interactions. In systems where excited states intersect in the Condon region, significant non-adiabatic contributions to absorption line shapes can also be observed. Here, we introduce a robust approach to model linear absorption spectra accounting for both environmental and non-adiabatic effects from first principles. This model parameterizes a linear vibronic coupling (LVC) Hamiltonian directly from energy gap fluctuations calculated along molecular dynamics (MD) trajectories of the chromophore in solution, accounting for both anharmonicity in the potential and direct solute–solvent interactions. The resulting system dynamics described by the LVC Hamiltonian are solved exactly using the thermalized time-evolving density operator with orthogonal polynomials algorithm (T-TEDOPA). The approach is applied to the linear absorption spectrum of methylene blue in water. We show that the strong shoulder in the experimental spectrum is caused by vibrationally driven population transfer between the bright S1 and the dark S2 states. The treatment of the solvent environment is one of many factors that strongly influence the population transfer and line shape; accurate modeling can only be achieved through the use of explicit quantum mechanical solvation. The efficiency of T-TEDOPA, combined with LVC Hamiltonian parameterizations from MD, leads to an attractive method for describing a large variety of systems in complex environments from first principles.

Dunnett, Angus J. (ORCID:0000000285797826)↗

Efficient optimization method for finding minimum energy paths of magnetic transitions

Here, efficient algorithms for the calculation of minimum energy paths of magnetic transitions are implemented within the geodesic nudged elastic band (GNEB) approach. While an objective function is not available for GNEB and a traditional line search can, therefore, not be performed, the use of limited memory Broyden–Fletcher–Goldfarb–Shanno (LBFGS) and conjugate gradient algorithms in conjunction with orthogonal spin optimization (OSO) approach is shown to greatly outperform the previously used velocity projection and dissipative Landau–Lifschitz dynamics optimization methods. The implementation makes use of energy weighted springs for the distribution of the discretization points along the path and this is found to improve performance significantly. The various methods are applied to several test problems using a Heisenberg-type Hamiltonian, extended in some cases to include Dzyaloshinskii–Moriya and exchange interactions beyond nearest neighbours. Minimum energy paths are found for magnetization reversals in a nano-island, collapse of skyrmions in two-dimensional layers and annihilation of a chiral bobber near the surface of a three-dimensional magnet. The LBFGS-OSO method is found to outperform the dynamics based approaches by up to a factor of 8 in some cases.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗