SEARCH · Engineering Papers

Results for “implicit storage”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

All sources NASA NTRS DOE OSTI

NASA NTRS1986

Application of program LAURA to three-dimensional AOTV flowfields

Program LAURA (Langley Aerothermodynamic Upwind Relaxation Algorithm) is a robust, finite volume, single-level storage, implicit upwind differencing algorithm which has been documented and tested on several three-dimensional blunt-body flows. The algorithm can run at unlimited Courant numbers (relaxing the steady-state equations) but requires the inversion of only a 5 x 5 matrix per computational cell. An alternating directional sweep Gauss-Seidel substitution strategy is used to relax the governing equations. At present, the Euler and thin-layer Navier-Stokes equations using Sutherland's law for viscosity have been modeled for a perfect gas, equilibrium air, and nonequilibrium air chemistry neglecting diffusion. The equilibrium and nonequilibrium air chemistry options have been described in a companion paper. Good comparisons with experimental data and another calculation method for pressure distributions, aerodynamic coefficients, and heat-transfer distributions have been demonstrated for three-dimensional blunt-body flows.

Gnoffo, P. A.↗

DOE OSTI2020

Solar Potential Analysis for the MISO Region

As part of the Minnesota Solar Pathways project, funded in part by the Department of Energy’s Solar Energy Technologies Office, Clean Power Research completed a scenario-based analysis that estimates and optimizes the levelized cost of capacity for high renewables penetrations across the entirety of the Midcontinent Independent System Operator (MISO) region. The analysis concludes that it can be cheaper to overbuild solar + wind and curtail surplus than to store all generation. The analysis described in this report was preceded by an analysis completed in 2018 that used the same modeling framework to optimize generation resources located only in Minnesota.

14 SOLAR ENERGY↗

NASA NTRS1989

Application of a lower-upper implicit scheme and an interactive grid generation for turbomachinery flow field simulations

A finite-volume lower-upper (LU) implicit scheme is used to simulate an inviscid flow in a tubine cascade. This approximate factorization scheme requires only the inversion of sparse lower and upper triangular matrices, which can be done efficiently without extensive storage. As an implicit scheme it allows a large time step to reach the steady state. An interactive grid generation program (TURBO), which is being developed, is used to generate grids. This program uses the control point form of algebraic grid generation which uses a sparse collection of control points from which the shape and position of coordinate curves can be adjusted. A distinct advantage of TURBO compared with other grid generation programs is that it allows the easy change of local mesh structure without affecting the grid outside the domain of independence. Sample grids are generated by TURBO for a compressor rotor blade and a turbine cascade. The turbine cascade flow is simulated by using the LU implicit scheme on the grid generated by TURBO.

Choo, Yung K.↗

NASA NTRS1989

Application of a lower-upper implicit scheme and an interactive grid generation for turbomachinery flow field simulations

A finite-volume lower-upper (LU) implicit scheme is used to simulate an inviscid flow in a turbine cascade. This approximate factorization scheme requires only the inversion of sparse lower and upper triangular matrices, which can be done efficiently without extensive storage. As an implicit scheme it allows a large time step to reach the steady state. An interactive grid generation program (TURBO), which is being developed, is used to generate grids. This program uses the control point form of algebraic grid generation which uses a sparse collection of control points from which the shape and position of coordinate curves can be adjusted. A distinct advantage of TURBO compared with other grid generation programs is that it allows the easy change of local mesh structure without affecting the grid outside the domain of dependence. Sample grids are generated by TURBO for a compressor rotor blade and a turbine cascade. The turbine cascade flow is simulated by using the LU implicit scheme on the grid generated by TURBO.

Choo, Yung K.↗

NASA NTRS1994

Development of advanced Navier-Stokes solver

The objective of research was to develop and validate new computational algorithms for solving the steady and unsteady Euler and Navier-Stokes equations. The end-products are new three-dimensional Euler and Navier-Stokes codes that are faster, more reliable, more accurate, and easier to use. The three-dimensional Euler and full/thin-layer Reynolds-averaged Navier-Stokes equations for compressible/incompressible flows are solved on structured hexahedral grids. The Baldwin-Lomax algebraic turbulence model is used for closure. The space discretization is based on a cell-centered finite-volume method augmented by a variety of numerical dissipation models with optional total variation diminishing limiters. The governing equations are integrated in time by an implicit method based on lower-upper factorization and symmetric Gauss-Seidel relaxation. The algorithm is vectorized on diagonal planes of sweep using two-dimensional indices in three dimensions. Convergence rates and the robustness of the codes are enhanced by the use of an implicit full approximation storage multigrid method.

Yoon, Seokkwan↗

NASA NTRS1998

Global Qualitative Flow-Path Modeling for Local State Determination in Simulation and Analysis

For qualitative modeling and analysis, a general qualitative abstraction of power transmission variables (flow and effort) for elements of flow paths includes information on resistance, net flow, permissible directions of flow, and qualitative potential is discussed. Each type of component model has flow-related variables and an associated internal flow map, connected into an overall flow network of the system. For storage devices, the implicit power transfer to the environment is represented by "virtual" circuits that include an environmental junction. A heterogeneous aggregation method simplifies the path structure. A method determines global flow-path changes during dynamic simulation and analysis, and identifies corresponding local flow state changes that are effects of global configuration changes. Flow-path determination is triggered by any change in a flow-related device variable in a simulation or analysis. Components (path elements) that may be affected are identified, and flow-related attributes favoring flow in the two possible directions are collected for each of them. Next, flow-related attributes are determined for each affected path element, based on possibly conflicting indications of flow direction. Spurious qualitative ambiguities are minimized by using relative magnitudes and permissible directions of flow, and by favoring flow sources over effort sources when comparing flow tendencies. The results are output to local flow states of affected components.

Malin, Jane T.↗

NASA NTRS1981

A diagonal form of an implicit approximate-factorization algorithm

A modification of an implicit approximate-factorization finite-difference algorithm applied to partial differential equations is presented. This algorithm is applied to the two- and three-dimensional Euler equations in general curvilinear coordinates. The modification transforms the coupled system of equations into an uncoupled diagonal form that requires less computational work. For steady-state applications, the resulting diagonal algorithm retains the stability and accuracy characteristics of the original algorithm. The diagonal algorithm reduces the storage requirement of the implicit solution process and therefore has an important effect on the application of implicit finite-difference schemes to vector processors. Results are presented for realistic two-dimensional transonic flow fields about airfoils. Computation costs are reduced to 24-34%.

Pulliam, T. H.↗

NASA NTRS1981

A Diagonal Form of an Implicit Approximate-Factorization Algorithm

Pulliam, T. H.↗

DOE OSTI2024

A high-order finite difference method for moving immersed domain boundaries and material interfaces

Here, we present a high-order sharp treatment of immersed moving domain boundaries and material interfaces, and apply it to the advection-diffusion equation in two and three dimensions. The spatial discretization combines dimension-split finite difference schemes with an immersed boundary treatment based on a weighted least-squares reconstruction of the solution, providing stable discretizations with up to sixth order accuracy for diffusion terms and third order accuracy for advection terms. The temporal discretization relies on a novel strategy for maintaining high-order temporal accuracy in problems with moving boundaries that minimizes implementation complexity and allows arbitrary explicit or diagonally-implicit Runge-Kutta schemes. The approach is broadly compatible with popular PDE-specialized Runge-Kutta time integrators, including low-storage, strong stability preserving, and diagonally implicit schemes. Through numerical experiments we demonstrate that the full discretization maintains high-order spatial and temporal accuracy in the presence of complex 3D geometries and for a range of boundary conditions, including Dirichlet, Neumann, and flux conditions with large jumps in coefficients.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1992

A transient FETI methodology for large-scale parallel implicit computations in structural mechanics

Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallelize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet -- and perhaps will never -- be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.

Farhat, Charbel↗

NASA NTRS1993

A transient FETI methodology for large-scale parallel implicit computations in structural mechanics, part 2

Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallellize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet and perhaps will never be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient than explicit codes when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.

Farhat, Charbel↗

NASA NTRS1993

Implicit transient finite element structural computations on MIMD systems - FETI vs. direct solvers

A domain decomposition method for implicit schemes that require significantly less storage and is several times faster than factorization algorithms is proposed. The transient domain decomposition method is an extension of the finite element tearing and interconnecting (FETI) method for the solution of static problems. Serial and parallel performance results obtained using the CRAY Y-MP/8 and the iPSC-860/128 systems demonstrate that the FETI method is superior to both serial and parallel direct methods.

Crivelli, Luis↗

NASA NTRS1987

Finite element solution techniques for large-scale problems in computational fluid dynamics

Element-by-element approximate factorization, implicit-explicit and adaptive implicit-explicit approximation procedures are presented for the finite-element formulations of large-scale fluid dynamics problems. The element-by-element approximation scheme totally eliminates the need for formation, storage and inversion of large global matrices. Implicit-explicit schemes, which are approximations to implicit schemes, substantially reduce the computational burden associated with large global matrices. In the adaptive implicit-explicit scheme, the implicit elements are selected dynamically based on element level stability and accuracy considerations. This scheme provides implicit refinement where it is needed. The methods are applied to various problems governed by the convection-diffusion and incompressible Navier-Stokes equations. In all cases studied, the results obtained are indistinguishable from those obtained by the implicit formulations.

Liou, J.↗

DOE OSTI2022

Automation of FARM from Alpha Phase to Beta Phase

Integrated energy systems (IES) combine different energy technologies in synergistic ways to achieve a more secure and economical energy supply. The RAVEN-based HYBRID framework and the RAVEN plugin for grid and capacity optimization (HERON) are used to find the optimal installed capacity and the optimal economical dispatch of each component of the IES, by respecting the limits on the production variables and the corresponding rates of variation (explicit constraints). Besides, there are other process variables whose evolution needs to be bounded to avoid damaging the components (e.g., condensers, heat exchangers, steam generators, etc.) or degrading the process efficiency (e.g., electrolysis in the hydrogen production process). To avoid violating these latter limits (implicit constraints), a proof-of-concept HERON validator based on Feasible Actuator Range Modifier (FARM-Alpha) was developed by Argonne National Laboratory in January 2021. This FARM-Alpha validator calculates the evolution of process variables on whom the implicit constraints are placed, and then provides feedback to HERON dispatcher to adjust the power setpoints of three IES components, i.e., Balance of Plant, Secondary Energy Source, and Thermal Energy Storage, so as to meet both the explicit and implicit constraints. FARM-Alpha was designed to assess the performance of FARM as a HERON validator only, i.e., the list of components and implicit operational constraints were hard-coded within the source code. The lack of flexibility of the corresponding software structure does not allow the deployment in production environment. This report describes the development and the implementation of an enhanced version of the FARM-based validator (FARM-Beta), which ensures more flexibility for the end user in modeling multiple IES configurations and scenarios. Several test cases of the power dispatch problem were then selected to demonstrate the capabilities offered by FARM-beta. The test cases illustrate the efficiency of the closed-loop optimization scheme and the capability to calculate set-point trajectories satisfying both explicit and implicit constraints.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2026

Multi-resolution enhancement for full-spectrum neural representations

Scientific data acquisition continues to outpace storage and analysis capabilities, making voxel-basedrepresentations increasingly intractable. Implicit neural representations (INRs) offer a promising solutionby encoding signals through coordinate-based neural networks, serving as surrogates of data, withcomputational and storage requirements scaling with network complexity rather than data dimensionality.However, smaller INRs struggle to faithfully represent multiscale structures, high-frequency informationand fine textures that constitute a large proportion of scientific measurements. We propose WIEN-INR, atheoretically guided hierarchical INR framework that distributes modelling across resolution scales andenables improved representation capacity through a novel enhancement network to recover subtle details.This multiscale architecture allows smaller networks to retain the full spatial-frequency content of thesignal as well as preserve training efficiency and lower storage cost. Evaluated on distinct raw experimentalmeasurements across scales and complexities, WIEN-INR represents a practical step towards a broaderadoption of neural representations in scientific workflows, delivering compact, robust and high-fidelityrepresentations.

Ni, Yuan [SLAC National Accelerator Laboratory (SL↗

NASA NTRS1991

A three dimensional multigrid multiblock multistage time stepping scheme for the Navier-Stokes equations

A general multiblock method for the solution of the three-dimensional, unsteady, compressible, thin-layer Navier-Stokes equations has been developed. The convective and pressure terms are spatially discretized using Roe's flux differencing technique while the viscous terms are centrally differenced. An explicit Runge-Kutta method is used to advance the solution in time. Local time stepping, adaptive implicit residual smoothing, and the Full Approximation Storage (FAS) multigrid scheme are added to the explicit time stepping scheme to accelerate convergence to steady state. Results for three-dimensional test cases are presented and discussed.

Elmiligui, Alaa↗

NASA NTRS1997

Massively Parallel and Scalable Implicit Time Integration Algorithms for Structural Dynamics

Farhat, Charbel↗

NASA NTRS1974

Transient analysis of a thermal storage unit involving a phase change material

The transient response of a single cell of a typical phase change material type thermal capacitor has been modeled using numerical conductive heat transfer techniques. The cell consists of a base plate, an insulated top, and two vertical walls (fins) forming a two-dimensional cavity filled with a phase change material. Both explicit and implicit numerical formulations are outlined. A mixed explicit-implicit scheme which treats the fin implicity while treating the phase change material explicitly is discussed. A band algorithmic scheme is used to reduce computer storage requirements for the implicit approach while retaining a relatively fine grid. All formulations are presented in dimensionless form thereby enabling application to geometrically similar problems. Typical parametric results are graphically presented for the case of melting with constant heat input to the base of the cell.

Griggs, E. I.↗