A New Approach to Probabilistic Rounding Error Analysis
From MaRDI portal
Recommendations
- Sharper probabilistic backward error analysis for basic linear algebra kernels with random data
- Probabilistic Rounding Error Analysis of Householder QR Factorization
- Probabilistic Error Analysis for Inner Products
- scientific article; zbMATH DE number 4111908
- Stochastic rounding and its probabilistic backward error analysis
Cites work
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- scientific article; zbMATH DE number 3240705 (Why is no real title available?)
- scientific article; zbMATH DE number 3182507 (Why is no real title available?)
- scientific article; zbMATH DE number 4187014 (Why is no real title available?)
- A Stochastic Roundoff Error Analysis for the Fast Fourier Transform
- A statistical model of roundoff error for varying length floating-point arithmetic
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Accuracy and Stability of Numerical Algorithms
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Error Analysis of Direct Methods of Matrix Inversion
- Improved backward error bounds for LU and Cholesky factorizations
- Improved error bounds for inner products in floating-point arithmetic
- Numerical inverting of matrices of high order
- Probabilistic error analysis of Gaussian elimination in floating point and logarithmic arithmetic
- Probability Inequalities for Sums of Bounded Random Variables
- Reducing floating point error in dot product using the superblock family of algorithms
- Simulating Low Precision Floating-Point Arithmetic
- Test of probabilistic models for the propagation of roundoff errors
- Tests of probabilistic models for propagation of roundoff errors
- The University of Florida sparse matrix collection
- Weighing the odds. A course in probability and statistics
Cited in
(43)- Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
- Newton's method in mixed precision
- Probabilistic rounding error analysis of modified Gram-Schmidt
- Combining randomized and deterministic iterative algorithms for high accuracy solution of large linear systems and boundary integral equations
- A modern retrospective on probabilistic numerics
- Error analysis of the Gram low-rank approximation (and why it is not as unstable as one may think)
- Mixed precision algorithms in numerical linear algebra
- Rounding error using low precision approximate random variables
- Probability Analysis of Round-Off Errors in Floating-Point Arithmetic
- Floating-point arithmetic
- Accurate calculation of Euclidean norms using double-word arithmetic
- Five-Precision GMRES-Based Iterative Refinement
- Stochastic Rounding Variance and Probabilistic Bounds: A New Approach
- Rounding error analysis of the inverse compact WY modified Gram-Schmidt algorithms
- Mixed-precision explicit stabilized Runge-Kutta methods for single- and multi-scale differential equations
- Rounding error analysis of linear recurrences using generating series
- Truncated QR factorization with pivoting in mixed precision
- Numerical algorithms for high-performance computational science
- Probabilistic Rounding Error Analysis of Householder QR Factorization
- Combining sparse approximate factorizations with mixed-precision iterative refinement
- Fast and accurate computation of the Euclidean norm of a vector
- Matrix Multiplication in Multiword Arithmetic: Error Analysis and Application to GPU Tensor Cores
- Mixed precision block fused multiply-add: error analysis and application to GPU tensor cores
- A stochastic simulation algorithm with iterative refinement for solving integral equations related to an inverse problem for the wave equation
- scientific article; zbMATH DE number 4143358 (Why is no real title available?)
- Matrices with tunable infinity-norm condition number and no need for pivoting in LU factorization
- A Class of Fast and Accurate Summation Algorithms
- Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers
- The Runge example for interpolation and Wilkinson's examples for rootfinding
- Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem
- Verified numerical computations for large-scale linear systems.
- Precision-aware deterministic and probabilistic error bounds for floating point summation
- Randomized Gram-Schmidt process with application to GMRES
- Numerical stability of algorithms at extreme scale and low precisions
- An exchange algorithm for optimizing both approximation and finite-precision evaluation errors in polynomial approximations
- Sharper probabilistic backward error analysis for basic linear algebra kernels with random data
- Rigorous roundoff error analysis of probabilistic floating-point computations
- Exploiting lower precision arithmetic in solving symmetric positive definite linear systems and least squares problems
- Stochastic rounding and its probabilistic backward error analysis
- Rounding error analysis of mixed precision block Householder QR algorithms
- Statistical approach for highest precision numerical differentiation
- scientific article; zbMATH DE number 440777 (Why is no real title available?)
- Probabilistic Error Analysis for Inner Products
This page was built for publication: A New Approach to Probabilistic Rounding Error Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5238758)
