Search NASA⌕ Search

SEARCH · Search NASA

Results for “Nonlinear problems”

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

Monolithic multigrid methods for two-dimensional resistive magnetohydrodynamics

Magnetohydrodynamic (MHD) representations are used to model a wide range of plasma physics applications and are characterized by a nonlinear system of partial differential equations that strongly couples a charged fluid with the evolution of electromagnetic fields. The resulting linear systems that arise from discretization and linearization of the nonlinear problem are generally difficult to solve. In this paper, we investigate multigrid preconditioners for this system. We consider two well-known multigrid relaxation methods for incompressible fluid dynamics: Braess--Sarazin relaxation and Vanka relaxation. We first extend these to the context of steady-state one-fluid viscoresistive MHD. Then we compare the two relaxation procedures within a multigrid-preconditioned GMRES method employed within Newton's method. To isolate the effects of the different relaxation methods, we use structured grids, inf-sup stable finite elements, and geometric interpolation. Furthermore, we present convergence and timing results for a two-dimensional, steady-state test problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

miniXyce

miniXyce uses a modified nodal analysis to approximate the governing differential algebraic equations (DAEs) for electronic devices and their coupling via a network and Kirchoff's conservation laws. The resulting nonlinear problem is solved iteratively using a fully coupled Newton method,which in turn results in a linear system that is solved using an iterative method.

Keiter, Eric↗

Xyce(™) Parallel Electronic Simulator

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↗

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↗

Xyce(™) Parallel Electronic Simulator v.7.6

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.

Keiter, Eric↗

Introduction to Mixed Variable Optimization (MVO) [Slides]

Mixed Variable Optimization (MVO) is an optimization method that uses discrete (categorical) and continuous variables in its optimization process. This method of optimization is applicable to highly nonlinear problems where the information used in the optimization is of poor quality of has minor inaccuracies in the data sets.

97 MATHEMATICS AND COMPUTING↗

Towards reverse mode automatic differentiation of Kokkos-based codes

Derivative computation is a key component of optimization, sensitivity analysis, uncertainty quantification, and the solving of nonlinear problems. Automatic differentiation (AD) is a powerful technique for evaluating such derivatives, and in recent years, has been integrated into programming environments such as Jax, PyTorch, and TensorFlow to support derivative computations needed for training of machine learning models, facilitating wide-spread use of these technologies. The C++ language has become the de facto standard for scientific computing due to numerous factors, yet language complexity has made the wide-spread adoption of AD technologies for C++ difficult, hampering the incorporation of powerful differentiable programming approaches into C++ scientific simulations. This is exacerbated by the increasing emergence of architectures, such as GPUs, with limited memory capabilities and requiring massive thread-level concurrency. C++ AD tools must effectively use these environments to bring novel scientific simulations to next-generation DOE experimental and observational facilities. In this project, we investigated source transformation-based automatic differentiation using LLVM compiler infrastructure to automatically generate portable and efficient gradient computations of Kokkos-based code. We have demonstrated that our proposed strategy is feasible by investigating the usage of a prototype LLVM-based source transformation tool to generate gradients of simple functions made of sequences of simple Kokkos parallel regions. Speedups of up to 500x compared to Sacado were observed on NVIDIA V100 GPU.

97 MATHEMATICS AND COMPUTING↗

Algorithm for Nonlinear Optimization of Finishing Operations

A model is proposed for nonlinear optimization of final turning. On that basis, an automated computational algorithm is developed. The algorithm maximizes the productivity, while maintaining specified quality of the machined surface.

42 ENGINEERING↗

Reduced basis approximations of parameterized dynamical partial differential equations via neural networks

Projection-based reduced order models are effective at approximating parameter-dependent differential equations that are parametrically separable. When parametric separability is not satisfied, which occurs in both linear and nonlinear problems, projection-based methods fail to adequately reduce the computational complexity. Devising alternative reduced order models is crucial for obtaining efficient and accurate approximations to expensive high-fidelity models. In this work, we develop a timestepping procedure for dynamical parameter-dependent problems, in which a neural-network is trained to propagate the coefficients of a reduced basis expansion. This results in an online stage with a computational cost independent of the size of the underlying problem. Here, we demonstrate our method on several parabolic partial differential equations, including a problem that is not parametrically separable.

97 MATHEMATICS AND COMPUTING↗

An adaptive alpha for the implicit Monte Carlo equations

During the derivation of Fleck and Cumming's Implicit Monte Carlo (IMC) equations, a global user parameter {alpha} is introduced that may be adjusted in the range 0.5 {<=} {alpha} {<=} 1.0 in order to control the degree of 'implicitness' of the IMC approximation of the thermal radiative transfer equations. For linear (and certain nonlinear) problems, it can be shown that the IMC equations are second-order accurate in the time step size {Delta}{sub t} if {alpha} = 0.5, and they are first-order accurate otherwise. However, users almost universally choose {alpha} = 1 in an attempt to avoid unphysical temperature oscillations that can occur for problem regions in which the optical time step is large. In this paper, we provide a mathematically motivated, adaptive value of {alpha} that dynamically changes according to the space- and time-dependent problem data. We show that our {alpha} {yields} 0.5 in the limit of small {Delta}{sub t}, which automatically produces second-order accuracy. In the limit of large time steps, {alpha} > 1; this retains the 'fully implicit' time behavior that is usually employed throughout the entire problem. An adaptive {alpha} also has the advantages of being trivial to implement in current IMC implementations and allowing the elimination of a user input parameter that is a potential source of confusion. Test problems are presented to demonstrate the accuracy of the new approach.

97 MATHEMATICS AND COMPUTING↗

miniXyce

miniXyce uses a modified nodal analysis to approximate the governing differential algebraic equations (DAEs) for electronic devices and their coupling via a network and Kirchoff's conservation laws. The resulting nonlinear problem is solved iteratively using a fully coupled Newton method,which in turn results in a linear system that is solved using an iterative method.

Source record↗

Developing A Fully Implicit Compressible Flow Valve Model in RELAP-7 and Its Application in Short Term BWR Station Black-Out Analyses

This paper presents a set of dynamical models for SRV simulation and their implementation in the RELAP-7 code, which is a new reactor system analysis code being developed at INL. RELAP-7 is based on the MOOSE (the Multi-Physics Object-Oriented Simulation Environment) framework. The compressible flow SRV model covers three different sets of models: fully closed case, subsonic case, and choking case. The RELAP-7 is a fully implicit code and the preconditioned Jacobian-free Newton-Krylov (JFNK) method is used to solve the discretized nonlinear problem. The JFNK method generally needs a good preconditioning scheme to be effective and efficient. There are different ways to precondition the JFNK method. In RELAP-7, two main options are used to obtain the preconditioning matrix: (1) FDP (Finite Difference Preconditioning) option which uses the default finite differencing method provided in the PETSc package. PETSc is the numerical solver software developed by Argonne National Laboratory and used by MOOSE as the numerical solution engine; (2) SMP (Single Matrix Preconditioning) option which requires code developers to provide approximate analytical Jacobian inputs for the important diagonal and off-diagonal terms. Due to the strong discontinuity in the residual vector space when the compressible flow valve model switches from one set of model to another, FDP option cannot guarantee convergence. Instead, accurate analytical Jacobain terms are provided for the compressible flow valve model. With the SMP option selected, the compressible flow valve model can be solved efficiently under different cases. The developed compressible flow valve model has been used for SRV component simulation in several simplified BWR SBO (Station Black-Out) simulations with RELAP-7. This paper only presents cases for short-term SBO in which all the safety systems fail to start and function properly when SBO occurs. Consequently, only the SRVs automatically open and close periodically to control the primary system pressure and discharge the high temperature and high pressure steam into the suppression pool. Although simplified, this case is quite similar to what happened in Fukushima Daiichi Unit 1. Unit 1 had no RCIC system, while the isolation condenser system was believed to be non-functioning, or only available for a very short period of time during the accident. Therefore, the Unit 1 reactor core reached a fuel failure temperature only a few hours into the accident. Two short-term SBO cases will be compared: one with single SRV discharge line which represents all the SRV lines and another case with multi-group SRVs which represent each group of SRV line with different setting points.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

New systems in MOOSE

The Multiphysics Object-Oriented Simulation Environment (MOOSE) serves as a common library of classes between applications developed for advanced reactor analysis, fusion device engineering, spent fuel cask analysis, geochemistry studies, among other fields. These applications drive the development of the framework to meet their needs. Systems in MOOSE group capabilities that share a common purpose and generally common code. They can be leveraged by all downstream applications, providing extensive code re-use and shared maintenance. They facilitate the discovery by new users of the classes meeting at least partially their needs, and offer the same opportunities for customization as other systems. The addition of a new system to MOOSE opens new ways of solving or discretizing nonlinear problems, of performing distributed postprocessing, and a plethora of other needs. While new systems can be introduced in downstream applications rather than at the framework level, the framework team monitors common needs across the community and often triggers their addition. Documentation, training material, development needs can be centralized, limiting duplicated work across the community. The last three years have seen a large expansion in the capabilities of MOOSE. The supporting role of the framework in the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program has created numerous feature requests to support neutronics, thermal hydraulics, computational fluid dynamics and thermo-mechanics simulations in the Griffin, SAM, Pronghorn and Bison applications respectively. Similarly, laboratory-directed research and development (LDRD) projects in additive manufacturing, high-Reynolds flow simulations, structure optimization also necessitate an expansion of the framework capabilities. This summary reports on the new systems created in MOOSE, their design, their capabilities and some of the relevant interfaces.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Solution of 3D inverse scattering problems by combined inverse equivalent current and finite element methods

An approach combining boundary integral and finite element methods is introduced for the solution of three-dimensional inverse electromagnetic medium scattering problems. Based on the equivalence principle, unknown equivalent electric and magnetic surface current densities on a closed surface are utilized to decompose the inverse medium problem into two parts: a linear radiation problem and a nonlinear cavity problem. The first problem is formulated by a boundary integral equation, the computational burden of which is reduced by employing the multilevel fast multipole method (MLFMM). Reconstructed Cauchy data on the surface allows the utilization of the Lorentz reciprocity and the Poynting's theorems. Exploiting these theorems, the noise level and an initial guess are estimated for the cavity problem. Moreover, it is possible to determine whether the material is lossy or not. In the second problem, the estimated surface currents form inhomogeneous boundary conditions of the cavity problem. The cavity problem is formulated by the finite element technique and solved iteratively by the Gauss–Newton method to reconstruct the properties of the object. Regularization for both the first and the second problems is achieved by a Krylov subspace method. The proposed method is tested against both synthetic and experimental data and promising reconstruction results are obtained.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Final state problem for the cubic nonlinear Klein-Gordon equation

We study the final state problem for the nonlinear Klein-Gordon equation, u{sub tt}+u-u{sub xx}={mu}u{sup 3}, t is an element of R,x is an element of R, where {mu} is an element of R. We prove the existence of solutions in the neighborhood of the approximate solutions 2 Re U(t)w{sub +}(t), where U(t) is the free evolution group defined by U(t)=F{sup -1}e{sup -it<{xi}}{sup >}F, <x>={radical}(1+x{sup 2}), F and F{sup -1} are the direct and inverse Fourier transformations, respectively, and w{sub +}(t,x)=F{sup -1}(u{sub +}({xi})e{sup (3/2)i{mu}}{sup <{xi}}{sup >{sup 2}}{sup |u{sub +}{sup ({xi})|{sup 2}}{sup log t}), with a given final data u{sub +} is a real-valued function and parallel <{xi}>{sup 3}<i{partial_derivative}{sub {xi}}>u{sub +}({xi}) parallel {sub L{sup {infinity}}} is small.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Nonlinear Optimal Control Problem Arising from a Sterilization Process for Packaged Foods

In this paper we study an optimization problem arising from a sterilization process for packaged foods by using a microwave heating method. The goal of the optimal control is to find the optimal frequency function such that the temperature profile at the final stage has a relative uniform distribution in the food product. The underlying state variables are electric, magnetic fields and temperature which satisfy the coupled nonlinear Maxwell’s system and a nonlinear heat equation. The control variable for the system is chosen to be the electric frequency function. We show that there exists an optimal frequency which minimizes the cost functional. Moreover, an optimality condition is also derived.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Ensemble Score Filter for Tracking High-Dimensional Nonlinear Dynamical Systems

We propose an ensemble score filter (EnSF) for solving high-dimensional nonlinear filtering problems with superior accuracy. A major drawback of existing filtering methods, e.g., particle filters or ensemble Kalman filters, is the low accuracy in handling high-dimensional and highly nonlinear problems. EnSF attacks this challenge by exploiting the score-based diffusion model, defined in a pseudo-temporal domain, to characterizing the evolution of the filtering density. EnSF stores the information of the recursively updated filtering density function in the score function, in stead of storing the information in a set of finite Monte Carlo samples (used in particle filters and ensemble Kalman filters). Unlike existing diffusion models that train neural networks to approximate the score function, we develop a training-free score estimation that uses mini-batch-based Monte Carlo estimator to directly approximate the score function at any pseudo-spatial-temporal location, which provides sufficient accuracy in solving high-dimensional nonlinear problems as well as saves tremendous amount of time spent on training neural networks. Another essential aspect of EnSF is its analytical update step, gradually incorporating data information into the score function, which is crucial in mitigating the degeneracy issue faced when dealing with very high-dimensional nonlinear filtering problems. High-dimensional Lorenz systems are used to demonstrate the performance of our method. EnSF provides surprisingly impressive performance in reliably tracking extremely high-dimensional Lorenz systems (up to 1,000,000 dimension) with highly nonlinear observation processes, which is a well-known challenging problem for existing filtering methods.

97 MATHEMATICS AND COMPUTING↗

Nonlinear Acceleration of Transport Criticality Problems

We present a nonlinear acceleration algorithm for the transport criticality problem. The algorithm combines the well-known nonlinear diffusion acceleration (NDA) with a recently developed, Newton-based, nonlinear criticality acceleration (NCA) algorithm. The algorithm first employs the NDA to reduce the system to scalar flux, then the NCA is applied to the resulting drift-diffusion system. We apply a nonlinear elimination technique to eliminate the eigenvalue from the Jacobian matrix. Numerical results show that the algorithm reduces the CPU time a factor of 400 in a very diffusive system) and a factor of 5 in a non-diffusive system.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗