Certified Roundoff Error Bounds Using Semidefinite Programming. [PDF]
Roundoff errors cannot be avoided when implementing numerical programs with finite precision. The ability to reason about rounding is especially important if one wants to explore a range of potential representations, for instance for FPGAs or custom ...
Constantinides, GA +2 more
core +10 more sources
General moments of roundoff error [PDF]
Li and Nadarajah [Signal Processing 127 (2016) 185–190] derived expressions for mean and variance of roundoff error for any continuous random variable. Here, we derive expressions for general moments of the roundoff error, allowing one to study other aspects of roundoff error than just mean and variance.
Wiegand, Martin, Nadarajah, Saralees
openaire +3 more sources
Certified Roundoff Error Bounds using Bernstein Expansions and Sparse Krivine-Stengle Representations [PDF]
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 +8 more sources
Rigorous Roundoff Error Analysis of Probabilistic Floating-Point Computations [PDF]
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 +5 more sources
Stochastic Estimation of MIMO Detection Error Caused by Low-Bitwidth QR Decomposition
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 +2 more sources
Roundoff error analysis of the double exponential formula-based method for the matrix sign function [PDF]
In this paper, we perform a roundoff error analysis of an integration-based method for computing the matrix sign function recently proposed by Nakaya and Tanaka.
Tomoya Miyashita +2 more
semanticscholar +1 more source
QR Decomposition Based on Double-double Precision Gram-Schmidt Orthogonalization Method [PDF]
The Gram-Schmidt orthogonalization algorithm and its related modified algorithms often show numerical instability when computing ill-conditioned or large-scale matrices.To solve this problem,this paper explores the cumulative effect of round-off errors ...
JIN Jiexi, XIE Hehu, DU Peibing, QUAN Zhe, JIANG Hao
doaj +1 more source
Mathematical modeling of parameter identification process of convection-diffusion transport models using the SVD-based Kalman filter [PDF]
The paper addresses a problem of mathematical modeling of the process of identifying the coefficients of a partial differential equation in convection-diffusion transport models based on the results of noisy measurements of the function values ...
Anastasia N. Kuvshinova +2 more
doaj +1 more source
For large-scale problems, how to establish an algorithm with high accuracy and stability is particularly important. In this paper, the Householder bidiagonalization total least squares (HBITLS) algorithm and nonlinear iterative partial least squares for ...
Zhanshan Yang, Xilan Liu
doaj +1 more source
Floating-Point Roundoff Error Analysis in Artificial Neural Networks
– In this paper, roundoff errors in Artificial Neural Networks (ANNs) are analyzed on a model for Solid-State Power Amplifiers (SSPAs). Calculations are carried out on 32-bit Floating-Point (FP32) arithmetics, and results are verified using 64-bit floating ...
Hussein Al-Rikabi, B. Renczes
semanticscholar +1 more source

