Search NASA⌕ Search

SEARCH · Search NASA

Results for “nonlinear iteration”

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 163 records · Page 9

Nonlinear Model Predictive Control Based on Real-Time Iteration Scheme for Wave Energy Converters Using WEC-Sim: Preprint

One of several challenges that wave energy technologies face is their inability to generate electricity cost-competitively with other grid-scale energy generation sources. Several studies have identified two approaches to lower the levelised cost of electricity: reduce the cost over the device's lifetime or increase its overall electrical energy production. Several advanced control strategies have been developed to address the latter. However, only a few take into account the overall efficiency of the power take-off (PTO) system, and none of them solve the optimisation problem that arises at each sampling time on real-time. In this paper, a detailed Nonlinear model predictive control (NMPC) approach based on the real-time iteration (RTI) scheme is presented, and the controller performance is evaluated using a time-domain hydrodynamics model (WEC-Sim). The proposed control law incorporates the PTO system's efficiency in a control law to maximise the energy extracted. The study also revealed that RTI-NMPC clearly outperforms a simple resistive controller.

model predictive control↗

Efficient Minimum-Polynomial And Reduced-Rank Extrapolation

MPERRE computer program accelerates convergence of sequence of vectors by use of minimum-polynomial extrapolation (MPE) and reduced-rank extrapolation (RRE). Effective in accelerating convergences of such sequences of vectors as those obtained from iterative solution of systems of linear and nonlinear equations. In conjunction with various iterative techniques, successfully employed in finite-difference solution of large-scale elliptic boundary-value problems and problems in computational-fluid-dynamics. Only input required is sequence of vectors, convergence of which is accelerated. Program economical and easy to use. Written in FORTRAN 77.

Sidi, Avram↗

Iterative methods in GPU-resident linear solvers for nonlinear constrained optimization

Linear solvers are major computational bottlenecks in a wide range of decision support and optimization computations. The challenges become even more pronounced on heterogeneous hardware, where traditional sparse numerical linear algebra methods are often inefficient. For example, methods for solving ill-conditioned linear systems have relied on conditional branching, which degrades performance on hardware accelerators such as graphical processing units (GPUs). To improve the efficiency of solving ill-conditioned systems, our computational strategy separates computations that are efficient on GPUs from those that need to run on traditional central processing units (CPUs). Our strategy maximizes the reuse of expensive CPU computations. Iterative methods, which thus far have not been broadly used for ill-conditioned linear systems, play an important role in our approach. In particular, we extend ideas from Arioli et al., (2007) to implement iterative refinement using inexact LU factors and flexible generalized minimal residual (FGMRES), with the aim of efficient performance on GPUs. In conclusion, we focus on solutions that are effective within broader application contexts, and discuss how early performance tests could be improved to be more predictive of the performance in a realistic environment.

97 MATHEMATICS AND COMPUTING↗

Improving stability and strength characteristics of framed structures with nonlinear behavior

In this paper an optimal design procedure is introduced to improve the overall performance of nonlinear framed structures. The design methodology presented here is a multiple-objective optimization procedure whose objective functions involve the buckling eigenvalues and eigenvectors of the structure. A constant volume with bounds on the design variables is used in conjunction with an optimality criterion approach. The method provides a general tool for solving complex design problems and generally leads to structures with better limit strength and stability. Many algorithms have been developed to improve the limit strength of structures. In most applications geometrically linear analysis is employed with the consequence that overall strength of the design is overestimated. Directly optimizing the limit load of the structure would require a full nonlinear analysis at each iteration which would be prohibitively expensive. The objective of this paper is to develop an algorithm that can improve the limit-load of geometrically nonlinear framed structures while avoiding the nonlinear analysis. One of the novelties of the new design methodology is its ability to efficiently model and design structures under multiple loading conditions. These loading conditions can be different factored loads or any kind of loads that can be applied to the structure simultaneously or independently. Attention is focused on optimal design of space framed structures. Three-dimensional design problems are more complicated to carry out, but they yield insight into real behavior of the structure and can help avoiding some of the problems that might appear in planar design procedure such as the need for out-of-plane buckling constraint. Although researchers in the field of structural engineering generally agree that optimum design of three-dimension building frames especially in the seismic regions would be beneficial, methods have been slow to emerge. Most of the research in this area has dealt with the optimization of truss and plane frame structures.

Pezeshk, Shahram↗

Boundary formulations for shape sensitivity of temperature dependent conductivity problems

Used in concert with the Kirchhoff transformation, implicit differentiation of the discretized boundary integral equations governing the conduction of heat in solids with temperature dependent thermal conductivity is shown to generate an accurate and economical approach for computation of shape sensitivities. For problems with specified temperature and heat flux boundary conditions, a linear problem results for both the analysis and sensitivity analysis. In problems with either convection or radiation boundary conditions, a nonlinear problem is generated. Several iterative strategies are presented for the solution of the resulting sets of nonlinear equations and the computational performances examined in detail. Multizone analysis and zone condensation strategies are demonstrated to provide substantive computational economies in this process for models with either localized nonlinear boundary conditions or regions of geometric insensitivity to design variables. A series of nonlinear example problems is presented that have closed form solutions. Exact analytical expressions for the shape sensitivities associated with these problems are developed and these are compared with the sensitivities computed using the boundary element formulation.

Kane, James H.↗

An adaptive grid algorithm for one-dimensional nonlinear equations

Richards' equation, which models the flow of liquid through unsaturated porous media, is highly nonlinear and difficult to solve. Step gradients in the field variables require the use of fine grids and small time step sizes. The numerical instabilities caused by the nonlinearities often require the use of iterative methods such as Picard or Newton interation. These difficulties result in large CPU requirements in solving Richards equation. With this in mind, adaptive and multigrid methods are investigated for use with nonlinear equations such as Richards' equation. Attention is focused on one-dimensional transient problems. To investigate the use of multigrid and adaptive grid methods, a series of problems are studied. First, a multigrid program is developed and used to solve an ordinary differential equation, demonstrating the efficiency with which low and high frequency errors are smoothed out. The multigrid algorithm and an adaptive grid algorithm is used to solve one-dimensional transient partial differential equations, such as the diffusive and convective-diffusion equations. The performance of these programs are compared to that of the Gauss-Seidel and tridiagonal methods. The adaptive and multigrid schemes outperformed the Gauss-Seidel algorithm, but were not as fast as the tridiagonal method. The adaptive grid scheme solved the problems slightly faster than the multigrid method. To solve nonlinear problems, Picard iterations are introduced into the adaptive grid and tridiagonal methods. Burgers' equation is used as a test problem for the two algorithms. Both methods obtain solutions of comparable accuracy for similar time increments. For the Burgers' equation, the adaptive grid method finds the solution approximately three times faster than the tridiagonal method. Finally, both schemes are used to solve the water content formulation of the Richards' equation. For this problem, the adaptive grid method obtains a more accurate solution in fewer work units and less computation time than required by the tridiagonal method. The performance of the adaptive grid method tends to degrade as the solution process proceeds in time, but still remains faster than the tridiagonal scheme.

Gutierrez, William E.↗

Nonlinear Elimination Applied to Radiation Diffusion

We apply a nonlinearly preconditioned, quasi-Newton framework to accelerate the numerical solution of the thermal radiative transfer (TRT) equations. This framework was inspired by the unpublished method that has existed for years in Teton, Lawrence Livermore National Laboratory’s deterministic TRT code. In this paper, we cast this iteration scheme within a formal nonlinear preconditioning framework and compare its performance against other iteration schemes in the framework. With proper choices of iteration controls for the various levels of the solver, we can recover the standard linearized one-step method, a full nonlinear Newton scheme, as well as the method in Teton. In brief, the nonlinear preconditioning TRT scheme formally eliminates the material temperature equation from the nonlinear system in a nonlinear analog of a Schur complement. This nonlinear elimination step involves solving a decoupled nonlinear equation for each spatial degree of freedom and is therefore inexpensive. By applying a quasi-Newton iteration scheme on the new system, we obtain a three-level iteration scheme that is at least as efficient as commonly used TRT schemes. The new method allows full convergence to the nonlinear backward Euler time-discretized system, increasing accuracy and robustness, while using a similar number of linear iterations as the more common linearized one-step methods Eq. (4).

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Nonlinear two-fluid modeling of plasma response to RMPs for the ELM control in the ITER baseline

Numerical modeling, combining the toroidal ideal MHD code GPEC and the nonlinear two-fluid MHD code TM1, was used for comprehensive studies of the plasma response to resonant magnetic perturbations (RMPs) with toroidal mode number n = 1–5 for controlling edge-localized modes (ELMs) in ITER for the standard operation scenario (15 MA Q = 10). Several issues related to RMP ELM control are investigated, including the optimization of the RMP coils configuration, the evaluation of the magnitude of density pump-out and the q95 windows of ELM suppression. GPEC calculates the magnetic response, which consistently includes the very important edge kink/peeling response to static magnetic perturbations. Furthermore, GPEC two-dimensional scans of the relative coil current phasing among the three rows of internal coils, at fixed coil current amplitude, reveal the optimal phasing for the RMP coil configuration with n = 1–5, respectively. The poloidal half wavelength of resonant mode at the edge of plasma calculated by GPEC indicates that the midplane row coils have the best resonant coupling with the plasma for n = 2, while the upper and lower row coils have the best resonant coupling with the plasma for n = 3. Based on the plasma kinetic equilibrium and the GPEC calculations of the magnetic response, TM1 was used to simulate the conditions for RMP field penetration in the ITER pedestal. TM1 shows magnetic island formation at the foot of ITER pedestal with RMP coil current threshold ranging from 4 kAt to 8 kAt with n = 2 to 4. These magnetic islands at the pedestal-foot lead to density pump-out, the magnitude of which scales as ${I}_{\text{RMP}}^{0.5}$ and ranges from 5% to 20% at the pedestal-top when scanning the coil current from 4 to 60 kAt. The density pump-out is found to be weaker for higher n RMP. The nonlinear TM1 simulations also show field penetration at the pedestal-top, where the threshold of RMP coil current depends on the q 95 . The alignment of the magnetic island and the location of the pedestal-top decreases the height and width of the pedestal to suppress ELMs. Simulations by two-dimensional scans of RMP coil current and q 95 reveal the accessible q 95 windows of ELM suppression for both n = 3 and 4 RMPs. The predicted q 95 windows of ELM suppression are very similar to the ones in currently operating tokamaks and the required RMP coil current for ELM suppression is less than 40–50 kAt, which is well within the designed capability for ITER. In addition, the simulations indicate that wide q 95 windows of ELM suppression may be accessible in ITER by operating with dominant n = 4 (or n = 5) RMPs.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Hierarchical ensemble Kalman methods with sparsity-promoting generalized gamma hyperpriors

This paper introduces a computational framework to incorporate flexible regularization techniques in ensemble Kalman methods, generalizing the iterative alternating scheme to nonlinear inverse problems. The proposed methodology approximates the maximum a posteriori (MAP) estimate of a hierarchical Bayesian model characterized by a conditionally Gaussian prior and generalized gamma hyperpriors. Suitable choices of hyperparameters yield sparsity-promoting regularization. We propose an iterative algorithm for MAP estimation, which alternates between updating the unknown with an ensemble Kalman method and updating the hyperparameters in the regularization to promote sparsity. Here, the effectiveness of our methodology is demonstrated in several computed examples, including compressed sensing and subsurface flow inverse problems.

Ensemble Kalman methods↗

Xyce(™) Parallel Electronic Simulator v.7.5

The Xyce Parallel Electronic Simulator simulates electronic circuit behavior in DC, AC, HB, MPDE and transient mode using standard analog (DAE) and/or device (PDE) device models including several age and radiation aware devices. It supports a variety of computing platforms (both serial and parallel) computers. Lastly, it uses a variety of modern solution algorithms dynamic parallel load-balancing and iterative solvers.! ! Xyce is primarily used to simulate the voltage and current behavior of a circuit network (a network of electronic devices connected via a conductive network). As a tool, it is mainly used for the design and analysis of electronic circuits.! ! Kirchoff's conservation laws are enforced over a network using modified nodal analysis. This results in a set of differential algebraic equations (DAEs). The resulting nonlinear problem is solved iteratively using a fully coupled Newton method, which in turn results in a linear system that is solved by either a standard sparse-direct solver or iteratively using Trilinos linear solver packages, also developed at Sandia National Laboratories.

Source record↗

Probability of Initiation in Neutron Transport

We discuss the numerical solution of the nonlinear integro-differential equation for the probability of a divergent neutron chain in a stationary system (i.e., the probability of initiation (POI)). We follow the development described in Bell’s classic paper on the stochastic theory of neutron transport. As noted by Bell, the linearized form of this equation resembles the linear adjoint neutron transport equation. A matrix formalism for the discretized steady state (or forward) neutron equation in slab geometry is first developed and is then used to derive the discrete adjoint equation. A main advantage of this discrete development is that the resulting discrete adjoint equation does not depend upon how the multigroup cross sections for the forward problem are obtained. That is, we derive the discrete adjoint directly from the discrete forward equations rather than discretizing directly the adjoint equation. This also guarantees that the discrete adjoint operator is consistent with the inner product used to define the adjoint operator. We discuss three approaches for the numerical solution of the POI equations, and present numerical results on several test problems. The three solution methods are a simple fixed-point iteration, a second approach that is akin to a nonlinear Power iteration, and a third approach which uses a Newton-Krylov nonlinear solver. We also give sufficient conditions to guarantee the existence and uniqueness of nontrivial solutions to our discrete POI equations when the discrete system is supercritical, and that only the trivial solution exists when the discrete system is subcritical. Our approach is modeled after the analysis presented for the continuous POI equations by Mokhtar-Kharroubi and Jarmouni-Idrissi, and by Pazy and Rabinowitz.

42 ENGINEERING↗

Assessing the impact of alpha particles on thermal confinement in JET D-T plasmas through global GENE-Tango simulations

The capability of the global, electromagnetic gyrokinetic GENE code interfaced with the transport Tango solver is exploited to address the impact of fusion alpha particles (in their dual role of fast particles and heating source) on plasma profiles and performance at JET in the discharges with the highest quasi-stationary peak fusion power during the DTE2 experimental campaigns. Employing radially global nonlinear electromagnetic GENE-Tango simulations, we compare results with/without alpha particles and alpha heating. Our findings reveal that alpha particles have a negligible impact on turbulent transport, with GENE-Tango converging to similar plasma profiles regardless of their inclusion as a kinetic species in GENE. On the other hand, alpha heating is found to contribute to the peaking of the electron temperature profiles, leading to a 1 keV drop on the on-axis electron temperature when alpha heating is neglected in Tango. The minimal impact of alpha particles on turbulent transport in this JET discharge–despite this being the shot with the highest fusion output–is attributed to the low content of fusion alpha in this discharge. To assess the potential impact of alpha particles on turbulent transport in regimes with higher alpha particle density, as expected in ITER and fusion reactors, we artificially increased the alpha particle concentration to levels expected for ITER. By performing global nonlinear GENE standalone simulations, we found that increasing the alpha particle density beyond five times the nominal value lead to significant overall turbulence destabilization. These results demonstrate that an increased alpha particle concentration can significantly impact transport properties under simulated JET experimental conditions. However, these findings cannot be directly extrapolated to ITER due to the substantial differences in parameters such as plasma size, magnetic field, plasma current, and thermal pressure.

energetic particles↗

Adaptable Iterative and Recursive Kalman Filter Schemes

Nonlinear filters are often very computationally expensive and usually not suitable for real-time applications. Real-time navigation algorithms are typically based on linear estimators, such as the extended Kalman filter (EKF) and, to a much lesser extent, the unscented Kalman filter. The Iterated Kalman filter (IKF) and the Recursive Update Filter (RUF) are two algorithms that reduce the consequences of the linearization assumption of the EKF by performing N updates for each new measurement, where N is the number of recursions, a tuning parameter. This paper introduces an adaptable RUF algorithm to calculate N on the go, a similar technique can be used for the IKF as well.

Zanetti, Renato↗

Linear and nonlinear dynamic analysis of redundant load path bearingless rotor systems

The goal of this research is to develop the transfer matrix method to treat nonlinear autonomous boundary value problems with multiple branches. The application is the complete nonlinear aeroelastic analysis of multiple-branched rotor blades. Once the development is complete, it can be incorporated into the existing transfer matrix analyses. There are several difficulties to be overcome in reaching this objective. The conventional transfer matrix method is limited in that it is applicable only to linear branch chain-like structures, but consideration of multiple branch modeling is important for bearingless rotors. Also, hingeless and bearingless rotor blade dynamic characteristics (particularly their aeroelasticity problems) are inherently nonlinear. The nonlinear equations of motion and the multiple-branched boundary value problem are treated together using a direct transfer matrix method. First, the formulation is applied to a nonlinear single-branch blade to validate the nonlinear portion of the formulation. The nonlinear system of equations is iteratively solved using a form of Newton-Raphson iteration scheme developed for differential equations of continuous systems. The formulation is then applied to determine the nonlinear steady state trim and aeroelastic stability of a rotor blade in hover with two branches at the root. A comprehensive computer program is developed and is used to obtain numerical results for the (1) free vibration, (2) nonlinearly deformed steady state, (3) free vibration about the nonlinearly deformed steady state, and (4) aeroelastic stability tasks. The numerical results obtained by the present method agree with results from other methods.

Murthy, V. R.↗

A Code-Agnostic Driver Application for Coupled Neutronics and Thermal-Hydraulic Simulations

While the literature has numerous examples of Monte Carlo and computational fluid dynamics (CFD) coupling, most are hard-wired codes intended primarily for research rather than as standalone, general-purpose applications. In this work, we describe an open source application, ENRICO, that enables coupled neutronic and thermal-hydraulic simulations between multiple codes that can be chosen at runtime (as opposed to a coupling between two specific codes). The application has been designed such that the control flow logic, domain mapping, nonlinear fixed-point iteration, solution transfers, and convergence checks are all agnostic to the underlying physics solvers used. Special emphasis has also been placed on enabling efficient execution on distributed-memory computing environments. The transfer of solution fields between solvers is performed in memory rather than through filesystem I/O. Additionally, solvers can be configured to run on overlapping or disjoint sets of processes. To date, coupling with the OpenMC and Shift Monte Carlo codes, the Nek5000 CFD code, and a simplified heat diffusion and subchannel solver has been implemented in ENRICO. We present results for coupled simulations of a single light-water reactor fuel assembly based on the NuScale reactor using various combinations of the physics solvers. For this problem, the coupled simulations are shown to converge in about four Picard iterations. A comparison of the heat source and temperature distributions computed by ENRICO using OpenMC coupled with Nek5000 and Shift coupled with Nek5000 illustrates remarkable agreement between the codes.

42 ENGINEERING↗

Reduction or Enhancement of Stellarator Turbulence by Impurities

A systematic study of the impact of impurities on the turbulent heat fluxes is presented for the stellarator Wendelstein 7-X (W7-X) and, for comparison, the Large Helical Device and ITER. By means of nonlinear multispecies gyrokinetic simulations, it is shown that impurities, depending on the sign of their density gradient, can significantly enhance or reduce turbulent ion heat losses. For the relevant scenario of turbulence reduction, an optimal impurity concentration that minimizes the ion heat diffusivity emerges as a universal feature. This result demonstrates the potential of impurities for controlling turbulence and accessing enhanced confinement regimes in fusion plasmas and, in particular, in W7-X. Published by the American Physical Society 2024

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Prediction of Dielectric Constant in Series of Polymers by Quantitative Structure-Property Relationship (QSPR)

This work is devoted to the investigation of dielectric permittivity which is influenced by electronic, ionic, and dipolar polarization mechanisms, contributing to the material’s capacity to store electrical energy. In this study, an extended dataset of 86 polymers was analyzed, and two quantitative structure–property relationship (QSPR) models were developed to predict dielectric permittivity. From an initial set of 1273 descriptors, the most relevant ones were selected using a genetic algorithm, and machine learning models were built using the Gradient Boosting Regressor (GBR). In contrast to Multiple Linear Regression (MLR)- and Partial Least Squares (PLS)-based models, the gradient boosting models excel in handling nonlinear relationships and multicollinearity, iteratively optimizing decision trees to improve accuracy without overfitting. The developed GBR models showed high R2 coefficients of 0.938 and 0.822, for the training and test sets, respectively. An Accumulated Local Effect (ALE) technique was applied to assess the relationship between the selected descriptors—eight for the GB_A model and six for the GB_B model, and their impact on target property. ALE analysis revealed that descriptors such as TDB09m had a strong positive effect on permittivity, while MLOGP2 showed a negative effect. These results highlight the effectiveness of the GBR approach in predicting the dielectric properties of polymers, offering improved accuracy and interpretability.

Ascencio-Medina, Estefania↗