Error Bounds for Arithmetic Operations on Computers Without Guard Digits
|
|
- Edith Parsons
- 5 years ago
- Views:
Transcription
1 IMA Journal of Numerical Analysis (1983) 3, Error Bounds for Arithmetic Operations on Computers Without Guard Digits F. W. J. OLVER The University of Maryland and the National Bureau of Standards, U.S.A. [Received 22 November 1982] For computers having no form of guard digit in the accumulator register it is not possible to bound the relative error offloating-pointsubtraction processes in a satisfactory manner. This paper describes some modifications of recent error analyses to cover this situation, including the evaluation of sums and inner products, and indicates the corresponding modifications for the solution of systems of linear algebraic equations. 1. Introduction Two RECENT PAPERS (Olver, 1982; Olver & Wilkinson, 1982) have described the construction and computation of a posteriori error bounds for various algebraic operations with floating-point arithmetic, including the solution of linear algebraic equations by Gaussian elimination. The analysis employs a new definition of relative error, called relative precision (rp). This is used in conjunction with the conventional definition of absolute error, or absolute precision (ap). A basic assumption of the two papers is that it is possible to assign a common rp bound to all the abbreviation processes (chopping or rounding) that accompany internal floating-point arithmetic operations, including addition, subtraction, multiplication and division. Generally this assumption is quite satisfactory for computers that are equipped with at least one guard digit in the accumulator register, that is, a register used for storing intermediate results in addition or subtraction. But without any form of guard digit, or indicator bit,f the assumption is unrealistic; see Olver (1978), especially the numerical example in Section 4.6. The purpose of the present paper is to supply modifications to the analyses to cover these excepted cases. 2. Addition and Subtraction: Ap Forms Let a t and a 2 be real numbers in normalized floating-point form, given by a l =r pi xm u a 2 = r n xm 2, (2.1) where r is the internal radix of the computing facility, the exponents p t and p 2 are signed integers, and the mantissae m x and m 2 are signed rational numbers such that t Yobe (1973) /83/ S03.00/0 "83 Aademk Prea Inc. (London) Limited
2 154 F. W. J. OLVER r-^ki-cl, r-^lmj^l. (22) Also, let the number of digits in each mantissa be denoted by d. Setting aside the trivial cases in which a x or a 2 vanishes, we assume that Mil 2* \a 2 \ > 0. The sum ai + a 2 = s, (23) say, is computed in the following manner. First, a 2 is converted to unnormalized form in an intermediate register in such a way that it has the same exponent, p lt as a t. This is effected by preshifting m 2 a total of p^ p 2 places to the right Secondly, a 2 is either chopped or roundedf to the same number of places as a u and the resulting approximation is denoted by d 2. Thirdly, d 2 is added to a u the sum is renormalized, if necessary, and the mantissa chopped or rounded to d digits to yield the final answer s, say. THEOREM 21 where if the abbreviation mode is chopping, or if the abbreviation mode is rounding. S^aAl+BJ+aill+ej, (24) \8i\,\9i\<r % -' (25) PiU^l^l + Or 1 " (26) There are four cases to consider, depending on whether addition or subtraction is being performed and whether the abbreviation mode is chopping or rounding. For the rounding cases the result is a well-known formula of Wilkinson (1963, Chapter 1, Sections 17-18). For completeness, however, we supply proofs in all four cases. Without loss of generality we suppose that p y = 0 throughout the proofs. (i) Addition with chopping. In this case and the next we assume that a x ^ a 2 > 0. From the definition of d 2 we have Hence from (23) we derive 0^a 2 -d 2 <r~ d. (27) r-'. (28) Suppose first that a t + a2^ 1. Then no further abbreviations take place after forming d 2.% In consequence s = a t + d 2 and In (24) set 9 2 = 0, so that 0 t = (s-s)/a v Then 0<s-J <r-'. (29) O<-0 1 <r-"/a 1^r 1-1 ', (210) since a t > r" 1 ; compare (21) and (22). Therefore (25) is satisfied. f In the case of rounding it is assumed that r is even. When r» 2, or a power of 2, one way of effecting the rounding is simply to add (sign aj x (ft" 1 neglected bit of aj x 2 to the retained part of a 2. J If a, +dj 1, then renormalization occurs but no abbreviation error is introduced.
3 ERROR BOUNDS FOR ARITHMETIC OPERATIONS 155 Alternatively, assume that a i +d 2 > 1. In this event the final digit of a, + d 2. is chopped to form s, and we have Addition of this result to (18) yields s^(r-l)r-' 1. (Ill) 0^s-s<r l ~ d. (112) In (14) set 0j = 9 2 = 9, so that 9 = {s-s)/s. Then O<-0<r 1-7s<r 1 -' > (2.13) since s^ a l +d 2 > 1. Again, (15) is satisfied (ii) Addition with rounding. In place of (17) and (18) we have, for all methods of rounding, and -ir- - <fl 2 -fi 2^ir-' (2.14) -** -'^s-fo + SjXir-'. (115) Suppose first that a 1 + a 2 < 1. Then no further abbreviations take place after forming d 2. In consequence s = a x + d 2 ; hence with 9 2 = 0 we find-that IfljKir 1 -*; (2.16) compare (110). Therefore (16) is satisfied.' Alternatively, assume that a 1 + d 2 > 1. Then the final digit of a t +a 2 is rounded to form s. Accordingly, Addition of this result to (2.15) yields With 9t = 9 2 = 9 = (s-s)/s we see that s^±r 1 -''. (2.17) s-s1^i{l + r- 1 )r 1 "''- (2.18) 0 ^Kl+r~V~7* (2-19) Because a 1 + d 2 > I it follows that a x + d 2 ^ 1 +r~'. Using (115) we then derive '+ir- - >l, (2.20) and from this inequality and (119) it is clear that (16) is satisfied. (iii) Subtraction with chopping. In this case and the next we replace a 2 by a 2, so that (13) and (14) become and respectively. We may again assume that a x^ a 2 > 0. ai-a 2 = s (121) (122)
4 156 F. W. J. OLVER The inequalities (27) continue to apply. We also have s = a l a 2, since no abbreviation takes place on subtracting d 2 from a v From these results and (221) we see that In (222) set 6 2 = 0, so that 0j = (s s)/a t. Then we have 0 ^ S-s < r~'. (123) 0^9 l <r- i /a 1^r l - i ; (224) compare (210). Therefore (25) is satisfied. (iv) Subtraction with rounding. The inequalities (214) continue to apply, and no abbreviation takes place on subtracting 3 2 from a v Hence In (222) set 0 2 = 0, so that 0 X = (s-s)/^. Therefore (26) is satisfied. This completes the proof of Theorem Addition: Rp Forms -if' < s-s < ±r-'. (225) Then we have PiKir-'/a^ir 1 -'. (226) For the floating-point addition of two non-negative numbers we require an rp form of error bound. In this section we employ the same notation and make the same assumptions as in the opening two paragraphs of Section 2 except that we now suppose a t^ a 2^ 0. THEOREM 3.1 if the abbreviation mode is chopping, or if the abbreviation mode is rounding. ssa; rpo- 1 -*) (3.1) s^y, rpuu+r-v-'} (3-2) Neither of these results is deducible immediately from Theorem 21. The relation (3.1) is easily derived from the inequalities (2.9) and (212), however, and it was also included in Section 4.5 of Olver (1978). Furthermore, Section 4.7 of the same reference indicates that (3.1) is valid when the abbreviation mode is rounding. To prove the stronger result (3.2) we proceed as follows. Again, without loss of generality we suppose that Pi = 0. Suppose first that a l +d 2 < 1. Then the only abbreviation that takes place is the rounding of a 2 to form a 2. This is equivalent to the rounding of s to form hence by Olver (1978), Section 4.3,f we have and so (3.2) is satisfied. S^r, rpdr 1 -*), (3.3) t In this reference it is assumed that in the event of a "tie" the rounding is always upward. However, it is easily verified that if downward rounding is used in these critical cases, then (3.3) continues to apply.
5 ERROR BOUNDS FOR ARITHMETIC OPERATIONS 157 Alternatively, assume that a l + a 2 > 1. The rounding of a 2 to form d 2 is described by the relations Similarly, the rounding of a l +d 1 to form s is described by where k is an integer that satisfies ', - H ^ l - (3-4) a l + d 2 = s + kr~ d, (3.5) orf Eliminating d 2 from (3.4) and (3.5) we obtain where To establish (3.2) we need to show that l<fc*s}r if s = 1. (3.7) a 1 + a 2 = ser, (3.8) «= ln{l+ (fc +? r "'l. (3.9) M^iO+r-V"'- (3.10) There are three subcases to be considered. Suppose first that s = 1. From (3.7) -and the inequalities in (3.4) we have ir+i- Therefore u is positive. Furthermore, u = ln{l+(* + S)r-'} < {k + &)r~ d ^ (ir + i)r"'. (3.11) Secondly, suppose that s > 1 + r 1 "' and k + S ^ 0. Then u is non-negative. From (3.4) and (3.6) we derive fc+3 < - r+}. Hence ' 1. (3.12) Thirdly, suppose that s > 1 + r 1 "' and /c + 9 < 0. From (3.4) and (3.6) we have -ir-i < k + S. Therefore 5 1+r 1 - Since r > 2 and <2 ^ 1 this quantity is positive. Hence from (3.9) we see that and so 0 < -u < hi {1 +#+ l)r-*} < ic+l)^"'. (3.13) The desired inequality (3.10) follows on combining (3.11), (3.12) and (3.13). This completes the proof of Theorem 3.1. f The restriction it > 1 in (3.7) stems from the condition a, +5 2 > 1.
6 158 F. W. J. OLVER 4. Sums and Inner Products In this section we describe modifications that are needed in the analysis of Olver (1982) to include computing facilities that have no form of guard digit in the accumulator register. As in this reference, we make provision for two modes (or levels) of floating-point operation: a main mode, J(, for the main computations and a lower mode, if, for error-bound computations. We continue to employ the symbols r, d and d, to denote, respectively, the radix of the internal number system of the computing facility, the number of digits assigned to the mantissa in J( and the number of digits assigned to the mantissa in if. We also continue to use single bars to denote numbers stored in Jt and double bars to denote numbers stored in if. In the present paper, however, we define y to be a convenient member of! that equals or exceeds the common rp error bound for abbreviation, multiplication and division in M, and also satisfies yssr 1 "' (chopping); y $s Kl + r" 1 )^ ~ d (rounding). (4.1) In consequence, the rules for multiplication and division in M are unchanged. Thus if a l and a 2 are any two real numbers stored in J(, then their computed product a 1 a 2 and computed quotient aja 2 satisfy a l a 1 ~'a^a' 2 ; rp(y), (4.2) a 1 /a 2 ~~aja 2 ~; rp (y), (4.3) provided that a 2 # 0 in the case of division. For addition (and subtraction) we now have «i + a 2 ; ap {(foj + \a 2 \)y}, (4.4) this result being derived from (4.1) and Theorem 2.1. Similarly, we define y, to be a convenient member of SC that equals or exceeds the common rp error bound for abbreviation, multiplication and division in if, and satisfies y, > r 1 "' (chopping); y, ^ \\\ + r~ ^r 1 "'' (rounding). (4.5) In consequence, if a x and <x 2 are two non-negative members of SC, then from the definition of rp we have ai<x 2 e~" < a t a 2 ^ct x a. 2 e n, a-ja 2 e~" < <zja 2 < a.ja 2 e", (4.6) provided that a 2 # 0 in the case of division. Furthermore, a t +a 2 e"" s$ a! +a 2 < a t +a 2 e 71, (4.7) this result being a consequence of (4.5) and Theorem 3.1. In other words, with the new definition ofy t the exponential rule formulated in Olver (1982, Section 3) continues
7 ERROR BOUNDS FOR ARITHMETIC OPERATIONS 159 to apply. Indeed, if we retain the conditions ys% y, <, then except for (3.12) the results in Sections 3, 4, 5, 8 and 9 of Olver (1982) apply unchanged. The necessary modifications to the error bounds for sums and inner products given in Sections 6 and 7 of Olver (1982) are obtained by replacing formula (6.4) by (4.4) whenever addition takes place: here and in the rest of this section we use italics to indicate equation numbers that belong to Olver (1982). In the case of sums we find that (6.7) applies, provided that the definition (6.8) of p m is changed to J-l \J-1 J'2 From this result and the exponential rule we see that the computable form (6.75) becomes where a m is now defined by MlH>)} } (4.9) (41O) In evaluating this bound the grouping brackets must be obeyed. In the case of inner products, we find that (7.6) remains valid, provided that (7.7) is replaced by P. = I \aj' J \(e i ' +^-l) + (i\^bj\+ "l Is/) y. (4.11) J-l V-l j-l ) The computable form (7.77) also remains valid, provided that the definition (7.70) of a m is changed to ( \ajbij + ^ s^j y. (4.12) Again, grouping brackets must be obeyed. In summary, the essential modifications to the previous results for sums and inner products are to replace the term sjy in the error bounds by ( a 1 + a I l l< 1»l)y '«the case of sums, and by ( a l bi + a 2 b \a m b m \)y in the case of inner products, and to make a minor change in the compensating factors. 5. Conclusions On computers that are not equipped with some form of guard digit in the accumulator register, the relative error in the computed difference of two floatingpoint numbers may be quite large. In consequence, a bound for the absolute error should be used. This paper supplies the necessary modifications of error bounds that were obtained for sums and inner products in an earlier paper. The main effect of the changes on the error bounds is to replace the absolute value of a sum by the
8 160 F. W. J. OLVER corresponding sum of the absolute values of the individual terms. In consequence, the modified forms of bound are weaker, but not grossly so in general. Corresponding modifications of the a posteriori error bounds for Gaussian elimination that were obtained recently by J. H. Wilkinson and the present writer can be constructed by straightforward application of the results for sums and inner products supplied in the present paper. The writer is pleased to acknowledge helpful suggestions by D. W. Lozier and the referee. This work was supported by the U.S. Army Research Office, Durham, under Contract DAAG C-0032 and by the National Science Foundation under Grant MCS REFERENCES OLVER, F. W. J A new approach to error arithmetic. SI AM J. num. Analysis 15, OLVER, F. W. J Further developments of rp and ap error analysis. IMA J. num. Analysis 2, OLVER, F. W. J. & WILKINSON, J. H A posteriori error bounds for Gaussian elimination. IMA J. num. Analysis 2, 377^*06. WILKINSON, J. H Rounding Errors in Algebraic Processes. National Physical Laboratory Notes on Appl. Sci. No. 32. London: Her Majesty's Stationery Office. YOHE, J. M Roundings in floating-point arithmetic. IEEE Trans. Comput. C-22,
Computer Arithmetic. MATH 375 Numerical Analysis. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Computer Arithmetic
Computer Arithmetic MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013 Machine Numbers When performing arithmetic on a computer (laptop, desktop, mainframe, cell phone,
More informationQUADRATIC PROGRAMMING?
QUADRATIC PROGRAMMING? WILLIAM Y. SIT Department of Mathematics, The City College of The City University of New York, New York, NY 10031, USA E-mail: wyscc@cunyvm.cuny.edu This is a talk on how to program
More informationThe Euclidean Division Implemented with a Floating-Point Multiplication and a Floor
The Euclidean Division Implemented with a Floating-Point Multiplication and a Floor Vincent Lefèvre 11th July 2005 Abstract This paper is a complement of the research report The Euclidean division implemented
More informationMatrix notation. A nm : n m : size of the matrix. m : no of columns, n: no of rows. Row matrix n=1 [b 1, b 2, b 3,. b m ] Column matrix m=1
Matrix notation A nm : n m : size of the matrix m : no of columns, n: no of rows Row matrix n=1 [b 1, b 2, b 3,. b m ] Column matrix m=1 n = m square matrix Symmetric matrix Upper triangular matrix: matrix
More informationFLOATING POINT ARITHMETHIC - ERROR ANALYSIS
FLOATING POINT ARITHMETHIC - ERROR ANALYSIS Brief review of floating point arithmetic Model of floating point arithmetic Notation, backward and forward errors 3-1 Roundoff errors and floating-point arithmetic
More informationFLOATING POINT ARITHMETHIC - ERROR ANALYSIS
FLOATING POINT ARITHMETHIC - ERROR ANALYSIS Brief review of floating point arithmetic Model of floating point arithmetic Notation, backward and forward errors Roundoff errors and floating-point arithmetic
More informationLESSON ASSIGNMENT. After completing this lesson, you should be able to:
LESSON ASSIGNMENT LESSON 1 General Mathematics Review. TEXT ASSIGNMENT Paragraphs 1-1 through 1-49. LESSON OBJECTIVES After completing this lesson, you should be able to: 1-1. Identify and apply the properties
More informationMathematical preliminaries and error analysis
Mathematical preliminaries and error analysis Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan September 12, 2015 Outline 1 Round-off errors and computer arithmetic
More informationJim Lambers MAT 610 Summer Session Lecture 2 Notes
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 2 Notes These notes correspond to Sections 2.2-2.4 in the text. Vector Norms Given vectors x and y of length one, which are simply scalars x and y, the
More informationIntroduction to Applied Linear Algebra with MATLAB
Sigam Series in Applied Mathematics Volume 7 Rizwan Butt Introduction to Applied Linear Algebra with MATLAB Heldermann Verlag Contents Number Systems and Errors 1 1.1 Introduction 1 1.2 Number Representation
More informationALU (3) - Division Algorithms
HUMBOLDT-UNIVERSITÄT ZU BERLIN INSTITUT FÜR INFORMATIK Lecture 12 ALU (3) - Division Algorithms Sommersemester 2002 Leitung: Prof. Dr. Miroslaw Malek www.informatik.hu-berlin.de/rok/ca CA - XII - ALU(3)
More informationChapter 1 Computer Arithmetic
Numerical Analysis (Math 9372) 2017-2016 Chapter 1 Computer Arithmetic 1.1 Introduction Numerical analysis is a way to solve mathematical problems by special procedures which use arithmetic operations
More informationChapter 1 Mathematical Preliminaries and Error Analysis
Chapter 1 Mathematical Preliminaries and Error Analysis Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128A Numerical Analysis Limits and Continuity
More informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 5. Ax = b.
CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 5 GENE H GOLUB Suppose we want to solve We actually have an approximation ξ such that 1 Perturbation Theory Ax = b x = ξ + e The question is, how
More information1.1 COMPUTER REPRESENTATION OF NUM- BERS, REPRESENTATION ERRORS
Chapter 1 NUMBER REPRESENTATION, ERROR ANALYSIS 1.1 COMPUTER REPRESENTATION OF NUM- BERS, REPRESENTATION ERRORS Floating-point representation x t,r of a number x: x t,r = m t P cr, where: P - base (the
More informationROUNDOFF ERRORS; BACKWARD STABILITY
SECTION.5 ROUNDOFF ERRORS; BACKWARD STABILITY ROUNDOFF ERROR -- error due to the finite representation (usually in floatingpoint form) of real (and complex) numers in digital computers. FLOATING-POINT
More informationREVIEW Chapter 1 The Real Number System
REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }
More information1 Number Systems and Errors 1
Contents 1 Number Systems and Errors 1 1.1 Introduction................................ 1 1.2 Number Representation and Base of Numbers............. 1 1.2.1 Normalized Floating-point Representation...........
More informationChapter 1: Introduction and mathematical preliminaries
Chapter 1: Introduction and mathematical preliminaries Evy Kersalé September 26, 2011 Motivation Most of the mathematical problems you have encountered so far can be solved analytically. However, in real-life,
More informationHow do computers represent numbers?
How do computers represent numbers? Tips & Tricks Week 1 Topics in Scientific Computing QMUL Semester A 2017/18 1/10 What does digital mean? The term DIGITAL refers to any device that operates on discrete
More informationNotes on floating point number, numerical computations and pitfalls
Notes on floating point number, numerical computations and pitfalls November 6, 212 1 Floating point numbers An n-digit floating point number in base β has the form x = ±(.d 1 d 2 d n ) β β e where.d 1
More information4.2 Floating-Point Numbers
101 Approximation 4.2 Floating-Point Numbers 4.2 Floating-Point Numbers The number 3.1416 in scientific notation is 0.31416 10 1 or (as computer output) -0.31416E01..31416 10 1 exponent sign mantissa base
More informationLecture Notes 7, Math/Comp 128, Math 250
Lecture Notes 7, Math/Comp 128, Math 250 Misha Kilmer Tufts University October 23, 2005 Floating Point Arithmetic We talked last time about how the computer represents floating point numbers. In a floating
More informationLecture 7. Floating point arithmetic and stability
Lecture 7 Floating point arithmetic and stability 2.5 Machine representation of numbers Scientific notation: 23 }{{} }{{} } 3.14159265 {{} }{{} 10 sign mantissa base exponent (significand) s m β e A floating
More informationShipping Grade 6 Solving Equations Clarification
Shipping Grade 6 Solving Equations Clarification CCSSM: Grade 6 DOMAIN: Expressions and Equations Cluster: Apply and extend previous understandings of arithmetic to algebraic expressions. Standard: 6.EE.2
More informationUNIT 4 NOTES: PROPERTIES & EXPRESSIONS
UNIT 4 NOTES: PROPERTIES & EXPRESSIONS Vocabulary Mathematics: (from Greek mathema, knowledge, study, learning ) Is the study of quantity, structure, space, and change. Algebra: Is the branch of mathematics
More informationNUMERICAL METHODS C. Carl Gustav Jacob Jacobi 10.1 GAUSSIAN ELIMINATION WITH PARTIAL PIVOTING
0. Gaussian Elimination with Partial Pivoting 0.2 Iterative Methods for Solving Linear Systems 0.3 Power Method for Approximating Eigenvalues 0.4 Applications of Numerical Methods Carl Gustav Jacob Jacobi
More informationChapter 1 Error Analysis
Chapter 1 Error Analysis Several sources of errors are important for numerical data processing: Experimental uncertainty: Input data from an experiment have a limited precision. Instead of the vector of
More information10.1. Square Roots and Square- Root Functions 2/20/2018. Exponents and Radicals. Radical Expressions and Functions
10 Exponents and Radicals 10.1 Radical Expressions and Functions 10.2 Rational Numbers as Exponents 10.3 Multiplying Radical Expressions 10.4 Dividing Radical Expressions 10.5 Expressions Containing Several
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. B) 6x + 4
Math1420 Review Comprehesive Final Assessment Test Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Add or subtract as indicated. x + 5 1) x2
More informationSvoboda-Tung Division With No Compensation
Svoboda-Tung Division With No Compensation Luis MONTALVO (IEEE Student Member), Alain GUYOT Integrated Systems Design Group, TIMA/INPG 46, Av. Félix Viallet, 38031 Grenoble Cedex, France. E-mail: montalvo@archi.imag.fr
More informationx y x y ax bx c x Algebra I Course Standards Gap 1 Gap 2 Comments a. Set up and solve problems following the correct order of operations (including proportions, percent, and absolute value) with rational
More informationARITHMETIC AND BASIC ALGEBRA
C O M P E T E N C Y ARITHMETIC AND BASIC ALGEBRA. Add, subtract, multiply and divide rational numbers expressed in various forms Addition can be indicated by the expressions sum, greater than, and, more
More informationMath Review. for the Quantitative Reasoning measure of the GRE General Test
Math Review for the Quantitative Reasoning measure of the GRE General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important for solving
More informationChapter 4 Number Representations
Chapter 4 Number Representations SKEE2263 Digital Systems Mun im/ismahani/izam {munim@utm.my,e-izam@utm.my,ismahani@fke.utm.my} February 9, 2016 Table of Contents 1 Fundamentals 2 Signed Numbers 3 Fixed-Point
More informationCHAPTER 6. Direct Methods for Solving Linear Systems
CHAPTER 6 Direct Methods for Solving Linear Systems. Introduction A direct method for approximating the solution of a system of n linear equations in n unknowns is one that gives the exact solution to
More informationMathematics (Core - Level: 08) Pre-Algebra Course Outline
Crossings Christian School Academic Guide Middle School Division Grades 5-8 Mathematics (Core - Level: 08) Course Outline Exponents and Exponential Functions s will simplify expressions with zero and negative
More informationThe natural numbers. The natural numbers come with an addition +, a multiplication and an order < p < q, q < p, p = q.
The natural numbers N = {0, 1,, 3, } The natural numbers come with an addition +, a multiplication and an order < p, q N, p + q N. p, q N, p q N. p, q N, exactly one of the following holds: p < q, q
More informationEDULABZ INTERNATIONAL NUMBER SYSTEM
NUMBER SYSTEM 1. Find the product of the place value of 8 and the face value of 7 in the number 7801. Ans. Place value of 8 in 7801 = 800, Face value of 7 in 7801 = 7 Required product = 800 7 = 00. How
More informationExample #3: 14 (5 + 2) 6 = = then add = 1 x (-3) then. = 1.5 = add
Grade 9 Curricular content Operations with rational numbers (addition, subtraction, multiplication, division and order of operations) -incudes brackets and exponents (exponent laws) -exponents includes
More informationCHAPTER 2 NUMBER SYSTEMS
CHAPTER 2 NUMBER SYSTEMS The Decimal Number System : We begin our study of the number systems with the familiar decimal number system. The decimal system contains ten unique symbol 0, 1, 2, 3, 4, 5, 6,
More informationKNOWLEDGE OF NUMBER SENSE, CONCEPTS, AND OPERATIONS
DOMAIN I. COMPETENCY 1.0 MATHEMATICS KNOWLEDGE OF NUMBER SENSE, CONCEPTS, AND OPERATIONS Skill 1.1 Compare the relative value of real numbers (e.g., integers, fractions, decimals, percents, irrational
More informationHolt McDougal Larson Algebra Common Core Edition correlated to the South Carolina High School Core-Area Standards Intermediate Algebra
Holt McDougal Larson 2012 Common Core Edition correlated to the South Carolina High School Core-Area Standards Intermediate Algebra Standard IA-1 The student will understand and utilize the mathematical
More informationPre Algebra, Unit 1: Variables, Expression, and Integers
Syllabus Objectives (1.1) Students will evaluate variable and numerical expressions using the order of operations. (1.2) Students will compare integers. (1.3) Students will order integers (1.4) Students
More informationIntroduction CSE 541
Introduction CSE 541 1 Numerical methods Solving scientific/engineering problems using computers. Root finding, Chapter 3 Polynomial Interpolation, Chapter 4 Differentiation, Chapter 4 Integration, Chapters
More informationFloating-point Computation
Chapter 2 Floating-point Computation 21 Positional Number System An integer N in a number system of base (or radix) β may be written as N = a n β n + a n 1 β n 1 + + a 1 β + a 0 = P n (β) where a i are
More informationEngineering Fundamentals and Problem Solving, 6e. Chapter 6 Engineering Measurements
Engineering Fundamentals and Problem Solving, 6e Chapter 6 Engineering Measurements Chapter Objectives Determine the number of significant digits in a measurement Perform numerical computations with measured
More informationNAME DATE PERIOD. A negative exponent is the result of repeated division. Extending the pattern below shows that 4 1 = 1 4 or 1. Example: 6 4 = 1 6 4
Lesson 4.1 Reteach Powers and Exponents A number that is expressed using an exponent is called a power. The base is the number that is multiplied. The exponent tells how many times the base is used as
More informationI-v k e k. (I-e k h kt ) = Stability of Gauss-Huard Elimination for Solving Linear Systems. 1 x 1 x x x x
Technical Report CS-93-08 Department of Computer Systems Faculty of Mathematics and Computer Science University of Amsterdam Stability of Gauss-Huard Elimination for Solving Linear Systems T. J. Dekker
More informationSection 3.6 Complex Zeros
04 Chapter Section 6 Complex Zeros When finding the zeros of polynomials, at some point you're faced with the problem x = While there are clearly no real numbers that are solutions to this equation, leaving
More informationPractical Algebra. A Step-by-step Approach. Brought to you by Softmath, producers of Algebrator Software
Practical Algebra A Step-by-step Approach Brought to you by Softmath, producers of Algebrator Software 2 Algebra e-book Table of Contents Chapter 1 Algebraic expressions 5 1 Collecting... like terms 5
More informationSample. An Incremental Development. John H. Saxon, Jr. Third Edition. Used by Permission SAXON PUBLISHERS, INC.
An Incremental Development Third Edition John H. Saxon, Jr. SAXON PUBLISHERS, INC. Algebra 1: An Incremental Development Third Edition Copyright 2003 by Saxon Publishers, Inc. All rights reserved. No part
More informationFUNCTIONS OVER THE RESIDUE FIELD MODULO A PRIME. Introduction
FUNCTIONS OVER THE RESIDUE FIELD MODULO A PRIME DAVID LONDON and ZVI ZIEGLER (Received 7 March 966) Introduction Let F p be the residue field modulo a prime number p. The mappings of F p into itself are
More informationAlgebra I Chapter 4 Curriculum and IXL
Chapter 4 Curriculum and IXL C4L1 Functions and Non-Functions Represent relations as mappings, sets of points, and graphs: WS Determine whether a relation is a function or not: WS C4L2 Linear and Non-Linear
More informationComplement Arithmetic
Complement Arithmetic Objectives In this lesson, you will learn: How additions and subtractions are performed using the complement representation, What is the Overflow condition, and How to perform arithmetic
More informationExpressions and Formulas 1.1. Please Excuse My Dear Aunt Sally
Expressions and Formulas 1.1 Order of Operations (PEMDAS) 1. Parenthesis 2. Exponents 3. Multiply or Divide from left to right 4. Add of Subtract from left to right Please Excuse My Dear Aunt Sally Example
More informationExponential Properties 0.1 Topic: Exponential Properties
Ns Exponential Properties 0.1 Topic: Exponential Properties Date: Objectives: SWBAT (Simplify and Evaluate Expressions using the Exponential LAWS) Main Ideas: Assignment: LAW Algebraic Meaning Example
More informationNumber Systems III MA1S1. Tristan McLoughlin. December 4, 2013
Number Systems III MA1S1 Tristan McLoughlin December 4, 2013 http://en.wikipedia.org/wiki/binary numeral system http://accu.org/index.php/articles/1558 http://www.binaryconvert.com http://en.wikipedia.org/wiki/ascii
More informationEvery time a measurement is taken, we must be aware of significant figures! Define significant figures.
SCHM 103: FUNDAMENTALS OF CHEMISTRY Ch. 2: Numerical Side of Chemistry Types of data collected in experiments include: Qualitative: Quantitative: Making Measurements Whenever a piece of data is collected,
More informationChapter 1: Fundamentals of Algebra Lecture notes Math 1010
Section 1.1: The Real Number System Definition of set and subset A set is a collection of objects and its objects are called members. If all the members of a set A are also members of a set B, then A is
More informationUNIT V FINITE WORD LENGTH EFFECTS IN DIGITAL FILTERS PART A 1. Define 1 s complement form? In 1,s complement form the positive number is represented as in the sign magnitude form. To obtain the negative
More informationADVANCED/HONORS ALGEBRA 2 - SUMMER PACKET
NAME ADVANCED/HONORS ALGEBRA 2 - SUMMER PACKET Part I. Order of Operations (PEMDAS) Parenthesis and other grouping symbols. Exponential expressions. Multiplication & Division. Addition & Subtraction. Tutorial:
More informationAlgebra 1. Correlated to the Texas Essential Knowledge and Skills. TEKS Units Lessons
Algebra 1 Correlated to the Texas Essential Knowledge and Skills TEKS Units Lessons A1.1 Mathematical Process Standards The student uses mathematical processes to acquire and demonstrate mathematical understanding.
More informationMath 411 Preliminaries
Math 411 Preliminaries Provide a list of preliminary vocabulary and concepts Preliminary Basic Netwon s method, Taylor series expansion (for single and multiple variables), Eigenvalue, Eigenvector, Vector
More informationOPTIMAL RESOURCE ALLOCATION AMONG AREAS OF EQUAL VALUE
80 NZOR volume 4 number 2 July 1976 OPTIMAL RESOURCE ALLOCATION AMONG AREAS OF EQUAL VALUE John S. Cr o u c h e r* Macquarie Un i v e r s i t y, Sydney S u m m a r y This p a p e r c o n s i d e r s a
More informationMAT 460: Numerical Analysis I. James V. Lambers
MAT 460: Numerical Analysis I James V. Lambers January 31, 2013 2 Contents 1 Mathematical Preliminaries and Error Analysis 7 1.1 Introduction............................ 7 1.1.1 Error Analysis......................
More informationT HE "COordinate Rotation DIgital Computer"
1959 PROCEEDINGS OF THE WESTERN JOINT COMPUTER CONFERENCE 257 The CORDIC Computing Technique JACK VOLDER t T HE "COordinate Rotation DIgital Computer" computing technique can be used to solve, in one computing
More information7 Multipliers and their VHDL representation
7 Multipliers and their VHDL representation 7.1 Introduction to arithmetic algorithms If a is a number, then a vector of digits A n 1:0 = [a n 1... a 1 a 0 ] is a numeral representing the number in the
More informationMTH306: Algebra II. Course length: Two semesters. Materials: None
MTH306: Algebra II Students are able to gain credit if they have previously completed this course but did not successfully earn credit. For each unit, students take a diagnostic test that assesses their
More informationDSP Design Lecture 2. Fredrik Edman.
DSP Design Lecture Number representation, scaling, quantization and round-off Noise Fredrik Edman fredrik.edman@eit.lth.se Representation of Numbers Numbers is a way to use symbols to describe and model
More informationOn the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination
On the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination J.M. Peña 1 Introduction Gaussian elimination (GE) with a given pivoting strategy, for nonsingular matrices
More informationIntroduction to Numerical Analysis
Introduction to Numerical Analysis S. Baskar and S. Sivaji Ganesh Department of Mathematics Indian Institute of Technology Bombay Powai, Mumbai 400 076. Introduction to Numerical Analysis Lecture Notes
More informationRadiological Control Technician Training Fundamental Academic Training Study Guide Phase I
Module 1.01 Basic Mathematics and Algebra Part 4 of 9 Radiological Control Technician Training Fundamental Academic Training Phase I Coordinated and Conducted for the Office of Health, Safety and Security
More informationEquations and Inequalities
Chapter 3 Equations and Inequalities Josef Leydold Bridging Course Mathematics WS 2018/19 3 Equations and Inequalities 1 / 61 Equation We get an equation by equating two terms. l.h.s. = r.h.s. Domain:
More informationMULTIPLIERS OF THE TERMS IN THE LOWER CENTRAL SERIES OF THE LIE ALGEBRA OF STRICTLY UPPER TRIANGULAR MATRICES. Louis A. Levy
International Electronic Journal of Algebra Volume 1 (01 75-88 MULTIPLIERS OF THE TERMS IN THE LOWER CENTRAL SERIES OF THE LIE ALGEBRA OF STRICTLY UPPER TRIANGULAR MATRICES Louis A. Levy Received: 1 November
More informationAlgebra 1 Correlation of the ALEKS course Algebra 1 to the Washington Algebra 1 Standards
Algebra 1 Correlation of the ALEKS course Algebra 1 to the Washington Algebra 1 Standards A1.1: Core Content: Solving Problems A1.1.A: Select and justify functions and equations to model and solve problems.
More informationApplied Mathematics 205. Unit 0: Overview of Scientific Computing. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit 0: Overview of Scientific Computing Lecturer: Dr. David Knezevic Scientific Computing Computation is now recognized as the third pillar of science (along with theory and experiment)
More informationCollege Algebra. Basics to Theory of Equations. Chapter Goals and Assessment. John J. Schiller and Marie A. Wurster. Slide 1
College Algebra Basics to Theory of Equations Chapter Goals and Assessment John J. Schiller and Marie A. Wurster Slide 1 Chapter R Review of Basic Algebra The goal of this chapter is to make the transition
More informationDegree of a polynomial
Variable Algebra Term Polynomial Monomial Binomial Trinomial Degree of a term Degree of a polynomial Linear A generalization of arithmetic. Letters called variables are used to denote numbers, which are
More informationHow fast can we add (or subtract) two numbers n and m?
Addition and Subtraction How fast do we add (or subtract) two numbers n and m? How fast can we add (or subtract) two numbers n and m? Definition. Let A(d) denote the maximal number of steps required to
More informationSection 1.3 Review of Complex Numbers
1 Section 1. Review of Complex Numbers Objective 1: Imaginary and Complex Numbers In Science and Engineering, such quantities like the 5 occur all the time. So, we need to develop a number system that
More informationALGEBRA 1. Interactive Notebook Chapter 2: Linear Equations
ALGEBRA 1 Interactive Notebook Chapter 2: Linear Equations 1 TO WRITE AN EQUATION: 1. Identify the unknown (the variable which you are looking to find) 2. Write the sentence as an equation 3. Look for
More informationRedundant Radix Enumeration Systems
Redundant Radix Enumeration Systems CS 860: Automatic Sequences Daniel Roche University of Waterloo 21 November 2006 Roche (University of Waterloo) Redundant Radix Enumeration Systems 21 November 2006
More informationAlgebra Review. Terrametra Resources. Lynn Patten
Terrametra Resources Lynn Patten ALGEBRAIC EXPRESSION A combination of ordinary numbers, letter symbols, variables, grouping symbols and operation symbols. Numbers remain fixed in value and are referred
More informationRevised: 1/17/14 EASTERN LEBANON COUNTY SCHOOL DISTRICT STUDENT LEARNING MAP
Course/Subject: Algebra 2 Unit 1: Equations & Inequalities Days: 10 days Grade Level: 9, 10, 11 Solve Equations in One Variable A2.1.3.2.2 Solve Inequalities in One Variable A2.2.2.1.2 Solve Combined Inequalities
More informationSloping Binary Numbers: A New Sequence Related to the Binary Numbers
Sloping Binary Numbers: A New Sequence Related to the Binary Numbers David Applegate, Internet and Network Systems Research Center, AT&T Shannon Labs, 180 Park Avenue, Florham Park, NJ 0793 0971, USA (Email:
More informationSYMMETRICOMPLETIONS AND PRODUCTS OF SYMMETRIC MATRICES
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 186, December 1973 SYMMETRICOMPLETIONS AND PRODUCTS OF SYMMETRIC MATRICES BY MORRIS NEWMAN ABSTRACT. We show that any vector of n relatively prime
More informationFLORIDA STANDARDS TO BOOK CORRELATION
FLORIDA STANDARDS TO BOOK CORRELATION Domain: Ratios and Proportional Relationships 6.RP.1.1 After a standard is introduced, it is revisited many times in subsequent activities, lessons, and exercises.
More informationCHAPTER 2 INTERPOLATION
CHAPTER 2 INTERPOLATION FINDING THE VALUE BETWEEN TABULATED ENTRIES 200. Introduction When one quantity varies with changing values of a second quantity, and the mathematical relationship of the two is
More informationFYSE410 DIGITAL ELECTRONICS [1] [2] [3] [4] [5] A number system consists of an ordered set of symbols (digits).
FYSE4 DIGITAL ELECTRONICS Litterature: LECTURE [] [] [4] [5] DIGITAL LOGIC CIRCUIT ANALYSIS & DESIGN Victor P. Nelson, H. Troy Nagle J. David Irwin, ill D. Carroll ISN --4694- DIGITAL DESIGN M. Morris
More informationStudy Guide for Math 095
Study Guide for Math 095 David G. Radcliffe November 7, 1994 1 The Real Number System Writing a fraction in lowest terms. 1. Find the largest number that will divide into both the numerator and the denominator.
More informationECS 231 Computer Arithmetic 1 / 27
ECS 231 Computer Arithmetic 1 / 27 Outline 1 Floating-point numbers and representations 2 Floating-point arithmetic 3 Floating-point error analysis 4 Further reading 2 / 27 Outline 1 Floating-point numbers
More informationLinear Algebra Tutorial for Math3315/CSE3365 Daniel R. Reynolds
Linear Algebra Tutorial for Math3315/CSE3365 Daniel R. Reynolds These notes are meant to provide a brief introduction to the topics from Linear Algebra that will be useful in Math3315/CSE3365, Introduction
More informationSection-A. Short Questions
Section-A Short Questions Question1: Define Problem? : A Problem is defined as a cultural artifact, which is especially visible in a society s economic and industrial decision making process. Those managers
More informationFINAL EXAM REVIEW ITEMS Math 0312: Intermediate Algebra Name
FINAL EXAM REVIEW ITEMS Math 0312: Intermediate Algebra Name 1) Find the SUM of the solutions of the equation. 82 + 0 = 16 Use the quadratic formula to solve the equation. (All solutions are real numbers.)
More informationGeometry 21 Summer Work Packet Review and Study Guide
Geometry Summer Work Packet Review and Study Guide This study guide is designed to accompany the Geometry Summer Work Packet. Its purpose is to offer a review of the ten specific concepts covered in the
More informationCHAPTER 11. A Revision. 1. The Computers and Numbers therein
CHAPTER A Revision. The Computers and Numbers therein Traditional computer science begins with a finite alphabet. By stringing elements of the alphabet one after another, one obtains strings. A set of
More informationINDEPENDENCE OF RESULTANTS TH. MOTZKIN
360 TH. MOTZKIN tapril of congruent or symmetric divisions begin with 1, 1, 2, 3, 6, 9, 24,. The divisions themselves may be classified, for a fixed point, according to the next point in the same subset.
More information7 = 8 (Type a simplified fraction.)
Student: Date: Assignment: Exponential and Radical Equations 1. Perform the indicated computation. Write the answer in scientific notation. 3. 10 6 10. 3. 4. 3. 10 6 10 = (Use the multiplication symbol
More informationASSIGNMENT. Please complete only the assignment for the class you will begin in September 2018.
ASSIGNMENT Attached is an assignment containing items necessary for you to have mastered to do well in Algebra II. Please complete only the assignment for the class you will begin in September 2018. Practicing
More information