نتایج جستجو برای: Round off error

تعداد نتایج: 467589  

Journal: :journal of sciences, islamic republic of iran 2010
d rostami

in descriptive statistics, there are two computational algorithms for determining the variance s2, of a set of observations : algorithm 1: s2= - , algorithm 2: s2= , where . it is interesting to discuss, which of the above formulas is numerically more trustworthy in machine numbers sets. i this paper, based on total effect of rounding error, we prove that the second algorithm is better than ...

2008
Annarosa Serpe

This paper is part of a wide debate and critical reflection on the use of ICT in nursery schools, and focuses on the use of station KidSmart in the classroom to enhance scientific learning within the logical-mathematic field. The study is organized as follows: after presenting the institutional setting within which ICT has been introduced in Italian nursery schools, some considerations are made...

2016
Pacôme Eberhart Julien Brajard Pierre Fortin Fabienne Jézéquel

2001
Marc Daumas Laurence Rideau Laurent Théry

In this paper we present a general library to reason about floating-point numbers within the Coq system. Most of the results of the library are proved for an arbitrary floating-point format and an arbitrary base. A special emphasis has been put on proving properties for exact computing, i.e. computing without rounding errors.

Journal: :J. Applied Mathematics 2012
Hradyesh Kumar Mishra Atulya K. Nagar

A new treatment for homotopy perturbation method is introduced. The new treatment is called He-Laplacemethodwhich is the coupling of the Laplace transform and the homotopy perturbation method using He’s polynomials. The nonlinear terms can be easily handled by the use of He’s polynomials. The method is implemented on linear and nonlinear partial differential equations. It is found that the prop...

Journal: :SIAM J. Matrix Analysis Applications 2016
Beresford N. Parlett Froilán M. Dopico Carla Ferreira

A little known property of a pair of eigenvectors (column and row) of a real tridiagonal matrix is presented. With its help we can define necessary and sufficient conditions for the unique real tridiagonal matrix for which an approximate pair of complex eigenvectors are exact. Similarly we can designate the unique real tridiagonal matrix for which two approximate real eigenvectors, with differe...

Journal: :Intelligent Automation & Soft Computing 2005
Mohammad Modarres Soheil Sadi-Nezhad

Although simple additive weighting method (SAW) is the most popular approach for classical multiple attribute decision making (MADM), it is not practical any more if information is fuzzy. The existing methods of Fuzzy Simple Additive Weighting method (FSAW) apply defuzzification which distorts fuzzy numbers. Furthermore, most of the methods usually require lengthy and laborious manipulations. I...

Journal: :J. Computational Applied Mathematics 2014
Paola Console Ernst Hairer

Certain symmetric linear multistep methods have an excellent long-time behavior when applied to second order Hamiltonian systems with or without constraints. For high accuracy computations round-off can be the dominating source of errors. This article shows how symmetric multistep methods should be implemented, so that round-off errors are minimized and propagate like a random walk.

D Rostami

In descriptive statistics, there are two computational algorithms for determining the variance S2, of a set of observations : Algorithm 1: S2= - , Algorithm 2: S2= , where . It is interesting to discuss, which of the above formulas is numerically more trustworthy in machine numbers sets. I this paper, based on total effect of rounding error, we prove that the second Algorithm is better...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید