Search NASA⌕ Search

SEARCH · Search NASA

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 469 records · Page 26

SU-E-T-631: Preliminary Results for Analytical Investigation Into Effects of ArcCHECK Setup Errors

Purpose: As three-dimensional diode arrays increase in popularity for patient-specific quality assurance for intensity-modulated radiation therapy (IMRT), it is important to evaluate an array’s susceptibility to setup errors. The ArcCHECK phantom is set up by manually aligning its outside marks with the linear accelerator’s lasers and light-field. If done correctly, this aligns the ArcCHECK cylinder’s central axis (CAX) with the linear accelerator’s axis of rotation. However, this process is prone to error. This project has developed an analytical expression including a perturbation factor to quantify the effect of shifts. Methods: The ArcCHECK is set up by aligning its machine marks with either the sagittal room lasers or the light-field of the linear accelerator at gantry zero (IEC). ArcCHECK has sixty-six evenly-spaced SunPoint diodes aligned radially in a ring 14.4 cm from CAX. The detector response function (DRF) was measured and combined with inverse-square correction to develop an analytical expression for output. The output was calculated using shifts of 0 (perfect alignment), +/−1, +/−2 and +/−5 mm. The effect on a series of simple inputs was determined: unity, 1-D ramp, steps, and hat-function to represent uniform field, wedge, evenly-spaced modulation, and single sharp modulation, respectively. Results: Geometric expressions were developed with perturbation factor included to represent shifts. DRF was modeled using sixth-degree polynomials with correlation coefficient 0.9997. The output was calculated using simple inputs such as unity, 1-D ramp, steps, and hat-function, with perturbation factors of: 0, +/−1, +/−2 and +/−5 mm. Discrepancies have been observed, but large fluctuations have been somewhat mitigated by aliasing arising from discrete diode placement. Conclusion: An analytical expression with perturbation factors was developed to estimate the impact of setup errors on an ArcCHECK phantom. Presently, this has been applied to simple functions, but is being developed to handle more realistic clinical cases.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Preliminary Jitter Stability Results for the Large UV/Optical/Infrared (LUVOIR) Surveyor Concept Using a Non-Contact Vibration Isolation and Precision Pointing System

The need for high payload dynamic stability and ultra-stable mechanical systems is an overarching technology need for large space telescopes such as the Large Ultraviolet / Optical / Infrared (LUVOIR) Surveyor concept. The LUVOIR concept includes a 15-meter-diameter segmented-aperture telescope with a suite of serviceable instruments operating over a range of wavelengths between 100nm to 2.5 um. Wavefront error (WFE) stability of less than 10 picometers RMS of uncorrected system WFE per wavefront control step represents a drastic performance improvement over current space-based telescopes being fielded. Through the utilization of an isolation architecture that involves no mechanical contact between the telescope and the host spacecraft structure, a system design is realized that maximizes the telescope dynamic stability performance without driving stringent technology requirements on spacecraft structure, sensors or actuators. Through analysis of the LUVOIR finite element model and linear optical model, the wavefront error and Line-Of-Sight (LOS) jitter performance is discussed in this paper when using the Vibration Isolation and Precision Pointing System (VIPPS) being developed cooperatively with Lockheed Martin in addition to a multi-loop control architecture. The multi-loop control architecture consists of the spacecraft Attitude Control System (ACS), VIPPS, and a Fast Steering Mirror on the instrument. While the baseline attitude control device for LUVOIR is a set of Control Moment Gyroscopes (CMGs), Reaction Wheel Assembly (RWA) disturbance contribution to wavefront error stability and LOS stability are presented to give preliminary results in this paper. CMG disturbance will be explored in further work to be completed.

Sacks, Lia W.↗

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↗

Navigation Strategies for Primitive Solar System Body Rendezvous and Proximity Operations

A wealth of scientific knowledge regarding the composition and evolution of the solar system can be gained through reconnaissance missions to primitive solar system bodies. This paper presents analysis of a baseline navigation strategy designed to address the unique challenges of primitive body navigation. Linear covariance and Monte Carlo error analysis was performed on a baseline navigation strategy using simulated data from a· design reference mission (DRM). The objective of the DRM is to approach, rendezvous, and maintain a stable orbit about the near-Earth asteroid 4660 Nereus. The outlined navigation strategy and resulting analyses, however, are not necessarily limited to this specific target asteroid as they may he applicable to a diverse range of mission scenarios. The baseline navigation strategy included simulated data from Deep Space Network (DSN) radiometric tracking and optical image processing (OpNav). Results from the linear covariance and Monte Carlo analyses suggest the DRM navigation strategy is sufficient to approach and perform proximity operations in the vicinity of the target asteroid with meter-level accuracy.

Getzandanner, Kenneth M.↗

Mass Inferencing Model Creation and Deployment to the RASSOR Lunar Excavation Robot

The Regolith Advanced Surface Systems Operations Robot (RASSOR) Excavator is a teleoperated mobile robotic platform with a unique space regolith excavation capability. The Intelligent Capabilities Enhanced RASSOR research project developed functionality for inferencing regolith mass ingested during RASSOR operation, enhancing RASSOR’s ability to successfully complete ISRU missions. To teleoperate or run autonomously, it is crucial for the quantity of regolith mass ingested by RASSOR to be available as a system state for efficient operation. For example, during autonomous operation, RASSOR should navigate and move to a processing plant to offload the collected regolith when the drums are full; without knowledge of how much mass is in the drums, this type of high-level planning is not possible. Four distinct modeling approaches were employed in developing a mass inferencing approach that could work on RASSOR. All take in system states, such as arm/drum positions, velocities, currents, voltages, and robot pose, and output a mass prediction for each set of the robot’s bucket drums.1) A neural network model that takes a vector of normalized system states; 2) A model that uses the integrated power consumption of an arm-raise (normalized by velocity); 3) A model that uses average drum current over a variable length interval of the drum disengaged from the surface; and 4) A real-time estimation model that aggregates excavation drum current. The developed models run in real time, outputting predictions for the front and rear drums, timestamp of the last prediction, and total mass in RASSOR’s drums. Further testing is required to validate the arm-raise model (2), though initial tests indicate reasonable performance (<10% mean error) on the hardware. The linear fit of average drum-current model (3) had a front value of r^2=0.99 and a rear value of r^2=0.98 on the validation dataset. This model currently has the best performance on unseen data. The real time model (4) is still in development, though initial results on a small subset of the training data show that it has high accuracy in predicting the increase in mass during excavation. Though work remains to be done with deploying a high-fidelity model to the physical system that makes predictions with error below the desired threshold, the modular architecture for model development allows quick adjustment of parameters to increase model fidelity. This architecture can also be adapted to use lunar excavation data to create models that are reflective of RASSOR’s dynamics when operating on the lunar surface. The results are promising as it has been shown that models can be developed that accurately estimate excavated regolith mass.

rassor↗

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↗

Simplified Convolution Codes

Simple recursive algorithm efficiently calculates minimum-weight error vectors using Diophantine equations. Recursive algorithm uses general solution of polynomial linear Diophantine equation to determine minimum-weight error polynomial vector in equation in polynomial space.

Truong, T. K.↗

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↗

Protograph LDPC Codes with Node Degrees at Least 3

In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower, by about 0.2 dB, than the best known irregular LDPC codes with degree at least 3. The main motivation is to gain linear minimum distance to achieve low error floor. Also to construct rate-compatible protograph-based LDPC codes for fixed block length that simultaneously achieves low iterative decoding threshold and linear minimum distance. We start with a rate 1/2 protograph LDPC code with degree-3 nodes and one high degree node. Higher rate codes are obtained by connecting check nodes with degree-2 non-transmitted nodes. This is equivalent to constraint combining in the protograph. The condition where all constraints are combined corresponds to the highest rate code. This constraint must be connected to nodes of degree at least three for the graph to have linear minimum distance. Thus having node degree at least 3 for rate 1/2 guarantees linear minimum distance property to be preserved for higher rates. Through examples we show that the iterative decoding threshold as low as 0.544 dB can be achieved for small protographs with node degrees at least three. A family of low- to high-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.

low density parity check (LDPC)↗

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↗

An Innovative Control Allocation Scheme to Address Reaction Thruster Interactions on a 3U CubeSat

A wealth of literature exists on control allocation algorithms for over-actuated air vehicles, launch vehicles, and spacecraft's. Most of these algorithms focus primarily on minimizing some objective function such as command tracking error and/or control effector usage. Linear allocators (pseudo inverses) are usually the conventional choice due to their simplicity and the ability to achieve a significant portion of the theoretical moment/impulse space. Generally, it is assumed that there exists minimal interaction effects between control effectors. In fact, very few studies address the problem of control effector interactions in the context of control allocation, especially for small spacecraft's with a reaction control system (RCS). This paper presents a CubeSat RCS design with a four thruster tetrahedral layout such that when two or more thrusters re, the resultant impulse differs noticeably compared to the sum of the contributions from individual thruster rings. This undesirable effect is caused by the design of the propellant tank and regulator. To mitigate this issue, an innovative modified pseudo inverse (MPI) control allocation algorithm was developed that adjusts the pseudo inverse solution based on test data. The algorithm is iteration-free and superior to the standard pseudo inverse in minimizing the command tracking error.

Pei, Jing↗

On the equivalence of Gaussian elimination and Gauss-Jordan reduction in solving linear equations

A novel general approach to round-off error analysis using the error complexity concepts is described. This is applied to the analysis of the Gaussian Elimination and Gauss-Jordan scheme for solving linear equations. The results show that the two algorithms are equivalent in terms of our error complexity measures. Thus the inherently parallel Gauss-Jordan scheme can be implemented with confidence if parallel computers are available.

Tsao, Nai-Kuan↗

Performance analysis of a cascaded coding scheme with interleaved outer code

A cascaded coding scheme for a random error channel with a bit-error rate is analyzed. In this scheme, the inner code C sub 1 is an (n sub 1, m sub 1l) binary linear block code which is designed for simultaneous error correction and detection. The outer code C sub 2 is a linear block code with symbols from the Galois field GF (2 sup l) which is designed for correcting both symbol errors and erasures, and is interleaved with a degree m sub 1. A procedure for computing the probability of a correct decoding is presented and an upper bound on the probability of a decoding error is derived. The bound provides much better results than the previous bound for a cascaded coding scheme with an interleaved outer code. Example schemes with inner codes ranging from high rates to very low rates are evaluated. Several schemes provide extremely high reliability even for very high bit-error rates say 10 to the -1 to 10 to the -2 power.

Lin, S.↗

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.]↗