Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimal accuracy”

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 307 records · Page 17

Numerical experience with a class of algorithms for nonlinear optimization using inexact function and gradient information

For optimization problems associated with engineering design, parameter estimation, image reconstruction, and other optimization/simulation applications, low accuracy function and gradient values are frequently much less expensive to obtain than high accuracy values. Here, researchers investigate the computational performance of trust region methods for nonlinear optimization when high accuracy evaluations are unavailable or prohibitively expensive, and confirm earlier theoretical predictions when the algorithm is convergent even with relative gradient errors of 0.5 or more. The proper choice of the amount of accuracy to use in function and gradient evaluations can result in orders-of-magnitude savings in computational cost.

Carter, Richard G.↗

Optimized coordinates in vibrational coupled cluster calculations

The use of variationally optimized coordinates, which minimize the vibrational self-consistent field (VSCF) ground state energy with respect to orthogonal transformations of the coordinates, has recently been shown to improve the convergence of vibrational configuration interaction (VCI) towards the exact full VCI [K. Yagi, M. Keçeli, and S. Hirata, J. Chem. Phys. 137, 204118 (2012)]. The present paper proposes an incorporation of optimized coordinates into the vibrational coupled cluster (VCC), which has in the past been shown to outperform VCI in approximate calculations where similar restricted state spaces are employed in VCI and VCC. An embarrassingly parallel algorithm for variational optimization of coordinates for VSCF is implemented and the resulting coordinates and potentials are introduced into a VCC program. The performance of VCC in optimized coordinates (denoted oc-VCC) is examined through pilot applications to water, formaldehyde, and a series of water clusters (dimer, trimer, and hexamer) by comparing the calculated vibrational energy levels with those of the conventional VCC in normal coordinates and VCI in optimized coordinates. For water clusters, in particular, oc-VCC is found to gain orders of magnitude improvement in the accuracy, exemplifying that the combination of optimized coordinates localized to each monomer with the size-extensive VCC wave function provides a supreme description of systems consisting of weakly interacting sub-systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Maximizing the Performance of Automated Low Cost All-sky Cameras

Thanks to the wide spread of digital camera technology in the consumer market, a steady increase in the number of active All-sky camera has be noticed European wide. In this paper I look into the details of such All-sky systems and try to optimize the performance in terms of accuracy of the astrometry, the velocity determination and photometry. Having autonomous operation in mind, suggestions are done for the optimal low cost All-sky camera.

Bettonvil, F.↗

Single step optimization of manipulator maneuvers with variable structure control

One step ahead optimization has been recently proposed for spacecraft attitude maneuvers as well as for robot manipulator maneuvers. Such a technique yields a discrete time control algorithm implementable as a sequence of state-dependent, quadratic programming problems for acceleration optimization. Its sensitivity to model accuracy, for the required inversion of the system dynamics, is shown in this paper to be alleviated by a fast variable structure control correction, acting between the sampling intervals of the slow one step ahead discrete time acceleration command generation algorithm. The slow and fast looping concept chosen follows that recently proposed for optimal aiming strategies with variable structure control. Accelerations required by the VSC correction are reserved during the slow one step ahead command generation so that the ability to overshoot the sliding surface is guaranteed.

Chen, N.↗

Closed-loop optimization of fast-charging protocols for batteries with machine learning

Simultaneously optimizing many design parameters in time-consuming experiments causes bottlenecks in a broad range of scientific and engineering disciplines. One such example is process and control optimization for lithium-ion batteries during materials selection, cell manufacturing and operation. A typical objective is to maximize battery lifetime; however, conducting even a single experiment to evaluate lifetime can take months to years. Furthermore, both large parameter spaces and high sampling variability necessitate a large number of experiments. As such, the key challenge is to reduce both the number and the duration of the experiments required. Here we develop and demonstrate a machine learning methodology to efficiently optimize a parameter space specifying the current and voltage profiles of six-step, ten-minute fast-charging protocols for maximizing battery cycle life, which can alleviate range anxiety for electric-vehicle users. We combine two key elements to reduce the optimization cost: an early-prediction model, which reduces the time per experiment by predicting the final cycle life using data from the first few cycles, and a Bayesian optimization algorithm, which reduces the number of experiments by balancing exploration and exploitation to efficiently probe the parameter space of charging protocols. Using this methodology, we rapidly identify high-cycle-life charging protocols among 224 candidates in 16 days (compared with over 500 days using exhaustive search without early prediction), and subsequently validate the accuracy and efficiency of our optimization approach. Our closed-loop methodology automatically incorporates feedback from past experiments to inform future decisions and can be generalized to other applications in battery design and, more broadly, other scientific domains that involve time-intensive experiments and multi-dimensional design spaces.

25 ENERGY STORAGE↗

Two-dimensional inverse planning and delivery with a preclinical image guided microirradiator

Purpose: Recent advances in preclinical radiotherapy systems have provided the foundation for scaling many of the elements of clinical radiation therapy practice to the dimensions and energy demanded in small animal studies. Such systems support the technical capabilities to accurately deliver highly complex dose distributions, but methods to optimize and deliver such distributions remain in their infancy. This study developed an optimization method based on empirically measured two-dimensional dose kernel measurements to deliver arbitrary planar dose distributions on a recently developed small animal radiotherapy platform.Methods: A two-dimensional dose kernel was measured with repeated radiochromic film measurements for the circular 1 mm diameter fixed collimator of the small animal radiotherapy system at 1 cm depth in a solid water phantom. This kernel was utilized in a sequential quadratic programming optimization framework to determine optimal beam positions and weights to deliver an arbitrary desired dose distribution. The positions and weights were then translated to a set of stage motions to automatically deliver the optimized dose distribution. End-to-end efficacy of the framework was quantified through five repeated deliveries of two dosimetric challenges: (1) a 5 mm radius bullseye distribution, and (2) a “sock” distribution contained within a 9 × 13 mm bounding box incorporating rectangular, semicircular, and exponentially decaying geometric constructs and a rectangular linear dose gradient region. These two challenges were designed to gauge targeting, geometric, and dosimetric fidelity.Results: Optimization of the bullseye and sock distributions required 2.1 and 5.9 min and utilized 50 and 77 individual beams for delivery, respectively. Automated delivery of the resulting optimized distributions, validated using radiochromic film measurements, revealed an average targeting accuracy of 0.32 mm, and a dosimetric delivery error along four line profiles taken through the sock distribution of 3.9%. Mean absolute delivery error across the 0–1 Gy linear dose gradient over 7.5 mm was 0.01 Gy.Conclusions: The work presented here demonstrates the potential for complex dose distributions to be planned and automatically delivered with millimeter scale heterogeneity at submillimeter accuracy. This capability establishes the technical foundation for preclinical validation of biologically guided radiotherapy investigations and development of unique radiobiological experiments.

61 RADIATION PROTECTION AND DOSIMETRY↗

Parametric Optimization of Undulators for NSLS-II Project Beamlines

General optimization procedure, computation methods used, and the obtained optimal parameters of undulators for the NSLS-II project beamlines are reported. The optimization starts with high-accuracy calculation of undulator magnetic fields, using Radia magnetostatics code, for a large set of periods and vertical gaps of a given undulator type, given magnetic materials and a scalable magnet geometry. From the resulting magnetic fields, a sub-set of undulator periods and the corresponding vertical gaps, providing the required low-energy cut-off values of spectral harmonics for each particular beamline, is determined. In parallel, from the same Radia undulator models, angular magnetic kick maps are calculated, and the insertion device effect on electron beam is simulated using Tracy-2 tracking code based on symplectic integrator. After these simulations, magnet parameters are fine-tuned and the maximal acceptable undulator lengths are determined for different straight sections, as functions of minimal gap and with due regard for the electron beam vertical ''stay clear'' constraint in the case of in-vacuum undulators. Finally, the optimal undulator period and length are determined as the values providing maximal spectral flux among the pre-selected undulator cases, already satisfying the requirements concerning the harmonic cut-off values and the effect on electron beam.

43 PARTICLE ACCELERATORS↗

SU-C-18A-05: Registration Accuracy of MR-Based Images to On-Board Megavoltage Cone-Beam CT for Brain Patient Setup

Purpose: To quantify the difference in isocenter shifts when co-registering MR and MR-based pseudo CTs (pCT) with on-board megavoltage conebeam CT (CBCT) images. Methods: Fast Spoiled Gradient Echo MRs were used to generate pCTs (research version of Advantage Sim MD™, GE Healthcare) for ten patients who had prior brain radiotherapy. The planning CT (rCT) for each was co-registered with the MR, and the plan isocenter and two other reference points were transferred to the MR and pCT. CBCT images (with the machine isocenter) from a single treatment day were coregistered with the 3 test images (MR, pCT and rCT), by two observers and by an automated registration algorithm. The reference points were used to calculate patient shifts and rotations from the registrations. The shifts calculated from the test image registrations were compared to each other and to the shifts performed by the therapists who treated the patients on that day. Results: The average difference in absolute value between the isocenter shifts from the MR-, pCT- and rCT-CBCT registrations, and the therapist shifts, were 2.02, 3.01 and 0.89 mm (craniocaudal), 1.14, 1.34 and 0.46 mm (lateral), and 1.37, 3.43 and 1.43 mm (vertical), respectively. The MR- and pCT-CBCT registrations differed by 1.99, and 2.53 mm (craniocaudal), 1.36, and 1.37 mm (lateral), and 0.74 and 2.34 mm (vertical), respectively, from the average rCT-CBCT shifts. On average, differences of 2.39 (craniocaudal), 1.28 (lateral) and 2.84 mm (vertical) were seen between the MR and pCT shifts. Rotations relative to the CBCT coordinate system were on average <2° for the MR and rCT, and <6° for the pCT. Conclusion: In this study, FSPGR MR-CBCT registrations were more precise compared to the pCT-CBCT registrations. For improved accuracy, MR sequences that are optimal for bony anatomy visualization are necessary. GE healthcare has provided a research version of Advantage Sim MD to UCSF. No financial support was provided.

60 APPLIED LIFE SCIENCES↗

Integrated control-system design via generalized LQG (GLQG) theory

Thirty years of control systems research has produced an enormous body of theoretical results in feedback synthesis. Yet such results see relatively little practical application, and there remains an unsettling gap between classical single-loop techniques (Nyquist, Bode, root locus, pole placement) and modern multivariable approaches (LQG and H infinity theory). Large scale, complex systems, such as high performance aircraft and flexible space structures, now demand efficient, reliable design of multivariable feedback controllers which optimally tradeoff performance against modeling accuracy, bandwidth, sensor noise, actuator power, and control law complexity. A methodology is described which encompasses numerous practical design constraints within a single unified formulation. The approach, which is based upon coupled systems or modified Riccati and Lyapunov equations, encompasses time-domain linear-quadratic-Gaussian theory and frequency-domain H theory, as well as classical objectives such as gain and phase margin via the Nyquist circle criterion. In addition, this approach encompasses the optimal projection approach to reduced-order controller design. The current status of the overall theory will be reviewed including both continuous-time and discrete-time (sampled-data) formulations.

Bernstein, Dennis S.↗

Massively parallel modeling and inversion of electrical resistivity tomography data using PFLOTRAN

Abstract. Electrical resistivity tomography (ERT) is a broadly accepted geophysical method for subsurface investigations. Interpretation of field ERT data usually requires the application of computationally intensive forward modeling and inversion algorithms. For large-scale ERT data, the efficiency of these algorithms depends on the robustness, accuracy, and scalability on high-performance computing resources. In this regard, we present a robust and highly scalable implementation of forward modeling and inversion algorithms for ERT data. The implementation is publicly available and developed within the framework of PFLOTRAN, an open-source, state-of-the-art massively parallel subsurface flow and transport simulation code. The forward modeling is based on a finite-volume discretization of the governing differential equations, and the inversion uses a Gauss–Newton optimization scheme. To evaluate the accuracy of the forward modeling, two examples are first presented by considering layered (1D) and 3D earth conductivity models. The computed numerical results show good agreement with the analytical solutions for the layered earth model and results from a well-established code for the 3D model. Inversion of ERT data, simulated for a 3D model, is then performed to demonstrate the inversion capability by recovering the conductivity of the model. To demonstrate the parallel performance of PFLOTRAN's ERT process model and inversion capabilities, large-scale scalability tests are performed by using up to 131 072 processes on a leadership class supercomputer. These tests are performed for the two most computationally intensive steps of the ERT inversion: forward modeling and Jacobian computation. For the forward modeling, we consider models with up to 122 ×106 degrees of freedom (DOFs) in the resulting system of linear equations and demonstrate that the code exhibits almost linear scalability on up to 10 000 DOFs per process. On the other hand, the code shows superlinear scalability for the Jacobian computation, mainly because all computations are fairly evenly distributed over each process with no parallel communication.

58 GEOSCIENCES↗

Assessment of Model-Based Schemes for Accelerating Optimization by RAVEN

Nuclear-Renewable Hybrid Energy Systems (N-R HES) combine different energy technologies in a synergistic way with the objective of achieving a more economical energy production. In this report the particular hybrid system dealt with includes a PWR nuclear reactor, the associated Rankine-based energy conversion cycle (Balance of Plant, BOP), an Industrial Process (IP) for hydrogen production, a gas turbine (Second Energy Source, SES), and a battery (Energy Storage, ES). The RAVEN-based HYBRID framework is used to find the optimal installed capacity and the optimal economical dispatch of each component of the N-R HES. HYBRID solves the coupled capacity planning-economic and dispatch optimization problem with the objective of minimizing the Levelized Cost of Electricity (LCOE). In the optimization of the power dispatch strategy, the HYBRID framework takes into account the time-dependent dynamics of each subsystem by including a Dymola object-oriented model of the process dynamics. To ease the computational burden of the optimization process, an initial guess for the dispatch optimization problem is provided by a preconditioner. The solution guess is calculated by means of a least-marginal cost approach which applies the same criterion behind the screening curve method. Though this algorithm allows evaluating an economically adapted generation mix for a target load duration curve within a few seconds, it neglects the constraints due to the single component dynamics, and it is not able to adequately represent the ES. An improved treatment of the pre-conditioner problem was addressed by introducing a Monte Carlo based optimization algorithm. The new approach takes into account limits on power rates for the system subcomponents, which was not previously done. Additionally, this new Monte-Carlo based preconditioner addresses the problem with the ES component through improved modeling of that component. The new algorithm has been implemented in the HYBRID framework and tested to assess its performance. The results obtained with the new Monte Carlobased preconditioner were benchmarked against those obtained through the reference deterministic approach. The comparison shows that the Monte-Carlo based approach provides improved solution accuracy to the power dispatch optimization problem. Also in this report, the treatment of the penalty function on LCOE is discussed, and an improved penalty function for missed demand is suggested and tested.

Maronati, Giovanni↗

Experimental validation of structural optimization methods

The topic of validating structural optimization methods by use of experimental results is addressed. The need for validating the methods as a way of effecting a greater and an accelerated acceptance of formal optimization methods by practicing engineering designers is described. The range of validation strategies is defined which includes comparison of optimization results with more traditional design approaches, establishing the accuracy of analyses used, and finally experimental validation of the optimization results. Examples of the use of experimental results to validate optimization techniques are described. The examples include experimental validation of the following: optimum design of a trussed beam; combined control-structure design of a cable-supported beam simulating an actively controlled space structure; minimum weight design of a beam with frequency constraints; minimization of the vibration response of helicopter rotor blade; minimum weight design of a turbine blade disk; aeroelastic optimization of an aircraft vertical fin; airfoil shape optimization for drag minimization; optimization of the shape of a hole in a plate for stress minimization; optimization to minimize beam dynamic response; and structural optimization of a low vibration helicopter rotor.

Adelman, Howard M.↗

Nonlinear Comparison of High-Order and Optimized Finite-Difference Schemes

The effect of reducing the formal order of accuracy of a finite-difference scheme in order to optimize its high-frequency performance is investigated using the I-D nonlinear unsteady inviscid Burgers'equation. It is found that the benefits of optimization do carry over into nonlinear applications. Both explicit and compact schemes are compared to Tam and Webb's explicit 7-point Dispersion Relation Preserving scheme as well as a Spectral-like compact scheme derived following Lele's work. Results are given for the absolute and L2 errors as a function of time.

Hixon, R.↗

Extended Lagrangian Born-Oppenheimer molecular dynamics in the limit of vanishing self-consistent field optimization

We present an efficient general approach to first principles molecular dynamics simulations based on extended Lagrangian Born-Oppenheimer molecular dynamics [A. M. N. Niklasson, Phys. Rev. Lett. 100, 123004 (2008)] in the limit of vanishing self-consistent field optimization. The reduction of the optimization requirement reduces the computational cost to a minimum, but without causing any significant loss of accuracy or long-term energy drift. The optimization-free first principles molecular dynamics requires only one single diagonalization per time step, but is still able to provide trajectories at the same level of accuracy as “exact,” fully converged, Born-Oppenheimer molecular dynamics simulations. The optimization-free limit of extended Lagrangian Born-Oppenheimer molecular dynamics therefore represents an ideal starting point for robust and efficient first principles quantum mechanical molecular dynamics simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Linear solvers for power grid optimization problems: A review of GPU-accelerated linear solvers

The linear equations that arise in interior methods for constrained optimization are sparse symmetric indefinite, and they become extremely ill-conditioned as the interior method converges. These linear systems present a challenge for existing solver frameworks based on sparse LU or LDL T decompositions. Here, we benchmark five well known direct linear solver packages on CPU- and GPU-based hardware, using matrices extracted from power grid optimization problems. The achieved solution accuracy varies greatly among the packages. None of the tested packages delivers significant GPU acceleration for our test cases. For completeness of the comparison we include results for MA57, which is one of the most efficient and reliable CPU solvers for this class of problem.

97 MATHEMATICS AND COMPUTING↗

Homogenizing atomic dynamics by fractional differential equations

In this paper, we propose two ways to construct fractional differential equations (FDE) for approximating atomic chain dynamics. Taking harmonic chain as an example, we add a power function of fractional order to Taylor expansion of the dispersion relation, and determine the parameters by matching two selected wave numbers. This approximate function leads to an FDE after considering both directions for wave propagation. As an alternative, we consider the symbol of the force term, and approximate it by a similar function. It also induces an FDE. Both approaches produce excellent agreement with the harmonic chain dynamics. The accuracy may be improved by optimizing the selected wave numbers, or starting with higher order Taylor expansions. When resolved in the lattice constant, the resulting FDE's faithfully reproduce the lattice dynamics. When resolved in a coarse grid instead, they systematically generate homogenized algorithms. Numerical tests are performed to verify the proposed approaches. Moreover, FDE's are also constructed for diatomic chain and anharmonic lattice, to illustrate the generality of the proposed approaches. - Highlights: • Match the dispersion relation of linear chain by power function of fractional order, added on low order Taylor expansion. • Design FDE by approximating dispersion relation, or the symbol for the force term. • Solve the FDE by algorithm of spectral accuracy. • Obtain faithful and systematical homogenization when resolved at coarser grid. • Applies to general lattices: complex, nonlinear and multidimensional.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

CAFQA: A Classical Simulation Bootstrap for Variational Quantum Algorithms

Classical computing plays a critical role in the advancement of quantum frontiers in the NISQ era. In this spirit, this work uses classical simulation to bootstrap Variational Quantum Algorithms (VQAs). VQAs rely upon the iterative optimization of a parameterized unitary circuit (ansatz) with respect to an objective function. Since quantum machines are noisy and expensive resources, it is imperative to classically choose the VQA ansatz initial parameters to be as close to optimal as possible to improve VQA accuracy and accelerate their convergence on today’s devices. This work tackles the problem of finding a good ansatz initialization, by proposing CAFQA, a Clifford Ansatz For Quantum Accuracy. The CAFQA ansatz is a hardware-efficient circuit built with only Clifford gates. In this ansatz, the parameters for the tunable gates are chosen by searching efficiently through the Clifford parameter space via classical simulation. The resulting initial states always equal or outperform traditional classical initialization (e.g., Hartree-Fock), and enable high-accuracy VQA estimations. CAFQA is well-suited to classical computation because: a) Clifford-only quantum circuits can be exactly simulated classically in polynomial time, and b) the discrete Clifford space is searched efficiently via Bayesian Optimization. For the Variational Quantum Eigensolver (VQE) task of molecular ground state energy estimation (up to 18 qubits), CAFQA’s Clifford Ansatz achieves a mean accuracy of nearly 99% and recovers as much as 99.99% of the molecular correlation energy that is lost in Hartree-Fock initialization. CAFQA achieves mean accuracy improvements of 6.4x and 56.8x, over the state-of-the-art, on different metrics. Here, the scalability of the approach allows for preliminary ground state energy estimation of the challenging chromium dimer (Cr2) molecule. With CAFQA’s high-accuracy initialization, the convergence of VQAs is shown to accelerate by 2.5x, even for small molecules. Furthermore, preliminary exploration of allowing a limited number of non-Clifford (T) gates in the CAFQA framework, shows that as much as 99.9% of the correlation energy can be recovered at bond lengths for which Clifford-only CAFQA accuracy is relatively limited, while remaining classically simulable.

bayesian optimization↗