Search NASA⌕ Search

SEARCH · Search NASA

Results for “initial guess”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Decreasing the temporal complexity for nonlinear, implicit reduced-order models by forecasting

Implicit numerical integration of nonlinear ODEs requires solving a system of nonlinear algebraic equations at each time step. Each of these systems is often solved by a Newton-like method, which incurs a sequence of linear-system solves. Most model-reduction techniques for nonlinear ODEs exploit knowledge of system's spatial behavior to reduce the computational complexity of each linear-system solve. However, the number of linear-system solves for the reduced-order simulation often remains roughly the same as that for the full-order simulation. We propose exploiting knowledge of the model's temporal behavior to (1) forecast the unknown variable of the reduced-order system of nonlinear equations at future time steps, and (2) use this forecast as an initial guess for the Newton-like solver during the reduced-order-model simulation. To compute the forecast, we propose using the Gappy POD technique. As a result, the goal is to generate an accurate initial guess so that the Newton solver requires many fewer iterations to converge, thereby decreasing the number of linear-system solves in the reduced-order-model simulation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Simple, direct and efficient multi-way spectral clustering

Abstract We present a new algorithm for spectral clustering based on a column-pivoted QR factorization that may be directly used for cluster assignment or to provide an initial guess for k-means. Our algorithm is simple to implement, direct and requires no initial guess. Furthermore, it scales linearly in the number of nodes of the graph and a randomized variant provides significant computational gains. Provided the subspace spanned by the eigenvectors used for clustering contains a basis that resembles the set of indicator vectors on the clusters, we prove that both our deterministic and randomized algorithms recover a basis close to the indicators in Frobenius norm. We also experimentally demonstrate that the performance of our algorithm tracks recent information theoretic bounds for exact recovery in the stochastic block model. Finally, we explore the performance of our algorithm when applied to a real-world graph.

Damle, Anil↗
NASA NTRS1993

Multiple steady states in atmospheric chemistry

The equations describing the distributions and concentrations of trace species are nonlinear and may thus possess more than one solution. This paper develops methods for searching for multiple physical solutions to chemical continuity equations and applies these to subsets of equations describing tropospheric chemistry. The calculations are carried out with a box model and use two basic strategies. The first strategy is a 'search' method. This involves fixing model parameters at specified values, choosing a wide range of initial guesses at a solution, and using a Newton-Raphson technique to determine if different initial points converge to different solutions. The second strategy involves a set of techniques known as homotopy methods. These do not require an initial guess, are globally convergent, and are guaranteed, in principle, to find all solutions of the continuity equations. The first method is efficient but essentially 'hit or miss' in the sense that it cannot guarantee that all solutions which may exist will be found. The second method is computationally burdensome but can, in principle, determine all the solutions of a photochemical system. Multiple solutions have been found for models that contain a basic complement of photochemical reactions involving O(x), HO(x), NO(x), and CH4. In the present calculations, transitions occur between stable branches of a multiple solution set as a control parameter is varied. These transitions are manifestations of hysteresis phenomena in the photochemical system and may be triggered by increasing the NO flux or decreasing the CH4 flux from current mean tropospheric levels.

Stewart, Richard W.↗
DOE OSTI2018

Predicting the volumes of crystals

New crystal structures are frequently derived by performing ionic substitutions on known crystal structures. These derived structures are then used in further experimental analysis, or as the initial guess for structural optimization in electronic structure calculations, both of which usually require a reasonable guess of the lattice parameters. In this work, we propose two lattice prediction schemes to improve the initial guess of a candidate crystal structure. The first scheme relies on a one-to-one mapping of species in the candidate crystal structure to a known crystal structure, while the second scheme relies on data-mined minimum atom pair distances to predict the crystal volume of the candidate crystal structure and does not require a reference structure. We demonstrate that the two schemes can effectively predict the volumes within mean absolute errors (MAE) as low as 3.8% and 8.2%. Here we also discuss the various factors that may impact the performance of the schemes. Implementations for both schemes are available in the open-source pymatgen software.

36 MATERIALS SCIENCE↗
DOE OSTI2022

A Robust Numerical Treatment of Solid-Phase Diffusion in Pseudo Two-Dimensional Lithium-Ion Battery Models

Solid-phase diffusion in active materials of lithium-ion batteries significantly affects charging and safety-related behavior of lithium-ion batteries. Therefore, it is essential to develop an efficient and robust numerical algorithm for solving solid-phase diffusion equations in physics-based battery models. In this work, we discuss the origins of numerical instabilities that can occur when solving the solid-phase diffusion equations using iterative methods. Then, in order to resolve such issues, we propose a simple numerical treatment to the surface flux term of discretized solid-phase diffusion equations. To demonstrate its numerical robustness, the proposed method is implemented into a pseudo two-dimensional (P2D) physics-based battery model and simulations are conducted at wide ranges of operating conditions. Even with extremely poor initial guesses for the Li+ concentrations of the active materials, computations using the proposed method do not diverge and the their computational speeds are comparable to those with conventional initial guesses. Comprehensive tests of the proposed method are also performed with a dynamic current profile based on US06 driving profile and a multi-stage charging profile with very high initial C-rate (12C).

battery modeling↗
DOE OSTI2015

Solving the power flow equations: a monotone operator approach

The AC power flow equations underlie all operational aspects of power systems. They are solved routinely in operational practice using the Newton-Raphson method and its variants. These methods work well given a good initial “guess” for the solution, which is always available in normal system operations. However, with the increase in levels of intermittent generation, the assumption of a good initial guess always being available is no longer valid. In this paper, we solve this problem using the theory of monotone operators. We show that it is possible to compute (using an offline optimization) a “monotonicity domain” in the space of voltage phasors. Given this domain, there is a simple efficient algorithm that will either find a solution in the domain, or provably certify that no solutions exist in it. We validate the approach on several IEEE test cases and demonstrate that the offline optimization can be performed tractably and the computed “monotonicity domain” includes all practically relevant power flow solutions.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Stochastic Optimization to Find Optimum Beginning-of-Life Core Configuration of Stable Salt Reactor with Online Refueling

A stochastic optimization method has been developed to find an optimum equilibrium cycle core configuration of the waste-burning stable salt reactor, which is a fast-spectrum molten salt reactor with frequent online refueling. An optimum core configuration was determined with the goal of minimizing radial power peaking. Because of the vast number of potential candidate core configurations, stochastic optimization was applied based on simulated annealing and an additional acceleration method, which screened out unpromising core configurations. It has been demonstrated that the developed stochastic optimization method successfully finds the optimal core configuration regardless of the initial guess and outperforms the gradient descent approach. In addition, it has been observed that the use of a so-called out-in core configuration as the initial guess speeds up convergence of the iterative solution more than five times. Based on the searched optimum equilibrium cycle core configuration, new beginning-of-life (BOL) core configurations have been developed. In conclusion, the new BOL core configurations will be used in developing optimum refueling strategies.

Moltex static salt reactor↗
DOE OSTI2017

Testing of Strategies for the Acceleration of the Cost Optimization

The general problem addressed in the Nuclear-Renewable Hybrid Energy System (N-R HES) project is finding the optimum economical dispatch (ED) and capacity planning solutions for the hybrid energy systems. In the present test-problem configuration, the N-R HES unit is composed of three electrical power-generating components, i.e. the Balance of Plant (BOP), the Secondary Energy Source (SES), and the Energy Storage (ES). In addition, there is an Industrial Process (IP), which is devoted to hydrogen generation. At this preliminary stage, the goal is to find the power outputs of each one of the N-R HES unit components (BOP, SES, ES) and the IP hydrogen production level that maximizes the unit profit by simultaneously satisfying individual component operational constraints. The optimization problem is meant to be solved in the Risk Analysis Virtual Environment (RAVEN) framework. The dynamic response of the N-R HES unit components is simulated by using dedicated object-oriented models written in the Modelica modeling language. Though this code coupling provides for very accurate predictions, the ensuing optimization problem is characterized by a very large number of solution variables. To ease the computational burden and to improve the path to a converged solution, a method to better estimate the initial guess for the optimization problem solution was developed. The proposed approach led to the definition of a suitable Monte Carlo-based optimization algorithm (called the preconditioner), which provides an initial guess for the optimal N-R HES power dispatch and the optimal installed capacity for each one of the unit components. The preconditioner samples a set of stochastic power scenarios for each one of the N-R HES unit components, and then for each of them the corresponding value of a suitably defined cost function is evaluated. After having simulated a sufficient number of power histories, the configuration which ensures the highest profit is selected as the optimal one. The component physical dynamics are represented through suitable ramp constraints, which considerably simplify the numerical solving. In order to test the capabilities of the proposed approach, in the present report, the dispatch problem only is tackled, i.e. a reference unit configuration is assumed, and each one of the N-R HES unit components is assumed to have a fixed installed capacity. As for the next steps, the main improvement will concern the operation strategy of the ES facility. In particular, in order to describe a more realistic battery commitment strategy, the ES operation will be regulated according to the electricity price forecasts.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2018

Description of the code ANVIL (ANisotropic Vhf Impulse Location)

In this paper, we have developed a general, three-dimensional method to locate sources of earth-directed radiation which takes into account the flight paths of reflected signals. While time-of-arrival algorithms exist for locating radio sources using line-of-sight propagation paths, radio sources originating above the surface of the earth will not necessarily emit strong power along direct paths to satellites. A combination of direct and ground-reflected pulses or only ground-reflected signals from such sources could be received by satellite-borne sensors. The work presented here applies to satellite detection of sub-ionospheric radio sources in a vacuum environment with ideal reflection off the earth's surface. Because satellites are not static receivers, their configuration with respect to a radio source is not always optimal. Therefore, a statistical study is performed using 1000 randomized configurations of 24 satellites in middle earth orbit. For each configuration, the radio source latitude and longitude is fixed, and its altitude is varied from 1 to 97 km. An analytic direct-path algorithm using the five satellites nearest the radio source provides an initial guess for the radio source latitude and longitude. We find that, using this approximation, the mean error in the calculated nadir location has a maximum value of 134 m for the 97-km source altitude. The coordinates of the initial guess are used to define the origin of a grid within which an all-points search refinement is performed. Finally, using this procedure, the overall maximum mean error in radio source position is found to be on the order of the computational grid size.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS1977

Deriving mesoscale temperature and moisture fields from satellite radiance measurements over the United States

The ability to provide mesoscale temperature and moisture fields from operational satellite infrared sounding radiances over the United States is explored. High-resolution sounding information for mesoscale analysis and forecasting is shown to be obtainable in mostly clear areas. An iterative retrieval algorithm applied to NOAA-VTPR radiances uses a mean radiosonde sounding as a best initial-guess profile. Temperature soundings are then retrieved at a horizontal resolution of about 70 km, as is an indication of the precipitable water content of the vertical sounding columns. Derived temperature values may be biased in general by the initial-guess sounding or in certain areas by the cloud correction technique, but the resulting relative temperature changes across the field when not contaminated by clouds will be useful for mesoscale forecasting and models. The derived moisture, affected only by high clouds, proves to be reliable to within 0.5 cm of precipitable water and contains valuable horizontal information. Present-day applications from polar-orbiting satellites as well as possibilities from upcoming temperature and moisture sounders on geostationary satellites are noted.

Hillger, D. W.↗
DOE OSTI2018

Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification

Compressive-sensing-based uncertainty quantification methods have become a pow- erful tool for problems with limited data. In this paper, we use the sliced inverse regression (SIR) method to provide an initial guess for the alternating direction method, which is used to enhance sparsity of the Hermite polynomial expansion of stochastic state variables. The sparsity improvement increases both the efficiency and accuracy of the compressive-sensing-based uncertainty quantification method. We demonstrate that the initial guess from SIR is more suitable for the cases when the available data is very limited (Algorithm 4). We also propose another algorithm (Algorithm 5) that performs dimension reduction first with sliced inverse regression, then constructs a Hermite polynomial expansion of the reduced model. This method allows us to approximate the statistics accurately with even less available data. Both methods are non-intrusive and require no a priori information of the sparsity of the system. We demonstrate the effectiveness of these two methods (Algorithms 4 and 5) using problems with up to 500 random dimensions.

Yang, Xiu↗
DOE OSTI2025

Uncertainty estimation of bifurcated solutions in the Rayleigh–Bénard problem for advanced nuclear reactors applications

Multiphysics models of nuclear reactors frequently comprise nonlinear systems of equations. The nonlinear nature of these models could lead to solution bifurcations, where a small change in a certain parameter, e.g., the thermophysical properties of the coolant, can lead to a sudden change in the system’s behavior. At the point in parameter space where this happens, called a critical point, the Jacobian matrix of the model’s nonlinear operator becomes singular potentially permitting multiple solutions to coexist. In this paper, we perform uncertainty estimation (UE) in a parameter range that includes bifurcated solutions within the context of Rayleigh–Bénard problem. We perform this analysis assuming uncertain temperature difference, and tilt angle for the iterative solution algorithm with a unit Prandtl number (Pr = 1). Also, we perform this analysis under uncertain thermophysical properties for both FLiBe molten salt and liquid sodium as working fluid. We deploy two approaches to compute statistical moments for the resulting distributions of selected flow-field variables. The first approach is the blind computation of the mean and the standard deviation without any consideration of solution bifurcation, while the second approach utilizes k-means clustering to cluster each branch’s solutions together and compute separate statistical moments for each branch. The statistical distributions are obtained by perturbing the selected parameters about nominal values that correspond to a solution on one of the valid branches, and that solution is used as initial guess for the iterative solution algorithm. We found that perturbation of any parameter when its nominal value is close to its critical point always leads to branch jumping, i.e., the iterations converge to a solution on a branch different from the branch of the initial guess. This produces a statistical ensemble comprised of fundamentally different solutions leading to wrong mean values and uncertainty estimates, whereas clustering provides an efficient way to deal with this type of computation. This work is important for developing Gen IV nuclear systems because many of these systems rely on natural convection for cooling especially in accident conditions.

97 - MATHEMATICS AND COMPUTING↗
NASA NTRS2012

Constructing a Database from Multiple 2D Images for Camera Pose Estimation and Robot Localization

The LMDB (Landmark Database) Builder software identifies persistent image features (landmarks) in a scene viewed multiple times and precisely estimates the landmarks 3D world positions. The software receives as input multiple 2D images of approximately the same scene, along with an initial guess of the camera poses for each image, and a table of features matched pair-wise in each frame. LMDB Builder aggregates landmarks across an arbitrarily large collection of frames with matched features. Range data from stereo vision processing can also be passed to improve the initial guess of the 3D point estimates. The LMDB Builder aggregates feature lists across all frames, manages the process to promote selected features to landmarks, and iteratively calculates the 3D landmark positions using the current camera pose estimations (via an optimal ray projection method), and then improves the camera pose estimates using the 3D landmark positions. Finally, it extracts image patches for each landmark from auto-selected key frames and constructs the landmark database. The landmark database can then be used to estimate future camera poses (and therefore localize a robotic vehicle that may be carrying the cameras) by matching current imagery to landmark database image patches and using the known 3D landmark positions to estimate the current pose.

Wolf, Michael↗
DOE OSTI2023

Uncertain characterization of reservoir fluids due to brittleness of equation of state regression

Equations of state (EoS) play a central role in modeling the phase equilibrium of fluid mixtures. Their parameterization involves fitting a model to experimental data, i.e., solving a nonlinear, non-convex, multivariate optimization problem. The latter requires one to select design variables, domains of definition for each variable, and weights assigned to individual measurements. We demonstrate that subjective choices of an optimization algorithm and an initial guess also impact the regression process. Consequently, EoS predictions are fundamentally uncertain even after the EoS tuning to a limited set of experimental data points. We demonstrate this observation for two hydrocarbon reservoir fluids, in which five properties of the heaviest carbon fraction are treated as design variables. While all the optimization algorithms and initial guesses match experimental data for the gas and liquid properties, the resulting EoS parameterizations lead to dramatically different predictions of the fluid’s thermophysical behavior in the unsampled pressure and temperature regions. In conclusion, we propose the probabilistic treatment of design variables to quantify the predictive uncertainty of the resulting fluid models.

15 GEOTHERMAL ENERGY↗
DOE OSTI2017

A near-stationary subspace for ridge approximation

Response surfaces are common surrogates for expensive computer simulations in engineering analysis. However, the cost of fitting an accurate response surface increases exponentially as the number of model inputs increases, which leaves response surface construction intractable for high-dimensional, nonlinear models. Here we describe ridge approximation for fitting response surfaces in several variables. A ridge function is constant along several directions in its domain, so fitting occurs on the coordinates of a low-dimensional subspace of the input space. We review essential theory for ridge approximation – e.g., the best mean-squared approximation and an optimal low-dimensional subspace – and we prove that the gradient-based active subspace is near-stationary for the least-squares problem that defines an optimal subspace. Motivated by the theory, we propose a computational heuristic that uses an estimated active subspace as an initial guess for a ridge approximation fitting problem. We show a simple example where the heuristic fails, which reveals a type of function for which the proposed approach is inappropriate. We then propose a simple alternating heuristic for fitting a ridge function, and we demonstrate the effectiveness of the active subspace initial guess applied to an airfoil model of drag as a function of its 18 shape parameters.

42 ENGINEERING↗
DOE OSTI2019

Non-iterative characteristics analysis for high-pressure ramp loading

Here in the canonical ramp compression experiment, a smoothly increasing load is applied to the surface of the sample, and the particle velocity history is measured at two or more different distances into the sample, at interfaces where the surface of the sample can be probed. The velocity histories are used to deduce a stress-density relation, usually using iterative Lagrangian analysis to account for the perturbing effect of the impedance mismatch at the interface. In that technique, a stress-density relation is assumed in order to correct for the perturbation and is adjusted until it becomes consistent with the deduced stress-density relation. This process is subject to the usual difficulties of nonlinear optimization, such as the existence of local minima (sensitivity to the initial guess), possible failure to converge, and relatively large computational effort. We show that, by considering the interaction of successive characteristics reaching a free surface, the stress-density relation can be deduced directly by recursion rather than iteration. This calculation is orders of magnitude faster than iterative analysis and does not require an initial guess. Direct recursion may be less suitable for very noisy data, but it was robust when applied to trial data. The stress-density relation deduced was identical to the result from iterative Lagrangian analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1986

Larger Convergence Zones for Newton's Method

Iterative technique applies over wider range of initial guesses. New theorem describes convergence zone of Newton's iterative method for finding zeros of real function. Involves two points, Xp and Xp*, called primary conjugate points. If exact solution lies between these points (Xp is less than Xz is less than Xp*) and no other conjugate points in interval, then according to theorem, subsequent iterations will converge upon exact solution if initial guess lies in interval.

Campbell, C. W.↗