Super-Accuracy Calculation for the Half Width of a Voigt Profile

A simple approximation scheme to describe the half width of the Voigt profile as a function of the relative contributions of Gaussian and Lorentzian broadening is presented. The proposed approximation scheme is highly accurate and provides an accuracy better than 10−17 for arbitrary αL/αG ratios. In particular, the accuracy reaches an astonishing 10−34 (quadruple precision) in the domain 0 ≤ αL/αG ≤ 0.2371 ∪ αL/αG ≥ 33.8786.

Parallel Generalized Real Symmetric-Definite Eigenvalue Problem

A computationally fast Fortran 90+ quadruple precision portable parallel GRSDEP (generalized real symmetric-definite eigenvalue problem) package suitable for large (80,000 x 80,000 or greater) dense matrices is discussed in this paper.

A Hybrid-Precision Numerical Orbit Integration Technique for Next Generation Gravity Missions

<p>In Next Generation Gravity Missions (NGGM) the Laser Ranging Interferometer (LRI) is applied to measure inter-satellite range rate with nanometer-level precision. Thereby the precision of numerical orbit integration must be higher or at least same as that of LRI and the currently widely-used double-precision orbit integration technique cannot meet the numerical requirements of LRI measurements. Considering quadruple-precision orbit integration arithmetic is time consuming, we propose a hybrid-precision numerical orbit integration technique, in which the double- and quadruple-precision arithmetic is employed in the increment calculation part and orbit propagation part, respectively. Since the round-off errors are not sensitive to the time-demanding increment calculation but to the least time-consuming orbit propagation, the proposed hybrid-precision numerical orbit integration technique is as efficient as the double-precision orbit integration technique, and as precise as the quadruple-precision orbit integration. By using hybrid-precision orbit integration technique, the range rate precision is easily achieved at 10-12m/s in either nominal or Encke form, and furthermore the sub-nanometer-level range precision is obtainable in the Encke form with reference orbit selected as the best-fit one. Therefore, the hybrid-precision orbit integration technique is suggested to be used in the gravity field solutions for NGGM.</p>

Research on IEEE 754 Standard Single Precision Floating Point Multipliers Designed using Urdhva Triyagbhyam Sutra of Vedic Mathematics

Duplication of the coasting element numbers is the big activity in automated signal handling. So the exhibition of drifting problem multipliers count on a primary undertaking in any computerized plan. Coasting factor numbers are spoken to utilizing IEEE 754 modern day in single precision(32-bits), Double precision(sixty four-bits) and Quadruple precision(128-bits) organizations. Augmentation of those coasting component numbers can be completed via using Vedic generation. Vedic arithmetic encompass sixteen wonderful calculations or Sutras. Urdhva Triyagbhyam Sutra is most usually applied for growth of twofold numbers. This paper indicates the compare of tough work finished via exceptional specialists in the direction of the plan of IEEE 754 ultra-modern-day unmarried accuracy skimming thing multiplier the usage of Vedic technological statistics.

An efficient code to solve the Kepler equation

Context. This paper introduces a new approach for solving the Kepler equation for hyperbolic orbits. We provide here the Hyperbolic Kepler Equation–Space Dynamics Group (HKE–SDG), a code to solve the equation. Methods. Instead of looking for new algorithms, in this paper we have tried to substantially improve well-known classic schemes based on the excellent properties of the Newton–Raphson iterative methods. The key point is the seed from which the iteration of the Newton–Raphson methods begin. If this initial seed is close to the solution sought, the Newton–Raphson methods exhibit an excellent behavior. For each one of the resulting intervals of the discretized domain of the hyperbolic anomaly a fifth degree interpolating polynomial is introduced, with the exception of the last one where an asymptotic expansion is defined. This way the accuracy of initial seed is optimized. The polynomials have six coefficients which are obtained by imposing six conditions at both ends of the corresponding interval: the polynomial and the real function to be approximated have equal values at each of the two ends of the interval and identical relations are imposed for the two first derivatives. A different approach is used in the singular corner of the Kepler equation – |M| < 0.15 and 1 < e < 1.25 – where an asymptotic expansion is developed. Results. In all simulations carried out to check the algorithm, the seed generated leads to reach machine error accuracy with a maximum of three iterations (∼99.8% of cases with one or two iterations) when using different Newton–Raphson methods in double and quadruple precision. The final algorithm is very reliable and slightly faster in double precision (∼0.3 s). The numerical results confirm the use of only one asymptotic expansion in the whole domain of the singular corner as well as the reliability and stability of the HKE–SDG. In double and quadruple precision it provides the most precise solution compared with other methods.

Numerical validation in quadruple precision using stochastic arithmetic

Discrete Stochastic Arithmetic (DSA) enables one to estimate rounding errors and to detect numerical instabilities in simulation programs. DSA is implemented in the CADNA library that can analyze the numerical quality of single and double precision programs. In this article, we show how the CADNA library has been improved to enable the estimation of rounding errors in programs using quadruple precision floating-point variables, i.e. having 113-bit mantissa length. Although an implementation of DSA called SAM exists for arbitrary precision programs, a significant performance improvement has been obtained with CADNA compared to SAM for the numerical validation of programs with 113-bit mantissa length variables. This new version of CADNA has been successfully used for the control of accuracy in quadruple precision applications, such as a chaotic sequence and the computation of multiple roots of polynomials. We also describe a new version of the PROMISE tool, based on CADNA, that aimed at reducing in numerical programs the number of double precision variable declarations in favor of single precision ones, taking into account a requested accuracy of the results. The new version of PROMISE can now provide type declarations mixing single, double and quadruple precision.