Search NASA⌕ Search

SEARCH · Search NASA

Results for “Nonlinear approximation”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Development of a Control Co-Design Modeling Tool for Marine Hydrokinetic Turbines: Preprint

This report describes the ongoing and planned development of the software package CT-Opt (Current/Tidal Optimization), a control co-design modeling tool for marine hydrokinetic turbines. The commercialization of these turbines has faced significant challenges due to the complex, multidisciplinary nature of their design and the extreme environmental conditions of their operation. This project aims to create a modeling tool that will enable the efficient design of robust, cost-competitive hydrokinetic turbine systems. Rather than using traditional optimization methods, CT-Opt combines multiple models across a range of fidelities to enable coupled optimization of the system design and system controller via a control co-design approach. With this method, the parameters that affect system performance are considered more comprehensively at every stage of the design process. The lowest-fidelity, frequency-domain model called by CT-Opt is RAFT (Response Amplitudes of Floating Turbines), which was originally developed by the National Renewable Energy Laboratory (NREL) to model response amplitudes of floating offshore wind turbines. The highest-fidelity, time-domain model is OpenFAST, which was developed by NREL for land-based and offshore wind turbines. As part of the CT-Opt project, new functionalities will be added to RAFT and OpenFAST to enable the accurate simulation of fixed and floating marine hydrokinetic turbines. In addition to expanding the capabilities of RAFT and OpenFAST, new midfidelity models will be developed. These models will be based on RAFT and OpenFAST and will consist of linearized, state-space models derived from the fully coupled, nonlinear OpenFAST equations and derivative function surrogate models that approximate the nonlinear system behavior. Each model will be coupled with controllers to allow control co-design methods to be applied both within models and across fidelity levels, enabling efficient system optimization.

control co-design↗
NASA NTRS1970

Nonlinear controllability via Lie theory

Complete system associated with given control, discussing trajectories uniform approximation and nonlinear controllability conditions based on linear partial differential equation

Haynes, G. W.↗
NASA NTRS1988

Galerkin approximation for inverse problems for nonautonomous nonlinear distributed systems

An abstract framework and convergence theory is developed for Galerkin approximation for inverse problems involving the identification of nonautonomous nonlinear distributed parameter systems. A set of relatively easily verified conditions is provided which are sufficient to guarantee the existence of optimal solutions and their approximation by a sequence of solutions to a sequence of approximating finite dimensional identification problems. The approach is based on the theory of monotone operators in Banach spaces and is applicable to a reasonably broad class of nonlinear distributed systems. Operator theoretic and variational techniques are used to establish a fundamental convergence result. An example involving evolution systems with dynamics described by nonstationary quasilinear elliptic operators along with some applications are presented and discussed.

Banks, H. T.↗
NASA NTRS1975

Nonlinear acoustic behavior at a caustic - An approximate analytical solution

The present paper discusses an approximate analytical solution to the nonlinear behavior of a discontinuous acoustic signal near a caustic. The Seebass transformation (1970) is refined to provide results which satisfy the governing equation to any prescribed accuracy, except across the shock wave produced by reflection of the simple wave at the caustic. The solution is approximate in the sense that the basic equation is satisfied wherever the solution is continuous but can satisfy only one of the two jump conditions at the reflected shock. The results give essential geometric features of the exact solution and provide a quantitative estimate of the strength of the so-called superboom.

Gill, P. M.↗
NASA NTRS1983

Development of a multiple-parameter nonlinear perturbation procedure for transonic turbomachinery flows: Preliminary application to design/optimization problems

An investigation was conducted to continue the development of perturbation procedures and associated computational codes for rapidly determining approximations to nonlinear flow solutions, with the purpose of establishing a method for minimizing computational requirements associated with parametric design studies of transonic flows in turbomachines. The results reported here concern the extension of the previously developed successful method for single parameter perturbations to simultaneous multiple-parameter perturbations, and the preliminary application of the multiple-parameter procedure in combination with an optimization method to blade design/optimization problem. In order to provide as severe a test as possible of the method, attention is focused in particular on transonic flows which are highly supercritical. Flows past both isolated blades and compressor cascades, involving simultaneous changes in both flow and geometric parameters, are considered. Comparisons with the corresponding exact nonlinear solutions display remarkable accuracy and range of validity, in direct correspondence with previous results for single-parameter perturbations.

Stahara, S. S.↗
DOE OSTI2021

Drift waves enstrophy, zonal flow, and nonlinear evolution of the modulational instability

The interaction of the drift wave (DW) turbulence and zonal flow (ZF) is investigated with the modified Hasegawa–Mima equation taking into account the backreaction of ZF velocity on DW turbulence. It is shown that the y-averaged enstrophy of DW turbulence and the velocity of ZF are intrinsically related. By utilizing this feature, a nonlinear stage of DW modulational instability is considered within the framework of the wave kinetic equation. It is shown that in this approximation, the nonlinear stage of the modulational instability results in the collapsing solutions, accompanied by the “wave breaking” phenomenon. Numerical simulations based on the Hasegawa–Mima equation show that for a weak DW turbulence, Φ ̃ = ( e φ ̃ / T e ) ( L n / ρ s ) ⪝ 1 , the collapsing-like features on both ZF and y-averaged enstrophy of DW turbulence decay in time and then re-emerge again at different locations. For the case of a strong DW turbulence, Φ ̃ > 1 , where nonlinear interactions of DW harmonics dominate, stable spatial structures of ZF and y-averaged enstrophy of DW turbulence emerge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1993

Improving the reconstruction of the velocity potential and primordial density fluctuations by choice of smoothing windows

Recently considerable attention has been focused on improving algorithms for restoring primordial density fluctuations in the universe or investigating large-scale velocity fields by going to higher order approximations relating nonlinear states to their initial conditions. An alternative approach is to investigate the use of alternative smoothing windows within the context of first-order approximations. I present evidence that the universally used Gaussian smoothing window is far from optimal. A sharp truncation P(k) = 0 for k greater than k(c) leads to a much more direct connection to initial conditions for either 'Gaussianization' methods or use of the Zel'dovich approximation, as discussed in the text.

Melott, Adrian L.↗
DOE OSTI2024

Multilevel well modeling in aggregation-based nonlinear multigrid for multiphase flow in porous media

A full approximation scheme (FAS) nonlinear multigrid solver for two-phase flow and transport problems driven by wells with multiple perforations is developed here. It is an extension to our previous work on FAS solvers for diffusion and transport problems. The solver is applicable to discrete problems defined on unstructured grids as the coarsening algorithm is aggregation-based and algebraic. To construct coarse basis that can better capture the radial flow near wells, coarse grids in which perforated well cells are not near the coarse-element interface are desired. This is achieved by an aggregation algorithm proposed in this paper that makes use of the location of well cells in the cell-connectivity graph. Numerical examples in which the FAS solver is compared against Newton's method on benchmark problems are given. In particular, for a refined version of the SAIGUP model, the FAS solver is at least 35% faster than Newton's method for time steps with a CFL number greater than 10.

58 GEOSCIENCES↗
NASA NTRS1991

Nonlinear modal resonances in low-gravity slosh-spacecraft systems

Nonlinear models of low gravity slosh, when coupled to spacecraft vibrations, predict intense nonlinear eigenfrequency shifts at zero gravity. These nonlinear frequency shifts are due to internal quadratic and cubic resonances between fluid slosh modes and spacecraft vibration modes. Their existence has been verified experimentally, and they cannot be correctly modeled by approximate, uncoupled nonlinear models, such as pendulum mechanical analogs. These predictions mean that linear slosh assumptions for spacecraft vibration models can be invalid, and may lead to degraded control system stability and performance. However, a complete nonlinear modal analysis will predict the correct dynamic behavior. This paper presents the analytical basis for these results, and discusses the effect of internal resonances on the nonlinear coupled response at zero gravity.

Peterson, Lee D.↗
NASA NTRS1992

A conjugate gradients/trust regions algorithms for training multilayer perceptrons for nonlinear mapping

This paper addresses the issue of applying a globally convergent optimization algorithm to the training of multilayer perceptrons, a class of Artificial Neural Networks. The multilayer perceptrons are trained towards the solution of two highly nonlinear problems: (1) signal detection in a multi-user communication network, and (2) solving the inverse kinematics for a robotic manipulator. The research is motivated by the fact that a multilayer perceptron is theoretically capable of approximating any nonlinear function to within a specified accuracy. The algorithm that has been employed in this study combines the merits of two well known optimization algorithms, the Conjugate Gradients and the Trust Regions Algorithms. The performance is compared to a widely used algorithm, the Backpropagation Algorithm, that is basically a gradient-based algorithm, and hence, slow in converging. The performances of the two algorithms are compared with the convergence rate. Furthermore, in the case of the signal detection problem, performances are also benchmarked by the decision boundaries drawn as well as the probability of error obtained in either case.

Madyastha, Raghavendra K.↗
NASA NTRS1986

Do large rate coefficients for ion-polar neutral reactions have a serious effect on chemical models of dense clouds?

In order to incorporate large ion-polar neutral rate coefficients into existing gas phase reaction networks, it is necessary to utilize simplified theoretical treatments because of the significant number of rate coefficients needed. The authors have used two simple theoretical treatments: the locked dipole approach of Moran and Hamill for linear polar neutrals and the trajectory scaling approach of Su and Chesnavich for nonlinear polar neutrals. The former approach is suitable for linear species because in the interstellar medium these are rotationally relaxed to a large extent and the incoming charged reactants can lock their dipoles into the lowest energy configuration. The latter approach is a better approximation for nonlinear neutral species, in which rotational relaxation is normally less severe and the incoming charged reactants are not as effective at locking the dipoles. The treatments are in reasonable agreement with more detailed long range theories and predict an inverse square root dependence on kinetic temperature for the rate coefficient. Compared with the locked dipole method, the trajectory scaling approach results in rate coefficients smaller by a factor of approximately 2.5.

Herbst, E.↗
NASA NTRS1987

Nonlinear programming extensions to rational function approximations of unsteady aerodynamics

This paper deals with approximating unsteady generalized aerodynamic forces in the equations of motion of a flexible aircraft. Two methods of formulating these approximations are extended to include both the same flexibility in constraining them and the same methodology in optimizing nonlinear parameters as another currently used 'extended least-squares' method. Optimal selection of 'nonlinear' parameters is made in each of the three methods by use of the same nonlinear (nongradient) optimizer. The objective of the nonlinear optimization is to obtain rational approximations to the unsteady aerodynamics whose state-space realization is of lower order than that required when no optimization of the nonlinear terms is performed. The free 'linear' parameters are determined using least-squares matrix techniques on a Lagrange multiplier formulation of an objective function which incorporates selected linear equality constraints. State-space mathematical models resulting from the different approaches are described, and results are presented which show comparative evaluations from application of each of the extended methods to a numerical example. The results obtained for the example problem show a significant (up to 63 percent) reduction in the number of differential equations used to represent the unsteady aerodynamic forces in linear time-invariant equations of motion as compared to a conventional method in which nonlinear terms are not optimized.

Tiffany, Sherwood H.↗
DOE OSTI2025

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗
NASA NTRSDate not supplied

Towards Surrogate Modeling of Subgrid Turbulent Transport for 3D Radiative Hydrodynamic Simulations of the Quiet Sun

In this work, we investigate the use of deep learn-ing techniques as surrogate models, to enhance the estimationof effects of subgrid turbulent transport for 3D radiatuve hy-drodynamic simulations of the quiet Sun. We develop two dis-tinct 3D Convolutional Neural Networks (3DCNNs) to capturespatio-temporal dependencies in 3D velocity fields, leveragingdifferent activation functions and architectural designs. Thesemodels integrate both averaged velocity vector components andscalar features such as plasma density to enhance predictionaccuracy. Additionally, a Multilayer Perceptron (MLP) modelis employed to approximate complex nonlinear relationships,offering a comparison in performance between convolutionaland fully connected architectures. Logarithmic transformationis applied to the targets to handle heavily skewed data, im-proving model performance. All models are compared againsta physics-based Gradient Model. Results show that the 3DCNNmodels excel at approximating Reynolds stress tensors, makingthem a candidate for assisting in producing reduced resolutionsimulations, and thereby reducing computational overheadwhile maintaining higher accuracy than the baseline. Thesefindings demonstrate the potential of deep learning, particu-larly CNNs, to advance scalable and accurate simulations ofsolar dynamics, offering a promising alternative to traditionalturbulence models.

Heliophysics↗
DOE OSTI2025

Analytical and EZmock covariance validation for the DESI 2024 results

The estimation of uncertainties in cosmological parameters is an important challenge in Large-Scale-Structure (LSS) analyses. For standard analyses such as Baryon Acoustic Oscillations (BAO) and Full-Shape two approaches are usually considered. First: analytical estimates of the covariance matrix use Gaussian approximations and (nonlinear) clustering measurements to estimate the matrix, which allows a relatively fast and computationally cheap way to generate matrices that adapt to an arbitrary clustering measurement. On the other hand, sample covariances are an empirical estimate of the matrix based on an ensemble of clustering measurements from fast and approximate simulations. While more computationally expensive due to the large amount of simulations and volume required, these allow us to take into account systematics that are impossible to model analytically. In this work we compare these two approaches in order to enable DESI's key analyses. We find that the configuration space analytical estimate performs satisfactorily in BAO analyses and its flexibility in terms of input clustering makes it the fiducial choice for DESI's 2024 BAO analysis. On the contrary, the analytical computation of the covariance matrix in Fourier space does not reproduce the expected measurements in terms of Full-Shape analyses, which motivates the use of a corrected mock covariance for DESI's 2024 Full Shape analysis.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2024

Global Optimization via Quadratic Disjunctive Programming for Water Networks Design with Energy Recovery

Generalized disjunctive programming (GDP) models with bilinear and concave constraints, often seen in water network design, are challenging optimization problems. This work proposes quadratic and piecewise linear approximations for nonlinear terms to reformulate GDP models into quadratic GDP (QGDP) models that suitable solvers may solve more efficiently. We illustrate the benefits of the quadratic reformulation with a water treatment network design problem in which nonconvexities arise from bilinear terms in the mixers’ mass balances and concave investment cost functions of treatment units. Given the similarities with water network design problems, we suggest quadratic approximation for the GDP model for the optimal design of a large-scale reverse electrodialysis (RED) process. This power technology can recover energy from salinity differences between by-product streams of the water sector, such as desalination brine mixed with regenerated wastewater effluents. The solver Gurobi excels in handling QGDP problems, but weighing the problem’s precision and tractability balance is crucial. The piecewise linear approximation yields more accurate, yet larger QGDP models that may require longer optimization times in large-scale process synthesis problems.

Water Networks↗
NASA NTRS1999

Structural Reliability Analysis and Optimization: Use of Approximations

This report is intended for the demonstration of function approximation concepts and their applicability in reliability analysis and design. Particularly, approximations in the calculation of the safety index, failure probability and structural optimization (modification of design variables) are developed. With this scope in mind, extensive details on probability theory are avoided. Definitions relevant to the stated objectives have been taken from standard text books. The idea of function approximations is to minimize the repetitive use of computationally intensive calculations by replacing them with simpler closed-form equations, which could be nonlinear. Typically, the approximations provide good accuracy around the points where they are constructed, and they need to be periodically updated to extend their utility. There are approximations in calculating the failure probability of a limit state function. The first one, which is most commonly discussed, is how the limit state is approximated at the design point. Most of the time this could be a first-order Taylor series expansion, also known as the First Order Reliability Method (FORM), or a second-order Taylor series expansion (paraboloid), also known as the Second Order Reliability Method (SORM). From the computational procedure point of view, this step comes after the design point identification; however, the order of approximation for the probability of failure calculation is discussed first, and it is denoted by either FORM or SORM. The other approximation of interest is how the design point, or the most probable failure point (MPP), is identified. For iteratively finding this point, again the limit state is approximated. The accuracy and efficiency of the approximations make the search process quite practical for analysis intensive approaches such as the finite element methods; therefore, the crux of this research is to develop excellent approximations for MPP identification and also different approximations including the higher-order reliability methods (HORM) for representing the failure surface. This report is divided into several parts to emphasize different segments of the structural reliability analysis and design. Broadly, it consists of mathematical foundations, methods and applications. Chapter I discusses the fundamental definitions of the probability theory, which are mostly available in standard text books. Probability density function descriptions relevant to this work are addressed. In Chapter 2, the concept and utility of function approximation are discussed for a general application in engineering analysis. Various forms of function representations and the latest developments in nonlinear adaptive approximations are presented with comparison studies. Research work accomplished in reliability analysis is presented in Chapter 3. First, the definition of safety index and most probable point of failure are introduced. Efficient ways of computing the safety index with a fewer number of iterations is emphasized. In chapter 4, the probability of failure prediction is presented using first-order, second-order and higher-order methods. System reliability methods are discussed in chapter 5. Chapter 6 presents optimization techniques for the modification and redistribution of structural sizes for improving the structural reliability. The report also contains several appendices on probability parameters.

Grandhi, Ramana V.↗