Results 21 to 30 of about 7,840 (182)

Rigorous Roundoff Error Analysis of Probabilistic Floating-Point Computations [PDF]

open access: yes, 2021
AbstractWe present a detailed study of roundoff errors in probabilistic floating-point computations. We derive closed-form expressions for the distribution of roundoff errors associated with a random variable, and we prove that roundoff errors are generally close to being uncorrelated with their generating distribution.
Constantinides, G   +3 more
openaire   +3 more sources

A Verified Certificate Checker for Finite-Precision Error Bounds in Coq and HOL4

open access: yes, 2018
Being able to soundly estimate roundoff errors of finite-precision computations is important for many applications in embedded systems and scientific computing.
Becker, Heiko   +5 more
core   +1 more source

Symplectic integration without roundoff error [PDF]

open access: yes, 2006
Most numerical integration algorithms are not designed specifically for Hamiltonian systems and do not respect their characteristic properties, which include the preservation of phase space volume with time. This can lead to spurious damping or excitation.
openaire   +2 more sources

Stochastic Estimation of MIMO Detection Error Caused by Low-Bitwidth QR Decomposition

open access: yesIEEE Open Journal of the Communications Society
In this paper, we propose a new approach to justify a roundoff error impact on the accuracy of the linear least squares (LS) solution using QR decomposition.
Alexander Osinsky   +4 more
doaj   +1 more source

Testing the Accuracy and Stability of Spectral Methods in Numerical Relativity [PDF]

open access: yes, 2007
The accuracy and stability of the Caltech-Cornell pseudospectral code is evaluated using the KST representation of the Einstein evolution equations. The basic "Mexico City Tests" widely adopted by the numerical relativity community are adapted here for ...
Harald P. Pfeiffer   +6 more
core   +2 more sources

On numerical stability of continued fractions

open access: yesМатематичні Студії
The paper considers the numerical stability of the backward recurrence algorithm (BR-algorithm) for computing approximants of the continued fraction with complex elements.
V. Hladun   +3 more
doaj   +1 more source

Initial and Boundary Conditions for the Lattice Boltzmann Method [PDF]

open access: yes, 1993
A new approach of implementing initial and boundary conditions for the lattice Boltzmann method is presented. The new approach is based on an extended collision operator that uses the gradients of the fluid velocity.
Skordos, P. A.
core   +1 more source

Certified Roundoff Error Bounds using Bernstein Expansions and Sparse Krivine-Stengle Representations

open access: yes, 2017
Floating point error is an inevitable drawback of embedded systems implementation. Computing rigorous upper bounds of roundoff errors is absolutely necessary to the validation of critical software.
Dang, Thao   +2 more
core   +7 more sources

Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis

open access: yesComputer Graphics Forum, EarlyView.
Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley   +1 more source

The Role of Dice in the Emergence of the Probability Calculus

open access: yesInternational Statistical Review, EarlyView.
Summary The early development of the probability calculus was clearly influenced by the roll of dice. However, while dice have been cast since time immemorial, documented calculations on the frequency of various dice throws date back only to the mid‐13th century.
David R. Bellhouse, Christian Genest
wiley   +1 more source

Home - About - Disclaimer - Privacy