Search NASA⌕ Search

SEARCH · Search NASA

Results for “finite precision”

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 55 records · Page 3

A parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

A parallel algorithm, called polysection, is presented for computing the eigenvalues of a symmetric tridiagonal matrix. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The signs of the polynomials at the interval endpoints are determined a priori and used to guarantee that all zeros are found. The use of finite-precision arithmetic may result in multiple zeros; however, in this case, the intervals coalesce and their number determines exactly the multiplicity of the zero. For an N x N matrix the eigenvalues can be determined in O(log-squared N) time with N-squared processors and O(N) time with N processors. The method is compared with a parallel variant of bisection that requires O(N-squared) time on a single processor, O(N) time with N processors, and O(log N) time with N-squared processors.

Swarztrauber, Paul N.↗

An implementation of the QMR method based on coupled two-term recurrences

The authors have proposed a new Krylov subspace iteration, the quasi-minimal residual algorithm (QMR), for solving non-Hermitian linear systems. In the original implementation of the QMR method, the Lanczos process with look-ahead is used to generate basis vectors for the underlying Krylov subspaces. In the Lanczos algorithm, these basis vectors are computed by means of three-term recurrences. It has been observed that, in finite precision arithmetic, vector iterations based on three-term recursions are usually less robust than mathematically equivalent coupled two-term vector recurrences. This paper presents a look-ahead algorithm that constructs the Lanczos basis vectors by means of coupled two-term recursions. Implementation details are given, and the look-ahead strategy is described. A new implementation of the QMR method, based on this coupled two-term algorithm, is described. A simplified version of the QMR algorithm without look-ahead is also presented, and the special case of QMR for complex symmetric linear systems is considered. Results of numerical experiments comparing the original and the new implementations of the QMR method are reported.

Freund, Roland W.↗

Towards Test Driven Development for Computational Science with pFUnit

Developers working in Computational Science & Engineering (CSE)/High Performance Computing (HPC) must contend with constant change due to advances in computing technology and science. Test Driven Development (TDD) is a methodology that mitigates software development risks due to change at the cost of adding comprehensive and continuous testing to the development process. Testing frameworks tailored for CSE/HPC, like pFUnit, can lower the barriers to such testing, yet CSE software faces unique constraints foreign to the broader software engineering community. Effective testing of numerical software requires a comprehensive suite of oracles, i.e., use cases with known answers, as well as robust estimates for the unavoidable numerical errors associated with implementation with finite-precision arithmetic. At first glance these concerns often seem exceedingly challenging or even insurmountable for real-world scientific applications. However, we argue that this common perception is incorrect and driven by (1) a conflation between model validation and software verification and (2) the general tendency in the scientific community to develop relatively coarse-grained, large procedures that compound numerous algorithmic steps.We believe TDD can be applied routinely to numerical software if developers pursue fine-grained implementations that permit testing, neatly side-stepping concerns about needing nontrivial oracles as well as the accumulation of errors. We present an example of a successful, complex legacy CSE/HPC code whose development process shares some aspects with TDD, which we contrast with current and potential capabilities. A mix of our proposed methodology and framework support should enable everyday use of TDD by CSE-expert developers.

pFUnit↗

Automatic Generation of Guard-Stable Floating-Point Code

In floating-point programs, test instability occurs when the control flow of a conditional statement diverges from its ideal execution under real arithmetic. This phenomenon is caused by the presence of round-off errors in floating-point computations. Writing programs that correctly handle test instability often require expertise on finite precision computations and rounding errors. This paper presents a fully automatic tool chain that generates and formally verifies a test-stable floating-point C program from its functional specification in real arithmetic. The generated program is instrumented to soundly detect when unstable tests may occur and, in these cases, to issue a warning. The proposed approach combines the PRECiSA floating-point static analyzer, the Frama-C software verification suite, and the PVS theorem prover.

Floating-Point Arithmetic↗

Multiple multiresolution representation of functions and calculus for fast computation

We describe the mathematical representations, data structure and the implementation of the numerical calculus of functions in the software environment multiresolution analysis environment for scientific simulations, MADNESS. In MADNESS, each smooth function is represented using an adaptive pseudo-spectral expansion using the multiwavelet basis to a arbitrary but finite precision. This is an extension of the capabilities of most of the existing net, mesh and spectral based methods where the discretization is based on a single adaptive mesh, or expansions.

99 GENERAL AND MISCELLANEOUS↗

Verifying the error bound of numerical computation implemented in computer systems

A verification tool receives a finite precision definition for an approximation of an infinite precision numerical function implemented in a processor in the form of a polynomial of bounded functions. The verification tool receives a domain for verifying outputs of segments associated with the infinite precision numerical function. The verification tool splits the domain into at least two segments, wherein each segment is non-overlapping with any other segment and converts, for each segment, a polynomial of bounded functions for the segment to a simplified formula comprising a polynomial, an inequality, and a constant for a selected segment. The verification tool calculates upper bounds of the polynomial for the at least two segments, beginning with the selected segment and reports the segments that violate a bounding condition.

97 MATHEMATICS AND COMPUTING↗

Precise solution for a finite set of spherical coefficients from equiangular gridded data

An important goal of geodesy is to determine the anomalous potential and its derivatives outside of the earth. Representing the surface anomalies by a series of spherical harmonics is useful since it is then possible to do a term by term solution of Laplace's equation and upward continuation. The problem of finding such a spherical harmonic series for anomaly values given on an equiangular surface grid is addressed. (This is a first step toward the more complicated problem of finding a function such that locally averaged values fit a grid of mean anomalies.) Three approaches to this fitting problem are discussed and compared: the discrete Fourier technique, the discrete integral technique, and a new approach. The peculiar nature of the equiangular grid, with its increasing density of (noisy) data toward the poles, causes each method to exhibit a different type of difficulty. The new method is shown to be practical as well as precise since the numerical conditioning problems which appear can be successfully handled by such well-known techniques as a (simple) Kalman filter.

Zucker, Paul A.↗

Identification of $^{3}$He–$^{3}$H clusters in the $^{6}$Li+$^{89}$Y experiment using particle-$\gamma$ coincidence measurement

The 6 Li+ 89 Y experiment was performed to explore the reaction mechanism induced by a weakly bound nucleus 6 Li and its cluster configuration. Here, the particle-$\gamma$ coincidence method was used to identify the different reaction channels. The $\gamma$-rays coincident with 3 He/ 3 H indicate that the 3 H/ 3 He stripping reaction plays a significant role in the formation of Zr/Nb isotopes. The obtained results support the existence of a 3 He- 3 H cluster in 6 Li. Direct and sequential transfer reactions are adequately discussed, and the FRESCO code is used to perform precise finite-range cyclic redundancy check calculations. In the microscopic calculation, direct cluster transfer is more predominant than sequential transfer in 3 H transfer. However, the direct cluster transfer is of comparable magnitude to the sequential transfer in the 3 He transfer.

CRC calculations↗

Nanoconfinement and Mass Transport in Silica Mesopores: the Role of Charge at the Single Molecule and Single Pore Levels

Polarization-dependent single molecule tracking was employed to simultaneously probe the translational and orientational diffusion of four perylene diimide (PDI) dyes, having different lengths and charges, within the one-dimensional (1D) nanoscale pores of surfactant-templated mesoporous silica films. The wide-field fluorescence videos acquired reveal that a significant fraction of the molecules follow 1D pathways and exhibit highly polarized fluorescence, consistent with their orientational confinement. Single-frame step size distributions prepared from these data were fit to a new model that accurately describes the distribution for 1D Fickian diffusion in the presence of finite localization precision. Average diffusion coefficients obtained from mean square displacement (D MSD ) data were 20–100% larger for the two uncharged PDIs compared to the charged PDIs, reflecting electrostatic interactions of the latter with oppositely charged sites on the cationic surfactant headgroups and deprotonated silanol sites on the pore walls. Polarization-dependent tracking data show that the longest uncharged PDI was most strongly confined, while the three shorter dyes were less confined. The cationic PDI produced a wobbling angle distribution that was broader than the others, suggesting it explores more of the pore diameter. In conclusion, the results provide new knowledge on the mechanisms by which the dye molecules interact with the pore-filling medium and the pore surfaces, helping to elucidate the factors controlling the rate of mass transport.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

INFERRING THE ECCENTRICITY DISTRIBUTION

Standard maximum-likelihood estimators for binary-star and exoplanet eccentricities are biased high, in the sense that the estimated eccentricity tends to be larger than the true eccentricity. As with most non-trivial observables, a simple histogram of estimated eccentricities is not a good estimate of the true eccentricity distribution. Here, we develop and test a hierarchical probabilistic method for performing the relevant meta-analysis, that is, inferring the true eccentricity distribution, taking as input the likelihood functions for the individual star eccentricities, or samplings of the posterior probability distributions for the eccentricities (under a given, uninformative prior). The method is a simple implementation of a hierarchical Bayesian model; it can also be seen as a kind of heteroscedastic deconvolution. It can be applied to any quantity measured with finite precision-other orbital parameters, or indeed any astronomical measurements of any kind, including magnitudes, distances, or photometric redshifts-so long as the measurements have been communicated as a likelihood function or a posterior sampling.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantum many-body simulations of the two-dimensional Fermi-Hubbard model in ultracold optical lattices

Understanding quantum many-body states of correlated electrons is one main theme in modern condensed-matter physics. Given that the Fermi-Hubbard model, the prototype of correlated electrons, was recently realized in ultracold optical lattices, it is highly desirable to have controlled numerical methodology to provide precise finite-temperature results upon doping to directly compare with experiments. Here, we demonstrate the exponential tensor renormalization group (XTRG) algorithm [Chen et al., Phys. Rev. X 8, 031082 (2018)], complemented by independent determinant quantum Monte Carlo, offers a powerful combination of tools for this purpose. XTRG provides full and accurate access to the density matrix and thus various spin and charge correlations, down to an unprecedented low temperature of a few percent of the tunneling energy. Finally, we observe excellent agreement with ultracold fermion measurements at both half filling and finite doping, including the sign-reversal behavior in spin correlations due to formation of magnetic polarons, and the attractive hole-doublon and repulsive hole-hole pairs that are responsible for the peculiar bunching and antibunching behaviors of the antimoments.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Exact solutions for a Maxwell-Kalb-Ramond action with dilaton: Localization of massless and massive modes in a sine-Gordon brane-world

We analytically find the exact propagation modes of the electromagnetic and the Kalb-Ramond fields together in a five-dimensional curved space-time. The existence and localization of gauge particles into our four-dimensional world (4D) is studied in detail on a brane-world scenario in which two gauge fields interact with a dilaton and a gravitational background. The coupling to the dilaton is different in each case causing the splitting between gauge spectra. The gauge-field zero-modes and an infinite tower of Kaluza-Klein massive states are analytically obtained. Relevant conditions on the dilaton coupling constant are found in order to identify with precision every finite tensor and vector eigenstate in the theory. An exact quantization condition on the whole mass spectrum, depending on the dilaton coupling constant and the bulk Planck mass, is inherited from the extra-dimension. This allows finding an exact rule to prevent tachyons in the theory and, by the same token, predicting a possible tensor zero-mode in 4D world. We also show that KK massive-modes contributions onto 4D physics are strongly suppressed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Distributed system modeling of a large space antenna

A general approach for distributed parameter modeling of complex dynamical systems is described. The method consists of dividing the system in parts which can be modeled by simple partial differential equations and coupling the equations thus obtained by applying Hamilton's variational formalism to the entire system. The modeling of a large, offset-fed, wrap-rib antenna is presented to illustrate the approach. Although such models are perhaps not as precise as finite element models, they can be useful for initial physical insight and parametric design.

Hamidi, M.↗

Optimal controllers for finite wordlength implementation

There exist realizations of a given controller transfer function yielding arbitrarily large effects from computational errors. Since, in general, there is no upper bound, it is important to have a systematic way of reducing these effects. Optimum controller designs are developed which take into account the digital round-off errors in the controller implementation and in the A/D and D/A converters. These results provide a natural extension to the LQG (linear quadratic Gaussian) theory since they reduce to the standard LQG controller when infinite-precision computation is used, but for finite precision the separation principle does not hold.

Liu, K.↗

Optimal controllers for finite wordlength implementation

When a controller is implemented in a digital computer, with A/D and D/A conversion, the numerical errors of the computation can drastically affect the performance of the control system. There exists realizations of a given controller transfer function yielding arbitrarily large effects from computational errors. Since, in general, there is no upper bound, it is important to have a systematic way of reducing these effects. Optimum controller designs are developed which take account of the digital round-off errors in the controller implementation and in the A/D and D/A converters. These results provide a natural extension to the Linear Quadratic Gaussian (LQG) theory since they reduce to the standard LQG controller when infinite precision computation is used. But for finite precision the separation principle does not hold.

Liu, K.↗

Towards High Precision Deuteron Polarimetry

A finite electric dipole moment (EDM) in any fundamental system would constitute a signal for new physics. The deuteron presents itself as an optimal candidate both experimentally and theoretically. A new storage ring technique is being developed for which a small change in the vertical polarization would be a signal of a non-zero EDM. A novel polarimeter concept is under investigation. Besides being highly efficient, this polarimeter should continuously monitor the beam polarization, guaranteeing optimal sensitivity. Detailed studies on systematic error control, in addition to the measurement of cross sections and analyzing powers, were carried out at KVI-Groningen in The Netherlands. Measurements were conducted at COSY-Juelich in Germany yielding high efficiencies. The (statistics limited) ability to track changes in polarization at the level of a few hundred parts-per-million has been demonstrated. Further studies and developments to meet the final goal of sub-part-per-million sensitivity are in progress.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Interplay Between Time and Energy in Bosonic Noisy Quantum Metrology

Quantum entanglement and coherence often allow for protocols that outperform classical ones in estimating a system’s parameter. When using infinite-dimensional probes (such as a bosonic mode), one could, in principle, obtain infinite precision in a finite time for both classical and quantum protocols, which makes it hard to quantify potential quantum advantage. However, such a situation is unphysical, as it would require infinite resources, so one needs to impose some additional constraint: typically the average energy employed by the probe is finite. Here we treat both energy and time as a resource, showing that, in the presence of noise, there is a nontrivial interplay between the average energy and the time devoted to the estimation. Our results are valid for the most general metrological schemes (e.g., adaptive schemes, which may involve entanglement with external ancillae or any kind of continuous measurement). We apply recently derived precision bounds for all parameters characterizing the paradigmatic case of a bosonic mode, subject to Lindbladian noise. We show how the time employed in the estimation should be partitioned in order to achieve the best possible precision. In most cases, the optimal performance may be obtained without the necessity of adaptivity or entanglement with ancilla. We compare results with classical strategies. Interestingly, for temperature estimation, applying a fast-prepare-and-measure protocol with Fock states provides better scaling with the number of photons than any classical strategy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗