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 1,369 records · Page 76

Dark Energy Survey Year 3 results: Constraints on extensions to Λ CDM with weak lensing and galaxy clustering

We constrain six possible extensions to the Λ cold dark matter (CDM) model using measurements from the Dark Energy Survey’s first three years of observations, alone and in combination with external cosmological probes. The DES data are the two-point correlation functions of weak gravitational lensing, galaxy clustering, and their cross-correlation. We use simulated data vectors and blind analyses of real data to validate the robustness of our results to astrophysical and modeling systematic errors. In many cases, constraining power is limited by the absence of theoretical predictions beyond the linear regime that are reliable at our required precision. The Λ CDM extensions are dark energy with a time-dependent equation of state, nonzero spatial curvature, additional relativistic degrees of freedom, sterile neutrinos with eV-scale mass, modifications of gravitational physics, and a binned σ 8 ( z ) model which serves as a phenomenological probe of structure growth. For the time-varying dark energy equation of state evaluated at the pivot redshift we find ( w p , w a ) = ( - 0.9 9 - 0.17 + 0.28 , - 0.9 ± 1.2 ) at 68% confidence with z p = 0.24 from the DES measurements alone, and ( w p , w a ) = ( - 1.0 3 - 0.03 + 0.04 , - 0. 4 - 0.3 + 0.4 ) with z p = 0.21 for the combination of all data considered. Curvature constraints of Ω k = 0.0009 ± 0.0017 and effective relativistic species N eff = 3.1 0 - 0.16 + 0.15 are dominated by external data, though adding DES information to external low-redshift probes tightens the Ω k constraints that can be made without cosmic microwave background observables by 20%. For massive sterile neutrinos, DES combined with external data improves the upper bound on the mass m eff by a factor of 3 compared to previous analyses, giving 95% limits of ( Δ N eff , m eff ) ≤ ( 0.28 , 0.20 eV ) when using priors matching a comparable Planck analysis. For modified gravity, we constrain changes to the lensing and Poisson equations controlled by functions Σ ( k , z ) = Σ 0 Ω Λ ( z ) / Ω Λ , 0 and μ ( k , z ) = μ 0 Ω Λ ( z ) / Ω Λ , 0 , respectively, to Σ 0 = 0. 6 - 0.5 + 0.4 from DES alone and ( Σ 0 , μ 0 ) = ( 0.04 ± 0.05 , 0.0 8 - 0.19 + 0.21 ) for the combination of all data, both at 68% confidence. Overall, we find no significant evidence for physics beyond Λ CDM .

79 ASTRONOMY AND ASTROPHYSICS↗

Universal Spreading of Conditional Mutual Information in Noisy Random Circuits

For this work, we study the evolution of conditional mutual information (CMI) in generic open quantum systems, focusing on one-dimensional random circuits with interspersed local noise. Unlike in noiseless circuits, where CMI spreads linearly while being bounded by the light cone, we find that noisy random circuits with an error rate 𝑝 exhibit superlinear propagation of CMI, which diverges far beyond the light cone at a critical circuit depth 𝑡 𝑐 ∝ 𝑝 −1 . We demonstrate that the underlying mechanism for such rapid spreading is the combined effect of local noise and a scrambling unitary, which selectively removes short-range correlations while preserving long-range correlations. To analytically capture the dynamics of CMI in noisy random circuits, we introduce a coarse-graining method, and we validate our theoretical results through numerical simulations. Furthermore, we identify a universal scaling law governing the spreading of CMI.

decoherence↗

Bias Correction in Urban Building Energy Modeling for Chicago Using Machine Learning

Urban-scale building energy modeling (UBEM) holds promise for optimizing energy usage across extensive geographic regions. However, there is a recognized bias between simulated energy consumption and actual measured data. This study, based on building data from Chicago, delved into bias correction techniques for enhancing the accuracy of UBEM energy consumption estimates. Initially, the AutoBEM simulation yielded a normalized mean bias error (NMBE) of 1.1% and 51% of Coefficient of the Variation of the Root Mean Square Error (CVRMSE) after outlier exclusion. To address this, three bias correction methods were deployed: Average Mean Bias Error based bias correction, Quantile mapping bias correction, and Machine learning-based bias correction using Linear Regression and Random Forest models. Post-correction results exhibited marked improvement. The NMBE values were diminished to 0 for Average MBE-based, 0.36 for Quantile Mapping, and 0 for Machine Learning-based corrections. Concurrently, the CVRMSE values registered reductions from an original 51 to 50.8 for Quantile Mapping, and 38.56 for Machine Learning-based corrections, pointing towards the effectiveness of specific bias correction methods in refining the precision of UBEM energy predictions. Such accurate estimations are paramount for informed energy planning and urban policy-making.

Chowdhury, Shovan↗

OptZConfig: Efficient Parallel Optimization of Lossy Compression Configuration

Lossless compressors have very low compression ratios that do not meet the needs of today's large-scale scientific applications that produce vast volumes of data. Error-bounded lossy compression (EBLC) is considered a critical technique for the success of scientific research. Although EBLC allows users to set an error bound for the compression, users have been unable to specify the requirements on the compression quality, limiting practical use. Our contributions are: (1) We formulate the problem of configuring EBLC to preserve a user-defined metric as an optimization problem. This allows many classes of new metrics to be preserved, which improves over current practices. (2) We present a framework, OptZConfig, that can adapt to improvements in the search algorithm, compressor, and metrics with minimal changes, enabling future advancements in this area. (3) We demonstrate the advantages of our approach against the leading methods to configure compressors to preserve specific metrics. Here, our approach improves compression ratios against a specialized compressor by up to 3 x, has a 56x speedup over FRaZ, 1000x speedup over MGARD-QOI post tuning, and 110x speedup over systematic approaches which had not been bounded by compressors before.

97 MATHEMATICS AND COMPUTING↗

SU-E-I-72: First Experimental Study of On-Board CBCT Imaging Using 2.5MV Beam On a Radiotherapy Linac

Purpose: Varian TrueBeam version 2.0 comes with a new inline 2.5MV beam modality for image guided patient setup. In this work we develop an iterative volumetric image reconstruction technique specific to the beam and investigate the possibility of obtaining metal artifact free CBCT images using the new imaging modality. Methods: An iterative reconstruction algorithm with a sparse representation constraint based on dictionary learning is developed, in which both sparse projection and low dose rate (10 MU/min) are considered. Two CBCT experiments were conducted using the newly available 2.5MV beam on a Varian TrueBeam linac. First, a Rando anthropomorphic head phantom with and without a copper bar inserted in the center was scanned using both 2.5MV and kV (100kVp) beams. In a second experiment, an MRI phantom with many coils was scanned using 2.5MV, 6MV, and kV (100kVp) beams. Imaging dose and the resultant image quality is studied. Results: Qualitative assessment suggests that there were no visually detectable metal artifacts in MV CBCT images, compared with significant metal artifacts in kV CBCT images, especially in the MRI phantom. For a region near the metal object in the head phantom, the 2.5MV CBCT gave a more accurate quantification of the electron density compared with kV CBCT, with a ∼50% reduction in mean HU error. As expected, the contrast between bone and soft-tissue in 2.5MV CBCT decreased compared with kV CBCT. Conclusion: On-board CBCT imaging with the new 2.5MV beam can effectively reduce metal artifacts, although with a reduced softtissue contrast. Combination of kV and MV scanning may lead to metal artifact free CBCT images with uncompromised soft-tissue contrast.

60 APPLIED LIFE SCIENCES↗

Real-time nonlinear optimization as a generalized equation.

We establish results for the problem of tracking a time-dependent manifold arising in real-time optimization by casting this as a parametric generalized equation. We demonstrate that if points along a solution manifold are consistently strongly regular, it is possible to track the manifold approximately by solving a single linear complementarity problem (LCP) at each time step. We derive sufficient conditions guaranteeing that the tracking error remains bounded to second order with the size of the time step even if the LCP is solved only approximately. We use these results to derive a fast, augmented Lagrangian tracking algorithm and demonstrate the developments through a numerical case study.

36 MATERIALS SCIENCE↗

Parrallel Implementation of Fast Randomized Algorithms for Low Rank Matrix Decomposition

We analyze the parallel performance of randomized interpolative decomposition by de- composing low rank complex-valued Gaussian random matrices larger than 100 GB. We chose a Cray XMT supercomputer as it provides an almost ideal PRAM model permitting quick investigation of parallel algorithms without obfuscation from hardware idiosyncrasies. We obtain that on non-square matrices performance scales almost linearly with runtime about 100 times faster on 128 processors. We also verify that numerically discovered error bounds still hold on matrices two orders of magnitude larger than those previously tested.

Lucas, Andrew J.↗

Neural Ordinary Differential Equations for Nonlinear System Identification

Neural ordinary differential equations (NODE) have been recently proposed as a promising approach for nonlinear system identification tasks. In this work, we systematically compare their predictive performance with current state-of-the-art nonlinear and classical linear methods. In particular, we present a quantitative study comparing NODE's performance against neural state-space models and classical linear system identification methods and evaluate their inference speed and prediction performance on open-loop errors across eight different dynamical systems. The experiments show that NODEs can consistently improve the prediction accuracy by order of magnitude compared to benchmark methods. Besides improved accuracy, we also observed that NODEs are less sensitive to hyperparameters compared to neural state-space models by paying the cost of increased computation at the inference time.

machine leaning, system identification, physics in↗

A Comprehensive Review of Latent Space Dynamics Identification Algorithms for Intrusive and Non-Intrusive Reduced-Order-Modeling

Numerical solvers of partial differential equations (PDEs) have been widely employed for simulating physical systems. However, the computational cost remains a major bottleneck in various scientific and engineering applications, which has motivated the development of reduced-order models (ROMs). Recently, machine-learning-based ROMs have gained significant popularity and are promising for addressing some limitations of traditional ROM methods, especially for advection dominated systems. In this chapter, we focus on a particular framework known as Latent Space Dynamics Identification (LaSDI), which transforms the high-fidelity data, governed by a PDE, to simpler and low-dimensional latent-space data, governed by ordinary differential equations (ODEs). These ODEs can be learned and subsequently interpolated to make ROM predictions. Each building block of LaSDI can be easily modulated depending on the application, which makes the LaSDI framework highly flexible. In particular, we present strategies to enforce the laws of thermodynamics into LaSDI models (tLaSDI), enhance robustness in the presence of noise through the weak form (WLaSDI), select high-fidelity training data efficiently through active learning (gLaSDI, GPLaSDI), and quantify the ROM prediction uncertainty through Gaussian processes (GPLaSDI). We demonstrate the performance of different LaSDI approaches on Burgers equation, a non-linear heat conduction problem, and a plasma physics problem, showing that LaSDI algorithms can achieve relative errors of less than a few percent and up to thousands of times speed-ups.

Computational Engineering, Finance, and Science (c↗

Large-Scale Inference of Multivariate Regression for Heavy-Tailed and Asymmetric Data

Large-scale multivariate regression is a fundamental statistical tool with a wide range of applications. Here, this study considers the problem of simultaneously testing a large number of general linear hypotheses, encompassing covariate-effect analysis, analysis of variance, and model comparisons. The challenge that accompanies a large number of tests is the ubiquitous presence of heavy-tailed and/or highly skewed measurement noise, which is the main reason for the failure of conventional least squares-based methods. For large-scale multivariate regression, we develop a set of robust inference methods to explore data features such as heavy tailedness and skewness, which are not visible to least squares methods. The new testing procedure is based on the data-adaptive Huber regression and a new covariance estimator of regression estimates. Under mild conditions, we show that our methods produce consistent estimates of the false discovery proportion. Extensive numerical experiments and an empirical study on quantitative linguistics demonstrate the advantage of the proposed method over many state-of-the-art methods when the data are generated from heavy-tailed and/or skewed distributions.

97 MATHEMATICS AND COMPUTING↗

Classification and Evaluation of Coherent Synchronous Sampled-Data Telemetry Systems

This paper analyzes the various types of continuous wave and pulse modulation for the transmission of sampled data over channels perturbed by white gaussian noise. Optimal coherent synchronous detection schemes for all the different modulation methods are shown to belong to one of two general classes: linear synchronous detection and correlation detection. The figures of merit, mean-square signal-to-error ratio and bandwidth occupancy, are determined for each system and compared.

Viterbi, Andrew↗

Delta Modulation

An optimum adaptive delta modulator-demodulator configuration is derived. This device utilizes two past samples to obtain a step size which minimizes the mean square error for a Markov Gaussian source. The optimum system is compared using computer simulations with the linear delta modulator and an enhanced Abate delta modulator. In addition the performance is compared to the rate distortion bound for a Markov source. It is shown that the optimum delta modulator is neither quantization nor slope-overload limited. The results show that the output signal-to-noise ratio is independent of the input signal power and is subject only to the limitations of the hardware employed. In addition, voice was recorded using these systems. The demodulated voice indicates negligible degradation is caused by the optimum system and by the enhanced Abate system while the linear delta modulator suffers significant degradation at a sampling frequency of 56 kilobits/sec.

Schilling, D. L.↗

State estimation with small nonlinearities

A variety of techniques is available for estimating the states of nonlinear dynamic systems from noisy data. The differences among several of these procedures in the presence of small dynamic and observational nonlinearities are investigated. Four discrete estimation algorithms are analyzed. The first is a strictly least square estimator, while the others are recursive algorithms similar to the Kalman filter used for estimating the states of linear systems. A group of analytic expressions is developed for the mean and covariance of the error in each of these estimators so that they may be compared without lengthy Monte Carlo simulations. The covariance expressions show that, to first order, all the estimators have the same covariance. Expressions for the means show that each estimator has a different bias. Several examples are carried out demonstrating that the relative magnitudes of the bias errors in the various estimators can be a strong function of such parameters as initial covariances and number of data points. Under some circumstances, more complicated algorithms can have larger biases than smaller ones.

Conrad, B.↗

Frequency division multiplex technique

A system for monitoring a plurality of condition responsive devices is described. It consists of a master control station and a remote station. The master control station is capable of transmitting command signals which includes a parity signal to a remote station which transmits the signals back to the command station so that such can be compared with the original signals in order to determine if there are any transmission errors. The system utilizes frequency sources which are 1.21 multiples of each other so that no linear combination of any harmonics will interfere with another frequency.

Brey, H.↗

An accurate method for two-point boundary value problems

A second-order method for solving two-point boundary value problems on a uniform mesh is presented where the local truncation error is obtained for use with the deferred correction process. In this simple finite difference method the tridiagonal nature of the classical method is preserved but the magnitude of each term in the truncation error is reduced by a factor of two. The method is applied to a number of linear and nonlinear problems and it is shown to produce more accurate results than either the classical method or the technique proposed by Keller (1969).

Walker, J. D. A.↗

A dynamic measure of controllability and observability for the placement of actuators and sensors on large space structures

The degree of controllability of a large space structure is found by a four step procedure: (1) finding the minimum control energy for driving the system from a given initial state to the origin in the prescribed time; (2) finding the region of initial state which can be driven to the origin with constrained control energy and time using optimal control strategy; (3) scaling the axes so that a unit displacement in every direction is equally important to control; and (4) finding the linear measurement of the weighted "volume" of the ellipsoid in the equicontrol space. For observability, the error covariance must be reduced toward zero using measurements optimally, and the criterion must be standardized by the magnitude of tolerable errors. The results obtained using these methods are applied to the vibration modes of a free-free beam.

Vandervelde, W. E.↗

Modelling of TGS growth in space

Attention is called to the necessity of programming the temperature downward in order to maintain a constant growth rate in the absence of convection. Trial and error numerical computations are performed to find the first approximation for the required isothermal dissolution period, linear ramp, and polynomial temperature variation period. The linear ramp rate is limited by the specified maximum temperature gradient. The isothermal dissolution turns out to be unnecessary. The linear ramp must be stopped before the polynomial period is begun in order to avoid overshooting the specified maximum growth rate. After a few hours, the temperature profile approaches steady-state behavior.

Liu, L. C.↗