Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average
From MaRDI portal
Publication:3759937
Recommendations
- Rational approximation on infinite intervals
- scientific article; zbMATH DE number 5176841
- scientific article; zbMATH DE number 619539
- On the representation of rational functions of bounded complexity
- On rational approximations of functions
- On approximation by rational functions
- An accurate algorithm for evaluating rational functions
- Problems and results in rational approximation
- scientific article; zbMATH DE number 1249172
- On the complexity of the gradient of a rational function
Cited in
(10)- On the efficiency of algorithms of analysis
- Average condition number for solving linear equations
- Invertibility of random fredholm operators
- Condition numbers of random matrices
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis
- Badness of small denominators in rational function evaluation
- Complexity theory of numerical linear algebra
- A new simple homotopy algorithm for linear programming. I
- Characterizations of the distribution of the Demmel condition number of real Wishart matrices
- Recent developments in information-based complexity
This page was built for publication: Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3759937)