The article of record as published may be located at http://dx.doi.org/10.4169/college.math.j.42.5.399Euler’s method for solving initial value problems is a good vehicle for observing the relationship between discretization error and rounding error in numerical computa- tion. As we reduce stepsize, in order to decrease discretization error, we necessarily increase the number of steps and introduce additional rounding error. The problem is common and can be quite troublesome. We will examine a simple device that can help delay the onset of this problem
The effect of round-off errors on the numerical solution of the heat equation by finite differences ...
Rounding errors present an inherent problem to all computer programs involving floating-point number...
Euler’s method is the most basic and simplest explicit method to solve first-order ordinary differen...
Abstract In the previous chapter we derived a simple finite difference method, namely the explicit E...
International audienceOrdinary differential equations are ubiquitous in scientific computing. Solvin...
Since data for statistical analysis are always given in a discretized form, observations contain not...
AbstractThere exist several algorithms for the calculation of convergents of a continued fraction. W...
Methods of controlling round-off error in one-step methods in the numerical solution of ordinary dif...
In the presented work, we are introduced to the problem of rounding. In the process of numerous huma...
In the context of measurement and of the definition of measurement units, a problem well known in co...
Rounding with multiplier methods : an efficient algorithm and applications in statistics / Gregor Do...
A detailed investigation of three different rounding rules for multiplication and division is presen...
AbstractWe examine numerical rounding errors of some deterministic solvers for systems of ordinary d...
International audienceWe explicit the link between the computer arithmetic problem of providing corr...
International audienceStochastic rounding randomly maps a real number to one of the two nearest valu...
The effect of round-off errors on the numerical solution of the heat equation by finite differences ...
Rounding errors present an inherent problem to all computer programs involving floating-point number...
Euler’s method is the most basic and simplest explicit method to solve first-order ordinary differen...
Abstract In the previous chapter we derived a simple finite difference method, namely the explicit E...
International audienceOrdinary differential equations are ubiquitous in scientific computing. Solvin...
Since data for statistical analysis are always given in a discretized form, observations contain not...
AbstractThere exist several algorithms for the calculation of convergents of a continued fraction. W...
Methods of controlling round-off error in one-step methods in the numerical solution of ordinary dif...
In the presented work, we are introduced to the problem of rounding. In the process of numerous huma...
In the context of measurement and of the definition of measurement units, a problem well known in co...
Rounding with multiplier methods : an efficient algorithm and applications in statistics / Gregor Do...
A detailed investigation of three different rounding rules for multiplication and division is presen...
AbstractWe examine numerical rounding errors of some deterministic solvers for systems of ordinary d...
International audienceWe explicit the link between the computer arithmetic problem of providing corr...
International audienceStochastic rounding randomly maps a real number to one of the two nearest valu...
The effect of round-off errors on the numerical solution of the heat equation by finite differences ...
Rounding errors present an inherent problem to all computer programs involving floating-point number...
Euler’s method is the most basic and simplest explicit method to solve first-order ordinary differen...