Search NASA⌕ Search

SEARCH · Search NASA

Results for “explicit solution”

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 649 records · Page 36

AquaMEND: Reconciling multiple impacts of salinization on soil carbon biogeochemistry

Soil salinization, exacerbated by climate change, poses a global threat to coastal ecosystem function and soil quality. Salinity influences carbon cycling through direct effects on microbial activity and indirect alterations to soil physicochemical properties including cation exchange, pH, and soil organic carbon availability. Current models inadequately represent these complexities, relying on linear reduction functions that overlook specific physicochemical changes induced by salinity. To address this gap, we propose an integrated model framework, AquaMEND, that combines microbial-explicit carbon decomposition and geochemical models. This model allows cation exchange and surface complexation processes to capture solute chemistry and nutrient availability in soils upon saltwater intrusion. Using response functions that capture salinity impacts on both salt-sensitive and salt-resistant microbial processes, AquaMEND simulates how the abiotic and biotic mechanisms work individually and collectively to regulate organic and inorganic pools and fluxes. Here, the parallel structure of aqueous and non-aqueous phases, together with microbial functions, result in a versatile model for solving dynamic coupling of organics, minerals and microbes under various environmental settings.

54 ENVIRONMENTAL SCIENCES↗

The computation of optimal control programmes using a modified successive sweep method.

A second-order method for numerically solving control optimization problems has been developed. The method, referred to as the modified sweep method (MSM), differs from the successive sweep method (SSM) proposed by McReynolds and Bryson (1965) in that the conditions for local control optimality are used to determine the control as an explicit function of the state variables and time. The control is eliminated from the problem and the solution to the resulting two-point boundary value problem can be obtained by linear perturbation methods. The modified sweep method proposed here uncouples the perturbation equations for the state variables and the Lagrange multipliers by using a generalized matrix-Riccati transformation of variables. The resulting algorithm for the numerical iteration process is concerned with determining the initial values of a set of Lagrange multipliers rather than correcting a numerical control programme over the entire time interval of interest.

Colunga, D.↗

Numerical approximations to nonlinear conservation laws with locally varying time and space grids

Numerical approximations to the initial value problem for nonlinear systems of conservation laws are considered. The considered system is said to be hyperbolic when all eigenvalues of every real linear combination of the Jacobian matrices are real. Solutions may develop discontinuities in finite time, even when the initial data are smooth. In the investigation, explicit finite difference methods which use locally varying time grids are considered. The global CFL restriction is replaced by a local restriction. The numerical flux function is studied from a finite volume viewpoint, and a differencing technique is developed at interface points between regions of distinct time increments.

Osher, S.↗

On pressure boundary conditions for the incompressible Navier-Stokes equations using nonstaggered grids

Pressure boundary conditions satisfying the normal momentum equation at solid boundaries with second-order accuracy are developed. Implementation of these conditions in an explicit numerical procedure for the two-dimensional incompressible Navier-Stokes equations enables convergent and accurate solutions for the driven cavity problem provided that the integral constraint of the Neumann boundary condtions is satisfied.

Biringen, S.↗

Adaptive implicit-explicit and parallel element-by-element iteration schemes

Adaptive implicit-explicit (AIE) and grouped element-by-element (GEBE) iteration schemes are presented for the finite element solution of large-scale problems in computational mechanics and physics. The AIE approach is based on the dynamic arrangement of the elements into differently treated groups. The GEBE procedure, which is a way of rewriting the EBE formulation to make its parallel processing potential and implementation more clear, is based on the static arrangement of the elements into groups with no inter-element coupling within each group. Various numerical tests performed demonstrate the savings in the CPU time and memory.

Tezduyar, T. E.↗

A rigid line inclusion at a bimaterial interface

A solution is presented for the plane elastostatics problem of a rigid line inclusion at a bimaterial interface. Explicit expressions are derived for the complex potentials. The complex stress intensity factors at the tip of the rigid line are compared with those for the corresponding crack problem. It is found that the nature of the singularities differ. Furthermore, unlike the crack problem, the singularity for the rigid line inclusion depends on the stresses parallel to the interface.

Ballarini, Roberto↗

Evaluation of a multigrid-based Navier-Stokes solver for aerothermodynamic computations

A multigrid acceleration technique developed for solving the three-dimensional Navier-Stokes equations is used for computing high Mach number flows over configurations of practical interest. An explicit multistage Runge-Kutta type of time-stepping scheme is used as the basic algorithm. Solutions are presented for a spherically blunted cone at Mach 10 and a modified shuttle orbiter at Mach 6. The computed surface heat-transfer distributions are shown to compare favorably with the experimental data. Effect of grid-refinement on computed heat-transfer distributions is also examined to assess the numerical accuracy of the computed solutions. The rapid convergence rate associated with multigrid schemes in previous applications at transonic speeds is observed at the higher Mach number flows investigated here.

Vatsa, Veer N.↗

Comments regarding two upwind methods for solving two-dimensional external flows using unstructured grids

Steady flow over the leading portion of a multicomponent airfoil section is studied using computational fluid dynamics (CFD) employing an unstructured grid. To simplify the problem, only the inviscid terms are retained from the Reynolds-averaged Navier-Stokes equations - leaving the Euler equations. The algorithm is derived using the finite-volume approach, incorporating explicit time-marching of the unsteady Euler equations to a time-asymptotic, steady-state solution. The inviscid fluxes are obtained through either of two approximate Riemann solvers: Roe's flux difference splitting or van Leer's flux vector splitting. Results are presented which contrast the solutions given by the two flux functions as a function of Mach number and grid resolution. Additional information is presented concerning code verification techniques, flow recirculation regions, convergence histories, and computational resources.

Kleb, W. L.↗

A computational fluid dynamics simulation of the hypersonic flight of the Pegasus(TM) vehicle using an artificial viscosity model and a nonlinear filtering method

The computational fluid dynamics code, PARC3D, is tested to see if its use of non-physical artificial dissipation affects the accuracy of its results. This is accomplished by simulating a shock-laminar boundary layer interaction and several hypersonic flight conditions of the Pegasus(TM) launch vehicle using full artificial dissipation, low artificial dissipation, and the Engquist filter. Before the filter is applied to the PARC3D code, it is validated in one-dimensional and two-dimensional form in a MacCormack scheme against the Riemann and convergent duct problem. For this explicit scheme, the filter shows great improvements in accuracy and computational time as opposed to the nonfiltered solutions. However, for the implicit PARC3D code it is found that the best estimate of the Pegasus experimental heat fluxes and surface pressures is the simulation utilizing low artificial dissipation and no filter. The filter does improve accuracy over the artificially dissipative case but at a computational expense greater than that achieved by the low artificial dissipation case which has no computational time penalty and shows better results. For the shock-boundary layer simulation, the filter does well in terms of accuracy for a strong impingement shock but not as well for weaker shock strengths. Furthermore, for the latter problem the filter reduces the required computational time to convergence by 18.7 percent.

Mendoza, John Cadiz↗

Space Radiation Transport Code Development: 3DHZETRN

The space radiation transport code, HZETRN, has been used extensively for research, vehicle design optimization, risk analysis, and related applications. One of the simplifying features of the HZETRN transport formalism is the straight-ahead approximation, wherein all particles are assumed to travel along a common axis. This reduces the governing equation to one spatial dimension allowing enormous simplification and highly efficient computational procedures to be implemented. Despite the physical simplifications, the HZETRN code is widely used for space applications and has been found to agree well with fully 3D Monte Carlo simulations in many circumstances. Recent work has focused on the development of 3D transport corrections for neutrons and light ions (Z < 2) for which the straight-ahead approximation is known to be less accurate. Within the development of 3D corrections, well-defined convergence criteria have been considered, allowing approximation errors at each stage in model development to be quantified. The present level of development assumes the neutron cross sections have an isotropic component treated within N explicit angular directions and a forward component represented by the straight-ahead approximation. The N = 1 solution refers to the straight-ahead treatment, while N = 2 represents the bi-directional model in current use for engineering design. The figure below shows neutrons, protons, and alphas for various values of N at locations in an aluminum sphere exposed to a solar particle event (SPE) spectrum. The neutron fluence converges quickly in simple geometry with N > 14 directions. The improved code, 3DHZETRN, transports neutrons, light ions, and heavy ions under space-like boundary conditions through general geometry while maintaining a high degree of computational efficiency. A brief overview of the 3D transport formalism for neutrons and light ions is given, and extensive benchmarking results with the Monte Carlo codes Geant4, FLUKA, and PHITS are provided for a variety of boundary conditions and geometries. Improvements provided by the 3D corrections are made clear in the comparisons. Developments needed to connect 3DHZETRN to vehicle design and optimization studies will be discussed. Future theoretical development will relax the forward plus isotropic interaction assumption to more general angular dependence.

Wilson, John W.↗

Thermal Modelling of the in-Situ Consolidation of Automated Fiber Placement of Thermoplastic Composites

NASA is developing carbon fiber reinforced thermoplastic composites processing methods under the Hi-rate Composites Aircraft Manufacturing (HiCAM) project. The in-situ consolidation automated fiber placement (AFP) of thermoplastics (ICAT) process has high potential to increase manufacturing throughput and lower costs as it combines the repeatability and fast lay down rates of AFP with the thermoformability of thermoplastic materials to achieve part consolidation out of the autoclave. Physics-based process models are employed in the ICAT process development to understand, fundamentally, the thermal response of the carbon fiber (CF)/polyaryletherketone (PAEK) material during the rapid heating and cooling associated with laser-assisted AFP. A one-dimensional (1-D) closed-form model was developed capable of predicting the temperature profile through-the-thickness of the tape material. In addition, a two-dimensional (2-D) model was developed to predict the heat transfer through-the-thickness and in the laydown x-direction of the AFP head motion. The solution of the Fourier heat-transfer equations in the 2-D model is approximated using the explicit finite difference numerical method. The temperature profile during placement of PAEK slit-tape materials at various laser target temperatures and placement speeds were measured during ICAT process development trials at Electroimpact®, Inc. †† and the resulting experimental data is compared with the predictions of the 1-D and 2-D models.

Thermoplastics↗

Thermal Modelling of the In-Situ Consolidation of Automated Fiber Placement Of Thermoplastic Composites

NASA is developing carbon fiber reinforced thermoplastic composites processing methods under the Hi-rate Composites Aircraft Manufacturing (HiCAM) project. The in-situ consolidation automated fiber placement (AFP) of thermoplastics (ICAT) process has high potential to increase manufacturing throughput and lower costs as it combines the repeatability and fast lay down rates of AFP with the thermoformability of thermoplastic materials to achieve part consolidation out of the autoclave. Physics-based process models are employed in the ICAT process development to understand, fundamentally, the thermal response of the carbon fiber (CF)/polyaryletherketone (PAEK) material during the rapid heating and cooling associated with laser-assisted AFP. A one-dimensional (1-D) closed-form model was developed capable of predicting the temperature profile through-the-thickness of the tape material. In addition, a two-dimensional (2-D) model was developed to predict the heat transfer through-the-thickness and in the laydown x-direction of the AFP head motion. The solution of the Fourier heat-transfer equations in the 2-D model is approximated using the explicit finite difference numerical method. The temperature profile during placement of PAEK slit-tape materials at various laser target temperatures and placement speeds were measured during ICAT process development trials at Electroimpact®, Inc. †† and the resulting experimental data is compared with the predictions of the 1-D and 2-D models.

Christopher J. Stelter↗

The energy decay in self-preserving isotropic turbulence revisited

The assumption of self-preservation allows for an analytical determination of the energy decay in isotropic turbulence. Here, the self-preserving isotropic decay problem is analyzed, yielding a more complete picture of self-serving isotropic turbulence. It is proven rigorously that complete self-serving isotropic turbulence admits two general types of asymptotic solutions: one where the turbulent kinetic energy K approximately t (exp -1) and one where K approximately t (sup alpha) with an exponent alpha greater than 1 that is determined explicitly by the initial conditions. By a fixed point analysis and numerical integration of the exact one-point equations, it is demonstrated that the K approximately t (exp -1) and where K approximately t (sup -alpha) with an exponent alpha greater than 1 that is determined explicitly by the initial conditions. By a fixed point analysis and numerical integration of the exact one-point equations, it is demonstrated that the K approximately t (exp -1) power law decay is the asymptotically consistent high Reynolds number solution; the K approximately 1 (sup -alpha) decay law is only achieved in the limit as t yields infinity and the turbulence Reynolds number vanishes. Arguments are provided which indicate that a K approximately t (exp -1) power law decay is the asymptotic state toward which a complete self-preserving isotropic turbulence is driven at high Reynolds numbers in order to resolve the imbalance between vortex stretching and viscous diffusion.

Speziale, Charles G.↗

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗

WARP3D-Release 10.8: Dynamic Nonlinear Analysis of Solids using a Preconditioned Conjugate Gradient Software Architecture

This report describes theoretical background material and commands necessary to use the WARP3D finite element code. WARP3D is under continuing development as a research code for the solution of very large-scale, 3-D solid models subjected to static and dynamic loads. Specific features in the code oriented toward the investigation of ductile fracture in metals include a robust finite strain formulation, a general J-integral computation facility (with inertia, face loading), an element extinction facility to model crack growth, nonlinear material models including viscoplastic effects, and the Gurson-Tver-gaard dilatant plasticity model for void growth. The nonlinear, dynamic equilibrium equations are solved using an incremental-iterative, implicit formulation with full Newton iterations to eliminate residual nodal forces. The history integration of the nonlinear equations of motion is accomplished with Newmarks Beta method. A central feature of WARP3D involves the use of a linear-preconditioned conjugate gradient (LPCG) solver implemented in an element-by-element format to replace a conventional direct linear equation solver. This software architecture dramatically reduces both the memory requirements and CPU time for very large, nonlinear solid models since formation of the assembled (dynamic) stiffness matrix is avoided. Analyses thus exhibit the numerical stability for large time (load) steps provided by the implicit formulation coupled with the low memory requirements characteristic of an explicit code. In addition to the much lower memory requirements of the LPCG solver, the CPU time required for solution of the linear equations during each Newton iteration is generally one-half or less of the CPU time required for a traditional direct solver. All other computational aspects of the code (element stiffnesses, element strains, stress updating, element internal forces) are implemented in the element-by- element, blocked architecture. This greatly improves vectorization of the code on uni-processor hardware and enables straightforward parallel-vector processing of element blocks on multi-processor hardware.

Koppenhoefer, Kyle C.↗

Parallel 3D Multi-Stage Simulation of a Turbofan Engine

A 3D multistage simulation of each component of a modern GE Turbofan engine has been made. An axisymmetric view of this engine is presented in the document. This includes a fan, booster rig, high pressure compressor rig, high pressure turbine rig and a low pressure turbine rig. In the near future, all components will be run in a single calculation for a solution of 49 blade rows. The simulation exploits the use of parallel computations by using two levels of parallelism. Each blade row is run in parallel and each blade row grid is decomposed into several domains and run in parallel. 20 processors are used for the 4 blade row analysis. The average passage approach developed by John Adamczyk at NASA Lewis Research Center has been further developed and parallelized. This is APNASA Version A. It is a Navier-Stokes solver using a 4-stage explicit Runge-Kutta time marching scheme with variable time steps and residual smoothing for convergence acceleration. It has an implicit K-E turbulence model which uses an ADI solver to factor the matrix. Between 50 and 100 explicit time steps are solved before a blade row body force is calculated and exchanged with the other blade rows. This outer iteration has been coined a "flip." Efforts have been made to make the solver linearly scaleable with the number of blade rows. Enough flips are run (between 50 and 200) so the solution in the entire machine is not changing. The K-E equations are generally solved every other explicit time step. One of the key requirements in the development of the parallel code was to make the parallel solution exactly (bit for bit) match the serial solution. This has helped isolate many small parallel bugs and guarantee the parallelization was done correctly. The domain decomposition is done only in the axial direction since the number of points axially is much larger than the other two directions. This code uses MPI for message passing. The parallel speed up of the solver portion (no 1/0 or body force calculation) for a grid which has 227 points axially.

Turner, Mark G.↗

Algorithms for high aspect ratio oriented triangulations

Grid generation plays an integral part in the solution of computational fluid dynamics problems for aerodynamics applications. A major difficulty with standard structured grid generation, which produces quadrilateral (or hexahedral) elements with implicit connectivity, has been the requirement for a great deal of human intervention in developing grids around complex configurations. This has led to investigations into unstructured grids with explicit connectivities, which are primarily composed of triangular (or tetrahedral) elements, although other subdivisions of convex cells may be used. The existence of large gradients in the solution of aerodynamic problems may be exploited to reduce the computational effort by using high aspect ratio elements in high gradient regions. However, the heuristic approaches currently in use do not adequately address this need for high aspect ratio unstructured grids. High aspect ratio triangulations very often produce the large angles that are to be avoided. Point generation techniques based on contour or front generation are judged to be the most promising in terms of being able to handle complicated multiple body objects, with this technique lending itself well to adaptivity. The eventual goal encompasses several phases: first, a partitioning phase, in which the Voronoi diagram of a set of points and line segments (the input set) will be generated to partition the input domain; second, a contour generation phase in which body-conforming contours are used to subdivide the partition further as well as introduce the foundation for aspect ratio control, and; third, a Steiner triangulation phase in which points are added to the partition to enable triangulation while controlling angle bounds and aspect ratio. This provides a combination of the advancing front/contour techniques and refinement. By using a front, aspect ratio can be better controlled. By using refinement, bounds on angles can be maintained, while attempting to minimize the number of Steiner points.

Posenau, Mary-Anne K.↗

Implicit Kalman filtering

For an implicitly defined discrete system, a new algorithm for Kalman filtering is developed and an efficient numerical implementation scheme is proposed. Unlike the traditional explicit approach, the implicit filter can be readily applied to ill-conditioned systems and allows for generalization to descriptor systems. The implementation of the implicit filter depends on the solution of the congruence matrix equation (A1)(Px)(AT1) = Py. We develop a general iterative method for the solution of this equation, and prove necessary and sufficient conditions for convergence. It is shown that when the system matrices of an implicit system are sparse, the implicit Kalman filter requires significantly less computer time and storage to implement as compared to the traditional explicit Kalman filter. Simulation results are presented to illustrate and substantiate the theoretical developments.

Non-NASA Center↗