DOCSLIB.ORG

MAT 2310. Computational Mathematics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
MAT 2310. Computational Mathematics MAT 2310. Computational Mathematics Wm C Bauldry Fall, 2012 Introduction to Computational Mathematics \1 + 1 = 3 for large enough values of 1." Introduction to Computational Mathematics Table of Contents I. Computer Arithmetic.......................................1 II. Control Structures.........................................27 S I. Special Topics: Computation Cost and Horner's Form....... 59 III. Numerical Differentiation.................................. 64 IV. Root Finding Algorithms................................... 77 S II. Special Topics: Modified Newton's Method................ 100 V. Numerical Integration.................................... 103 VI. Polynomial Interpolation.................................. 125 S III. Case Study: TI Calculator Numerics.......................146 VII. Projects................................................. 158 ICM i I. Computer Arithmetic Sections 1. Scientific Notation.............................................1 2. Converting to Different Bases...................................2 3. Floating Point Numbers........................................7 4. IEEE-754 Floating Point Standard..............................9 5. Maple's Floating Point Representation......................... 16 6. Error......................................................... 18 Exercises..................................................... 25 ICM ii II. Control Structures Sections 1. Control Structures............................................ 27 2. A Common Example.......................................... 33 3. Control Structures Syntax..................................... 35 1. Excel........................................................... 35 2. Maple [Sage/Xcas]............................................. 38 3. MATLAB [FreeMat/Octave/Scilab]............................. 41 4. C and Java..................................................... 44 5. TI-84...........................................................48 6.R.............................................................. 51 4. From Code to Flow Charts.................................... 54 Exercises..................................................... 55 Reference Sheet Links......................................... 58 ICM iii S I. Special Topics: Computation Cost and Horner's Form Sections 1. Introduction.................................................. 59 2. Horner's Form................................................ 60 Exercises..................................................... 63 ICM iv III. Numerical Differentiation Sections 1. Introduction.................................................. 64 2. Taylor's Theorem............................................. 65 3. Difference Methods........................................... 68 1. Forward Differences............................................. 68 2. Backward Differences............................................69 3. Centered Differences............................................ 70 Appendix I: Taylor's Theorem..................................73 Appendix II: Centered Difference Coefficients Chart............. 74 Exercises..................................................... 75 ICM v IV. Root Finding Algorithms Sections 1. The Bisection Method.........................................77 2. Newton-Raphson Method..................................... 81 3. Secant Method............................................... 85 4. Regula Falsi.................................................. 89 Appendix III: Rate of Convergence............................. 96 Exercises..................................................... 97 Links and Others..............................................99 ICM vi S II. Special Topics: Modified Newton's Method Sections 1. Introduction................................................. 100 2. Modified Newton's Method...................................101 Exercises.................................................... 102 ICM vii V. Numerical Integration Sections 1. Numerical Integration........................................ 103 2. Left Endpoint, Right Endpoint, and Midpoint Sums............104 3. Trapezoid Sums............................................. 105 4. Simpson's Rule.............................................. 107 5. Gaussian Quadrature......................................... 111 6. Gauss-Kronrod Quadrature................................... 116 7. A Menagerie of Test Integrals................................ 120 Appendix IV: Legendre & Stieltjes Polynomials for GK7;15 ...... 122 Exercises.................................................... 123 Links and Others............................................ 124 ICM viii VI. Polynomial Interpolation Sections 1. Polynomial Interpolation..................................... 125 2. Lagrange Interpolation....................................... 127 3. Interlude: Bernstein Polynomials.............................. 133 4. Newton Interpolation........................................ 136 5. Two Comparisons............................................ 140 6. Interlude: Splines............................................ 142 Exercises.................................................... 143 Links and Others............................................ 145 ICM ix S III. Case Study: TI Calculator Numerics Sections 1. Introduction................................................. 146 2. Floating Point Structure..................................... 148 3. Numeric Derivatives..........................................150 4. Numerically Finding Roots.................................... 151 5. Numeric Quadrature......................................... 152 6. Transcendental Functions.................................... 153 Appendix V:TI's Solving Algorithm........................... 154 Exercises.................................................... 155 ICM x VII. Projects The Project List One Function For All........................................ 158 • I. Control Structures • A Bit Adder in Excel......................................... 159 • The Collatz Conjecture....................................... 160 • The CORDIC Algorithm...................................... 162 • The Cost of Computing a Determinant........................ 166 II. Numerical Differentiation • Space Shuttle Acceleration . III. Root Finding • Commissioner Loeb's Demise................................. 167 • Roots of Wilkinson's \Perfidious Polynomial".................. 170 • Bernoulli's Method and Deflation............................. 173 ICM xi Projects, II The Project List IV. Numerical Integration • Fourier Power Spectrum . V. Polynomial Interpolation • Cubic B´ezier Splines in 3D....................................... ICM xii Introduction to Computational Mathematics On two occasions I have been asked, \Pray, Mr. Babbage, if you put into the machine wrong figures, will the right answers come out?" ... I am not able rightly to apprehend the kind of confusion of ideas that could provoke such a question." | Charles Babbage Passages from the Life of a Philosopher, p. 67. ICM xiii I. Computer Arithmetic: Scientific Notation Definitions of Scientific Notation Normalized: Any numeric value can be written as p d0:d1d2d3 :::dn 10 × where 1 d0 9. ≤ ≤ Engineering: Any numeric value can be written as q n:d1d2d3 :::dm 10 × where 1 n 999 and q is a multiple of 3. ≤ ≤ Examples (NIST's`Values of Constants') • Speed of light in a vacuum: 2:99792458 108 m/s × • Newtonian constant of gravitation: 6:67384 10 11 m3=(kg s2) × − · • Avogadro's number: 6:022141 10 23 mol 1 × − − • Mass of a proton: 1:672621777 10 27 kg × − • Astronomical unit: 92:95580727 106 mi × ICM 1 { 175 Conversions Basic Base Transmogrification: Integers Binary Decimal Decimal Binary ! ! (Linear algebra version) (Algebra version) Think of the binary number as a Successively compute the bits vector of 1's and 0's. Use a dot (from right to left) product to convert to decimal. 1. bit = x mod 2 1. x2 = 101110 then set x = x=2 b c 2. Repeat until x = 0 2. x10 = 1 0 1 1 1 0 E.g., x10 = 46 h i 25 24 23 22 21 20 b0 = 0; then set x = 23 · h i b1 = 1; x = 11 5 3 2 1 b = 1; x = 5 3. x10 = 2 + 2 + 2 + 2 2 = 46 b3 = 1; x = 2 b4 = 0; x = 1 b5 = 1; x = 0 Whence x2 = 101110 ICM 2 { 175 Conversions Basic Base Transmogrification: Fractions Binary Decimal Decimal Binary ! ! (Linear algebra version) (Algebra version) Think of the binary number as a Successively compute the bits vector of 1's and 0's. Use a dot (from left to right) product to convert to decimal. 1. bit = 2x b c 1. x2 = 0:10111 then set x = frac(2x) 2. Repeat until x = 0 (or when 2. x10 = 1 0 1 1 1 reaching maximum length) h 1 2 3 4 5 i 2− 2− 2− 2− 2− E.g., x10 = 0:71875 · h i b 1 = 1; then set x = 0:43750 − 3. x = 2 1 + 2 3 + 2 4 + 2 5 b 2 = 0; x = 0:87500 10 − − − − − b 3 = 1; x = 0:75000 = 0:71875 − b 4 = 1; x = 0:50000 − b 5 = 1; x = 0:0 Stop − Whence x2 = 0:10111 ICM 3 { 175 Conversions Terminating Expansions? When does a fraction's expansion terminate? n n Base 10: A decimal fraction terminates when r = = . 10p 2p 5p · m Base 2: A binary fraction terminates when r = . 2p Examples 1 1. 10 = 0:110 = 0:000112 1 2. 3 = 0:310 = 0:012 : : 3. p2 = 1:414213562373095048810 = 1:01101010000010011112 : : 4. p = 3:141592653589793238510 = 11:0010010000111111012 ICM 4 { 175 Conversions Examples (Convert A Repeating Binary Expansion) Convert n = 0:0101101101 = 0:01012 to decimal. ··· 1. Convert the repeating block to decimal 1012 = 510 2. Rewrite n in \powers-of-two" notation 4 7 10 13 n = 5 2− + 5 2− + 5 2− + 5 2− + · · · · ··· 3. Express n as a geometric series ¥ 4 3k n = 5 2− ∑ 2− ·
Load more

Recommended publications
  • Fast and Efficient Algorithms for Evaluating Uniform and Nonuniform
    World Academy of Science, Engineering and Technology International Journal of Computer and Information Engineering Vol:13, No:8, 2019 Fast and Efficient Algorithms for Evaluating Uniform and Nonuniform Lagrange and Newton Curves Taweechai Nuntawisuttiwong, Natasha Dejdumrong Abstract—Newton-Lagrange Interpolations are widely used in quadratic computation time, which is slower than the others. numerical analysis. However, it requires a quadratic computational However, there are some curves in CAGD, Wang-Ball, DP time for their constructions. In computer aided geometric design and Dejdumrong curves with linear complexity. In order to (CAGD), there are some polynomial curves: Wang-Ball, DP and Dejdumrong curves, which have linear time complexity algorithms. reduce their computational time, Bezier´ curve is converted Thus, the computational time for Newton-Lagrange Interpolations into any of Wang-Ball, DP and Dejdumrong curves. Hence, can be reduced by applying the algorithms of Wang-Ball, DP and the computational time for Newton-Lagrange interpolations Dejdumrong curves. In order to use Wang-Ball, DP and Dejdumrong can be reduced by converting them into Wang-Ball, DP and algorithms, first, it is necessary to convert Newton-Lagrange Dejdumrong algorithms. Thus, it is necessary to investigate polynomials into Wang-Ball, DP or Dejdumrong polynomials. In this work, the algorithms for converting from both uniform and the conversion from Newton-Lagrange interpolation into non-uniform Newton-Lagrange polynomials into Wang-Ball, DP and the curves with linear complexity, Wang-Ball, DP and Dejdumrong polynomials are investigated. Thus, the computational Dejdumrong curves. An application of this work is to modify time for representing Newton-Lagrange polynomials can be reduced sketched image in CAD application with the computational into linear complexity.
    [Show full text]
  • CAS (Computer Algebra System) Mathematica
    CAS (Computer Algebra System) Mathematica- UML students can download a copy for free as part of the UML site license; see the course website for details From: Wikipedia 2/9/2014 A computer algebra system (CAS) is a software program that allows [one] to compute with mathematical expressions in a way which is similar to the traditional handwritten computations of the mathematicians and other scientists. The main ones are Axiom, Magma, Maple, Mathematica and Sage (the latter includes several computer algebras systems, such as Macsyma and SymPy). Computer algebra systems began to appear in the 1960s, and evolved out of two quite different sources—the requirements of theoretical physicists and research into artificial intelligence. A prime example for the first development was the pioneering work conducted by the later Nobel Prize laureate in physics Martin Veltman, who designed a program for symbolic mathematics, especially High Energy Physics, called Schoonschip (Dutch for "clean ship") in 1963. Using LISP as the programming basis, Carl Engelman created MATHLAB in 1964 at MITRE within an artificial intelligence research environment. Later MATHLAB was made available to users on PDP-6 and PDP-10 Systems running TOPS-10 or TENEX in universities. Today it can still be used on SIMH-Emulations of the PDP-10. MATHLAB ("mathematical laboratory") should not be confused with MATLAB ("matrix laboratory") which is a system for numerical computation built 15 years later at the University of New Mexico, accidentally named rather similarly. The first popular computer algebra systems were muMATH, Reduce, Derive (based on muMATH), and Macsyma; a popular copyleft version of Macsyma called Maxima is actively being maintained.
    [Show full text]
  • Mials P
    Euclid's Algorithm 171 Euclid's Algorithm Horner’s method is a special case of Euclid's Algorithm which constructs, for given polyno- mials p and h =6 0, (unique) polynomials q and r with deg r<deg h so that p = hq + r: For variety, here is a nonstandard discussion of this algorithm, in terms of elimination. Assume that d h(t)=a0 + a1t + ···+ adt ;ad =06 ; and n p(t)=b0 + b1t + ···+ bnt : Then we seek a polynomial n−d q(t)=c0 + c1t + ···+ cn−dt for which r := p − hq has degree <d. This amounts to the square upper triangular linear system adc0 + ad−1c1 + ···+ a0cd = bd adc1 + ad−1c2 + ···+ a0cd+1 = bd+1 . adcn−d−1 + ad−1cn−d = bn−1 adcn−d = bn for the unknown coefficients c0;:::;cn−d which can be uniquely solved by back substitution since its diagonal entries all equal ad =0.6 19aug02 c 2002 Carl de Boor 172 18. Index Rough index for these notes 1-1:-5,2,8,40 cartesian product: 2 1-norm: 79 Cauchy(-Bunyakovski-Schwarz) 2-norm: 79 Inequality: 69 A-invariance: 125 Cauchy-Binet formula: -9, 166 A-invariant: 113 Cayley-Hamilton Theorem: 133 absolute value: 167 CBS Inequality: 69 absolutely homogeneous: 70, 79 Chaikin algorithm: 139 additive: 20 chain rule: 153 adjugate: 164 change of basis: -6 affine: 151 characteristic function: 7 affine combination: 148, 150 characteristic polynomial: -8, 130, 132, 134 affine hull: 150 circulant: 140 affine map: 149 codimension: 50, 53 affine polynomial: 152 coefficient vector: 21 affine space: 149 cofactor: 163 affinely independent: 151 column map: -6, 23 agrees with y at Λt:59 column space: 29 algebraic dual: 95 column
    [Show full text]
  • A Family of Regula Falsi Root-Finding Methods
    A family of regula falsi root-finding methods Sérgio Galdino Polytechnic School of Pernambuco University Rua Benfica, 455 - Madalena 50.750-470 - Recife - PE - Brazil Email: [email protected] Abstract—A family of regula falsi methods for finding a root its brackets. Second, the convergence is quadratic. Since each ξ of a nonlinear equation f(x)=0 in the interval [a,b] is studied iteration requires√ two function evaluations, the actual order of in this paper. The Illinois, Pegasus, Anderson & Björk and more the method is 2, not 2; but this is still quite respectably nine new proposed methods have been tested on a series of examples. The new methods, inspired on Pegasus procedure, superlinear: The number of significant digits in the answer are pedagogically important algorithms. The numerical results approximately doubles with each two function evaluations. empirically show that some of new methods are very effective. Third, taking out the function’s “bend” via exponential (that Index Terms—regula ralsi, root finding, nonlinear equations. is, ratio) factors, rather than via a polynomial technique (e.g., fitting a parabola), turns out to give an extraordinarily robust I. INTRODUCTION algorithm. In both reliability and speed, Ridders’ method is Is not so hard the design of heuristic procedures to solve a generally competitive with the more highly developed and problem using numerical algorithms. The main drawback of better established (but more complicated) method of van this attitude is that you can be rediscovering the wheel. The Wijngaarden, Dekker, and Brent [9]. famous Halley’s iteration method [1] 1, have the distinction of being the most frequently rediscovered iterative method [2].
    [Show full text]
  • CS321-001 Introduction to Numerical Methods
    CS321-001 Introduction to Numerical Methods Lecture 3 Interpolation and Numerical Differentiation Professor Jun Zhang Department of Computer Science University of Kentucky Lexington, KY 40506-0633 Polynomial Interpolation Given a set of discrete values, how can we estimate other values between these data The method that we will use is called polynomial interpolation. We assume the data we had are from the evaluation of a smooth function. We may be able to use a polynomial p(x) to approximate this function, at least locally. A condition: the polynomial p(x) takes the given values at the given points (nodes), i.e., p(xi) = yi with 0 ≤ i ≤ n. The polynomial is said to interpolate the table, since we do not know the function. 2 Polynomial Interpolation Note that all the points are passed through by the curve 3 Polynomial Interpolation We do not know the original function, the interpolation may not be accurate 4 Order of Interpolating Polynomial A polynomial of degree 0, a constant function, interpolates one set of data If we have two sets of data, we can have an interpolating polynomial of degree 1, a linear function x x1 x x0 p(x) y0 y1 x0 x1 x1 x0 y1 y0 y0 (x x0 ) x1 x0 Review carefully if the interpolation condition is satisfied Interpolating polynomials can be written in several forms, the most well known ones are the Lagrange form and Newton form. Each has some advantages 5 Lagrange Form For a set of fixed nodes x0, x1, …, xn, the cardinal functions, l0, l1,…, ln, are defined as 0 if i j li (x j ) ij
    [Show full text]
  • A Review of Bracketing Methods for Finding Zeros of Nonlinear Functions
    Applied Mathematical Sciences, Vol. 12, 2018, no. 3, 137 - 146 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.811 A Review of Bracketing Methods for Finding Zeros of Nonlinear Functions Somkid Intep Department of Mathematics, Faculty of Science Burapha University, Chonburi, Thailand Copyright c 2018 Somkid Intep. This article is distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract This paper presents a review of recent bracketing methods for solving a root of nonlinear equations. The performance of algorithms is verified by the iteration numbers and the function evaluation numbers on a number of test examples. Mathematics Subject Classification: 65B99, 65G40 Keywords: Bracketing method, Nonlinear equation 1 Introduction Many scientific and engineering problems are described as nonlinear equations, f(x) = 0. It is not easy to find the roots of equations evolving nonlinearity using analytic methods. In general, the appropriate methods solving the non- linear equation f(x) = 0 are iterative methods. They are divided into two groups: open methods and bracketing methods. The open methods are relied on formulas requiring a single initial guess point or two initial guess points that do not necessarily bracket a real root. They may sometimes diverge from the root as the iteration progresses. Some of the known open methods are Secant method, Newton-Raphson method, and Muller's method. The bracketing methods require two initial guess points, a and b, that bracket or contain the root. The function also has the different parity at these 138 Somkid Intep two initial guesses i.e.
    [Show full text]
  • Using Computer Programming As an Effective Complement To
    Using Computer Programming as an Effective Complement to Mathematics Education: Experimenting with the Standards for Mathematics Practice in a Multidisciplinary Environment for Teaching and Learning with Technology in the 21st Century By Pavel Solin1 and Eugenio Roanes-Lozano2 1University of Nevada, Reno, 1664 N Virginia St, Reno, NV 89557, USA. Founder and Director of NCLab (http://nclab.com). 2Instituto de Matemática Interdisciplinar & Departamento de Didáctica de las Ciencias Experimentales, Sociales y Matemáticas, Facultad de Educación, Universidad Complutense de Madrid, c/ Rector Royo Villanova s/n, 28040 – Madrid, Spain. [email protected], [email protected] Received: 30 September 2018 Revised: 12 February 2019 DOI: 10.1564/tme_v27.3.03 Many mathematics educators are not aware of a strong 2. KAREL THE ROBOT connection that exists between the education of computer programming and mathematics. The reason may be that they Karel the Robot is a widely used educational have not been exposed to computer programming. This programming language which was introduced by Richard E. connection is worth exploring, given the current trends of Pattis in his 1981 textbook Karel the Robot: A Gentle automation and Industry 4.0. Therefore, in this paper we Introduction to the Art of Computer Programming (Pattis, take a closer look at the Common Core's eight Mathematical 1995). Let us note that Karel the Robot constitutes an Practice Standards. We show how each one of them can be environment related to Turtle Geometry (Abbelson and reinforced through computer programming. The following diSessa, 1981), but is not yet another implementation, as will discussion is virtually independent of the choice of a be detailed below.
    [Show full text]
  • Addition and Subtraction
    A Addition and Subtraction SUMMARY (475– 221 BCE), when arithmetic operations were per- formed by manipulating rods on a flat surface that was Addition and subtraction can be thought of as a pro- partitioned by vertical and horizontal lines. The num- cess of accumulation. For example, if a flock of 3 sheep bers were represented by a positional base- 10 system. is joined with a flock of 4 sheep, the combined flock Some scholars believe that this system— after moving will have 7 sheep. Thus, 7 is the sum that results from westward through India and the Islamic Empire— the addition of the numbers 3 and 4. This can be writ- became the modern system of representing numbers. ten as 3 + 4 = 7 where the sign “+” is read “plus” and The Greeks in the fifth century BCE, in addition the sign “=” is read “equals.” Both 3 and 4 are called to using a complex ciphered system for representing addends. Addition is commutative; that is, the order numbers, used a system that is very similar to Roman of the addends is irrelevant to how the sum is formed. numerals. It is possible that the Greeks performed Subtraction finds the remainder after a quantity is arithmetic operations by manipulating small stones diminished by a certain amount. If from a flock con- on a large, flat surface partitioned by lines. A simi- taining 5 sheep, 3 sheep are removed, then 2 sheep lar stone tablet was found on the island of Salamis remain. In this example, 5 is the minuend, 3 is the in the 1800s and is believed to date from the fourth subtrahend, and 2 is the remainder or difference.
    [Show full text]
  • Lagrange & Newton Interpolation
    Lagrange & Newton interpolation In this section, we shall study the polynomial interpolation in the form of Lagrange and Newton. Given a se- quence of (n +1) data points and a function f, the aim is to determine an n-th degree polynomial which interpol- ates f at these points. We shall resort to the notion of divided differences. Interpolation Given (n+1) points {(x0, y0), (x1, y1), …, (xn, yn)}, the points defined by (xi)0≤i≤n are called points of interpolation. The points defined by (yi)0≤i≤n are the values of interpolation. To interpolate a function f, the values of interpolation are defined as follows: yi = f(xi), i = 0, …, n. Lagrange interpolation polynomial The purpose here is to determine the unique polynomial of degree n, Pn which verifies Pn(xi) = f(xi), i = 0, …, n. The polynomial which meets this equality is Lagrange interpolation polynomial n Pnx=∑ l j x f x j j=0 where the lj ’s are polynomials of degree n forming a basis of Pn n x−xi x−x0 x−x j−1 x−x j 1 x−xn l j x= ∏ = ⋯ ⋯ i=0,i≠ j x j −xi x j−x0 x j−x j−1 x j−x j1 x j−xn Properties of Lagrange interpolation polynomial and Lagrange basis They are the lj polynomials which verify the following property: l x = = 1 i= j , ∀ i=0,...,n. j i ji {0 i≠ j They form a basis of the vector space Pn of polynomials of degree at most equal to n n ∑ j l j x=0 j=0 By setting: x = xi, we obtain: n n ∑ j l j xi =∑ j ji=0 ⇒ i =0 j=0 j=0 The set (lj)0≤j≤n is linearly independent and consists of n + 1 vectors.
    [Show full text]
  • A Simplified Introduction to Virus Propagation Using Maple's Turtle Graphics Package
    E. Roanes-Lozano, C. Solano-Macías & E. Roanes-Macías.: A simplified introduction to virus propagation using Maple's Turtle Graphics package A simplified introduction to virus propagation using Maple's Turtle Graphics package Eugenio Roanes-Lozano Instituto de Matemática Interdisciplinar & Departamento de Didáctica de las Ciencias Experimentales, Sociales y Matemáticas Facultad de Educación, Universidad Complutense de Madrid, Spain Carmen Solano-Macías Departamento de Información y Comunicación Facultad de CC. de la Documentación y Comunicación, Universidad de Extremadura, Spain Eugenio Roanes-Macías Departamento de Álgebra, Universidad Complutense de Madrid, Spain [email protected] ; [email protected] ; [email protected] Partially funded by the research project PGC2018-096509-B-100 (Government of Spain) 1 E. Roanes-Lozano, C. Solano-Macías & E. Roanes-Macías.: A simplified introduction to virus propagation using Maple's Turtle Graphics package 1. INTRODUCTION: TURTLE GEOMETRY AND LOGO • Logo language: developed at the end of the ‘60s • Characterized by the use of Turtle Geometry (a.k.a. as Turtle Graphics). • Oriented to introduce kids to programming (Papert, 1980). • Basic movements of the turtle (graphic cursor): FD, BK RT, LT. • It is not based on a Cartesian Coordinate system. 2 E. Roanes-Lozano, C. Solano-Macías & E. Roanes-Macías.: A simplified introduction to virus propagation using Maple's Turtle Graphics package • Initially robots were used to plot the trail of the turtle. http://cyberneticzoo.com/cyberneticanimals/1969-the-logo-turtle-seymour-papert-marvin-minsky-et-al-american/ 3 E. Roanes-Lozano, C. Solano-Macías & E. Roanes-Macías.: A simplified introduction to virus propagation using Maple's Turtle Graphics package • IBM Logo / LCSI Logo (’80) 4 E.
    [Show full text]
  • Using Xcas in Calculus Curricula: a Plan of Lectures and Laboratory Projects
    Computational and Applied Mathematics Journal 2015; 1(3): 131-138 Published online April 30, 2015 (http://www.aascit.org/journal/camj) Using Xcas in Calculus Curricula: a Plan of Lectures and Laboratory Projects George E. Halkos, Kyriaki D. Tsilika Laboratory of Operations Research, Department of Economics, University of Thessaly, Volos, Greece Email address [email protected] (K. D. Tsilika) Citation George E. Halkos, Kyriaki D. Tsilika. Using Xcas in Calculus Curricula: a Plan of Lectures and Keywords Laboratory Projects. Computational and Applied Mathematics Journal. Symbolic Computations, Vol. 1, No. 3, 2015, pp. 131-138. Computer-Based Education, Abstract Xcas Computer Software We introduce a topic in the intersection of symbolic mathematics and computation, concerning topics in multivariable Optimization and Dynamic Analysis. Our computational approach gives emphasis to mathematical methodology and aims at both symbolic and numerical results as implemented by a powerful digital mathematical tool, CAS software Received: March 31, 2015 Xcas. This work could be used as guidance to develop course contents in advanced Revised: April 20, 2015 calculus curricula, to conduct individual or collaborative projects for programming related Accepted: April 21, 2015 objectives, as Xcas is freely available to users and institutions. Furthermore, it could assist educators to reproduce calculus methodologies by generating automatically, in one entry, abstract calculus formulations. 1. Introduction Educational institutions are equipped with computer labs while modern teaching methods give emphasis in computer based learning, with curricula that include courses supported by the appropriate computer software. It has also been established that, software tools integrate successfully into Mathematics education and are considered essential in teaching Geometry, Statistics or Calculus (see indicatively [1], [2]).
    [Show full text]
  • Mathematical Topics
    A Mathematical Topics This chapter discusses most of the mathematical background needed for a thor­ ough understanding of the material presented in the book. It has been mentioned in the Preface, however, that math concepts which are only used once (such as the mediation operator and points vs. vectors) are discussed right where they are introduced. Do not worry too much about your difficulties in mathematics, I can assure you that mine a.re still greater. - Albert Einstein. A.I Fourier Transforms Our curves are functions of an arbitrary parameter t. For functions used in science and engineering, time is often the parameter (or the independent variable). We, therefore, say that a function g( t) is represented in the time domain. Since a typical function oscillates, we can think of it as being similar to a wave and we may try to represent it as a wave (or as a combination of waves). When this is done, we have the function G(f), where f stands for the frequency of the wave, and we say that the function is represented in the frequency domain. This turns out to be a useful concept, since many operations on functions are easy to carry out in the frequency domain. Transforming a function between the time and frequency domains is easy when the function is periodic, but it can also be done for certain non periodic functions. The present discussion is restricted to periodic functions. 1IIIt Definition: A function g( t) is periodic if (and only if) there exists a constant P such that g(t+P) = g(t) for all values of t (Figure A.la).
    [Show full text]