Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “implicit methods”

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 1,441 records · Page 80
All sourcesNASA NTRSDOE OSTI
NASA NTRS1999

Plane Smoothers for Multiblock Grids: Computational Aspects

Standard multigrid methods are not well suited for problems with anisotropic discrete operators, which can occur, for example, on grids that are stretched in order to resolve a boundary layer. One of the most efficient approaches to yield robust methods is the combination of standard coarsening with alternating-direction plane relaxation in the three dimensions. However, this approach may be difficult to implement in codes with multiblock structured grids because there may be no natural definition of global lines or planes. This inherent obstacle limits the range of an implicit smoother to only the portion of the computational domain in the current block. This report studies in detail, both numerically and analytically, the behavior of blockwise plane smoothers in order to provide guidance to engineers who use block-structured grids. The results obtained so far show alternating-direction plane smoothers to be very robust, even on multiblock grids. In common computational fluid dynamics multiblock simulations, where the number of subdomains crossed by the line of a strong anisotropy is low (up to four), textbook multigrid convergence rates can be obtained with a small overlap of cells between neighboring blocks.

Llorente, Ignacio M.↗
NASA NTRS2009

"Glitch Logic" and Applications to Computing and Information Security

This paper introduces a new method of information processing in digital systems, and discusses its potential benefits to computing and information security. The new method exploits glitches caused by delays in logic circuits for carrying and processing information. Glitch processing is hidden to conventional logic analyses and undetectable by traditional reverse engineering techniques. It enables the creation of new logic design methods that allow for an additional controllable "glitch logic" processing layer embedded into a conventional synchronous digital circuits as a hidden/covert information flow channel. The combination of synchronous logic with specific glitch logic design acting as an additional computing channel reduces the number of equivalent logic designs resulting from synthesis, thus implicitly reducing the possibility of modification and/or tampering with the design. The hidden information channel produced by the glitch logic can be used: 1) for covert computing/communication, 2) to prevent reverse engineering, tampering, and alteration of design, and 3) to act as a channel for information infiltration/exfiltration and propagation of viruses/spyware/Trojan horses.

hardware vulnerabilities↗
DOE OSTI2024

Pressure-stabilized fixed-stress iterative solutions of compositional poromechanics

We consider the numerical behavior of the fixed-stress splitting method for coupled poromechanics as undrained regimes are approached. We explain that pressure stability is related to the splitting error of the scheme, not the fact that the discrete saddle point matrix never appears in the fixed-stress approach. This observation reconciles previous results regarding the pressure stability of the splitting method. Using examples of compositional poromechanics with application to geological CO sequestration, we see that solutions obtained using the fixed-stress scheme with a low order finite element-finite volume discretization which is not inherently inf-sup stable can exhibit the same pressure oscillations obtained with the corresponding fully implicit scheme. Moreover, pressure jump stabilization can effectively remove these spurious oscillations in the fixed-stress setting, while also improving the efficiency of the scheme in terms of the number of iterations required at every time step to reach convergence.

42 ENGINEERING↗
DOE OSTI2026

REV-INR: Regularized Evidential Implicit Neural Representation for Uncertainty-Aware Volume Visualization

Applications of Implicit Neural Representations (INRs) have emerged as a promising deep learning approach for compactly representing large volumetric datasets. These models can act as surrogates for volume data, enabling efficient storage and on-demand reconstruction via model predictions. However, conventional deterministic INRs only provide value predictions without insights into the model’s prediction uncertainty or the impact of inherent noisiness in the data. This limitation can lead to unreliable data interpretation and visualization due to prediction inaccuracies in the reconstructed volume. Identifying erroneous results extracted from model-predicted data may be infeasible, as raw data may be unavailable due to its large size. To address this challenge, we introduce REV-INR, Regularized Evidential Implicit Neural Representation, which learns to predict data values accurately along with the associated coordinate-level data uncertainty and model uncertainty using only a single forward pass of the trained REV-INR during inference. By comprehensively comparing and contrasting REV-INR with existing well-established deep uncertainty estimation methods, we show that REV-INR achieves the best volume reconstruction quality with robust data (aleatoric) and model (epistemic) uncertainty estimates using the fastest inference time. Consequently, we demonstrate that REV-INR facilitates assessment of the reliability and trustworthiness of the extracted isosurfaces and volume visualization results, enabling analyses to be solely driven by model-predicted data.

Saklani, Shanu [Indian Institute of Technology, Ka↗
NASA NTRS1980

On the numerical solution of time-dependent viscous incompressible fluid flows involving solid boundaries

An inherent numerical problem associated with the fully explicit pseudospectral numerical simulation of the incompressible Navier-Stokes equation for viscous flows with no-slip walls is described. A semi-implicit scheme which circumvents this numerical difficulty is presented. In this algorithm the equation of continuity rather than the Poisson equation for pressure is solved directly. Pseudospectral formulation of the channel flow problem using Fourier series and Chebyshev polynomials expansions is given for this scheme. An example demonstrating the applicability of the method is given.

Moin, P.↗
NASA NTRS1980

The solution of variable-step implicit difference equations for dynamic systems analysis

A semi-implicit iterative technique is given for the solution of implicit matrix difference equations which arise in variable-step direct time integration of dynamic systems equations. For all practical purposes, the technique avoids repeated refactoring of the stepsize-dependent solution matrix and achieves the solution convergence for engineering accuracy requirements within a permissible number of iterations. Extension of the present method to nonlinear problems treated by the pseudo-force procedure is straightforward. For nonlinear solution procedures based on the tangent modulus formulation, the technique requires modification to make use of the tangent stiffness matrix. It is noted that the question of whether to include the nonlinear terms within the iteration loop has not yet been resolved.

Park, K. C.↗
NASA NTRS1989

Multi-grid for structures analysis

In structural analysis the amount of computational time necessary for a solution is proportional to the number of degrees of freedom times the bandwidth squared. In implicit time analysis, this must be done at each discrete point in time. If, in addition, the problem is nonlinear, then this solution must be iterated at each point in time. If the bandwidth is large, the size of the problem that can be analyzed is severely limited. The multi-grid method is a possible algorithm which can make this solution much more computationally efficient. This method has been used for years in computational fluid mechanics. It works on the fact that relaxation is very efficient on the high frequency components of the solution (nearest neighbor interactions) and not very good on low frequency components of the solution (far interactions). The multi-grid method is then to relax the solution on a particular model until the residual stops changing. This indicates that the solution contains the higher frequency components. A coarse model is then generated for the lower frequency components to the solution. The model is then relaxed for the lower frequency components of the solution. These lower frequency components are then interpolated to the fine model. In computational fluid mechanics the equations are usually expressed as finite differences.

Kascak, Albert F.↗
NASA NTRS1995

User's manual for the one-dimensional hypersonic experimental aero-thermodynamic (1DHEAT) data reduction code

A FORTRAN computer code for the reduction and analysis of experimental heat transfer data has been developed. This code can be utilized to determine heat transfer rates from surface temperature measurements made using either thin-film resistance gages or coaxial surface thermocouples. Both an analytical and a numerical finite-volume heat transfer model are implemented in this code. The analytical solution is based on a one-dimensional, semi-infinite wall thickness model with the approximation of constant substrate thermal properties, which is empirically corrected for the effects of variable thermal properties. The finite-volume solution is based on a one-dimensional, implicit discretization. The finite-volume model directly incorporates the effects of variable substrate thermal properties and does not require the semi-finite wall thickness approximation used in the analytical model. This model also includes the option of a multiple-layer substrate. Fast, accurate results can be obtained using either method. This code has been used to reduce several sets of aerodynamic heating data, of which samples are included in this report.

Hollis, Brian R.↗
NASA NTRS1987

A Diagonal Algorithm for the Method of Pseudocompressibility

The method of pseudocompressibility has been found to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The computing efficiency of these algorithms are compared. Identical solutions are obtained from both algorithms which compare well with experimental results.

Rogers, Stuart E.↗
NASA NTRS1985

High resolution TVD schemes using flux limiters

Roe (1981, 1985) has utilized flux limiters to obtain second order monotonicity preserving schemes. In the present paper, the foundation for flux limiters in the formulation of first order three-point schemes are discussed, and a systematic outline is provided of the method of using flux limiters to obtain second order accurate TVD schemes. Attention is given to Phi limiters, the Van Leer limiter, the Chakravarthy-Osher limiter, the linear advection equation and square wave data, the inviscid Burger's equation, and the extension of flux limiters to irregular grids, systems of equations, and implicit calculations.

Sweby, P. K.↗
NASA NTRS1989

A multigrid and upwind viscous flow solver on 3-D embedded and overlapped grids

A numerically efficient method is presented for solving the three-dimensional governing equations of the viscous compressible flow about complex configurations with topologically different components. The physical domain is decomposed into regions for which the grid generation is relatively simple and virtually with no significant restrictions. The Navier-Stokes equations are solved by an implicit, approximately factored, upwind, finite-volume scheme. The block inversions and the diagonalized scalar inversions of the coefficient matrices are modified to allow the holes created in the computational domain by the embedded and overlapped grids. The convergence is accelerated by a multigrid algorithm despite the existence of such holes. The solution for s supersonic flow past a blunt-nose-cylinder at high angle-of-attack is obtained using a C-O grid embedded in a global Cartesian grid.

Baysal, Oktay↗
NASA NTRS1992

Calculations of separated vortex flows at low speed for low-aspect-ratio wings

An implicit finite-difference scheme has been developed for solving three-dimensional incompressible Navier-Stokes equations. Computations for complicated vortical flows past several sharp- and round-edged delta and double-delta wings at high angles of attack and sideslip are discussed. Computed results demonstrate the effectiveness of the present method and show good agreement with experimental data.

Liu, C. H.↗
NASA NTRS2003

High Performance Parallel Methods for Space Weather Simulations

This is the final report of our NASA AISRP grant entitled 'High Performance Parallel Methods for Space Weather Simulations'. The main thrust of the proposal was to achieve significant progress towards new high-performance methods which would greatly accelerate global MHD simulations and eventually make it possible to develop first-principles based space weather simulations which run much faster than real time. We are pleased to report that with the help of this award we made major progress in this direction and developed the first parallel implicit global MHD code with adaptive mesh refinement. The main limitation of all earlier global space physics MHD codes was the explicit time stepping algorithm. Explicit time steps are limited by the Courant-Friedrichs-Lewy (CFL) condition, which essentially ensures that no information travels more than a cell size during a time step. This condition represents a non-linear penalty for highly resolved calculations, since finer grid resolution (and consequently smaller computational cells) not only results in more computational cells, but also in smaller time steps.

Hunter, Paul↗
NASA NTRS2007

DNA Recombinase Proteins, their Function and Structure in the Active Form, a Computational Study

Homologous recombination is a crucial sequence of reactions in all cells for the repair of double strand DNA (dsDNA) breaks. While it was traditionally considered as a means for generating genetic diversity, it is now known to be essential for restart of collapsed replication forks that have met a lesion on the DNA template (Cox et al., 2000). The central stage of this process requires the presence of the DNA recombinase protein, RecA in bacteria, RadA in archaea, or Rad51 in eukaryotes, which leads to an ATP-mediated DNA strand-exchange process. Despite many years of intense study, some aspects of the biochemical mechanism, and structure of the active form of recombinase proteins are not well understood. Our theoretical study is an attempt to shed light on the main structural and mechanistic issues encountered on the RecA of the e-coli, the RecA of the extremely radio resistant Deinococcus Radiodurans (promoting an inverse DNA strand-exchange repair), and the homolog human Rad51. The conformational changes are analyzed for the naked enzymes, and when they are linked to ATP and ADP. The average structures are determined over 2ns time scale of Langevian dynamics using a collision frequency of 1.0 ps(sup -1). The systems are inserted in an octahedron periodic box with a 10 Angstrom buffer of water molecules explicitly described by the TIP3P model. The corresponding binding free energies are calculated in an implicit solvent using the Poisson-Boltzmann solvent accessible surface area, MM-PBSA model. The role of the ATP is not only in stabilizing the interaction RecA-DNA, but its hydrolysis is required to allow the DNA strand-exchange to proceed. Furthermore, we extended our study, using the hybrid QM/MM method, on the mechanism of this chemical process. All the calculations were performed using the commercial code Amber 9.

Carra, Claudio↗
DOE OSTI2024

An Accelerated Clip Algorithm for Unstructured Meshes: A Batch-Driven Approach

The clip technique is a popular method for visualizing complex structures and phenomena within 3D unstructured meshes. Meshes can be clipped by specifying a scalar isovalue to produce an output unstructured mesh with its external surface as the isovalue. Similar to isocontouring, the clipping process relies on scalar data associated with the mesh points, including scalar data generated by implicit functions such as planes, boxes, and spheres, which facilitates the visualization of results interior to the grid. In this paper, we introduce a novel batch-driven parallel algorithm based on a sequential clip algorithm designed for high-quality results in partial volume extraction. Our algorithm comprises five passes, each progressively processing data to generate the resulting clipped unstructured mesh. The novelty lies in the use of fixed-size batches of points and cells, which enable rapid workload trimming and parallel processing, leading to a significantly improved memory footprint and run-time performance compared to the original version. On a 32-core CPU, the proposed batch-driven parallel algorithm demonstrates a run-time speed-up of up to 32.6x and a memory footprint reduction of up to 4.37x compared to the existing sequential algorithm. The software is currently available under an open-source license in the VTK visualization system.

Tsalikis, Spiros↗
DOE OSTI2025

Prediction of Redox Potentials for the Late Actinides Cm to Lr Using Electronic Structure Methods

Our previously developed computational method for calculating the aqueous redox potentials of the early actinides has been extended to the later elements in the actinide series: Cm, Bk, Cf, Es, Fm, Md, No, and Lr in multiple oxidation states. These calculations were performed using density functional theory with small-core pseudopotentials and their associated basis sets. Solvation effects were considered via a supermolecule-continuum approach, with 30 water molecules representing two solvation shells. Both the COSMO and SMD implicit solvation models were utilized. The structural parameters and hydration numbers for Cm(III), Bk(III), Bk(IV), and Cf(III) are in reasonable agreement with the available experimental data. For redox processes involving atomic cations in solution, the B3LYP/COSMO approach predicted redox potentials to within ±0.2 V of experiment for most redox couples, consistent with our prior work. Inclusion of spin-orbit corrections in specific redox pairs, especially those with the later actinides in high oxidation states, yields improved results relative to calculations including only scalar-relativistic corrections. The An +m /An(0) redox potentials were calculated using a Born-Haber cycle incorporating sublimation, ionization, and hydration energies. Due to a lack of experimental data, three sets of ionization energies were used for the Born-Haber cycle. The calculated An(III/0) potentials showed better agreement with experimental data when using the COSMO solvation model and the test set comprising the NIST recommended ionization energies. Furthermore, the Md(II/0) potential was better described with the SMD model, whereas No(II/0) was not well described by all methods. Finally, the computational approach was able to predict redox potentials that for most cases agreed with the current available experimental or estimated data.

Actinides↗
DOE OSTI2021

Well-balanced treatment of gravity in astrophysical fluid dynamics simulations at low Mach numbers

We report accurate simulations of flows in stellar interiors are crucial to improving our understanding of stellar structure and evolution. Because the typically slow flows are merely tiny perturbations on top of a close balance between gravity and the pressure gradient, such simulations place heavy demands on numerical hydrodynamics schemes. We demonstrate how discretization errors on grids of reasonable size can lead to spurious flows orders of magnitude faster than the physical flow. Well-balanced numerical schemes can deal with this problem. Three such schemes were applied in the implicit, finite-volume SEVEN-LEAGUE HYDRO code in combination with a low-Mach-number numerical flux function. We compare how the schemes perform in four numerical experiments addressing some of the challenges imposed by typical problems in stellar hydrodynamics. We find that the α-β and deviation well-balancing methods can accurately maintain hydrostatic solutions provided that gravitational potential energy is included in the total energy balance. They accurately conserve minuscule entropy fluctuations advected in an isentropic stratification, which enables the methods to reproduce the expected scaling of convective flow speed with the heating rate. The deviation method also substantially increases accuracy of maintaining stationary orbital motions in a Keplerian disk on long timescales. The Cargo–LeRoux method fares substantially worse in our tests, although its simplicity may still offer some merits in certain situations. Overall, we find the well-balanced treatment of gravity in combination with low Mach number flux functions essential to reproducing correct physical solutions to challenging stellar slow-flow problems on affordable collocated grids.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Learning Constrained Parametric Differentiable Predictive Control Policies With Guarantees

We present differentiable predictive control (DPC), a method for offline learning of constrained neural control policies for nonlinear dynamical systems with performance guarantees. We show that the sensitivities of the parametric optimal control problem can be used to obtain direct policy gradients. Specifically, we employ automatic differentiation (AD) to efficiently compute the sensitivities of the model predictive control (MPC) objective function and constraints penalties. To guarantee safety upon deployment, we derive probabilistic guarantees on closed-loop stability and constraint satisfaction based on indicator functions and Hoeffding’s inequality. We empirically demonstrate that the proposed method can learn neural control policies for various parametric optimal control tasks. In particular, we show that the proposed DPC method can stabilize systems with unstable dynamics, track time-varying references, and satisfy nonlinear state and input constraints. Our DPC method has practical time savings compared to alternative approaches for fast and memory-efficient controller design. Specifically, DPC does not depend on a supervisory controller as opposed to approximate MPC based on imitation learning. We demonstrate that, without losing performance, DPC is scalable with greatly reduced demands on memory and computation compared to implicit and explicit MPC while being more sample efficient than model-free reinforcement learning (RL) algorithms.

97 MATHEMATICS AND COMPUTING↗