Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING PROBLEMS”

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 577 records · Page 32

Generalized and High-Order Multiscale Finite-Element Methods for Seismic Wave Propagation [Slides]

We have developed a series of multiscale finite-element methods for simulating seismic wave propagation in complex media. The most important feature of multiscale finite-element methods is using medium- and mesh-dependent multiscale basis functions. For different wave equations, or for wave equation modeling in different domains, we design different local spectral/linear problems to compute multiscale basis functions. Multiscale basis functions can accurately capture the fine-scale medium information for coarse-scale modeling problems. Numerical examples have demonstrated the efficiency and accuracy of our multiscale finite-element method framework for wave equation modeling. Future works aim at further improving the efficiency using more levels of information encapsulation, and address more realistic physics problems.

58 GEOSCIENCES↗

Unigrid methods for boundary value problems with nonrectangular domains

Boundary value problems with nonrectangular domains were solved with unigrid methods. Unigrid was developed, its relationship to multigrid is described and some simple theory is presented. Its use is illustrated with a North Atlantic basin oceanographic model problem. It is demonstrated how unigrid (and, hence, multigrid) can be used efficiently with vector computers on problems with irregular domains.

Holland, W.↗

Analysis of harmonic spline gravity models for Venus and Mars

Methodology utilizing harmonic splines for determining the true gravity field from Line-Of-Sight (LOS) acceleration data from planetary spacecraft missions was tested. As is well known, the LOS data incorporate errors in the zero reference level that appear to be inherent in the processing procedure used to obtain the LOS vectors. The proposed method offers a solution to this problem. The harmonic spline program was converted from the VAX 11/780 to the Ridge 32C computer. The problem with the matrix inversion routine that improved inversion of the data matrices used in the Optimum Estimate program for global Earth studies was solved. The problem of obtaining a successful matrix inversion for a single rev supplemented by data for the two adjacent revs still remains.

Bowin, Carl↗

Quantifying the Uncertainty in Deterministic Phonon Transport Calculations of Thermal Conductivity using Polynomial Chaos Expansions

The nature of computational simulations requires the inclusion of an uncertainty analysis, as we have limited knowledge of all physically determined input parameters for a computationally simulated problem. We rely on uncertainty quantification (UQ) to characterize our confidence in the outcomes. Quantifying uncertainty can provide a basis for certifications in high-consequence decisions, such as nuclear reactor design, and is a fundamental component of model validation. We employ a previously developed method of uncertainty quantification, polynomial chaos expansion with stochastic collocation (PCE-SC), applied to deterministic phonon transport simulations. In these simulations, we use the neutron transport code Rattlesnake, which solves the Self-Adjoint Angular Flux (SAAF) formulation of the transport equation with a continuous finite element (CFEM) spatial discretization and discrete ordinates, spherical harmonics angular discretizations. Rattlesnake was developed in the multi-physics object oriented simulation environment (MOOSE) framework. We have previously shown Rattlesnake to be effective in simulating phonon transport. We aim to provide a deterministic phonon transport framework for heterogeneous nuclear fuel with fission product defects to predict thermal conductivity (?). A first principles, physics-based calculation of thermal conductivity must involve factors such as the microstructure of nuclear fuel, which constantly changes during the fission process through the formation of isotopic decay products. Heat transport in oxide nuclear fuels is dominated by phonon transport. Impurities in the bulk material influence the transport of energy at the fundamental level, altering the scattering behavior of phonons and electrons. Conventionally, heat transport follows classical physics based on the heat equation derived from Fourier's law q = -k∇T, where q is heat flux, k is thermal conductivity and ∇T is a temperature gradient. However, Fourier's law is a macroscopic empirical law in which the thermal conductivity? does not have a mechanistic connection to the underpinning heat transport processes. Thermal conductivity of a material depends both on the material's intrinsic ability to transport heat and a variety of resistive effects caused by defects in the material. Thus ab initio prediction of the macroscopic conductivity - the property of interest for safe reactor operation - requires simulating detailed processes of heat transport, and then determining the effective thermal conductivity of the simulated material from the resulting heat flux under the imposed temperature difference. The thermal conductivity of a bulk, homogeneous, dielectric material can be well estimated by the mechanistically derived expression: k{sub bulk} = 1/3 C{sub ν}νgλ (2), where C{sub ν}, νg, and λ are the volumetric specific heat, phonon speed, and phonon mean free path, respectively. In these problems the relevant parameter is the material's acoustic thickness, its characteristic distance L relative to the phonon mean free path λ. In Eq. (2) the largest source of uncertainty is λ. While propagating uncertainty in λ to uncertainty in k through Eq. (2) is trivial, systems with extrinsic scattering require more sophisticated approaches. At the microscopic level, uncertainty in λ changes both a material's intrinsic thermal conductivity. Our goal is to propagate the uncertainty in λ through the deterministic transport computation of k. Because there are a small number of uncertain input quantities, we use the method of polynomial chaos expansion (PCE), which expresses solutions in the form of spectral expansions of an uncertain variable. This approach combines both intrusive and nonintrusive methods of uncertainty propagation techniques and results in a unique formulation which is very effective and efficient for problems with few uncertain parameters. Uncertainty Quantification and Sensitivity Analysis We use PCE-SC to measure propagation of uncertainty in a 3-D phonon transport problem of homogeneous silicon, to compute the mean and variance in temperature, heat flux and thermal conductivity. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

On the Solution of the Three-Dimensional Flowfield About a Flow-Through Nacelle

The solution of the three dimensional flow field for a flow through nacelle was studied. Both inviscid and viscous inviscid interacting solutions were examined. Inviscid solutions were obtained with two different computational procedures for solving the three dimensional Euler equations. The first procedure employs an alternating direction implicit numerical algorithm, and required the development of a complete computational model for the nacelle problem. The second computational technique employs a fourth order Runge-Kutta numerical algorithm which was modified to fit the nacelle problem. Viscous effects on the flow field were evaluated with a viscous inviscid interacting computational model. This model was constructed by coupling the explicit Euler solution procedure with a flag entrainment boundary layer solution procedure in a global iteration scheme. The computational techniques were used to compute the flow field for a long duct turbofan engine nacelle at free stream Mach numbers of 0.80 and 0.94 and angles of attack of 0 and 4 deg.

Compton, William Bernard↗

Reduced-Order Modeling: New Approaches for Computational Physics

In this paper, we review the development of new reduced-order modeling techniques and discuss their applicability to various problems in computational physics. Emphasis is given to methods ba'sed on Volterra series representations and the proper orthogonal decomposition. Results are reported for different nonlinear systems to provide clear examples of the construction and use of reduced-order models, particularly in the multi-disciplinary field of computational aeroelasticity. Unsteady aerodynamic and aeroelastic behaviors of two- dimensional and three-dimensional geometries are described. Large increases in computational efficiency are obtained through the use of reduced-order models, thereby justifying the initial computational expense of constructing these models and inotivatim,- their use for multi-disciplinary design analysis.

Beran, Philip S.↗

New computer program solves wide variety of heat flow problems

Boeing Engineering Thermal Analyzer /BETA/ computer program uses numerical methods to provide accurate heat transfer solutions to a wide variety of heat flow problems. The program solves steady-state and transient problems in almost any situation that can be represented by a resistance-capacitance network.

Almond, J. C.↗

Flow simulations about steady-complex and unsteady moving configurations using structured-overlapped and unstructured grids

The limiting factor in simulating flows past realistic configurations of interest has been the discretization of the physical domain on which the governing equations of fluid flow may be solved. In an attempt to circumvent this problem, many Computational Fluid Dynamic (CFD) methodologies that are based on different grid generation and domain decomposition techniques have been developed. However, due to the costs involved and expertise required, very few comparative studies between these methods have been performed. In the present work, the two CFD methodologies which show the most promise for treating complex three-dimensional configurations as well as unsteady moving boundary problems are evaluated. These are namely the structured-overlapped and the unstructured grid schemes. Both methods use a cell centered, finite volume, upwind approach. The structured-overlapped algorithm uses an approximately factored, alternating direction implicit scheme to perform the time integration, whereas, the unstructured algorithm uses an explicit Runge-Kutta method. To examine the accuracy, efficiency, and limitations of each scheme, they are applied to the same steady complex multicomponent configurations and unsteady moving boundary problems. The steady complex cases consist of computing the subsonic flow about a two-dimensional high-lift multielement airfoil and the transonic flow about a three-dimensional wing/pylon/finned store assembly. The unsteady moving boundary problems are a forced pitching oscillation of an airfoil in a transonic freestream and a two-dimensional, subsonic airfoil/store separation sequence. Accuracy was accessed through the comparison of computed and experimentally measured pressure coefficient data on several of the wing/pylon/finned store assembly's components and at numerous angles-of-attack for the pitching airfoil. From this study, it was found that both the structured-overlapped and the unstructured grid schemes yielded flow solutions of comparable accuracy for these simulations. This study also indicated that, overall, the structured-overlapped scheme was slightly more CPU efficient than the unstructured approach.

Newman, James C., III↗

Post-Optimality Analysis In Aerospace Vehicle Design

This analysis pertains to the applicability of optimal sensitivity information to aerospace vehicle design. An optimal sensitivity (or post-optimality) analysis refers to computations performed once the initial optimization problem is solved. These computations may be used to characterize the design space about the present solution and infer changes in this solution as a result of constraint or parameter variations, without reoptimizing the entire system. The present analysis demonstrates that post-optimality information generated through first-order computations can be used to accurately predict the effect of constraint and parameter perturbations on the optimal solution. This assessment is based on the solution of an aircraft design problem in which the post-optimality estimates are shown to be within a few percent of the true solution over the practical range of constraint and parameter variations. Through solution of a reusable, single-stage-to-orbit, launch vehicle design problem, this optimal sensitivity information is also shown to improve the efficiency of the design process, For a hierarchically decomposed problem, this computational efficiency is realized by estimating the main-problem objective gradient through optimal sep&ivity calculations, By reducing the need for finite differentiation of a re-optimized subproblem, a significant decrease in the number of objective function evaluations required to reach the optimal solution is obtained.

Braun, Robert D.↗

Mars Surveyor '98 Landers MVACS Robotic Arm Control System Design Concepts

This paper describes the control system design concepts for the Mars Volatiles and Climate Surveyor (MVACS) Robotic Arm which supports the scientific investigations to be conducted as part of the Mars Surveyor '98 Lander project. Solutions are presented to some of the problems encountered in this demanding space application with its tight constraints on mass, power, volume, and computing resources. Problems addressed include 4-DOF forward and inverse kinematics, trajectory planning to minimize potential impact damage, joint drive train protection, Lander tilt prevention, hardware fault monitoring, and collision avoidance.

Bonitz, Robert G.↗

Post-optimality analysis in aerospace vehicle design

This analysis pertains to the applicability of optimal sensitivity information to aerospace vehicle design. The present analysis demonstrates that post-optimality information generated through first-order computations can be used to accurately predict file effect of constraint and parameter perturbations on the optimal solution. This assessment is based on the solution of an aircraft design problem in which the post-optimality estimates are shown to be within a few percent of the true solution over the practical range of constraint and parameter variations. Through solution of a reusable, single-stage-to-orbit, launch vehicle design problem, this optimal sensitivity information is also shown to improve the efficiency of the design process. For a hierarchically decomposed problem, this computational efficiency is realizable by estimating the main-problem objective gradient through optimal sensitivity calculations. By reducing the need for finite differentiation of a re-optimized subproblem, a significant decrease in the number of objective function evaluations required to reach the optimal solution is obtained.

Braun, Robert D.↗

Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems

We present an algorithm to compute the pseudospectral abscissa for a nonlinear eigenvalue problem. The algorithm relies on global under-estimator and over-estimator functions for the eigenvalue and singular value functions involved. These global models follow from eigenvalue perturbation theory. The algorithm has three particular features. First, it converges to the globally rightmost point of the pseudospectrum, and it is immune to nonsmoothness. The global convergence assertion is under the assumption that a global lower bound is available for the second derivative of a singular value function depending on one parameter. It may not be easy to deduce such a lower bound analytically, but assigning large negative values works robustly in practice. Second, it is applicable to large-scale problems since the dominant cost per iteration stems from computing the smallest singular value and associated singular vectors, for which efficient iterative solvers can be used. Furthermore, a significant increase in computational efficiency can be obtained by subspace acceleration, that is, by restricting the domains of the linear maps associated with the matrices involved to small but suitable subspaces, and solving the resulting reduced problems. Occasional restarts of these subspaces further enhance the efficiency for large-scale problems. Finally, in contrast to existing iterative approaches based on constructing low-rank perturbations and rightmost eigenvalue computations, the algorithm relies on computing only singular values of complex matrices. Hence, the algorithm does not require solutions of nonlinear eigenvalue problems, thereby further increasing efficiency and reliability. This work is accompanied by a robust implementation of the algorithm that is publicly available.

97 MATHEMATICS AND COMPUTING↗

A hybrid Monte Carlo-deterministic second moment method with efficient variance reduction

In this work, we present a hybrid method that combines Monte Carlo with deterministic finite element methods to solve a linear Boltzmann transport equation. Our hybrid method runs orders of magnitude faster than Monte Carlo, without sacrificing accuracy, for a proxy problem from radiative transfer that contains both optically-thick and optically-thin material. We believe that this is the first demonstration of a hybrid Second Moment Method in more than one spatial dimension, the first to consider more than one material, and the first to use variance reduction. Our variance reduction approach arises from an asymptotic analysis in which we show that the magnitude of the scattering source grows without bound. We transform the problem to compute the deviation of the radiation intensity from isotropy. The magnitude of the source in the transformed problem is bounded, and the quality of the hybrid method solution is dramatically improved by a substantial reduction in the variance.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Remarks on the construction of a second-order closure description of turbulent reacting flows

In this paper an attempt is made to illustrate how second-order closure techniques might be used to make detailed calculations of turbulent diffusion flames. Two of the problems of closure that are peculiar to turbulent chemically reacting flows are discussed in some detail. These are the problem of computing in a consistent way all the correlations of fluctuations in scalar quantities needed for closure and the problem of the generation of turbulence by chemical reactions. Tentative closure models are put forward for both of these problems. Although the closure model for fluctuations in scalar quantities can, to a certain extent, be checked against idealized numerical examples for which exact solutions are known, the validity of both the closure models proposed here must, in the end, be determined by detailed comparison of computed results with experimental data.

DONALDSON C. DUP.↗

A new implementation of the programming system for structural synthesis (PROSSS-2)

This new implementation of the PROgramming System for Structural Synthesis (PROSSS-2) combines a general-purpose finite element computer program for structural analysis, a state-of-the-art optimization program, and several user-supplied, problem-dependent computer programs. The results are flexibility of the optimization procedure, organization, and versatility of the formulation of constraints and design variables. The analysis-optimization process results in a minimized objective function, typically the mass. The analysis and optimization programs are executed repeatedly by looping through the system until the process is stopped by a user-defined termination criterion. However, some of the analysis, such as model definition, need only be one time and the results are saved for future use. The user must write some small, simple FORTRAN programs to interface between the analysis and optimization programs. One of these programs, the front processor, converts the design variables output from the optimizer into the suitable format for input into the analyzer. Another, the end processor, retrieves the behavior variables and, optionally, their gradients from the analysis program and evaluates the objective function and constraints and optionally their gradients. These quantities are output in a format suitable for input into the optimizer. These user-supplied programs are problem-dependent because they depend primarily upon which finite elements are being used in the model. PROSSS-2 differs from the original PROSSS in that the optimizer and front and end processors have been integrated into the finite element computer program. This was done to reduce the complexity and increase portability of the system, and to take advantage of the data handling features found in the finite element program.

Rogers, James L., Jr.↗

Domain decomposition algorithms and computation fluid dynamics

In the past several years, domain decomposition was a very popular topic, partly motivated by the potential of parallelization. While a large body of theory and algorithms were developed for model elliptic problems, they are only recently starting to be tested on realistic applications. The application of some of these methods to two model problems in computational fluid dynamics are investigated. Some examples are two dimensional convection-diffusion problems and the incompressible driven cavity flow problem. The construction and analysis of efficient preconditioners for the interface operator to be used in the iterative solution of the interface solution is described. For the convection-diffusion problems, the effect of the convection term and its discretization on the performance of some of the preconditioners is discussed. For the driven cavity problem, the effectiveness of a class of boundary probe preconditioners is discussed.

Chan, Tony F.↗

A QUBO formulation for top-τ eigencentrality nodes

The efficient calculation of the centrality or “hierarchy” of nodes in a network has gained great relevance in recent years due to the generation of large amounts of data. The eigenvector centrality (aka eigencentrality) is quickly becoming a good metric for centrality due to both its simplicity and fidelity. In this work we lay the foundations for solving the eigencentrality problem of ranking the importance of the nodes of a network with scores from the eigenvector of the network, using quantum computational paradigms such as quantum annealing and gate-based quantum computing. The problem is reformulated as a quadratic unconstrained binary optimization (QUBO) that can be solved on both quantum architectures. The results focus on correctly identifying a given number of the most important nodes in numerous networks given by the sparse vector solution of our QUBO formulation of the problem of identifying the top- τ highest eigencentrality nodes in a network on both the D-Wave and IBM quantum computers.

97 MATHEMATICS AND COMPUTING↗