Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “discrete optimization”

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 793 records · Page 44

Fast Multilevel Solvers for a Class of Discrete Fourth Order Parabolic Problems

In this paper, we study fast iterative solvers for the solution of fourth order parabolic equations discretized by mixed finite element methods. We propose to use consistent mass matrix in the discretization and use lumped mass matrix to construct efficient preconditioners. We provide eigenvalue analysis for the preconditioned system and estimate the convergence rate of the preconditioned GMRes method. Furthermore, we show that these preconditioners only need to be solved inexactly by optimal multigrid algorithms. Our numerical examples indicate that the proposed preconditioners are very efficient and robust with respect to both discretization parameters and diffusion coefficients. We also investigate the performance of multigrid algorithms with either collective smoothers or distributive smoothers when solving the preconditioner systems.

97 MATHEMATICS AND COMPUTING↗

Compact Packaging of Photonic Millimeter-Wave Receiver

A carrier structure made from a single silicon substrate is the basis of a compact, lightweight, relatively inexpensive package that holds the main optical/electronic coupling components of a photonic millimeter-wave receiver based on a lithium niobate resonator disk. The design of the package is simple and provides for precise relative placement of optical components, eliminating the need for complex, bulky positioning mechanisms like those commonly used to align optical components to optimize focus and coupling. Although a prototype of the package was fabricated as a discrete unit, the design is amenable to integration of the package into a larger photonic and/or electronic receiver system. The components (see figure) include a lithium niobate optical resonator disk of 5-mm diameter and .200- m thickness, positioned adjacent to a millimeter- wave resonator electrode. Other components include input and output coupling prisms and input and output optical fibers tipped with ball lenses for focusing and collimation, respectively. Laser light is introduced via the input optical fiber and focused into the input coupling prism. The input coupling prism is positioned near (but not in contact with) the resonator disk so that by means of evanescent-wave coupling, the input laser light in the prism gives rise to laser light propagating circumferentially in guided modes in the resonator disk. Similarly, a portion of the circumferentially propagating optical power is extracted from the disk by evanescent-wave coupling from the disk to the output coupling prism, from whence the light passes through the collimating ball lens into the output optical fiber. The lens-tipped optical fibers must be positioned at a specified focal distance from the prisms. The optical fibers and the prisms must be correctly positioned relative to the resonator disk and must be oriented to obtain the angle of incidence (55 in the prototype) required for evanescent-wave coupling of light into and out of the desired guided modes in the resonator disk. To satisfy all these requirements, precise alignment features are formed in the silicon substrate by use of a conventional wet-etching process. These features include a 5-mm-diameter, 50- m-deep cavity that holds the disk; two trapezoidal-cross-section recesses for the prisms; and two grooves that hold the optical fibers at the correct positions and angles relative to the prisms and disk. The fiber grooves contain abrupt tapers, near the prisms, that serve as hard stops for positioning the lenses at the focal distance from the prisms. There are also two grooves for prismadjusting rods. The design provides a little slack in the prism recesses for adjusting the positions of the prisms by means of these rods to optimize the optical coupling.

Nguyen, Hung↗

Integral dose investigation of non-coplanar treatment beam geometries in radiotherapy

Purpose: Automated planning and delivery of non-coplanar plans such as 4π radiotherapy involving a large number of fields have been developed to take advantage of the newly available automated couch and gantry on C-arm gantry linacs. However, there is an increasing concern regarding the potential changes in the integral dose that needs to be investigated. Methods: A digital torso phantom and 22 lung and liver stereotactic body radiation therapy (SBRT) patients were included in the study. The digital phantom was constructed as a water equivalent elliptical cylinder with a major axis length of 35.4 cm and minor axis of 23.6 cm. A 4.5 cm diameter target was positioned at varying depths along the major axis. Integral doses from intensity modulated, non-coplanar beams forming a conical pattern were compared against the equally spaced coplanar beam plans. Integral dose dependence on the phantom geometry and the beam number was also quantified. For the patient plans, the non-coplanar and coplanar beams and fluences were optimized using a column generation and pricing approach and compared against clinical VMAT plans using two full (lung) or partial coplanar arcs (liver) entering at the side proximal to the tumor. Both the average dose to the normal tissue volume and the total volumes receiving greater than 2 Gy (V2) and 5 Gy (V5) were evaluated and compared. Results: The ratio of integral dose from the non-coplanar and coplanar plans depended on the tumor depth for the phantom; for tumors shallower than 10 cm, the non-coplanar integral doses were lower than coplanar integral doses for non-coplanar angles less than 60°. Similar patterns were observed in the patient plans. The smallest non-coplanar integral doses were observed for tumor 6–8 cm deep. For the phantom, the integral dose was independent of the number of beams, consistent with the liver SBRT patients but the lung SBRT patients showed slight increase in the integral dose when more beams were used. Larger tumor size and larger patient body size did not change the overall relationship of integral doses between non-coplanar and coplanar cases. However, the thin disk-shaped tumor received at least 40% greater integral doses with the non-coplanar plans. Overall, patient non-coplanar integral doses and V5 were comparable to those of coplanar doses from the same optimization engine and 15%–20% lower than state of the art VMAT plans. However, non-coplanar beams significantly increased V2 in both the phantom and patients. On average, the lung and liver SBRT patient normal tissue volumes receiving dose greater than 2 Gy were increased by 749 and 532 cm{sup 3}, respectively. Conclusions: The authors used a digital phantom simulating a patient torso and 22 SBRT patients to show that the integral doses from the plans employing optimized non-coplanar beams are comparable to those of the coplanar plans using an equal number of discrete beams and are significantly lower than those of VMAT plans. The non-coplanar beams expose a larger normal tissue volume to non-zero doses, whose impact will need to be evaluated individually to determine the risk/benefit ratio of the non-coplanar plans.

61 RADIATION PROTECTION AND DOSIMETRY↗

High-Fidelity Multidisciplinary Sensitivity Analysis Framework for Multipoint Rotorcraft Optimization

A multidisciplinary, gradient-based sensitivity-analysis methodology is evaluated for optimization of rotorcraft configurations. The tightly coupled discipline models include physics-based fluid dynamics and rotorcraft comprehensive analysis. A discretely-consistent adjoint method accounts for sensitivities of the unsteady flow and unstructured, dynamic, over set grids, while sensitivities of structural responses to aerodynamic loads are computed using a complex-variable method. The methodology is applied to optimize the shape of UH-60A Blackhawk helicopter blades for hover and forward flight conditions. The objective of the multipoint design is to simultaneously increase the rotorcraft figure of merit in a hover flight and reduce the rotor power in a forward flight. Trimmed loose-coupling solutions for the baseline configuration are used to initiate the tight-coupling multidisciplinary analysis. Target thrust and rolling and pitching moments are enforced as optimization constraints. The optimized configuration improves the optimization metrics at both design points. The improved performance and all constraints are maintained over many revolutions beyond the optimization interval, satisfying the required flight conditions. Computational cost of the optimization cycle is assessed in a high-performance computing environment and found affordable for design of rotorcraft in general level-flight conditions.

Wang, Li↗

Selecting Observation Platforms for Optimized Anomaly Detectability under Unreliable Partial Observations

Diagnosers for keeping track on the occurrences of special events in the framework of unreliable partially observed discrete-event dynamical systems were developed in previous work. This paper considers observation platforms consisting of sensors that provide partial and unreliable observations and of diagnosers that analyze them. Diagnosers in observation platforms typically perform better as sensors providing the observations become more costly or increase in number. This paper proposes a methodology for finding an observation platform that achieves an optimal balance between cost and performance, while satisfying given observability requirements and constraints. Since this problem is generally computational hard in the framework considered, an observation platform optimization algorithm is utilized that uses two greedy heuristics, one myopic and another based on projected performances. These heuristics are sequentially executed in order to find best observation platforms. The developed algorithm is then applied to an observation platform optimization problem for a multi-unit-operation system. Results show that improved observation platforms can be found that may significantly reduce the observation platform cost but still yield acceptable performance for correctly inferring the occurrences of special events.

97 MATHEMATICS AND COMPUTING↗

Optimal application of Morrison's iterative noise removal for deconvolution. Appendices

Morrison's iterative method of noise removal, or Morrison's smoothing, is applied in a simulation to noise-added data sets of various noise levels to determine its optimum use. Morrison's smoothing is applied for noise removal alone, and for noise removal prior to deconvolution. For the latter, an accurate method is analyzed to provide confidence in the optimization. The method consists of convolving the data with an inverse filter calculated by taking the inverse discrete Fourier transform of the reciprocal of the transform of the response of the system. Various length filters are calculated for the narrow and wide Gaussian response functions used. Deconvolution of non-noisy data is performed, and the error in each deconvolution calculated. Plots are produced of error versus filter length; and from these plots the most accurate length filters determined. The statistical methodologies employed in the optimizations of Morrison's method are similar. A typical peak-type input is selected and convolved with the two response functions to produce the data sets to be analyzed. Both constant and ordinate-dependent Gaussian distributed noise is added to the data, where the noise levels of the data are characterized by their signal-to-noise ratios. The error measures employed in the optimizations are the L1 and L2 norms. Results of the optimizations for both Gaussians, both noise types, and both norms include figures of optimum iteration number and error improvement versus signal-to-noise ratio, and tables of results. The statistical variation of all quantities considered is also given.

Ioup, George E.↗

Optimally configuring a measurement system to detect diversions from a nuclear fuel cycle

The civilian nuclear fuel cycle is an industrial process that produces electrical power from the nuclear fission of uranium. Using a measurement system to accurately account for nuclear material, such as uranium, in a fuel cycle is important because of the possible loss or diversion of this potentially dangerous material. A measurement system is defined by a set of measurement methods, or “devices,” used to account for material flows and inventory values at specific locations in the fuel cycle. Here, we develop a simulation-optimization algorithm and an integer-programming model to find the best, or near-best, resource-limited measurement system with a high degree of confidence. The simulation-optimization algorithm minimizes a weighted sum of false positive and false negative diversion-detection probabilities while accounting for material quantities and measurement errors across a finite, discrete time horizon in hypothetical non-diversion and diversion contexts. In each time period, the estimated cumulative material unaccounted for is compared to a fixed or an optimized threshold value to assess if a “significant amount of material” is lost from a measurement system. The integer-programming model minimizes the population variance of the estimated material loss, i.e., material unaccounted for, in a measurement system. We analyze three potential problems in nuclear fuel cycle measurement systems: (i) given location-dependent device precisions, find the configuration of n devices at n locations ( n = 3) that gives the lowest corresponding objective values using the simulation-optimization algorithm and integer-programming model, (ii) find the location at which improving device precision reduces objective values the most using the simulation-optimization algorithm, and determine the effect of measurement frequency on measurement system configurations and objective values using the simulation-optimization algorithm. We obtain comparable results for each problem at least an order of magnitude faster than existing methods do. Using an optimized, rather than fixed, detection threshold in the simulation-optimization algorithm reduces the weighted sum of false positive and false negative probabilities.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Quasi-Optimal Elimination Trees for 2D Grids with Singularities

We construct quasi-optimal elimination trees for 2D finite element meshes with singularities. These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution of the multifrontal algorithms in serial and in parallel shared-memory executions. Since the meshes considered are a subspace of all possible mesh partitions, we call these minimizers quasi-optimal. We minimize the cost functionals using dynamic programming. Finding these minimizers is more computationally expensive than solving the original algebraic system. Nevertheless, from the insights provided by the analysis of the dynamic programming minima, we propose a heuristic construction of the elimination trees that has cost O N e log ⁡ N e , where N e is the number of elements in the mesh. We show that this heuristic ordering has similar computational cost to the quasi-optimal elimination trees found with dynamic programming and outperforms state-of-the-art alternatives in our numerical experiments.

Paszyńska, A.↗

The Use of Collective Dose for Optimization of a Low-Level Waste Site Closure Cover

Low-level radioactive waste management regulations require that releases to the environment be as low as reasonably achievable. Collective dose’s use in quantitative cost benefit analysis is well accepted for optimization of operational radiation safety, but seldom applied to routine environmental releases. One concern is that collective dose for large areas and long time periods may obscure the spatial and temporal distribution of risk and the magnitude of individual doses. Use of collective dose for optimization also requires that the decision maker justify subjective inputs including truncation limits for the summation of collective dose in space and time, a monetary value for collective dose, and a discount rate for future health detriment. In this study, a probabilistic collective dose model is developed and used to optimize the closure of the Area 5 Radioactive Waste Management Site (RWMS) on the Nevada Test Site. Collective dose’s shortcomings are addressed by preparing a dose matrix that disaggregates the collective dose in space and time and by reporting individual doses for exposed subgroups. Important subjective inputs are assigned discrete values reflecting differing opinions, and the consequence of the differences on the final decision is described. The resulting optimization process remains subjective, but clearly identifies subjective inputs, the values selected, and their impact on the decision. For the Area 5 RWMS, the value of the collective dose is small compared to closure cover cost options over a broad range of subjective values for the spatial and temporal limits for truncation of collective dose, monetary value of collective dose, and discount rates for future dose. The collective dose matrix and individual doses indicate that the societal and individual risks are greatest for future residents within the disposal site boundary, suggesting that options deterring intrusion have the greatest potential for cost-effectiveness. The cost of various closure options far exceeds the value of the collective dose averted, indicating that there are few opportunities for cost-effective improvements when closures meet the low dose constraints in waste management regulations.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Optimal explicit strong-stability-preserving general linear methods.

This paper constructs strong-stability-preserving general linear time-stepping methods that are well suited for hyperbolic PDEs discretized by the method of lines. These methods generalize both Runge-Kutta (RK) and linear multistep schemes. They have high stage orders and hence are less susceptible than RK methods to order reduction from source terms or nonhomogeneous boundary conditions. A global optimization strategy is used to find the most efficient schemes that have low storage requirements. Numerical results illustrate the theoretical findings.

97 MATHEMATICS AND COMPUTING↗

Modeling, analysis, and optimization of complex nuclear processes and facilities via computational methods: The HALEU process case study

Improving and adapting industrial systems to timely meet changing programmatic and market demands is an important goal to achieve, including when operating and maintaining complex nuclear processes and facilities. However, changes to these complex systems are costly, particularly when they are already in place and bounded to stringent requirements and constraints such as when handling radioactive material and contaminated equipment. These conditions often exist when treating spent nuclear fuel remotely within shielded nuclear radiation chambers, commonly referred as hot cells, to condition nuclear material and/or fabricate products for utilization in other nuclear enterprises such as in the manufacture of advanced nuclear fuel. The illustrative case considered here is the production of high assay low enriched uranium (HALEU) products supporting the deployment of advanced nuclear reactors. For the HALEU program, resources invested were and are being systematically analyzed so that these investments are maximized in a facility that is nearly 60 years old. A methodology that has effectively enabled optimized and improvements in the Spent Fuel Treatment (SFT) program, and consequently the HALEU program, involves discrete event simulation as addressed in this article. Here, the quantification of multiple productivity metrics, including material processing rates, cycle times, bottlenecks, number of material transfers as well as equipment, workstation, and material handling utilization, has resulted in a myriad of diverse discoveries and data-informed decisions regarding process layout and constituent, labor levels and schedules, selection of new process units, storage needs, and other critical process configurations. This article describes such a computational capability being applied for decision-making, illustrates its application to an actual process and program, provides illustrative results, and argues how computational methods for the modeling, analysis, and optimization of complex processes and facilities does lead to informed decisions derived from data and not only from intuition.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Object-Oriented Multi-Disciplinary Design, Analysis, and Optimization Tool

An Object-Oriented Optimization (O3) tool was developed that leverages existing tools and practices, and allows the easy integration and adoption of new state-of-the-art software. At the heart of the O3 tool is the Central Executive Module (CEM), which can integrate disparate software packages in a cross platform network environment so as to quickly perform optimization and design tasks in a cohesive, streamlined manner. This object-oriented framework can integrate the analysis codes for multiple disciplines instead of relying on one code to perform the analysis for all disciplines. The CEM was written in FORTRAN and the script commands for each performance index were submitted through the use of the FORTRAN Call System command. In this CEM, the user chooses an optimization methodology, defines objective and constraint functions from performance indices, and provides starting and side constraints for continuous as well as discrete design variables. The structural analysis modules such as computations of the structural weight, stress, deflection, buckling, and flutter and divergence speeds have been developed and incorporated into the O3 tool to build an object-oriented Multidisciplinary Design, Analysis, and Optimization (MDAO) tool.

Pak, Chan-gi↗

A higher‐order unsplit 2D direct Eulerian finite volume method for two‐material compressible flows based on the MOOD paradigms

SUMMARY A higher‐order unsplit multi‐dimensional discretization of the diffuse interface model for two‐material compressible flows proposed by R. Saurel, F. Petitpas and R. A. Berry in 2009 is developed. The proposed higher‐order method is based on the concepts of the Multidimensional Optimal Order Detection (MOOD) method introduced in three recent papers for single‐material flows. The first‐order unsplit multi‐dimensional Finite Volume discretization presented by SPB serves as foundation for the development of the higher‐order unlimited schemes. Specific detection criteria along with a novel decrementing algorithm for the MOOD method are designed in order to deal with the complexity of multi‐material flows. Numerically, we compare errors and computational times on several 1D problems (stringent shock tube and cavitation problems) computed on 2D meshes with the second‐ and fourth‐order MOOD methods using a classical MUSCL method as reference. Several simulations of a 2D shocked R22 bubble in the air are also presented on Cartesian and unstructured meshes with the second‐ and fourth‐order MOOD methods, and qualitative comparisons confirm the conclusions obtained with 1D problems. These numerical results demonstrate the robustness of the MOOD approach and the interest of using more than second‐order methods even for locally singular solutions of complex physics models. Copyright © 2014 John Wiley & Sons, Ltd.

Diot, S.↗

Diagonal and circulant or skew-circulant splitting preconditioners for spatial fractional diffusion equations

We propose three new preconditioners: diagonal and optimal-circulant splitting preconditioner, diagonal and skew-circulant splitting preconditioner, and diagonal and optimal-skew-circulant splitting preconditioner for solving the diagonal-plus-Toeplitz linear system discretized from the spatial fractional diffusion equations. Theoretical analysis shows that these three preconditioners can make the eigenvalues of the preconditioned matrices be clustered around 1, especially when the grids of the discretizations are refined. These results coincide with the one about the diagonal and circulant splitting preconditioner constructed recently by Bai et al. (Numer Linear Algebra Appl 24:e2093, 2017). Numerical experiments exhibit that the proposed preconditioners can significantly improve the convergence of the Krylov subspace iteration methods like GMRES and BiCGSTAB, and they outperform the diagonal and circulant splitting preconditioner as well.

97 MATHEMATICS AND COMPUTING↗

A coherent discrete variable representation method on a sphere

Here, the coherent discrete variable representation (ZDVR) has been extended for construct- ing a multidimensional potential-optimized DVR basis on a sphere. In order to deal with the non-constant Jacobian in spherical angles, two direct product primitive basis methods are proposed so that the original ZDVR technique can be properly implemented. The method has been demonstrated by computing the lowest states of a two dimensional (2D) vibrational model. Results show that the extended ZDVR method gives accurate eigenval- ues and exponential convergence with increasing ZDVR basis size.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On a nonlocal Cahn–Hilliard model permitting sharp interfaces

A nonlocal Cahn–Hilliard model with a non-smooth potential of double-well obstacle type that promotes sharp interfaces in the solution is presented. To capture long-range interactions between particles, a nonlocal Ginzburg–Landau energy functional is defined which recovers the classical (local) model as the extent of nonlocal interactions vanish. In contrast to the local Cahn–Hilliard problem that always leads to diffuse interfaces, the proposed nonlocal model can lead to a strict separation into pure phases of the substance. In this work, the lack of smoothness of the potential is essential to guarantee the aforementioned sharp-interface property. Mathematically, this introduces additional inequality constraints that, in a weak formulation, lead to a coupled system of variational inequalities which at each time instance can be restated as a constrained optimization problem. We prove the well-posedness and regularity of the semi-discrete and continuous in time weak solutions, and derive the conditions under which pure phases are admitted. Moreover, we develop discretizations of the problem based on finite element methods and implicit–explicit time-stepping methods that can be realized efficiently. Finally, we illustrate our theoretical findings through several numerical experiments in one and two spatial dimensions that highlight the differences in features of local and nonlocal solutions and also the sharp interface properties of the nonlocal model.

97 MATHEMATICS AND COMPUTING↗