Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discretization 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 865 records · Page 48

Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition

This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Degenerate variational integrators for magnetic field line flow and guiding center trajectories

Symplectic integrators offer many benefits for numerically approximating solutions to Hamiltonian differential equations, including bounded energy error and the preservation of invariant sets. Two important Hamiltonian systems encountered in plasma physics—the flow of magnetic field lines and the guiding center motion of magnetized charged particles—resist symplectic integration by conventional means because the dynamics are most naturally formulated in non-canonical coordinates. New algorithms were recently developed using the variational integration formalism; however, those integrators were found to admit parasitic mode instabilities due to their multistep character. This work eliminates the multistep character, and therefore the parasitic mode instabilities via an adaptation of the variational integration formalism that we deem “degenerate variational integration.” Both the magnetic field line and guiding center Lagrangians are degenerate in the sense that the resultant Euler-Lagrange equations are systems of first-order ordinary differential equations. We show that retaining the same degree of degeneracy when constructing discrete Lagrangians yields one-step variational integrators preserving a non-canonical symplectic structure. Lastly, numerical examples demonstrate the benefits of the new algorithms, including superior stability relative to the existing variational integrators for these systems and superior qualitative behavior relative to non-conservative algorithms.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Physics-Informed and Data-Driven Prediction of Residual Stress in Three-Dimensional Machining

Efficient and reliable prediction of machining-induced residual stress (RS) is a key requirement for truly integrated computational materials engineering (ICME). Currently available process modeling approaches, including empirical, analytical, and numerical methodologies lack predictive power and require substantial calibration and validation data. Moreover, most model-based approaches consider only two-dimensional (2D) (i.e., orthogonal), cutting processes. Meanwhile, industrial processes such as milling, turning, and drilling are inherently three-dimensional (3D). The present work attempts to bridge the gap between 2D and 3D through careful consideration of the process physics, including geometric, kinematic, and size-effect constraints to realize robust prediction of how RS develops in 3D machining. Using a novel in-situ experimental technique and digital image correlation (DIC) to determine equivalent Hertzian contact widths, contact pressures, and friction coefficients, the proposed methodology leverages a discretized conversion algorithm that includes multi-pass shakedown effects. This paper presents a semi-analytical model to predict machining-induced RS in 3D turning operations, which are used representatively for 3D processes more generally. Rather than follow a ‘brute force’ 3D FEM approach or conduct countless experiments to train a purely data-driven machine learning algorithm, the proposed approach builds on previous 2D modeling work. Through careful consideration of the process physics, including complex geometry/kinematic considerations of 3D turning, the authors demonstrated an experimentally calibrated approach, as well as validation based on published RS data. Model predictions and previously published measurement data of RS depth profiles for turning of Inconel 718 were compared for a range of process parameters. Correlation between the proposed 3D model and validation data was found to be within the margin of experimental error for most conditions. The proposed model appears to capture the overall behavior of 3D RS depth profiles with acceptable accuracy, particularly the key metrics of near-surface stress, peak stress magnitude and location, as well as overall stress profile depth. This report presents a physics-informed, data-driven approach for efficient calibration of a 2D model for machining-induced RS through DIC analysis of in-situ characterized subsurface displacement fields.

42 ENGINEERING↗

Fermion-bag inspired Hamiltonian lattice field theory for fermionic quantum criticality

Motivated by the fermion-bag approach, in this work we construct a new class of Hamiltonian lattice field theories that can help us to study fermionic quantum critical points, particularly those with four-fermion interactions. Although these theories are constructed in discrete time with a finite temporal lattice spacing ϵ, when ϵ → 0, conventional continuous-time Hamiltonian lattice field theories are recovered. The fermion-bag algorithms run relatively faster when ϵ = 1 as compared to ϵ → 0 but still allow us to compute universal quantities near the quantum critical point even at such a large value of ϵ. As an example of this new approach, here we study the $N_f$ = 1 Gross-Neveu chiral-Ising universality class in 2 + 1 dimensions by calculating the critical scaling of the staggered mass order parameter. We show that we are able to study lattice sizes up to 100 2 sites when ϵ = 1, while with comparable resources we can reach lattice sizes of only up to 64 2 when ϵ → 0. The critical exponents obtained in both these studies match within errors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On the regularity of the covariance matrix of a discretized scalar field on the sphere

We present a comprehensive study of the regularity of the covariance matrix of a discretized field on the sphere. In a particular situation, the rank of the matrix depends on the number of pixels, the number of spherical harmonics, the symmetries of the pixelization scheme and the presence of a mask. Taking into account the above mentioned components, we provide analytical expressions that constrain the rank of the matrix. They are obtained by expanding the determinant of the covariance matrix as a sum of determinants of matrices made up of spherical harmonics. We investigate these constraints for five different pixelizations that have been used in the context of Cosmic Microwave Background (CMB) data analysis: Cube, Icosahedron, Igloo, GLESP and HEALPix, finding that, at least in the considered cases, the HEALPix pixelization tends to provide a covariance matrix with a rank closer to the maximum expected theoretical value than the other pixelizations. The effect of the propagation of numerical errors in the regularity of the covariance matrix is also studied for different computational precisions, as well as the effect of adding a certain level of noise in order to regularize the matrix. In addition, we investigate the application of the previous results to a particular example that requires the inversion of the covariance matrix: the estimation of the CMB temperature power spectrum through the Quadratic Maximum Likelihood algorithm. Finally, some general considerations in order to achieve a regular covariance matrix are also presented.

79 ASTRONOMY AND ASTROPHYSICS↗

Projecting the Thermal Response in a HTGR-Type System during Conduction Cooldown Using Graph-Laplacian Based Machine Learning

Accurate prediction of an off-normal event in a nuclear reactor is dependent upon the availability of sensory data, reactor core physical condition, and understanding of the underlying phenomenon. This work presents a method to project the data from some discrete sensory locations to the overall reactor domain during conduction cooldown scenarios similar to High Temperature Gas-cooled Reactors (HTGRs). The existing models for conductive cooldown in a heterogeneous multi-body system, such as an assembly of prismatic blocks or pebble beds relies on knowledge of the thermal contact conductance, requiring significant knowledge of local thermal contacts and heat transport possibilities across those contacts. With a priori knowledge of bulk geometry features and some discrete sensors, a machine learning approach was devised. The presented work uses an experimental facility to mimic conduction cooldown with an assembly of 68 cylindrical rods initially heated to 1200 K. High-fidelity temperature data were collected using an infrared (IR) camera to provide training data to the model and validate the predicted temperature data. The machine learning approach used here first converts the macroscopic bulk geometry information into Graph-Laplacian, and then uses the eigenvectors of the Graph-Laplacian to develop Kernel functions. Support vector regression (SVR) was implemented on the obtained Kernels and used to predict the thermal response in a packed rod assembly during a conduction cooldown experiment. The usage of SVR modeling differs from most models today because of its representation of thermal coupling between rods in the core. When trained with thermographic data, the average normalized error is less than 2% over 400 s, during which temperatures of the assembly have dropped by more than 500 K. The rod temperature prediction performance was significantly better for rods in the interior of the assembly compared to those near the exterior, likely due to the model simplification of the surroundings.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Breaking Computational Barriers: Real-time Analysis and Optimization with Large-scale Nonlinear Models via Model Reduction

Model reduction for dynamical systems is a promising approach for reducing the computational cost of large-scale physics-based simulations to enable high-fidelity models to be used in many- query (e.g., Bayesian inference) and near-real-time (e.g., fast-turnaround simulation) contexts. While model reduction works well for specialized problems such as linear time-invariant systems, it is much more difficult to obtain accurate, stable, and efficient reduced-order models (ROMs) for systems with general nonlinearities. This report describes several advances that enable nonlinear reduced-order models (ROMs) to be deployed in a variety of time-critical settings. First, we present an error bound for the Gauss-Newton with Approximated Tensors (GNAT) nonlinear model reduction technique. This bound allows the state-space error for the GNAT method to be quantified when applied with the backward Euler time-integration scheme. Second, we present a methodology for preserving classical Lagrangian structure in nonlinear model reduction. This technique guarantees that important properties--such as energy conservation and symplectic time-evolution maps--are preserved when performing model reduction for models described by a Lagrangian formalism (e.g., molecular dynamics, structural dynamics). Third, we present a novel technique for decreasing the temporal complexity --defined as the number of Newton-like iterations performed over the course of the simulation--by exploiting time-domain data. Fourth, we describe a novel method for refining projection-based reduced-order models a posteriori using a goal-oriented framework similar to mesh-adaptive h -refinement in finite elements. The technique allows the ROM to generate arbitrarily accurate solutions, thereby providing the ROM with a 'failsafe' mechanism in the event of insufficient training data. Finally, we present the reduced-order model error surrogate (ROMES) method for statistically quantifying reduced- order-model errors. This enables ROMs to be rigorously incorporated in uncertainty-quantification settings, as the error model can be treated as a source of epistemic uncertainty. This work was completed as part of a Truman Fellowship appointment. We note that much additional work was performed as part of the Fellowship. One salient project is the development of the Trilinos-based model-reduction software module Razor , which is currently bundled with the Albany PDE code and currently allows nonlinear reduced-order models to be constructed for any application supported in Albany. Other important projects include the following: 1. ROMES-equipped ROMs for Bayesian inference: K. Carlberg, M. Drohmann, F. Lu (Lawrence Berkeley National Laboratory), M. Morzfeld (Lawrence Berkeley National Laboratory). 2. ROM-enabled Krylov-subspace recycling: K. Carlberg, V. Forstall (University of Maryland), P. Tsuji, R. Tuminaro. 3. A pseudo balanced POD method using only dual snapshots: K. Carlberg, M. Sarovar. 4. An analysis of discrete v. continuous optimality in nonlinear model reduction: K. Carlberg, M. Barone, H. Antil (George Mason University). Journal articles for these projects are in progress at the time of this writing.

97 MATHEMATICS AND COMPUTING↗

Towards Predictive Reacting Flow LES

Grid dependency and the interaction of numerical errors with those from physical models can negatively impact the predictive capabilities of the traditional large eddy simulation (LES) approach. This paper attempts to address these issues for the simulation of turbulent reacting flows, where the canonical problem of a temporally evolving reacting jet is used as a test case. The impact of implicit and explicit filtering of the governing system of equations, and the impact of removing grid dependency from physical models through application of a constant filter width, is assessed. Four different grid resolutions are employed in the study. Differences are experienced in mean velocity and temperature profiles with grid resolution refinement when using the traditional implicit filtering approach, demonstrating the grid dependency of the obtained solutions. These differences are substantially mitigated by fixing the filter width used in physical models to a constant value, as the grid resolution is refined. Explicit filtering utilizing discrete filters reduces these differences even further, but to a smaller degree. This latter improvement comes at a very substantial computational cost. Higher Reynolds number cases need to be studied, where the LES resolution is far from that of a DNS, in order for a more conclusive assessment of the benefit of the explicit filtering approach to be made. However, even if explicit filtering is found to have a large positive impact on the predictive capabilities of reacting flow LES, its computational cost is likely to prevent it from being routinely applied to large, complex geometries, at least for the case where discrete filters are used.

Cocks, Peter A.↗

A spatially adaptive high-order meshless method for fluid–structure interactions

We present a scheme implementing an a posteriori refinement strategy in the context of a high-order meshless method for problems involving point singularities and fluid–solid interfaces. The generalized moving least squares (GMLS) discretization used in this work has been previously demonstrated to provide high-order compatible discretization of the Stokes and Darcy problems, offering a high-fidelity simulation tool for problems with moving boundaries. The meshless nature of the discretization is particularly attractive for adaptive h -refinement, especially when resolving the near-field aspects of variables and point singularities governing lubrication effects in fluid–structure interactions. We demonstrate that the resulting spatially adaptive GMLS method is able to achieve optimal convergence in the presence of singularities for both the div-grad and Stokes problems. Furthermore, we present a series of simulations for flows of colloid suspensions, in which the refinement strategy efficiently achieved highly accurate solutions, particularly for colloids with complex geometries.

42 ENGINEERING↗

Moving nonrelativistic QCD for heavy-to-light form factors on the lattice

We formulate nonrelativistic quantum chromodynamics (NRQCD) on a lattice which is boosted relative to the usual discretization frame. Moving NRQCD allows us to treat the momentum for the heavy quark arising from the frame choice exactly. We derive moving NRQCD through O(1/m{sup 2},v{sub rel}{sup 4}), as accurate as the NRQCD action in present use, both in the continuum and on the lattice with O(a{sup 4}) improvements. We have carried out extensive tests of the formalism through calculations of two-point correlators for both heavy-heavy (bottomonium) and heavy-light (B{sub s}) mesons in 2+1 flavor lattice QCD and obtained nonperturbative determinations of energy shift and external momentum renormalization. Comparison to perturbation theory at O({alpha}{sub s}) is also made. The results demonstrate the effectiveness of moving NRQCD. In particular we show that the decay constants of heavy-light and heavy-heavy mesons can be calculated with small systematic errors up to much larger momenta than with standard NRQCD.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Individually optimized uniform contrast enhancement in CT angiography for the diagnosis of pulmonary thromboembolic disease—A simulation study

Purpose: To improve the diagnostic quality of CT pulmonary angiography (CTPA) by individually optimizing a biphasic contrast injection function to achieve targeted uniform contrast enhancement. To compare the results against a previously reported discrete Fourier transform (DFT) approach. Methods: This simulation study used the CTPA datasets of 27 consecutive patients with pulmonary thromboembolic disease (PE). An optimization approach was developed consisting of (1) computation of the impulse enhancement function (IEF) based on a test bolus scan, and (2) optimization of a biphasic contrast injection function using the IEF in order to achieve targeted uniform enhancement. The injection rates and durations of a biphasic contrast injection function are optimized by minimizing the difference between the resulting contrast enhancement curve and the targeted uniform enhancement curve, while conforming to the clinical constraints of injection rate and total contrast volume. The total contrast volume was limited first to the clinical standard of 65 ml, and then to the same amount used in the DFT approach for comparison. The optimization approach and the DFT approach were compared in terms of the root mean square error (RMSE) and total contrast volume used. Results: When the total contrast volume was limited to 65 ml, the optimization approach produced significantly better contrast enhancement (closer to the targeted uniform contrast enhancement) than the DFT approach (RMSE 17 HU vs 56 HU,p < 0.00001). On average, the optimization approach used 63 ml contrast, while the DFT approach used 50 ml with four patients exceeding 65 ml. When equivalent total contrast volume was used for individual patient, the optimization approach still generated significantly better contrast enhancement (RMSE 44 HU vs 56 HU, p < 0.01). Constraints for the injection function could be easily accommodated into the optimization process when searching for the optimal biphasic injection function. Conclusions: The optimization approach generated individually optimized biphasic injection functions yielding significantly better contrast enhancement compared to the DFT approach. This new approach has the potential to improve the diagnostic quality of CTPA for PE.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-E-T-614: Plan Averaging for Multi-Criteria Navigation of Step-And-Shoot IMRT

Purpose: Step-and-shoot IMRT is fundamentally discrete in nature, while multi-criteria optimization (MCO) is fundamentally continuous: the MCO planning consists of continuous sliding across the Pareto surface (the set of plans which represent the tradeoffs between organ-at-risk doses and target doses). In order to achieve close to real-time dose display during this sliding, it is desired that averaged plans share many of the same apertures as the pre-computed plans, since dose computation for apertures generated on-the-fly would be expensive. We propose a method to ensure that neighboring plans on a Pareto surface share many apertures. Methods: Our baseline step-and-shoot sequencing method is that of K. Engel (a method which minimizes the number of segments while guaranteeing the minimum number of monitor units), which we customize to sequence a set of Pareto optimal plans simultaneously. We also add an error tolerance to study the relationship between the number of shared apertures, the total number of apertures needed, and the quality of the fluence map re-creation. Results: We run tests for a 2D Pareto surface trading off rectum and bladder dose versus target coverage for a clinical prostate case. We find that if we enforce exact fluence map recreation, we are not able to achieve much sharing of apertures across plans. The total number of apertures for all seven beams and 4 plans without sharing is 217. With sharing and a 2% error tolerance, this number is reduced to 158 (73%). Conclusion: With the proposed method, total number of apertures can be decreased by 42% (averaging) with no increment of total MU, when an error tolerance of 5% is allowed. With this large amount of sharing, dose computations for averaged plans which occur during Pareto navigation will be much faster, leading to a real-time what-you-see-is-what-you-get Pareto navigation experience. Minghao Guo and Hao Gao were partially supported by the NSFC (#11405105), the 973 Program (#2015CB856000) and the Shanghai Pujiang Talent Program (#14PJ1404500)

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Propagating sample variance uncertainties in redshift calibration: simulations, theory, and application to the COSMOS2015 data

ABSTRACT Cosmological analyses of galaxy surveys rely on knowledge of the redshift distribution of their galaxy sample. This is usually derived from a spectroscopic and/or many-band photometric calibrator survey of a small patch of sky. The uncertainties in the redshift distribution of the calibrator sample include a contribution from shot noise, or Poisson sampling errors, but, given the small volume they probe, they are dominated by sample variance introduced by large-scale structures. Redshift uncertainties have been shown to constitute one of the leading contributions to systematic uncertainties in cosmological inferences from weak lensing and galaxy clustering, and hence they must be propagated through the analyses. In this work, we study the effects of sample variance on small-area redshift surveys, from theory to simulations to the COSMOS2015 data set. We present a three-step Dirichlet method of resampling a given survey-based redshift calibration distribution to enable the propagation of both shot noise and sample variance uncertainties. The method can accommodate different levels of prior confidence on different redshift sources. This method can be applied to any calibration sample with known redshifts and phenotypes (i.e. cells in a self-organizing map, or some other way of discretizing photometric space), and provides a simple way of propagating prior redshift uncertainties into cosmological analyses. As a worked example, we apply the full scheme to the COSMOS2015 data set, for which we also present a new, principled SOM algorithm designed to handle noisy photometric data. We make available a catalogue of the resulting resamplings of the COSMOS2015 galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗

Time-frequency energy density precipitation method for time-of-flight extraction of narrowband Lamb wave detection signals

The time-of-flight of the Lamb wave provides an important basis for defect evaluation in metal plates and is the input signal for Lamb wave tomographic imaging. However, the time-of-flight can be difficult to acquire because of the Lamb wave dispersion characteristics. This work proposes a time-frequency energy density precipitation method to accurately extract the time-of-flight of narrowband Lamb wave detection signals in metal plates. In the proposed method, a discrete short-time Fourier transform is performed on the narrowband Lamb wave detection signals to obtain the corresponding discrete time-frequency energy density distribution. The energy density values at the center frequency for all discrete time points are then calculated by linear interpolation. Next, the time-domain energy density curve focused on that center frequency is precipitated by least squares fitting of the calculated energy density values. Finally, the peak times of the energy density curve obtained relative to the initial pulse signal are extracted as the time-of-flight for the narrowband Lamb wave detection signals. An experimental platform is established for time-of-flight extraction of narrowband Lamb wave detection signals, and sensitivity analysis of the proposed time-frequency energy density precipitation method is performed in terms of propagation distance, dispersion characteristics, center frequency, and plate thickness. For comparison, the widely used Hilbert–Huang transform method is also implemented for time-of-flight extraction. The results show that the time-frequency energy density precipitation method can accurately extract the time-of-flight with relative error of <1% and thus can act as a universal time-of-flight extraction method for narrowband Lamb wave detection signals.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Imaging spectroscopy algorithms for mapping canopy foliar chemical and morphological traits and their uncertainties

A major goal of remote sensing is the development of generalizable algorithms to repeatedly and accurately map ecosystem properties across space and time. Imaging spectroscopy has great potential to map vegetation traits that cannot be retrieved from broadband spectral data, but rarely have such methods been tested across broad regions. Here we illustrate a general approach for estimating key foliar chemical and morphological traits through space and time using NASA's Airborne Visible/Infrared Imaging Spectrometer (AVIRIS-Classic). We apply partial least squares regression (PLSR) to data from 237 field plots within 51 images acquired between 2008 and 2011. Using a series of 500 randomized 50/50 subsets of the original data, we generated spatially explicit maps of seven traits (leaf mass per area (M area ), percentage nitrogen, carbon, fiber, lignin, and cellulose, and isotopic nitrogen concentration, δ 15 N) as well as pixel-wise uncertainties in their estimates based on error propagation in the analytical methods. Both Marea and %N PLSR models had a R 2 > 0.85. Root mean square errors (RMSEs) for both variables were less than 9% of the range of data. Fiber and lignin were predicted with R 2 > 0.65 and carbon and cellulose with R 2 > 0.45. Although R 2 of %C and cellulose were lower than Marea and %N, the measured variability of these constituents (especially %C) was also lower, and their RMSE values were beneath 12% of the range in overall variability. Model performance for δ 15 N was the lowest (R 2 = 0.48, RMSE = 0.95‰), but within 15% of the observed range. The resulting maps of chemical and morphological traits, together with their overall uncertainties, represent a first-of-its-kind approach for examining the spatiotemporal patterns of forest functioning and nutrient cycling across a broad range of temperate and sub-boreal ecosystems. These results offer an alternative to categorical maps of functional or physiognomic types by providing non-discrete maps (i.e., on a continuum) of traits that define those functional types. A key contribution of this work is the ability to assign retrieval uncertainties by pixel, a requirement to enable assimilation of these data products into ecosystem modeling frameworks to constrain carbon and nutrient cycling projections.

54 ENVIRONMENTAL SCIENCES↗

The Effect of the Flux Separability Approximation on Multigroup Neutron Transport

The angular dependence of flux-weighted multigroup cross sections is commonly neglected when generating multigroup libraries. The error of this flux separability approximation is typically not isolated from other error sources due to a lack of availability of library generation and corresponding solvers that cannot relax this approximation. These errors can now be isolated and quantified with the availability of a multigroup Monte Carlo transport and multigroup library-generation capability in the OpenMC Monte Carlo transport code. This work will discuss relevant details of the OpenMC implementation, provide an example case useful for detailing the type of errors one can expect from making the flux separability approximation, and end with more realistic problems which show the impact of the approximation and highlight how it can strongly arise from an energy-dependent resonance absorption effect. Since the angle-dependence is intrinsically linked to the energy group structure, these examples also show that relaxing the flux separability approximation with angle-dependent cross sections could be used to reduce either the fine-tuning required to set a multigroup energy structure for a specific reactor type or the number of energy groups required to obtain a desired level of accuracy for a given problem. This trade-off could increase the costs of generating multigroup cross sections, and has the potential to require more memory for storing the multigroup library during the transport calculations, but it can significantly reduce the computational time required since the runtime of a discrete ordinates or method of characteristics neutron transport solver scales roughly linearly with the number of groups.

42 ENGINEERING↗

Fault Tolerant Decoding of QLDPC-GKP Codes with Circuit Level Soft Information

Concatenated bosonic-stabilizer codes have recently gained prominence as promising candidates for achieving low-overhead fault-tolerant quantum computing in the long term. In such systems, analog information obtained from the syndrome measurements of an inner bosonic code is used to inform decoding for an outer code layer consisting of a discrete-variable stabilizer code such as a surface code. The use of Quantum Low-Density Parity Check (QLDPC) codes as an outer code is of particular interest due to the significantly higher encoding rates offered by these code families, leading to a further reduction in overhead for large-scale quantum computing. Recent works have investigated the performance of QLDPC-GKP codes in detail, and the use of analog information from the inner code significantly boosts decoder performance. However, the noise models assumed in these works are typically limited to depolarizing or phenomenological noise. In this paper, we investigate the performance of QLDPC-GKP concatenated codes under circuit-level noise, based on a model introduced by Noh et al. in the context of the surface-GKP code. To demonstrate the performance boost from analog information, we investigate three scenarios: (a) decoding without soft information, (b) decoding with precomputed error probabilities but without real-time soft information, and (c) decoding with real-time soft information obtained from round-to-round decoding of the inner GKP code. Results show minimal improvement between (a) and (b), but a significant boost in (c), indicating that real-time soft information is critical for concatenated decoding under circuit-level noise. We also study the effect of measurement schedules with varying depths and show that using a schedule with minimum depth is essential for obtaining reliable soft information from the inner code.

Borah, Shantom K. [Arizona U. (main)]↗

Geometric Interpretation of the Cluster Location Problem Part I: Theory

We present a new framing of the seismic location problem using principles drawn from differential geometry. Our interpretation relies upon the common assumption that travel times observed across a network are continuous, differentiable functions of source location. In consequence, travel‐time functions constitute a differentiable map between the source region and a Riemannian manifold. The manifold is said to be the image of the source region embedded in a generally high‐dimension travel‐time vector space. A cluster of events in the source region has an image of discrete points on the manifold, that, except in the simplest cases, cannot be viewed directly. However, it is possible to project the image of a cluster into a tangent space of the manifold for direct visualization. The projection operator can be computed directly from the data without a velocity model, but produces a distorted rendering of the cluster geometry. With a model we can predict the distortions and correct them to estimate cluster geometry. We develop these points with the simplest possible example, one for which direct visualization of the manifold is possible, using the example as an introduction to the relevant concepts from differential geometry in a familiar setting. The tangent space, a local linearization of the manifold, plays a key role. We develop a metric to estimate the limits of linearization, that is, to determine when the curvature of the manifold invalidates the linear assumption. We also examine the interplay of model error, inadequate network geometry, and pick error. We then generalize our results from the simple case to the general case of 3D source regions observed by general networks. Although we do suggest a new “project and correct” method for location, we do not develop it into a practical algorithm. In conclusion, our intention rather is to highlight new analytical methods grounded in differential geometry.

East Pacific Ocean Islands↗