No comments about Structured Fortran 77 Programming With Hewlett-Packard Computers.

2 comments about Advanced Scientific Fortran.

1. On the verge of the 21st century, FORTRAN as a language is practically dead, since it does not offer modern programming facilities and features commonly found in newer languages.

   With the user base declining in quantity and quality (Misha Kagalenko sets a vivid example of the decline in quality), new books on Fortran, especially those that provide essentially no new information to the readers, are almost doomed to fail.

   To expound a little more on the example of Kagalenko, his remarks about relative performance of FORTRAN compared to C++ show outstanding ignorance about the state of contemporary computing.




2. A book that shows the whole field well. It goes beyond the tutorial books and has handy source code for some practical programs you should run. It also covers resources. I had my school library buy a copy after reading the authors' post on Usenet about the book in comp.lang.fortran. But with computers at home who can access Fortran?

1 comments about Fortran 90.

1. This is a very elementary book on FORTRAN and does not address the many powerful new commands of FORTRAN 90. The numerical methods are very traditional and are of very little practical value. It is apparent that the author has not used FORTRAN 90 to solve any real problems

No comments about Fortran IV.

No comments about Palm reading, (His Computer explorer series in FORTRAN and BASIC; [v. 17]).

No comments about Introduction to digital computer problems using FORTRAN IV;: Preliminary edition (McGraw-Hill General Engineering series).

No comments about A FORTRAN 77 course.

No comments about Numeric Computing in Fortran.

No comments about EXAMNotes for FORTRAN (EXAMNotes).

1 comments about Combinatorial Heuristic Algorithms With Fortran (Lecture Notes in Economics and Mathematical Systems).

1. This book contains combinatorial heuristic algorithms with computer programs in FORTRAN 77. Each of the following regarded problems has been shown to be NP-complete: integer linear programming, zero-one linear programming, zero-one knapsack problem, traveling salesman problem, Steiner tree problem, graph partitioning, k-center location. After a short description of each problem and the presented heuristic algorithm to solve it, the parameter description of the subroutines and the main program is given. The corresponding algorithms are printed directly by the computer. A little example with input and output data illustrates the usage of each computer program