Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Approximate Jacobian”

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

A computational procedure for automated flutter analysis

A direct solution procedure for computing the flutter Mach number and the flutter frequency is applied to the aeroelastic analysis of propfans using a finite element structural model and an unsteady aerodynamic model based on a three-dimensional subsonic compressible lifting surface theory. An approximation to the Jacobian matrix that improves the efficiency of the iterative process is presented. The Jacobian matrix is indirectly approximated from approximate derivatives of the flutter matrix. Examples are used to illustrate the convergence properties. The direct solution procedure facilitates the automated flutter analysis in addition to contributing to the efficient use of computer time as well as the analyst's time.

Murthy, Durbha V.↗

A computational procedure for automated flutter analysis

A direct solution procedure for computing the flutter Mach number and the flutter frequency is applied to the aeroelastic analysis of propfans using an unsteady aerodynamic model based on a three-dimensional subsonic compressible lifting surface theory. An approximation to the Jacobian matrix that improves the efficiency of the iterative process is presented. The Jacobian matrix is indirectly approximated from approximate derivatives of the flutter matrix. Examples are used to illustrate the convergence properties. The direct solution procedure facilitates the automated flutter analysis in addition to contributing to the efficient use of computer time as well as the analyst's time.

Murthy, Durbha V.↗

A computational procedure for automated flutter analysis

A direct solution procedure for computing the flutter Mach number and the flutter frequency is applied to the aeroelastic analysis of propfans using a finite element structural model and an unsteady aerodynamic model based on a three-dimensional subsonic compressible lifting surface theory. An approximation to the Jacobian matrix that improves the efficiency of the iterative process is presented. The Jacobian matrix is indirectly approximated from approximate derivatives of the flutter matrix, which are updated only in the direction of the last move. Examples are used to illustrate the convergence properties. The direct solution procedure facilitates the automated flutter analysis in addition to contributing to the efficient use of computer time as well as the analyst's time.

Murthy, Durbha V.↗

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗

Discretized Newton-relaxation solution of high resolution flux-difference split schemes

A method is presented for the implicit solution of high resolution flux-difference split schemes for which it is impractical to obtain the Jacobian matrix analytically. The method is used frequently in numerical schemes for solving nonlinear systems of equations, but apparently has not been used to date for approximating the Jacobian of the Roe numerical flux vectors. The method consists of obtaining a discretized Jacobian by using simple finite-differences of the flux vectors, and then using this discretized Jacobian in a Newton-relaxation solution method. The method is applied to both compressible and incompressible flows. Numerical results are presented that demonstrate the method works for both inviscid and viscous flows.

Whitfield, David L.↗

A low rank approach to automatic differentiation.

This manuscript introduces a new approach for increasing the efficiency of automatic differentiation (AD) computations for estimating the first order derivatives comprising the Jacobian matrix of a complex large-scale computational model. The objective is to approximate the entire Jacobian matrix with minimized computational and storage resources. This is achieved by finding low rank approximations to a Jacobian matrix via the Efficient Subspace Method (ESM). Low rank Jacobian matrices arise in many of today's important scientific and engineering problems, e.g. nuclear reactor calculations, weather climate modeling, geophysical applications, etc. A low rank approximation replaces the original Jacobian matrix J (whose size is dictated by the size of the input and output data streams) with matrices of much smaller dimensions (determined by the numerical rank of the Jacobian matrix). This process reveals the rank of the Jacobian matrix and can be obtained by ESM via a series of r randomized matrix-vector products of the form: Jq, and J{sup T} {omega} which can be evaluated by the AD forward and reverse modes, respectively.

97 MATHEMATICS AND COMPUTING↗

Preconditioned least‐squares Petrov–Galerkin reduced order models

Abstract In this article, we introduce a methodology for improving the accuracy and efficiency of reduced order models (ROMs) constructed using the least‐squares Petrov–Galerkin (LSPG) projection method through the introduction of preconditioning. Unlike prior related work, which focuses on preconditioning the linear systems arising within the ROM numerical solution procedure to improve linear solver performance, our approach leverages a preconditioning matrix directly within the minimization problem underlying the LSPG formulation. Applying preconditioning in this way has the potential to improve ROM accuracy for several reasons. First, preconditioning the LSPG formulation changes the norm defining the residual minimization, which can improve the residual‐based stability constant bounding the ROM solution's error. The incorporation of a preconditioner into the LSPG formulation can have the additional effect of scaling the components of the residual being minimized to make them roughly of the same magnitude, which can be beneficial when applying the LSPG method to problems with disparate scales (e.g., dimensional equations, multi‐physics problems). Importantly, we demonstrate that an “ideal preconditioned” LSPG ROM (a ROM in which the preconditioner is the inverse of the Jacobian of its corresponding full order model) emulates projection of the full order model solution increment onto the reduced basis. This quantity defines a lower bound on the error of a ROM solution for a given reduced basis. By designing preconditioners that approximate the Jacobian inverse—as is common in designing preconditioners for solving linear systems—it is possible to obtain a ROM whose error approaches this lower bound. The proposed approach is evaluated on several mechanical and thermo‐mechanical problems implemented within the Albany HPC code and run in the predictive regime, with prediction across material parameter space. We demonstrate numerically that the introduction of simple Jacobi, Gauss‐Seidel, and ILU preconditioners into the proper orthogonal decomposition/LSPG formulation reduces significantly the ROM solution error, the reduced Jacobian condition number, the number of nonlinear iterations required to reach convergence, and the wall time (thereby improving efficiency). Moreover, our numerical results reveal that the introduction of preconditioning can deliver a robust and accurate solution for test cases in which the unpreconditioned LSPG method fails to converge.

Lindsay, Payton↗

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↗

A parallel trajectory optimization tool for aerospace plane guidance

A parallel trajectory optimization algorithm is being developed. One possible mission is to provide real-time, on-line guidance for the National Aerospace Plane. The algorithm solves a discrete-time problem via the augmented Lagrangian nonlinear programming algorithm. The algorithm exploits the dynamic programming structure of the problem to achieve parallelism in calculating cost functions, gradients, constraints, Jacobians, Hessian approximations, search directions, and merit functions. Special additions to the augmented Lagrangian algorithm achieve robust convergence, achieve (almost) superlinear local convergence, and deal with constraint curvature efficiency. The algorithm can handle control and state inequality constraints such as angle-of-attack and dynamic pressure constraints. Portions of the algorithm have been tested. The nonlinear programming core algorithm performs well on a variety of static test problems and on an orbit transfer problem. The parallel search direction algorithm can reduce wall clock time by a factor of 10 for this part of the computation task.

Psiaki, Mark L.↗

Multigrid properties of upwind-biased data reconstructions

The multigrid properties of two data reconstruction methods used for achieving second-order spatial accuracy when solving the two-dimensional Euler equations are examined. The data reconstruction methods are used with an implicit upwind algorithm which uses linearized backward-Euler time-differencing. The solution of the resulting linear system is performed by an iterative procedure. In the present study only regular quadrilateral grids are considered, so a red-black Gauss-Seidel iteration is used. Although the Jacobian is approximated by first-order upwind extrapolation, two alternative data reconstruction techniques for the flux integral that yield higher-order spatial accuracy at steady state are examined. The first method, probably most popular for structured quadrilateral grids, is based on estimating the cell gradients using one-dimensional reconstruction along curvilinear coordinates. The second method is based on Green's theorem. Analysis and numerical results for the two dimensional Euler equations show that data reconstruction based on Green's theorem has superior multigrid properties as compared to the one-dimensional data reconstruction method.

Warren, Gary P.↗

Optimization of Time-Dependent Particle Tracing Using Tetrahedral Decomposition

An efficient algorithm is presented for computing particle paths, streak lines and time lines in time-dependent flows with moving curvilinear grids. The integration, velocity interpolation and step-size control are all performed in physical space which avoids the need to transform the velocity field into computational space. This leads to higher accuracy because there are no Jacobian matrix approximations or expensive matrix inversions. Integration accuracy is maintained using an adaptive step-size control scheme which is regulated by the path line curvature. The problem of cell-searching, point location and interpolation in physical space is simplified by decomposing hexahedral cells into tetrahedral cells. This enables the point location to be done analytically and substantially faster than with a Newton-Raphson iterative method. Results presented show this algorithm is up to six times faster than particle tracers which operate on hexahedral cells yet produces almost identical particle trajectories.

Kenwright, David↗

Version 2 Ozone Monitoring Instrument SO2 Product (OMSO2 V2): New Anthropogenic SO2 Vertical Column Density Dataset

The Ozone Monitoring Instrument (OMI) has been providing global observations of SO2 pollution since 2004. Here we introduce the new anthropogenic SO2 vertical column density (VCD) dataset in the version 2 OMI SO2 product (OMSO2 V2). As with the previous version (OMSO2 V1.3), the new dataset is generated with an algorithm based on principal component analysis of OMI radiances, but features several updates. The most important among those is the use of expanded lookup tables and model a priori profiles to estimate SO2 Jacobians for individual OMI pixels, in order to better characterize pixel-to-pixel variations in SO2 sensitivity, including over snow and ice. Additionally, new data screening and spectral fitting schemes have been implemented to improve the quality of the spectral fit. As compared with the planetary boundary layer SO2 dataset in OMSO2 V1.3, the new dataset has substantially better data quality, especially over areas that are relatively clean or affected by the south Atlantic anomaly. The updated retrievals over snow/ice yield more realistic seasonal changes in SO2 at high latitudes and offer enhanced sensitivity to sources during wintertime. An error analysis has been conducted to assess uncertainties in SO2 VCDs from both the spectral fit and Jacobian calculations. The uncertainties from spectral fitting are reflected in SO2 slant column densities (SCDs) and largely depend on the signal-to-noise ratio of the measured radiances, as implied by the generally smaller SCD uncertainties over clouds or for smaller solar zenith angles. The SCD uncertainties for individual pixels are estimated to be~0.15-0.3 DU (Dobson Units) between ~40°S and ~40°N and to be~0.2-0.5 DU at higher latitudes. The uncertainties from the Jacobians are approximately ~50-100% over polluted areas, and primarily attributed to errors in SO2 a priori profiles and cloud pressures, as well as the lack of explicit treatment for aerosols. Finally, the daily mean and median SCDs over the presumably SO2-free equatorial East Pacific have increased by only~0.0035 DU and ~0.003 DU respectively over the entire 15-year OMI record; while the standard deviation of SCDs has grown by only~0.02 DU or ~10%. Such remarkable long-term stability makes the new dataset particularly suitable for detecting regional changes in SO2 pollution.

OMI, SO2, Remote Sensing↗

Shape Servoing of Deformable Objects Using Model Estimation and Barrier Lyapunov Function

An adaptive shape servoing control method is presented in this article to manipulate a deformable object into a desired shape in 3-D. A finite-point-based representation of the deformable object is used and the deformation Jacobian matrix is approximated using Fourier series basis functions. The unknown parameters of the deformation Jacobian are learned by using the velocity applied to a control point on the object and corresponding change of positions of the points describing the entire object. An integral concurrent learning (ICL)-based parameter update law is designed along with a constrained controller to satisfy the state constraints on the motion of the control point using Barrier Lyapunov function analysis. ICL-based parameter update law uses data history of velocity and corresponding positions of the points along with their current values. An efficient algorithm to update the history stack using singular value maximization is proposed based on the structure of the regressor matrix. Simulations using a physical simulator and experiments using a robot platform are performed to validate the performance of the proposed controller on two different deformable objects.

Vrithik Raj Guthikonda↗

On linearization and preconditioning for radiation diffusion coupled to material thermal conduction equations

Jacobian-free Newton–Krylov (JFNK) method is an effective algorithm for solving large scale nonlinear equations. One of the most important advantages of JFNK method is that there is no necessity to form and store the Jacobian matrix of the nonlinear system when JFNK method is employed. However, an approximation of the Jacobian is needed for the purpose of preconditioning. In this paper, JFNK method is employed to solve a class of non-equilibrium radiation diffusion coupled to material thermal conduction equations, and two preconditioners are designed by linearizing the equations in two methods. Numerical results show that the two preconditioning methods can improve the convergence behavior and efficiency of JFNK method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluation of Jacobian determinants by Monte Carlo methods - Application to the quasiclassical approximation in molecular scattering.

Sampling techniques have been used previously to evaluate Jacobian determinants that occur in classical mechanical descriptions of molecular scattering. These determinants also occur in the quasiclassical approximation. A new technique is described which can be used to evaluate Jacobian determinants which occur in either description. This method is expected to be valuable in the study of reactive scattering using the quasiclassical approximation.

La Budde, R. A.↗

Automatic Differentiation in MetaPhysicL and Its Applications in MOOSE

Efficient solution via Newton’s method of nonlinear systems of equations requires an accurate representation of the Jacobian, corresponding to the derivatives of the component residual equations with respect to the degrees of freedom. In practice these systems of equations often arise from spatial discretization of partial differential equations used to model physical phenomena. These equations may involve domain motion or material equations that are complex functions of the systems’ degrees of freedom. Computing the Jacobian by hand in these situations is arduous and prone to error. Finite difference approximations of the Jacobian or its action are prone to truncation error, especially in multiphysics settings. Symbolic differentiation packages may be used, but often result in an excessive number of terms in realistic model scenarios. An alternative to symbolic and numerical differentiation is automatic differentiation (AD), which propagates derivatives with every elementary operation of a computer program, corresponding to continual application of the chain rule. Automatic differentiation offers the guarantee of an exact Jacobian at a relatively small overhead cost. In this work, we outline the adoption of AD in the Multiphysics Object Oriented Simulation Environment (MOOSE) via the MetaPhysicL package. We describe the application of MOOSE’s AD capability to several sets of physics that were previously infeasible to model via hand-coded or Jacobian-free simulation techniques, including arbitrary Lagrangian-Eulerian and level-set simulations of laser melt pools, phase-field simulations with free energies provided through neural networks, and metallic nuclear fuel simulations that require inner Newton loop calculation of nonlinear material properties.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗