Taylor expansion of the accumulated rounding error
From MaRDI portal
Publication:4098580
DOI10.1007/BF01931367zbMath0332.65024WikidataQ55897725 ScholiaQ55897725MaRDI QIDQ4098580
Publication date: 1976
Published in: BIT (Search for Journal in Brave)
Related Items
Embedding Learning ⋮ On the antiderivatives of \(x^p/(1 - x)\) with an application to optimize loss functions for classification with neural networks ⋮ Non-intrusive reduced-order modeling using uncertainty-aware deep neural networks and proper orthogonal decomposition: application to flood modeling ⋮ Moment Tensor Potentials: A Class of Systematically Improvable Interatomic Potentials ⋮ Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant ⋮ Semi-algebraic complexity -- Additive complexity of matrix computational tasks ⋮ Algebraic and numerical techniques for the computation of matrix determinants ⋮ Semi-algebraic decision complexity, the real spectrum, and degree ⋮ New integration methods for perturbed ODEs based on symplectic implicit Runge-Kutta schemes with application to solar system simulations ⋮ Algorithms for roundoff error analysis - a relative error approach ⋮ Automatic differentiation for error analysis of Monte Carlo data ⋮ Data assimilation predictive GAN (DA-PredGAN) applied to a spatio-temporal compartmental model in epidemiology ⋮ On the numerical stability of algorithmic differentiation ⋮ The Derivatives of Sinkhorn–Knopp Converge ⋮ Perturbation Theory for Evaluation Algorithms of Arithmetic Expressions ⋮ Unnamed Item ⋮ On the complexity of calculation of differentials and gradients ⋮ Generative adversarial networks are special cases of artificial curiosity (1990) and also closely related to predictability minimization (1991) ⋮ Isogeometric structural shape optimization using automatic sensitivity analysis ⋮ Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation ⋮ Subquadratic-time factoring of polynomials over finite fields ⋮ Unnamed Item ⋮ Performing armchair roundoff analyses of statistical algorithms ⋮ An analysis of the effect of rounding errors on the flow of control in numerical processes ⋮ Statistical approach for highest precision numerical differentiation ⋮ Rounding error analysis of Horner's scheme ⋮ Error linearization as an effective tool for experimental analysis of the numerical stability of algorithms ⋮ There is no efficient reverse derivation mode for discrete derivatives
Cites Work
