Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Linearization error”

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 217 records · Page 12

Performance Efficient Multiresilience Using Checkpoint Recovery in Iterative Algorithms

In this paper, we address the design challenge of building multiresilient iterative high-performance computing (HPC) applications. Multiresilience in HPC applications is the ability to tolerate and maintain forward progress in the presence of both soft errors and process failures. We address the challenge by proposing performance models which are useful to design performance efficient and resilient iterative applications. The models consider the interaction between soft error and process failure resilience solutions. We experimented with a linear solver application with two distinct kinds of soft error detectors: one detector has high overhead and high accuracy, whereas the second has low overhead and low accuracy. We show how both can be leveraged for verifying the integrity of checkpointed state used to recover from both soft errors and process failures. Our results show the performance efficiency and resiliency benefit of employing the low overhead detector with high frequency within the checkpoint interval, so that timely soft error recovery can take place, resulting in less re-computed work.

Ashraf, Rizwan↗

Solution Irregularity Remediation for Spatial Discretization Error Estimation for S N Transport Solutions

The discrete ordinates linear Boltzmann transport equation is typically solved in its spatially discretized form, incurring spatial discretization error. Quantification of this error for purposes such as adaptive mesh refinement or error analysis requires an a posteriori estimator, which utilizes the numerical solution to the spatially discretized equation to compute an estimate. Because the quality of the numerical solution informs the error estimate, irregularities, present in the true solution for any realistic problem configuration, tend to cause the largest deviation in the error estimate vis-a-vis the true error. In this paper, an analytical partial singular characteristic tracking (pSCT) procedure for reducing the estimator’s error is implemented within our novel residual source estimator for a zeroth-order discontinuous Galerkin scheme, at the additional cost of a single inner iteration. Here, a metric-based evaluation of the pSCT scheme versus the standard residual source estimator is performed over the parameter range of a Method of Manufactured Solutions test suite. The pSCT scheme generates near-ideal accuracy in the estimate in problems where the dominant source of the estimator’s error is the solution irregularity, namely, problems where the true solution is discontinuous and problems where the true solution’s first derivative is discontinuous and the scattering ratio is low. In problems where the scattering ratio is high and the true solution is discontinuous in the first derivative, the error in the scattering source, which is not converged by the pSCT scheme, is greater than the error incurred due to the irregularity. Ultimately, a pSCT scheme is judged to be useful for error estimation in problems where the computational cost of the scheme is justified. In the presence of many irregularities, such a scheme may be intractable for general use, but in benchmarks, as an analytical tool, or in problems that have nondissipative discontinuities, the scheme may prove invaluable.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimization of system parameters for a complete multispectral polarimeter

We optimize a general class of complete multispectral polarimeters with respect to signal-to-noise ratio, stability against alignment errors, and the minimization of errors regarding a given set of polarization states. The class of polarimeters that are dealt with consists of at least four polarization optics each with a multispectral detector. A polarization optic is made of an azimuthal oriented wave plate and a polarizing filter. A general, but not unique, analytic solution that minimizes signal-to-noise ratio is introduced for a polarimeter that incorporates four simultaneous measurements with four independent optics. The optics consist of four sufficient wave plates, where at least one is a quarter-wave plate. The solution is stable with respect to the retardance of the quarter-wave plate; therefore, it can be applied to real-world cases where the retardance deviates from {lambda}/4. The solution is a set of seven rotational parameters that depends on the given retardances of the wave plates. It can be applied to a broad range of real world cases. A numerical method for the optimization of arbitrary polarimeters of the type discussed is also presented and applied for two cases. First, the class of polarimeters that were analytically dealt with are further optimized with respect to stability and error performance with respect to linear polarized states. Then a multispectral case for a polarimeter that consists of four optics with real achromatic wave plates is presented. This case was used as the theoretical background for the development of the Airborne Multi-Spectral Sunphoto- and Polarimeter (AMSSP), which is an instrument for the German research aircraft HALO.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

Dynamic Aperture of JLEIC Electron Collider Ring with Errors and Correction

Design of the electron and ion rings of the Jefferson Lab Electron-Ion Collider (JLEIC) features the low-beta Interaction Regions (IR) with detector solenoid, non-linear chromaticity compensation blocks (CCB), and spin rotator optics with solenoids. The high beta functions in the IR final focus quadrupoles (FFQ) and in the CCB magnets result in strong effects of errors in these magnets. Performance of the spin rotators may also be sensitive to the errors. The first part of this study includes the design of orbit correction system for both rings and evaluation of dynamic aperture (DA) with misalignment and the correction. The second part is devoted to the DA study with the FFQ non-linear field errors. The orbit correction design, the dynamic aperture, and the impact on error specifications are presented.

Lin, F.↗

Hadronic light by light contribution to the (g-2){sub {mu}} with holographic models of QCD

We study the anomalous electromagnetic pion form factor F{sub {pi}}{sup 0}{sub {gamma}}{sup *}{sub {gamma}}{sup *} with a set of holographic models. By comparing with the measured value of the linear slope, some of these models can be ruled out. From the remaining models, we obtain predictions for the low-energy quadratic slope parameters of F{sub {pi}}{sup 0}{sub {gamma}}{sup *}{sub {gamma}}{sup *}, currently out of experimental reach but testable in the near future. We find it particularly useful to encode this low-energy information in a form factor able to satisfy also QCD short-distance constraints. We choose the form factor introduced by D'Ambrosio, Isidori, and Portoles in kaon decays, which has the right short distance for a particular value of the quadratic slope, which is later shown to be compatible with our holographic predictions. We then turn to a determination of the (dominant) pion exchange diagram in the hadronic light by light scattering contribution to the muon anomalous magnetic moment. We quantify the theoretical uncertainty in (g-2){sub {mu}} coming from the different input we use: QCD short distances, experimental input, and low-energy holographic predictions. We also test the pion-pole approximation. Our final result is a{sub {mu}}{sup {pi}0}=6.54(25)x10{sup -10}, where the error is driven by the linear slope of F{sub {pi}}{sup 0}{sub {gamma}}{sup *}{sub {gamma}}{sup *}, soon to be measured with precision at KLOE-2. Our numerical analysis also indicates that large values of the magnetic susceptibility {chi}{sub 0} are disfavored, therefore pointing at a mild effect from the pion off-shellness. However, in the absence of stronger bounds on {chi}{sub 0}, an additional (10-15)% systematic uncertainty on the previous value for a{sub {mu}}{sup {pi}0} cannot be excluded.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Variational fast forwarding for quantum simulation beyond the coherence time

Abstract Trotterization-based, iterative approaches to quantum simulation (QS) are restricted to simulation times less than the coherence time of the quantum computer (QC), which limits their utility in the near term. Here, we present a hybrid quantum-classical algorithm, called variational fast forwarding (VFF), for decreasing the quantum circuit depth of QSs. VFF seeks an approximate diagonalization of a short-time simulation to enable longer-time simulations using a constant number of gates. Our error analysis provides two results: (1) the simulation error of VFF scales at worst linearly in the fast-forwarded simulation time, and (2) our cost function’s operational meaning as an upper bound on average-case simulation error provides a natural termination condition for VFF. We implement VFF for the Hubbard, Ising, and Heisenberg models on a simulator. In addition, we implement VFF on Rigetti’s QC to demonstrate simulation beyond the coherence time. Finally, we show how to estimate energy eigenvalues using VFF.

97 MATHEMATICS AND COMPUTING↗

Mixed precision s –step Lanczos and conjugate gradient algorithms

Compared to the classical Lanczos algorithm, the s-step Lanczos variant has the potential to improve performance by asymptotically decreasing the synchronization cost per iteration. However, this comes at a price; despite being mathematically equivalent, the s-step variant may behave quite differently in finite precision, potentially exhibiting greater loss of accuracy and slower convergence relative to the classical algorithm. It has previously been shown that the errors in the s-step version follow the same structure as the errors in the classical algorithm, but are amplified by a factor depending on the square of the condition number of the O(s)-dimensional Krylov bases computed in each outer loop. As the condition number of these s-step bases grows (in some cases very quickly) with s, this limits the s values that can be chosen and thus can limit the attainable performance. In this work, we show that if a select few computations in s-step Lanczos are performed in double the working precision, the error terms then depend only linearly on the conditioning of the s-step bases. This has the potential for drastically improving the numerical behavior of the algorithm with little impact on per-iteration performance. Our numerical experiments demonstrate the improved numerical behavior possible with the mixed precision approach, and also show that this improved behavior extends to mixed precision s-step CG. Here, we present preliminary performance results on NVIDIA V100 GPUs that show that the overhead of extra precision is minimal if one uses precisions implemented in hardware.

97 MATHEMATICS AND COMPUTING↗

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

Stochastic Error Cancellation in Analog Quantum Simulation

Analog quantum simulation is a promising path towards solving classically intractable problems in many-body physics on near-term quantum devices. However, the presence of noise limits the size of the system and the length of time that can be simulated. In our work, we consider an error model in which the actual Hamiltonian of the simulator differs from the target Hamiltonian we want to simulate by small local perturbations, which are assumed to be random and unbiased. We analyze the error accumulated in observables in this setting and show that, due to stochastic error cancellation, with high probability the error scales as the square root of the number of qubits instead of linearly. We explore the concentration phenomenon of this error as well as its implications for local observables in the thermodynamic limit. Moreover, we show that stochastic error cancellation also manifests in the fidelity between the target state at the end of time-evolution and the actual state we obtain in the presence of noise. This indicates that, to reach a certain fidelity, more noise can be tolerated than implied by the worst-case bound if the noise comes from many statistically independent sources.

Analog quantum simulation↗

Evaluation of an Automatic Registration-Based Algorithm for Direct Measurement of Volume Change in Tumors

Purpose: Assuming that early tumor volume change is a biomarker for response to therapy, accurate quantification of early volume changes could aid in adapting an individual patient's therapy and lead to shorter clinical trials. We investigated an image registration-based approach for tumor volume change quantification that may more reliably detect smaller changes that occur in shorter intervals than can be detected by existing algorithms. Methods and Materials: Variance and bias of the registration-based approach were evaluated using retrospective, in vivo, very-short-interval diffusion magnetic resonance imaging scans where true zero tumor volume change is unequivocally known and synthetic data, respectively. The interval scans were nonlinearly registered using two similarity measures: mutual information (MI) and normalized cross-correlation (NCC). Results: The 95% confidence interval of the percentage volume change error was (-8.93% to 10.49%) for MI-based and (-7.69%, 8.83%) for NCC-based registrations. Linear mixed-effects models demonstrated that error in measuring volume change increased with increase in tumor volume and decreased with the increase in the tumor's normalized mutual information, even when NCC was the similarity measure being optimized during registration. The 95% confidence interval of the relative volume change error for the synthetic examinations with known changes over {+-}80% of reference tumor volume was (-3.02% to 3.86%). Statistically significant bias was not demonstrated. Conclusion: A low-noise, low-bias tumor volume change measurement algorithm using nonlinear registration is described. Errors in change measurement were a function of tumor volume and the normalized mutual information content of the tumor.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Formulations and analysis of Compton scattering for deterministic thermal radiation transport

In high-energy-density physics at low densities and high temperatures, Compton scattering can be the dominant interaction mechanism between thermal radiation and the material. Boson statistics leads to induced scattering, where the rate of scattering is proportional to the square of the photon intensity. To explore the importance of this nonlinear effect in the context of thermal radiative transfer, in this work we formulate several linear approximations to the scattering rate and compare them to the proper nonlinear rate in an infinite-medium setting. With the goal of implementing Compton scattering in a radiation transport code, we study heating-rate accuracy and iterative convergence properties for the linear methods as we vary the fidelity of the discretization in photon frequency. We find the equilibrium out-scattering formulation to be the most accurate linear method, with heating rate errors around 15% when the radiation is heating the material and up to 50% when the radiation is cooling the material.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Note: Rotaphone, a new self-calibrated six-degree-of-freedom seismic sensor

We have developed and tested (calibration, linearity, and cross-axis errors) a new six-degree-of-freedom mechanical seismic sensor for collocated measurements of three translational and three rotational ground motion velocity components. The device consists of standard geophones arranged in parallel pairs to detect spatial gradients. The instrument operates in a high-frequency range (above the natural frequency of the geophones, 4.5 Hz). Its theoretical sensitivity limit in this range is 10{sup -9} m/s in ground velocity and 10{sup -9} rad/s in rotation rate. Small size and weight, and easy installation and maintenance make the instrument useful for local-earthquake recording and seismic prospecting.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Dynamic linear response quantum algorithm

The dynamic linear response of a quantum system is critical for understanding both the structure and dynamics of strongly interacting quantum systems, including neutron scattering from materials, photon and electron scattering from atomic systems, and electron and neutrino scattering by nuclei. Here, we present a general algorithm for universal quantum computers to calculate the dynamic linear response function with controlled errors and to obtain information about specific final states that can be directly compared to experimental observations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Extreme Load Computational Fluid Dynamics Analysis and Verification for a Multibody Wave Energy Converter

A wave energy converter (WEC) must be designed to survive the extreme sea states that it will be subject to throughout its lifetime. Although there are many analysis methods and codes available to accomplish this, there are currently several engineering challenges to WEC survival design. Foremost, the computational design approach will typically involve a trade-off between accuracy and computational efficiency. Additionally, most computational fluid dynamics (CFD) codes are not ideally suited to modeling extreme events for WECs with multibody dynamics, power-take-off systems, and mooring systems. Finally, although WEC design standards and CFD guidelines are emerging, with the current immaturity of the WEC industry, they are not yet well established. In this study, loads on a 1:35-scale, moored, multibody WEC are evaluated with CFD. The CFD results are compared with results obtained from a computationally efficient, midfidelity model based on linearized potential flow hydrodynamics. For these model verification comparisons, both operational and survival configurations are considered. The extreme load results obtained, using both codes, indicate that the survival configuration successfully sheds loads during extreme sea states. It is also found that WEC-Sim, when appropriately applied, can provide reasonable load results, at a fraction of the computational expense of CFD. However, for the more extreme sea states, and for higher-order effects not included in the WEC-Sim model, the linear-based results have significant errors in comparison to the CFD-based results, and should be used judiciously.

16 TIDAL AND WAVE POWER↗