Search NASA⌕ Search

SEARCH · Search NASA

Results for “Localization 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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Local modeling for FRF estimation with noisy input measurements

The frequency response function (FRF) is an essential means by which dynamic systems are qualified. In recent years, local modeling approaches have been extensively researched and shown to significantly outperform traditional FRF estimators. However, the standard local modeling approach assumes a perfectly-known system input, which results in biased FRF estimates in the presence of input noise. This paper derives a simple adjustment that can be used to improve FRF estimation for systems subjected to random excitation with noisy input data. This improvement can be implemented with little modification to standard local modeling algorithms and with little additional computational burden. The adjustment is coupled with a model selection procedure to avoid underfitting and overfitting. In conclusion, the methods presented in this paper are validated on a simulation, and they are shown to reduce bias due to input noise.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Statistical learning for predicting density–matrix-based electron dynamics

In this study, we consider the problem of learning density-dependent molecular Hamiltonian matrices from time series of electron density matrices, all in the context of Hartree–Fock theory. Prior work developed a solution to this problem for small molecular systems with density and Hamiltonian matrices of size at most 6 × 6. Here, using a battery of techniques, we scale prior methods to larger molecular systems with, for example, 29 × 29 matrices. This includes systems that either have more electrons or are expressed in large basis sets such as 6-311++G**. Scaling the method to larger systems enhances its relevance for realistic applications in chemistry and physics. To achieve this scaling, we apply dimensionality reduction, ridge regression and analytic computation of Hessians. Through the combination of these techniques, we are able to learn Hamiltonians by minimizing an objective function that encodes local propagation error. Importantly, these learned Hamiltonians can then be used to predict electron dynamics for thousands of steps: When we use our learned Hamiltonians to numerically solve the time-dependent Hartree–Fock equation, we obtain predicted dynamics that are in close quantitative agreement with ground truth dynamics. This includes field-off trajectories similar to the training data and field-on trajectories outside of the training data.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2026

U-net architected deep material network training with microstructure local field information

The Deep Material Network (DMN) has recently emerged as a powerful reduced-order modeling framework for simulating the mechanical response of heterogeneous materials such as composites. Unlike most data-driven approaches that directly learn a material’s response under prescribed loading, the DMN acts as a homogenization operator, learning the kinematic constraints and mechanical interactions of the underlying microstructure. However, traditional DMN training relies exclusively on homogenized effective properties derived from Direct Numerical Simulations (DNS), discarding the rich local field data that govern microstructural interactions. In this work, we extend the DMN framework to incorporate such local field information into the offline training process. Utilizing a U-Net architecture, we augment the DMN training objective to include the first and second statistical moments of the local stress fields obtained from linear DNS. This ensures that the learned network topology not only fits the effective stiffness but also accurately reflects the internal local stress and strain partitioning of the microstructure. The results confirm that supervising the localization process during training yields a superior surrogate model, reducing local prediction errors by an order of magnitude and significantly improving generalization to unseen nonlinear constitutive behaviors compared to traditional DMNs.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Accelerating Multivariate Functional Approximation Computation with Domain Decomposition Techniques⋆

Modeling large datasets through Multivariate Functional Approximations (MFA) provide an elegant way to handle many visualization and scientific analysis workflows. The process necessitates scalable data partitioning methods to compute MFA representations efficiently without compromising the accuracy or continuity of the reconstructed solution. We propose a domain -decomposed method for computing the MFA with B -spline bases, which reduces the total work per task and uses a restricted Additive Schwarz (RAS) method to converge the control point data degrees -of -freedom along subdomain boundaries. We provide an in-depth analysis of the parallel approach with domain decomposition solvers, aiming to minimize local subdomain error residuals and recover high -order continuity at subdomain interfaces with appropriate choices of knot overlaps. The communication cost, determined by the overlap regions in the RAS implementation, is optimized to recover the numerical error profile of the single subdomain case. Our proposed method stands in contrast to previous methods, which typically only recover either C 0 or at best C 1 continuity for arbitrary B -spline degree expansions, or those that require post -processing to blend discontinuities in the reconstructed data. We demonstrate the effectiveness of our approach using analytical and real -world datasets in 1D, 2D, and 3D through both strong and weak scaling studies. The performance results indicate that the overall cost of computing the approximation is directly proportional to the underlying nearest -neighbor communication implementation, and is only weakly dependent on the overlap region size that determines the size of the messages. This finding underscores the efficiency and scalability of our proposed method, making it a promising solution for handling large datasets in scientific workflows.

additive Schwarz solvers↗
DOE OSTI2025

Resolving discrepancies in bang-time predictions for indirect-drive ICF experiments on the NIF: Insights from the Build-A-Hohlraum campaign

This study investigated discrepancies between measured and simulated x-ray drive in Indirect-Drive Inertial Confinement Fusion (ID-ICF) hohlraums at the National Ignition Facility. Despite advances in radiation-hydrodynamic simulations, a consistent “drive deficit” remains. Experimentally measured ID-ICF capsule bang-times are systematically 400–700 ps later than simulations predict. The Build-A-Hohlraum (BAH) campaign explored potential causes for this discrepancy by systematically varying hohlraum features, including laser entrance hole (LEH) windows, capsules, and gas fills. Overall, the agreement between simulated and experimental x-ray drive was found to be largely unaffected by these changes. The data allow us to exclude some hypotheses put forward to potentially explain the discrepancy. Errors in the local thermodynamic equilibrium (LTE) atomic modeling, errors in the modeling of LEH closure, and errors due to a lack of plasma species mix physics in simulations are shown to be inconsistent with our measurements. Instead, the data support the hypothesis that errors in NLTE emission modeling are a significant contributor to the discrepancy. X-ray emission in the 2–4 keV range is found to be approximately 30% lower than in simulations. This is accompanied by higher than predicted electron temperatures in the gold bubble region, pointing to errors in non-LTE modeling. Introducing an opacity multiplier of 0.87 on energy groups above 1.8 keV improves agreement with experimental data, reducing the bang-time discrepancy from 300 to 100 ps. These results underscore the need for refined NLTE opacity models to enhance the predictive power of hohlraum simulations.

Band emission↗
DOE OSTI2025

Deterministic High-Fidelity Neutronics Simulation of Pebble Bed Reactors Using Pebble Tracking Transport

The pebble tracking transport (PTT) algorithm offers a high-fidelity deterministic approach for neutron transport for pebble bed reactors (PBRs). This approach requires the mesh for the active-core region to consist exclusively of tetrahedral elements, where each node in the pebble-packing region represents a pebble centroid. This paper investigates the application of PTT for full-scale PBRs, considering both the isothermal and the temperature-dependent core conditions. Macroscopic cross sections are generated using Serpent 2 full-core eigenvalue simulations where pebbles are grouped into disjoint subsets using machine learning. To minimize the need for individual cross-section sets for each pebble in the core, K-means clustering is used to group pebbles by temperature and neutronic environment parameters. Here, we compare the multiplication factor and power rate distributions between PTT simulations using the Griffin reactor physics software and reference solutions from Serpent 2. Our analysis shows that a full-core, high-fidelity PTT calculation produces accurate results with minimal local (pebblewise) errors. Additionally, timing results indicate that PTT simulations converge rapidly on modern supercomputing platforms.

Griffin↗
DOE OSTI2020

Accurate and complete genomes from metagenomes

Genomes are an integral component of the biological information about an organism; thus, the more complete the genome, the more informative it is. Historically, bacterial and archaeal genomes were reconstructed from pure (monoclonal) cultures, and the first reported sequences were manually curated to completion. However, the bottleneck imposed by the requirement for isolates precluded genomic insights for the vast majority of microbial life. Shotgun sequencing of microbial communities, referred to initially as community genomics and subsequently as genome-resolved metagenomics, can circumvent this limitation by obtaining metagenome-assembled genomes (MAGs); but gaps, local assembly errors, chimeras, and contamination by fragments from other genomes limit the value of these genomes. Here, we discuss genome curation to improve and, in some cases, achieve complete (circularized, no gaps) MAGs (CMAGs). To date, few CMAGs have been generated, although notably some are from very complex systems such as soil and sediment. Through analysis of about 7000 published complete bacterial isolate genomes, we verify the value of cumulative GC skew in combination with other metrics to establish bacterial genome sequence accuracy. The analysis of cumulative GC skew identified potential misassemblies in some reference genomes of isolated bacteria and the repeat sequences that likely gave rise to them. We discuss methods that could be implemented in bioinformatic approaches for curation to ensure that metabolic and evolutionary analyses can be based on very high-quality genomes.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Adaptive Time Step Control for Multirate Infinitesimal Methods

Multirate methods have been used for decades to temporally evolve initial-value problems in which different components evolve on distinct time scales, and thus use of different step sizes for these components can result in increased computational efficiency. Generally, such methods select these different step sizes based on experimentation or stability considerations. For problems that evolve on a single time scale, adaptivity approaches that strive to control local temporal error are widely used to achieve numerical results of a desired accuracy with minimal computational effort, while alleviating the need for manual experimentation with different time step sizes. However, there is a notable gap in the publication record on the development of adaptive time step controllers for multirate methods. In this paper, we extend the single-rate controller work of Gustafsson [ACM Trans. Math. Software, 20 (1994), pp. 496-517] to the multirate method setting. Specifically, we develop controllers based on polynomial approximations to the principal error functions for both the "fast" and "slow" time scales within multirate infinitesimal (MRI) methods. We additionally investigate a variety of approaches for estimating the errors arising from each time scale within MRI methods. We then numerically evaluate the proposed multirate controllers and error estimation strategies on a range of multirate test problems, comparing their performance against an estimated optimal performance. Through this work, we combine the most performant of these approaches to arrive at a set of multirate adaptive time step controllers that robustly achieve desired solution accuracy with minimal computational effort.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

CFL Optimized Forward–Backward Runge–Kutta Schemes for the Shallow-Water Equations

Abstract We present the formulation and optimization of a Runge–Kutta-type time-stepping scheme for solving the shallow-water equations, aimed at substantially increasing the effective allowable time step over that of comparable methods. This scheme, called FB-RK(3,2), uses weighted forward–backward averaging of thickness data to advance the momentum equation. The weights for this averaging are chosen with an optimization process that employs a von Neumann–type analysis, ensuring that the weights maximize the admittable Courant number. Through a simplified local truncation error analysis and numerical experiments, we show that the method is at least second-order in time for any choice of weights and exhibits low dispersion and dissipation errors for well-resolved waves. Further, we show that an optimized FB-RK(3,2) can take time steps up to 2.8 times as large as a popular three-stage, third-order strong stability-preserving Runge–Kutta method in a quasi-linear test case. In fully nonlinear shallow-water test cases relevant to oceanic and atmospheric flows, FB-RK(3,2) outperforms SSPRK3 in admittable time step by factors roughly between 1.6 and 2.2, making the scheme approximately twice as computationally efficient with little to no effect on solution quality. Significance Statement The purpose of this work is to develop and optimize time-stepping schemes for models relevant to oceanic and atmospheric flows. Specifically, for the shallow-water equations we optimize for schemes that can take time steps as large as possible while retaining solution quality. We find that our optimized schemes can take time steps between 1.6 and 2.2 times larger than schemes that cost the same number of floating point operations, translating directly to a corresponding speedup. Our ultimate goal is to use these schemes in climate-scale simulations.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Random adaptive tool path for zonal optics fabrication

Deterministic optics fabrication using sub-aperture tools has been vital for manufacturing precision optical surfaces. The fabrication process requires the tool influence function and the tool path to calculate the dwell time that guides the tool to bring surface quality within tight design tolerances. Widely used spiral and raster paths may leave excess waviness from the tool path, and the unavoidable constant removal layer is added to obtain positive dwell time. This waviness can be removed by either using smaller tools sequentially or randomizing the tool path. However, the existing tool-path solutions can hardly adapt to different surface aperture shapes and localized surface errors. Process efficiency and accuracy are also not well considered in tool-path planning. We propose an innovative zonal Random Adaptive Path (RAP) to solve these problems in this study. Firstly, RAP can be flexibly adapted to different surface aperture shapes by introducing part boundary. Secondly, an average threshold strategy is used in the RAP planning to improve efficiency, enabling the surface errors to be selectively corrected. Finally, the threshold is performed in several passes within one processing cycle, each with its RAP, until the desired residual is achieved. The performance of the proposed RAP is studied by comparing it with the conventional tool paths. The results demonstrated that RAP takes the least processing time and achieves the best surface quality, which verifies the effectiveness of RAP in deterministic optics fabrication.

36 MATERIALS SCIENCE↗
NASA NTRS1972

Generation and application of the equations of condition for high order Runge-Kutta methods

This thesis develops the equations of condition necessary for determining the coefficients for Runge-Kutta methods used in the solution of ordinary differential equations. The equations of condition are developed for Runge-Kutta methods of order four through order nine. Once developed, these equations are used in a comparison of the local truncation errors for several sets of Runge-Kutta coefficients for methods of order three up through methods of order eight.

Haley, D. C.↗
NASA NTRS1973

Mixed finite-difference scheme for analysis of simply supported thick plates.

A mixed finite-difference scheme is presented for the stress and free vibration analysis of simply supported nonhomogeneous and layered orthotropic thick plates. The analytical formulation is based on the linear, three-dimensional theory of orthotropic elasticity and a Fourier approach is used to reduce the governing equations to six first-order ordinary differential equations in the thickness coordinate. The governing equations possess a symmetric coefficient matrix and are free of derivatives of the elastic characteristics of the plate. In the finite difference discretization two interlacing grids are used for the different fundamental unknowns in such a way as to reduce both the local discretization error and the bandwidth of the resulting finite-difference field equations. Numerical studies are presented for the effects of reducing the interior and boundary discretization errors and of mesh refinement on the accuracy and convergence of solutions. It is shown that the proposed scheme, in addition to a number of other advantages, leads to highly accurate results, even when a small number of finite difference intervals is used.

Noor, A. K.↗
NASA NTRS1974

Classical seventh-, sixth-, and fifth-order Runge-Kutta-Nystrom formulas with stepsize control for general second-order differential equations

Runge-Kutta-Nystrom formulas of the seventh, sixth, and fifth order were derived for the general second order (vector) differential equation written as the second derivative of x = f(t, x, the first derivative of x). The formulas include a stepsize control procedure, based on a complete coverage of the leading term of the local truncation error in x, and they require no more evaluations per step than the earlier Runge-Kutta formulas for the first derivative of x = f(t, x). The developed formulas are expected to be time saving in comparison to the Runge-Kutta formulas for first-order differential equations, since it is not necessary to convert the second-order differential equations into twice as many first-order differential equations. The examples shown saved from 25 percent to 60 percent more computer time than the earlier formulas for first-order differential equations, and are comparable in accuracy.

Fehlberg, E.↗
NASA NTRS1973

The Lyapunov stabilization of satellite equations of motion using integrals

A method is introduced that weakens the Lyapunov or in track instability of satellite equations of motion. The method utilizes a linearized energy integral of satellite motion as a constraint on solutions obtained by numerical integration. The procedure prevents local numerical error from altering the frequency associated with the fast angular variable and thereby reduces the Lyapunov instability and the global numerical error. Applications of the method to satellite motion show accuracy improvements of two to three orders of magnitude in position and velocity after 50 revolutions. A modification of the method is presented that allows the use of slowly varying integrals of motion.

Nacozy, P. E.↗
NASA NTRS1974

Time elements

Time elements are introduced for use with Sundman time transformations of the type dt = r(alpha)ds for satellite equations of motion. Two time elements are given, one providing maximum accuracy for alpha = 1, the other for alpha = 2. Time elements and time transformations reduce local truncation error and Liapunov (in track) instability, and provide analytical step size control. Numerical results show accuracy improvements of more than one order of magnitude when time elements are employed with time transformations in the numerical integration of the satellite equations, compared with using time transformations alone.

Nacozy, P. E.↗
NASA NTRS1975

Time elements

Time elements are introduced for use with Sundman time transformations for satellite equations of motion. Two time elements are presented, one providing maximum accuracy when the exponent of the governing equation equals 1, the other when the exponent equals 2. Time elements and time transformations reduce local truncation error and Liapunov (in-track) instability, and provide analytical step size control. Numerical results show accuracy improvements of more than one order of magnitude when time elements are employed with time transformations in the numerical integration of the satellite equations, compared with using time transformations alone.

Nacozy, P. E.↗
NASA NTRS1979

Optimal nodal point distribution for improved accuracy in computational fluid dynamics

In applying finite-difference techniques to flow field problems, the accuracy attained for a fixed number of node points can be improved using unequally-spaced node points. The distribution of these node points is chosen here by minimizing a measure of local truncation error with respect to the parameters which define a transformation between the computational space of equally-spaced node points and the physical space of unequally-spaced node points. The problem then becomes a nonlinear programming problem. Numerical results are presented for two one-dimensional test problems: the Blasius boundary layer problem and the inviscid Burgers' equation.

Pierson, B. L.↗
NASA NTRS1979

Map characteristics of Landsat mosaics

Map characteristics of the Landsat mosaics developed at JPL are considered. Procedures for digital mosaicking of Landsat frames to standard map projections were used to mosaic at full resolution ten scenes over the California desert region and twenty-one scenes over Arizona. The procedures are analyzed for horizontal positioning error (global and local) and the potential for classification error associated with the adjustment of brightness of Z values between frames; the use of this technology for the mapping of extensive features is discussed. Mosaicking facilities, techniques, mapping accuracy, and thematic mapping characteristics are described. A comparative analysis of Landsat mosaicking technology developed at Goddard Space Flight Center, IBM Gaithersburg, and USGS Flagstaff is made, and suggestions are given for algorithm development to improve systems capacity and ability to handle a variety of cases.

Zobrist, A. L.↗