scispace - formally typeset
Search or ask a question

Showing papers on "Fortran published in 1979"



Journal ArticleDOI
TL;DR: A package of 38 low level subprograms for many of the basic operations of numerical linear algebra is presented, intended to be used with FORTRAN.
Abstract: A package of 38 low level subprograms for many of the basic operations of numerical linear algebra is presented. The package is intended to be used with FORTRAN. The operations in the package are dot products, elementary vector operations, Givens transformations, vector copy and swap, vector norms, vector scaling, and the indices of components of largest magnitude. The subprograms and a test driver are available in portable FORTRAN. Versions of the subprograms are also provided in assembly language for the IBM 360/67, the CDC 6600 and CDC 7600, and the Univac 1108.

1,788 citations



Journal ArticleDOI
TL;DR: The program described here is an implementation of the generator described by Lewis et al. and indirectly attributed to D.H. Lehmer, and produces a sequence of positive integers, IX, by the recursion.
Abstract: There are a number of situations in which it is desirable to have a random number generator that is machine independent. In general, it is useful if a program written in a high-level language produces results which are the same from machine to machine as long as the input to the program is the same. For example, the pseudorandom number generator used by the Control Data Corporation in its GPSS simulation program is the same as in IBM's GPSS, even though the generator is known to have defective statistical behavior. Apparently, compatibility is more valuable than statistical goodness. The program described here is an implementation of the generator described by Lewis et al. [6] and indirectly attributed to D.H. Lehmer. The code for the program appears in Figure 1. The generator produces a sequence of positive integers, IX, by the recursion:

256 citations


ReportDOI
01 Nov 1979
TL;DR: The SLAC Electron Trajectory Program as mentioned in this paper is a program specifically written to compute trajectories of charged particles in electrostatic and magnetostatic focusing systems including the effects of space charge and self-magnetic fields.
Abstract: The SLAC Electron Trajectory Program is described and instructions and examples for users are given. The program is specifically written to compute trajectories of charged particles in electrostatic and magnetostatic focusing systems including the effects of space charge and self-magnetic fields. Starting options include Child's Law conditions on cathodes of various shapes. Either rectangular or cylindrically symmetric geometry may be used. Magntic fields may be specified using arbitrary configurations of coils, or the output of a magnet program such as Poisson or by an externally calculated array of the axial fields. The program is available in IBM FORTRAN but can be easily converted for use on other brands of hardware. The program is intended to be used with a plotter whose interface the user must provide.

246 citations


Journal ArticleDOI
TL;DR: The technique of ‘unrolling’ to improve the performance of short program loops without resorting to assembly language coding is discussed and a comparison of the benefits on a variety of computers using an assortment of FORTRAN compilers is presented.
Abstract: SUhlMARY The technique of ‘unrolling’ to improve the performance of short program loops without resorting to assembly language coding is discussed. A comparison of the benefits of loop ‘unrolling‘ on a variety of computers using an assortment of FORTRAN compilers is presented.

130 citations


Proceedings ArticleDOI
04 Jun 1979
TL;DR: There are several computer system architectures which have the goal of exploiting parallelism—multiprocessors, vector machines and array processors—and there have been attempts to design compilers to optimize programs written in conventional languages (e.g. "vectorizing" compilers for the FORTRAN language).
Abstract: There are several computer system architectures which have the goal of exploiting parallelism—multiprocessors, vector machines and array processors. For each of these architectures there have been attempts to design compilers to optimize programs written in conventional languages (e.g. "vectorizing" compilers for the FORTRAN language). There have also been new language designs to facilitate using these systems, such as Concurrent PASCAL for multiprocessors,6 and languages that utilize the features of such systems directly, such as GLYPNIR for the Illiac IV array processor19 and various "vectorizing" dialects of FORTRAN. These languages almost always make the multiprocessor, vector, or array properties of the computer visible to the programmer—that is, they are actually vehicles whereby the programmer helps the compiler uncover parallelism. Many of these languages or dialects are "unnatural" in that they closely reflect the behavior of the system for which they were designed, rather than reflecting the way programmers think about problem solutions.

106 citations


Journal ArticleDOI
TL;DR: This work was supported by the National Aeronautics and Space Administration under Contract NAS 7-100 and by the Office of Naval Research under Contract NR 044-457.
Abstract: Received 13 July 1977. Perm~sion to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. The work of the fast and fourth authors was supported by the National Aeronautics and Space Administration under Contract NAS 7-100. The work of the second author was supported by the U.S Energy Research and Development Administration (ERDA) under Contract AT (29-1)-789 and (at Washington State University) by the Office of Naval Research under Contract NR 044-457. Authors' addresses: C.L Lawson, Jet Propulsion Laboratory, M/S 125-128, 4800 Oak Grove Drive, Pasadena, CA 91103; R.J. Hanson, Numerical Mathematics, I :~. 5122, Sandia Laboratories, Albuquerque, NM 87115; D.R. Kincaid, Center for Numerical Analysis, The University of Texas at Austin, Austin, TX 78712; F.T. Krogh, Jet Propulsion Laboratory, M/S 125-128, 4800 Oak Grove Drive, Pasadena, CA 91103. © 1979 ACM 0098-3500/79/0900-0324 $00.75

99 citations


Journal ArticleDOI
TL;DR: This article discusses attitudes about "automatic programming," the economics of programming, and existing programming systems, all in the early 1950s, as well as the formation of the FORTRAN group, its knowledge of existing systems, its plans for FORTRan, and the development of the language in 1954.
Abstract: This article discusses attitudes about "automatic programming," the economics of programming, and existing programming systems, all in the early 1950s. It describes the formation of the FORTRAN group, its knowledge of existing systems, its plans for FORTRAN, and the development of the language in 1954. It describes the development of the optimizing compiler for FORTRAN I, of various language manuals, and of FORTRAN II and III. It concludes with remarks about later developments and the impact of FORTRAN and its successors on programming today.

89 citations


Journal ArticleDOI
TL;DR: A simple, understandable FORTRAN computer program for the location of hypocenters of local and regional earthquakes is presented, designed for interactive timesharing use and offers the ability to locate earthquakes quickly, obviating the need of punching data cards and submitting them to a central computer facility.
Abstract: A simple, understandable FORTRAN computer program for the location of hypocenters of local and regional earthquakes is presented. The program is designed for interactive timesharing use and offers the ability to locate earthquakes quickly, obviating the need of punching data cards and submitting them to a central computer facility. Variations of the program have been run on Honeywell 6023 and DEC PDP 11/70 computers.

65 citations


01 Jun 1979
TL;DR: A computer program written in FORTRAN subroutine form for the solution of linear and nonlinear constrained and unconstrained function minimization problems and the use of NEWSUMT and the definition of all parameters are described.
Abstract: A computer program written in FORTRAN subroutine form for the solution of linear and nonlinear constrained and unconstrained function minimization problems is presented. The algorithm is the sequence of unconstrained minimizations using the Newton's method for unconstrained function minimizations. The use of NEWSUMT and the definition of all parameters are described.

Journal ArticleDOI
TL;DR: Two subroutines for the solution of a Toeplitz set of m linear equations are presented and it is shown that the symmetric case requires 3m memory locations, while the nonsymmetric cases requires 5mMemory locations.
Abstract: Two subroutines for the solution of a Toeplitz set of m linear equations are presented. The symmetric case requires 3m memory locations, while the nonsymmetric case requires 5m memory locations.

01 Apr 1979
TL;DR: A digital computer program that calculates static stability, high lift and control, and dynamic derivative characteristics using the methods contained in the USAF Stability and Control Datcom (revised April 1976).
Abstract: : This report describes a digital computer program that calculates static stability, high lift and control, and dynamic derivative characteristics using the methods contained in the USAF Stability and Control Datcom (revised April 1976). Configuration geometry, attitude, and Mach range capabilities are consistent with those accommodated by the Datcom. The program contains a trim option that computes control deflections and aerodynamic increments for vehicle trim at subsonic Mach numbers. Volume I is the user's manual and presents program capabilities, input and output characteristics, and example problems. The program is written in ANSI Fortran IV. The primary deviations from standard Fortran are Namelist input and certain statements required by the CDC compilers. Core requirements have been minimized by data packing and the use of overlays. User oriented features of the program include minimized input requirements, input error analysis, and various options for application flexibility.

Journal ArticleDOI
TL;DR: NOVA SKED is a software system developed for the experimental control and collection of data from operant behavior experiments that is compatible with the Data General Corporation real-time disk operating system (RDOS).
Abstract: A software system (NOVA SKED) was developed for the experimental control and collection of data from operant behavior experiments that is compatible with the Data General Corporation real-time disk operating system (RDOS). NOVA SKED is based on the SKED state notation language originally implemented on Digital Equipment Corporation PDP-8 series of minicomputers. The system includes a compiler written in FORTRAN, a multitasking run-time system that can be configured to run up to 30 stations, a data back-up system, standard data manipulation programs and subroutines, and user manuals.

Journal ArticleDOI
W.P. Howson1
TL;DR: Two Fortran computer programs are presented which calculate the eigenvalues and eigenvectors of rigidly jointed plane frames, respectively, based on the stiffness method of analysis and uses classical member equations together with an algorithm which ensures that the required eigen values are found with certainty.

Journal ArticleDOI
TL;DR: A set of interactive computer programs which can be used to aid in the analysis of the dynamic behaviour of linear multivariable systems with main emphasis on frequency response methods including Nyquist and Bode arrays, closed-loop Nyquistand boae arrays, characteristic gain loci and generalised root loci.

Proceedings ArticleDOI
03 Dec 1979
TL;DR: The method of batch means is not successful in identifying the batch size for which the batch means are known to be independent in one of these data sets, which raises serious questions about the procedure used to test for independence ofbatch means.
Abstract: An interactive FORTRAN subroutine is presented for use with ongoing simulations to determine and collect the sample size needed to estimate the mean of a process with a specified level of statistical precision The subroutine can be used with simulation models written in a variety of languages, eg, FORTRAN, GASP, GPSS, SIMSCRIPT The subroutine partitions a sequence of observations on the random variable of interest into a series of consecutive batches, finding those batch sizes whose batch means are independent The classical iid method is then applied to build a confidence interval on the mean Under interactive user control, the subroutine then goes back to the simulation model as often as may be necessary to extend sample size to the point that the confidence interval satisfies the user's needsThis paper complements an earlier paper presenting software for interactive autoregressive analysis of simulation output [1] The present paper reports on the use of both techniques to analyze data produced by data models for which analytic results are known The method of batch means is not successful in identifying the batch size for which the batch means are known to be independent in one of these data sets This raises serious questions about the procedure used to test for independence of batch means, and points out the need for further research in this area

Journal ArticleDOI
Layne T. Watson1
TL;DR: A numerical implementation of S.N. Chow and J. Yorke's proposed algorithm for computing fixed points of C2 maps that is globally convergent with probability one is presented here, where careful attention has been paid to computational efficiency, accuracy, and robustness.

Journal ArticleDOI
TL;DR: The design principles and structure of an existing Fortran program library whose primary application is to solve optimization problems are discussed, as well as specific instances of the results of decisions to include particular desirable features.
Abstract: : This paper discusses in substantial detail the design principles and structure of an existing Fortran program library whose primary application is to solve optimization problems. Such a discussion not only helps to clarify the scope of application for potential users of the library, but also is useful for workers on other software projects. The fundamental objectives of the present library have been to produce sound, careful implementations of reliable methods that represent the state of the art in numerical optimization. The general implications of these overall design aims are presented, as well as specific instances of the results of decisions to include particular desirable features. (Author)

Proceedings ArticleDOI
Stuart I. Feldman1
01 Aug 1979
TL;DR: The following discusses the approach taken, the ways in which the tools had to be bent to do the job, the properties of Fortran that seem to cause the most trouble, and the costs of writing a portable compiler.
Abstract: I have recently written a portable compiler [1] for the Fortran 77 language [2]. It attacks an old language with new tools: the parser is generated automatically from an LALR(1) grammar, the program is produced by code generators designed for another language. These tools proved very valuable, but they are based on theory and experience one or two decades fresher than that underlying Fortran, so they really do not fit this application. The following discusses the approach taken, the ways in which the tools had to be bent to do the job, the properties of Fortran that seem to cause the most trouble, and the costs of writing a portable compiler. It also describes certain aspects of the approach to code generation, since others may wish to use the same tools. This paper does not describe low-level details of the implementation.This compiler is intimately connected with the programming language C[3]. The compiler is written in C, it uses tools written in C, the input/output library uses the standard C library, and it uses the second pass of a C compiler as code generator. To a much smaller extent, this compiler is based on the UNIX operating system, since all of the development work was done on UNIX systems and the current version of the compiler assumes the UNIX system process structure. It would require a serious but not enormous effort to move this compiler to a different operating system; it would be impossible to move it to a non-C environment.

Book
04 Sep 1979


Journal ArticleDOI
TL;DR: A preliminary report is given on the ITPACK project for developing adaptive iterative algorithms and software for solving large sparse PDE-related linear systems of equations in a collection of Fortran subroutines.

Journal ArticleDOI
TL;DR: A data storage and retrieval system is presented that can be used for clinical research studies and is designed in such a way that the programs are independent of the application.
Abstract: A data storage and retrieval system is presented that can be used for clinical research studies. The system is designed in such a way that the programs are independent of the application. It can be used by non-computer experts via a simple query language. Since it is bulit up in a modular way extensions can be easily made. The system is implemented on a PDP 11/70 under FORTRAN.

Journal ArticleDOI
TL;DR: An algorithm and its corresponding FORTRAN IV program which solves a system of simultaneous equations of the type generated in structural analysis based on the Gauss elimination method, which offers the following advantages: Takes into account zeros to avoid operations.
Abstract: This paper present an algorithm and its corresponding FORTRAN IV program which solves a system of simultaneous equations of the type generated in structural analysis. It is based on the Gauss elimination method, so it is a direct method. But it only needs to have in core as many equations as it can contain, with a minimum of two. The program offers the following advantages: (a) Takes into account zeros to avoid operations. (b) Considers very big numbers in the diagonal, corresponding to boundary conditions, to avoid operations. (c) It can handle several load cases either simultaneously or in groups, at choice.

Journal ArticleDOI
TL;DR: YPROS is an interactive program system consisting of a number of special purpose packages for simulation, identification, parameter estimation and control system design, which has been applied successfully to industrial problems of various kinds.

Journal ArticleDOI
TL;DR: A FORTRAN computer program for automatic neutron activation analysis is presented, which locates and identifies peaks in a gamma-ray spectrum, calculates peak areas and the concentrations of the elements of interest in the sample.
Abstract: A FORTRAN computer program for automatic neutron activation analysis is presented. The program locates and identifies peaks in a gamma-ray spectrum, calculates peak areas and the concentrations of the elements of interest in the sample. This program was specifically designed for the SLOWPOKE reactor, it uses a semi-absolute method and does not need standards or flux monitors. The program was written so as to minimize the computation time, and a typical 4096-channel spectrum is processed in five seconds by an IBM 360/75 computer.

Journal ArticleDOI
TL;DR: Two different abstract models, both suited for multi‐language multi‐machine usage, have been developed and evaluated and the performance of two compilers, each using both models, are presented.
Abstract: Portability of MUSS compilers is achieved by using an abstract machine model concept. Two different abstract models, both suited for multi-language multi-machine usage, have been developed and evaluated. These models differ mainly in the level of interface to the compiler. The form of these models and the performance of two compilers, each using both models, are presented.

Proceedings ArticleDOI
06 Nov 1979
TL;DR: A FORTRAN program has been written for a manipulator and is being applied to the Stanford maniputator with a Z.8000 microcomputer.
Abstract: The advantage of using a Multiprocessor controller for a mechanical manipulator is that parallel computations may be arranged to achieve a minimum computing time so that a reat time control is possible. The parallel processing scheme utilizes a number of CPU's and pursues the following steps. First divide the entire task into subtasks. Based on the precedence relations, an optimum order of execution for each CPU is obtained by using an algorithm which includes, afternatively, forward and backward phases. in each forward phase it seeks the currently available, shorter computing time, while in each backward phase it seLects a better alternative. A FORTRAN program has been written for a manipulator and is being applied to the Stanford maniputator with a Z.8000 microcomputer.

Journal ArticleDOI
TL;DR: Data General’s software that allows multitask programming in FORTRAN in certain experimental domains is used, and performance of the system is discussed.
Abstract: Running multiple subjects on a laboratory computer is usually a difficult problem. An easy solution is possible in certain experimental domains by using Data General’s software that allows multitask programming in FORTRAN. An example is provided, and performance of the system is discussed.