{"id":36,"date":"2017-09-11T10:26:48","date_gmt":"2017-09-11T13:26:48","guid":{"rendered":"http:\/\/www.professores.uff.br\/diomarcesarlobao\/?page_id=36"},"modified":"2017-09-11T10:26:48","modified_gmt":"2017-09-11T13:26:48","slug":"index-and-description-of-example-fortran-programs","status":"publish","type":"page","link":"https:\/\/www.professores.uff.br\/diomarcesarlobao\/index-and-description-of-example-fortran-programs\/","title":{"rendered":"Index and description of example Fortran programs"},"content":{"rendered":"

The following is a listing and description of examples from: http:\/\/www.personal.psu.edu\/faculty\/j\/h\/jhm\/f90<\/h2>\n\n\n\n\n\t\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t
Program name:
\n
\n<\/th>		What it does:
\n
\n<\/th>\n<\/tr>\n<\/thead>\n
add.f<\/a>\t<\/td>Adds 2 numbers
\n<\/td>\n<\/tr>\n
add2.f<\/a>\t<\/td>add.f using SUBROUTINEs and a MODULE
\n<\/td>\n<\/tr>\n
aorder.f<\/a>\t<\/td>Demonstrates the storage order of a Multi-dimensional array, also the use of the EQUIVALENCE statement.
\n<\/td>\n<\/tr>\n
arith.f<\/a>\t<\/td>Demonstrates the arithmetic assignments such as order of operations and mixed mode operations. Also uses the DATA statement
\n<\/td>\n<\/tr>\n
arithp.f<\/a>\t<\/td>Demonstrates the arithmetic assigments using parentheses and the PARAMETER statement.
\n<\/td>\n<\/tr>\n
array1.f<\/a>
\n\t<\/td>		Demonstrates use of arrays for data analysis-max, min, and average and use of formatted output.
\n<\/td>\n<\/tr>\n
array1s.f<\/a>\t<\/td>Same as array1.f except uses subroutines for data analysis. Demonstrates how to pass arrays between the main program and subprograms.
\n<\/td>\n<\/tr>\n
array2.f<\/a>\t<\/td>Demonstrates the use of arrays with Fortran 90 specifications.
\n<\/td>\n<\/tr>\n
array2s.f<\/a>\t<\/td>Same as array2.f except it uses subroutines for data analysis and Fortran90 size declarations.
\n<\/td>\n<\/tr>\n
array2se.f<\/a>\t<\/td>Same as array2.fand array2s.f except it uses subroutines and Fortran 77 array size declarations.
\n<\/td>\n<\/tr>\n
array2sf.f<\/a>\t<\/td>Another rewrite of array2.f.
\n<\/td>\n<\/tr>\n
array3.f<\/a>\t<\/td>Demonstrates the use of the ALLOCATE statement for declaring arrays of unknown size.
\n<\/td>\n<\/tr>\n
array3a.f<\/a>\t<\/td>Program very similar to array3.f but examines the input data file to determine the size of the input array. Examines input file array3a.in.<\/a><\/td>\n<\/tr>\n
array3as.f<\/a>\t<\/td>Same program as array3a.f except it demonstrates the use of the ALLOCATE statement with subroutines.
\n<\/td>\n<\/tr>\n
array3b.f<\/a>\t<\/td>Another use of the ALLOCATE statement determining the size from the input file. Uses the input file array3b.in.<\/a>
\n<\/td>\n<\/tr>\n
array3c.f<\/a>\t<\/td>Another array program for arrays of unknown size using Fortran 77's PARAMETER statement rather than ALLOCATE.
\n<\/td>\n<\/tr>\n
array3e.f<\/a>\t<\/td>Array program which demonstrates the MISUSE of the ALLOCATE statement.
\n<\/td>\n<\/tr>\n
associated.f<\/a>\t<\/td>Demonstrates the use of pointers and targets and tests their association.
\n<\/td>\n<\/tr>\n
clobber.f<\/a>\t<\/td>Illustrates the pitfalls of poorly indexing arrays.
\n<\/td>\n<\/tr>\n
debug.f<\/a>\t<\/td>Heat Transfer Coefficient program with errors which need to be fixed.
\n<\/td>\n<\/tr>\n
debug1.f\t<\/a><\/td>Demonstrates the debugging process.
\n<\/td>\n<\/tr>\n
dimtest.f\t<\/a><\/td>Tests the DIM option for the Fortran 90 intrinsic functions sum, minval, and maxval for use with arrays. Associated with sample output dimtest.out<\/a>.
\n<\/td>\n<\/tr>\n
dual-errors.f<\/a>\t<\/td>Example of the use of the INTERFACE structure creating a generic function interface.
\n<\/td>\n<\/tr>\n
dual-interface.f<\/a>\t<\/td>Demonstrates the use of the INTERFACE structure which creates a generic function which can be used with both real and integer values.
\n<\/td>\n<\/tr>\n
errors.f<\/a>\t<\/td>Program with several errors due to the poor location of statements.
\n<\/td>\n<\/tr>\n
format.f<\/a>\t<\/td>Demonstrates the many uses of the Format statement. Generates sample file format.out.<\/a>
\n<\/td>\n<\/tr>\n
funspeed.f<\/a>\t<\/td>Program similar to speed.f which uses functions to do all of the calculations.
\n<\/td>\n<\/tr>\n
gp-int1<\/a>\t<\/td>Demonstrates use of gnuplot to graph data from two input files. Sample gnuplot input file.
\n<\/td>\n<\/tr>\n
gp-int2<\/a>\t<\/td>Another sample gnuplot input file.
\n<\/td>\n<\/tr>\n
gp-int3<\/a>\t<\/td>\" \" \"
\n<\/td>\n<\/tr>\n
grades1.f\t<\/a><\/td>Program which uses arrays and subroutines to calculate and store grades. Associated with grades.in.<\/a>
\n<\/td>\n<\/tr>\n
htcoef.f<\/a>\t<\/td>Program which calculates approximate heat transfer coefficients for a 1 inch pipe for several Reynolds numbers.
\n<\/td>\n<\/tr>\n
htcoef1.f<\/a>\t<\/td>Same as htcoef.f except it calls a function to do the calculations.
\n<\/td>\n<\/tr>\n
htcoef2.f<\/a>\t<\/td>Same as htcoef.f except it demonstrates the fact that variables of the same name in the main program and subprograms can have different values.
\n<\/td>\n<\/tr>\n
htcoef3.f<\/a>\t<\/td>Program very similar to htcoef1.f and htcoef2.f which uses an exponentiation trick to increase the speed.
\n<\/td>\n<\/tr>\n
iftests.f<\/a><\/td>Shows the many uses of the IF statement.
\n<\/td>\n<\/tr>\n
inter1.f<\/a>\t<\/td>Demonstrates 2 simple methods of interpolation (linear and cubic) for smoothly joining results from 2 disjoint regions.
\n<\/td>\n<\/tr>\n
inter2.f<\/a>\t<\/td>Same as inter1.f except interpolates different data.
\n<\/td>\n<\/tr>\n
inter3.f<\/a>\t<\/td>Similar to inter1.f and inter2.f but uses a weighted transition.
\n<\/td>\n<\/tr>\n
interface.f<\/a>\t<\/td>Demonstrates the use of the INTERFACE structure which allows the use of FUNCTIONS with arrays.
\n<\/td>\n<\/tr>\n
linint1.f<\/a>\t<\/td>Subroutine which interpolates y-values given an x-value and a table of y-values.
\n<\/td>\n<\/tr>\n
linint2.f<\/a>\t<\/td>Subroutine similar to linint1.f but uses tables of x and y values.
\n<\/td>\n<\/tr>\n
linint3.f<\/a>\t<\/td>Subroutine similar to linint1.f and linint2.f but more efficient.
\n<\/td>\n<\/tr>\n
linint4.f<\/a>\t<\/td>Subroutine similar to linint1.f , linint2.f, and linint3.f but even more efficient.
\n<\/td>\n<\/tr>\n
mathin<\/a>\t<\/td>Sample file of Mathematica commands.
\n<\/td>\n<\/tr>\n
matprod.f\t<\/a><\/td>Multiplies two matrices together.
\n<\/td>\n<\/tr>\n
module.f<\/a>\t<\/td>Demonstrates the use of the MODULE structure within a main program and its subprograms.
\n<\/td>\n<\/tr>\n
newton1.f<\/a>\t<\/td>Sample program using NEWTON ITERATION to solve an equation.
\n<\/td>\n<\/tr>\n
newton2.f<\/a>\t<\/td>More complicated version of newton1.f which uses statement functions and do loops.
\n<\/td>\n<\/tr>\n
noadv.f<\/a>\t<\/td>Demonstrates the use of the NO ADVANCE option on READ and WRITE.
\n<\/td>\n<\/tr>\n
pawsum.f\t<\/a><\/td>Array program which uses MAX, MIN, implied DO loops, DATA statements, and other Fortran 90 constructs.
\n<\/td>\n<\/tr>\n
plot1.f<\/a>\t<\/td>Plots sine function.
\n<\/td>\n<\/tr>\n
plot2.f<\/a>\t<\/td>Program similar to plot1.f except subroutines are used. Illustrates EXTERNAL and INTRINSIC statements
\n<\/td>\n<\/tr>\n
pointers.f<\/a>\t<\/td>Demonstrates the use of pointers to manipulate sections of arrays. Generates the file pointers.out<\/a>
\n<\/td>\n<\/tr>\n
ranges.f<\/a>\t<\/td>Displays the smallest and largest absolute values that can be represented with each of several data types. Uses Fortran 90 statements TINY and HUGE.
\n<\/td>\n<\/tr>\n
secant.f<\/a>\t<\/td>Uses secant iteration to find the roots of an equation. Compares solution to Newton Iteration of same equation.
\n<\/td>\n<\/tr>\n
sifunc.f<\/a>\t<\/td>Introduction to the statement function.
\n<\/td>\n<\/tr>\n
speed.f<\/a>\t<\/td>Times three different methods of calculating the dot product of long vectors.
\n<\/td>\n<\/tr>\n
speedf.f<\/a>\t<\/td>Program similar to speed.f.
\n<\/td>\n<\/tr>\n
sums.f<\/a>\t<\/td>Demonstrates the Fortran 90 SUM function with the MASK option.
\n<\/td>\n<\/tr>\n
trig.f<\/a>\t<\/td>Calculates the SIN and COS of an angle given in degrees.
\n<\/td>\n<\/tr>\n
where.f<\/a>\t<\/td>Demonstrates the use of WHERE, ELSE WHERE, and END WHERE.
\n<\/td>\n<\/tr>\n
<\/td>
Ordinary Differential Equation Programs<\/div>
\n<\/td>\n<\/tr>\n
fall.f<\/a><\/td>Calculates the dynamics of a falling body.
\n<\/td>\n<\/tr>\n
fall1.f<\/a>\t<\/td>Program similar to fall.f but introduces MODULES.
\n<\/td>\n<\/tr>\n
fall2.f<\/a>\t<\/td>Calculates the dynamics of a falling body attached to a spring.
\n<\/td>\n<\/tr>\n
fall3.f<\/a>\t<\/td>Program similar to fall2.f but give an answer that is second order accurate (proportional to dt**2)
\n<\/td>\n<\/tr>\n
odeint.f<\/a>\t<\/td>Demonstrates the use of Runge-Kutta, Adams-Bashford, and Adams-Moulton methods for solving ODEs
\n<\/td>\n<\/tr>\n
<\/td>
Curvefit Programs<\/div>
\n<\/td>\n<\/tr>\n
quad.f<\/a>\t<\/td>Performs a Quadratic spline fit to a specified data file (with .txt extension)
\n<\/td>\n<\/tr>\n
rholiq.f<\/a>\t<\/td>Subroutine which evaluates the density of Freon and its derivatives with respect to other properties.
\n<\/td>\n<\/tr>\n
satprs.f<\/a>\t<\/td>Function which evaluates the saturation pressure of Freon as a function of saturation temperature.
\n<\/td>\n<\/tr>\n
thcl.f<\/a>\t<\/td>Function which evaluates the liquid thermal conductivity of Freon as a function of enthalpy.
\n<\/td>\n<\/tr>\n
viscl.f<\/a>\t<\/td>Function which evaluates the liquid dynamic viscosity as a function of liquid enthalpy and pressure.
\n<\/td>\n<\/tr>\n
<\/td>
Integration Programs
\n<\/div><\/td>\n<\/tr>\n
trapezoid.f<\/a>\t<\/td>Program which demonstrates the Trapezoidal rule of integration.
\n<\/td>\n<\/tr>\n
trapz1.f<\/a>\t<\/td>Program similar to trapezoid.f <\/a>which uses the file trapcom.h through an INCLUDE statement .
\n<\/td>\n<\/tr>\n
trapz2.f<\/a>\t<\/td>Program similar to trapezoid.f which uses a MODULE.
\n<\/td>\n<\/tr>\n
<\/td>
Programs using Character Variables
\n<\/div><\/td>\n<\/tr>\n
charvar.f<\/a>\t<\/td>Program which demonstrates the use of character variables in Fortran 77.
\n<\/td>\n<\/tr>\n
charvr90.f<\/a>\t<\/td>Program whic demonstrates the use of character variables in Fortran 90.
\n<\/td>\n<\/tr>\n
<\/td>
Programs associated with Least Squares Fit<\/div>
\n<\/td>\n<\/tr>\n
gendata.f<\/a>\t<\/td>Creates fake experimental data with a random error.
\n<\/td>\n<\/tr>\n
lin1.f<\/a>\t<\/td>Program which tests linear equation solvers and sets up a 6x6 system of linear equations. Generates the file lin1.out<\/a>
\n<\/td>\n<\/tr>\n
lsq.f\t<\/a><\/td>Program which performs a least squares fit of a quadratic equation to given data. This particular program gives the location of a falling object at various times. Associated with the file fall.txt<\/a>
\n<\/td>\n<\/tr>\n
lsq2.f<\/a>\t<\/td>Program similar to lsq.f which takes advantage of Fortran 90 statements.
\n<\/td>\n<\/tr>\n
lsq3.f<\/a>\t<\/td>Program similar to lsq.f which uses code that is optimized for parallel or vector processors.
\n<\/td>\n<\/tr>\n
quadfit.f<\/a>\t<\/td>Program which takes data from two arrays and fits them to a quadratic equation.
\n<\/td>\n<\/tr>\n
<\/td>
Programs associated with Sorting Data<\/div>
\n<\/td>\n<\/tr>\n
drvsort.f<\/a>\t<\/td>Program which drives sorting subroutines.
\n<\/td>\n<\/tr>\n
sort1.f<\/a>\t<\/td>Example of a SELECTION SORT using Fortran 90.
\n<\/td>\n<\/tr>\n
sort2.f<\/a>\t<\/td>Example of a BUBBLE SORT.
\n<\/td>\n<\/tr>\n
sort3.f<\/a>\t<\/td>Example of an INSERTION SORT.
\n<\/td>\n<\/tr>\n
sort3a.f<\/a>\t<\/td>Example of an INSERTION SORT using Fortran 90 Functions.
\n<\/td>\n<\/tr>\n
sorthalf.f\t<\/a><\/td>Sorts an array also making the same interchanges in an auxiliary array. Array can be sorted in increasing or decreasing order.
\n<\/td>\n<\/tr>\n
sortout<\/a>\t<\/td>Test of all sorting subroutines.
\n<\/td>\n<\/tr>\n
Bundle file<\/a>\t<\/td>For those who want all!.
\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":22,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_exactmetrics_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":""},"categories":[],"tags":[],"class_list":["post-36","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.professores.uff.br\/diomarcesarlobao\/wp-json\/wp\/v2\/pages\/36","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.professores.uff.br\/diomarcesarlobao\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.professores.uff.br\/diomarcesarlobao\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.professores.uff.br\/diomarcesarlobao\/wp-json\/wp\/v2\/users\/22"}],"replies":[{"embeddable":true,"href":"https:\/\/www.professores.uff.br\/diomarcesarlobao\/wp-json\/wp\/v2\/comments?post=36"}],"version-history":[{"count":1,"href":"https:\/\/www.professores.uff.br\/diomarcesarlobao\/wp-json\/wp\/v2\/pages\/36\/revisions"}],"predecessor-version":[{"id":37,"href":"https:\/\/www.professores.uff.br\/diomarcesarlobao\/wp-json\/wp\/v2\/pages\/36\/revisions\/37"}],"wp:attachment":[{"href":"https:\/\/www.professores.uff.br\/diomarcesarlobao\/wp-json\/wp\/v2\/media?parent=36"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.professores.uff.br\/diomarcesarlobao\/wp-json\/wp\/v2\/categories?post=36"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.professores.uff.br\/diomarcesarlobao\/wp-json\/wp\/v2\/tags?post=36"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}