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 181 records · Page 10

Modeling the AC Power Flow Equations with Optimally Compact Neural Networks: Application to Unit Commitment

Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using neural networks. These neural networks can be exactly transformed into mixed integer linear programs and embedded inside challenging optimization problems, thus replacing nonlinearities that are intractable for many applications with tractable piecewise linear approximations. Such approaches, though, suffer from an explosion of the number of binary variables needed to represent the neural network. Accordingly, this paper develops a technique for training an "optimally compact'' neural network, i.e., one that can represent the power flow equations with a sufficiently high degree of accuracy while still maintaining a tractable number of binary variables. We demonstrate the use of this neural network as an approximator of the nonlinear power flow equations by embedding it in the AC unit commitment problem, transforming the problem from a mixed integer nonlinear program into a more manageable mixed integer linear program. We use the 14-, 57-, and 89-bus networks as test cases and compare the AC-feasibility of commitment decisions resulting from the neural network, DC, and linearized power flow approximations. Our results show that the neural network model outperforms both the DC and linearized power flow approximations when embedded in the unit commitment problem. The neural network formulation most often selects a feasible unit commitment schedule, and furthermore, it only s

AC power flow↗

Optimum receiver structures for phase-multiplexed modulations

A MAP (maximum a posteriori) estimation loop is derived for a QPSK signal and, by suitable approximation to the nonlinearity which arises as a consequence of the MAP theory, is reconfigured with practical realizations that are valid for high and low SNRs. In particular, it is shown that by approximating the hyperbolic tangent nonlinearity in the MAP estimation loop by the first two terms in its power series, an interesting practical realization of this loop results which applies at low SNRs. The error signal in this loop is formed by multiplying the error signal and lock detector output signal of a conventional biphase Costas loop. A generalized linear in-phase channel configuration is proposed which allows carrier reconstruction from an unbalanced QPSK signal at all ratios of data rates and powers in the two channels, even in the limit as these ratios simultaneously approach unity, i.e., balanced quadriphase.

Simon, M. K.↗

Nonlinear propagating modes beyond the phonons in fluorite-structured crystals

The vibrational energy of crystals is known to propagate in a fixed number of phonon branches allowed by symmetry. In the realm of nonlinear dynamics, however, additional nonlinear propagating modes are possible. Nonlinear propagating modes have unique properties that are important in many disciplines including optical communications, conducting polymers, biology, magnetism, and nuclear physics. Yet, despite the crucial importance of crystal lattice vibrations in fundamental and applied science, such additional propagating modes have not been observed in ordinary crystals. Here, we show that propagating modes exist beyond the phonons in fluorite-structured thoria, urania, and natural calcium fluoride using neutron scattering and first-principles calculations. These modes are observed at temperatures ranging from 5 K up to 1200 K, extend to frequencies 30–40% higher than the maximum phonon frequency, and travel at velocities comparable to or higher than the fastest phonon. The nonlinear origin of the modes is explained in part via perturbation theory, which approximately accounts for nonlinearity. Given that these modes are still clearly observed at 5 K, they are likely an inherent feature of the quantum ground state. The existence of these waves in three-dimensional crystals may have ramifications for material properties.

36 MATERIALS SCIENCE↗

Deep Learning Explicit Differentiable Predictive Control Laws for Buildings

We present a differentiable predictive control (DPC) methodology for learning constrained control laws for unknown nonlinear systems. DPC poses an approximate solution to multiparametric programming problems emerging from explicit nonlinear model predictive control (MPC). Contrary to approximate MPC, DPC does not require supervision by an expert controller. Instead, a system dynamics model is learned from a small dataset of recorded observations of the perturbed system's dynamics and the control law is optimized offline by interaction with the learned system model. The DPC method is based on two sequential steps, i) system identification using a constrained neural state-space model, and ii) optimization of an explicit control law parametrized by another neural network in closed-loop simulation with the identified neural state-space model. The combination of a differentiable closed-loop system and penalty methods for constraint handling of system outputs and inputs allows us to optimize the control law's parameters directly by backpropagating economic MPC loss through the learned system model. By incorporating domain knowledge and leveraging established techniques from optimal control, our method leverages deep neural networks as nonlinear function approximators for system identification and control while avoiding concomitant costs of intractably large datasets, and computationally expensive over-parametrized models. The scalability, data efficiency, and constrained optimal control capability of the proposed DPC method are demonstrated in simulation using a multi-zone building emulator.

Drgona, Jan↗

Solution of complex nonlinear problems by a generalized application of the method of base and comparison solutions with applications to aerodynamics problems

A theory for obtaining approximate solutions to nonlinear problems whose exact solutions require the use of large computational procedures is described. The technique represents in some respects a generalization of the method of base and comparison solutions for flows depending on a parameter. For the generalized problem, the input variable is no longer a parameter but a function that is incremented over its entire domain. After performing calculations for a base configuration and a small number of variations of it, solutions for a large class of configurations can be obtained by forming linear combinations of the solution increments. For a restricted class of problems, approximate solutions can be obtained for general variations of a base configuration by using a function-space derivative estimate obtained from a base solution and a single variation.

Barger, R. L.↗

First‐Order Empirical Interpolation Method for Real‐Time Solution of Parametric Time‐Dependent Nonlinear PDEs

ABSTRACT We present a model reduction approach for the real‐time solution of time‐dependent nonlinear partial differential equations (PDEs) with parametric dependencies. A major challenge in constructing efficient and accurate reduced‐order models for nonlinear PDEs is the efficient treatment of nonlinear terms. We address this by unifying the implementation of hyperreduction methods to deal with nonlinear terms. Furthermore, we introduce a first‐order empirical interpolation method (EIM) to provide an efficient approximation of the nonlinear terms in time‐dependent PDEs. We demonstrate the effectiveness of our approach on the Allen–Cahn equation, which models phase separation, and the Buckley–Leverett equation, which describes two‐phase fluid flow in porous media. Numerical results highlight the accuracy, efficiency, and stability of the proposed method compared with both the Galerkin–Newton approach and hyper‐reduced models using the standard EIM.

Nguyen, Ngoc Cuong [Center for Computational Engin↗

The determination of orbits using Picard iteration

The determination of orbits by using Picard iteration is reported. This is a direct extension of the classical method of Picard that has been used in finding approximate solutions of nonlinear differential equations for a variety of problems. The application of the Picard method of successive approximations to the initial value and the two point boundary value problems is given.

Mikkilineni, R. P.↗

The large-time behavior of the scalar, genuinely nonlinear Lax-Friedrichs scheme

The Lax-Friedrichs scheme, approximating the scalar, genuinely nonlinear conservation law u sub t + f sub x (u) = 0 where f(u) is, say, strictly convex double dot f dot a sub asterisk 0 is studied. The divided differences of the numerical solution at time t do not exceed 2 (t dot a sub asterisk) to the -1. This one-sided Lipschitz boundedness is in complete agreement with the corresponding estimate one has in the differential case; in particular, it is independent of the initial amplitude in sharp contrast to liner problems. It guarantees the entropy compactness of the scheme in this case, as well as providing a quantitive insight into the large-time behavior of the numerical computation.

Tadmor, E.↗

The large-time behavior of the scalar, genuinely nonlinear Lax-Friedrichs scheme

The Lax-Friedrichs scheme, approximating the scalar, genuinely nonlinear conservation law u sub t + f sub x (u) = O where f(u) is, say, strictly double dot f dot a sub asterisk O is studied. The divided differences of the numerical solution at time t do not exceed 2 (t dot a sub asterisk) to the -1. This one-sided Lipschitz boundedness is in complete agreement with the corresponding estimate one has in the differential case; in particular, it is independent of the initial amplitude in sharp contrast to linear problems. It guarantees the entropy compactness of the scheme in this case, as well as providing a quantitative insight into the large-time behavior of the numerical computation.

Tadmor, E.↗

Optimizing the Zeldovich approximation

We have recently learned that the Zeldovich approximation can be successfully used for a far wider range of gravitational instability scenarios than formerly proposed; we study here how to extend this range. In previous work (Coles, Melott and Shandarin 1993, hereafter CMS) we studied the accuracy of several analytic approximations to gravitational clustering in the mildly nonlinear regime. We found that what we called the 'truncated Zeldovich approximation' (TZA) was better than any other (except in one case the ordinary Zeldovich approximation) over a wide range from linear to mildly nonlinear (sigma approximately 3) regimes. TZA was specified by setting Fourier amplitudes equal to zero for all wavenumbers greater than k(sub nl), where k(sub nl) marks the transition to the nonlinear regime. Here, we study the cross correlation of generalized TZA with a group of n-body simulations for three shapes of window function: sharp k-truncation (as in CMS), a tophat in coordinate space, or a Gaussian. We also study the variation in the crosscorrelation as a function of initial truncation scale within each type. We find that k-truncation, which was so much better than other things tried in CMS, is the worst of these three window shapes. We find that a Gaussian window e(exp(-k(exp 2)/2k(exp 2, sub G))) applied to the initial Fourier amplitudes is the best choice. It produces a greatly improved crosscorrelation in those cases which most needed improvement, e.g. those with more small-scale power in the initial conditions. The optimum choice of kG for the Gaussian window is (a somewhat spectrum-dependent) 1 to 1.5 times k(sub nl). Although all three windows produce similar power spectra and density distribution functions after application of the Zeldovich approximation, the agreement of the phases of the Fourier components with the n-body simulation is better for the Gaussian window. We therefore ascribe the success of the best-choice Gaussian window to its superior treatment of phases in the nonlinear regime. We also report on the accuracy of particle positions and velocities produced by TZA.

Melott, Adrian L.↗

On the Use of the Harmonic Linearizaiton Method in the Automatic Control Theory

The method of harmonic linearization (harmonic balance), first proposed by N. M. Krylov and N. N. Bogolyubov for the approximate investigation of nonlinear vibrations, has been developed and received wide practical application to problems in the theory of automatic control. Recently, some doubt has been expressed on the legitimacy of application of the method to these problems, and assertions were made on the absence in them of a small parameter of any kind. Nevertheless, the method gives practical, acceptable results and is a simple and powerful means in engineering computations. Hence, the importance of questions arises as to its justification. The underlying principle of the method is the replacement of the given nonlinear equation by a linear equation. In establishing the method, a small parameter is considered whose presence makes it possible to speak, with some degree of approximation, of the solution of this new equation to the solution of the given nonlinear equation. In an article by the author, certain considerations were given on the presence of the small parameter, but this question has not as yet received a final answer. In the present report, a somewhat different approach to the problem is applied that permits: (a) establishing, in the clearest manner, the form of the presence of the small parameter in nonlinear problems of control theory, solvable by the method of harmonic linearization; (b) connecting it with previous intuitive physical concepts (with the "filter property") and extending the class of problems possessing this property; and (c) discussing various generalizations of the method.

Popov, E. P.↗

A test of the adhesion approximation for gravitational clustering

We quantitatively compare a particle implementation of the adhesion approximation to fully nonlinear, numerical 'N-body' simulations. Our primary tool, cross-correlation of N-body simulations with the adhesion approximation, indicates good agreement, better than that found by the same test performed with the Zel'dovich approximation (hereafter ZA). However, the cross-correlation is not as good as that of the truncated Zel'dovich approximation (TZA), obtained by applying the Zel'dovich approximation after smoothing the initial density field with a Gaussian filter. We confirm that the adhesion approximation produces an excessively filamentary distribution. Relative to the N-body results, we also find that: (a) the power spectrum obtained from the adhesion approximation is more accurate that that from ZA to TZA, (b) the error in the phase angle of Fourier components is worse that that from TZA, and (c) the mass distribution function is more accurate than that from ZA or TZA. It appears that adhesion performs well statistically, but that TZA is more accurate dynamically, in the sense of moving mass to the right place.

Melott, Adrian L.↗

Discrete approximations to optimal trajectories using direct transcription and nonlinear programming

A recently developed method for solving optimal trajectory problems uses a piecewise-polynomial representation of the state and control variables, enforces the equations of motion via a collocation procedure, and thus approximates the original calculus-of-variations problem with a nonlinear-programming problem, which is solved numerically. This paper identifies this method as a direct transcription method and proceeds to investigate the relationship between the original optimal-control problem and the nonlinear-programming problem. The discretized adjoint equation of the collocation method is found to have deficient accuracy, and an alternate scheme which discretizes the equations of motion using an explicit Runge-Kutta parallel-shooting approach is developed. Both methods are applied to finite-thrust spacecraft trajectory problems, including a low-thrust escape spiral, a three-burn rendezvous, and a low-thrust transfer to the moon.

Enright, Paul J.↗