Search NASA⌕ Search

SEARCH · Search NASA

Results for “Nonlinear reduction”

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 109 records · Page 6

On making large nonlinear problems small

Reduction methods for solving large-scale nonlinear problems are considered. Attention is given to: (1) the selection of basis vectors for steady-state problems; (2) the identification and determination of bifurcation and limit points, including tracing post-limit-point and post-bifurcation-point paths using reduction methods; (3) the application of reduction methods to nonlinear problems with prescribed nonzero values of the fundamental unknowns; and (4) the use of reduction methods in conjunction with multifield (mixed) finite element models. The effectiveness of using reduction methods is demonstrated on the basis of several numerical examples including two-dimensional steady conduction in a square plate with temperature dependent thermal conductivity and a shallow spherical cap subjected to a central-point load and a ring load.

Noor, A. K.↗

Multigrid Reduction in Time for Nonlinear Parabolic Problems: A Case Study

The need for parallelism in the time dimension is being driven by changes in computer architectures, where performance increases are now provided through greater concurrency, not faster clock speeds. This creates a bottleneck for sequential time marching schemes because they lack parallelism in the time dimension. Multigrid reduction in time (MGRIT) is an iterative procedure that allows for temporal parallelism by utilizing multigrid reduction techniques and a multilevel hierarchy of coarse time grids. MGRIT has been shown to be effective for linear problems, with speedups of up to 50 times. The goal of this work is the efficient solution of nonlinear problems with MGRIT, where efficiency is defined as achieving similar performance when compared to an equivalent linear problem. The benchmark nonlinear problem is the p-Laplacian, where p=4 corresponds to a well-known nonlinear diffusion equation and p=2 corresponds to the standard linear diffusion operator, our benchmark linear problem. The key difficulty encountered is that the nonlinear time-step solver becomes progressively more expensive on coarser time levels as the time-step size increases. To overcome such difficulties, multigrid research has historically targeted an accumulated body of experience regarding how to choose an appropriate solver for a specific problem type. To that end, this paper develops a library of MGRIT optimizations and modifications, most important an alternate initial guess for the nonlinear time-step solver and delayed spatial coarsening, that will allow many nonlinear parabolic problems to be solved with parallel scaling behavior comparable to the corresponding linear problem.

parareal↗

Interpretation of autoencoder-learned collective variables using Morse–Smale complex and sublevelset persistent homology: An application on molecular trajectories

Dimensionality reduction often serves as the first step toward a minimalist understanding of physical systems as well as the accelerated simulations of them. In particular, neural network-based nonlinear dimensionality reduction methods, such as autoencoders, have shown promising outcomes in uncovering collective variables (CVs). However, the physical meaning of these CVs remains largely elusive. In this work, we constructed a framework that (1) determines the optimal number of CVs needed to capture the essential molecular motions using an ensemble of hierarchical autoencoders and (2) provides topology-based interpretations to the autoencoder-learned CVs with Morse–Smale complex and sublevelset persistent homology. Furthermore, this approach was exemplified using a series of n-alkanes and can be regarded as a general, explainable nonlinear dimensionality reduction method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multigrid Reduction in Time for Nonlinear Parabolic Problems

The need for parallel-in-time is being driven by changes in computer architectures, where future speed-ups will be available through greater concurrency, but not faster clock speeds, which are stagnant.This leads to a bottleneck for sequential time marching schemes, because they lack parallelism in the time dimension. Multigrid Reduction in Time (MGRIT) is an iterative procedure that allows for temporal parallelism by utilizing multigrid reduction techniques and a multilevel hierarchy of coarse time grids. MGRIT has been shown to be effective for linear problems, with speedups of up to 50 times. The goal of this work is the efficient solution of nonlinear problems with MGRIT, where efficient is defined as achieving similar performance when compared to a corresponding linear problem. As our benchmark, we use the p-Laplacian, where p = 4 corresponds to a well-known nonlinear diffusion equation and p = 2 corresponds to our benchmark linear diffusion problem. When considering linear problems and implicit methods, the use of optimal spatial solvers such as spatial multigrid imply that the cost of one time step evaluation is fixed across temporal levels, which have a large variation in time step sizes. This is not the case for nonlinear problems, where the work required increases dramatically on coarser time grids, where relatively large time steps lead to worse conditioned nonlinear solves and increased nonlinear iteration counts per time step evaluation. This is the key difficulty explored by this paper. We show that by using a variety of strategies, most importantly, spatial coarsening and an alternate initial guess to the nonlinear time-step solver, we can reduce the work per time step evaluation over all temporal levels to a range similar with the corresponding linear problem. This allows for parallel scaling behavior comparable to the corresponding linear problem.

97 MATHEMATICS AND COMPUTING↗

Experimental validation of Order (n) DISCOS

An order (n) algorithm is developed for use in the industry-standard DISCOS (Dynamics Interaction Simulation of Controls and Structures) program for flexible multibody system dynamics simulation. This version should be more computationally efficient than conventional DISCOS for problems where a large number of bodies are involved. Program-dependent changes to DISCOS are described for reducing the number of bodies required to model gear reduction and nonlinear stiffness as internal effects. The gear reduction modification can be extended to general applications, such as gear box, rack and pinion, lever joint, and screw rotation models. Upgrading DISCOS for future use include the addition of robotics capabilities such as event-driven topology changes, surface sliding, pick-and-place, and multiarm hand-off.

Chun, Hon M.↗

Grassmannian Diffusion Maps--Based Dimension Reduction and Classification for High-Dimensional Data

This work introduces the Grassmannian diffusion maps (GDMaps), a novel nonlinear dimensionality reduction technique that defines the affinity between points through their representation as low-dimensional subspaces corresponding to points on the Grassmann manifold. Here, the method is designed for applications, such as image recognition and data-based classification of constrained high-dimensional data where each data point itself is a high-dimensional object (i.e., a large matrix) that can be compactly represented in a lower-dimensional subspace. The GDMaps is composed of two stages. The first is a pointwise linear dimensionality reduction wherein each high-dimensional object is mapped onto the Grassmann manifold representing the low-dimensional subspace on which it resides. The second stage is a multipoint nonlinear kernel-based dimension reduction using diffusion maps to identify the subspace structure of the points on the Grassmann manifold. To this end, an appropriate Grassmannian kernel is used to construct the transition matrix of a random walk on a graph connecting points on the Grassmann manifold. Spectral analysis of the transition matrix yields low-dimensional Grassmannian diffusion coordinates embedding the data into a low-dimensional reproducing kernel Hilbert space. Further, a novel data classification/recognition technique is developed based on the construction of an overcomplete dictionary of reduced dimension whose atoms are given by the Grassmannian diffusion coordinates. Three examples are considered. First, a "toy" example shows that the GDMaps can identify an appropriate parametrization of structured points on the unit sphere. The second example demonstrates the ability of the GDMaps to revealing the intrinsic subspace structure of high-dimensional random field data. In the last ex- ample, a face recognition problem is solved considering face images subject to varying illumination conditions, changes in face expressions, and occurrence of occlusions. The technique presented high recognition rates (i.e., 95% in the best case) using a fraction of the data required by conventional methods.

42 ENGINEERING↗

Modal Substructuring of Geometrically Nonlinear Finite Element Models with Interface Reduction

Substructuring methods have been widely used in structural dynamics to divide large, complicated finite element models into smaller substructures. For linear systems, many methods have been developed to reduce the subcomponents down to a low order set of equations using a special set of component modes, and these are then assembled to approximate the dynamics of a large scale model. In this paper, a substructuring approach is developed for coupling geometrically nonlinear structures, where each subcomponent is drastically reduced to a low order set of nonlinear equations using a truncated set of fixedinterface and characteristic constraint modes. The method used to extract the coefficients of the nonlinear reduced order model (NLROM) is non-intrusive in that it does not require any modification to the commercial FEA code, but computes the NLROM from the results of several nonlinear static analyses. The NLROMs are then assembled to approximate the nonlinear differential equations of the global assembly. The method is demonstrated on the coupling of two geometrically nonlinear plates with simple supports at all edges. The plates are joined at a continuous interface through the rotational degrees-of-freedom (DOF), and the nonlinear normal modes (NNMs) of the assembled equations are computed to validate the models. The proposed substructuring approach reduces a 12,861 DOF nonlinear finite element model down to only 23 DOF, while still accurately reproducing the first three NNMs of the full order model.

42 ENGINEERING↗

Efficient control of ultrafast optical nonlinearity of reduced graphene oxide by infrared reduction

Simultaneous occurrence of saturable absorption nonlinearity and two-photon absorption nonlinearity in the same medium is well sought for the devices like optical limiter and laser mode-locker. Pristine graphene sheet consisting entirely of sp{sup 2}-hybridized carbon atoms has already been identified having large optical nonlinearity. However, graphene oxide (GO), a precursor of graphene having both sp{sup 2} and sp{sup 3}-hybridized carbon atom, is increasingly attracting cross-discipline researchers for its controllable properties by reduction of oxygen containing groups. In this work, GO has been prepared by modified Hummers method, and it has been further reduced by infrared (IR) radiation. Characterization of reduced graphene oxide (RGO) by means of Raman spectroscopy, X-ray photoelectron spectroscopy, and UV-Visible absorption measurements confirms an efficient reduction with infrared radiation. Here, we report precise control of non-linear optical properties of RGO in femtosecond regime with increased degrees of IR reduction measured by open aperture z-scan technique. Depending on the intensity, both saturable absorption and two-photon absorption effects are found to contribute to the non-linearity of all the samples. Saturation dominates at low intensity (∼127 GW/cm{sup 2}) while two-photon absorption becomes prominent at higher intensities (from 217 GW/cm{sup 2} to 302 GW/cm{sup 2}). The values of two-photon absorption co-efficient (∼0.0022–0.0037 cm/GW for GO, and ∼0.0128–0.0143 cm/GW for RGO) and the saturation intensity (∼57 GW/cm{sup 2} for GO, and ∼194 GW/cm{sup 2} for RGO) increase with increasing reduction, indicating GO and RGO as novel tunable photonic devices. We have also explained the reason of tunable nonlinear optical properties by using amorphous carbon model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Drag reduction in channel flow using nonlinear control

Two nonlinear control schemes have been applied to the problem of drag reduction in channel flow. Both schemes have been tested using numerical simulations at a mass flux Reynolds numbers of 4408, utilizing 2D nonlinear neutral modes for goal dynamics. The OGY-method, which requires feedback, reduces drag to 60-80 percent of the turbulent value at the same Reynolds number, and employs forcing only within a thin region near the wall. The H-method, or model-based control, fails to achieve any drag reduction when starting from a fully turbulent initial condition, but shows potential for suppressing or retarding laminar-to-turbulent transition by imposing instead a transition to a low drag, nonlinear traveling wave solution to the Navier-Stokes equation. The drag in this state corresponds to that achieved by the OGY-method. Model-based control requires no feedback, but in experiments to date has required the forcing be imposed within a thicker layer than the OGY-method. Control energy expenditures in both methods are small, representing less than 0.1 percent of the uncontrolled flow's energy.

Keefe, Laurence R.↗

Model Reduction for Compressible Cavity Simulations Towards Uncertainty Quantification of Structural Loading

This report summarizes FY16 progress towards enabling uncertainty quantification for compressible cavity simulations using model order reduction (MOR). The targeted application is the quantification of the captive-carry environment for the design and qualification of nuclear weapons systems. To accurately simulate this scenario, Large Eddy Simulations (LES) require very fine meshes and long run times, which lead to week-long runs even on parallel state-of-the-art super- computers. MOR can reduce substantially the CPU-time requirement for these simulations. We describe two approaches for model order reduction for nonlinear systems, which can yield significant speed-ups when combined with hyper-reduction: the Proper Orthogonal Decomposition (POD)/Galerkin approach and the POD/Least-Squares Petrov Galerkin (LSPG) approach. The implementation of these methods within the in-house compressible flow solver SPARC is discussed. Next, a method for stabilizing and enhancing low-dimensional reduced bases that was developed as a part of this project is detailed. This approach is based on a premise termed "minimal subspace rotation", and has the advantage of yielding ROMs that are more stable and accurate for long-time compressible cavity simulations. Numerical results for some laminar cavity problems aimed at gauging the viability of the proposed model reduction methodologies are presented and discussed.

42 ENGINEERING↗

Nonlinear vs. linear biasing in Trp-cage folding simulations

Biased simulations have great potential for the study of slow processes, including protein folding. Atomic motions in molecules are nonlinear, which suggests that simulations with enhanced sampling of collective motions traced by nonlinear dimensionality reduction methods may perform better than linear ones. In this study, we compare an unbiased folding simulation of the Trp-cage miniprotein with metadynamics simulations using both linear (principle component analysis) and nonlinear (Isomap) low dimensional embeddings as collective variables. Folding of the mini-protein was successfully simulated in 200 ns simulation with linear biasing and non-linear motion biasing. The folded state was correctly predicted as the free energy minimum in both simulations. We found that the advantage of linear motion biasing is that it can sample a larger conformational space, whereas the advantage of nonlinear motion biasing lies in slightly better resolution of the resulting free energy surface. In terms of sampling efficiency, both methods are comparable.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SNS: A Solution-Based Nonlinear Subspace Method for Time-Dependent Model Order Reduction

Several reduced order models have been successfully developed for nonlinear dynamical systems. To achieve a considerable speed-up, a hyper-reduction step is needed to reduce the computational complexity due to nonlinear terms. Many hyper-reduction techniques require the construction of nonlinear term basis, which introduces a computationally expensive offline phase. A novel way of constructing nonlinear term basis within the hyper-reduction process is introduced. In contrast to the traditional hyper-reduction techniques where the collection of nonlinear term snapshots is required, the SNS method avoids collecting the nonlinear term snapshots. Instead, it uses the solution snapshots that are used for building a solution basis, which enables avoiding an extra data compression of nonlinear term snapshots. As a result, the SNS method provides a more efficient offline strategy than the traditional model order reduction techniques, such as the DEIM, GNAT, and ST-GNAT methods. The SNS method is theoretically justified by the conforming subspace condition and the subspace inclusion relation. It is useful for model order reduction of large-scale nonlinear dynamical problems to reduce the offline cost. It is especially useful for ST-GNAT that has shown promising results, such as a good accuracy with a considerable online speed-up for hyperbolic problems in a recent paper by Choi and Carlberg [SIAM J. Sci. Comput., 41 (2019), pp. A26--A58], because ST-GNAT involves an expensive offline cost related to collecting nonlinear term snapshots. Error analysis for the SNS method is presented. Numerical results support that the accuracy of the solution from the SNS method is comparable to the traditional methods and a considerable speed-up (i.e., a factor of two to a hundred) is achieved in the offline phase.

97 MATHEMATICS AND COMPUTING↗

Koopman-Based Approach to Nonintrusive Reduced Order Modeling: Application to Aerodynamic Shape Optimization and Uncertainty Propagation

A methodology for nonintrusive projection-based nonlinear model reduction originally presented by Renganathan et al. is further extended here toward parametric systems with a focus on application to aerospace design. Specifically, the method is extended to address static systems with parametric geometry (that deforms the mesh) in addition to parametric freestream boundary conditions. The main idea is to first perform a transformation on the governing equations such that it is lifted to a higher-dimensional but linear underdetermined system. This enables one to extract the system matrices easily as compared to that of the original nonlinear system. The underdetermined system is closed with a set of model-dependent nonlinear constraints upon which the model reduction is finally performed. The methodology is validated on the subsonic and transonic inviscid flows past the NACA0012 and the RAE2822 airfoils with parametrized shapes. The utility of the approach is further demonstrated by applying it to two common problems in aerospace design, namely, derivative-free global optimization and parametric uncertainty quantification with Monte Carlo sampling. Overall, the methodology is shown to achieve accuracy up to 5% and computational speedup of two to three orders of magnitude relative to the full order model. Comparison against another nonintrusive model reduction method revealed that the proposed approach is more robust, accurate, and retains the consistency between the state variables.

97 MATHEMATICS AND COMPUTING↗