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 1,099 records · Page 61

Matter power spectrum and the challenge of percent accuracy

Future galaxy surveys require one percent precision in the theoretical knowledge of the power spectrum over a large range including very nonlinear scales. While this level of accuracy is easily obtained in the linear regime with perturbation theory, it represents a serious challenge for small scales where numerical simulations are required. In this paper we quantify the precision of present-day N -body methods, identifying main potential error sources from the set-up of initial conditions to the measurement of the final power spectrum. We directly compare three widely used N -body codes, Ramses, Pkdgrav3, and Gadget3 which represent three main discretisation techniques: the particle-mesh method, the tree method, and a hybrid combination of the two. For standard run parameters, the codes agree to within one percent at k ≤1 h Mpc{sup −1} and to within three percent at k ≤10 h Mpc{sup −1}. We also consider the bispectrum and show that the reduced bispectra agree at the sub-percent level for k ≤ 2 h Mpc{sup −1}. In a second step, we quantify potential errors due to initial conditions, box size, and resolution using an extended suite of simulations performed with our fastest code Pkdgrav3. We demonstrate that the simulation box size should not be smaller than L =0.5 h {sup −1}Gpc to avoid systematic finite-volume effects (while much larger boxes are required to beat down the statistical sample variance). Furthermore, a maximum particle mass of M {sub p}=10{sup 9} h {sup −1}M{sub ⊙} is required to conservatively obtain one percent precision of the matter power spectrum. As a consequence, numerical simulations covering large survey volumes of upcoming missions such as DES, LSST, and Euclid will need more than a trillion particles to reproduce clustering properties at the targeted accuracy.

79 ASTRONOMY AND ASTROPHYSICS↗

Cross-correlation of Planck CMB lensing with DESI-like LRGs

ABSTRACT Cross-correlations between the lensing of the cosmic microwave background (CMB) and other tracers of large-scale structure provide a unique way to reconstruct the growth of dark matter, break degeneracies between cosmology and galaxy physics, and test theories of modified gravity. We detect a cross-correlation between Dark Energy Spectroscopic Instrument (DESI)-like luminous red galaxies (LRGs) selected from DECam Legacy Survey imaging and CMB lensing maps reconstructed with the Planck satellite at a significance of S/N = 27.2 over scales ℓmin = 30, ℓmax = 1000. To correct for magnification bias, we determine the slope of the LRG cumulative magnitude function at the faint limit as s = 0.999 ± 0.015, and find corresponding corrections of the order of a few per cent for $C^{\kappa g}_{\ell }, C^{gg}_{\ell }$ across the scales of interest. We fit the large-scale galaxy bias at the effective redshift of the cross-correlation zeff ≈ 0.68 using two different bias evolution agnostic models: a HaloFit times linear bias model where the bias evolution is folded into the clustering-based estimation of the redshift kernel, and a Lagrangian perturbation theory model of the clustering evaluated at zeff. We also determine the error on the bias from uncertainty in the redshift distribution; within this error, the two methods show excellent agreement with each other and with DESI survey expectations.

79 ASTRONOMY AND ASTROPHYSICS↗

MIC-DP: A Scalable Correlation-Aware Differential Privacy Framework for High-Dimensional Data

Conventional differential privacy (DP) assumes record independence, limiting effectiveness on real-world datasets with temporal, spatial, or structural correlations. These dependencies undermine privacy guarantees and degrade utility in domains like healthcare, IoT, and smart city analytics. We propose Maximum Information Correlated Differential Privacy (MIC-DP), a novel framework that dynamically calibrates noise based on statistical dependencies. MIC-DP uses the Maximum Information Coefficient (MIC) to capture both linear and nonlinear correlations without explicit modeling, enabling adaptive sensitivity adjustment and improved privacy–utility trade-offs. Evaluations on healthcare (MIMIC), demographic (ACI), and synthetic datasets show that MIC-DP reduces mean absolute error (MAE) by up to 5.2% under strict privacy budgets (ϵ≤1), with aggregate utility improvements reaching 18% across datasets and evaluation metrics. MIC-DP provides formal (ϵ,δ)-privacy guarantees, scales efficiently with feature count, and supports deployment in moderate-scale, privacy-sensitive applications. Its tunable performance and runtime efficiency make MIC-DP suitable for privacy-sensitive applications where low-latency analytics and strong privacy guarantees must coexist. These results demonstrate MIC-DP’s effectiveness as a correlation-aware solution for practical DP.

Yang, Wenjun [Univ. of Washington, Tacoma, WA (Uni↗

Four dimensional magnetic resonance imaging with retrospective k-space reordering: A feasibility study

Purpose: Current four dimensional magnetic resonance imaging (4D-MRI) techniques lack sufficient temporal/spatial resolution and consistent tumor contrast. To overcome these limitations, this study presents the development and initial evaluation of a new strategy for 4D-MRI which is based on retrospective k-space reordering. Methods: We simulated a k-space reordered 4D-MRI on a 4D digital extended cardiac-torso (XCAT) human phantom. A 2D echo planar imaging MRI sequence [frame rate (F) = 0.448 Hz; image resolution (R) = 256 × 256; number of k-space segments (N{sub KS}) = 4] with sequential image acquisition mode was assumed for the simulation. Image quality of the simulated “4D-MRI” acquired from the XCAT phantom was qualitatively evaluated, and tumor motion trajectories were compared to input signals. In particular, mean absolute amplitude differences (D) and cross correlation coefficients (CC) were calculated. Furthermore, to evaluate the data sufficient condition for the new 4D-MRI technique, a comprehensive simulation study was performed using 30 cancer patients’ respiratory profiles to study the relationships between data completeness (C{sub p}) and a number of impacting factors: the number of repeated scans (N{sub R}), number of slices (N{sub S}), number of respiratory phase bins (N{sub P}), N{sub KS}, F, R, and initial respiratory phase at image acquisition (P{sub 0}). As a proof-of-concept, we implemented the proposed k-space reordering 4D-MRI technique on a T2-weighted fast spin echo MR sequence and tested it on a healthy volunteer. Results: The simulated 4D-MRI acquired from the XCAT phantom matched closely to the original XCAT images. Tumor motion trajectories measured from the simulated 4D-MRI matched well with input signals (D = 0.83 and 0.83 mm, and CC = 0.998 and 0.992 in superior–inferior and anterior–posterior directions, respectively). The relationship between C{sub p} and N{sub R} was found best represented by an exponential function (C{sub P}=100(1−e{sup −0.18N{sub R}}), when N{sub S} = 30, N{sub P} = 6). At a C{sub P} value of 95%, the relative error in tumor volume was 0.66%, indicating that N{sub R} at a C{sub P} value of 95% (N{sub R,95%}) is sufficient. It was found that N{sub R,95%} is approximately linearly proportional to N{sub P} (r = 0.99), and nearly independent of all other factors. The 4D-MRI images of the healthy volunteer clearly demonstrated respiratory motion in the diaphragm region with minimal motion induced noise or aliasing. Conclusions: It is feasible to generate respiratory correlated 4D-MRI by retrospectively reordering k-space based on respiratory phase. This new technology may lead to the next generation 4D-MRI with high spatiotemporal resolution and optimal tumor contrast, holding great promises to improve the motion management in radiotherapy of mobile cancers.

60 APPLIED LIFE SCIENCES↗

MO-F-CAMPUS-J-05: Toward MRI-Only Radiotherapy: Novel Tissue Segmentation and Pseudo-CT Generation Techniques Based On T1 MRI Sequences

Purpose: To develop and validate a 4 class tissue segmentation approach (air cavities, background, bone and soft-tissue) on T1 -weighted brain MRI and to create a pseudo-CT for MRI-only radiation therapy verification. Methods: Contrast-enhanced T1-weighted fast-spin-echo sequences (TR = 756ms, TE= 7.152ms), acquired on a 1.5T GE MRI-Simulator, are used.MRIs are firstly pre-processed to correct for non uniformity using the non parametric, non uniformity intensity normalization algorithm. Subsequently, a logarithmic inverse scaling log(1/image) is applied, prior to segmentation, to better differentiate bone and air from soft-tissues. Finally, the following method is enrolled to classify intensities into air cavities, background, bone and soft-tissue:Thresholded region growing with seed points in image corners is applied to get a mask of Air+Bone+Background. The background is, afterward, separated by the scan-line filling algorithm. The air mask is extracted by morphological opening followed by a post-processing based on knowledge about air regions geometry. The remaining rough bone pre-segmentation is refined by applying 3D geodesic active contours; bone segmentation evolves by the sum of internal forces from contour geometry and external force derived from image gradient magnitude.Pseudo-CT is obtained by assigning −1000HU to air and background voxels, performing linear mapping of soft-tissue MR intensities in [-400HU, 200HU] and inverse linear mapping of bone MR intensities in [200HU, 1000HU]. Results: Three brain patients having registered MRI and CT are used for validation. CT intensities classification into 4 classes is performed by thresholding. Dice and misclassification errors are quantified. Correct classifications for soft-tissue, bone, and air are respectively 89.67%, 77.8%, and 64.5%. Dice indices are acceptable for bone (0.74) and soft-tissue (0.91) but low for air regions (0.48). Pseudo-CT produces DRRs with acceptable clinical visual agreement to CT-based DRR. Conclusion: The proposed approach makes it possible to use T1-weighted MRI to generate accurate pseudo-CT from 4-class segmentation.

60 APPLIED LIFE SCIENCES↗

Robust Containment Queries over Collections of Rational Parametric Curves via Generalized Winding Numbers

Point containment queries for regions bound by watertight geometric surfaces, i.e., closed and without self-intersections, can be evaluated straightforwardly with a number of well-studied algorithms. When this assumption on domain geometry is not met, such methods are either unusable, or prone to misclassifications that can lead to cascading errors in downstream applications. More robust point classification schemes based on generalized winding numbers have been proposed, as they are indifferent to these imperfections. However, existing algorithms are limited to point clouds and collections of linear elements. We extend this methodology to encompass more general curved shapes with an algorithm that evaluates the winding number scalar field over unstructured collections of rational parametric curves. In particular, we evaluate the winding number for each curve independently, making the derived containment query robust to how the curves are arranged. We ensure geometric fidelity in our queries by treating each curve as equivalent to an adaptively constructed polyline that provably has the same generalized winding number at the point of interest. Our algorithm is numerically stable for points that are arbitrarily close to the model, and explicitly treats points that are coincident with curves. We demonstrate the improvements in computational performance granted by this method over conventional techniques as well as the robustness induced by its application.

97 MATHEMATICS AND COMPUTING↗

Prediction of Alpha-Particle-Immune Gate-All-Around Field-Effect Transistors (GAA-FET) Based SRAM Design

Alpha particles are known to be a major source of particles creating soft errors in semiconductor devices, such as content flipping in Static Random-Access Memory (SRAM). Recent advancements in transistor nodes have led to the introduction of Gate-All-Around Field Effect Transistors (GAA-FETs), which have better gate control, thus better electrostatics. Moreover, the introduction of bottom dielectric isolation (BDI) eliminates substrate leakage and thus is expected to enhance its radiation hardness. It is thus important to explore if one can design an SRAM that is completely radiation-hard to alpha particles. In this paper, using 3D Technology Computer-Aided-Design (TCAD) simulations, we show that it is possible to design an SRAM using GAA-FET technology so that it is immune to single alpha particle radiation error. In other words, with the design, there will be no single-event upset (SEU) due to alpha particles. We first use ab initio calculations in PHITS to show that there is a maximum linear energy transfer (LET), LET max , for the alpha particle in Si and Si x Ge 1-x . Based on that, by de signing a sub-7nm GAA-FET-based SRAM with BDI, we show that the SRAM does not flip even if the particle strike is in the worst-case scenario for LET > LET max .

42 ENGINEERING↗

Validation of the DESI-DR1 3x2-pt analysis: scale cut and shear ratio tests

Combined survey analyses of galaxy clustering and weak gravitational lensing (3x2-pt studies) will allow new and accurate tests of the standard cosmological model. However, careful validation is necessary to ensure that these cosmological constraints are not biased by uncertainties associated with the modelling of astrophysical or systematic effects. In this study we validate the combined 3x2-pt analysis of the Dark Energy Spectroscopic Instrument Data Release 1 (DESI-DR1) spectroscopic galaxy clustering and overlapping weak lensing datasets from the Kilo-Degree Survey (KiDS), the Dark Energy Survey (DES), and the Hyper-Suprime-Cam Survey (HSC). By propagating the modelling uncertainties associated with the non-linear matter power spectrum, non-linear galaxy bias and baryon feedback, we design scale cuts to ensure that measurements of the matter density and the amplitude of the matter power spectrum are biased by less than 30% of the statistical error. We also test the internal consistency of the data and weak lensing systematics by performing new measurements of the lensing shear ratio. We demonstrate that the DESI-DR1 shear ratios can be successfully fit by the same model used to describe cosmic shear correlations, and analyse the additional information that can be extracted about the source redshift distributions and intrinsic alignment parameters. This study serves as crucial preparation for the upcoming cosmological parameter analysis of these datasets.

Emas, N. [Swinburne U., Ctr. Astrophys. Supercompu↗

Long-time uncertainty propagation using generalized polynomial chaos and flow map composition

We present an efficient and accurate method for long-time uncertainty propagation in dynamical systems. Uncertain initial conditions and parameters are both addressed. The method approximates the intermediate short-time flow maps by spectral polynomial bases, as in the generalized polynomial chaos (gPC) method, and uses flow map composition to construct the long-time flow map. In contrast to the gPC method, this approach has spectral error convergence for both short and long integration times. The short-time flow map is characterized by small stretching and folding of the associated trajectories and hence can be well represented by a relatively low-degree basis. The composition of these low-degree polynomial bases then accurately describes the uncertainty behavior for long integration times. The key to the method is that the degree of the resulting polynomial approximation increases exponentially in the number of time intervals, while the number of polynomial coefficients either remains constant (for an autonomous system) or increases linearly in the number of time intervals (for a non-autonomous system). The findings are illustrated on several numerical examples including a nonlinear ordinary differential equation (ODE) with an uncertain initial condition, a linear ODE with an uncertain model parameter, and a two-dimensional, non-autonomous double gyre flow.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Novel Technique for Developing Linearized Convex System Models from Experimentally Derived Data

This paper presents a novel technique for generating a convex system model from an experimentally derived data set which features variance among repeated measurements. The convex system model developed as a test case characterizes the dynamic system losses of a vanadium redox flow battery as a function of the active power output and the battery state of charge. The technique hinges on a pre-cleaning via clustering procedure which precedes the formation of a planar convex hull comprised of triangular simplices. The clustering procedure efficiently reduces the experimental data set while mitigating variance among repeated measurements and removes outliers. Ultimately, the lower evelope of the planar convex hull serves as the desired convex system model. The proposed technique reduces systematic model error which is otherwise present when directly developing a planar convex hull model based on an unreduced data set.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Vernier Regulator for ILC Marx Droop Compensation

A two-part compensation scheme, Vernier Regulation, has been applied to offset the voltage droop (40% without correction) in a Marx-topology klystron modulator developed for the International Linear Collider (ILC). Coarse regulation, {+-}5%, is achieved by turning on additional Main Marx cells (Delayed Cells) sequentially as the droop reaches the cell voltage (11 kV). Further regulation to {+-}0.5% is achieved by adding a small Marx in series with the Main Marx. This Vernier Marx is composed of sixteen, 1.2 kV cells that are assembled as a seventeenth cell in the Main Marx. These Vernier Cells are turned on sequentially to generate a series of discrete corrections to the droop in the Main Marx cells with a step size {le}1% of the output voltage. As the required correction reaches 11 kV, all Vernier Cells are turned off synchronously with the turn on of a Delayed Cell. There are up to five Delayed Cells and six Vernier Marx cycles during each ILC Marx output pulse. The Vernier Marx has a local control system that will detect and respond to over-voltage and over-current errors. In this paper, a detailed description of the design, implementation and testing of the Vernier Marx is presented.

43 PARTICLE ACCELERATORS↗

Multistage mixed precision iterative refinement

Abstract Low precision arithmetic, in particular half precision (16‐bit) floating point arithmetic, is now available in commercial hardware. Using lower precision can offer significant savings in computation and communication costs with proportional savings in energy. Motivated by this, there has been a renewed interest in mixed precision iterative refinement schemes for solving linear systems , and new variants of GMRES‐based iterative refinement have been developed. Each particular variant with a given combination of precisions leads to different condition number‐based constraints for convergence of the backward and forward errors, and each has different performance costs. The constraints for convergence given in the literature are, as an artifact of the analyses, often overly strict in practice, and thus could lead a user to select a more expensive variant when a less expensive one would have sufficed. In this work, we develop a multistage mixed precision iterative refinement solver which aims to combine existing mixed precision approaches to balance performance and accuracy and improve usability. For a user‐specified initial combination of precisions, the algorithm begins with the least expensive approach and convergence is monitored via inexpensive computations with quantities produced during the iteration. If slow convergence or divergence is detected using particular stopping criteria, the algorithm switches to use a more expensive, but more reliable variant. A novel aspect of our approach is that, unlike existing implementations, our algorithm first attempts to use “stronger” GMRES‐based solvers for the solution update before resorting to increasing the precision(s). In some scenarios, this can avoid the need to refactorize the matrix in higher precision. We perform extensive numerical experiments on a variety of random dense problems and problems from real applications which confirm the benefits of the multistage approach.

Oktay, Eda↗

Learning high-dimensional parametric maps via reduced basis adaptive residual networks

We propose a scalable framework for the learning of high-dimensional parametric maps via adaptively constructed residual network (ResNet) maps between reduced bases of the inputs and outputs. When just few training data are available, it is beneficial to have a compact parametrization in order to ameliorate the ill-posedness of the neural network training problem. By linearly restricting high-dimensional maps to informed reduced bases of the inputs, one can compress high-dimensional maps in a constructive way that can be used to detect appropriate basis ranks, equipped with rigorous error estimates. A scalable neural network learning framework is thus to learn the nonlinear compressed reduced basis mapping. Unlike the reduced basis construction, however, neural network constructions are not guaranteed to reduce errors by adding representation power, making it difficult to achieve good practical performance. Inspired by recent approximation theory that connects ResNets to sequential minimizing flows, we present an adaptive ResNet construction algorithm. This algorithm allows for depth-wise enrichment of the neural network approximation, in a manner that can achieve good practical performance by first training a shallow network and then adapting. We prove universal approximation of the associated neural network class for $L^2_v$ functions on compact sets. Our overall framework allows for constructive means to detect appropriate breadth and depth, and related compact parametrizations of neural networks, significantly reducing the need for architectural hyperparameter tuning. Numerical experiments for parametric PDE problems and a 3D CFD wing design optimization parametric map demonstrate that the proposed methodology can achieve remarkably high accuracy for limited training data, and outperformed other neural network strategies we compared against.

42 ENGINEERING↗

Data-driven reduced-order models for port-Hamiltonian systems with operator inference

Hamiltonian operator inference has been developed in Sharma et al. (2022) to learn structure-preserving reduced-order models (ROMs) for Hamiltonian systems. The method constructs a low-dimensional model using only data and knowledge of the functional form of the Hamiltonian. The resulting ROMs preserve the intrinsic structure of the system, ensuring that the mechanical and physical properties of the system are maintained. In this work, we extend this approach to port-Hamiltonian systems, which generalize Hamiltonian systems by including energy dissipation, external input, and output. Based on snapshots of the system’s state and output, together with the information about the functional form of the Hamiltonian, reduced operators are inferred through optimization and are then used to construct data-driven ROMs. To further alleviate the complexity of evaluating nonlinear terms in the ROMs, a hyper-reduction method via discrete empirical interpolation is applied. Accordingly, we derive error estimates for the ROM approximations of the state and output. Lastly, we demonstrate the structure preservation, as well as the accuracy of the proposed port-Hamiltonian operator inference framework, through numerical experiments on a linear mass–spring-damper problem and a nonlinear Toda lattice problem.

97 MATHEMATICS AND COMPUTING↗

A domain decomposition method for pseudo-spectral electromagnetic simulations of plasmas

Pseudo-spectral electromagnetic solvers (i.e. representing the fields in Fourier space) have extraordinary precision. In particular, Haber et al. presented in 1973 a pseudo-spectral solver that integrates analytically the solution over a finite time step, under the usual assumption that the source is constant over that time step. Yet, pseudo-spectral solvers have not been widely used, due in part to the difficulty for efficient parallelization owing to global communications associated with global FFTs on the entire computational domains. A method for the parallelization of electromagnetic pseudo-spectral solvers is proposed and tested on single electromagnetic pulses, and on Particle-In-Cell simulations of the wakefield formation in a laser plasma accelerator. The method takes advantage of the properties of the Discrete Fourier Transform, the linearity of Maxwell’s equations and the finite speed of light for limiting the communications of data within guard regions between neighboring computational domains. Although this requires a small approximation, test results show that no significant error is made on the test cases that have been presented. The proposed method opens the way to solvers combining the favorable parallel scaling of standard finite-difference methods with the accuracy advantages of pseudo-spectral methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Implicit-explicit Runge-Kutta for radiation hydrodynamics I: Gray diffusion

Radiation hydrodynamics are a challenging multiscale and multiphysics set of equations. To capture the relevant physics of interest, one typically must time step on the hydrodynamics timescale, making explicit integration the obvious choice. On the other hand, the coupled radiation equations have a scaling such that implicit integration is effectively necessary in non-relativistic regimes. A first-order Lie-Trotter-like operator split is the most common time integration scheme used in practice, alternating between an explicit hydrodynamics step and an implicit radiation solve and energy deposition step. However, such a scheme is limited to first-order accuracy, and nonlinear coupling between the radiation and hydrodynamics equations makes a more general additive partitioning of the equations non-trivial. Here, we develop a new formulation and partitioning of radiation hydrodynamics with gray diffusion that allows us to apply (linearly) implicit-explicit Runge-Kutta time integration schemes. In conclusion, we prove conservation of total energy in the new framework, and demonstrate 2nd-order convergence in time on multiple radiative shock problems, achieving error 3–5 orders of magnitude smaller than the first-order Lie-Trotter operator split at the hydrodynamic CFL, even when Lie-Trotter applies a 3rd-order TVD Runge-Kutta scheme to the hydrodynamics equations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Long distance fiber-optic displacement sensor based on fiber collimator

A simple fiber-optic displacement sensor based on reflective intensity modulated technology is demonstrated using a fiber collimator. The sensing range is over 30 cm, which is over 100 times that of the conventional fiber-optic displacement sensor based on the normal single-mode fiber. The measured data are fitted into linear equation very well and the values of R-square are more than 0.995. The sensitivity of the device achieves 0.426 dB/cm over the range of 5-30 cm. By applying the relative technique, the errors resulted from the fluctuation of light source and influences of environment are effectively eliminated, and the stability for wide range measurement can be improved. The simplicity of the design, high dynamic range, stability and the ease of the fabrication make it suitable for applications in industries.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Deep learning surrogate model for kinetic Landau-fluid closure with collision

In this work, the kinetic Landau-fluid (LF) closure with collision and periodic boundary condition is used in the development of the deep learning (DL) surrogate model. A classical neural network, namely, feedforward neural network or sometimes termed multilayer perceptron, is constructed and trained to learn the kinetic LF closure in the static limit and arbitrary mean free path in configuration space. The preliminary relation between best hyperparameters and critical parameters for data generation is found. Compared with the numerical approach (non-Fourier method) of the LF closure, the deep learning surrogate model shows an order of magnitude of improvement in terms of accuracy. Perhaps most importantly, the surrogate model closure has been integrated for the first time with fluid simulations. Our DL-enabled fluid simulations, for the first time, give the correct Landau damping rate for a wide range of wave vectors, while the Hammett–Perkins closure cannot produce the correct damping rate. We correctly connect the collisionless Hammett–Perkins closure and collisional Braginskii closure to reproduce the intrinsic nonlocal feature of the heat flux with DL techniques. We address the most concerning error accumulation problem and find that simulations with the deep learning surrogate model are as good as, if not better than, simulations with the analytic closure in terms of long-term numerical stability in the linear Landau damping test.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗