Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear 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

Weighted least squares stationary approximations to linear systems.

Investigation of the problem of replacing a certain time-varying linear system by a stationary one. Several quadratic criteria are proposed to aid in determining suitable candidate systems. One criterion for choosing the matrix B (in the stationary system) is initial-condition dependent, and another bounds the 'worst case' homogeneous system performance. Both of these criteria produce weighted least square fits.

Bierman, G. J.↗

Time accuracy and the use of implicit methods

Some of the approximations used to make implicit methods more efficient and practical for the solution of the Euler and Navier-Stokes equations are addressed. In particular, approximate factorizations, diagonalizations, and linearization approximations are reviewed and categorized. A subiteration correction scheme commonly in use at present is introduced, improved, demonstrated, and analyzed. This scheme is used to produce a second-order accurate, more robust implicit method for unsteady flow computations. The subiteration approach can be employed to recover time accuracy without increasing computational time (in most cases producing substantial savings).

Pulliam, Thomas H.↗

Numerical results in the statistical theory of thermal turbulence

Several statistical theories of turbulence are applied to thermal convection problem, and are compared in a series of numerical calculations. Results are presented for both the case of very large and very small Prandtl numbers, and for moderate Rayleigh numbers. The theories compared are the direct-interaction approximation, the self-consistent field approximation, the quasi-linear approximation, the quasi-normal approximation, and a 'Markovianized' quasi-normal approximation. Results for these theories are then compared with some simple exact solutions to the statistical problem. The results indicate that the direct-interaction and the self-consistent field method give satisfactory results at all Rayleigh numbers investigated, whereas the procedures based on the quasi-normal approximation give sensible results only at small Rayleigh numbers.

Herring, J. R.↗

Droplet Deformation in an Extensional Flow: The Role of Surfactant Physical Chemistry

Surfactant-induced Marangoni effects strongly alter the stresses exerted along fluid particle interfaces. In low gravity processes, these stresses can dictate the system behavior. The dependence of Marangoni effects on surfactant physical chemistry is not understood, severely impacting our ability to predict and control fluid particle flows. A droplet in an extensional flow allows the controlled study of stretching and deforming interfaces. The deformations of the drop allow both Marangoni stresses, which resist tangential shear, and Marangoni elasticities, which resist surface dilatation, to develop. This flow presents an ideal model system for studying these effects. Prior surfactant-related work in this flow considered a linear dependence of the surface tension on the surface concentration, valid only at dilute surface concentrations, or a non-linear framework at concentrations sufficiently dilute that the linear approximation was valid. The linear framework becomes inadequate for several reasons. The finite dimensions of surfactant molecules must be taken into account with a model that includes surfaces saturation. Nonideal interactions between adsorbed surfactant molecules alter the partitioning of surfactant between the bulk and the interface, the dynamics of surfactant adsorptive/desorptive exchange, and the sensitivity of the surface tension to adsorbed surfactant. For example, cohesion between hydrocarbon chains favors strong adsorption. Cohesion also slows the rate of desorption from interfaces, and decreases the sensitivity of the surface tension to adsorbed surfactant. Strong cohesive interactions result in first order surface phase changes with a plateau in the surface tension vs surface concentration. Within this surface concentration range, the surface tension is decoupled from surface concentration gradients. We are engaged in the study of the role of surfactant physical chemistry in determining the Marangoni stresses on a drop in an extensional flow in a numerical and experimental program. Using surfactants whose dynamics and equilibrium behavior have been characterized in our laboratory, drop deformation will be studied in ground-based experiment. In an accompanying numerical study, predictive drop deformations will be determined based on the isotherm and equation of state determined in our laboratory. This work will improve our abilities to predict and control all fluid particle flows.

Stebe, Kathleen J.↗

Calculation of permanent magnet arrangements for stellarators: a linear least-squares method

A problem arising in several engineering areas is to design magnets outside a volume that produce a desired magnetic field inside it. One instance of this problem is stellarator design, where it has recently been shown that permanent magnets can provide the required shaping of the magnetic field. Here we demonstrate a robust and efficient algorithm REGCOIL_PM to calculate the spatial distribution of these permanent magnets. The procedure involves a small number of fixed-point iterations, with a linear least-squares problem solved at each step. Furthermore, the method exploits the Biot–Savart Law's exact linearity in magnetization density and approximate linearity in magnet size, for magnets far from the target region. No constraint is placed on the direction of magnetization, so Halbach solutions are found naturally, and the magnitude of the magnetization can be made uniformly equal to a target value.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The Statistics of Visual Representation

The experience of retinex image processing has prompted us to reconsider fundamental aspects of imaging and image processing. Foremost is the idea that a good visual representation requires a non-linear transformation of the recorded (approximately linear) image data. Further, this transformation appears to converge on a specific distribution. Here we investigate the connection between numerical and visual phenomena. Specifically the questions explored are: (1) Is there a well-defined consistent statistical character associated with good visual representations? (2) Does there exist an ideal visual image? And (3) what are its statistical properties?

Jobson, Daniel J.↗

Scalable Optimization Methods for Distribution Networks With High PV Integration

Here this paper proposes a suite of algorithms to determine the active- and reactive-power setpoints for photovoltaic (PV) inverters in distribution networks. The objective is to optimize the operation of the distribution feeder according to a variety of performance objectives and ensure voltage regulation. In general, these algorithms take a form of the widely studied ac optimal power flow (OPF) problem. For the envisioned application domain, nonlinear power-flow constraints render pertinent OPF problems nonconvex and computationally intensive for large systems. To address these concerns, we formulate a quadratic constrained quadratic program (QCQP) by leveraging a linear approximation of the algebraic power-flow equations. Furthermore, simplification from QCQP to a linearly constrained quadratic program is provided under certain conditions. The merits of the proposed approach are demonstrated with simulation results that utilize realistic PV-generation and load-profile data for illustrative distribution-system test feeders.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The Poisson–Boltzmann model for implicit solvation of electrolyte solutions: Quantum chemical implementation and assessment via Sechenov coefficients

Here, we present the theory and implementation of a Poisson-Boltzmann implicit solvation model for electrolyte solutions. This model can be combined with arbitrary electronic structure methods that provide an accurate charge density of the solute. A hierarchy of approximations for this model includes a linear approximation for weak electrostatic potentials, finite size of the mobile electrolyte ions, and a Stern-layer correction. Recasting the Poisson-Boltzmann equations into Euler-Lagrange equations then significantly simplifies the derivation of the free energy of solvation for these approximate models. The parameters of the model are either fit directly to experimental observables-e.g., the finite ion size-or optimized for agreement with experimental results. Experimental data for this optimization are available in the form of Sechenov coefficients that describe the linear dependence of the salting-out effect of solutes with respect to the electrolyte concentration. In the final part, we rationalize the qualitative disagreement of the finite ion size modification to the Poisson-Boltzmann model with experimental observations by taking into account the electrolyte concentration dependence of the Stern layer. A route toward a revised model that captures the experimental observations while including the finite ion size effects is then outlined. This implementation paves the way for the study of electrochemical and electrocatalytic processes of molecules and cluster models with accurate electronic structure methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

Nonlinear canonical gyrokinetic Vlasov equation and computation of the gyrocenter motion in tokamaks

The nonlinear canonical gyrokinetic Vlasov equation is obtained from the nonlinear noncanonical gyrokinetic theory using the property of the coordinate transform. In the linear approximation, it exactly recovers the previous linear canonical gyrokinetic equations derived by the Lie-transform perturbation method. The computation of the test particle gyrocenter motion in tokamaks with a large magnetic perturbation is presented and discussed. The numerical results indicate that the second-order gyrocenter Hamiltonian is important for the gyrocenter motion of the trapped electron in tokamaks with a large magnetic perturbation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Evaluating Optimization Strategies for Engine Simulations Using Machine Learning Emulators

This work evaluates different optimization algorithms for computational fluid dynamics (CFD) simulations of engine combustion. Due to the computational expense of CFD simulations, emulators built with machine learning algorithms were used as surrogates for the optimizers. Two types of emulators were used: a Gaussian process (GP) and a weighted variety of machine learning methods called SuperLearner (SL). The emulators were trained using a dataset of 2048 CFD simulations that were run concurrently on a supercomputer. The design of experiments (DOE) for the CFD runs was obtained by perturbing nine input parameters using a Monte-Carlo method. The CFD simulations were of a heavy duty engine running with a low octane gasoline-like fuel at a partially premixed compression ignition mode. Ten optimization algorithms were tested, including types typically used in research applications. Each optimizer was allowed 800 function evaluations and was randomly tested 100 times. The optimizers were evaluated for the median, minimum, and maximum merits obtained in the 100 attempts. Some optimizers required more sequential evaluations, thereby resulting in longer wall clock times to reach an optimum. The best performing optimization methods were particle swarm optimization (PSO), differential evolution (DE), GENOUD (an evolutionary algorithm), and micro-genetic algorithm (GA). These methods found a high median optimum as well as a reasonable minimum optimum of the 100 trials. Moreover, all of these methods were able to operate with less than 100 successive iterations, which reduced the wall clock time required in practice. Two methods were found to be effective but required a much larger number of successive iterations: the DIRECT and MALSCHAINS algorithms. A random search method that completed in a single iteration performed poorly in finding optimum designs but was included to illustrate the limitation of highly concurrent search methods. The last three methods, Nelder–Mead, bound optimization by quadratic approximation (BOBYQA), and constrained optimization by linear approximation (COBYLA), did not perform as well.

Probst, Daniel M.↗

Efficient probabilistic fracture mechanics analysis

A systematic and efficient method for probabilistic fracture mechanics analysis is proposed. The method is based on a most-probable-point-locus concept. The locus is obtained iteratively where the initial locus is determined using the linear approximation of the service life N(X) function about the mean values of the random variables X. Linear and quadratic approximations of N(X) are established locally at the most probable points, and the reliability analysis methods are used to compute the cumulative probabilities. By using two examples, the proposed method is demonstrated to be efficient and accurate. One example involved a random loading and N(X) was computed using cycle-by-cycle integration. The method is general and can be applied to other performance functions. It is particularly suitable when the computation of the performance function is time consuming such that Monte Carlo simulation is prohibitively costly.

Wu, Y.-T.↗

Programmatic Advantages of Linear Equivalent Seismic Models

Underground explosions nonlinearly deform the surrounding earth material and can interact with the free surface to produce spall. However, at typical seismological observation distances the seismic wavefield can be accurately modeled using linear approximations. Although nonlinear algorithms can accurately simulate very near field ground motions, they are computationally expensive and potentially unnecessary for far field wave simulations. Conversely, linearized seismic wave propagation codes are orders of magnitude faster computationally and can accurately simulate the wavefield out to typical observational distances. Thus, devising a means of approximating a nonlinear source in terms of a linear equivalent source would be advantageous both for scenario modeling and for interpretation of seismic source models that are based on linear, far-field approximations. This allows fast linear seismic modeling that still incorporates many features of the nonlinear source mechanics built into the simulation results so that one can have many of the advantages of both types of simulations without the computational cost of the nonlinear computation. In this report we first show the computational advantage of using linear equivalent models, and then discuss how the near-source (within the nonlinear wavefield regime) environment affects linear source equivalents and how well we can fit seismic wavefields derived from nonlinear sources.

58 GEOSCIENCES↗

Bayesian Monte Carlo Evaluation Framework for Imperfect Nuclear Data

Bayesian evaluation of resolved resonance region (RRR) nuclear data has historically been carried out using the generalized least squares (GLS) formalism, as implemented in, e.g., SAMMY. We have recently developed a prototype of Bayesian Monte Carlo (BMC) evaluation framework, implemented using a Markov Chain Monte Carlo (MCMC) method with a Metropolis-Hastings (MH) acceptance criterion. This was done in order to remove the approximations underlying the conventional GLS evaluations, namely, the linear approximation, and the approximation that all probability density functions (PDFs) are of the normal kind. Recent works by others have used similar stochastic approaches to quantify cross section uncertainties from ENDF evaluated co-variances, and/or, from integral benchmark data, but those have not been conceived as an evaluation framework like the one presented here.

97 MATHEMATICS AND COMPUTING↗