Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical 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 1,243 records · Page 69

Probabilistic flux limiters

The stable numerical integration of shocks in compressible flow simulations relies on the reduction or elimination of Gibbs phenomena (unstable, spurious oscillations). A popular method to virtually eliminate Gibbs oscillations caused by numerical discretization in under-resolved simulations is to use a flux limiter. A wide range of flux limiters have been studied in the literature, with recent interest in their optimization via machine learning methods trained on high-resolution datasets. The common use of flux limiters in numerical codes as plug-and-play blackbox components makes them key targets for design improvement. Even for deterministic dynamical models, numerical uncertainty is introduced via coarse-graining required by insufficient computational power to solve all scales of motion. Conventional flux limiters are deterministic and lack the capacity to address uncertainties, both aleatoric (inherent randomness) and epistemic (modeling uncertainty due to limited knowledge), which arise in coarse-grained numerical simulations. Here, we introduce a conceptually distinct type of flux limiter that is designed to handle the effects of randomness in the model and uncertainty in model parameters. Unlike traditional single-function flux limiters, these new probabilistic flux limiters incorporate multiple flux limiting functions, each applied with a learned probability drawn from high-resolution data to mitigate the effects of uncertainty in numerical simulations. This approach departs from traditional single-function limiters by explicitly modeling and incorporating uncertainty into the shock capturing process. Using the example of Burgers' equation as a testbed, we show that a machine learned, probabilistic flux limiter may be used in a shock capturing code to more accurately capture shock profiles. In particular, we show that our probabilistic flux limiter outperforms standard limiters and can be successively improved upon (up to a point) by expanding the set of probabilistically chosen flux limiting functions.

97 MATHEMATICS AND COMPUTING↗

Anisotropic Elastic-Waveform Modeling for Fracture Characterization in EGS Reservoirs

Enhanced geothermal systems (EGS) contain newly created fractures in addition to possible existing fractures. Accurate characterization and monitoring of EGS reservoirs are crucial for optimal placement of new wells and effective extraction of geothermal heat. The fractured reservoirs behave as anisotropic media where seismic waves propagate with different velocities along different directions. In addition, the anisotropic properties of fluid-filled fracture zones could be different from those of dry fracture zones. We develop an optimized rotated staggered-grid elastic-wave finite-difference method for simulating seismic-wave propagation in heterogeneous, anisotropic media. Our new method uses a few extra grid points and optimized finite-difference coefficients based on the space-time dispersion relation, and reduce numerical dispersion of the conventional rotated staggered-grid finite-difference scheme. We validate our new method using synthetic vertical-seismic-profiling (VSP) data for an anisotropic geophysical model built with geologic features found at the Raft River EGS reservoir. This improved and optimized rotated staggered-grid finite-difference method provides an essential tool for analyzing VSP data, reverse-time migration, and elastic-waveform inversion in anisotropic, fractured reservoirs.

58 GEOSCIENCES↗

Scalable tensor factorizations with incomplete data.

The problem of incomplete data - i.e., data with missing or unknown values - in multi-way arrays is ubiquitous in biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer vision, communication networks, etc. We consider the problem of how to factorize data sets with missing values with the goal of capturing the underlying latent structure of the data and possibly reconstructing missing values (i.e., tensor completion). We focus on one of the most well-known tensor factorizations that captures multi-linear structure, CANDECOMP/PARAFAC (CP). In the presence of missing data, CP can be formulated as a weighted least squares problem that models only the known entries. We develop an algorithm called CP-WOPT (CP Weighted OPTimization) that uses a first-order optimization approach to solve the weighted least squares problem. Based on extensive numerical experiments, our algorithm is shown to successfully factorize tensors with noise and up to 99% missing data. A unique aspect of our approach is that it scales to sparse large-scale data, e.g., 1000 x 1000 x 1000 with five million known entries (0.5% dense). We further demonstrate the usefulness of CP-WOPT on two real-world applications: a novel EEG (electroencephalogram) application where missing data is frequently encountered due to disconnections of electrodes and the problem of modeling computer network traffic where data may be absent due to the expense of the data collection process.

99 GENERAL AND MISCELLANEOUS↗

TH-AB-BRA-09: Stability Analysis of a Novel Dose Calculation Algorithm for MRI Guided Radiotherapy

Purpose: To determine the iterative deterministic solution stability of the Linear Boltzmann Transport Equation (LBTE) in the presence of magnetic fields. Methods: The LBTE with magnetic fields under investigation is derived using a discrete ordinates approach. The stability analysis is performed using analytical and numerical methods. Analytically, the spectral Fourier analysis is used to obtain the convergence rate of the source iteration procedures based on finding the largest eigenvalue of the iterative operator. This eigenvalue is a function of relevant physical parameters, such as magnetic field strength and material properties, and provides essential information about the domain of applicability required for clinically optimal parameter selection and maximum speed of convergence. The analytical results are reinforced by numerical simulations performed using the same discrete ordinates method in angle, and a discontinuous finite element spatial approach. Results: The spectral radius for the source iteration technique of the time independent transport equation with isotropic and anisotropic scattering centers inside infinite 3D medium is equal to the ratio of differential and total cross sections. The result is confirmed numerically by solving LBTE and is in full agreement with previously published results. The addition of magnetic field reveals that the convergence becomes dependent on the strength of magnetic field, the energy group discretization, and the order of anisotropic expansion. Conclusion: The source iteration technique for solving the LBTE with magnetic fields with the discrete ordinates method leads to divergent solutions in the limiting cases of small energy discretizations and high magnetic field strengths. Future investigations into non-stationary Krylov subspace techniques as an iterative solver will be performed as this has been shown to produce greater stability than source iteration. Furthermore, a stability analysis of a discontinuous finite element space-angle approach (which has been shown to provide the greatest stability) will also be investigated. Dr. B Gino Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta bi-planar linac MR for commercialization)

60 APPLIED LIFE SCIENCES↗

Diabatic quantum annealing for the frustrated ring model

Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Particle swarm optimization and gravitational wave data analysis: Performance on a binary inspiral testbed

The detection and estimation of gravitational wave signals belonging to a parameterized family of waveforms requires, in general, the numerical maximization of a data-dependent function of the signal parameters. Because of noise in the data, the function to be maximized is often highly multimodal with numerous local maxima. Searching for the global maximum then becomes computationally expensive, which in turn can limit the scientific scope of the search. Stochastic optimization is one possible approach to reducing computational costs in such applications. We report results from a first investigation of the particle swarm optimization method in this context. The method is applied to a test bed motivated by the problem of detection and estimation of a binary inspiral signal. Our results show that particle swarm optimization works well in the presence of high multimodality, making it a viable candidate method for further applications in gravitational wave data analysis.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Stiffness optimization of non-linear elastic structures

Our paper revisits stiffness optimization of non-linear elastic structures. Due to the non-linearity, several possible stiffness measures can be identified and in this work conventional compliance, i.e. secant stiffness designs are compared to tangent stiffness designs. The optimization problem is solved by the method of moving asymptotes and the sensitivities are calculated using the adjoint method. And for the tangent cost function it is shown that although the objective involves the third derivative of the strain energy an efficient formulation for calculating the sensitivity can be obtained. Loss of convergence due to large deformations in void regions is addressed by using a fictitious strain energy such that small strain linear elasticity is approached in the void regions. We formulate a well-posed topology optimization problem by using restriction which is achieved via a Helmholtz type filter. The numerical examples provided show that for low load levels, the designs obtained from the different stiffness measures coincide whereas for large deformations significant differences are observed.

42 ENGINEERING↗

Performance study of atomic tally methods for GPU-accelerated Monte Carlo dose calculation - 25352

Over the past several years, the graphics processing unit (GPU) technology has rapidly gained ground in scientific computing due to its outstanding performance and programmability. GPU implementation of Monte Carlo radiation transport for dose calculations has been reported by many investigators. The majority of these studies adopted single-precision floating point format because of the higher peak floating point operations per second (FLOPS) the GPUs can deliver than double-precision. It has been known that calculation using single-precision is more prone to numerical round-off errors, especially when a single tally data is accumulated 'atomically' and repeatedly by thousands of GPU threads. To mitigate this problem, the least intrusive solution in theory is to replace the single-precision atomic-add tally function with a double-precision version. However, the complexity lies in the fact that some GPUs (Nvidia GPUs prior to the Pascal generation; all current AMD GPUs) do not readily offer such double-precision function at hardware level, and that software emulation is too slow to use if not optimized properly. This paper discusses several atomic-add tally methods with reduced numerical errors used throughout ARCHER development. The original software-based compare-and-swap method (CAS) was shown to be inefficient due to high intra-warp thread contention, whereas the improved software-based warp-aggregated method (WAG) and Kahan summation method (KAS) eliminated the thread contention and performed very well on Kepler and Maxwell GPUs, being more than 13 times faster than CAS in our tests. The hardware-based (HB) double-precision atomic-add feature available on Pascal and Volta GPUs exceeded software emulation and offered the best performance universally, so did WIB, a combination of WAG and HB methods. It was also shown that in a single-precision dose engine, KAS managed to maintain high reliability when the single-precision atomic-add tally underestimated the dose by 25%. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Composite Qdrift-product formulas for quantum and classical simulations in real and imaginary time

Recent study has shown that it can be advantageous to implement a composite channel that partitions the Hamiltonian H for a given simulation problem into subsets A and B such that H = A + B , where the terms in A are simulated with a Trotter-Suzuki channel and the B terms are randomly sampled via the Qdrift algorithm. Here we extend Qdrift and composite product formulas to imaginary time, formulating candidate classical algorithms for quantum Monte Carlo calculations. We upper bound the induced Schatten- 1 → 1 norm on both imaginary-time Qdrift and composite channels. Another recent result demonstrated that simulations of lattice Hamiltonians containing geometrically local interactions can be improved using a Lieb-Robinson argument to decompose H into subsets that contain only terms supported on that subset of the lattice. Here, we provide a quantum algorithm by unifying this result with the composite approach into “local composite channels” and we upper bound the diamond distance. We provide exact numerical simulations of algorithmic cost by counting the number of gates of the form e − i H j t and e − H j β to meet a certain error tolerance ε . In doing so, we optimize the partitioning into sets A and B using gradient boosted tree models from machine learning. These numerical studies are important given that product formulas have been historically known to outperform analytic upper bounds. We show constant factor advantages for a variety of interesting Hamiltonians, the maximum of which is a ≈ 20 -fold speedup that occurs in the simulation of Jellium. Published by the American Physical Society 2024

Pocrnic, Matthew (ORCID:0000000203089376)↗

Universal energy-speed-accuracy trade-offs in driven nonequilibrium systems

The connection between measure theoretic optimal transport and dissipative nonequilibrium dynamics provides a language for quantifying nonequilibrium control costs, leading to a collection of thermodynamic speed limits, which rely on the assumption that the target probability distribution is perfectly realized. This is almost never the case in experiments or numerical simulations, so here we address the situation in which the external controller is imperfect. We obtain a lower bound for the dissipated work in generic nonequilibrium control problems that (1) is asymptotically tight and (2) matches the thermodynamic speed limit in the case of optimal driving. Along with analytically solvable examples, we refine this imperfect driving notion to systems in which the controlled degrees of freedom are slow relative to the nonequilibrium relaxation rate, and identify independent energy contributions from fast and slow degrees of freedom. Furthermore, we develop a strategy for optimizing minimally dissipative protocols based on optimal transport flow matching, a generative machine learning technique. Furthermore, this latter approach ensures the scalability of both the theoretical and computational framework we put forth. Crucially, we demonstrate that we can compute the terms in our bound numerically using efficient algorithms from the computational optimal transport literature and that the protocols we learn saturate the bound.

59 BASIC BIOLOGICAL SCIENCES↗

Optimal acceleration of ions by laser pulses with a sharp leading edge

We consider acceleration of ions through the interaction of a laser pulse with a sharp leading edge with nanofilms. At sufficiently large amplitude of the pulse, all the electrons can be expelled from the film, which provides an effective regime of ion acceleration. Limiting the maximum energy of ions can result from the longitudinal reverse motion of electrons to the initial position and by the transverse motion of electrons along the nanofilm surface, which causes the ion charge compensation. The characteristic parameters of the dynamics of ions and electrons in the system are analytically evaluated, which agree well with the results of twodimensional numerical simulations by the particle-in-cell method. Optimisation of the acceleration process by using the analytical estimates makes it possible to select the optimal parameters of the laser pulse and nanofilm. Numerical simulation of ion acceleration at these parameters shows that the maximum energy of ions can be substantially increased.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Anisotropic Thermally Conductive Composites Enabled by Acoustophoresis and Stereolithography

Opportunities to improve thermal management in electronic devices are currently hindered by processing constraints that limit thermal conductivity in polymer-matrix composites. Active patterning of filler particles is a promising route to improve conductivity while retaining processability by improving particle contact density and directing heat along optimized pathways. Here, we employ acoustic patterning to align and compact filler particles into stripes during stereolithographic 3D printing. This approach produces polymer-based composite materials with highly efficient embedded heat transport pathways which reach 95 vol% particle utilization (relative to the parallel conduction upper limit). These composites exhibit anisotropic thermal conductivity up to 300% higher than unpatterned composites, with in-plane anisotropy ratios of up to 350%. Combining this high conductivity with 3D printing enables materials with engineered heat networks that optimize transport from hot spots to heatsinks while maintaining low viscosity for fast particle patterning and for infiltration around electronic components. Finally, numerical simulations of acoustic assembly of particles with varied geometry, when compared to experimentally characterized particle packing, illuminate pathways for further improving conductivity by optimizing particle geometry for alignment and stacking of particles with maximum contact surface area.

36 MATERIALS SCIENCE↗

Metric Type in the Target-matrix Mesh Optimization Paradigm

The Target Matrix Optimization Paradigm (TMOP) is a method for improving the accuracy, efficiency, and robustness of numerical solutions to partial differential equations by improving the geometric quality of the computational mesh, primarily through node movement. TMOP has been successfully applied to a number applications even though the paradigm was not fully understood at the time. With this work, TMOP can be seen to be a tightly woven fabric of interconnecting ideas and concepts that provides a powerful approach to mesh optimization. The central unifying concepts in TMOP are the concept of a Target Matrix and the concept of Metric Type. Target matrices are motivated by the desire to make mesh quality improvement application-specific and, when needed, solution-adaptive. Metric type plays an essential role because it provides, through the use of typed metrics, the bridge between application-specific quality and target construction. It is shown that there are eight theoretical metric types, including the shape and shape+size types used informally in the past. It is shown further that there exist well-posed metrics corresponding to six of the eight metric types. A well-posed metric is a metric that is typed and convex, polyconvex, or invex, and further, it is a metric that simplifies target construction.

97 MATHEMATICS AND COMPUTING↗

Adiabatic coherent control in the anharmonic ion trap: Numerical analysis of vibrational anharmonicities

Anharmonicity of the quantized motional states of ions in a Paul trap can be utilized to address the state-to-state transitions selectively and control the motional modes of trapped ions coherently and adiabatically [Zhao and Babikov, Phys. Rev. A 77, 012338 (2008)]. In this paper we study two sources of the vibrational anharmonicity in the ion traps: the intrinsic Coulomb anharmonicity due to ion-ion interactions and the external anharmonicity of the trapping potential. An accurate numerical approach is used to compute energies and wave functions of vibrational eigenstates. The magnitude of the Coulomb anharmonicity is determined and shown to be insufficient for successful control. In contrast, anharmonicity of the trapping potential allows one to control the motion of ions very efficiently using the time-varying electric fields. Optimal control theory is used to derive the control pulses. One ion in a slightly anharmonic trap can be easily controlled. In the two- and three-ion systems the symmetric stretching mode is dark and cannot be controlled at all. The other two normal modes of the three-ion system can be controlled and used, for example, to encode a two-qubit system into the motional states of ions. A trap architecture that allows the necessary amount of vibrational anharmonicity to be achieved is proposed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stationary state distribution and efficiency analysis of the Langevin equation via real or virtual dynamics

Langevin dynamics has become a popular tool to simulate the Boltzmann equilibrium distribution. When the repartition of the Langevin equation involves the exact realization of the Ornstein-Uhlenbeck noise, in addition to the conventional density evolution, there exists another type of discrete evolution that may not correspond to a continuous, real dynamical counterpart. This virtual dynamics case is also able to produce the desired stationary distribution. Different types of repartition lead to different numerical schemes, of which the accuracy and efficiency are investigated through studying the harmonic oscillator potential, an analytical solvable model. By analyzing the asymptotic distribution and characteristic correlation time that are derived by either directly solving the discrete equations of motion or using the related phase space propagators, it is shown that the optimal friction coefficient resulting in the minimum characteristic correlation time depends on the time interval chosen in the numerical implementation. In conclusion, when the recommended “middle” scheme is employed, both analytical and numerical results demonstrate that, for good numerical performance in efficiency as well as accuracy, one may choose a friction coefficient in a wide range from around the optimal value to the high friction limit.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Towards quantum machine learning with tensor networks

Machine learning is a promising application of quantum computing, but challenges remain for implementation today because near-term devices have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine learning in the classical context, we propose quantum computing approaches to both discriminative and generative learning, with circuits based on tree and matrix product state tensor networks, that could already have benefits with such near-term devices. The result is a unified framework in which classical and quantum computing can benefit from the same theoretical and algorithmic developments, and the same model can be trained classically then transferred to the quantum setting for additional optimization. Tensor network circuits can also provide qubit-efficient schemes in which, depending on the architecture, the number of physical qubits required scales only logarithmically with, or independently of the input or output data sizes. Here, we demonstrate our proposals with numerical experiments, training a discriminative model to perform handwriting recognition using a hybrid quantum-classical optimization procedure that could be carried out on quantum hardware today, and testing the noise resilience of the trained model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimization of vortex pinning by nanoparticles using simulations of the time-dependent Ginzburg-Landau model

Introducing nanoparticles into superconducting materials has emerged as an efficient route to enhance their current-carrying capability. We address the problem of optimizing vortex pinning landscape for randomly distributed metallic spherical inclusions using large-scale numerical simulations of time- dependent Ginzburg-Landau equations. We found the size and density of particles for which the highest critical current is realized in a fixed magnetic field. For each particle size and magnetic field, the critical current reaches a maximum value at a certain particle density, which typically corresponds to 15{23% of the total volume being replaced by nonsuperconducting material. For fixed diameter, this optimal particle density increases with the magnetic field. Furthermore, we found that the optimal particle diameter slowly decreases with the magnetic field from 4.5 to 2.5 coherence lengths at a given temperature. This result shows that pinning landscapes have to be designed for specific applications taking into account relevant magnetic field scales.

36 MATERIALS SCIENCE↗

Adjoint DSMC for nonlinear Boltzmann equation constrained optimization

Applications for kinetic equations such as optimal design and inverse problems often involve finding unknown parameters through gradient-based optimization algorithms. Based on the adjoint-state method, we derive two different frameworks for approximating the gradient of an objective functional constrained by the nonlinear Boltzmann equation. While the forward problem can be solved by the DSMC method, it is difficult to efficiently solve the high-dimensional continuous adjoint equation obtained by the “optimize-then-discretize” approach. This challenge motivates us to propose an adjoint DSMC method following the “discretize-then-optimize” approach for Boltzmann-constrained optimization. We also analyze the properties of the two frameworks and their connections. Here, several numerical examples are presented to demonstrate their accuracy and efficiency.

97 MATHEMATICS AND COMPUTING↗