1 A Little Vocabulary.- 2 Fortran Basics.- Arithmetic operations.- Arithmetic hierarchies.- Variable names.- Assignment statements.- Number types, type statements.- Simplified output.- Use of the data card.- 3 Branching statements.- Logical IF, Go to.- Logical connectives.- Stop.- 4 Supplied functions, Arithmetic statement functions.- Supplied functions.- Arithmetic statement functions.- 5 Algorithms and flow charts.- Symbols.- Compute through.- 6 Sequences.- Approximation by sequences, monotonic sequences.- Squeeze theorem.- Recursive definitions.- 7 Output formatting.- Print, format statements.- Specifying number types.- Skip symbol, pX.- Printing headings.- Vertical carriage control.- 8 Roundoff error.- Word length capability.- Accumulated error.- Differencing.- Double Precision.- Double Precision functions.- 9 Potpourri of Fortran statements.- Do, Continue.- Subscripts and dimension.- Read.- Subprograms.- Alphameric constants.- Arithmetic IF.- Computed Go to.- 10 Numerical evaluation of integrals.- Fundamental theorem.- Definition of integral.- Error terms.- 11 Applications to Functions of Two Variables, Infinite Series.- Maxima and Minima.- Gradient method.- Numerical evaluations of double integrals.- Surface Area (Triangularization).- Infinite series.- 12 Differential equations.- Line elements.- Euler's method.- Runge-Kutta method.- Solutions by power series.- Picard's method.- Higher order equations and systems.- Solutions to selected exercises.- Computer problems by topics.- Typical course outline.
Reihe
Auflage
Softcover reprint of the original 1st ed. 1977
Sprache
Verlagsort
Zielgruppe
Für Beruf und Forschung
Research
Illustrationen
Maße
Höhe: 244 mm
Breite: 170 mm
Dicke: 10 mm
Gewicht
ISBN-13
978-0-387-90283-8 (9780387902838)
DOI
10.1007/978-1-4612-9938-7
Schweitzer Klassifikation
1 A Little Vocabulary.- 2 Fortran Basics.- Arithmetic operations.- Arithmetic hierarchies.- Variable names.- Assignment statements.- Number types, type statements.- Simplified output.- Use of the data card.- 3 Branching statements.- Logical IF, Go to.- Logical connectives.- Stop.- 4 Supplied functions, Arithmetic statement functions.- Supplied functions.- Arithmetic statement functions.- 5 Algorithms and flow charts.- Symbols.- Compute through.- 6 Sequences.- Approximation by sequences, monotonic sequences.- Squeeze theorem.- Recursive definitions.- 7 Output formatting.- Print, format statements.- Specifying number types.- Skip symbol, pX.- Printing headings.- Vertical carriage control.- 8 Roundoff error.- Word length capability.- Accumulated error.- Differencing.- Double Precision.- Double Precision functions.- 9 Potpourri of Fortran statements.- Do, Continue.- Subscripts and dimension.- Read.- Subprograms.- Alphameric constants.- Arithmetic IF.- Computed Go to.- 10 Numerical evaluation of integrals.- Fundamental theorem.- Definition of integral.- Error terms.- 11 Applications to Functions of Two Variables, Infinite Series.- Maxima and Minima.- Gradient method.- Numerical evaluations of double integrals.- Surface Area (Triangularization).- Infinite series.- 12 Differential equations.- Line elements.- Euler's method.- Runge-Kutta method.- Solutions by power series.- Picard's method.- Higher order equations and systems.- Solutions to selected exercises.- Computer problems by topics.- Typical course outline.
