Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “problem”

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 379 records · Page 21

Robust parallel iterative solvers for linear and least-squares problems (Final Technical Report)

The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the problem of evaluating f(A)v which arises in statistical sampling. 11. As an application to the methods we developed, we tackled the problem of computing the diagonal of the inverse of a matrix. This arises in statistical applications as well as in many applications in physics. We explored probing methods as well as domain-decomposition type methods. 12. A collaboration with researchers from Toulouse, France, considered the important problem of computing the Schur complement in a domain-decomposition approach. 13. We explored new ways of preconditioning linear systems, based on low-rank approximations.

97 MATHEMATICS AND COMPUTING↗

Hydrodynamics challenge problem

The hydrodynamics challenge problem represents a classical HPC physics problem, namely high deformation event modeling via Lagrangian shock hydrodynamics. This challenge problem solves the Sedov blast wave problem for one material in three dimensions. The problem has an analytic solution, and can be scaled to arbitrarily large problem sizes. The reference code is drawn from a production LLNL hydrodynamics code.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

(U) A General-Purpose Code for Correlated Sampling Using Batch Statistics with MCNP6 for Fixed-Source Problems

Correlated sampling can be used to reduce the uncertainty of a difference of tallies by taking advantage of the negative covariance term in the sandwich formula. Booth first showed how correlated sampling can be applied with batch statistics using MCNP’s tally fluctuation chart (TFC) to reduce the uncertainty of a difference of tallies in fixed-source problems. Booth presented a problem in which a 1273% uncertainty in a difference was reduced to 8% by accounting for correlations. Researchers He and Su recently studied correlated sampling using the TFC in MCNP version 5. They determined that the code did not print enough digits in the TFC tally means for accurate batch statistics in some cases. After modifying the source code, they concluded that “correlated sampling can yield a standard deviation of about one magnitude smaller than that predicted by the direct, un-correlated simulation when the changes in system response are small (say about 1%), which is equivalent to saving in CPU time by a factor of 100. Such saving [sic] becomes less significant as the change in system response becomes larger.” He and Su provided the formulas needed to apply batch statistics to compute the correlated uncertainty of a difference of tallies. In this report, we follow up on their work by providing the formulas needed to apply batch statistics to compute the correlated uncertainty of a ratio of tallies and of a difference of two tallies divided by a third tally. We extend these formulas to differences and ratios of ratios. These formulas are applied to reduce the uncertainty associated with calculating a relative sensitivity. He and Su did not investigate the accuracy of their correlated sampling uncertainty estimates. We use their test problems and evaluate the accuracy of the uncertainty estimates by comparing with results obtained from random sampling, and, in simple cases, with theoretical values of the “exact” uncertainties. We find that the uncertainties obtained from batch statistics are accurate as long as at least 100 batches are used. We present a new computer code, COSUBS (COrrelated Sampling Using Batch Statistics), that reads MCNP6 TFCs and applies correlated sampling using batch statistics for the tally combinations that the user specifies. COSUBS is a very general tool that compares all TFCs for a base case and one or two perturbed cases. It computes uncertainties for ratios if given only a base case. This report is organized as follows. The equations to apply batch statistics to the difference of random tallies are reviewed in Sec. II. Section III presents the equations for applying batch statistics to a ratio of random tallies; this is useful for computing relative sensitivities using a one-sided finite difference and the relative sensitivity using the differential operator method. Section IV presents the equations for applying batch statistics to a difference of two random tallies divided by a third; this is useful for computing a relative sensitivities using a central difference. Section V presents the equations for applying batch statistics to a difference of two ratios with four random tallies. Section VI presents the equations for applying batch statistics to a one-sided finite difference estimate of the relative sensitivity of a ratio (this uses four random tallies). Section VII presents the equations for applying batch statistics to a central difference estimate of the relative sensitivity of a ratio (this uses six random tallies). Section VIII presents the equations for applying batch statistics to a sum of random tallies. Section IX discusses how to apply batch statistics using MCNP6. Section X presents COSUBS, describing its command-line options and logic. Sections XI through XVI present numerical results for various test problems. Section XVII is a summary and conclusions. Appendix A derives the theoretical Monte Carlo tally variance given certain assumptions; these variances are used to verify the batch statistics for some of the problems. Appendix B lists the MCNP6 input for the unperturbed example problem. Appendix C presents modifications made to MCNP6.3 to support this work.

97 MATHEMATICS AND COMPUTING↗

VERA Core Physics Benchmark Progression Problem Results for VERA 3.6

This report contains a comparison of results obtained with VERA 3.6 Release Candidate 0 for the Core Physics Benchmark Progression Problems 1 through 9 to both computational tools and measured data from Watts Bar Unit 1 (WBN1). (Ref. 1 and Ref. 2) These problems progress from single pin cell analyses to full core depletion calculations. VERA results obtained for Problems 1 through 5 are compared against results obtained using the SCALE 6.2 Beta code KENO-VI. Results for Problem 6 and 7 are compared against those obtained using a coupled neutronic and thermal-hydraulic combination of the KAPL software MC21 and the CASL tool CTF. (Ref. 3, Ref. 4 and Ref. 5) VERA results from problems 5 and 9 are compared to data from WBN1. For all of the analyses contained in this report, VERA provided similar results to other state-of-the-art software programs and real reactor data. This indicates that the program is capable of modeling a full-scale PWR in a more discretized and computationally efficient manner than any other reactor physics program. Since the descriptions of the Core Physics Benchmark Progression Problems and the logic behind their selection is discussed in-depth elsewhere it is not covered in the scope of this document. Additionally, in-depth discussions of the software programs used in this analysis are not provided for the same rationale.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Quantitative Analysis of the Principal-Agent Problem in Commercial Buildings in the U.S.: Focus on Central Space Heating and Cooling

We investigate the existence of the principal-agent (PA) problem in non-government, non-mall commercial buildings in the U.S. in 2003. The analysis concentrates on space heating and cooling energy consumed by centrally installed equipment in order to verify whether a market failure caused by the PA problem might have prevented the installation of energy-efficient devices in non-owner-occupied buildings (efficiency problem) and/or the efficient operation of space-conditioning equipment in these buildings (usage problem). Commercial Buildings Energy Consumption Survey (CBECS) 2003 data for single-owner, single-tenant and multi-tenant occupied buildings were used for conducting this evaluation. These are the building subsets with the appropriate conditions for assessing both the efficiency and the usage problems. Together, these three building types represent 51.9percent of the total floor space of all buildings with space heating and 59.4percent of the total end-use energy consumption of such buildings; similarly, for space cooling, they represent 52.7percent of floor space and 51.6percent of energy consumption. Our statistical analysis shows that there is a usage PA problem. In space heating it applies only to buildings with a small floor area (<_50,000 sq. ft.). We estimate that in 2003 it accounts for additional site energy consumption of 12.3 (+ 10.5 ) TBtu (primary energy consumption of 14.6 [+- 12.4] TBtu), corresponding to 24.0percent (+- 20.5percent) of space heating and 10.2percent (+- 8.7percent) of total site energy consumed in those buildings. In space cooling, however, the analysis shows that the PA market failure affects the complete set of studied buildings. We estimate that it accounts for a higher site energy consumption of 8.3 (+-4.0) TBtu (primary energy consumption of 25.5 [+- 12.2]TBtu), which corresponds to 26.5percent (+- 12.7percent) of space cooling and 2.7percent (+- 1.3percent) of total site energy consumed in those buildings.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Comparison of Multi-Objective Evolutionary Algorithms to Solve the Modular Cell Design Problem for Novel Biocatalysis

A large space of chemicals with broad industrial and consumer applications could be synthesized by engineered microbial biocatalysts. However, the current strain optimization process is prohibitively laborious and costly to produce one target chemical and often requires new engineering efforts to produce new molecules. To tackle this challenge, modular cell design based on a chassis strain that can be combined with different product synthesis pathway modules has recently been proposed. This approach seeks to minimize unexpected failure and avoid task repetition, leading to a more robust and faster strain engineering process. In our previous study, we mathematically formulated the modular cell design problem based on the multi-objective optimization framework. In this study, we evaluated a library of state-of-the-art multi-objective evolutionary algorithms (MOEAs) to identify the most effective method to solve the modular cell design problem. Using the best MOEA, we found better solutions for modular cells compatible with many product synthesis modules. Furthermore, the best performing algorithm could provide better and more diverse design options that might help increase the likelihood of successful experimental implementation. We identified key parameter configurations to overcome the difficulty associated with multi-objective optimization problems with many competing design objectives. Interestingly, we found that MOEA performance with a real application problem, e.g., the modular strain design problem, does not always correlate with artificial benchmarks. Overall, MOEAs provide powerful tools to solve the modular cell design problem for novel biocatalysis.

Garcia, Sergio (ORCID:000000023998986X)↗

State space approach to mixed boundary value problems.

A state-space procedure for the formulation and solution of mixed boundary value problems is established. This procedure is a natural extension of the method used in initial value problems; however, certain special theorems and rules must be developed. The scope of the applications of the approach includes beam, arch, and axisymmetric shell problems in structural analysis, boundary layer problems in fluid mechanics, and eigenvalue problems for deformable bodies. Many classical methods in these fields developed by Holzer, Prohl, Myklestad, Thomson, Love-Meissner, and others can be either simplified or unified under new light shed by the state-variable approach. A beam problem is included as an illustration.

Chen, C. F.↗

Conjugate quasilinear Dirichlet and Neumann problems and a posteriori error bounds

Quasilinear Dirichlet and Neumann problems on a rectangle D with boundary D prime are considered. Using these concepts, conjugate problems, that is, a pair of one Dirichlet and one Neumann problem, the minima of the energies of which add to zero, are introduced. From the concept of conjugate problems, two-sided bounds for the energy of the exact solution of any given Dirichlet or Neumann problem are constructed. These two-sided bounds for the energy at the exact solution are in turn used to obtain a posteriori error bounds for the norm of the difference of the approximate and exact solutions of the problem. These bounds do not involve the unknown exact solution and are easily constructed numerically.

Lavery, J. E.↗

The crack-contact and the free-end problem for a strip under residual stress

The plane problem for an infinite strip with two edge cracks under a given state of residual stress is considered. The residual stress is compressive near and at the surfaces and tensile in the interior of the strip. If the crack is deep enough to penetrate into the tensile zone, then the problem is one of crack-contact where the depth of the contact area is an unknown which depends on the crack depth and the residual stress profile. The problem has applications to the static fatigue of glass plates and is solved for three typical residual-stress profiles. In the limiting case of the crack's crossing the entire plate thickness, the problem becomes a stressfree end problem for a semiinfinite strip under a given residual-stress state away from the end. This is a typical stress diffusion problem in which decay behavior of the residual stress near and the nature of the normal displacement at the end of the semiinfinite strip are of special interest. For two typical residual-stress states the solution is obtained, and some numerical results are given.

Bakioglu, M.↗

Nonlinear singularly perturbed optimal control problems with singular arcs

A third order, nonlinear, singularly perturbed optimal control problem is considered under assumptions which assure that the full problem is singular and the reduced problem is nonsingular. The separation between the singular arc of the full problem and the optimal control law of the reduced one, both of which are hypersurfaces in state space, is of the same order as the small parameter of the problem. Boundary layer solutions are constructed which are stable and reach the outer solution in a finite time. A uniformly valid composite solution is then formed from the reduced and boundary layer solutions. The value of the approximate solution is that it is relatively easy to obtain and does not involve singular arcs. To illustrate the utility of the results, the technique is used to obtain an approximate solution of a simplified version of the aircraft minimum time-to-climb problem. A numerical example is included.

Ardema, M. D.↗

A well posed boundary value problem in transonic gas dynamics

A new approach considered by Garabedian and Korn (1976) to solve a problem of airfoil design has led to a transonic boundary value problem. It remains to be shown that this problem is well posed. A description is presented of an investigation in which it is shown that a corresponding problem for the Tricomi equation is well posed. The solution to the boundary value problem is characterized, in a unique way, as a sum of two particular solutions. The Poisson formulas for the unit semicircle for the Euler-Poisson-Darboux equation are considered and reflection laws for solutions of the general Euler-Poisson-Darboux equation are established. It is proved that the considered boundary value problem for the case in which the involved function is periodic and continuous is well posed within the specified class of solutions.

Sanz, J. M.↗

Clarification process: Resolution of decision-problem conditions

A model of a general process which occurs in both decisionmaking and problem-solving tasks is presented. It is called the clarification model and is highly dependent on information flow. The model addresses the possible constraints of individual indifferences and experience in achieving success in resolving decision-problem conditions. As indicated, the application of the clarification process model is only necessary for certain classes of the basic decision-problem condition. With less complex decision problem conditions, certain phases of the model may be omitted. The model may be applied across a wide range of decision problem conditions. The model consists of two major components: (1) the five-phase prescriptive sequence (based on previous approaches to both concepts) and (2) the information manipulation function (which draws upon current ideas in the areas of information processing, computer programming, memory, and thinking). The two components are linked together to provide a structure that assists in understanding the process of resolving problems and making decisions.

Dieterly, D. L.↗

Decision-problem state analysis methodology

A methodology for analyzing a decision-problem state is presented. The methodology is based on the analysis of an incident in terms of the set of decision-problem conditions encountered. By decomposing the events that preceded an unwanted outcome, such as an accident, into the set of decision-problem conditions that were resolved, a more comprehensive understanding is possible. All human-error accidents are not caused by faulty decision-problem resolutions, but it appears to be one of the major areas of accidents cited in the literature. A three-phase methodology is presented which accommodates a wide spectrum of events. It allows for a systems content analysis of the available data to establish: (1) the resolutions made, (2) alternatives not considered, (3) resolutions missed, and (4) possible conditions not considered. The product is a map of the decision-problem conditions that were encountered as well as a projected, assumed set of conditions that should have been considered. The application of this methodology introduces a systematic approach to decomposing the events that transpired prior to the accident. The initial emphasis is on decision and problem resolution. The technique allows for a standardized method of accident into a scenario which may used for review or the development of a training simulation.

Dieterly, D. L.↗

Crack problems for a rectangular plate and an infinite strip

The general plane problem for an infinite strip containing multiple cracks perpendicular to its boundaries is considered. The problem is reduced to a system of singular integral equations. Two specific problems of practical interest are then studied in detail. The first problem explores the interaction effect of multiple edge cracks in a plate or beam under tension or bending. The second problem is that of a rectangular plate containing an arbitrarily oriented crack in the plane of symmetry. Particular emphasis is placed on the problem of a plate containing an edge crack and subjected to concentrated forces.

Civelek, M. B.↗

An investigation of the accuracy of finite difference methods in the solution of linear elasticity problems

The accuracy of the finite difference method in the solution of linear elasticity problems that involve either a stress discontinuity or a stress singularity is considered. Solutions to three elasticity problems are discussed in detail: a semi-infinite plane subjected to a uniform load over a portion of its boundary; a bimetallic plate under uniform tensile stress; and a long, midplane symmetric, fiber reinforced laminate subjected to uniform axial strain. Finite difference solutions to the three problems are compared with finite element solutions to corresponding problems. For the first problem a comparison with the exact solution is also made. The finite difference formulations for the three problems are based on second order finite difference formulas that provide for variable spacings in two perpendicular directions. Forward and backward difference formulas are used near boundaries where their use eliminates the need for fictitious grid points.

Bauld, N. R., Jr.↗

Elasticity solutions for a class of composite laminate problems with stress singularities

A study on the fundamental mechanics of fiber-reinforced composite laminates with stress singularities is presented. Based on the theory of anisotropic elasticity and Lekhnitskii's complex-variable stress potentials, a system of coupled governing partial differential equations are established. An eigenfunction expansion method is introduced to determine the orders of stress singularities in composite laminates with various geometric configurations and material systems. Complete elasticity solutions are obtained for this class of singular composite laminate mechanics problems. Homogeneous solutions in eigenfunction series and particular solutions in polynomials are presented for several cases of interest. Three examples are given to illustrate the method of approach and the basic nature of the singular laminate elasticity solutions. The first problem is the well-known laminate free-edge stress problem, which has a rather weak stress singularity. The second problem is the important composite delamination problem, which has a strong crack-tip stress singularity. The third problem is the commonly encountered bonded composite joints, which has a complex solution structure with moderate orders of stress singularities.

Wang, S. S.↗

Necessary conditions for maximax problems with application to aeroglide of hypervelocity vehicles

This paper presents the necessary conditions for solving Chebyshev minimax (or maximax) problems with bounded control. The jump conditions obtained are applicable to problems with single or multiple maxima. By using Contensou domain of maneuverability, it is shown that when the maxima are isolated single points the control is generally continuous at the jump point in the minimax problems and discontinuous in the maximax problems in which the first time derivative of the maximax function contains the control variable. The theory is applied to the problem of maximizing the flight radius in a closed circuit glide of a hypervelocity vehicle and to a maximax optimal control problem in which the control appears explicitly with the first time derivative of the maximax function.

Vinh, N. X.↗

Flight problem evaluation for Space Shuttle Orbiter

The flight problems experienced with the reusable Space Shuttle Orbiter have decreased during subsequent flights of each vehicle. By comparison to first flights of previous vehicles, the problems encountered on the initial flight of each new vehicle entering the fleet decreased. This improvement in turn has reduced the turnaround time between flights significantly and thus greatly enhanced the increased Space Shuttle launch frequency. The reusable manned space vehicle concept necessitated the development of a flight problem recognition and resolution system which would enable a thorough and timely vehicle turnaround flow. Flight evaluation, testing, and repair of manned spacecraft to enhance reliability and to ensure mission success is a unique activity. Real-time recognition of the flight problem, prompt isolation of the cause, and timely implementation of the corrective action are the keys to maintaining an operational fleet. Examples of flight problems that have been encountered as well as the corrective actions implemented during the first 24 Space Shuttle missions are presented. The corrective actions taken to preclude problem recurrence include modifications of hardware designs, manufacturing processes, flight software, test methods, and operational procedures.

Mechelay, Joseph E.↗