1.   Progress Information

• Part I of material covered in this class
• Material covered - basic Fortran constructs:
• • Computation and assignment
  • Real and integer variables -- introductory information
  • Simplest forms of input and output
  • Decisions statements (if-then-else)
  • Loops
    • count controlled
    • event controlled
    • exit conditions and sentinels
  • Subprograms
    • intrinsic functions
    • user defined functions
    • subroutines
  • Numerical Integration
    • rectangle rule
    • midpoint rule
    • trapezoidal rule
    • Simpson's rule
    • generalized Simpson-type rules
  • Arrays - Introduction
    • array declarations
    • declaring arrays "directly"
    • dimension clause and its usage
    • do loops with arrays
    • peculiarities of arrays in Fortran
    • passing arrays to subprograms
  • Errors in Floating-point Operations
    • integer arithmetic - exact results
    • rounding errors
    • cancellation and its effect
    • discretization error
    • stable problems - small changes lead to small changes
    • unstable problems - small changes lead to very large changes
  • Formatting Input and Output - Format Statement
    • I descriptor for integers
    • E and F descriptors for floating point numbers
    • X for spacing
    • / for new line
    • printing and reading arrays
    • file management
      • printing into the file
      • reading from a file
      • open and close statements
  • Solution of Ordinary Differential Equations (Initial Value Problem)
    • analytical solution is "better" than numerical solution and can be found using algebraic manipulators
    • numerical approaches
      • Euler's method - approximate the shape of the curve by its slopes
  • Various topics covering various holes
    • Exponentiation
    • Operator precedence
    • Mixing types
    • Complex numbers
    • Higher/"any" precision variables
    • Parameter and data statements
    • Logical variables
    • Decision statements (including elseif, case and while statements)
  • Solvers for nonlinear equations
    • Bisection method
    • Newton's method
  • Loops and arrays -- continuation
    • Loops -- generalized form
    • Vectors -- generalized forms
    • Dynamic storage allocation
    • Operations on 1-D arrays (vectors)
      • operations on vectors vs. loops
      • operations on vactor-subranges
      • application of where statement
    • Two- and higher- dimensional arrays
      • declarations
      • multi-dimensional arrays as special cases of 1-D arrays -- storage allocation schemes
      • multi-dimensional array operations

Reading assignment: pages v-127