Search NASA⌕ Search

SEARCH · Search NASA

Results for “Nonlinear projection”

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 19 records

Smooth local subspace projection for nonlinear noise reduction

Many nonlinear or chaotic time series exhibit an innate broad spectrum, which makes noise reduction difficult. Local projective noise reduction is one of the most effective tools. It is based on proper orthogonal decomposition (POD) and works for both map-like and continuously sampled time series. However, POD only looks at geometrical or topological properties of data and does not take into account the temporal characteristics of time series. Here, we present a new smooth projective noise reduction method. It uses smooth orthogonal decomposition (SOD) of bundles of reconstructed short-time trajectory strands to identify smooth local subspaces. Restricting trajectories to these subspaces imposes temporal smoothness on the filtered time series. It is shown that SOD-based noise reduction significantly outperforms the POD-based method for continuously sampled noisy time series.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Space–Time Least-Squares Petrov–Galerkin Projection for Nonlinear Model Reduction

This work proposes a space--time least-squares Petrov--Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply (Petrov--)Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed method applies projection in space and time simultaneously. To accomplish this, the method first introduces a low-dimensional space--time trial subspace, which can be obtained by computing tensor decompositions of state-snapshot data. The method then computes discrete-optimal approximations in this space--time trial subspace by minimizing the residual arising after time discretization over all space and time in a weighted $\ell^2$-norm. This norm can be defined to enable complexity reduction (i.e., hyper-reduction) in time, which leads to space--time collocation and space--time Gauss--Newton with Approximated Tensors (GNAT) variants of the ST-LSPG method. Advantages of the approach relative to typical spatial-projection-based nonlinear model reduction methods such as Galerkin projection and least-squares Petrov--Galerkin projection include a reduction of both the spatial and temporal dimensions of the dynamical system, and a priori error bounds that bound the solution error by the best space--time approximation error and whose stability constants exhibit slower growth in time. Numerical examples performed on model problems in fluid dynamics demonstrate the ability of the method to generate orders-of-magnitude computational savings relative to spatial-projection-based reduced-order models without sacrificing accuracy for a fixed spatio-temporal discretization.

97 MATHEMATICS AND COMPUTING↗

Space-time least-squares Petrov-Galerkin projection in nonlinear model reduction.

Our work proposes a space-time least-squares Petrov-Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply Petrov-Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed method applies projection in space and time simultaneously. To accomplish this, the method first introduces a low-dimensional space-time trial subspace, which can be obtained by computing tensor decompositions of state-snapshot data. The method then computes discrete-optimal approximations in this space-time trial subspace by minimizing the residual arising after time discretization over all space and time in a weighted ℓ 2 -norm. This norm can be de ned to enable complexity reduction (i.e., hyper-reduction) in time, which leads to space-time collocation and space-time GNAT variants of the ST-LSPG method. Advantages of the approach relative to typical spatial-projection-based nonlinear model reduction methods such as Galerkin projection and least-squares Petrov-Galerkin projection include: (1) a reduction of both the spatial and temporal dimensions of the dynamical system, (2) the removal of spurious temporal modes (e.g., unstable growth) from the state space, and (3) error bounds that exhibit slower growth in time. Numerical examples performed on model problems in fluid dynamics demonstrate the ability of the method to generate orders-of-magnitude computational savings relative to spatial-projection-based reduced-order models without sacrificing accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reduced order models for thermal radiative transfer problems based on moment equations and data-driven approximations of the Eddington tensor

Here a new group of structure and asymptotic preserving reduced-order models (ROMs) for multidimensional nonlinear thermal radiative transfer (TRT) problems is presented. They are formulated by means of the nonlinear projective approach and data compression techniques. The nonlinear projection is applied to the Boltzmann transport equation (BTE) to derive a hierarchy of low-order moment equations. Approximation of the Eddington tensor that provides exact closure for the system of moment equations is found with projection-based data-driven methodologies. These include the (i) proper orthogonal decomposition (POD), (ii) dynamic mode decomposition (DMD) and (iii) a variant of the DMD. A parameterization is derived for this ROM for the temperature of radiation incoming to the problem domain (the radiation drive temperature). This parameterization is informed from results of a dimensionless study of the TRT problem. Analysis of the ROMs is performed on the classical Fleck-Cummings TRT multigroup test problem in 2D geometry with a radiation-driven Marshak wave. Numerical results are presented to demonstrate the performance of these ROMs for the simulation of evolving radiation and heat waves. Results show these models to be sufficiently accurate for practical computations with rather low-rank representations of the Eddington tensor. As the rank of the approximation is increased, the errors of solutions generated by the ROMs gradually decreases.

42 ENGINEERING↗

Galerkin v. discrete-optimal projection in nonlinear model reduction

Discrete-optimal model-reduction techniques such as the Gauss{Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible ow problems where standard Galerkin techniques have failed. However, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform projection at the time-continuous level, while discrete-optimal techniques do so at the time-discrete level. This work provides a detailed theoretical and experimental comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge{Kutta schemes. We present a number of new ndings, including conditions under which the discrete-optimal ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and experimentally that decreasing the time step does not necessarily decrease the error for the discrete-optimal ROM; instead, the time step should be `matched' to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible- ow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the discrete-optimal reduced-order model by an order of magnitude.

CFD↗

Galerkin v. least-squares Petrov–Galerkin projection in nonlinear model reduction

Least-squares Petrov–Galerkin (LSPG) model-reduction techniques such as the Gauss–Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible flow problems where standard Galerkin techniques have failed. Furthermore, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform optimal projection associated with residual minimization at the time-continuous level, while LSPG techniques do so at the time-discrete level. This work provides a detailed theoretical and computational comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge–Kutta schemes. We present a number of new findings, including conditions under which the LSPG ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and computationally that decreasing the time step does not necessarily decrease the error for the LSPG ROM; instead, the time step should be ‘matched’ to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible-flow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the LSPG reduced-order model by an order of magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

IC Report for project “Developing nonlinear laser-plasma instability models for high-fidelity, multi-physics simulation capability for ICF/HED” [Slides]

We’ve achieved our technical goals: (1) Perform large-scale kinetic simulations of SRS and CBET a range of plasma and laser conditions; (2) Develop a new $\delta f$-Gaussian-mixture algorithm to represent non-Maxwellian distribution functions from particle trapping and time-dependent plasma response; (3) Develop physics-based preliminary nonlinear LPI models for coupling to LRT/ Mazinisin and AMP; and (4) Begin implementation of LPI sub-grid models into Mazinisin.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Observed galaxy number counts on the lightcone up to second order: I. Main result

We present the galaxy number overdensity up to second order in redshift space on cosmological scales for a concordance model. The result contains all general relativistic effects up to second order that arise from observing on the past light cone, including all redshift effects, lensing distortions from convergence and shear, and contributions from velocities, Sachs-Wolfe, integrated SW and time-delay terms. This result will be important for accurate calculation of the bias on estimates of non-Gaussianity and on precision parameter estimates, introduced by nonlinear projection effects.

79 ASTRONOMY AND ASTROPHYSICS↗

Fiber optic computing using distributed feedback

Abstract The widespread adoption of machine learning and other matrix intensive computing algorithms has renewed interest in analog optical computing, which has the potential to perform large-scale matrix multiplications with superior energy scaling and lower latency than digital electronics. However, most optical techniques rely on spatial multiplexing, requiring a large number of modulators and detectors, and are typically restricted to performing a single kernel convolution operation per layer. Here, we introduce a fiber-optic computing architecture based on temporal multiplexing and distributed feedback that performs multiple convolutions on the input data in a single layer. Using Rayleigh backscattering in standard single mode fiber, we show that this technique can efficiently apply a series of random nonlinear projections to the input data, facilitating a variety of computing tasks. The approach enables efficient energy scaling with orders of magnitude lower power consumption than GPUs, while maintaining low latency and high data-throughput.

97 MATHEMATICS AND COMPUTING↗

Collaborative Research: Polymer Macrocycles: A novel topology to control dynamics of rubbery materials

Understanding the dynamics of polymers of different topologies is an important field of study and one of the most important unanswered questions in this field is "how do circular polymers move," particularly in the melt state. New information suggests that molecular topology, specifically circular rings, impacts the response of materials in nanometer- scale confinement. The work performed here tackles these subjects through a collaboration in which specialists in polymer synthesis, polymer rheology and scattering methods, and in the physics of nanoconfinement work together to investigate the thermophysical behavior of circular macromolecules. The project goals are to use a novel synthesis method of "green" oxidative polymerization to produce high purity macrocycles and to investigate their linear viscoelastic behavior in order to fully characterize the dynamics of circular macromolecules to sizes that correspond to linear molecule entanglement densities higher than previously obtainable with synthetic polymers. Chemical chain end characterization and critical edge fractionation coupled with direct visualization of the prepared polymers through the use of polymer amplification methods are proposed in order to quantify the numbers of circular and linear molecules in each sample. The study of the linear viscoelastic response of blends of linear and circular molecules is also to be undertaken in the project. Nonlinear viscoelastic measurements, including extensional viscosity, are to be made. Strong differences in behavior between linear chains and circular ones also provides an important opportunity for new technology to break the "magic triangle" for tires: it is believed that improving one of the three key attributes - traction, wear, rolling resistance - necessarily sacrifices at least one of the others. Rubber made from cyclic polymers has the potential to break out of this triangle by reducing the so-called Payne effect in reinforced rubbers because circular macromolecules are less sensitive to nanoconfinement than their linear counterparts. The work has as one objective to characterize the impact of nanoconfinement on the behavior of large circular macromolecules. In addition, the dynamics of carbon black filled circular macromolecules are to be studied to test the hypothesis that the resulting rubbery materials will exhibit a reduced Payne effect.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Hyperchaotic Analysis and Adaptive Projective Synchronization of Nonlinear Dynamical System

In this paper, a new nonlinear dynamical system has been studied which is obtained from the 3D chaotic system. The hyperchaotic analysis of the new system is checked in terms of dissipation, equilibrium points and their stability, Lyapunov exponent, time series, phase portraits, Poincaré section and bifurcation diagram. Furthermore, the adaptive projective synchronization technique is used to synchronize the novel hyperchaotic system. A brief theoretical analysis and simulation results are presented to prove the behavior of the novel hyperchaotic system.

97 MATHEMATICS AND COMPUTING↗