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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

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↗
NASA NTRS2020

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↗
NASA NTRS2024

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↗
NASA NTRS1972

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.↗
DOE OSTI2021

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↗
DOE OSTI2020

BISON Robustness and Performance Improvements

BISON is a modern finite-element based nuclear fuel performance code that has been under development at the Idaho National Laboratory (USA) since 2009 [1]. The code is applicable to both steady and transient fuel behavior and can be used to analyze 1D (spherically symmetric), 2D (axisymmetric and generalized plane strain) or 3D geometries. BISON is the fuel performance code used within CASL for LWR fuel under both normal operating and accident conditions. BISON is built using the INL Multiphysics ObjectOriented Simulation Environment, or MOOSE [2, 3]. MOOSE is a massively parallel, finite element-based framework to solve systems of coupled non-linear partial differential equations using the Jacobian-Free Newton Krylov (JFNK) method [4]. This enables investigation of computationally large problems, for example a full stack of discrete pellets in a LWR fuel rod, or every rod in a full reactor core. MOOSE supports the use of complex two and three-dimensional meshes and uses implicit time integration, important for the widely varied time scale in nuclear fuel simulation. An object-oriented architecture is employed which greatly minimizes the programming effort required to add new material and behavioral models. The flexibility of the implicit and fully coupled multiphysics approach comes with a need for constructing suitable approximations for the Jacobian matrix of the coupled system used for either preconditioning a Krylov solve or in a direct Newton solve. Preconditioning options for Bison problems need to be revisited with new preconditioning methods becoming available.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
NASA NTRS1983

Progress on a generalized coordinates tensor product finite element 3DPNS algorithm for subsonic

A generalized coordinates form of the penalty finite element algorithm for the 3-dimensional parabolic Navier-Stokes equations for turbulent subsonic flows was derived. This algorithm formulation requires only three distinct hypermatrices and is applicable using any boundary fitted coordinate transformation procedure. The tensor matrix product approximation to the Jacobian of the Newton linear algebra matrix statement was also derived. Tne Newton algorithm was restructured to replace large sparse matrix solution procedures with grid sweeping using alpha-block tridiagonal matrices, where alpha equals the number of dependent variables. Numerical experiments were conducted and the resultant data gives guidance on potentially preferred tensor product constructions for the penalty finite element 3DPNS algorithm.

Baker, A. J.↗
NASA NTRS1984

A finite element method for nonlinear forced vibrations of beams

Techniques for defining a finite element model (FEM) for analysis of nonlinear vibrations in beam structures subjected to harmonic excitation are presented. The resulting model covers longitudinal deformation and inertial effects. The nonlinear oscillations of a beam element under forced excitation are modeled by a harmonic force matrix based on first order approximations of the Jacobian elliptic forcing function. Harmonic force and nonlinear stiffness matrices are derived and the nonlinear forced responses of beams are calculated under various boundary conditions. The results of FEM computations for simply-supported and clamped beams show that midplane stretching caused by large deflections increases the nonlinearity. Axially-restrained beams experience only hardening nonlinearity, while axially-free beams have reduced nonlinearity in deformation and inertia and an increase in linearity due to large deflection.

Mei, C.↗
NASA NTRS1990

Efficient numerical simulation of electron states in quantum wires

A new algorithm is presented for the numerical simulation of electrons in a quantum wire as described by a two-dimensional eigenvalue problem for Schroedinger's equation coupled with Poisson's equation. Initially, the algorithm employs an underrelaxed fixed point iteration to generate an approximation which is reasonably close to the solution. Subsequently, this approximate solution is employed as an initial guess for a Jacobian-free implementation of an approximate Newton method. In this manner the nonlinearity in the model is dealt with effectively. The effectiveness of this approach is demonstrated in a set of numerical experiments which study the electron states on the cross section of a quantum wire structure based on III-V semiconductors at 4.2 and 77 K.

Kerkhoven, Thomas↗
DOE OSTI2023

Inverse modeling of circular lattices via orbit response measurements in the presence of degeneracy

The number and location of beam position monitors (BPMs) and steerers with respect to the quadrupoles in a circular lattice can lead to degeneracy in the context of fitting linear optics and extracting lattice information from measured closed orbits. Furthermore, the measurement uncertainties due to the imperfection of BPMs and steerers can be propagated by the fitting process in ways that prohibit the successful extraction of discrepancies between lattice elements in the real machine and their description in the corresponding model. We systematically studied the influence of the placement of BPMs and steerers on the reconstruction of linear optics and corresponding lattice information. The derivative of orbit response coefficients with respect to the quadrupole strengths, the Jacobian, is derived as an analytical formula. This analytical version of the Jacobian is used to further derive the theoretical limitations of fitting linear optics from closed orbits in terms of the placement of BPMs and steerers. It is further demonstrated that when evaluating the Jacobian during the fitting procedure, the analytical version can be used in place of the conventional finite-difference computation. This allows for greatly improved efficiency when computing the Jacobian during each iteration of the fitting procedure. The approach is tested with large-scale simulations and the findings are verified by measurement data taken on SIS18 synchrotron at GSI Helmholtz Centre for Heavy Ion Research. The presented methods are of general nature and can be applied to other accelerator lattices as well. The fitting procedure by using the analytical Jacobian is tested in conjunction with various methods for mitigating quasidegeneracy and the results agree with those obtained by using the conventional Jacobian via finite-difference approximation.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Multiphysics coupling plan

In this chapter, multiphysics coupling simulations of nuclear reactor systems are reviewed. On the one hand, the mainstream methods of multiphysics coupling are demonstrated. The fundamental theory and coupling scheme of operator splitting methods, Jacobian-free Newton–Krylov methods, and approximate block Newton methods are summarized and presented. On the other hand, some significant works on neutronic and thermal-hydraulic codes coupling, and large research project, including NURESAFE European project, Multiphysics Object-Oriented Simulation Environment plan, and Consortium for the Advanced Simulation of Light Water Reactors project, are reviewed. This chapter helps the readers have a better understanding on the worldwide current status of multiphysics coupling research.

Gui, Miao↗
DOE OSTI2020

Solving Coupled Cluster Equations by the Newton Krylov Method

We describe using the Newton Krylov method to solve the coupled cluster equation. The method uses a Krylov iterative method to compute the Newton correction to the approximate coupled cluster amplitude. The multiplication of the Jacobian with a vector, which is required in each step of a Krylov iterative method such as the Generalized Minimum Residual (GMRES) method, is carried out through a finite difference approximation, and requires an additional residual evaluation. The overall cost of the method is determined by the sum of the inner Krylov and outer Newton iterations. We discuss the termination criterion used for the inner iteration and show how to apply pre-conditioners to accelerate convergence. We will also examine the use of regularization technique to improve the stability of convergence and compare the method with the widely used direct inversion of iterative subspace (DIIS) methods through numerical examples.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1991

Newton's method applied to finite-difference approximations for the steady-state compressible Navier-Stokes equations

Finite-difference approximations for steady-state compressible Navier-Stokes equations, whose two spatial dimensions are written in generalized curvilinear coordinates and strong conservation-law form, are presently solved by means of Newton's method in order to obtain a lifting-airfoil flow field under subsonic and transonnic conditions. In addition to ascertaining the computational requirements of an initial guess ensuring convergence and the degree of computational efficiency obtainable via the approximate Newton method's freezing of the Jacobian matrices, attention is given to the need for auxiliary methods assessing the temporal stability of steady-state solutions. It is demonstrated that nonunique solutions of the finite-difference equations are obtainable by Newton's method in conjunction with a continuation method.

Bailey, Harry E.↗
NASA NTRS1992

Large-scale sparse singular value computations

Four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture are presented. Lanczos and subspace iteration-based methods for determining several of the largest singular triplets (singular values and corresponding left and right-singular vectors) for sparse matrices arising from two practical applications: information retrieval and seismic reflection tomography are emphasized. The target architectures for implementations are the CRAY-2S/4-128 and Alliant FX/80. The sparse SVD problem is well motivated by recent information-retrieval techniques in which dominant singular values and their corresponding singular vectors of large sparse term-document matrices are desired, and by nonlinear inverse problems from seismic tomography applications which require approximate pseudo-inverses of large sparse Jacobian matrices.

Berry, Michael W.↗
DOE OSTI2025

Equation-Free Coarse Control of Distributed Parameter Systems via Local Neural Operators

The control of high-dimensional distributed parameter systems (DPS) remains a challenge when explicit coarse-grained equations are unavailable. Classical equation-free (EF) approaches rely on fine-scale simulators treated as black-box timesteppers. However, repeated simulations for steady-state computation, linearization, and control design are often computationally prohibitive, or the microscopic timestepper may not even be available, leaving us with data as the only resource. We propose a data-driven alternative that uses local neural operators, trained on spatiotemporal microscopic/mesoscopic data, to obtain efficient short-time solution operators. These surrogates are employed within Krylov subspace methods to compute coarse steady and unsteady-states, while also providing Jacobian information in a matrix-free manner. Krylov-Arnoldi iterations then approximate the dominant eigenspectrum, yielding reduced models that capture the open-loop slow dynamics without explicit Jacobian assembly. Both discrete-time Linear Quadratic Regulator (dLQR) and pole-placement (PP) controllers are based on this reduced system and lifted back to the full nonlinear dynamics, thereby closing the feedback loop.

93B52, 93C20, 47N70, 65J15, 65M32, 68T07, 68T20, 6↗
NASA NTRS1986

The effects of various implicit operators on a flux vector splitting method

Three different implicit operators in a numerical method for solving the two-dimensional steady Euler equations using flux vector splitting are investigated. These include the implementation of the true Jacobian matrices in the implicit part, the use of their splitting approximate form, and a modification of the implicit part of the scheme that uses the scalar form of the implicit part based on the spectral radii of the split Jacobian matrices. The three versions of the basic algorithm are compared with the results given by two common numerical methods using several two-dimensional test cases. Special attention is paid to the quality of results as well as computational efficiency and convergence properties.

Von Lavante, E.↗
NASA NTRS1994

Robust inverse kinematics using damped least squares with dynamic weighting

This paper presents a general method for calculating the inverse kinematics with singularity and joint limit robustness for both redundant and non-redundant serial-link manipulators. Damped least squares inverse of the Jacobian is used with dynamic weighting matrices in approximating the solution. This reduces specific joint differential vectors. The algorithm gives an exact solution away from the singularities and joint limits, and an approximate solution at or near the singularities and/or joint limits. The procedure is here implemented for a six d.o.f. teleoperator and a well behaved slave manipulator resulted under teleoperational control.

Schinstock, D. E.↗