Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematical 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 469 records · Page 26

Classical Preoptimization Approach for ADAPT-VQE: Maximizing the Potential of High-Performance Computing Resources to Improve Quantum Simulation of Chemical Applications

The ADAPT-VQE algorithm is a promising method for generating a compact ansatz based on derivatives of the underlying cost function, and it yields accurate predictions of electronic energies for molecules. In this work, we report the implementation and performance of ADAPT-VQE with our recently developed sparse wave function circuit solver (SWCS) in terms of accuracy and efficiency for molecular systems with up to 52 spin orbitals. The SWCS can be tuned to balance computational cost and accuracy, which extends the application of ADAPT-VQE for molecular electronic structure calculations to larger basis sets and a larger number of qubits. Using this tunable feature of the SWCS, we propose an alternative optimization procedure for ADAPT-VQE to reduce the computational cost of the optimization. Furthermore, by preoptimizing a quantum simulation with a parametrized ansatz generated with ADAPT-VQE/SWCS, we aim to utilize the power of classical high-performance computing in order to minimize the work required on noisy intermediate-scale quantum hardware, which offers a promising path toward demonstrating quantum advantage for chemical applications.

ADAPT-VQE↗

On-board diesel autothermal reforming for PEM fuel cells: Simulation and optimization

Alternative power sources are nowadays the only option to provide a quick response to the current regulations on automotive pollutant emissions. Hydrogen fuel cell is one promising solution, but the nature of the gas is such that the in-vehicle conversion of other fuels into hydrogen is necessary. In this paper, autothermal reforming, for Diesel on-board conversion into a hydrogen-rich gas suitable for PEM fuel cells, has investigated using the simulation tool Aspen Plus. A steady-state model has been developed to analyze the fuel processor and the overall system performance. The components of the fuel processor are: the fuel reforming reactor, two water gas shift reactors, a preferential oxidation reactor and H{sub 2} separation unit. The influence of various operating parameters such as oxygen to carbon ratio, steam to carbon ratio, and temperature on the process components has been analyzed in-depth and results are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Weak values and weak coupling maximizing the output of weak measurements

In a weak measurement, the average output 〈o〉 of a probe that measures an observable A{sup -hat} of a quantum system undergoing both a preparation in a state ρ{sub i} and a postselection in a state E{sub f} is, to a good approximation, a function of the weak value A{sub w}=Tr[E{sub f}A{sup -hat} ρ{sub i}]/Tr[E{sub f}ρ{sub i}], a complex number. For a fixed coupling λ, when the overlap Tr[E{sub f}ρ{sub i}] is very small, A{sub w} diverges, but 〈o〉 stays finite, often tending to zero for symmetry reasons. This paper answers the questions: what is the weak value that maximizes the output for a fixed coupling? What is the coupling that maximizes the output for a fixed weak value? We derive equations for the optimal values of A{sub w} and λ, and provide the solutions. The results are independent of the dimensionality of the system, and they apply to a probe having a Hilbert space of arbitrary dimension. Using the Schrödinger–Robertson uncertainty relation, we demonstrate that, in an important case, the amplification 〈o〉 cannot exceed the initial uncertainty σ{sub o} in the observable o{sup -hat}, we provide an upper limit for the more general case, and a strategy to obtain 〈o〉≫σ{sub o}. - Highlights: •We have provided a general framework to find the extremal values of a weak measurement. •We have derived the location of the extremal values in terms of preparation and postselection. •We have devised a maximization strategy going beyond the limit of the Schrödinger–Robertson relation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

About an Optimal Visiting Problem

In this paper we are concerned with the optimal control problem consisting in minimizing the time for reaching (visiting) a fixed number of target sets, in particular more than one target. Such a problem is of course reminiscent of the famous 'Traveling Salesman Problem' and brings all its computational difficulties. Our aim is to apply the dynamic programming technique in order to characterize the value function of the problem as the unique viscosity solution of a suitable Hamilton-Jacobi equation. We introduce some 'external' variables, one per target, which keep in memory whether the corresponding target is already visited or not, and we transform the visiting problem in a suitable Mayer problem. This fact allows us to overcome the lacking of the Dynamic Programming Principle for the originary problem. The external variables evolve with a hysteresis law and the Hamilton-Jacobi equation turns out to be discontinuous.

97 MATHEMATICS AND COMPUTING↗

Collecting data in the home laboratory: evolution of X-ray sources, detectors and working practices

Recent developments in X-ray crystallographic hardware related to structural biology research are presented and discussed. While the majority of macromolecular X-ray data are currently collected using highly efficient beamlines at an ever-increasing number of synchrotrons, there is still a need for high-performance reliable systems for in-house experiments. In addition to crystal screening and optimization of data-collection parameters before a synchrotron trip, the home system allows the collection of data as soon as the crystals are produced to obtain the solution of novel structures, especially by the molecular-replacement method, and is invaluable in achieving the quick turnover that is often required for ligand-binding studies in the pharmaceutical industry. There has been a continuous evolution of X-ray sources, detectors and software developed for in-house use in recent years and a diverse range of tools for structural biology laboratories are available. An overview of the main directions of these developments and examples of specific solutions available to the macromolecular crystallography community are presented in this paper, showing that data collection ‘at home’ is still an attractive proposition complementing the use of synchrotron beamlines.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Global parametric solutions of scalar transport

Passive scalar transport involves complex interactions between advection and diffusion, where the global transport rate depends upon scalar diffusivity and the values of the (possibly large) set of parameters controlling the advective flow. Although computation of a single solution of the advection-diffusion equation (ADE) is simple, in general it is prohibitively expensive to compute the parametric variation of solutions over the full parameter space Q, even though this is crucial for, e.g. optimization, parameter estimation, and elucidating the global structure of transport. By decomposing the flows within Q so as to exploit symmetries, we derive a spectral method that solves the ADE over Q three orders of magnitude faster than other methods of similar accuracy. Solutions are expressed in terms of the exponentially decaying natural periodic patterns of the ADE, sometimes called 'strange eigenmodes'. We apply the method to the experimentally realisable rotated arc mixer chaotic flow, both to establish numerical properties and to calculate the fine-scale structure of the global solution space for transport in this chaotic flow. Over 10{sup 5} solutions within Q are resolved, and spatial pattern locking, a symmetry breaking transition to disordered spatial patterns, and fractally distributed optima in transport rate are observed. The method exhibits exponential convergence, and efficiency increases with resolution of Q.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NBODY - a multipurpose trajectory optimization computer program

Documentation of the NBODY trajectory optimization program is presented in the form of a mathematical development plus a user's manual. Optimal multistage-launch ascent trajectories may be determined by variational thrust steering during the upper phase. Optimal low-thrust interplanetary spacecraft trajectories may also be calculated with solar power or constant power, all-propulsion or embedded coast arcs, fixed or optimal thrust angles, and a variety of terminal end conditions. A hybrid iteration scheme solves the boundary-value problem, while either transversality conditions or a univariate search scheme optimize vehicle or trajectory parameters.

Strack, W. C.↗

Casimir forces in the time domain: Applications

Our previous article [Phys. Rev. A 80, 012115 (2009)] introduced a method to compute Casimir forces in arbitrary geometries and for arbitrary materials that was based on a finite-difference time-domain (FDTD) scheme. In this article, we focus on the efficient implementation of our method for geometries of practical interest and extend our previous proof-of-concept algorithm in one dimension to problems in two and three dimensions, introducing a number of new optimizations. We consider Casimir pistonlike problems with nonmonotonic and monotonic force dependence on sidewall separation, both for previously solved geometries to validate our method and also for new geometries involving magnetic sidewalls and/or cylindrical pistons. We include realistic dielectric materials to calculate the force between suspended silicon waveguides or on a suspended membrane with periodic grooves, also demonstrating the application of perfectly matched layer (PML) absorbing boundaries and/or periodic boundaries. In addition, we apply this method to a realizable three-dimensional system in which a silica sphere is stably suspended in a fluid above an indented metallic substrate. More generally, the method allows off-the-shelf FDTD software, already supporting a wide variety of materials (including dielectric, magnetic, and even anisotropic materials) and boundary conditions, to be exploited for the Casimir problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust verification analysis

We introduce a new methodology for inferring the accuracy of computational simulations through the practice of solution verification. We demonstrate this methodology on examples from computational heat transfer, fluid dynamics and radiation transport. Our methodology is suited to both well- and ill-behaved sequences of simulations. Our approach to the analysis of these sequences of simulations incorporates expert judgment into the process directly via a flexible optimization framework, and the application of robust statistics. The expert judgment is systematically applied as constraints to the analysis, and together with the robust statistics guards against over-emphasis on anomalous analysis results. We have named our methodology Robust Verification. Our methodology is based on utilizing multiple constrained optimization problems to solve the verification model in a manner that varies the analysis' underlying assumptions. Constraints applied in the analysis can include expert judgment regarding convergence rates (bounds and expectations) as well as bounding values for physical quantities (e.g., positivity of energy or density). This approach then produces a number of error models, which are then analyzed through robust statistical techniques (median instead of mean statistics). This provides self-contained, data and expert informed error estimation including uncertainties for both the solution itself and order of convergence. Our method produces high quality results for the well-behaved cases relatively consistent with existing practice. The methodology can also produce reliable results for ill-behaved circumstances predicated on appropriate expert judgment. We demonstrate the method and compare the results with standard approaches used for both code and solution verification on well-behaved and ill-behaved simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Poster - 52: Smoothing constraints in Modulated Photon Radiotherapy (XMRT) fluence map optimization

Purpose: Modulated Photon Radiotherapy (XMRT), which simultaneously optimizes photon beamlet energy (6 and 18 MV) and fluence, has recently shown dosimetric improvement in comparison to conventional IMRT. That said, the degree of smoothness of resulting fluence maps (FMs) has yet to be investigated and could impact the deliverability of XMRT. This study looks at investigating FM smoothness and imposing smoothing constraint in the fluence map optimization. Methods: Smoothing constraints were modeled in the XMRT algorithm with the sum of positive gradient (SPG) technique. XMRT solutions, with and without SPG constraints, were generated for a clinical prostate scan using standard dosimetric prescriptions, constraints, and a seven coplanar beam arrangement. The smoothness, with and without SPG constraints, was assessed by looking at the absolute and relative maximum SPG scores for each fluence map. Dose volume histograms were utilized when evaluating impact on the dose distribution. Results: Imposing SPG constraints reduced the absolute and relative maximum SPG values by factors of up to 5 and 2, respectively, when compared with their non-SPG constrained counterparts. This leads to a more seamless conversion of FMS to their respective MLC sequences. This improved smoothness resulted in an increase to organ at risk (OAR) dose, however the increase is not clinically significant. Conclusions: For a clinical prostate case, there was a noticeable improvement in the smoothness of the XMRT FMs when SPG constraints were applied with a minor increase in dose to OARs. This increase in OAR dose is not clinically meaningful.

60 APPLIED LIFE SCIENCES↗

A class solution for volumetric-modulated arc therapy planning in postprostatectomy radiotherapy

This study is aimed to test a postprostatectomy volumetric-modulated arc therapy (VMAT) planning class solution. The solution applies to both the progressive resolution optimizer algorithm version 2 (PRO 2) and the algorithm version 3 (PRO 3), addressing the effect of an upgraded algorithm. A total of 10 radical postprostatectomy patients received 68 Gy to 95% of the planning target volume (PTV), which was planned using VMAT. Each case followed a set of planning instructions; including contouring, field setup, and predetermined optimization parameters. Each case was run through both algorithms only once, with no user interaction. Results were averaged and compared against Radiation Therapy Oncology Group (RTOG) 0534 end points. In addition, the clinical target volume (CTV) D{sub 100}, PTV D{sub 99}, and PTV mean doses were recorded, along with conformity indices (CIs) (95% and 98%) and the homogeneity index. All cases satisfied PTV D{sub 95} of 68 Gy and a maximum dose < 74.8 Gy. The average result for the PTV D{sub 99} was 64.1 Gy for PRO 2 and 62.1 Gy for PRO 3. The average PTV mean dose for PRO 2 was 71.4 Gy and 71.5 Gy for PRO 3. The CTV D{sub 100} average dose was 67.7 and 68.0 Gy for PRO 2 and PRO 3, respectively. The mean homogeneity index for both algorithms was 0.08. The average 95% CI was 1.17 for PRO 2 and 1.19 for PRO 3. For 98%, the average results were 1.08 and 1.12 for PRO 2 and PRO 3, respectively. All cases for each algorithm met the RTOG organs at risk dose constraints. A successful class solution has been established for prostate bed VMAT radiotherapy regardless of the algorithm used.

61 RADIATION PROTECTION AND DOSIMETRY↗

PyOED: An Extensible Suite for Data Assimilation and Model-Constrained Optimal Design of Experiments

This article describes PyOED, a highly extensible scientific package that enables developing and testing model-constrained optimal experimental design (OED) for inverse problems. Specifically, PyOED aims to be a comprehensive Python toolkit for model-constrained OED. The package targets scientists and researchers interested in understanding the details of OED formulations and approaches. It is also meant to enable researchers to experiment with standard and innovative OED technologies with a wide range of test problems (e.g., simulation models). OED, inverse problems (e.g., Bayesian inversion), and data assimilation (DA) are closely related research fields, and their formulations overlap significantly. Thus, PyOED is continuously being expanded with a plethora of Bayesian inversion, DA, and OED methods as well as new scientific simulation models, observation error models, and observation operators. These pieces are added such that they can be permuted to enable testing OED methods in various settings of varying complexities. The PyOED core is completely written in Python and utilizes the inherent object-oriented capabilities; however, the current version of PyOED is meant to be extensible rather than scalable. Specifically, PyOED is developed to “enable rapid development and benchmarking of OED methods with minimal coding effort and to maximize code reutilization.” This article provides a brief description of the PyOED layout and philosophy and provides a set of exemplary test cases and tutorials to demonstrate the potential of the package.

97 MATHEMATICS AND COMPUTING↗

Refactoring and Its Benefits

Refactoring is a disciplined technique for restructuring an existing body of code, altering its internal structure without changing its external behavior. It improves internal code structure without altering its external functionality by transforming functions and rethinking algorithms. It is an iterative process. Refactoring include reducing scope, replacing complex instructions with simpler or built-in instructions, and combining multiple statements into one statement. By transforming the code with refactoring techniques it will be faster to change, execute, and download. It is an excellent best practice to adopt for programmers wanting to improve their productivity. Refactoring is similar to things like performance optimizations, which are also behavior- preserving transformations. It also helps us find bugs when we are trying to fix a bug in difficult-to-understand code. By cleaning things up, we make it easier to expose the bug. Refactoring improves the quality of application design and implementation. In general, three cases concerning refactoring. Iterative refactoring, Refactoring when is necessary, Not refactor.Mr. Martin Fowler identifies four key reasons to refractor. Refactoring improves the design of software, makes software easier to understand, helps us find bugs and also helps in executing the program faster. There is an additional benefit of refactoring. It changes the way a developer thinks about the implementation when not refactoring. There are the three types of refactorings. 1) Code refactoring: It often referred to simply as refactoring. This is the refactoring of programming source code. 2) Database refactoring: It is a simple change to a database schema that improves its design while retaining both its behavioral and informational semantics. 3) User interface (UI) refactoring: It is a simple change to the UI which retains its semantics. Finally, we conclude the benefits of Refactoring are: Improves the design of software, Makes software easier to understand, Software gets cleaned up and Helps us to find bugs and Helps us to program faster.

99 GENERAL AND MISCELLANEOUS↗

An application of different dioids in public key cryptography

Dioids provide a natural framework for analyzing a broad class of discrete event dynamical systems such as the design and analysis of bus and railway timetables, scheduling of high-throughput industrial processes, solution of combinatorial optimization problems, the analysis and improvement of flow systems in communication networks. They have appeared in several branches of mathematics such as functional analysis, optimization, stochastic systems and dynamic programming, tropical geometry, fuzzy logic. In this paper we show how to involve dioids in public key cryptography. The main goal is to create key – exchange protocols based on dioids. Additionally the digital signature scheme is presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An optimality criterion for sizing members of heated structures with temperature constraints

A thermal optimality criterion is presented for sizing members of heated structures with multiple temperature constraints. The optimality criterion is similar to an existing optimality criterion for design of mechanically loaded structures with displacement constraints. Effectiveness of the thermal optimality criterion is assessed by applying it to one- and two-dimensional thermal problems where temperatures can be controlled by varying the material distribution in the structure. Results obtained from the optimality criterion agree within 2 percent with results from a closed-form solution and with results from a mathematical programming technique. The thermal optimality criterion augments existing optimality criteria for strength and stiffness related constraints and offers the possibility of extension of optimality techniques to sizing structures with combined thermal and mechanical loading.

Rao, G. V.↗

Randomized Federated Learning Methods for Nonsmooth, Nonconvex, and Hierarchical Optimization (Final Technical Report)

This final technical report summarizes the outcomes of a DOE-funded project on federated scientific machine learning (FL) under nonsmooth, nonconvex, and hierarchical optimization settings. The project develops new mathematical models, algorithms, and theoretical guarantees for decentralized stochastic, bilevel, and minimax optimization problems arising in DOE mission-relevant applications. A unified framework of randomized and zeroth-order federated optimization methods is introduced, providing provable convergence, communication efficiency, and sample-complexity guarantees. The report documents algorithmic design, theoretical analysis, and empirical validation of the proposed federated learning methods. The project also contributes to workforce development through graduate training and dissemination of results via publications and seminars.

97 MATHEMATICS AND COMPUTING↗

Noncoplanar Beam Angle Class Solutions to Replace Time-Consuming Patient-Specific Beam Angle Optimization in Robotic Prostate Stereotactic Body Radiation Therapy

Purpose: To investigate development of a recipe for the creation of a beam angle class solution (CS) for noncoplanar prostate stereotactic body radiation therapy to replace time-consuming individualized beam angle selection (iBAS) without significant loss in plan quality, using the in-house “Erasmus-iCycle” optimizer for fully automated beam profile optimization and iBAS. Methods and Materials: For 30 patients, Erasmus-iCycle was first used to generate 15-, 20-, and 25-beam iBAS plans for a CyberKnife equipped with a multileaf collimator. With these plans, 6 recipes for creation of beam angle CSs were investigated. Plans of 10 patients were used to create CSs based on the recipes, and the other 20 to independently test them. For these tests, Erasmus-iCycle was also used to generate intensity modulated radiation therapy plans for the fixed CS beam setups. Results: Of the tested recipes for CS creation, only 1 resulted in 15-, 20-, and 25-beam noncoplanar CSs without plan deterioration compared with iBAS. For the patient group, mean differences in rectum D{sub 1cc}, V{sub 60GyEq}, V{sub 40GyEq}, and D{sub mean} between 25-beam CS plans and 25-beam plans generated with iBAS were 0.2 ± 0.4 Gy, 0.1% ± 0.2%, 0.2% ± 0.3%, and 0.1 ± 0.2 Gy, respectively. Differences between 15- and 20-beam CS and iBAS plans were also negligible. Plan quality for CS plans relative to iBAS plans was also preserved when narrower planning target volume margins were arranged and when planning target volume dose inhomogeneity was decreased. Using a CS instead of iBAS reduced the computation time by a factor of 14 to 25, mainly depending on beam number, without loss in plan quality. Conclusions: A recipe for creation of robust beam angle CSs for robotic prostate stereotactic body radiation therapy has been developed. Compared with iBAS, computation times decreased by a factor 14 to 25. The use of a CS may avoid long planning times without losses in plan quality.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A practical discrete-adjoint method for high-fidelity compressible turbulence simulations

Methods and computing hardware advances have enabled accurate predictions of complex compressible turbulence phenomena, such as the generation of jet noise that motivates the present effort. However, limited understanding of underlying physical mechanisms restricts the utility of such predictions since they do not, by themselves, indicate a route to design improvements. Gradient-based optimization using adjoints can circumvent the flow complexity to guide designs, though this is predicated on the availability of a sufficiently accurate solution of the forward and adjoint systems. These are challenging to obtain, since both the chaotic character of the turbulence and the typical use of discretizations near their resolution limits in order to efficiently represent its smaller scales will amplify any approximation errors made in the adjoint formulation. Formulating a practical exact adjoint that avoids such errors is especially challenging if it is to be compatible with state-of-the-art simulation methods used for the turbulent flow itself. Automatic differentiation (AD) can provide code to calculate a nominally exact adjoint, but existing general-purpose AD codes are inefficient to the point of being prohibitive for large-scale turbulence simulations. Here, we analyze the compressible flow equations as discretized using the same high-order workhorse methods used for many high-fidelity compressible turbulence simulations, and formulate a practical space–time discrete-adjoint method without changing the basic discretization. A key step is the definition of a particular discrete analog of the continuous norm that defines our cost functional; our selection leads directly to an efficient Runge–Kutta-like scheme, though it would be just first-order accurate if used outside the adjoint formulation for time integration, with finite-difference spatial operators for the adjoint system. Its computational cost only modestly exceeds that of the flow equations. We confirm that its accuracy is limited by computing precision, and we demonstrate it on the aeroacoustic control of a mixing layer with a challengingly broad range of turbulence scales. For comparison, the error from a corresponding discretization of the continuous-adjoint equations is quantified to potentially explain its limited success in past efforts to control jet noise. The differences are illuminating: the continuous-adjoint is shown to suffer from exponential error growth in (reverse) time even for the best-resolved largest turbulence scales. Implications for jet noise reduction and turbulence control in general are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗