Within the last year
Within the past 3 years
1 - 10 of 19 articles
A set of subroutines to allow algebraic manipulations on the IBM 7094 computer has been written using a List Processor, SLIP. A series of four problems of increasing difficulty were solved using these routines.
A method for storing strings is described which uses blocks of indefinite size, and is therefore completely dynamic. Its relation to similar schemes is discussed.
The use and implementation of two new FORTRAN format conversions are discussed. These format types give the FORTRAN programmer control of input/output specifications at execution time.
It is suggested that the convergence properties of the usual Picard successive approximation scheme may be improved through use of nonlinear extrapolation techniques. A numerical example is provided.
This note describes some FORTRAN subroutines to facilitate handling of tape files. They allow symbolic naming or information files, without violating the casual scientific programmer's idea of simplicity. Some comments on two years use of these subroutines are given.
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.