Computational Graphs and Rounding Error
From MaRDI portal
Cited in
(20)- Automatic computation of partial derivatives and rounding error estimates with applications to large-scale systems of nonlinear equations
- Algorithms for roundoff error analysis - a relative error approach
- Computational methods of linear algebra
- Rounding error analysis of Horner's scheme
- A capsule-unified framework of deep neural networks for graphical programming
- A new framework for the computation of Hessians
- On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs
- Perturbation Theory for Evaluation Algorithms of Arithmetic Expressions
- Simultaneous computation of functions, partial derivatives and estimates of rounding errors —Complexity and practicality—
- An analysis of the effect of rounding errors on the flow of control in numerical processes
- Converting Approximate Error Bounds into Exact Ones
- scientific article; zbMATH DE number 6982909 (Why is no real title available?)
- On lower bounds for optimal Jacobian accumulation
- Rounding errors in numerical solutions of two linear equations in two unknowns
- Stabilité numérique de l'algorithme de Levinson
- Monte Carlo gradient estimation in machine learning
- DrAmpl: A meta solver for optimization problem analysis
- Simplifying debiased inference via automatic differentiation and probabilistic programming
- A stochastic partial differential equation for computational algorithms
- Zur Kondition des linearen Ausgleichsproblems mit linearen Gleichungen als Nebenbedingungen
This page was built for publication: Computational Graphs and Rounding Error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4105179)
