SIAM Journal on Numerical Analysis, Vol. 29, No. 5 (Oct., 1992), pp. 1413-1434 (22 pages) This article studies iterative methods defined by xk + 1 = Φ (xk, Ek), where xk ∈ Rn and Ek lie on a space of ...
[Editor's note: For an intro to floating-point math, see Tutorial: Floating-point arithmetic on FPGAs. For a comparison of fixed- and floating-point hardware, see Fixed vs. floating point: a ...
In many iterative schemes, the precision of each step depends on the computational effort spent on that step. A method of specifying a suitable amount of computation at each step is described. The ...
Embedded C and C++ programmers are familiar with signed and unsigned integers and floating-point values of various sizes, but a number of numerical formats can be used in embedded applications. Here ...
Analysis and implementation of numerical methods for random processes: random number generators, Monte Carlo methods, Markov chains, stochastic differential equations, and applications. Recommended ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback