Showing papers on "Fortran published in 1973"
Book•
01 Jan 1973
TL;DR: The Fortran Codes for Mathematical Programming; Linear, Quadratic and Discrete, 1975, presents a meta-modelling framework for solving linear and quadratic programming problems.
Abstract: (1975). Fortran Codes for Mathematical Programming; Linear, Quadratic and Discrete. Journal of the Operational Research Society: Vol. 26, No. 2, pp. 345-346.
84 citations
TL;DR: The proposed algorithm, combining features from other well known models, and programmed in Fortran IV is tested against existing methods and shows that the algorithm is efficient, easy to run and is very competitive with other well-known methods.
Abstract: SUMMARY This paper discusses the problem of assigning facilities to locations. Several optimal and Sub-optimal-yielding algorithms are discussed mentioning their desirable and undesirable features. A new heuristic algorithm is proposed. The proposed algorithm, combining features from other well known models, and programmed in Fortran IV is tested against existing methods. The results show that the algorithm is efficient, easy to run and is very competitive with other well-known methods.
68 citations
TL;DR: The conclusion is drawn that data allocation rather than code structuring is the crucial ILLIAC optimization problem and a satisfactory method of data allocation is presented.
Abstract: As part of an effort to design and implement a Fortran compiler on the ILLIAC IV, an extended Fortran, called IVTRAN, has been developed. This language provides a means of expressing data and control structures suitable for exploiting ILLIAC IV parallelism. This paper reviews the hardware characteristics of the ILLIAC and singles out unconventiona features which could be expected to influence langluage (and compiler) design. The implications of these features for data layout and algorithm structure are discussed, and the conclusion is drawn that data allocation rather than code structuring is the crucial ILLIAC optimization problem. A satisfactory method of data allocation is then presented. Language structures to utilize this storage method and express parallel algorithms are described.
47 citations
15 Nov 1973
TL;DR: A set of FORTRAN callable subprograms are proposed which will be useful in the development of efficient portable ANSI FORTRan subprogram’s and applications programs in the area of linear algebra.
Abstract: A set of FORTRAN callable subprograms are proposed which will be useful in the development of efficient portable ANSI FORTRAN subprograms and applications programs in the area of linear algebra.
45 citations
01 Jun 1973
TL;DR: An interim version of a computer program package for random number generation on the IBM System/360 that has the ability (optional) to shuffle the pseudo-random numbers to obtain better statistical properties.
Abstract: : The report is intended to describe an interim version of a computer program package for random number generation on the IBM System/360. The package, when called by a FORTRAN 4 program, will deliver either a single value or an array (of specified size) of single precision uniformly, normally, or exponentially distributed pseudo-random deviates, or a single value or an array of uniformly distributed integers between 1 and ((2 to the 31st power)-1). The package also has the ability (optional) to shuffle the pseudo-random numbers to obtain better statistical properties.
43 citations
01 Dec 1973
TL;DR: The RELAP4 program as mentioned in this paper is a digital computer program written in FORTRAN IV developed to describe the behavior of water-cooled nuclear reactors subjected to postulated transients such as those resulting from loss of coolant, pump failure, or power excursions.
Abstract: RELAP4 is a digital computer program, written in FORTRAN IV, developed to describe the behavior of water-cooled nuclear reactors subjected to postulated transients such as those resulting from loss of coolant, pump failure, or power excursions. The program calculates fluid conditions such as flow, pressure, mass inventory, and quality; thermal conditions such as surface temperatures, temperature profiles, and energy distributions; and heat fluxes in power generating and dissipating elements. The program also calculates reactor power, decay heat, and reactivity. In addition to describing transients in boiling- water and pressurized-water reactors, the program is sufficiently versatile to describe transients in experimental thermal-hydraulic systems. The RELAP4 user must define the geometric features of the system to be analyzed as well as an appropriate set of initial conditions. RELAP4 then solves an integral form of the fluid conservation and state equations applied to each user-defined control volume. Currently, the number of these control volumes is limited to 75 and the number of junctions (flow paths) between volumes is limited to 100. By simply increasing the array sizes, these limits could be raised, if necessary, until the capacity of the particular computer is reached. RELAP4 source decks are available in double precision (EBCDIC) versions.more » Special timing and input-output routines are available and used by the RELAP4 program for the IBM 360 systems. Some of these routines are necessary and, if other computers are used must be rewritten for those computers. Sample problems have been run on the IBM 360/75 computer. (37 references) (auth)« less
32 citations
TL;DR: Factors that affect the paging characteristics of user programs in virtual storage systems are presented in tutorial form and measures are suggested that can be taken to exploit the virtual storage concept at the source language level in assembler, COBOL, FORTRAN, and PL/I.
Abstract: Factors that affect the paging characteristics of user programs in virtual storage systems are presented in tutorial form. Measures are suggested that can be taken to exploit the virtual storage concept at the source language level in assembler, COBOL, FORTRAN, and PL/I.
29 citations
25 citations
TL;DR: A package of Fortran programs has been developed that permits a user to interactively design and test array grammars, involving array languages consisting of simple geometrical patterns, as well as a language of “neuron pictures.”
Abstract: A package of Fortran programs has been developed that permits a user to interactively design and test array grammars. The user can control the rule selection procedure in a derivation or parse, using weighted programming matrices; he also has a choice of instance selection schemes (raster, random, parallel). Examples are given involving array languages consisting of simple geometrical patterns, as well as a language of “neuron pictures.”
TL;DR: This chapter discusses structured programming as an idea that has finally arrived, and it is "in" to teach about structured programming, even if the authors don't quite understand exactly what is meant by it.
Abstract: Structured programming [1] is a common topic of conversation these days. It appears to be an idea that has finally arrived, and it is "in" to teach about structured programming, even if we don't quite understand exactly what is meant by it.
TL;DR: In situations of low expected cell frequency the Fisher exact probability test (Fisher, 1934) is always appropriate, and usually recommended as a means of overcoming the pitfalls of chi-square.
Abstract: 40 and each expected cell frequency is at least 10, this use of chisquare as a test for association is considered justifiable and relatively free of controversy. On the other hand, when the total N is small or any expected cell frequency is less than five the use of chi-square is usually warned against. Recommendations for the borderline case of an expected cell frequency between five and 10 differ, but the details of this issue are not pertinent here. The salient issue is that in such situations of low expected cell frequency the Fisher exact probability test (Fisher, 1934) is always appropriate, and usually recommended as a means of overcoming the pitfalls of chi-square. This test is a method for
TL;DR: A system is described that greatly facilitates inter active discrete-time simulation in FORTRAN and permits the user to alter and examine the value of any variable during execution and to save all variables during simulation.
Abstract: A system is described that greatly facilitates inter active discrete-time simulation in FORTRAN. The system allows the user to alter and examine the value of any variable during execution. It permits the user to plot any variable as simulation proceeds and to save all variables during simulation. Once a simulation run is complete, the user may go back and look at all previous values of all variables. This system permits the user to restart his simulation at any previous time, with all variables reset to their former values. Many other features are provided to enable novice users to control the simulation with a minimum of external aid. All features are called by simple commands issued during the simulation by the user, or predefined by him in a data file. The features of the system are largely machine-indepen dent and could be easily converted to any time- sharing or batch-processing system. The programming details of the control system are not included, but a general outline of the concepts of its operat...
[...]
TL;DR: In this paper, the implications of conforming to the ANSI standard when writing FORTRAN programs are discussed, as well as the problem of producing optimal programs, debugging techniques and a number of miscellaneous topics.
Abstract: This paper is based on a set of lectures given at Cambridge, directed to those who intend to write FORTRAN programs which have more than a transient life. This first part deals with the implications of conforming to the ANSI standard when writing FORTRAN. The second part, which will appear in the next issue, deals with the problem of producing optimal programs, debugging techniques and a number of miscellaneous topics. © 1973 Wiley Periodicals, Inc.
TL;DR: A computer program utilizing the Cooley–Tukey algorithm for rapid Fourier transformation is described and automatic search for the electron-density peaks, calculation of the distances between them and direct drawing of the structure on the computer printout are provided.
Abstract: A computer program utilizing the Cooley–Tukey algorithm for rapid Fourier transformation is described. It has the following main features: (1) Fortran language compatible with most present day computers (the program was tested on Univac 1106/8, IBM 360, CDC 6600) is used; (2) limited core-storage is required (30,000–40,000 words); (3) except for the electron-density output, no auxiliary storage is required; (4) all space groups can be treated without any modification in the program; in every case only the independent reflections must be supplied; (5) repetitive syntheses, such as are required in working with direct multi-solution methods, can be carried out; (6) automatic search for the electron-density peaks, calculation of the distances between them and direct drawing of the structure on the computer printout are provided.
01 Jan 1973
TL;DR: POPSS is an event driven simulator which is intended to simulate the activity of a computer system- hardware together with an operating system - as it processes a work-load.
Abstract: In this paper we describe POPSS, an event driven simulator which is intended to simulate the activity of a computer system- hardware together with an operating system - as it processes a work-load. Input to the simulator is in the form of keyword parameters which are used for describing all three components - hardware, operating system, and workload.POPSS is a simulator as opposed to a simulation language. It is designed to model the inner workings of a computer system in addition to yielding the results usually associated with simulation. The program is highly modular, consisting of some 45 subprograms. Of these, there are 22 modules, each of which represents an operating system component (or possibly a part of one such component). Included in POPSS are built-in replacement features to allow a user the capability of designing alternative resource allocation strategies. These features are in addition to the standard subprogram replacement automatically available through the use of FORTRAN IV.
TL;DR: The algorithm is structured in a way which enables many of the operations to be performed in parallel; the parallelisms in the algorithm have had an impact on the conceptual design of an array computer.
TL;DR: In this paper, students are trained to use Fortran IV programming to apply a digital computer to the Monte Carlo analysis of chemical kinetics, which is a technique used in the field of computer science.
Abstract: Students are taught to use Fortran IV programming to apply a digital computer to the Monte Carlo analysis of chemical kinetics.
TL;DR: This paper presents a realistic chemical-process optimization problem in detail, and notes the fact of its equivalence to the general nonlinear programming problem.
Abstract: This paper presents a realistic chemical-process optimization problem in detail, and notes the fact of its equivalence to the general nonlinear programming problem. The eight equality constraints that arise are handled by algebraic substitution, and the resulting four-variable problem is solved by a modified form of the Davidon-Fletcher-Powell algorithm. Details of the method are presented including a FORTRAN computer program, and results of two typical cases are summarized.
TL;DR: The second part of this paper addressed to those who write FORTRAN programs of more than transitory life deals with facilities outside the Standard, optimization, recursion, the design of user interfaces, debugging and program proving.
Abstract: The second part of this paper addressed to those who write FORTRAN programs of more than transitory life deals with facilities outside the Standard, optimization, recursion, the design of user interfaces, debugging and program proving. © 1973 Wiley Periodicals, Inc.
TL;DR: A direct three-dimensional elliptic solver is presented for application in a wide class of numerical methods for solving partial differential equations in physics and engineering.
Abstract: A direct three-dimensional elliptic solver is presented for application in a wide class of numerical methods for solving partial differential equations in physics and engineering. The derived algorithm and FORTRAN code implement Buzbee, Golub and Nielson's proposed extension of Buneman's Cyclic-Reduction Poisson solver to three dimensions. Both a 'most direct' cyclic reduction and a revised method (to eliminate roundoff error difficulties) are derived. Tests on an IBM 360/67 computer, using various optional combinations of subroutines, showed significant differences in accuracy and computing time, with the optimum subroutine combination depending on mesh size.
TL;DR: MANTIS is a natural debugging facility for the FORTRAN language subsystem on the PDP‐10 that was designed and implemented in an existing language subsystem in order to facilitate program preparation and debugging in the time sharing environment.
Abstract: MANTIS is a natural debugging facility for the FORTRAN language subsystem on the PDP-10. It was designed and implemented in an existing language subsystem in order to facilitate program preparation and debugging in the time sharing environment available on the PDP-10.
Suitable debugging facilities should be included in the initial design of language subsystems. Language subsystems to run in time sharing operating systems should offer debugging facilities that exploit the interactive environment available to the user. This paper describes experience gained in designing and adding a useful interactive debugger to an existing FORTRAN subsystem. Objectives, implementation experience and system features are discussed and are related to the general problem of designing debuggers for language subsystems. © 1973 Wiley Periodicals, Inc.
01 Jul 1973-Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences
TL;DR: Thi s pape r describes a n app lication of tes ting methodology a nd te c hniques de ve loped by th e a uthors to a id in impro vi ng the qu a lity of mathem ati ca l soft wa re as pects from techni q ues pre vious ly used.
Abstract: Thi s pape r describes a n app lication of tes ting methodology a nd te c hniques de ve loped by th e a uthors to a id in impro vi ng the qu a lity of mathem ati ca l soft wa re. These techni q ues diffe r rad ica ll y in se vera l as pects from techni q ues pre vious ly used . the most import a nt d iffere nce be ing th at th e testin g is not based e xc lus ivel y Oil random a rgume nt s. Ins tead , throughou t the range of eac h fun c tio n use is ma de of s pec ia l a rgum e nt s that a re des ig ned to d etec t progra mming e rrors and to tes t the pe rfnrm a nce of an algorithm in diffe re nt regions. T he fu nction values a re tes ted aga ins t refe re nce valu es whic h are s tored o n re fe re nce tapes ge ne ra ted b y a hi ghl y au the nti ca ted s yste m of s ubro utin es. S ince the eff ec tive ness of s uch a tes tin g sys te m in di scove ring e rrors and pe rform a nce limit ati ons can be fu ll y ascert a ined o nl y th rough ac tu a l use , we report the res ult s of e m ploying our s ys tem to tes t an exi stin g FORTRAN library of ma the matica l fun c tion routines. S pec if, c a s pects of the num e ri ca l accurac y of the libJ·a ry used in thi s te st case are di sc ussed in orde r to ill :~5tra t e the e ffec ti ve ness of a we ll -d es igned tes ting s yste m as a n ana lyti c tool for the e valuation of mathe matica l so ft wa re. S ince docum e nt ati on prov ides information necessary to perform testing and cont ain s s pecifications th at re flect the result s of testin g, our stud y inc ludes com me nts on th e doc ume nt at ion. No information on timing or storage re quire me nts is present ed in thi s case s tud y.
CERN1
TL;DR: A significant gain in performance is observed relative to the theoretical case of random keys, which reinforces the case for hash coding for symbol table construction in FORTRAN compilers.
Abstract: Statistical data is presented on the distribution of FORTRAN identifiers as a function of length and initial character. The performance of two hash coding algorithms is tested with random probing on a pool of actual FORTRAN identifiers. A significant gain in performance is observed relative to the theoretical case of random keys, which reinforces the case for hash coding for symbol table construction in FORTRAN compilers.
TL;DR: A computer program for the analysis of nullor circuits is presented, and requires the formation of the incidence matrix for the corresponding passive network in FORTRAN IV.
Abstract: A computer program for the analysis of nullor circuits is presented. The method follows the approach of Davies, and requires the formation of the incidence matrix for the corresponding passive network. Output is available in graphical form or printed form. The program is in FORTRAN IV, and is suitable for interactive use.
TL;DR: In this paper, a FORTRAN sequence for solving a particular case of the bounded variables problem is presented, which uses considerably less storage than a standard simplex approach, and produces the collapse mode as a byproduct of the calculation.
Abstract: This note presents a FORTRAN sequence for solving a particular case of the ‘bounded variables’ problem.1 It is this problem, rather than the standard linear programming problem, which appears when systematic matrix methods are applied to the rigid-plastic collapse analysis of a plane frame or truss The method uses considerably less storage than a standard simplex approach, and produces the collapse mode as a by-product of the calculation. The sequence is part of a complete program for the plastic collapse analysis of frameworks, details of which may be obtained from the author.
01 Aug 1973
TL;DR: GAKIN II is a revision of the existing code GAKIN, which solves the time dependent multigroup neutron diffusion equations in one space dimension using the usual finite difference approximation.
Abstract: GAKIN II is a time dependent neutron diffusion code. It solves the time dependent multigroup neutron diffusion equations in one space dimension using the usual finite difference approximation. Time integration is accomplished using an exponential transformation and semi-implicit differencing. GAKIN II is a revision of the existing code GAKIN. The temporal treatment has been improved, a simplified and more implicit algorithm has been used, and the coding has been improved and simplified.