C20 8090_Catalog_of_Programs_for_IBM_Data_Processing_Systems_KWIC__Apr62 8090 Catalog Of Programs For IBM Data Processing Systems KWIC Apr62

C20-8090_Catalog_of_Programs_for_IBM_Data_Processing_Systems_KWIC__Apr62 C20-8090_Catalog_of_Programs_for_IBM_Data_Processing_Systems_KWIC__Apr62

User Manual: C20-8090_Catalog_of_Programs_for_IBM_Data_Processing_Systems_KWIC__Apr62

Open the PDF directly: View PDF .
Page Count: 319

Download
Open PDF In Browser	View PDF

Reference Manual
Catalog of Programs for IBM Data Prucessing Systems
KWIC Index
April 1962

No.1

CONTENTS
Introduction • • • • • • • • •

1

Keyword-in-Context (KWIC) Index

5

Program Abstracts, Section "A"
RAMACI!J)305 Data Processing System

35

650 Data Processing System

37

704 Data Processing System

41

705 Data Processing System

43

709 Data Processing System

47

1401 Data Processing System

49

1410 Data Processing System

55

1620 Data Processing System

. ... . . .

59

1710 Data Processing System

63

7070 Data Processing System

65

7080 Data Processing System

69

7090 Data Processing System

71

Program Abstracts, Section "B"
RAMAC 305 Data Processing System

73

650 Data Processing System

75

704 Data Processing System

• 179

705 Data Processing System

• 229

709 Data Processing System

• • 245

1401 Data Processing System

• 253

1620 Data Processing System

• 265

7070 Data Processing System

• • • 287

7090 Data Processing System

• • 307

INTRODUCTION
This catalog has been published as a service to computer users. It contains a keyword-in-context index and the abstracts of the computer programs
which may be ordered from the IBM Program Information Department,
formerly known as IBM Library Services.
This department distributes four types of programs. The" A" section of
the catalog contains Type I and IT programs which are written, tested,
published and maintained by IBM. The "B" section consists of Type ITI
and IV programs. In the case of the Type III and IV programs, the Program
Information Department acts only as a publishing and distributing agency.
Checking and testing of these programs is done by the contributors, and
questions concerning them should be directed to the author.

How to Order Programs
"A" Section
From local IBM branch office
"B" Section
Order programs directly from:
Program Information Department
IBM Corporation
"<....... 2 William Stre.et.-".. 1 {;;Z /::: ~
White Plains, New York - USA

f'

'7/

~

J< () L~ c(J

World Trade Users order programs from the WTC Program
Library in their Area if this Library services their computer.
otherwise programs may be ordered from the United States
Program Information Department.
IBM World Trade Program Libraries:
Area

Librarian

Computers

Europe

Central European Program Library
162 Rue de Charenton
Paris 12, France

1401

650
H. C. Koehler
IBM Deutschland
Postfach 66
Sindelfingen/Wuertt, Germany
A. H. Lugtenburg
IBM Deutschland
Postfach 66
Sindelfingen/Wuertt, Germany
Canada

1

K.C. Avann
IBM Company, Limited
844 Don Mills Road
Don Mills, Ontario, Canada

1410

1620

7070

650 1401

1410 1620 7070

South America and
Central America

A. Mogollon
IBM de Venezuela, S.A.
Edificio International
A venida Urdaneta
Apartado 388
Caracas, Venezuela

650 1401

1620

North Pacific

M. Hamaguchi
IBM Japan, Ltd.
2 Niban-cho
Chiyoda-ku
Tokyo, Japan

650 1401

1410 1620 7070

Asia Pacific

P.A. Gygax
IBM Australia Pty., Limited
Box 3318
Sydney, Australia

650 1401

1620

(All orders should include the IBM system and reference numbers shown
on the abstract. )
The catalog contains three main parts:
Keyword-in-context (KWIC) Index for locating program abstracts
Program abstracts, Section "A" (by system type)
Program abstracts, Section "B" (by system type)

Keyword Index
The keyword-in-context index lists available programs arranged alphabetically by the keywords in the program titles. There are as many
entries for each program as there are keywords in its title. Nonsignificant
words such as "a," "the," "and," "for," "at," etc. (see complete list
below) are not treated as keywords.
To prepare this KWIC index, each title was shifted to the right, one keyword at a time. After this was done, the multiple entries for each title
were sorted in alphabetic order by keyword and listed on the IBM 1403
Printer to produce the master copy.
The first three entries for the program are shown below:

#CARD SYSTEMS ERROR DETECTION AIDS
IDS

A llJ.Ol--AT-017

#CARD SYSTEMS ERROR DETECTION A A llJ.Ol--AT-017
#CARD SYSTEMS ERROR DETECTION AIDS

A llJ.Ol--AT-O 17

Notice that the keyword for each entry is located near the center of the
column and that some or all of the title ml.Y precede or follow - that is,
wrap around - the keyword. The pound sign (#) indicates the first word
in each title. Each line is concluded with a reference code which relates
the entry to the corresponding program abstract in the abstract section
of the catalog.
2

Using the KWIC Index
To locate a program, begin by thinking of the significant words describing
the desired program. Then look in the index for the keyword entry. The
reference code adjacent to the title will then direct you to the corresponding
program abstract. The reference code is set up as follows:
Section

x

System Type

xxxx

A or B

The number of the
IBM system for which
the program is written

Reference Number

xxxxxxxxx
The IBM library code
for filing and ordering
a program.

To locate the required abstract, first turn to the "A" or "B" section.
Then find the corresponding system type, then the reference number.
The reference numbers are in numerical sequence within system. The
"A" or "B" designation and the machine type are printed on the top righthand corner of the page to facilitate finding. the abstract. The abstracts
describe the programs in enough detail to help you determine whether
they meet your requirements.

Words Prevented from Indexing
These words will never appear as keywords
A
ADD
ADDS
AN
AND
ANY
AS
AT
ARITH.
BY
DECK
FOR
FROM
GENERAL
GENERATOR
IBM
IF
IN
INTO
KIND

3

MODIFIED
NO
NO.
NUMBER
OF
ON
ONLY
OR
OUT
PACKAGE
POINT
PROBLEM
PROG
PROGRAM
PROGRAMS
PT
PT.
ROUTINE
ROUTINES
SOLUTION

SUBPROGRAM
SUBR
SUBROU
SUBROUT
SYS
THE
TO
USING
WITH
I
II
III

V
VI

Keyword-in-Context (KWIC) Index

OED.

nOIf ARCTAN AlB
IAReTAN AlB,

B 010lt-OS9BWH005
FORTRAN 11 VERSION. SAP CO B OlDlt-0603WHOOS

.MATRIX TRANSLATION A/O TRANSPOSITION
UD AND LOD
NG POINT HARDWARE SIMULATOR.
lAB FLOAT SIH-ABREVIATED FlOATt
UTlNE
,ABBREVIATED PRINT 1 TRACING RO
NAL PROGRAM NUCLEAR-CODE
• LIL ABNER A FEW-GROUP ONE DIHENSI0
[NG
IABRAe-Ol NUCLEAR-CODE ENGINEER
'ON-LINE LOADER FOR COL. BtN. Aas. AND TSf. CARDS
OADER
IABSOLUTE AND CORRECTION CARD l
ER CARD LOADER.
IABSOlUTE AND CORRECTION TRANSF
LOADER.
JAB50LUTE AND RELOCATABLE OCTAL
ATE A FORTRAN II PROGRAM TAPE OR ABSOLUTE BINARY
.GENER
CTION CARD LOADER
'ABSOLUTE BINARY CARD AND CDRRE
CTION CARD LOADER.
MABSOLUTE BINARY CARD AND CDRRE
lAB SOLUTE BINARY LOADER
lONE CARD ABSOLUTE BINARY UPPER lOADER.
NE CARD
IABSOLUTE BINARY UPPER LOADER 0
IPUNCH ABSOLUTE COLUMN BINARY.
ILElST HAXIMAL ABSOLUTE ERROR POLYNOMIAL FIT
tARO PUNCH
JA8S0LUTE RO~ OR COLUMN BINARY
FER
JLOADS BINARY A8S0LUTE, CORRECTION AND TRANS
JA8S0RBER CALCULATION
UNTERPRETATION to!ATRIX ABSTRACTION
'FLOATING POINT DOUBLE PRECISION ABSTRACTION
LOATING POINT COMPLEX ARITHMETIC A8STRACTION
IF
'GENERAL MATRIX ABSTRACTION FROM TAPES
AM TO J4AINTAIN THE SHARE LIBRARY ABSTRACTS
IA 1401 PROGR
RP SYS 650 MAG DRUM CALC W/IMMED ACCESS 8ELL 111
fl.FL DEt INTE
'DYNAMIC ACCESS TO MEMORY PROGRAM
•
CONVERTS aCD TAPE RECORDS ACCORDING TO A FORTRAN
ON WITH ITERATIVE IMPROVEMENT OF ACCURACY
,MATRIX INVERSI
U HORE ACCURATE RUNGE-KUTTA
UE
IACT-AUTOHATlC CHECKOUT TECHNIQ
IAL EQUATIONS
UDMINT ADAMS INTEGRATION OF DIFFERENT
EGRATION
'FLOATING POINT ADAMS-HOULTON, RUNGE-KUTTA INT
AT 1 • COMPLETE ASSEMBLY ROUTINE ADAPTED TO TAPE.
ICAR
T I l - tOHPLETE ASSEMBLY ROUTINE AQAPTED TO TAPE.
'CAR A
'5CO ADD-SUBTRACT
'MATRIX ADDITION
FLOATlNG POINT DOUBLE PRECISION ADDITION
IIMURA
DOUlILE PRECISION FLOATING POINT ACOlTION
'PARTIAL
'DOUBLE PRECISION FLOATING POINT ADDlTlON
'HURA DOUBLE PRECISION ADDITION IFIXED POINT!
,DOUBLE PRECISION MATRIX ADDITION AND SU8TRACTION.
'ACDITION TO BASIC FORTRAN
n012 UTILITIES FOR AODITIONAL STORAGE
.CHAIN LOADING ADDITIONS & DELETIONS
'OPEN SUBROUTINE ADDITIONS TO FORTRAN EDIT DECK
n05 ADDRESS LISTING
j!105 ADDRESS LISTING
MADDRE:.SS LOCATION SUBROUTINE.
,unDRESS MODIFICATION
."'URA EffECTIVE ADDRESS SEARCH ROUTINE
tTRANSPORTATlON PROBLEM-INDIRECT ADDRESSING
IS OF VARIANCE OR COVARIANCE AND ADJUST MEANS PROGRAM
UNALYS
'PROGRAM TO CALCULATE SEASONALLY ADJUSTE:D INDICES
nRAVERSE ADJUSTMENT
'.TlME SERIES DECOHPO~ITION AND ADJUSTMENT
'liKE SERIES DECOMPOSITION AND ADJUSTMENT
fnlHE SERIES DECOMPOSITION AND ADJUSTMENT
.REYISED TRAVERSE ANO TRAVERSE ADJUSTMENT COMPUTATION
RIes
'SEASONAL ADJUSTMENT OF EtONOMIC TIME SE:.
.CALCULATION OF SEASONAL ADJUSTMENTS
FFERENTlAL EQUATIONS
IAOHINT ADAMS INTEGRATION OF 01
SYSTEM.
IASC SYSTEM AERONUTRONIC SIMPLiFIEO CODING
ONS
fl.AETRA NUCLEAR-CODE CROSS-SECTI
.F/F AFP SUBROUTINE -CARD.
IF/F AFP SUBROUTINE _TAPE.
'IfS • AFTER SETTING _ XX
JAGAIN
'CARD SYSTEMS ERROR DETECTION AIDS
SION ONE-DIMENSIONAL
,AIH-6 NUCLEAR-CODE GROUP DIFfU
NG
IIAIHFlRE NUCLEAR-CODE ENGINEERI
• UIREK-l1 NUCLEAR-CODE
UAL INTERVALS
IlAITKENS INTERPOLATION FOR N Ea
MBOOLEAN ALGEBRA MINIMIZER
IGENERALIZED ALGEBRAIC TRANSLATOR. GAT.
- 1 weRD. OPEN.
.SORT. ALGEBRAIC. KEY AND lYEM LENGTH
- 1 WORO. CLOSED.
"SORT, ALGEBRAIC. KEY AND ITEM LENGTH
OLE WORD KEYS ONLYI
'SORT, ALGEBRAIC. MULTIWORO KEYS. IWH
'REVISED TRAVERSE AND HORIZONTAL ALlGN~ENT
PR REVISION OF ORoEGON HORIZONTAL ALIGNMENT PROGRAM
NO
TERRAIN HODEL SYSTEM HORILONTAL ALlGN~ENT PROGRAMS
ilOIGITAL
AL TERRAIN MODEL SYSTE~ VERTItAL ALlGN~ENT PROGRAMS
/lOIGIT
J SUB K TtfolES l OR I
ULL ORDERS OF BESSEL FUNCTION
IONS Y SUB K TIMES Z
IALL ORDERS OF THE BESSEL FUNCT
MUNLOAD ALL TAPES
ANGENT, FLOATING POINT--QUAORANT ALLOCATION
HARCT
RCOSINE FLOATING PQINT-QUADRANT ALLOCATION
NARCSINE, A
OUlINE IDENTIFICATION AND "'EMORY ALLOCATION
N BINARY SUBR
AY
/I GENERAL ALPHANUMERIC CATHODE RAY UISPL
CONVERSION.
tlALPHANUMERICAL READING AND BCD
CONVERSION
HALPHANUHERltAL READING AND aCD
URAtE INSTRI,;CTlON ALTERATION
URACE INSTRUCTION ALTERATION FOR 109
tlTRACE AND RECORD ALTERATIONS IN MEMORY PROGRAM
NAL TEREO Mt:.MORY PRINT
"GENERAL AMORTIZATION SCHEDULE PROGRAM
Y PROGS FOR INDERTERMINATE TRUSS ANAL
""CONNECTOR AND REOUNDANC
E FOR NON-ORTH/O & STAT. DESIGN RANALY OF VARIANCE OR COVARIANC
jj!ANAL YSER
'HEM PRINT ANALYSER
/lTRUSS ANALYSIS
,MULTIPLE REGRESSION ANALYSIS
IIMULTIPLE REGRESSION ANALVSIS
HAC TOR ANALVSIS
NGENERAL LEAST SC;;UARES ANALVSIS
HE WHER"'Y-Wtr~ER METHOD OF FACTOR ANALYSIS
IT
,MULTlPLC REGR[SSION ANALVSIS
NCONTINUOUS CRIOGE ANALYSIS
/lSPE[D CHECK ANALYSIS
ELECTRICAL OISTRIBUTION SYSTEMS ANALYSIS
HOVERHEAD
'SLOPE STABILITY ANALYSIS
"PIPE STRHS ANALYStS
NSUSPENSION BRIDGE ANALYSIS
/l.C IRCULAR tULVERT ANALYS IS
I#HyoRAUl Ie NETWORK ANAL YS IS
.BACKWATER CURVE ANALYSIS
flGAS FLO ... ANALYSIS

B 0650-01.6.031
B 0650-01.2.008
B
B
B
B
B
B
6
B

8
B
B
B
B
B
B

B
B
B
B
B
B
B
B
B
a
B
B
B
a
B
B

B
0
a
B
B
B
B
B
B
B
B
A
A
B
B
5
B
B
a
A
D
B
B
B
B
B
B
B
B
B
B
B
A

A
B
6
A
8
B
0
8
[)
B
B
B
0
B
B
B
B
1\
B
B
B
B
B
H
D
B
B
B
B
B
B
B
B
n
B
B
B
B
B
B
13
n
B
B
8
B
B
B
B
B
[,
B

1010-05.2.001
0105-AO-002-0
0650-08.2.007
Q1QIt-NUCLEAR
0704-10120RCBL
Q1Q4-0512PFCCB
0104-067)WH005
0704-0623ELROl
0704-0154CEF2L
0104-0525PKCS8
0704-05250PKCSB
0104-0405PFCCB
0104-0413CSBUL
0109-1102SE90U
010lt-1004GNPAC
0704-0500BSBFP
0104-04556ESC6
0104-0449MIOSI
0650-09.6.004
0104-0085CLHTX
0104-0110GLDPA
0104-0715RWCA2
0104-0361HBMTX
0104-1l65PNSlI
0650-02.0.021
0704-0395LL002
0104-0495CVI02
0650-05.2 .. 022
0104-041-4GLMAR
1401-13.1.004
lD90-1l31AS012
0104-0450RWDE2
1401-01.1.003
1401-01.1.004
0104-0359ELSMO
0104-00S5CLMAO
0104-02BOMUOPA
0104-0650RWADD
0104-0650RWDPF
0104-0256MUOPA
0104-0144AHOPA
1010-01.2.001
1072--UT-085
0650--UT-104
0704-1081LROSR
0705-AO-005-0
0705-NW-OOI-0
0709-1l20ATLOC
0105-BW-1l01-1
0704-0253HUEAS
1620--LM-017
0650-06.0.034
0650-06.0.042
0650-09.2.083
0704-0861ERTSD
0104-0526TVTSO
7090-1l45ERTSU
0650-0?2.015
0650-06.0.041
0105-0P 0001
1090-1131ASOI2
1401-02.0.002
7090-NUCLEAR
1620--LM-022
1620--LM-023
010'J-PG-005-0
0105-SR-004-0
1401--AT-017
10?0-NUCLEAR
1090-NUCLEAR
7090-NUCLEAR
0104-0122PKANI
1090-U91LlBAM
06~0-02.1.007

0704-05100RSRT
0704-0S700RSRT
0104-05100RSRT
06-;0-09.2.084
0650-09.2.053
0650-09.2.040
0650-09.2.041
0109-0984RWBF1
0709-0985RWBF8
10'JO-1175WOSTO
0104-0825JPATN
0704-0825JPASN
0104-0739ARPEK
0104-0314MUSCP
0104-0405PFDC8
0704-0411PFDCB
0704-1019NOTIA
0709-1090NOTIA
0104-0395LL003
0705-EQ-005-0
0709-0955VGGAS
0650-09.2.001
0650-06.0.0';9
070';-56-002-0
0105-SB-006-0
0650-09.2.006
0650-06.0.046
06')0-06.0.001
OGSO-06.0.020
0650-06.0.027
OG50-06.0.028
0650-06.0.031
06-;0-09.2.066
06~0-09.2 .. 023
0650-09.4.008
0650-09.2.026
0650-09.5.002
0650-09.2.034
06-;0-0').2.059
0650-09.1.002
06'>0-09.1.004
0650-09.7.006

'RENT OR BUY ANALYSIS
O-CORRELATION ANO POWER SPECTRUM ANALYSIS
iAUT
PLE CORRELATIONS AND REGRESSIONS ANALYSIS
.MULTI
IAUTORECRESSION ANALYSIS
IAUTOREGRESSION ANALYSIS
LTIPLE REGRESSION, COMPREHENSIVE ANALYSIS
.HU
#FACTOR ANALYSIS
"CRITICAL PATH ANALYSIS
1#]010 - PRINCIPAL A~IS fACTOR ANALYSIS
OINARY DIffERENTIAL W/AUTO ERROR ANALYSIS
flNUM SOLU OF OR
TEM
•• ZEUS PROGRAM ANALYS IS • • ZPA • COMPUTE.R SYS
IISHORT CIRCUIT ANALYSIS. CARD.
JlGAS NETWORK ANALYSIS. CARD.
IIGAS NETWORK ANALYSIS. TAPE.
ITRENO ANALYSIS AND PREDICTION
IPULATION
"FlOW CHART ANALYSIS BY BOOLEAN MATRIX MAN
.MULTIPLE CORRELATION®RESSION ANALYSIS BY STEPWISE "ETHOD
o
IIFAtTOR ANALYSIS BY THE CENTROID MEJHO
'REGRESSION ANALYSIS DATA PREPARATION
HUB. CARD.
IS-I09 STRESS ANALYSIS OF A FLANGED TAPERED
NO FRAMES
IICOMPUTER ANALYSts OF CONTINUOUS BEAMS A
• SUBCLASS NUMBERS
NANAL YS I S OF COVAR lANCE 0 I SPROP
RED HU8 • CARD.
IS-l00 STRESS ANALYSIS OF FLANGE WITH A TAPE
ILES
"ANALYSIS OF LATERALLY LOADED P
S
flSTRESS ANALYSIS OF OPEN-wE8 STRUCTURE
ECOROS
MWAVE RECORO ANALYSIS OF HlO SIMULTANEOUS R
L DESIGNS
118M 650 PROGRAM FOR ANALYSIS OF TWO-LEVt;L FACTORIA
OR THE IBM 650
UN ANALYSIS OF VARIANCE PROGRAM F
'FOUR WAY ANALYSIS OF VARIANCE
SUBCLASS NUMBERS
'ANALYSIS OF VAR!ANtE,DISPROP.
OR SING. REPLICATEO KBY
iANAlYSIS OF VARIANCE FOR PART.
IIANALYSIS OF VARIANCE PROGRAM
ANCE AND AOJUST MEANS PROGRAM
IIANALYSIS OF VARIANCE OR COVARt
"GENERAL ANALYSIS OF VARIANCE
IIANALYSIS OF VARIANCr:.
IlGENERAL ANALYSIS OF VARIANCE

#~~~:::~ :~:t~~~~ ~~ ~::::~~~

ILATIN
.LATIN SQUARES ANALYSIS OF VARIANCE
.GENERAL PURPOSE ANALYSIS OF VARIANtE PROGRAH
NANALYSIS Of VARIANCE
ANCE
NANALYSIS OF VARIANCE OR tOVARI
PWISE JjT CARD INPUT
RCORRELA'TION MATRIX, CORR2 - FOR CARD INPUT
N7070 INTE
R PROGRAMMING CODE FOR 1620 WITH CARD INPUT&OUTPUT
HLINEA
f.lTRACE PROGRAM FOR CARD INPUT/OUTPUT
#CHANGE CARD LOAD
ilCHANGE CARD LOAD
NABSOlUTE AND CORRECrrON CARD LOADER
OLUTE BINARY CitRO AND CORRECTION CARD LOADER
/JABS
FOUR CARD ROW BINARY-OCTAL UPPER CARD LOADER
#109
NROW BINARY CARD lOADER
*CORRECTION CARO lOADER
*OCTAl COLUMN BINARY CARD LOADER !THREE CARDS/.
NGENERAL CARD LOADER SU8ROUT INE GROUP
tI
OlUTE 81NARY CARD AND CORRECTION CARD- LOADI:R.
/lABS 8
ABSOLUTE ANO CORRECrrON TRANSFER CA~D LOADER.
H B
HONE CARD lOftER LOAD
H
N BINARYI LOADER.
NFORTRAN CARD OR TAPE /~OW AND/OR COlU .... B
IIBINARY OCTAL CARD DR TAPE LOADER
6
ItSH'ULATION OF CMD OR TAPE 650 ON THE 7070
B
"1401 TAPE TO CARD PROGRAt-:
NABSCLUTE ROw OR COLUMN BINARY CARD PUNCH
NVARIABlE FIXED fORMAT CARD REftD
/,ION-LINE BCD CARD READ ROUTINE
RDCTAL CORRECTION CARD READER
NOCTAl CORRECTION CARD READER
NREAD BCD TAPE OR ON-LINE CARD READER
AM •
IISCRAP • SIXTEEN-hENrY CARD REGRESSION ANALYSIS PROGR
AND AUTOCODER ASSE.~BlY
NCARD REPORT PROGRAM GE:N£RAfOR
B
G PROGRAr-' FOR THE IBM 1401
IICARD REPRODUCING ANO/OR LISTIN B
RO LOACER
/1.709 FOUR CARD ROW BINARY-OCTAL UPPER CA B
IIFORTRAN END CARD SEARCH.
B
IDS
NCARO SYSTEMS ERROR DETECTION A A
IICARD SYSTEMS SUDROUTINES
A
If CARD SYSTEMS UTILITY PROGRAIJS
A
NONE CARD TAPE COpy ROUTINE
B
IIARGONNE CARD TO BINARY TAPF LOADER
8
RHOLLI:RITH CARD TO TAPE
0
INTER
IISIMULTA~EOUS CARD TO TAPE AND lOR TAPE TO PR D
G ROUTINE
HCARD TO TAPt: COWERSION-EOITIN 0
HCARO TO TAPE LOAD
#1401 CARD TO TAPE PROGRAM
HCARO TO TAPE ROUTINE
TO COlU~N CONVERTER.
NCARD TO TAPE SIMULATOR AND RQIoI
HCARD TO TAP[ SIMULATOR.
HCARO TO TAPE UTILITY PROGRA~
MO 80/84 SIMULATION OF Tt-IE 714 CARD TO TAPE.
fln/B4
/,ICARC TO TAPE, BINARY
B
#ONE CARD UPPER lOAD
B
IISIX tARO UPPER lOAllER
B
#TAPE TO CARD UTiliTY flROGRAr~
A
IIPER I PHERAl CARD VER IF IER
B
IlLIN(AR PROGRA"'MING COOl: FOI( CARD 1620
B
70
nSIMULATn~G THE CARO 650 ON A TAPE ORIENTED 705
NBUFFERED CARD-INPUT SUBROUTINE
B
R R~LOC"'TA!!U BINARY LOADER lONE CAROl
II-MUPA UPPE e
II,",URA lOIo
0650-0S.1.008
0650-09.2.080
0704-NUCLEAR
06S0--UT-I04
0650-01.0.017
06S0-01.0.018
070S-AF-00l-1
0705-AF-001-1
7090-1095WHISD
0704-0425WBTTC
7090-1123WPS02
0650-02.1.002
0650-09.6.015
0704-0148NYCRV
0705-SP-00I-0
0709-0824LlFLC
0705-IB 0003
0650-09.2.016
0704-10001BCTR
0650-09.2.044
0705-EO-007-0
0650-09.2.023
0704-0911NURTB
0704-0801NOGWC
0705-SR-00I-0
7070-03.4.004
0705-PG-004-0
0704-0248CLOUD
0704-0282PKCKR
0705-EQ-OOI-0
0709-0482GASPO
0104-078BIBRFS
1401-13.1.004
0704-040SPFSML
0109-056)SE9Bl
0650-06.0.016
0650-06.0.015
1620-11.0.003
1620-11.0.001
0704-0395LLOOO
0704-08430RClK
0104-0486CMCIS
0704-0869RCOCI
0704-1104PKMIN
1620-09.4.006
1620-09.4.007
0704-Il03PKSEC
06S0-09.4.013
0650-09.4.004
7090-11B2DVCIR
0650-0) .. 2.001
06S0-09.2.0,)9
0705-SR-002-0
0104-0525PKCLA
0704-0525PKCLA
0650-01.6.006
0704-0443ll024
0650-07.0.012
0704-08430RCLK
1620-03.0.002
0704-05700RSRf
1090-NUCLEAR
0650-03.1.020
0650-09 .. 5.006
0650-09.4.011
7070--CB-923
1410--CB-912
0705--PR-131
0704-10S0RSQ~1

10?O-NUCLEAR
0650-08.2.022
l'tOl-0l.4.014
0650-01.6.041
06S0-10.1.010
06S0-10 .. 1.009
1620-10.1.006
0650-08.2.016
0650-10.1.006
0650-06.0.061
1620-10.1.002
0650-08.2.019
7090-NUCLEAR
0709-093DVGREC
0704-0149SCIEM
0650-08.2 .. 009
0109-0938VGWfC
0104-0726SCXPC
0704-0480CEFlP
7090-1206NULtQ
0704-0603wH005
0704-1071NUHM
0704-1220NSA!3C
0650-0B.2.024
0704-NUCLEAR
0650-02.0.011
0650-02.0.005
1401-02.0.002
0704-0848ARPLN
0704-0919MEPYR
0704-0224ASASI
0650-06.0 .. 003
0650-07.0.012
0704-091B~EPYR

0704-0417PFCBN
0650-06.0.052
0650-06.0.055
0650-06.0 .. 002
0650-06.0.033
0104-0250NYFSC
0104-1042JPBIC
0709-0927MAPOL
0650-09.3.001
0704-NUCLEAR
0704-NUCLEAR
0704-10120RCBL
0104-0668HUCBL

IABSOlUTE ROW OR COLUMN BINARY CARD PUNCH
n09 SELF LOADING ROW BINARY TO COLUMN BINARY CONVERTER
1704 ROW BINARY TO COLUMN BINARY CONVERSION.
n04 ROW BINARY TO 109 COLUMN BINARY tONVERSION.
.COLUMN BINARY DISASSEMBLY PROG
RAM
. JINCREMENT COLUMN BINARY IMAGE OF HOLLER I
TH NUMBER
'PUNCH AEISOLUTE COLUMN BINARY.
FORTRAN CARD dR TAPE /ROW AND/OR COLUMN BINARY/ LOADER.
n
ARD TO TAPE SIMULATOR AND ROW TO COLUMN CONVERTER.
IC
BE DISPLAY
.MURA SIX COLUMN FRACTION CATHODE RAY TU
'MURA SIX COLUMN FRACTION PRINT
IMURA VARIABLE COLUMN FRACTION PRINT
IMURA VARIABLE COLUMN FRACTION PRINT
'''~ATRIX INTERCHANGE OF ROWS AND COLUMNS
'NORHALlZE MATRIX BY COLUMNS.
JSELECTOR OF COMBINATIONS OF INPUT DATA.
SERIES.
"COMBINES INDICES IN A FOURIER
TERM.
.COMBINES INlUCES IN A FOURIER
GE FOR SYMBOL MANIPULATION
JCOMIT - GENERAL PURPOSE LAr~GUA
MCOMMENT
ATTAtHED PROGRAM. /109
PROGRAM/.
,0705/70BO COBOL AND COMMERCIAL TRANSLATOR
ARY .SEE 707Q-PR-015.
'COMMERCIAL TRANSLATOR-PRELIMIN
n09/1090 COMMERtJAL TRANSLATOR COMPILER
URANSLATE CA.KD IMAGE TO BCD IN COMMON.
F RECIPROCATING COMP. WITH ELEC. COMP.
JeALC. PERF. CHARACT. 0
ITY WITH DEPTH
,NORMAL MOVEOUT COMP. FOR L1NE:AR INC .. OF VELOC
PERF.· CHARACT. OF RECIPROCATING COMP. WITH ELEC. COMP.
IICALC.
.CROWN LIFE INSURANCE tOMPANY SORTING PROGRAM
.TAPE EDITOR AND OUPLICATOR WITH COMPARE
ITAPE COpy AND COMPARE
,nAPE DUPLICATE AND COMPARE
111401 TAPE DUPLICATION OR COMPARE
ITAPE COMPARE. TPCMP •
MTAPE COMPARE FOR THE 709
nAPE DUPLICATION AND/OR COMPARE.
ALYSIS PROGRAM DA-l
'"PROFILE COMPARISION AND STATISTICAL AN
IIMEMqRV tOHPARISON OUMP
MPLETE BLOtKS
'PAIRED COMPARISONS FROM BALANCED INCO
ET-2-21 •
.COMPLETE PAIRED tOMPARtSONS SCHEDULE. PARtOPL
'DOUBLE PRECISION SIGN COMPATIBILITY
11104/9 COMPATIBILITY
EDITOR FOR PROGRAMMED 104/109/90 COMPATIBILITY
IBI
MFLICOR FLOATING INTERP. COMPATIBLE OPERATION ROUTINE
"AUTOMATIC CODER. COMPATIBLE WITH SAP
MSOS IB~-32K ASSEMBLY AND COMPILER
' .
'SOS SHARE-32K ASSEMBLY AND tOMPILER
IIPAT COMPILER
170911090 COMMERCIAL TRANSLATOR COMPILER
NHRPRET IVE SYSTEM
1104 COMPILER FOR BELL LABORATORY I
.. NTERNAL TRANSLATOR. IT • A COMPILER FOR THE 650
AR
JlMODS OF INTER TRANS. IT • COMPILER· FOR USE OF SPECIAL CH
/11401 PAT COMPILER FOR 1010
#17070 PAT tOMPILER SYSTEM
11010/Zl4 COMPILER SYSTEMS TAPE
IJELl1PTlt INTEGRAL, COMPLETE AND INCOMPLETE.
TED TO TAPE
MCARAT I • tOMPLETE ASSEMBLY· ROUTINE AOAP
TEO TO TAPE.
JCARAT II • COMPLETE ASSEMHlY ROUTINE ADAP
THE FIRST KINO
'COMPLETE ELLIPTIC INTEGRALS OF
JlMURA COMPLETE ELLIPTIC INTEGRALS
HEDULE • PARCOPLET-Z-Zl •
"COMPLETE PAIRED COMPARISONS st
.EIGENVALUE SOLUTION, COMPLEX
'SIMULTANEOUS EQUATIONS COMPLEX
ICOMPlEX AND REAL EIGENVALUES
.. BESSEL FUNCTION OF COMPLEX ARGUMENT AND ORDER.
,
PSI FUNCTION FOR COMPLEX ARGUMI:::NTS
ARITHM OF THE GAMMA FUNCTION FOR COMPLEX ARGUMENTS
nOG
Ll LAB. INTERPRETIVE SYSTEM
ICOMPLEX ARITH OPERATIONS IN DE
OMPLEX 1 • INTERPRETIVE PKGE FOR COMPLEX ARITHMETIC
IC
MPLEX II • INTERPRETIVE PKGE FOR COMPLEX ARITHMETIC
'CO
ERP SYS FOR IBM 650-653 • REAL & COMPLEX ARITHMETIC. #SYMD INT
"FLOATING POINT COMPLEX ARITHMETIC ABSTRACTION
IICOMPLEX ARITHMETIC INTERPRETIV
E ROUTINE
"COMPLEX ARITHMETIC MATRIX INVE
RSION
.OOUBLE PRECISION COMPLEX ARITHMETIC PACKAGE..
.EXTENDED RANGE COMPLEX ARlTHMETIC PACKAGE
'TRIPLE PRECISION COMPLEX ARITHMETIC PACKAGE
IFLOATING POINT COMPLEX ARITHMETICS.
'DOUBLE PRECISION COMPLEX FAD AND FMP
.OOU8LE PREC ISION COMPLEX FAD, FHP. AND FOP
'tOMPlEX FORTRAN FOR .THE 1620'
#PRELIM. EIGENVALUE PR08. OF A COMPLEX HERMITIAN MATRIX.
PROGRAM
'COMPLEX LINEAR SYSTEM SOLUTION
IA GENERAL PROGRAM FOR COMPLEX MATRIX INVERSION
JOETERJI!INANT AND EIGENVECTOR FOR COMPLEX MATRIX.
ItoMPLEX NATURAL LOGARITHM
.COMPLEX NTH ROOT
STEM /FLOATING POINT/
If COMPLEX NUMBER INTERPRETIVE SY
• FOR PERFORMING OPERATIONS WITH COMPLEX NUMBERS
fHNTERP. SYS
'ZEROS OF A COMPLEX POLYNOMIAL
.ZEROS OF A COMPLEX POLYNOMIAL
IIIZEROS OF COMPLEX POLYNOMIALS
J ZEROS OF COMPLEX POLYNOMIALS
'TRIPLE PRECISION COMPLEX SQUARE ROOT
FOR COMPLEX ARITHMETIC
IICOMPlEx 1 • INHRPRETIVE PKGE
FOR COMPLEX· ARITHMETIC
"COMPLEX 11 • INTERPRETIVE PKGE
'INVERSt. REAL OR COMPLEX.
"PRINCIPAL COMPONENTS PRI:DICTION EQUATION
ICOHPOSITE BEAM
,MUL TlPLE REGRESS ION, COMPR[HENS IVE ANALYSI S
NG ON THE IBM 104.
ICOHPREHENSIVE LINEAR PROGRA~MI
IJENTHAlPY AND ENTROPY OF COMPRESSED LIQUID
"SPEC IF IC VOLUME OF COMPRESSED LIQUID
JlEVALUATING COMPRESSOR PERFORMANCE
G FOR 650-653 MAG DRUM CONE STGE COMPU
'MOO BELL TRAN~ PRO
TRAVERSE AND TRAVERSE ADJUSTMENT COMPUTATION
"REVISEO
lOR SWITCHING CIRCUIT
"COMPUTATION OF A MIN Z LEVEL &
EVEl AND-OR SWITCHING
IICoHPUTATJON OF A MINIMUM TWO-L
LEVATIONS
IICOMPUTATION OF BRIDGE SCREED E
IFN ]1 NTH DEGREE LEAST SQU COfF COMPUTATION SUBROUTINE
fFN I I FAtTORIAL COMPUTATION SUBROUTINE
'EIGENVALUE COMPUTATION.
IICORRELATIONAL RESIDUE COMPUTATION.
II-GEODIMETER COMPUTATIONS
ICON TRACT 811l COMPUTATIONS
,,,ArERWAY COMPUTATIONS
IfATE OF RETURN USING THE IBM 650 COMPUTER
'CALCULATIONS OF
S BEAMS AND FRAMES
"COMPUTER ANALYSIS OF CONTINUOU
JlPROCESS CONTROL COMPUTER ASSEMBLY FOR IBM 104
NCDMPUTER AUTOMAH:D MUSIC
NCOMPUTER P"ACKAGE FOR THE RAMAt
305

B 0104-01f55BESCB
B 0109-0808GDRtt
B 0109-0951NA901
B 0109-0951NA901
B 0104-0184GECOS
B 0104-08430RIC8
B 0104-1004GNPAC
B 0109-1163MWRCT
B 0104-10130Rtn
B 0104-0310MUSCP
B 0704-o314MUPRF
B 0104-03S7MUPRF
B 0704-03!)7MUPRF
B 0704-0085oCLMIN
B 0704-0Z36tLMNR
B 0704-0648AVSEL
B 0704-07881BCIF
a 0704-01881BClF
B 0109-119BHICOM
B 0709-0519CSCAP
A 0105--PR-131
A 7010--CT-903
A 1090--CT-92\1
B 0109-0178AEIBC
B 0650-09.6.015
B 0650-09.6.019
B 0650-09.6.015
8 0650-01.5.006
6 0104-0318GMTED
B 0709-0998Rl039
6 0109-0B81PPTUA
B 1401-13.1.001
B 0705-NW-003-1
B 0709-0502RL TC9
B 0709-0717NA098
6 0650-09.2.074
a 0704-0931PKCOM
8 0650-06.0.038
B 0650-06.0.045
n 0104-0417PFCSF
A 0109--CV-065
H 0709-1031RL040
B 0650-02.0.020
n 0104-1220NSA8C
A 0109--PR-063
A 0109--PR-064
B 1010-04.lt.001
A 7090--CT-921
8 0104-0470ELBEL
0 0650-02.1.001
B 0650-02.1.002
IJ 1010-04.4.004
B 7010-04.4.002
A 1010--PR-015
13 0104-0917ALELP
6 1401-01.1.003
B 1401-01 .. 1.004
B o104-}070RMELF
8 0104-066BMUCH
B 0650-06.0.045
H 0704-0248CLP~C
B 0704-0116CLSMI:
8 0650-05.2.005
B 0104-0979NUBES
a 0104-0493lAS85
8 0104-0493LAS86
n 0650-02.0.012
8 0650-01.0.014
8 0650-07.0.015
B 0650-07.0.016
B 0104-01l5RWtA2
B 0650-02.0.003
B 0650-05.1.00;
B 0104-06/.7NPDFC
a 0704-0609CA034
B 0704-0546CAOO5o
B 0104-0417PFSAC
B 0704-0223ClOPC
B 0704-0223Cl1)Pt
8 1620-06.0.008
8 0104-o460MtMAU
B 0704-05Z2PFEL3
B 0704-107';;ANFI0
(\ 0104-0116CLDET
6 0704-0354NA66.
B 0104-03504NA63.
B 0104-0B)2BECPK
8 1620-02.0.003
B 0704-0405PFZPC
B 0704-0225GMZER
B 0650-07.0.006
B 0704-0692JPZPO
B 0104-05650CA005
B 0650-07.0.01l~
8 0650-07.0.015
B 0704-0223CLHIV
B o704-116BTVPCP
[) 0650-09.2.019
B 0104-091STVHRC
B 0104-081BCESCP.
B 7090-1095WHHCL
B 10",0-1095WHVCL
B 0650-09.5.005
B 0650-02.1.011
B 0650-09 .. 2.015
8 0104-110ltPKMIN
B 0104-01B1PKMIN
B 0650-09.2.075
B 0104-0B48ARPLN
B 0704-0848ARTOR
B 0704-0lt05PFMVP
B 0104-0405PFCR2
B 0650-09.Z.065
8 0650-09.2.041
D 1620-09.2.00lt
8 0650-09.6.011
a 0650-09.2 .. 067
R 0704-1184ININI
B 06'50-11.0.007
A 0305--PR-001

• ZEUS PROGRAM ANALYSIS • • ZPA .. COMPUTER SYSTEM
•
.SIMULATE 8ASIC 650 COMPUTER WITH 104.
II TYDAC /PSEUDO COMPUTERI SIMULATOR
POINT 1090 ARCTANGENT SUBROUTINE COMPUTES
,FLOATINGOF THE INDICES.
JlCOMPUTES A SPECIAL FUNCTION F
E OF A FOURIER SERIES.
tlCOMPUTes THE PARTIAL DER-lVATlV
fEASTMAN KODAK CON. EDISON TRANSFER TRACING
i3-SPAN CURVED CONCRETE SLAB BRIDGE PROGRAM
LEC SVS PROG 18
".SELEC ECON. CO~O. SIZE-SPEC CASE NEW ENG E
INFORMATION.
IA CONDENSER ROUTINE FOR SYMBOLlt
IFIVE-PER-CARD CONDENSING ROUTINE
IF IVE-PER-CARD CONDENSING ROUTINE
'UNIVERSAL· MEMORY DUMP AND CONDENSING ROUTINE
LVER
nwo POINT 80UNORV CONDITION DIFFERF.NTIAL [cu. SO
LVINS LAW
/lECONOMIC CONDUCTOR SIlE SELECTION BY KE
IIECONOMIC CONDUtTOR STUDY
TRANS PROG FOR 650-653 MAG DRUM tONE STGE COMPU
IIMDD BELL
M
tlCARP-A CONELATION & REGRE:.SSION PROGRA
FOR INOERTERMINATe TRUSS ANAL
IICONNECTOR AND ItEOUNDANCY PROGS
"THIS SUBROUTINE SAVES THE CONSOLE /AC,MC, IRA, IRB, IRC,
"THIS SUBROUTINE SAVES THE CONSOLE /AC,MCt IRA, IRB, IRC,
RANDOMNESS OF DECIMALS ItIPRINTING CONSTANT OEtlMALS AND TESTING
/lFRAME CONSTANTS
KG .. /NOT A SUBROUTINEI
'CONSTANTS FOR OR MONTE CARLO P
R PRINl1hG--ERTBL
"CONSTRUCT A TABLE OF ERRORS FO
NSTAGE CONSTRUCTION PROGR.AM
'FACTOR. FOURTEEN 0 ONE AUTO CONT TEST OPTIMIZING ROUT.
'SEISMOGRAM SYN FORM CONT. INTERVAL VElOCITY. CVL
'KEY WORO IN CONTEXT
ICHI SQUARE FOR UP TO 10XlO CONTlGENCY TABLE
iCHI SQUARE AND PHI FOR 2X2 CONTINGENCY TABLE
IftUNTlNUEO FRACTION SUBROUTINE
ING ANe INTERPOLATION
"CONTlNUED FRACTIONS CURVE FITT
T REACT INFLU LINE ORDINATE FROM CONTlNUOS GIRO. BRIOGE
IMOfoliEN
"CONTINUOUS BEAM DESIGN PROGRAM
ICOMPUTER ANALYSIS OF CONTINUOUS HEAMS AND FRAMES
NCONTINUOUS BRIDGE ANALYSIS
ATIoN SU8ROUTINE
ICONTINUOUS DERIVATIVE INTERPOL
"tONTOUR CHART OF TRIP DESIRES
"tONTOUR CODE FOR THI:;. IBM 650
'CONTOUR INTERPOLATION
.CONTOUR· PLOT PROGRAM
'CONTOUR PLOT PROGRAM
'CONTRACT BID COMPUTATIONS
IX TO TRIANGULAR FORM.
"ON TRACT SQUARE SYMMETRIC HATR
INPUT PROGRAM UNDER SENSE S"HTCH CONTROL
•
OUTPUT PROGRAM UNDER SENSE LIGHT CONTROL
'DECIMAL
iflNPUT PROGRAM UNDlR SENSE LIGHT CONTROL
/tINPUT· PROGRAM UNDER SENSE LIGHT CONTROL
OUTPUT PROGRAM UNDER SENSE LIGHT CONTROL.
.DECIMAL
IlISCS BO SUPERVISOR CONTROL
11090 10CS INPUT/OUTPUT CONTROL
BROUTINE WHICH DESCRIBES flOW OF tONTROL
NBACK TRACE SU
NPUT/OUTPUT ROUTINE USING FORMAT C.ONTROL
81620 FORTRAN 1
IC FORTRAN. PUNCH WITH CARRIAGE CONTROL.
.8AS
IBP. 104
/lPROCESS CONTROL COMPUTER ASSEMBLY FOR
'PRINT CONTROL FOR REPORT GENERATION
.GENERAL PURPOSE 401 tONTROL PANEL
RD LIST, AND 650 LOAD CARD 11402 CONTROL PANEL FOR SOAP II 8-WO
N
/1650 SOAP CONTROL PANEL WIRING SUGGESTIO
N-REA.O-WRITI: TAPE CONTROL PROGRAM
'SUPERVISORY CONTROL PROGRAM
nAPE ASSIGNMENT ANO CONTROL PROGRAM.
RTRAN
#FORMAl tONTRDL SUBROUTINE FOR CARD FO
nAPE LIBRARY CONTROL SYSTEM
#1ltOI TCS • TAPE CONTROL SYSTEM.
FOURTEEN 0 ONE INPUT-OUTPUT TAPi: CONTROL SYSTEM.
"FITS.
.INTEGRATION WITH CONTROllED ERRO.R
• wITH OPTION BR&TRANSttND. ADD. CONV
"STROBIC-SKELLY TR. ROUT
o FLT PT REPRE
UNT OP 4 CONV OF NO FROM FIX PT REPRE T
.BCD TO BINARY FiElD CONVERSION
ULPHANUMERICAL READING AND BCD tONVERSION
IIRECTANGULAR TO POLAR CONVERSION
IIHOLLERITH TO BCU CONVE~SION
IBCD TO BINARY INTEG!;.R CONVERSION
NEKACT-10 DIGIT CONVERSION
"SYMBOLIC TO AUTOCODER CONVERSION
n09 CARO CONYERS ION
nINARY TC BCS INJE:.RGER CONVERSION
"OEGREES TO RADIUS CONVERSION
#RADIANS TO DEGREES CONVERS ION
.650 TO 1070 TAPE RECORD CONVERSION. XXA15 •
EGERS.
"8CO TO BINAltY CONVERSION OF UNRESTRICTED INT
EGERS.
'BINARV TO 8CD CONVERSION OF UNRESTRICTE:.D INT
'QD SURGE /709-90 CONVERSION OF 704 SURGE.!
PRECISION FLOATING BINARY ~ATRIX tONVERSION PROG
1I0oURLENROD READ ING tONVER S I ON PROGRAM
NDEC IMAL-TO-B INAR Y CONYERS ION PROGRAM
"8CO TO MODIFIED BCD CONVERSlON ROUTINE
.BINARY TO aCD CONVERSION SUBROUTINE
IIBASIC 109 1/0 CONVERSION SUBROUTINES.
,MOOULO 2PI CONVERSION SUBROUTINE
SCUP •
/JAUTOMATtC SOAP CONVERSION UTILITY PROGRAM * A
JlALPHANUMERICAL READING AND BCD CONVERSION.
.DOUBLE P~ECISION INPUT CONVERSION.
,BINARY INTEGER TO ROMAN NUMERAL CONVERSION.
'704 ROW BINARY TO COLUMN BINARY CONVERSION.
ROW BINARY TO 709 tOLUMN 8INARY tONVERSION.
.104
1650 TO 104-709 DATA CARD CONVERS ION.
'CARD TO TAPE CONVERSION-EDITING ROUTINE

T~~~A~~~~~~o-~~t~:~E:~~A~~B~A~g g~~~~:~I~~~ ~~~~I~~XEO

TO FLOA
UED DECIMAL
jfIXER, A SUB. TO CONVERT NO. FROM FLOATING TO F
IU400lFIED ASSEMBLY SYSTEM toNVERTEO TO TAPE. MASCOT.
.ONE-TO-SEVEN CONVERTER
IISEVEN-TO-ONE CONVERTER
IIBINARY TO PACKE:.I) BCD CONVERTER
IILP/90 TO SCROL 104· INPUT CoNVER:'TER
tlFORTRAN TO SQUOlE CONVERTER
DING ROW BINARY TO COLUMN BINAR.Y CONVERTeR
#709 SELF LOA
TAPE SIMULATOR AND ROW TO COLUMN COi.V(:RTER.
UCARD TO
ANONICAt'REPRESENTATION.
NtONVERTS A FOURIER SERIES IN. C
TO BCD FORM.
/lCONVERTS A FOURIER SERIES TER'"
ROING TO A FORTRAN
11 CONVERTS BtO TAPE RECORDS ACCO
NTRAVERSE AND COORDINATE PROGRAM
ROG LAPLACES EQUA IN CYLINDRICAL COORDINATE SYS
#RELAXATION P
'POLAR TO CARH:SIAN COORDINATES
OG LAPLACES EQUAl IN RECTANGULAR COORDINATES
IJRELAXATION PR
OG PoISSoNS EQUAT IN RECTANGULAR COORDINATES
"RELAXATION PR
nAPE COPY AND COMPARE

B 1070-01.9.004
8 0704-0480CE65oO
B 0704-0441CSTYD
0109-1016RWAT3
B 0704-07B81BSPF
B 0704-018BIBPOF
a 0705-EK 000]
8 0650-09.2.060
tl 1620-09.4.004
B 0704-0959MICNO
8 0650-01.6.007
I] 0650-01.6.022
B 0650-01.6.028
13 0104-0238ATTPI
B 1620-09.4 .. 0050
B 0650-09.4.00')
8 0650-02.1.011
B 0650-06.0.06-4
B 06!.0-09.Z.007
B 0104-0345ELSAV
H 0104-0345CLSAV
B 1401-11.0.004
n 0650-09.2.068
B 0704-01430RMOt
B 0104-0391NOERT
B 0650-09.2.070
B 1401-01.lt.007
B 0650-09.6.01B
8 0104-0864PKKW I
B 0650-06.0.015
B 0650-06.0.016
B 0104-0Z2SGMCFR
"8 0704-08S8GS541
8 0650-09.2.057
8 0650-09.2.064
B 0650-09.2."67
B 0650-09.2.1.
B 0104-0760GECLJI
B 0650-0'".2.016
B 0650-06.0.061
B 0650-09.2.OZ5
B 0104-0506MICRl
8 0704-0506MICR2
B 0650-09.2.041
8 0704-0460MICNT
B 0704-0Z06NYlNP
B 0704-0206NYOUT
8 0704-0206NVINP
B 0709-1025WPK06
8 0709-1026WPK07
A 10BO-SV-1l5
A 1090--10-919
n 0704-0901NUBAC
6 1620-01.6.008
6 7010-01.2.002
B o104-11B4ININI
B 0109-103BRWPCR
8 0650-01.6.056
B 0650-12.0.005
B 0650-12.0.006
B 0704-0403MITCR
8 010lt-04B7DAlOO
B 0709-0534CSENK
B 1620-01.6.011
8 1401-02 .. 0.001
B 1401-01.4.006
B 1401-01.4.011
B 0704-123ZAAICE:
B 1620-01.4.004
B 0650-01.6.017
B 0104-0387CE132
B 0104-0411PFDCB
B 0104-035ltNA87.
a 0104-0235NYOBU
e 070lt-105bTVME2
B 0705-EK-OQZ-0
B 0105-EQ-002-0
A 0109--CV-010
B 0109-0991MLCVR
B 1070-08.1.008
8 7070-0B.l.009
B 7070-02 .. 4.001
B 0104-0423BSOCH
B 0704-Q423ESFRE
K C709-1063GEQliU
Ii 0704-0329NYDFt-1
B 0650-09.2.028
B 0704-0768UAoec
~ 0104-05120MCVT
B 0104-0525PKBCD
B 0109-0388GS110
13 7010-08.1.014
B 0650-01.6.04'5
H 0704-0405PFOCB
B o704-05B5CA006
B 0704-08700RRoM
B 0709-0951NA901
B 0709-0951NA901
8 0109-0192AE650
B 0104-0387CE14E

n

:
B
8
a
8
0
B
B
B
B
B
B
B
D
8
8
B
B
B

~~~ci:g~~~~~M7
7070-0B.9.002
1401-01.1.001
0650-01.6.009
0650-01.6.011
0104-0359ELS~0

0704-09)7ERCON
0709-087SRCFHS
0709-0808GDRCC
0704-10130RCTT
0704;-07B8ISWFS
0104-07881BCFT
0704-0495CVI02'
0650-09.2.0Z1
0650-04 .. 0.008
06500-0).1.01'5
0650-04.0.007
0650-04.0.009
0109-0998Rl039

9

NCOPY BCD TAPE ROUTINE
COpy MEMORY ON TO TAPE.
COpy PROGRAM.
COpy ROUTINE
COpy ROUTINE
COpy WITH CHANGES
NCOR IV
TEM
N CORBIE, AUTOMATIC OPERATOR SYS
NREAD TAPE TO CORE
SPOSeD ON ITSELF OR DISPLACED IN CORE
IISQUARE MATRIX TRAN
BINARY CARD I~AGES FROM TAPE TO CORE ANQ DRUMS
nOAD
N RESET AND CLEAR CORE AND N lOC.ICAL DRUMS
NOCTAL MNEMONIC flOATING POINT CORE DUMP
IIWRITE CORE IMAGE ON TAPE
NCORE PRINTOUT ROUTINE-VARIABLE
IIGENERAL LOGICAL CORE SORT SUBROUTINE FOR 32K70
IDUMP STORAGE, CORE, DRUM, AND TAPES
NDUMP STORAGE, CORE, DRUM, AND TAPES
ITHE CORNElL RESEARCH SIMULATOR
NaCO ARlTf1METIC CORRECTION
AP flOATING-POINT TRAP UNDERflOW CORRECTION
#704-S
N II FlOATING-PT .. TRAP UNDERflOW CORRECTION
fl704-FORTRA
#lOADS BINARY ABSOLUTE, CORRECTION AND TRANSFER
NAB SOLUTE B WARY CARD AND CORREC TION CARD LOADER
IlABSOLUTE BINARY CARD ANO CORRECTION CARD LOADER.
IIIABSOLUTE ANI) CORRECTION CARD LOADER
'CORRECTION CARD LOADER
NOCTAl CORRECTION CARD READER
IIOCTAL CORRECTION CARD READER
I ERROR CORRECTION CODE READER
IIIfRROR CORRECTION COOt WRITER
ASUREMENTS
NCORRECTION OF COAL MOISTURE ME
R.
*ABSOLUTE AND CORRECTION TRANSFER CARl) LOADE
/ilTAPE CORRECTOR
f#CHt::CKSUM CORRECTOR
f#8INARY LOADER AND CHECKSL:M CORRECTOR
IFORTRAN SOURCE TAPE CORRECTOR
'NUMERIC TAPE DUPLICATOR AND CORRECTOR
UBINARY TAPE CORRECTOR. NON-SYSTEM VERSION
ARIABLES
NCORRElATING PROGRAM-UP TO 30 V
IIMULTI-VARIABlE CORRELATION
TATED OUTPUT
IICORRELATION ANALYSIS wITH ANNO
T ATEC OUTPUT-PART II
NCORREl AT ION ANAL YS I S wITH ANNO
TATED OUTPUT-PART 3
NCORRElATION ANALYSIS WITH ANNO
NMULTIPLE REGRESSION f. CORRElATION ANALYSIS PROGRAM.
HFORTRAN MULTIPLE CORRElATION ANALYSIS PROGRA~
IIBLOCK CORRELATION AND. COR2
LYSIS,
IICORRElATION AND REGRESSION ANA
NSIMPlE CORRELATION COEFFICIENTS
NCORRElATION COEFFICIENT ROUTIN
fl0X 90 CORRElATION COEFFICIENTS
154X54 CORRElATION COEFFICIENTS
IIMISSING DATA CORRELATION COEFFICIENTS
/lMULTIPLE CORRELATION FOI{ 50 VARIAI3LES
C f. AUGM. 650
IISIMPLE CORRElATION ROUTINE. FOR BASI
5 BY STEPWISE "'ETHOD
'MULTIPLE CQRRELATlONf.REGRESSION ANALYSI
NSIMPLE CORRElATION-CORI
JON.
IICORRELATIONAL RESIDUE COMPUTAT
NAlYSIS
IIMUL TIPLE CORRElATIONS AND REGRESSIONS A
"1070 INTERCORRELATION MATRIX, CORR1
117070 INTERCORRElAT I ON MA TR I X, CORR2 - FOR CARD INPUT
NBlOCK CORRELATION AND. COR2
LOATING POINT E A, 10 A, SINH A, COSH A
/IF
.SINH X AND COSI1 X
HABLE DOUBLE PRECISION SINE AND COSINE
IHNTERPR
#ARC SINE AND ARC COSINE
IIFlOAlING POINT SINE A AND COSINE A
#HYPERBOLIC SINE, COSINE AN() COTANGENT SUBROUTlN
IISINE AND COSINE FUNCTIONS FOR NllS..
INTER SUBROU FOR SINE INTEGRAL f. COSINE INTEGRAL FUNCTIONS
II
NARC SINE - ARC COSINE SUBROUTINE
IISINE AND COSINE SUBROUTINE
NSINE COSINE SUBROUTINE
NSINE AND COSINE SUBROUTINE
IISINE COSINE SUBROUTINE
IISINE AND COSINE, flOATING
"HYPERBOLIC SH.E AND COSINE,FLOATING POINT.
PHASE ONLY LESS F. BACKER .IIlEAST COST EST. &. SCHEDULING-SCHED.
LESS. M. C. FRISHBERG
UlEAST COST EST.tSCHED. PHASE ONLY.
111401 LESS 4K • LEAST COST ESTIMATING AND SCHEDULING
U401 LESS BK,12K,16K • LEAST COST ESTIMATING AND SCHED •
CHEDULH~G PORTION .nESS • LEAST COST ESTIMATING SCHEDULING. S
CHEO PORTIONNLESS .. CARD. LEAST COST ESTIMATING SCHEDULING. S
APE.
N1620 lESS. LEAST COST ESTIMATING&,SCHEOULlNG • T
IDTfoI-lONE COST EVALUATION PROGRAM EA-2
IHANGENT COTANGENT SUBIWUTfNE
'HYPERBOLIC SINE, COSINE AND COTANGENT SUBROUTINE
IIGENERAL CATHODE RAY TUBE COUPlE SUBROUTINE.
#ANALYSIS OF VARIANC.E OR COVARIANCE
OGRAM
#ANALYSIS OF VARIANC£: OR COVARIANCE AN[J ADJUST MEANS PR
UMBERS
NANALYSIS OF COVARIANCE OISPROP. SUOCLASS N
AT. DESIGN flANALY OF VARIANCE OR COVARIANCE FOR NON-ORTH/D f. ST
IIC IRCUlAR AND ElLIPTICAL COVERAGE FUNCTION
INTEGRATION
IIFlOATlNG PT. COWEll 12ND SUM/, 'WNGE-KUllA
NCREATE MASTER PROGRAM TAPE
BROUTINE.
fHAPE CREATING PROGRAM AND LOADER SU
NCRITICAL PATH ANAlyStS
MARY CALCULAT ION
IICRITICAL PATH AND RESOURCE SUM
00
IICRITICAL PATH PROGRAMMING METH
"READS THE SORTED AUTHOR CROSS INDEX TAPE
NFLUIO HOW DISTRIBUTION. HARDY CROSS METHOD
IIVECTOR TRIPLE CROSS PRODUCT
M NUCLEAR-CODE
II LOST A CROSS SECTION AVERAGING PROGRA
ROSS-SPECT DENS
'CALCULATION OF CROSS-CORRElATION FUNCTION &. C
ERATOR.FlOATING
/fAUTO- AND CROSS-CORRelATION FUNCTION GEN
NTEMPEST-I I NUCLEAR-CODE CROSS-SECTIONS
IiFORM NUCLEAR-CODE CROSS-SECTIONS
IITHPEST NUCLEAR-CODE CROSS-SECTIONS
I#AETRA NUCLEAR-CODE CROSS-SECTIONS
NGAM-J NUCLEAR-CODE CROSS-SECTIONS
OF CROSS-CORRELATION FUNCTION {; CROSS-SPEcr OENS
IICALCULATION
ORTING PROGRAM
IICROwN LIFE INSURANCE COMPANY S
I G IT DEC I MAL INTEGER ANO SIGN ON CRT
NWR IfE 6-0
'CRT NUMBER PLOT
IICRYSTAllOGRAPHIC PROGRA~
RAl STRUCTURE FACTOR PROGRAM FOR CRYSTAllOGRAPHY
IIA GENE
NCUBE ROOT
NMURA FIXEO POINT CUBE ROOT
NFLOATING-POINT OOUBLE-PREc.JSION CUBE ROOT
NeU8E ROOT SUBROUTINE
IlNTERRtJPT FORTRAN-LOADING TO
.nAPE
,ONE CARD TAPE
#TAPE
IITAPE TO TAPE

10

B 0709-088%OBCD
B 0709-1164MWFOT
B 0704-0733PFQUP
B 0704-0540SC
B 7070-03.4.001
B 0704-0425WBlTC
B 0650-06.0.025
B 0704-0372BSCRB
B 0704-03B7CEI4H
B 0704-'0661GDF02
B 0704-0395LLOI0
B 0704-0443LL024

B

0709-0633WDO~F

B 0704-083CMIWTP
B 1401-01.4.017
B 0704-10548SSEA
0704-0496CSDS2
D704-0420CSUSI
0650-10.2.00''1
0704-0359ElSMO
B 0704-0705MIFlT
R 0704-0705MIFlT
fl 0704-0449M19SI
B 0704-0525PKCSB
B 0704-0525PKCSB
B 0704-0572PFCCB
B 1401-01.4.001
B 0704-0830MIOCT
B 0704-0830MIOCT
8 0709-0938VGREC
B 0709-0938VGWEC
B 0650-09.4.011
B 0104-0673WH005
B 0704-0508DITPC
B 0704-0405PFSML
B 0709-0563SE9BL
B 1620-01.5.001
A 1620--MI-016
B 0709-1055DIBTC
B 1620-06.0.009
B 0650-06.0.022
8 0650-06.0.014
B 0650-06.0.032
D 0650-06.0 .. 031
B 0104-0749SCRAP
B 0709-U21NRNRH
B 0650-01.6.046
0 0704-0782PFCR3
B 0650-06 .. 0.002
B 0650-06 .. 0 .. 003
B 0650-06 .. 0.031
B 0650-06.0.052
13 06'50-06.0.055
B 0650-06.0.007
a 0650-06.0 .. 062
B 7070-11.3.007
B 0650-06 .. 0 .. 047
B 0704-0405PFCR2
B 0704-0417PFCRI
B 7010-11.3 .. 003
7070-11.3.004
0650-01.6.046
B 0650-03.1.020
B 0650-03.1 .. 009
B 0704-0385BSSf.C
B 0104-0116ClASC
A 0650--LM-004
a 7070-08.1.020
B 0704-08370RSCN
B 0650-03 .. 2.004
B 0704-0246NA135
B 7070-08.1.002
6 1070-08.1 .. 011
B 7070-08.1.015
B 7070-08.1.021
B 0704-0571RhSC5
60104-0417PFCSH
B 0650-10.3.005
B 0"650-10.3.009
B 1401-10.3.001
B 1401-10.3.002
Il 1620-10.3.002
[3 1620-10.3.003
8 1620-10.3.001
B 0650-09.2.086
B 7070-08.1.016
B 7070-08.1.020
B 0704-0439111A029
B 7090-1212MFAQV
B 0650-06.0.034
8 0650-06.0.057
B 0650-06.0.059
B 7090-1182DVCIR
B 0704-0r75Rw[)E6
B 0705-AO-OI0-0
B 0704-0734PFPRO
B 1620-10.3.005
B 7090-11580RCPS
B 0704-1188GMCP
B 0704-1144NC014
B 0650-09.7.007
B 0709-088SVGVPR
B 0650-0B.2.004
[3 0650-06.0.050
B 0704-0577RWAC2
B 1090-NUClEAR
B 7090-NUCLEAR
B 7090-NUCLEAR
B 7090-NUClEAR
~ 7090-NUCLEAR
R 0650-06.0.050
B 0650-01.5.006
B 0704-0362NA 111
B 0704-0458GDNU~
B 7090-1240ERBR1
B 7070-07.5.001
B 0650-03.1 .. 001
B 0704-03I4MUCRT
B 0704-0525PKCBR
D 0704-0931PKC8R

NCUBE ROOT X
IMURA flOATING POINT CUBE ROOT.
NCUBEROOT SUBROUTINE
EXPLICIT SOLUTION OF THE GENERAL CUBIC EQUATION
N
/ilCIRCULAR CULVERT ANALYSIS
ION TwO-DIMENSIONAL
IICURE NUCLEAR-CODE' GROUP DIFFUS
tTRIC POWER SYSTEM SHORT-CIRCUIT CURRENTS
IICALCULATION OF ElE
IIBACKWATER CURVE ANALVSIS
QUALLY FOR UNEQUAllY SPACED Pi
/lCURVE AND SURFACE FITTING ON E
MSPllNE CURVE FIT
NPOLYNOMIAL CURVE FIT
/lORTHOGONAL POLYNOMIAL CURVE FITTER
MLEAST SQUARES RATIONAL FUNCTION CURVE FITTING
IHAYLOR SERIES RATIONAL FUNCTION CURVE FITTING
MPOLVNOMIAL CURVE FITTING. CARD.
IIPOLYNOMIAL CURVE FITTING. TAPE.
NCONTJ NUED FRAC Tl ONS CUR VE F I TT ING AND I NTERPOlA TI 0
IIGENERAL LEAST SQUARE CURVE FITTING ROUTINE
IIGENERAL LEAST SQUARE CURVE FITTING ROUTINE.
IIlEAST SQUARES POLYNOMIAL CURVE FITTING ROUTINE
POLYNO"'IALS
IlLEAST SQUARES CURVE FITTING wITH ORTHOGONAL
RECORD METHOD
IICURVE fITTING- SIMULATED PLANT
#ARBITRARY CURVE PLOTTER SUBROUTINE
IICURVE PLOTTING SUI3ROUTINE
IJSPllNE CURVE READ
NMADSM1 CURVE SMOOTHING ROUTINE
THOGONAL
flEAST SQUARES CURVE-FITTING ROUTINE USING "OR
flEAST SCUARES CURVE-FITTING ROUTINE
IICURVED BRIDGE PROGRAM
OGRAM
113-SPAN CURVED CONCRETE SLAB BRIDGE PR
• INTERPOLATION FOR SURFACES AND CURVES
NMtNIMUM ARC LGTH
IIPROGRAM CURVES.
"
NTHREE CENTER CURVES FOR SHORT RADIUS TURNS
lCULATIONS ON THE 305 RAMAC
'CUT &. Flll-EARTHWORD VOLUME CA
NOHIO CUT AND FIll
IICUT AND FILL
"CUT ANO F I l l . CARD.
IICUT AND F I l l . TAPE.
#CUT AND FILL PROGRAM
N FOR~ CONT. INTERVAL VElOC I TV • C VL •
liSE I SMOGRAM S V
RElAXATION PROG LAP LACES EQUA IN CYLINDRICAL COORDINATE SYS
II
II UNCLE 1 DIFFUSION EQUATION IN CYLINDRICAL GEO NUCLEAR-CODE
NUCLEAR-CODE
IIS4 CYL INORICAL GEOMETRY CEll CODE
o VOLUp.!ES IN FLAT END HORIZONTAL CYLINDRICAL TANKS
,LIQUI
L SVMMETRIC MATRICES ON THE 1620 DIP SVS
NEIGENVAlUES OF REA
REAL SY~MHRIC MATRICES ON 1610 DIP SYSTEM
liE IGENVAlUES OF
AND STATISTICAL ANALYSIS PROGRAM DA-1
,PROFILE COMPARISION
SYS 4 POINT POLY. INTERP. PROG. DA-2 1 'DIGITAL TERRAIN MODEl
SYSTEM PROFILE SMOOTHING PROGRAM OA-3
1I0IGITAl TERRAI~ MODEL
POLVNOI>':IAL INTERPOLATION PROGRAM DA-5
NGENERAl PURPOSE
RLO
/ilDAEDALUS NUCLEAR-CODE MONTE CA
II~OVING AVERAGES OF rIME-SERIES DATA
#ANALYZING SYSTEM FAILURE DATA
GAMMA- DISTRIBUTION TO RAINFAll DATA
RFITTING OF THE
RA. GA~MA DIST-SPEC REF RAINFAll DATA
IIFITTING DATA TO TwO PA
LOCITY FUNCTlON FOR REFRACT. TID DATA
IlLEAST SQ .. DETER. OF VE
NES
"MUSH DATA ASSEMBLER AND PRINT ROUTI
IIP-V-T DATA CALCULATIONS
1650 TO 704-709 DATA CARD CONVERSION.
NEARTHWORK OATA CHECK
NMISSING DATA CORRELATION COEFFICIENTS
TAL TERRAIN MODEL SYSTEM TERRAIN DATA EDIT PROGRAM TD-l
6DIGI
INE FOR TRANS FROM REMING TO IBM DATA EQU.
NSTRIOE. SUBROUT
IPROGRAM AND DATA FILE SYSTEM
o DIFFERENTIATE UNEQUALLY SPACED DATA POINTS
IISMOOTH AN
IISMOOTH AND OIFFERENTIATE DATA POINTS
#REGRESSION ANALYSIS DATA PREPARATION
#DATA PROCESSING OUTPUT ROUTINE
11709 DATA PROCESSING PACKAGE;
IISTRAIN ROSETTE DATA REf}UCrION
#STRAIN GAGE DATA REDUC TION • CARD.
NSTRAIN GAGE DATA REDUCTION * TAPE.
#ATMOSPHERIC DATA SUBROUTINE
ItATMOSPHERIC DATA SUBROUTINE
PEC REF RAINFAll DATA
#FITTING DATA TO n.o PARA. GAMMA DIST-S
HECTOR OF COMBINATIONS OF INPUT DATA.
liS
ftREAV TAPE DATA.
NMANIPULATE aCD-COoED DATA, I~CLUOING 110
/ilOAYS BETWEEN DATES
/ilPROOUCTION DAY CALENDAR
IWAYS ~ETWEEN DATES
KUTTA INTEGRATION OF
NDSL. PREC. flOATING PT. RUNGERUNGE-KUTTA INTEGRATIONNDRL. PREC. FLOATING PT. MILNE,
NOE RElATIVIlE PROGRAM
FORTRAN MONITOR WITH SOURCE LANG DtBUG
#OFFLINE EDIT FOR
NDEBUGGING PROGRAMS
iiOEBUGGING ROUTINE
LC wlI~MED ACCESS BElL III
Nfl DEC INTERP SYS 650 MAG DRUM CA
JlSORT 2, DECENDING
NVERT NO .. FROM FLOATING TO FIXEU DECIMAL
"FlxER, A SUB. TO CO
NVERT NO. FROM FIXED ro FlOATING O[CIMAL
IJFlOATER-A SUB. TO CO
Nr UED AND FlCA TI NG DEC I MAL CARD I NPUT
/lMURA FLOATING DECIMAL DUMP
NRDF3 MURA READ DECIMAL FRACTION
/lMURA READ DlCIMAL FRACTION ROUTINE
FORMAT
NSCHENECTADY, DECIMAL INPUT PROGRAM-VARIABLE'
NFLOATtNG POINT & FIXeD POINT"DECIMAL INPUT.
IIwRITE 6-DIGIT DECIMAL INTEGER AND SIGN ON CR
NMURA READ DECIMAL INTEGER ROUTINE
NMURA REAO DEC IMAL INTEGt:RS ROUTINE
ENSE LIGHT CONTROL
NDEC IMAL OUTPUT PROGRAM UNDER
ENSE LIGHT CONTROL
flDECIMAL OUTPUT PROGRAM UNDER
NERCO FLOATING DECIMA'L POINT SUBROUTINES
LOATING BINARY ARITH.
"DECIMAL PRINT-EXTl::NOEO RANGE F
/lINTERPRETIVE FLOATING DECIMAL ROUTINE
''''URA READ flOATING DECIMAL ROUTINE
IISK[PS "ONE FILE ON A DECIMAL TAPE AND PUNCHES
IIDECIMAL TAPE ~UMP
ROGRAM
IIDECIMAL-TO-BINARY CONVERSION P
#DECIMAL, OCTAL, BCD LOADER
IDEC IMAL, OCTAL, BCD LOADER
/ilDECIMAL, OCTAL, BCD LOADER
NDECIMAl, OCTAL, BC~ LOADER
CI"'ALS AND TESTING RANDOMNESS OF DECIMALS ¥PRINTING CONSTANT DE
5 OF DECIMALS IIP,RINTING CONSTANT DECIMALS AND TESTING RANDOMNES
IMANAGEMENT DECISION MAKING EXERCISE
NO EP.PlOYMENT SCHECULE
NUNEAR DECISION RULE FOR PROUUCTION A
II"'N EDITOR FOR SAP SVMflOllC DECKS.
IIT1ME SERIES DECOMPOSITION AND ADJUSTMENT
;HIME SERIES DECOMPOSITION Af,JD ADJUSTMENT

0650-03.1.029
0704-02BOMUCRT
7070-08.3.005
B 0704-1028GCOOO
B 0650-09.2.059
8 0704-NUCLEAR
B 0650-09.4.007
B 0650-09.7.004
B 0650-06.0.021
B 070"4-0483NA029
8 1620-01.0.004
B 0650-06 .. 0.039
B 0704-0859GS1l6
B 1090-1150RLRAT
0 1620-07.0.002
B 1620-07.0 .. 001
8 0704-0858GS541
B 0704-0115RWGLS
B 0704-0742RWLS3
B 0705-AO-003-0
B 0650-06 .. 0.023
B 1610-09.4.009
B 0704-0284WHWH2
B 0705-AO-004-0
B 0704-0483NA029
B 7090-1241MADSM
B 0704-0636RWCF2
8,0709-0860RWCF
B 0650-09.2 .. 018
0650-09.2.060
a 0704-0483NA029
B 7090-1236IBCUR
B 0650-09.2.020
a 0305-09 ...2.001
B 0650-09.2.030
B 0650-09.2.004
8 1620-09.2.003
B 1620-09.2.002
B 0650-09.2.002
B 0650-09.6.018
B 0650-04.0.008
B 0650-08 .. 2.010
B 1090-NUCLEAR
B 0650-09.7.005
B 1620-05.0.004
B 1620-05.0.'00"3
B 0650-0"9.2.074
B 0650-09.2 .. 062
B 0650-09.2.063
B 0650-09.2.073

a

B 0104-~UCLEAR
IS Q704-0335NYMAI
B 0704-1059WLFAI
8 0650-06.0 .. 029
B 0650-06.0.051
B 0650-09.6.020
B 0704-0523SCMAP
B 0650-09.6.002
B 0709-0792AE650
8 0650-09.2.044
B 0650-06.0.055
E3 0650-09.2.039
[l 1401-01.4.013
B 1401-13.1 .. 005
B 0704-03"]ICLsrm
B 0704-0223CLSMD
1620-01.6.001
0704-0512DMOPO
0709--UT-069
0650-09.5.004
1620-09.6.001
1620-09.6.002
0704-0341AAATM
B 0704-0436AAATM
B 0650-06.0.051
B 0704-0648AVSEl
B 0704-0587NORTD
8 0704-0B79M14BC
B 0650-01.6.021
B 0650-10.3.004
B 0650-01.6.021
B 0704-0610RWD(2
B 0704-0610RWDE3
B 0704-0230RS012
B 7090-1115GPFMS
B 0650-12.0.001
B 0704-0270GIOBU
B 0650-02.0.021
B 0650-01.5.009
1070-08.9.002
7070-08.9.001
0704-03~ 5R SO 14
0704-0321MUFDlJ
0704-0283MURDF
B 0704-0283MUROF
8 0704-0204GSIN2
B 0704-0370RS014
13 0704-0362NA1·11
B 0704-0256MURUI
B 0704-0263MURIlI
B 0704-0206NYOUT
B 0709-1026WPK07
B 0650-02.0.009
B 0704-0370RS013 "
6 0650-01.6.020
B 0704-0283MURFD
B 0704-1144NC014
fj 0704-(J425WBPTU
B 0704-0768UADBC
B 0704-0756RWINP
0 0704-0756RWINP
0704-0073UAonc
7090-1138RWINP
1401-11.0.004
1401-11.0.004
B 7070-12.9.002
B 0650-10.3 .. 001
B 0704-0960MIEOS
B 0704-0861ERTSD
8 0704-0526TVT:)U

NTIME SERIES DECOMPOSITION AND ADJUSTMENT
IIFlOATING POINT DEFINIT[ INTEGRAL EVALUATION
'DEFORT
ION SUBROUT INE
IIFN II NTH DEGREE LEAST SQU COEF COMPUTAT
ECTDRY PROGRAM
/lSlX D(GREE OF FREEDOM DYNAMIC TRAJ
URADIANS TO DEGREES CONVERSION
IIDEGREES TO RADIUS CONVERSION
£I
MSORT DELETE
A
NCHAIN LOADING ADDITIONS & DELETIONS
A
B
IICALENDAR DEMONS TRAil ON
IICHECKER DEMONSTRATION PROGRAM
B
II'HUMAN REACTION TIP.E D[f~ONSTRAT10N ROUTINE
B
#SElF DEMONSTRATOR
B
IH\BC-YIK BASEBALL DEMONSTRATOR" CARD"
B
IIBBC-YIK IlASEBAlL OEMONSTRATOR .. TAPE"
B
MTRANSPOR TA TI ON PROBL EM .. OENN I S· TECHN I CUE ..
li
RRElAlION FUNCTION r. CROSS-SPECT DENS
IICAlC.UlATION Of CROSS-CO B
-CORRELATION FUNCTION & SPECTRAL Ot::NSITY
IICALCULATION OF AUTO B
IHIAXIHUM OENSITY FO GRANULAR MATERIALS
B
JPOwER SPECTRAL DENSIrY FUNCTION, FLOATING
e
/iPOWE:R DENSITY SPECTRUM
fl
FOR LINEAR INC. OF VElOCITY WITH DEPTH
IiNORMAL MOVEOUT COMPo
e
fl.SMOOTHEO ORUINATE AND DERIVATIVE
e
UTlNE
NCONT INUOUS O£RI VAT I V[ I NHRPULAT ION SUBRO
UCOMPUTES THE PARTIAL OERIVATIYE OF A FOURIER SERIES
IIRESIDUALS AND DERIVATIVeS OF GRAVITY
B
IIBACK TRACE SUBROUTINE ItHICH DESCRIBES FLO~ OF CONTROL
B
USUCKER ROO PUMP DESIGN
B
OVARIANCE FOR NON-ORTH/D C. STAT. DESIGN NANAlY OF VARIANCE OR C B
UlTICOMPONENT DISTILLATION TOWER DESIGN CALCULATIONS
"M B
#AUTOMATIC ~INIMUM ,"EIGHT D£:SIGN OF STEEL FRAMES
B
NROAD DESIGN PROGRAM
B
H-CONTtNUOUS BEAM DESIGN PROGRAM
B
UOESIGN TEMPLATE PROGRAM
B
ANALYSIS OF TWO-LEVEl FACTORIAL DESIGNS
IHBM 650 PROGRAM fOR'"
UCONTOUR CHART OF TRIP DESIRES
B
/ICARD SYSTEMS ERROR DETECTION AIDS
A
UERROR DETECTION SUB ROUT INE
B
INEAR INC. OF VEL.
IilEAST SC~ DETER. FOR A VEL FUNCT. WITH L B
R REfRACT. TID DATA
ULEAST SQ. DETER. OF VELOCITY FUNClION FO B
liSI~UlTANEOUS REAL EQUATIONS. DETERMINANT
[l
EAL
NDETERMINANT AND EIGENVECTOR, R
R COMPLEX MATRIX.
UOETERMINANT AND EIGENVECTOR FO
R REAL MATRIX
UOETERMINANT AND EIGENVECTOR FO
/iDETERMINANT EVALUATION
INE
MDETERMINANT EVALUATING SUBROUT
/I
DOUBLE PRECISION DETERMINANT EVALUATION
T EXTRACTION
NDETERMINANT EVALUATION AND ROO
SUBROUTINE.
NDETERMINANT EVALUATOR FORTRAN
LV TRIANGULAR MATRICES
HDETERMINANT EVALUATOR FOR NEAR
NDETERMINANT EXPAN~ION
NDETERMINANT EXPANSION
NEVALUATION OF DETERMiNANTS
I
NGRIO SYSTEM VOLUME DETERMINAT[ON
FOR BE.NEDICT E(;UATION OF STATE
NDETERM[NATION OF COEFFICIENTS
HE IGENVEC TOR DETERM INATOR SUBROUTINE
IIDETERMINING PROBABlllllES FROM
A FITTED GAMMA DISTRIBUTION
IIRANDDM NORMAL DEVIATE SUBROUT[NE.
IIRANODM NORMAL DEVIATES
RANDOM NUMBERS AND RANDOM NORMAL DEVIATES GENERATOR
, B
IIwEllBORE DEVIATION RECORD
B
11650 DIAGNOST[C
B
HFORTRAN It DIAGNOST[ClAN
B
IIPRINT BSS LOADER DIAGNOST[CS
0
104-SAP FlOAlING-PT. TRAP MATRIX DIAGONALllATION
1# B
H104-SAP-CODED ~ATRIX DIAGONAlllATION SUBROUTINE
B
IIFlOW DIAGRAMMING FOR THE IBM 650
B
OGRAM
"DIATOMIC MOLECULAR INTEGRAL PR B
IISAN DIEGO FREEWAY ASSIGNMENT
B
HAl
flORDINARY DIFF. EelUNS.SOLUTION /RUNGE-KU B
IIDIFFERENTIATION AND PART[AL DIFFER. OF RATIONAL FUNCT.
B
IIDIVIDED DIFFERENCE INTERPOLATION
UOIVIDED DIFFERENCE TABLE FORMAT10N
HSIMULATES A DIGITAL DIFFERENTIAL ANALYZER TO SOLVE
LINEAR REGRESSION PROCEDURE WITH DIFFERENTIAL ECNS.
IINON- B
!/TWO POINT BDUNDRY CONDITION DIFFERENTIAL EQU. SOLVER
B
NiER SUBROU FOR SOLU OF ORDINARY DIFFERENTIAL EQUATION
111
/iSOLUTION OF N SIMULTANEOUS DIFFERENTIAL EQUATIONS
R N
/lNUMERICAL SOLUTION OF DIFFERENTIAL EQUAiIONS OF OROf
jRUNGE-KUTTA ROUTiNE FOR SOLVING DIFFERENTIAL EQUATION ON 650
B
IIDIFFERENTIAl EQUAlIONS ROUTINE B
SYSTEM
IIDIFFERENTIAL EQUAlIDN SOLVING
B
I#SI~ULTANEOUS PARTIAL DIFFERENTIAL f:QUA1l0NS SOLVER
B
NE
fl.SECDNO ORDER DIFFERENTIAL EQUATION SUBROUTI B
"DIFFERENTIAL I:;QUATIONS SOLVER
B
IIFORTRAN OIFFERENTIAL EQUATIONS
B
/lDIFFERENTlAL EQUATION
B
IIFlOATlNG POINT ORDINARY DIFFERENTIAL EQUATIONS SYSTEM
B
IIFLOATING POINT ORDINARY DIFFERENTIAL EQUA1l0NS SYSTEM
B
HLLIPllC PARTIAL DIFFERENTIAL EQUATIONS
E3
/lNUf-IERICAL SOLUTION OF LEGt::NDRES DIFFERENTIAL EQUATION
B
NADMINT ADAMS INTEGRATION OF DIFFERENTIAL EQUATIONS
B
fl!OIFFERENiIAL FOURIER SYNTHESIS B
YSIS
HNU~ SOLU OF ORDINARY DIFFERENTIAL W/AUTO ERROR ANAL B
BSMOOTH AND DIFFERENllATE DATA POINTS
Il
DATA POINTS
"SMOOTH AND DIFFERENltATE. UNEQUAllY SPACED 8
HAGRANGIAN iNTERPOLATION AfljD/OR DIFFERENTIATION
B
HER. OF RATIONAL FUNCT.
fWIFFERENTlATION AND PARTIAL 01 B
ON
UDIFFERENTIATION OR INTERPOLATI B
.SOLUTlON OF HEAT DIFFUSION ECUATtON
B
CAL GED NUCLEAR-CODE
/I. UNCLE 1 DIFFUSION EQUATION IN CYLINORI B
PACE NUCLEAR-CODE
II UNCLE 11 DIFFUSION EQUATION IN tX, yo S B
NSION NUCLEAR-CODE
HUNCLE 3 DIFFUSION EQUATION IN ONE DIME:: B
HIRE NUCLEAR-CODE GROUP DIFFUSION ONE-DIMENSIONAL
H
IIWANDA 2,3 NUCLEAR-CODE GROUP DIFFUSION ONE-DIM[NSIDNAl
B
flWANDA-4 NUCLEAR-CODE GROUP DIFFUSION ONE-DIMENSIONAL
B
HOOM NUCLEAR-CODE GROUP DIFFUSION ONE-DIMENSIONAL
B
UCOGENT NUCLEAR-CODE GROUP DIFFUSION ONE-DIMENSIONAL
B
#FOG NUCLEAR-CODE GROUP DIFFUSION ONE-DIMENSIONAL
B
IIAI~-6 NUCLEAR-CODE GROUP DIFFUSION ONE-DIMENSIONAL
B
IITKO NUCLEAR-CODE GROUP DIFFUSION THREE-DIMENSIONAL
B
IIUFO NUCLEAR-CODE GROUP DIFFUSION THREE-DIMENSIONAL
B
#CURE NUCLEAR-CODE GROUP DIFFUSION ro"O-DIMf:NSIONAL
B
IIPDC-2 NUCLEAR-CODE GROUP DIFFUSION TWO-DIMENSIONAL
B
liIlDO-3 NUCLEAR-CODE GROUP DIFFUSION TWO-DIMENSIONAL
/IRE/" NUCLEAR-CODE GROUP DIFFUSION TIooIO-DIM£NSIONAl
/l.POQ2-90 NUCLEAR-CODE GROUP DIFFUSION TIooIO-DiMENSIONAL
III-'ODULUS 11 SELF-CHECKING DIGIT CALCULATOR
liEKACT-10 DIGIT CONVERSION
B
UBROUT INE
#A 6 DIGIT FLOATING POINT ARCSINE S B

7090-1145ERTSD
0704-0624RWOl2
0104-0451CLDFR
0104-D648ARPLN
0704-0821LRSFO
1010-08~1.00')

1070-06.1.008
0650--UT-I06
0650--UT ....1..04
0105-16 0009
0104-0282PKCKR
0650-11.0.005
1620-11.0.010
1620-11.0.007
1620-11.0.008
7070-12.9.001
0650-06.0.050
06~0-06.0.049

0650-09.2.012
0704-0511RWP~2

0104-0897AAPOS
06')0-09 .. 6.019
7U'J0-124BMOSOD
0704-0760GE'CO I
0704-07BBIBPDF
0650-09.6.008
0704-0907NUBAC
0650-09.6.007
0650-06.0.059
1620-09.1.002
0650-09.2.052
0650-09.2.029
0650-09.2.064
0650-09.2.032
0650-07.0.019
0650-09.2.016
1401--AT-017
1090-1217NUTRA
0650-09 .. 6.016
0650-0l}.6.o20
0704-0116CLSME
0104-0Z23CLDET
0704-0116CLOET
0704-0116CLDET
0104-0110GLDEV
0104-0)55GMDET
0704-0356CA002
0104-0514NA029
0704-0635RWDET
0704-0635RWU(T
0704-0435MACEQ
0709-0991MACEQ
1620-05.0.005
0650-09.6 .. 009
0650-09.1.001
0104-0635RWVC T
0650-06.0.040
0104-0550CSDEV
0650-06.0.035
1070-11.7.001
0650-09.6.001
0650-01.6.052
1620-01.6.019
0704-0830MINOL
0104-070SMIHDI
0104-0691MIHOI
0650-12.0.001
0104-08t+9MIOIA
0650-09.2.041
7090-1205NUOfC
0104-044SPEPAR
0704-0116ClDDI
0104-0116CLODT
010t+-031%LDAS
Q704-1119ERNLIt
0104-0238ATTPI
0650-04.0.005
0650-04.0.011
0650-04.0.011
0650-01.0.00~

0704-0248CLDE(;
0104-0144PKNIU
0704-1043JPSRC.
010't-1013BCDIF
0704-0B25JPOLC
0104-0451CLOEQ
0704-01b2RFono
0704-0S25PKNtL)
0104-0S25PKNID
0704-0674RWSPA
1401-11.0 .. 002
1090-1111ASOI2
0650-08.4.002
0650-04.0.012
0104-0223CLSMD
0704-0331ClSMD
0104-0762RFEOO
010t.-044 .... PEPAR
7090-1235RWDIC
0650-08.1 .. 004
0650-08.2.010
06~0-08.2.01l
0650-0B~2.012

0704-NUCU.AR
0704-NUCLEAR
0704-NUCLEAR
0104-NUc.tEAR
0704-NUCLEAR
7090-NUCLEAR
1090-NUCLEAR
0104-NUCLEAR
0704-NUCLEAR
0104-NUCLEAR
0104-NUCLEAR
0104-NUCLEAR
0104-NUClEAR
7090-NUCLl::AR
1070-02.9.001
070S-EK-002-0
0704-064'JI13ASN

TO SOLVE
/lSIMULATES A DIGITAL DIFFERENTIAL ANALYZER
OF POWER SYS NEiWORK
#IMPROVED DIGITAL SHORT CIRCUIT SOLUTION
ERRAIN DATA EDIT PROGRAM TD-1
IIDIGITAL TERRAIN MODEL SYSTEM T
ORIZONTAl ALIGNMENT PROGRAMS
#DIGITAL TERRAIN MODEL SYSTEM It
:RTlCAL ALIGNMENT PROGRAMS
tlDIGITAL TERRAIN MODEL SYSTEM V
RELII-'INARY EARTHWORK PROGRAM
IIDIGlTAL TERRAIN MODEl SYSTEM P
INT POLY. INTERP. PROG. DA-2 1
#DIGITAL TERRAIN MOOE"L SYS 4 PO
lOFlLE SMOOTHING PROGRAM DA-3
HOIGITAL TERRAIN MODH SYSTfM P
ICLE "} DIFFUSION ECUAltON IN ONE DIMENSION NUCLEAR-CODE
NU
NPUT SUBROUTINE
USINGLE DIMENSION SYMBOLIC FOIHRAN II
N TAPE
/HO WRITE Z DIMENSIONAL ARRAY BINARY INFO
R
IIMULTI-MATERIAL ONE DIMENSIONAL HEAT EQUATION SOLV
DURE.
HHREE DIMENSIONAL lEAST SQUARES PROC
E
II LIL ABNER A FEW-GROUP ONE DIMENSIONAL PROGRAM NUCLEAR-CO
liN DIMENSIONAL TABLE lOOK UP
IITHREE DIMENSIONAL TICK-TACK-TOE
IICOlUMN tlINARY DISASSEMBLY PROGRAM
IIROW BINARY DISASSEMBLY PROGRAM
#7300 DISC IOCS
HIOCS 1405 DISK" SEE 1410-PR-I08 ..
'RT PRO. GENERAT. CARD/TAPE/1405 DISK" SEE 1410-PR-I08"
/iREP
llDISK FILE PROTECTION
HlOAO AND UNLOAD DISK FILE 1
HZERO DISK FILE I/CD&5/CO
IILOAD 2 UNLOAD DISK FILE 2
IIDISK UTILITIES
E MATRIX TRANSPOSED ON ITSElF OR DISPLACED IN CORE
#SQUAR
COLUMN FRACTION CATHODE RAY TUBE DISPLAY
IIMURA SIX
GENERAL ALPHANUMERIC CATHODE RAY DISPLAY
/I
IIFUI\CTION DISPLAV PROGRAM.
NANALYSlS OF COVAHIANCE DISPROP. SUBCLASS NUMBERS
NANALYSIS OF VARIANCE,DISPROP .. SUBCLASS NUMflERS
NO. GENERATOR I MAXW[LL-BOL TlMANN DIS T.
FT. PT.
NRANOOM
HITTING DATA TO floW PARA. GAMMA DIST-SPEC REF RAINFALL DATA
#~ULTICOMPONENT DISTIllATION PROGRAM.
UMUlTICOMPONENT DISTIllATION TOWER DESIGN CALC
ULATIONS
I1NORI".ALL Y 01 STR I BUTEO PSEUDO-RANDOM NUMB
ERS.
UNORMALLY OISTRIBUHD PSEUDO-RANDOM NUMO
ERS.
UI-"DMENT DI~TRIBUTION
IWOMENT DISTRIBUTION
UM ERROR ROUTINE FOR STEAM TABLE DISTRIBUTION
NHINIM
ROBABILITIES FRO~ A FITTED GAMMA DISTRIBUTION
fl.DETERMINING P
I/. P-) FLuX DISTRltlUTlON
~UCLEAR-COOE
IIMOMENT DISTRIBUTION AND INFLUENCE LIN
E CALCULATION
NUCLEAR-.COOE
It TEMPERATURE DISTRIBUTION IN FUEL ELEMENTS
A PIPE NETWORK
I#DISTRIBUTION OF WATER FLO~ IN
HDISTRIBUTION PROGRAr-t GENERATOR
/iOVERHEAD ElECTRICAL DISTRIeUTION SYSTEr~s ANALYSIS
UFITTING OF THE GAMMA- DISTRIBUTION TO RAINFALL DATA
ANDOM NO. GENERATOR, EXPONENTIAL DISTRIBUTION.
FT.PT.
IIR
NRANOQM NO. GENERATOR, GAUSSIAN DISTRIBUTION. FT. PT.
RANDOM NUMBER GENERATOR,
CAUCHY DISTRtnUTION. FT. PT.
#
00
NFLUID FLOW DISTRI8UTlON. HARDY CROSS f-4ETH
NNON-PARAMETRltAl TEST OF DISTRIBUTIONS.
fl.DIVERSITY STUDY
/WOUBLE PRECISION flOATING DIVIDE
flDOUBlE PRECISION FLOATING DIVIDE
IIOVERFLOW, UNDERFLOW, AND DIVIDE CHECK TEST
BINARY ARJTH.
IINORMAlIIEO OIVlOE-EXTENDE.O RANGE flOATING
X ELEMENT BY ELEMENT MULTIPLY OR DIVIDE, REAL
#MATRI
ON
110 IV tOED DIFFERENCE INTERPDLATI
TlON
IIDIVlOED DIFFERENCE TABLE FORMA
/iDOUBLE PREC IS ION FLOAT ING PO INT 0 IV I SION
IIPROGRAMMED DIVISION FOR THE RAMAC 305
nlt~E DOMAIN FilTERING OF SEISMOGRAM
U DONATE
NUClt::AR-CDOE
NG POINT SOAP INTERPRETIVE ROU
IIDOP5IR DOUBLE PRECISION HOATI
IIVECTDR DOT PRODUCT
IINUr-'ERICAL INTEGRATION OF TH[ DOUBLE INTEGRAL
UOOUBlE INTEGRATION SUBROUTINE
IIOOUBLE INTERPOLATION
E
NSINGLE OR OOUBLE INTERPOLATION SUBROUTIN
RE-RODT SUflROUTINf.
IIDOUOLE PREC. flOATING PT. SCUA
ENTIAL SUBROUTINE
HDOUUlE PREC. FLOATING PT EXPON
"ZEROS OF A POLYNOMIAL IN DOUBLE PRECISION
IIFLOATING POINT DOUBLE PRECISION ABSTRACTION
UMURA DOUBLE PREC IS [ON ADO IT ION /F I X
EO POINf/
liMURA FLOATING POINT DOUBLE PRECISION ADDITION
SUBROUTINE..
IIDOUBLE PRECISION ARCSIN/ARCCOS
NSTRUCTION
UDGUBLE PRECISION ARC TANGENT I
IIFlOATING POINT DOUBLE PRECISION ARI1HMETICS.
IIFORTRAN DOUBLE PRECISION ARITHMETIC PA
CKAGE
IIPK CLAO r. PK STOD - ~OUBLE PRECISION CLEAR AND ADO
METIC PACKAGE.
1I00UBlE PRECISION COMPLEX ARITH
NO FMP
#DDUBLE PRECISION COMPLEX FAD A
FMP. AND FOP
HDOUSLE PRECISION COMPLEX FAD,
VALUATION
#I
DOUBlE:: PRECISION UETERMINANT E
NSTRUCTION
IIINTERPRETABlE DOUaLE PRECISION EXPONENTIAL I
T SOAP INTERPRETIVE ROU
NDOPSIR DOUBLE PRECISION FLOATING POIN
T INTERPRETIVE SUBROUTINE
liDGUBlE PRECISION flOATING POIN
T lOAD SUBROUTINE
#DOUBLE PRECISION FLOATING POIN
T PRINT SUBROUHNE
/lDOUBLE PRECISION flOATING POIN
IIDOUBLE PRECISION HOATING ADO
Ji.DOUOLE PRECISION FLOATING DIVI
DE
1I00UBLE PRECISION FLOATING POIN
T PRINT SUBROUTINE
T ADDl110N
UPARTlAl DOUBLE PRECISION FLOATING POIN
/lDOUBLE PRECISION FLOATING POIN
T ADDITION
T DIVISION
IIDOUBl[ PRECISION FLOATING POIN
T 1-'ULTIPLICATICN
NOCUBlE PRECISION flOATING PDI·N
ItDOUBlE PRE;CISION FLOATING POIN
T CARD INPUT
IIDOUBlE PRECISlm~ FLOATING POIN
T EXPONENTIAL SUBROUTINE
T EXPONENTIAL ROUTINE.
HDOUBLE PRECISION FLOATING POIN
T ARC TANGENT SUBROUTINE
IWOUBLE PRECISION FlOAHNG POIN
DE
IIDOUBlE PRECISION FLOATING DIVI
NDOUBlE PRECISION FLOATING MUlT
IPLY
/lOOUBlE PRECISION FLOATING ADD
IISiNGLE PRECISION TO DOUBLE PRECISION FORTRAN INPUT
HDOUBlE PRECISION INPUT..
ION.
HOOUBLE PRECISION INPUT CONVERS
DDOUBLE PRECISION INPUT SCALING
NINTERPRETABLE DOUBLE PRECISION LOGARITHM INS
TRUCT ION
IIDOUBlE PRECISION MATRIX INYERS
ION
IIIJOUBlE PRECISION MATRIX INVERS
ION
LlCA1l0N.
"'OOUBlE PRECISION MATRIX MULllP
ON AND SUBTRACTION.
NOOUBlE PRECISION MATRIX AODlll
IIDOUBlE PRECISION MATRIX SCALAR
MULTIPLICATION
IIDOUBlE PRECISION MATRIX MUlTIP
LICAT ION
IIDOUBl[ PRECISION OUTPUT SCALIN
G
NOOUBlE PRECISION OUTPUT.
RTRAN
/iOOUBlE PRECISION OUTPUT FOR FO

B 01D4-0319GLDAS
B 0650-09.4.004
B 0650-09.2.039
B 0650-09 .. 2.040
il 0650-09.2.041
B 0650-09.2.042
U 0650-09.2.062
B 0650-09 .. 2.063
f\ 0650-08.2.012
B 0104-0tl4BARINS
[I 0704-0'JlONUWT6
B 0104-0652RWHF2
B 0704-0531CF009
B 04')0-08.2 .. 007
B 7090-1204MACUR
B 0650-11.0.002
B 0104-0784GECOS
B 0104-0784GERDS
A 1010--10-905
A 1410--10-911
A I410--RG-910
A 1410--UT-I17
A 0650--UT-103
A 0650--UT-I02
A 0650--UT-I04
A 141D--UT-I01
B 0104-0661GDF02
B 0104-0310MUSCP
B 0704-0314MUSCP
B 0104-0484MIFDP
B 0650-06.0.057
0 0650-06 .. 0.05B
6 0104-07430RMAX
B 0650-06.0.051
80104-1186IBDSr
B 1620-09.3.002
B 0104-057BRWN02
B 0704-051BRWND2
B 0650-0'1'.2.005
D 0650-09~2 .. 009
B 7DS
B 0704-0705MIFlT
B 0709-0941RWHYJ
0 0709-0892RWLNJ
B 0709-1016RWAT3
6 0704-0399MISRT
B 0704-0705MIHDI
80704-0705MIFLT
B 0650-09.7.006
B 0709-0824llFLC
6 0705-18 0003
B 0650-12aO.003
8 0650-09.7 .. 007
8 0650-04'.0.010
0 1620-09 a 7.001
8 0650-09.7.003
8 0704-0907NU8AC
8 0650-09.4.003
8 0650-09 .. 4.005
B 0650-09.4.012
8 0704-0511MICNF
B 1620-09.4.003
~ 1620-09.4.001
B 0709-10B4RSOKF
A 1620--AT-013
a 0704-076 7UASPO
B 0650-01.4 .. 002
B 0704-04641BTfl
B 0104-NUClEAR
B 0650-01.6.017
B 0650-09.7.007
B 0650-08.2 .. 014'
B 0705-6101-002-0
B 0704-0223ClDPC
B 0704-0223CLUPC
B 0704-0848ARGEN
a 0704-1057TVMEP

e

NE LOACER WlTH fL.PT.OFL.

13 0704-0SltRARBSS

NE

JlFtJ I I BINARY SYMBOL IC SUBROUT I
IIFN II ERROR w.:ALK-tlACK SUtlROUTI
UFN II fACTORIAL CUMPUTATION SU
8ROUTINE
R DUMP SUBROUTINE
IIFN II FLOATING POINT OR INTEGE
F COMPUTAT ION SUOROUT INE
NFN II NTH OEGREE LEAST SOU COE
IIFN II SIHULTA"lEOUS L1NE.AR ECUA
TION SOLUTION SUBROUTINE
#FN iI SINE-COSINE INTEGRAL SUE)
ROUTINE
HMAXIMUM DENSITY FO GRANULAR MATERIALS
ON ONE-D IMENS tONAL
IIFOG NUCLEAR-CODE GROUP 0 I FFUS I
NFORUOOLEl T
ENTED 650
tIlINEAR PROGRAMMING FORCED INVERSIDtJ CODE FOR AUGM
CODE FOR AUGMENT 650NLINEAR PRG. FORCED INVERSION VECTOR PART.
111620 FORCOM CARD
NFURECASTING UV ECONOMETRIC SYS
TE~.S
liFORHASTING BY ECONOMETRIC SYS
TEMS
tlFORECASTING BY ECONOM(TRIC SYS
TEMS
IIF:ORECASTING lONAL TRAFFIC VOLU
NFRACT ION REDUCTION TO NORHAL ,FORM
IISEISMOGRAM SYN FORM CONT. INTERVAL VELOCITY.
CvL •
I/FORH NUCLEAR-CODE CROSS-SECTIO
NS
NINTEGRATION OF SPECIAL FORM OF 2ND' ORDER EQU.
RTS A FOURIER SERIES TERM TO BCD FORM.
!lCONVE
GULAR /'lATRIX TO SQUARE SYMMETRIC FORI'!.
IIEXPI'IND TRIAN
E SYMMETRIC MATRIX TO TRIANGULAR FORM.
IJCorHRACT SCUAR
Y DECIt-!AL INPUT PROGRAM-VARIABLE FORtJ.AT
IJSCHENECTAD
IIVARIABLE FIXED FORMAT CARD RHO
RTRAN INPUT/OUTPUT ROUTINE USING FORMAT CONTROL
IH620 FO
CARD FORTRAN
IIFORMAT CONTROL SUBROUTINE FOR
'FORTRAN WITH FORMAT FOR CARDS
#FORTRAN WITH FORHAT FOR PAPER TAPE
/I READING OF FORHAT STATEMENTS AT HECUTION
TIME.
MOPTIMllED TAPE REALJ FOR FORto!AT 12F6.0
NFN I I BCD TAPE OUTPUT FOR FORMAT 12F6.0,4I2
1I0lv1OEO DIFFERENCE TMLE fORMATION
/#TRANSLATOR AND OTHER FORMATS TO SOAP RELOKS
tlFORSCAN
nSWCHF SUBRCUTINE FOR 650 FORTRAN
#FORTRAN
"OOUBLE PRECISION OUTPUT FOR FORTRAN
118iNARY SEARCH, fORTRAN
I#FORTRAN
RMAT CONTROL SUBROUTINE FOR CARD FORTRAN
liFO
UDDITION TO BASIC FORTRAN
liBASIC FORTRAN
BCD TAPE RECORDS ACCORDING TO A FORTRAN
II
CONvERTS
• FUNCTION SUBROUTINE FOR BASIC FORTRAN IIRSTR
IIXRANF • SUBROUTINE FOR A BASIC FORTRAN. FUNCTION
CONTROL _
NBASIC FORTRAN - PUNCH WITH CARRIAGE
IIFULL FORTRAN .SEl 7070-PR-07SliRE LOCATABLE FORTRAN BSS LOADER
IIFORTRAN I3UTLER
IIFORTRAN CARD IMAGE READ ROUTH"
E /CSHlS FOR FINPS 104
liFORTRAN CARD I MAGE. READ ROUTI N
E ICSH/S FOR FINP5 709
IIFORTRAN CARD OR TAPE /ROW ANOI
OR COLUMN BINARY/ LOADER.
ilFORTRAN DIFFERENTIAL EQUATIONS
'FORTRAN DOUBU; PRECISION ARITH
METIC PACKAGE
IIFORTRAN DUMP PROGRAM
IIOPEN SUBROUTINE ADDITIONS TO FORTRAN EDIT DECK
11650 FORTRAN EDITOR
IIFORTRAN (NO CARD SEARCH~
#FORTRAN ERROR PACKAGE
IIFORTRAN FLOATING POINT RUNGE-K
UTTA INTEGRATION.
/lFORTRAN Fort CARDS
#FORTRAN FOR PAPER TAPE
IICOMPLEX FORTRAN FOR THE 1620
ARIATE POLYNOMIAL EVALUATION FOR FORTRAN I PROGRAMS
IiUNIV
1
"FORTRAN II AND/OR FORTRAN I TO SElF-LOADING TAPE
fERROR PROCEDURE FOR FORTRAN II
H FLOATING TRAP TEST
IIFORTRAN II /RTN/ AND /LEvI WIT
SELF-LOADING TAPE 1
HFORTRAN II AND/OR FORTRAN I TO
T SUBROUTINE
IIFORTRAN II BINOMIAL COEFFICIEN
T FUNCTION SUBPROGRA!-I
NFORTRAN 11 BINOMIAL COEFFICtEN
IIFORTRAN II LJIAGNO~TlCIAN
OAT lNG-POINT PACKAGE
.¥FORTRAN I I OOUBLE-PREC I S ION FL
"SINGLE DIMENSION SYMBOLIC FORTRAN I I INPUT SUBROUTINE
#MULTI-DIMENSION SYM80LIC FORTRAN II INPUT SUBROUTINE
OUTPUT MODIFYING SUBR..
lifORTRAN II OFF-LINE TO ON-LINE
OUTPUT MODIFYING SUBR.
#FORTRAN liON-LIN!:: TO OFF-LINE
INPUT MODIFYING SUOR.
liFORTRAN liON-LINE TO OFF-LINE
OLUTE BINARY
nGENERATE ,A FORTRAN II PROGRAM TAPE OR ABS
'PAGE HEADING OUTPUT FORTRAN I I SUBROUTINE
I#ARCTAN A/B, FORTRAN II VERSION,SAP CODEO~
lE PRECISION TO DOUBLE PRECISION FORTRAN [NPUT
/l.SlI~G
'FORTRAN INPUT/OUTPUT PACKAGE
AlION
ItFORTRAN INPUT/OUTPUT TRANSFORM
SING FORMAT CONTROL
1#1620 FORTRAN INPUT/OUTPUT ROUTINE U
#SQUARE ROOT, flOATING-POINT, FORTRAN LIB. VERSION
I#MCDIFTED NUBESI PROGR.AM FOR FORTRAN L1BRARY
#FORTRAN LINEAR PROGRAMMING COO
E.
11709 FORTRAN LOAD/UNLOAD PACKAGE
ABLE OCTAL-COLUMN BINARY ON lINE FORTRAN LOADER
NRElOCAT
IIFORTRAN LOAOER/PACKAGE·
TINE PRINT-OUT PROGRAM
"FORTRAN MAP AND MISSING SUOROU
UFORTRAN MAPPER ROUTINE
NG SySTEM ONE
tlFORTRAN MATHEMATICAL PROGRAMMI
WORD 650
#650 FURTRAN MODIFIED fOR TIlE 4000
NG DEBUG
"OFFLINE EDIT FOR FORTRAN MONITOR WITH SOURC.( LA
NALYSIS PROGRAM
If FORTRAN MULTIPLE CORRELATION A
NTER PLOT BCD TEXT GENERATOR FOR FORTRAN OUTPUT
liPRI
liFORTRAN OUTPUT MERGE PROGRAM
IIFORTRAN OvERLOADER SUBPROGRAM
NFORTRAN PRE-COMPILER FOR PflPER
UPE
HFORTRAN PRE-COMPILER FOR CARD
LOATlNG
POINT TRAP ROUTINE
104 FORTRAN SAP COOED.
liF
liFORTRAN S~JAP SHOT ROUTINe.
NFORTRAt.I SN6 NUCLb'lR-CODt: TRANS
PORT
/#FORTRAN SOURC[ TAPE CORRECTOR
NGENI::RAL LEAST St;UARES FORTRAN SUBPROGRAt-l.
HGENERAL RO[!T FINDER FORTRAN SUBROUTINE
liSPS TO FORTRAN SUBROUTlN( EDIT
/#.SPS TO FORTRAN SUBROUTINE EDIT. REVI
SIaN.
IIFORTRAN SUBROUTINE PACKAGE
1l0ETERMINANT EVALUATOR FORTRAN .s·UBROUfINE.
11650 FORTRAN SYMBOL EQUIVALENCE TAO
LE
IIFORTRAN TAPE WRITE PROGRAM.
IIFORTRAN TO SQUOZE CONVERTER
RY MANAGEMENT SIMULATOR7070 FULL FORTRAN VERSION
I#INVENTO
TAPE
IIFORTRAN ~I TH FORMAT FOR PAPER
HFORTRAN WI TH FORMAT FOR CARDS
#FORTRAN WRITE-UP OF RW REQX.SP
ACE RECUIRED-122 CELLS

B
8
B
B
B
B
B
B
B
B

M"

0704-0B48ARFEr~

0704-084BARTOR
0704-084BARDMP
0704-0848ARPLN
0704-08 1+6ARNXN
0704-084BARCSI

0650-0<).2.01Z
70'}0-NUCLEAR
06')0-03.2.010
a6~0-la.l.00f'J

[l 06':>0-10.1.010
B 1620-01.6.006
0704-09631113FI:.
B 0704-0963IB4FE
0 070'J-09631159Ft
B 0650-09.2.011
U 0704-0900NUFRE
B 0650-05
06'>0--LM-OIZ
0650--fO-10l
0650--FO-302
0650--FD-301
06'>0--FO-30 11
0650--FO-305
0"04-1003GNB5P
1410--FO-913
0709-0819GDBOr.
0650-06.0.053
0650-01.2.001
0704-0250NYFSC
0704-07BBIBGFL
0704-07BOIBWFS
0704-07BOIBRFS
0704-071lBIBIFS
0704-07881BSFS
0704-o70BIBWFS
0704-071lBIBSPF
0704-078BIBPUf0704-018BltiCFf
b704-078fllBASF
Q104-01881BATF
0704-0788IOCIF
070 fl-078BIBEFS
0704-0J881BERF
0104-07il8IB",FS
0704-07881BPllF
0104-078819S+"S
0650-08.4.002
0704-0788IBCIF
1401-01.4 .. 007
1401-01.4.004
11101-01.4.011
0704-1233AAINT
0704-U7430RFlO
0704-02B3~URDF

B Q704-o31m'.USCp

e

070/t-0253~UFP.O

B

0704-03I4MUPRF

Ii

0704-03571'~UPRF

(s 0704-0357MUPRF
U 0704-0900NUFRt:
B 0704-0283MUROF
U 070 11-0225GMCFI{
B 070 f,-085BGS5 ftl
fJ 06')0-09.2.06B
f\ 0650-09.2.067
B 0650-09.2.052
13 0650-03.1.026
B 0704-082ILRSf-D
B 06':'>0-09~2.036
B 06':'>0-09.2.0 1,3
B 0650-0).2.081
B 06')0-09.2.017
fl 0650-09.2.079
P, 0650-09.2.082
P, 1620-06.0.00')
!3 0650-10.3.009
1I 70'JO-1l23WPS02
B 0704-074)OrtGAU
0 0704-07430RMAX
[J 070 t,-07430RCAU
1I 0704-07430RFIS
00704-07430REXP
13 0650-08.2.026
[\ 7090-!'>iUCLEAR
A 7070--FC-901
fI 7070-12.1.001
U 1401-01.1.006
fI 0704-0445PEPAR
B 0650-09.6.016
tl 06'.)0-03.2.001
B 0704-0575GIFIL
I:l 0704-0575GIGOT
0704-0575GITRA
0704-0897AAERF
7070-01.9.002
7090-1182()VCIR
0650-06.0.050
Ii 0650-06.0.049
0704-0859GS1l6
7090-1150RLRAT
0704-0484MIFOP
El 0704-078BIBSPF
B 0704-049)LASR'l
B 0704-0493LASC6
B 0650-09.6.020
0 0704-051"1RWAC2
(l 0709-09B4RWBF7
B 0704-0833RWflJY
B 0650-07.0.002
H 07D4-0979NUBES
B 0704-0B04RWMIN
B 0704-0530CSH~lK
B 0704:""0919MEPYR
0 7070-01.9.001
0 70 70-0B. 1.007
B 0650-03.1.032
B 7090-1177URGfl.M
t) C704-0704RWI3F/I
15 0704-0516LASB6
B 0704-0B69RCOCI
B o704-056':'>CAOO,)
~ 0704-0577RWPS2
B 0650-03.2.002
1:3 o704-0415ATBFS

15

fI. ASSOCIATED LEGENORE
SCHEDULING WITH ARBITRARY PROFIT
NINVERSE NORMAL PROBABILITY
ERPRETIVE SUBROUTINES ,FOR BESSEL
ERBCLIC FUNCTIQNS REGULAR BESSEL
SINE INTEGRAl r. COSINE INTEGRAL
#SINE AND COSINE
o ORDER
II
BESSEL
#BESSEL
lITHE TRANSCENDENTAL
#NEUMANN
NEXTREMUM OF UNIMODAL
IIOESSEL
NBESSEl
R NLlS.
IWESSEl
IONS
NCIRC;ULAR AND HYPERBOLIC
NBESSEL
.II~ATHIEU AND MODIFIED MATHIEU
MALL ORDERS OF THE BESSEL
UNCTION SUBROUTINES
hJSCONSIN
NAPPROXIMATION OF

FUNCTIONS
B
FUNCTIONS
fI B
FUNCTIONS
B
FUNCTIONS
J#A SET OF INT B
FUNCTIONS
RCIRCULAR ANa- HYP B
FUNCTIONS
IIINTER SU8ROU FOR B
FUNCTIONS FOR NlLS.
B
FUNCTIONS FOR REAL ARGUMENT AN B
FUNCTIONS JO/X/AND YO/X/
B
FUNCTIONS MU AND NU
R
FUNCTIONS OF LARGE ARGUMENTS
B
FUNCTIONS OF ONE VARIABLE
B
FUNCTIO.NS OF ORDER ONE.
0
FUNCTIONS OF ORDER lERO.
B
FUNCTlONS OF THE FIRST KINO FO B
FUNCTIONS REGULAR BESSEL fUNCT B
FUNCTIONS SUBROUTINE
B
FUNCTIONS SUI:lROUTINE
ij
Fl;NCTIONS Y SUB K TIMES Z
B
fUNDAMENTAL FLOATING-DECIMAl f 0
FUTURE TRIP TRANSFERS
Ij
IIF0020 rlJUCLEAR-CODE ENGINEERING B
US
IIF0031 NUCLEAR-CODE MISCELLANEO B
IIG i. L POST PROCESSOR
B
NSTRAIN GAGE DATA REOUCTION • CARD.
B
#STRAIN GAGE DATA R(DUCTION • TAPE.
B
IiROOT AND GAIN LOCUS
B
ONS
NGAM-J NUCLEAR-CODE CROSS-SECTI B
NBLACK JACK GAME. CARD"
I:l
IIEX[CUTIVE GAME. TAPE.
B
#IlLACK JACK GAME. TAPE _
0
AU
fiFnTING DATA TO TWO PARA. GAMMA DIST-SPEC REF RAINFALL D B
NING PROBABILITIES FROM A FITTED GAMMA DISTRIBUTION
IIDEJERMI Ii
UMENTS
#LOGAR ITHI1 OF Tl-1t GAM:.1A FUNC TI ON FOR COMPLEX ARG 13
R/1
IINORMALIZED INCOMPLETE GAMMA FUNCTION WITH POISSON IE B
"INCOMPLETE GAMMA FUNCTION.
B
L DATA
IIFITTING OF THE GAMMA- DISTRIflUTION TO RAINFAL B
IlREPROOUCE, GANG PUNCH AND PRINT. RGCP.
B
/lGAS flOW ANALVSIS
B
/lGAS NE TWORK ANALYS t S PROGRAM
B
AUTO RECYCLING" IBM 650.
IIA GflS NETwORK ANALYSIS PROG wITH f\
UGAS NEhORK ANALYSIS - TAPE.
B
#GAS NETWORK ANALYSIS. CARD.
e
NERALIIED ALGEBRAIC TRANSLATOR. GAT.
NGE B
"GAUSS APPROXI~ANT GENERATOR
8
NINTEGRATION SUBROUTINE, 10 PT. GAUSS QUADRATURE METHOD
B
HOD
flA PROGRAM FOR THE GAUSS-SOUTHWELL RELAX.ATION MET 0
#RANOO~ NO~ GENERATOR, GAUSSIAN UISTI{IBUTION. FT. PT.. B
flMHRIX INVERSION BY GAUSSIAN HII-lINATION
B
114-POINT GAUSSIAN INTEGRATION SUBROUTIN A
II INTEGRAT ION BY GAUSSI AN QUA ORA TURE
13
TAPE LBL&.TRAlLER CKN
SGEN. TRA ROL:TINE PROG TAPE OPR I:l
PECTRUfo'. FT.PT
IIRANDOM NO .. GEN., N[R[NSON-ROSEN FISSIO~ S B
OR • GAT #GE~ERALILEO ALGEBRAIC TRANSlAT B
TINE
IIGENERALI lEI) INTEGRA TJ ON SUI3ROU B
PRINT 1
NGENERALILEO MATRIX INVERSION I- B
UNBLOCKED RECORDS
NGENERALIZED MtRGE PROGRAM FOR
B
/I
GENERALIZED OUTPUT SUBROUTINE
NGENERALILEO PLOT ROUTINE
IIGENERALILED PLOTTER II
IIGENERALIlED PLOTTER
13
/lGENERALIlED RAMAC SORT PROGRAM A
NE
GENERALIZEO TAPE SORTING ROUT[ D
NE
IlGENERALllfO TRANSFER ANY ROUTI
CORD SORT
N70917090 GENERALIlf:.D VARIA[!L[ LENGTH RE
INPUT-OUTPUT SUBROUTINE
#G~NERALlIED,PACKAGED,{)FF-LlNE
13
NPUT-OUTPUT SUBROUTINE
#GENERALlZEO,PACKAGED,ON-LINE I B
SEE 1410-PR-l0a #REPORT PRe. GENERAT. CARD/TAPU1405 DISK _ A
TAPE OR ABSOLUTE BINARY
#GENERATE A FORTRAN I I PROGRAM
B
BY NU TPLl
#GENt::RATE MATRICES TO BE SOLVED 0
PUT TAPES.
11704 PROGRM' TO GENERATE 1401 TIP PROG. ON OUT B
IIKINEMATIC SYNTHESIS OF PATH GEN[RATING MECHANISf.'S
B
IIPRINT CONTROL FOR REPORT GENERATION
[)
PROGRA~S • GOOP _
/1.7070 GE'NERATIONS Of l401 OPTIMIZED
U
r. HORNET R[ACTOR CODE SPHERICAL GEO NUCLEAR-CODE
If BEEHIVE !:l
IFFUSION Ef;UATION IN CYLINDRICAL GtO NUCLEAR-COOt
# UNCLE lOB
IIMOOEL 4 GEODIMETER
B
#GEOOIMFTER COMPUTATIONS
B
E
NS4 CYLINDRICAL GEOMETRY CELL CODE NUCLEAR-COD B
ALL A REACTOR CODE FOR SPHERICAL GEOMETRY NUCLEAR-COOC
II e. B
#G(ORGIA EARTHWORK PROGRAM
B
HGEORG I A SKEhED DR IDGE PROGRAM
fI
HGET/PUT - SEE: 0705-10-047.
A
IITRAP TRACE, GI TRAP..
e
TEGRATION
IIFLOATING POINT GILL METHOD- FOR RUNGF-KUTTA IN B
FLU LINE ORDINATE fROM CONTINUOS GIRO. BRIDGE
I#."'OMENT REACT IN B
CANONICAL REPRESENTATION
If GIvEN A FOURIER HALF-SERIES IN e
UATQR-ECLIPTIC ROTATION-ROTATE A GIVEN VECTOR
IIEe a
X OF
/HO ROTATE A GIVEj'~ VECTOR X FROM THE EQUINO B
ES lN X TO 200 OR 205.
NGIVEN X, THIS PROGRAM CALCULAT e
ItGS REVISION OF GL OUT2
B
#GMITR3 ITERATION SUBROUTiNE
B
OGRAMMER
#G,~R DYANA DYNAI-'ICS ANALYlER-PR B
I#GO SOAP I I
I)
NGOHOT
ONS OF 1401 OPTIMIZED PROGRAMS. GOOP •
#7070 GENERATI
IIGOTRAN fOR CARDS
IIGOTRAN FOR PAPER TAPE
IIGOUTY 2A
#GRACE- I NUCLEAR-CODE PHYS I CS
flGRACE-ll NUCLEAR-CODE PHYSICS
IIPROFILE GRADE
B
IIPROFILE GRADE
e
IIMAXI,...UM OENSITY fO GRANULAR MATERIALS
B
IIRESIDUALS AND CERIVATIVES OF GRAvITY
NSCOPE GRID PlOTTER
IISCOPE GRID PLOTTER
liSTRAIGHT LINE BRIDGE GRID SYSTEM
ON
HGRIO SYSTEM VOLUME OETERMINATI 0
#7070 SIMULATOR THE 650 • GRONK •
B
'GENERAL CARD lOACER SUBROUTINE GROUP
B
L
IIWANDA-4 NUCLEAR-CODE GROUP DIFFUSION ONE-OIMENSIONA B
L
NIOOM NUCLEAR-CODE GROUP DIFFUSION ONE-OIMENSIONA C
L
NCOGENT NUCLEAR-CODE GROUP DIFFUSION ONE-DIMENSIONA 1:I
L
HFIRE NUCLEAR-COOE GROUP DIFFUSION ONE-DtMENSIONA
L
fI~ANOA 2.3 NUCLEAR-CODE GROUP DIFFUSION ONE-DIMENSIONA
L
#FOG NUCLEAR-CODE GROUP DIFFUSION ONE-OIMENSIONA tI
L
IIAIM-6 NUCLEAR-CODE GROUP DIFFUSION ONE-OIMENSIONA H
NAL
#TKO NUCLEAR-CODE GROUP DIFFUSION THREE-DIM£NSIO n
NAL
NUFO NUCLEAR-CODE GROUP DIFFUSION THREE-UIMEN'iIO n

16

0704-1040JPASL
0709-1086IBAPF
0709-1002NA86l
0650-03.2.007
0650-03.2.001
0650-03.2.004
0704-08310RSCN
0704-0469NU8ts
0704-0833RWBJY
0704-0311GMMUF
0704-041GCSNMO
0704-087BBEMI.'-\
0104-0636RWBF3
0704-0636RWBF2
0704-08370RBFN
0650-03.2~OOI

0650-03.2.005
0650-03.2 .. 006
0709-0985RWBF8
0650-03.1.032
0650-09 .. 2.03.5
a704-NUCLEAR
0704-NUCLEAR
0650-lO .. 3 .. 00B
1620-09.6.001
1620-09.6.002
0650-09.8.001
70?0-NUCLEAR
1620-11.0.006
1620-11 .. 0.004
1620-11~0 .. 005
06~0-06.0.051

0650-06.0 .. 040
0104-0493LAS86
70?0-1l77URGAM
0704-0516LAS86
0650-06.0.029
1401-13.1.009
0650-09.7.006
0650-09.7.001
06S0-0'J.7.00R
1620-0').3.001
1620-09.3.003
06S0-02.1.007
0704-104BJPGIN
0704-0237GLGAU
0650-09.6.01'+
0704-07430RGflU
0650-05.2.002
7090-1230EOGAS
070'l-04230SGC I
0705-SR-002-0
0704-01430RFIS
0650-02.1.007
7090-1132MAG IN
0105-lfl 0010
1401-01.2.002
0704-0988NUOUT
7090-1146AMPlO
1620-09.7.002
1620-09.7.003
1410--SM-I10
0704-0468CF006
0705-PG-00I-O
0709-1159MOSOR
07Q4-0620CFOC9
0704-0573CFOOl
1410--RG-'JIO
0704-0754CEF21
0704-1110rlJUGEN
0704-1231TVTPP
0650-09.5 .. 003
0709-1030:lWPCR
7070-01.9.003
0650-08 .. 2.009
0650-08.2.010
0650-09.2.085
0650-09.2.06~

10?0-NUCLEAR
0650-0B.2.016
0650-09~2.055

0650-09.2.008
07050704-0593GITRA
0704-04(HRwDE'~

0650-09.2 .. 057
0704-078BIBGFL
0109-0953RWROB
0709-094SRWREQ
0704-0498CA004
0704-0204GSOUT
0704-0259GMITR
0704-0930GMDYA
0650-12.0.004
1620-01.6.018
7070-01.9.003
1620--PR-Oll
1620--PR-OI0
06S0-01.6.044
7090-NUCLEAR
1090-NUCLEAR
0650-09 .. 2 .. 046
0650-09.2.061
0650-09.2 .. 012
0650-09.6.008
0704-0"357J'-1USCP
0704-0432MUSCO
0650-09.2.058
0650-09 .. 6 .. 009
7070-05 .. 1.003
0704-0446P(CSM
0704-NUCLE:AR
0104-NUCLEAR
0704-NUCLEAR
0704-NUCLEAR
0704-NUClE-AR
7090-NUClEAR
70<)0-NUCL£AR
0"T04-rlJUCl[AR
0704-NUCLEAR

"CURE
#POQ-2
NPOQ-3
IIREM
NPDC2-90

GROUP DIFFUSION TWO-DIMENSIONA B
GROUP DIFFUSION T~O-DIMENSIONA B
GROUP DIFFUSIO"" TWO-OIMENSIONA B
GROUP DIFFUSION TWO-DIMEN'$IONA B
GROUP DIFFUSION HW-DIMENSIONA B
MGROUP RECORDS
B
/l.MOVE VARIABLE, GROUPED FIELDS
B
IIGS REVISION OF Gl:: OUT2
B
CK,SIGN,STRIP,yMCTR
IIGSEL,FMCTR.LlNK.MOYE,OPHlT,SEC B
CKAtE
NH.Q. USAF TAPE INPUT/OUTPUT PA 8
NHAFEVER NUCLEAR-CODE
B
SENTATION
IIGIYEN A FOURIER HALF-SERIES IN CANONICAL REPRE fI
tHITlE, HALT AND SWITCH PROGRAM
B
IIHANKEL FUNCTrON ROUTINE
B
AT SIM-ABREVIATEO FLOATING POINT HARDWARE SIMULATOR.
RAB FLO B
IIFlUID FLOW DISTRIBUTION. HARDY CROSS METHOD
B
flOW NETWORK
MHARDY-CROSS SOLUTION Of WATER
B
#HARMON IC ANALYS I S SUBROUTINE
B
IIHASH TOTAL
A
I NT
IIHAS TV EXPONENT I AL, FlOA T1 NG PO B
OUTINE
IiIPAGE HtAOING OUTPUT FORTRAN I I SUBR 1:I
JlMATRIX HEADING REMOVAL
B
NSOLUTION OF HEAT DIFFUSION EQUATION
B
"~UlTJ-"'ATERIAL ONE DIMENSIONAL HEAT EQUATION SOLVER
e
SCLUTION OF LAPLACE POISSON AND HEAT flOW EQUATION
/lNUMERICAL n
NHEAT NUCLEAR-CODE ENGINEERING
B
.TRANS lENT HEAT TRANSFER PROGRAM
B
IIHECTIC NUCLEAR-COOE
B
RANSPORT
IIHERD-l.2, AND 3 NUCLEAR-CODE T B
ilINTEGRAT I ON OY HERM JTE QUADRA TURE
B
11 .. EIGENVALUE PROBe OF A COMPLEX HERMITIAN MATRIX~
#PRElI B
IGENVALUES AND EIGENVECTORS OF A HER"'ITIAN MATRIX..
#E B
IiSTORAGE HISTORY TRACE
B
IIBCD TO HOLLER I TH
Il
/iHOLLERITH CARD TO TAPE
B
INCREMENT COLU"'N BINARY IMAGE OF HOLLERITH NUMBER
H B
'HOLLERITH TO OCD CONVERSION
B
ROS
#HOLLERITH TO BCD INPUT FROM CA B
.IIHOllERITH ~ORO GENERATOR
B
IiOIGITAl TERRAIN MODEL SYSTEM HORllONTAL ALIGl'IIl1tlllT PROGRAMS
H
NBPR REVI~ION OF OREGON HORIZONTAL ALIGNMlNT PROGRAM
B
IIREVISED TRAVERSE ANO HORllONTAL ALIGNMENT
B
NlIQUIO VOLUMES IN flAT END HOR.IlONTAl CYLINDRICAL TANKS
B
GEO NUCLEAR-CODE
II BEEHIVE &. HORNET REACTOR CODE SPHERICAL
B
INTER CODING SYS
#UNIV OF HOUSTON ASSEMBLR FOR PROC.ENG. 13
5S ANALYSIS OF A fLANGED TAPERED HUB. CARD.
liS-l09 STRE B
NALYSIS OF FLANGE WITH A TAPERED HUts. CARD.
8S-100 STRESS A B
ION ROUTINE
NHUMAN REACTION TIME DEMONSTRAT B
TRANSPORTATION PROBLEM, FlOW- OR HUNGARIAN METHOD
liTHE
B
#HYDRAULIC NEhORK ANALYSIS
B
OPS AND PHASE flEHAVIOR OF
LIGHT HYOROCARBON MNTHERMODYNAMIC PR B
NG-POINT 709 HYPERAOLIC SINE AND HYPERBOLIC
ffFLOATI B
ESSEl FUNCTIONS
flCIRCULAR AND HYPERBOlIC FUNCTIONS REGULAR e (\
AUNG POINT.
NHYPERBOLIC SINE AND COSINE,FLO B
tt:FLOATING-POINT 709 HYPERBOLIC SINE AND HYPERBOLIC B
NG
"HYPERBOLIC SINE-COSIN[. FLOATI U
TANGENT SUBROUTINE
HHYPERGOLIC SINE, COSINE AND CO 1:I
#HYPERBOllC TANGENT SUBROUTINE
B
'MATHEr-'ATICAL PROGRAMMING SYSTEM I-ALL SOLUTIONS
B
PULATE BCD-COOED DATA. INCLUDING I/O
fI~.A:"I B
HaASIC 709 110 CONVERSION SUBROUTINES.
fI
II WOPC BUFFERED 110 PACKAGE FOR 709 FORTRAN.
IISTOP NUMflER CRUM AND lAS
/1505 IBM-32K ASSEMeLY AND CO~PILER
NiBSFAP ASSEMBLY PROGRflM
NIBSYS MONITOR
fi1D-3 INTERPRETIVt SYSTeM
#IDA EOIT SUBROUTIN( - CARD
NIDA-EOIT SUBROUTINE -TAPE.
U
CATION
II fllNARY SUBROUTINE IDENTIFICATION AND MEt-fORY ALLO
#lIUTOfo':ATIC PERSONAL IOE~TIFICATION CODE
AUTO-PIC
AUTOPIC 1'*01 -AUTO,...ATIC PERSONAL IDENTIfiCATION CODE.
/! B
HIFS - AFTER SETTING. xx.
B
T SQUARE POLYNCMlAL FIT /FORTRAN II/
NLEAS B
IHNCRE,...ENT COLUMN BINARY IMAGE OF HOLLERITH NUMBER
B
It\ojRITE CORE I~AGE ON TAPE
/ICARD IMAGE PROGRAM
fINP5 70~
IIFORTRA~ CAP,D H~AGE READ ROUTINE ICSH/S FOR
FIr-.P5 709
/tFORTRAN CARD IMAGE READ ROUTINE ICSfi/S FOR
B
IHRANSLATE CARD IMAGE TO BCD IN CUMMON.
H
RUPS
/lLOAO BINARY CARO IMAGES FROM TAPE TO CORE AND 0 Ij
LANGUAGE EASY
.IISYSTEM IMMEDIATELY MAKING PROGRM'MING H
SOLUTION OF POWER SYS NETwORK
#IMPROvED DIGITAL SHORT CIRCUIT B
IlMATRIX INVERSION wITH ITERATIVE I~PROVEr-'ENT Of ACCURACY
fI
ER. FOR A VEL FUNCT. WITH LINEAR INC. OF VEL.
IIlEAST SQ. DET I:i
ItNCR~Al MOVEOUT CO""P. FOR LINEAR I~C. OF Vf:LOCITY wITH DEPTH
t:I
Hfo!ANIPULATE BCD-COOED DATA, INCLUDING 110
B
PAIREO COMPARISONS fROM BALANCED INCOMPLfTE OLOCKS
If
IIINCOMPLHE ELLIPTIC INTEGRALS
IiINCOMPLETf GM'NA FUNCTION.
POISSC~ TERM
IINORMALllED Ij\jCOMPLtH: GAi"MA FUNCTION WITH
#ELLIPTIC INTEGRAL, COMPLETE AND INCOMPLETE..
OF HOLLERITH NUMBER
#INCREMENT COLUMN BI~ARY IMAGE
B
II'I~DEPENOANT TABL( lOADER
B
NNECTOR AND REDUNDANCY PROGS FOI{ INDERTFRMINAH TRUSS ANAL
IICO B
/fRELl LABS PERMUTATION INDEX PROGRAM
H
NREADS THE SORTEO AUTHOR CROSS INUEX TAPE
.: B
ItUr.;PACKS UP TO 6 IMJlCES fROM AN INDEX WORD.
THE INOICES FROM fOURIER SERIES- INDEX WORDS.
IIUNPACKS
IISI,...ULATION OF AI\I INDEXING REGISTER IN SI;:!.
fj
TH TRACE. FIRSIIFLCATING PT. At\D INDEXING REGISTER SIMULATOR WI B
M TRACING ROUTINE FOR 650 SYSTEM INDEXING REGISTERS
#SY R
TO CALCULAH: SEASONALLY AOJUSTtO INDICtS
If PROGRAM
R
NUNPACKS UP TO 6 INDICES FRO~ AN INDEX WORD.
H
DEX WORDS.
flUNPACKS THE INDICES FRO~ FOURIER SERIt:S IN B
IICOMBINES INDICES IN A FOURIER SERIES.
B
.\!COt-'BINE;S INDICES IN A FOUR1ER TER,"'.
S
UTES A SPECIAL FUNCTION F OF THE INurCES.
"COMP l\
NINDIIJIOUAL CARO/TAPE. UTILITIES"
S • CARD.
filM-100 MOMENT OF INERTIA {; CENTROIO CAlCULATIO~ B
S • TAPE.
IIM-I00 MOMtNT OF INtRTIA {; CCNTROID CALCULATION B
5
filMOMENTS OF INERTIA OF POLYATOMIC fo'.OLECULE H
UE ANO RATE OF RETURN. PVIA • • INf. CHAIN MACH. IIPRESENT VAL
NUOS GIRO. BRIDG(
NMOMENT REACT INFLU LINE ORDINATE FROM CONTI
H~OMENT DISTRIBUTION AND INFLUENCE LINE CALCULATION
[}
WRITE 2 DI,...ENSIONAl ARRAY BINARY INFO ON TAPE
liTO B
E v INTERPRETIVE SYSTEM
IIINFaR~ATION PROCESSING LANGUAG B
ECUIVALENCE
NVARIABLE INFOR~ATION PROCHSING PACKAGE 13
flVARIAI3LE INFOR~ATION PROCESSING PACKAGE II
/1709 VARIABLE INFORr-'ATION PROCESSING PACKAGE H

I

NUCLEAR-CODE
NUCLEAR-CODE
NUCLEAR-COOE
NUCLEAR-CODE
NUCLEAR-CODE

0104-NUCLEAR
01D4-NUCLEAR
0704-NUCLEAR
0704-NUCLEAR
709D-NUCLEAR
0705-PG-00B-0
0705-PG-OI0-0
0704-0204GSOUT
0705-DW-002-0
0705-AF-003-1
0704-NUCLEAR
0704-078BIBGFL
0705-DE-002-0
0704-0S30CSH.'JK
7070-05.2.001
0650-09.7.007
0650-09.7.003
0 704-0121GMHA~
1620--MI-015
0"T04-0630WBHE X
0104-0848ARHFO
0704-0085ClMRI!
0650-0B.l.00'+
0704-06S2RWHf2
0650-04.0.010
0704-NUCL[AR
0650-08.1.002
0704-NUCLEAR
0704-NUCLEAR
0704-042 313SHC [
0704-0460MIMAU
0704-08B4PKH~+E

0704-0264ASAS4
0704-0235NYOHL
0704-0525PKCTH
0704-084.30RICU
0704-02:hNYOBO
0104-0387CEJfd
0709-1219~DHOL

0650-09.2.040
0650-09.2.051
0650-09.2.08,*
0650-09.7 .. 005
0650-08 .. 2.009
0650-02 .. 0.017
1620-09.1.005
1620-09.7.004
0650-11.0.005
0704-iJ464I8TFL
0650-09.7.002
0650-09.3.002
0709-0941RWHV3
0650-03.2.001
0704-0417PFCSH
010'J-094IR .... HY1
0704-022411.SAS3
7070-0B.l .. 020
7070-09.1.011
0704-1092RSMIA
0704-0879.'114flC
0709-0"38BGS710
0709-0978"DIOF0650-01.6.027
0709--PR-063
7Q90--SP-920
1090--SV-91B
0650-02.0.027
1620-01.6.005
1620-01.6 .. 002
0704-0739ARPfK
0650-01.6.04l
1401-01.4.014
0705-PG-005-0
0704-0772ANE20
0704-08430RICfI
0704-0B30"lIWTP
070S-IB 0002
0704-0820R'wCSH
0709-0820RWCSH
0709-0778AE lac
0704-0395ll010
0704-1096TVSNP
0650-09.4.004
06~O-05.2.022

0650-09.6.016
0650-09.6.01'}
0704-0B79MI4BC
0650-06.0.039
0'(04-0225GMIEF
0704-05I6LASfl6
70?0-1177URGAi-'
0704-0977ALELP
0704-0B430RICtI
0650-01.2.011
0650-09.1 .. 007
7090-1239UEPIP
0704-1l44NC01f.+
0704-078BIBUPF
0104-0788l[lSPF
0650-02.0.0)'6
0650-01~6.050
0650-01~4.007
06~0-06.0~042

0704-07BBIflUl"f
0104-078BIHSPF"
0704-078810CJF
0704-0788I[3CIF
0704-07AAIHSPF
l'fl0--UT-I06
I620-Q9.3.004
1620-09.3.00'l
0650-09.3.005
0650-01.0.017
0650-09.2.057
0650-09.2.033
0704-0910NU .. TH
0704-1006RSIPL
0704-0R56CVVIP
070ff-QBS6CVVI'"'
0709-1135f1\-.lBTSO
U 0704-0690GDBOT
B 0704-0572PFCCS
B 0709-0563SE9RB
B 0709-081ROUTiNE
NE
#TAIlLE READ IN [. TABLE LOUKUP, INTERPOLATiON SUQROUTI
#MATRIX LOOP TEST
IILOOPCOOER
LISTING
11-7070 LORELI 2 • LOCATION REFEReNCE
IIPR08A8IlITY OF LOSS OF LOAD
#TRANSMISSION LOSSES AND PENALTY FACTORS
PROGRAM NUCLEAR-CODE
1# LOST A CROSS SECTION AVERAGING
/JRHOCATING BINARY LOADlR,LOW[R
IIRHOCATING BINARY LOADI:R,LOWER
/lARGONNE TAPE LOWER BINARY LOADER
#MURA LOwER BINARY LOAULR lONE CAROl
/lONE CARD lOwf:R LOAD
IISELF-LOADING BINARY-OCTAL LOHER LOADER
RTER
1ILP/90 TO SCROL 704 INPUT COWE
650
IfU:C SURFACE FITTING FOR IjASIC
IILS- 3
NERAL PURPOSE SVSTEM FOR THE 650 L2
NGE
EST.r.SCHED. Pf-tASE ON LV .. LESS. M. C. FRISH£lERG
IIUAST COST
ROID CALCULATIONS. CARD"
IIM-I00 ~OMENT OF INERTIA (. CENT
ROID CALCULATIONS. TAPE.
IiM-lCO HOME:-JT OF INERTIA r. CENT
E BEHAVIOR OF
LIGHT HVDROCARBON M/ITHER~OOY"IAMIC PROPS AND PHAS
OF RETURN. PVIA II • INF. CHAIN MACH. IIPR[SENT VALUE AND RATE
IIT'nO MACI'IN[ LOhUt:R..
EAR PROGRAMMING
NMACHINE LOAU!NG PROllLEM OF LIN
R SYSTEt-t
IINEW MACRO LOOK-UP FOR 705 AUTOCOLJ[
11704 MACRO-SAP ASSEMBLE.R.
SUBROUTINES
IIMAD TRANSLATOR AND ASSOCIATED
ItMAllSMI CURVE: SMOOTHING ROUTINI:
elL 111
/lFL DEC INTERP SYS 650 MAG DRUM CALC w/IMMED ACCESS e
ISTICAL INTERPRETIVE SYS FOR lAM MAG ORUM CALCULATOR
ItSTAT
II~GD BElL TRANS PRCG FOR 650-653 MAG DRUM CONE STGL co~ru
#MAIN RE-GRESSION PROGRAM
TRACTS
/Ill 1401 PROGRAM T,o MAINTAIN THE SHhRE U[JRARV ABS
IIMAKE SAl-' OCTAL
#MANAGEMENT DECISION MAKING EXERCISE
SV
IISVSTEM IMMEDIATELY MAKING PROGRAMMING LANGUAGE EA
IIMAN-SCHEDULING
ReISE
IIMANAC.El~ENT DECISION MAKiNG £XE
UN INVENTORY MANAGEI-1ENT SIMULATOR. CARD'"
IIINVENTORY MANAGI:MENT SIMULATOR II TAPE.
IIINVI:NTORV MANAGEMENT SIHULATOR .. CARD"
FORTRAN VERSION
/lINVENTORY MANAGEMENT SIMULATOR1010 FULL
HAPE MANEUVERING ROUTINE.
LUCING lID
UMANIPULATE BCO-COOED DATA, INC
RAI'I FOR THE 709
I#MATRIX HANIPULATING INTERPRETIVE PROG
CHART ANALYSIS BY BOOLEAN MATRIX MANIPULATION
IIFLOW
ERAL PURPOSE LANGUAGE FOR SYMBOL MANIPULATION
IICO!",IT - GEN
/I"'RITE BSS LOADER STORAGE MAP
NWRlTE [lSS LOADER STORAGE MAP
NT-OUT PROGRAM
IIFORTRAN MAP AND MISSING SUBROUTINE PRI
IIFORTRAN- tJ,APPER ROUTINE
EMeLY SYSTEM CONVERTED TO TAPE. MASCOT·
IIMODIFIED ASS
Y OF SPS TWO.
#FULL MAST ·FULl MINNEAPOLIS ASSEt-'BL
PS HiD •
III-'.AST itMINNEAPOLI ASSEMBLY OF 5
If-CREATE MASTER PROGRAr-< TAPE
IISEARCH MASTER PROGRAr-'; TAPE
HMATES • MAST!:R TAPE EXECUTARY PROliRflMS
HMAXIMUM DENSITY FO GRANULAR MATERIALS
PROGRAt-'S ..
HMATES • MASTER TAPE EXECUTARY
#MATH F IN
M ONE
IIFORTRAN MATHE/I_ATICAL PROGI{AMMING SYSTE
M I-ALL "SOLUTIONS
liMATHEMATICAL PROGRA)'J;MING SYSTE
M TI10
#MATHEI~ATICAL PROGgAMMING SYSTE
UNCTIONS SUQROUTINE
NMATHIEU AND /-'.ODIFIED 1-'ATHIEU F
IIMATHIEU AND MODIFIED MATHIEU FUNCTIONS SUBROUTINE
IIMOLECULAR SPECTROSCOPY MULT OF MATRICES
UREAL EIGENVALUES OF REAL MATRICES
IlLlNEAR ECUATION SOLVER OF BANO MATRICES
EVALUATOR FOR NEARLY TRIANGULAR MATRICES
IiDETERMINANT
o EIGENVECTORS 01" REAL SYMMETRIC MATRICeS
I/EIGENVALUES AN
IIEIGENVALUES OF REAL SVMMt:TRIC MATRICI:S BY THE JACOBI METHOD

RAtJMING

H 1620-01.2.001
II 06~0--UT-I04
B 0104-07!19iBMLl
[l 0650-01.2 .. 003
11 0650-01.2 .. 004
II 0650-01.2.006
1I 0650-01 .. 2.007
B 0705-EQ-001-0
B 0709-0808GORCC
~ 0704-08991-'ETOU
B 0704-07BlwH004
Ii 070 11-0701WHOOI,
II 0650-09.2.037
B 0704-04l,9~\l951
0650-01.2.000
[J 1620-09.4.002
tl 1010-0/, .. 110003
II 070<)-1120ATLOC
B 0650-09.0.001
B 0650-01.1.019
b 7070-00.2.002
II 7070-00 .. 2.004
[I 0650-09.6.006
B 0650-03.1.013
B 0704-0310RS013
06S0-03.1 .. 014
0704-0354NA66.
0704-0069LAS02
0704-0466RL017
0709-0501IBLDG
0704-0525PKLGA
0704-0'HJ5BSLNX
l~ 0709-06651BLG3
[J 0704-0 l193LAS86
B 0709-0892RWLN3
[) 7070-08.2.005
B 1070-08 .. 2.0013
B 0704-02B3MULOG
B 0704-0280~tULOG
A 0704-0357!-',ULOG
070 1,-1054E1SSEA
0704-04{,3LL02 tl
1401-01.4.002
D704-0468CF005
0105-AF-013-0
70,}O-1204MACU~

B
H
B
B

B
e
B
B
[}
B
B
D
B
Ii

B
B
H
B
B
e
B
B

e

0101+-0452SCTRI
0105-PG-012-0
0704-055ICSDEV
070t+-06S9GCTLU
0704-0085CLMLP
0705-H6-001-0
7070-04.4.003
0650-09.4 .. 006
1620-09 .. 4.008
0650-013 .. 2.004
0704-0525PKCSB
070?-0563SE9LR
0704-0S03ANIll
0704-0251MULBL
0705-EK 0001
0709-0999RL039
0704-0937ERCON
06'i0-08.3.001
0650-06.0.024
0650-02.0 .. 008
06'50-10.3.00')
1620-09.3 .. 004
1620-09.3.005
0650-0').3.002
0650-07.0.017
0709-0709R',.jfML
0704-07891BMll
070S-PG-OIZ-0
0704-0958MIMS
0704-1101UMMf\D
7090-1241~ADSM

0650-02.0 .. 021
0650-06.0 .. 017
0650-02.1.011
0704-0822TVRfM
0704-116~PNSLI

0704-0513BE:.SAK
7070-12 .. 9.002
C704-1096TVS~lP

06S0-10.).006

t> 7070-12.9 .. 002
1620-10.2.001
1620-10.2.002
1620-10 .. 2.003
1070-12.1.001
070'+-0688GKT!>'R
0704-0079MI4?C
0709-C936LlM~I

0709-0824LLFLC
0709-11'J8MICO!~

0704-083CMISTP
B 07Q4-0830MISTP
B 0704-0909MPMAP
P,

[l

1620-01.6.0160

t3
1I
B
B
Il

1401-01.1 .. 0~1
1401-0}.1.006
1401-01.1.005
0705-AO-OI0-0
0705-AO-011-0
1070-03 .. 4.003
0650-09.2.012
7070-03.4.003
0650-07. o. 007
07Q4-0863RSMl
0704---1092R5MIA
0709-1QJ7SCM2
0650-03 .. 2 .. 006
06')0-03.2.006
0650-05 .. 2.023
C70'+-0635RWEIG
0709-0990RWLE4
0704-0635RI1DI:.T
0704-1029ANF20
0650-05.1.006

~

[J
B
B
B
B

B
n

19

"EIGENVALUE FOR SYM",ETRIC MATRICES IN FLOATING POINT
NSTORE ROW MATRICES INTO A LARGE MATRIX
NEIGENVALUES OF REAL SYMMETRIC MATRICES ON THE 1620 DIP SYS
NEIGENVALUES OF REAL SYMMETRIC MATRICES ON 1620 DIP SYSTEM
II
IIGENERATE MATRICES TO BE SOLVED BY NU TP
N QUARTIMAX ROTATION OF A FACTOR MATRIX
'PATER
NlATENT ROOTS ANO VECTORS OF A MATRIX
EIGENVALUES & EIGENVEC.TORS OF A MATRIX
OBTAIN
STMULTIPLY REAL BY SYMETRIC REAL MATRIX
NPO
RMINANT AND EIGENVECTOR FOR REAL MATRIX
'DElE
IISTORE ROW MATRICES INTO A LARGE MATRIX
11K TIMES UNIT MATRIX
11704-FORTRAN I I SUBPROGRAM FOR MATR I X
EIGENVECTORS OF A REAL SYMMETRIC MATRIX
'EIGENVALUES AND
PY LATENT ROOTS AND VECTORS OF A MATRIX
NMOLECULAR SPECTROSCO
VECTORS OF
NON-SY"'METRIC SQUARE MATRIX
,\IElGENVALUES AND ElGEN
ALUES AND EIGENVECTORS SYMMETRIC MATRIX - FI
IIEIGENV
.INTERPRETATION MATRIX ABSTRACTION
IIGENERAL MATRIX ABSTRACTION FROM TAPES
POINT
'''lURA MATRIX ADD OR SU8TRACT, FIXED
IIMATRIX ADDITION
N.
IIDOUBLE PRECISION MATRIX ADDITION AND SUBTRACTIO
IJNORMALIlE MATRIX BY COLUMNS.
IINOR~AUn MATRIX BY ROWS
DOUBLE-PRECISION FLOATING 131NARY MATRIX CONVERSION PROG
IIINE
N704-SAP-CODED MATRIX DJAGONALIIATIO~ SUBROUT
11704-SAP FLOATING-PT. TRAP MATRIX DIAGONAlIlATION
IPlY OR DIVIDE, REAL
RMATRIX ElEMENT BY ElEMENT MULT
NSOLUTIoN OF GENERAL MATRIX EQUATION AX - B.
ERVAL ARITH..
ffSoLUTION OF MATRIX EQUATION AX-B USING INT
ERVAL ARITH.
'SOLUTION OF MATRIX EQUATION AX-B USING [NT
IILlNEAR MATRIX EQUATION SOLVER
IIMATRIX EXPAND
IIMATRIX HEADING REMOVAL
COLUMNS
/lMATRIX INTERCHANGE OF ROwS AND
NMATRIX INVERSE
IIMATRIX INVERSION
NCOMPLEX ARITt1METIC MATRIX INVERSION
"MATRIX INVERSION
NLARGE SCALE MATRIX INVERSION
HHATRIX INVERSION
f#OOUBLE PRECISION MATRIX INVERSION
'SYMMETRICAL MATRIX INVERSION
NMATRIX INVERSION
IIMATRIX INVERSION
#MATRIX INVERSION
NDOUBlE PRECISION MATRIX INVERSION
#A GENERAL PROGRAM FOR COMPLEX MATRIX INVERSION
NMATRIX INVERSION
IIMATRIX INVERSION
IISINGLE PRECISION MATRIX INVERSION
IIGENERAlIZEO MATRIX INVERSION PRINT I OF SIMULTANEOUS LINEAR EQUAT
IIMATRIX INVERSION AND SOLUTION
UATIONS
IIMATRIX INVERSION AND lINEAR EQ
OUS ECUATIONS
117070 MATRIX INVERSION AND SlfolULTANE
LIMINAT.lON
IIMATRIX INVERSION BY GAUS~IAN ~
NG
NMATRIX INVERSION BY PARTITIONI
IR 1 •
IiMATRIX INVERSION ROUTINF I - ~
E I~PRCVEMENT OF ACCURACY
IIMATRIX INVE:.RSION \H',ULTANI;:OUS EQUATI
LY OF VARIANCE OR COVARIANCE FOR NON-ORTH/O C. STAT. DESIGN UNA
IBUTIONS.
IINON-PARAME:.TRICAL TEST OF DISTR
EIGENVALUES AND EIGENVECTORS OF
NON-SYM~ETRIC S(;)UAR[ MATRIX
/I
IIBINARY TAPE CORRECTOR .. NON-SYSTEM VERSION
IIRANODM NORMAL DEVIATE SUBROUTINE.
IIRANDOM NORMAL DEVIATES
IIRANOOM NUMAERS AND RANDOM NORMAL OEVIATES GENERATOR
IJFRACTION REDUCTION TO NORf'oIAL FORM
R INC. OF 'VELOCITY WITH DEPTH
/fNORMAL MO'VEOUT COMPo FOR LINEA
AND AREA
IINORMAL PROBABILITY - OROINATE
NIN'VERSE NORMAL PROBABILITY FUNCTIONS
flNORfoIALllE MATRIX BY COLUMNS.
NNUR/oIALIIE MATRIX BY ROWS
ATJNG POINT NATURAL LOGARITHM OF NORMALIZED
flFLO
MFLOATlNG POINT SUBROUTINES NOR~ALIlED
flOATING BiNARY ARITH.
IINORMALIZED AUO
EXTENDED RANGE
GE flOATING BINARY ARITH.
,1/N0Rt-IALIIED ARCTAN-EXHi-IOEO RAN
GE FLOATING BINARY ARITH. '
NNORMALIZED DIVIDE-EXTENDED RAN
GE FLOATING BINARV ARlTH.
/lNOR~ALIlED I::. TO X-EXTENDED RAN
NCllON WITH POISSON TERM
~NORMALIZED INCOMPLETE GAMMA FU
FLOATING BINARY ARITH.
/fNORMALIno LOG-EXTENDED RANGE
GE FLOATING BINARY ARITH.
IINORI-1AllLEO MULT.
EXTENDED RAN
NGE FLOATING BINARY ARlTH
If'NORMALllEO SQ.R001-EXTENDCQ RA
TION
IINORMALILED VAIUMAX FACTOR ROTA
NDOM NUMBERS.
~NORMAllY OISTRIBUTEO PSEUOO-RA
NDOM NU~BERS.
If'NORMAlLY OISTR!BUTELl PSEUDO-RA
RATION SPLIT INSTRUCTION ROUTINE NOSIR
HNIN( OPE
/lNOST P
IIBANG 4 • BASIC ARITHMETIC NOTATION GENERATOR.
/lROCKET NOllLE PROGRAM
UTATION SUeROUTINE
IIFN II NTH OtGRU LEAST SQU COfF CaMP
IINTH LEGENDRE POLYNO~IAL
If'NTH LE:GENDRE POLYNOMIAL
'NTH LEGENO~E POLYNOMIAL
HCOMPLEX NTH ROOT
E
HNTH ROOT FIXED POINT SUBROUTIN
TINE
HNTH ROOT FLOATING POINT SUBROU
HNTH ROOT OF X
NFLOATING POINT NTH ROOT SUBROUTINE
TRANSCENDENTAL FUNCTIONS MU AND NU
lITHE
IISWAP ~U AND NU NUCLEAR-CODE PHYSICS
ENERATE "'ATRICES TO BE SOLVED BY NU TPll
IIIG
lITO READ AND CHECK NL WTB-\oIRITTEN RECORDS
RARY
NMOOIFIEO NUBES1 PROGRAM FOR FORTRAN LIB
/lWHIRLAWAY NUCLEAR CODE
HUNCLE 4 NUCLEAR-CODE
liNED N~CLEAR-CODE::
• MOONSHINE NUCLEAR-CODE
" PARACANTOR NUCLEAR-COOE
ONE-SPACE-OIMENSIONAL MULTIGROUP NUClI:::AR-CODt
1#
CROS~ SECTION AVERAGING PROGRAM NUCLEAR-CODE
N LOST A
/I DONATE
NUCLEAR-CODE
#MUFT 3 NUCU:AR-CODE
III K-CODE
NUCLEAR-COOi;
/I VALPROD
NUCLEAR-CODE
/# P-3 flUX DISTRIBUTION NUCLEAR-CODE
UR REACTOR KINETICS ':ARK-Ie CODE NUCLEAR-CODE
II ARMO
1# ART-l
NUCLEAR-CODE
NEUTRON ENERGY SPECTRA IN WATER NUCLEAR-CODE
/IfI ENSIGN COUE
NUCLEAR-CODE
II MULTIREGROUP
NUCLEAR-CODE
IIIHAFEVER NIJCLEAR-COOE
NFL T NUCLEAR-COOf:
IIHECT IC NUCLEAR-COUE
IIFLEf:R NUCLEAR-CODE
NAPCOI NUCLEAR-CODE
N2DXY NUCLeAR-CODE::
IIAPWRC-SYNFAR NUCLEAR-CODE
HUGUE NUCLEAR-CODE
/#AIREK-II Nt.;(.LEAR-COOE

a 0104-D069LASa2
B 0704-0354NA66.
B 0709-05071BLOG
U 0704-0S25PKLGA
n 0709-066SIBLG3
0 0709-0892RWLN3
B 7070-06.2.006
11 0704-1144NC014
0704-1144NC014
070 1,-1144NC014
0704-1144NC014
0704-0357MUNCI
070 I,-114 1.NCOI3
0701+-0615RWOET
B 0704-0635RWNTR
B 0650-08.2.017
0 0709-0462GASrO
B 0704-07430RFIS
B 0650-09.4.002
U 0650-09.7.003
B 1620-09.7.001
B 06S0-09.2.080
B 0650-09.4.004
B 0650-09~ 7.002
B

1620-09~3.003

B 1620-09.3.001
I}

0650-09.7~001

B 0650-09. 7~008
il 0704-0511MICNF

B 0709-1084RSOKF
B 0701,-0416CSNMB
B 0650-06.2.025
a 0650-08.2.021
B 0650-08.2.028
6 1620-09.4.004
B 0705-PG-012-0
B 0704-0J57MUNCI
B 0704-0568ELQRC
Ii 1401-11.0.001
B 070 1,-0110GLROP
Ii 0650-02.0.00t.
0704-08370Rscr~

a

B
(3

H
B
B
B

B
B

B
Ij

B

B
B
Ij

B
I}

n
B
a
B
B
B
B
B
Ii
B

B
B
a
H
A

B
B
B
B

B
B
6
A
A

B

a
B
B
II
B

B
B
B
B
El
Ii
H
6
13
B
B
B
B
B

0704-08J70RX3N
0704-08370R6FN
0704-08310ROUN
0704-06071BNll
0704-08370RNLL
0704-1119ERNLR
0704-0273CLSfJE
0704-0273CLSI-IE
0650-06.0.059
0104-081SPFTNP
0650-05.2.016
0709-1055DIBTC
0704-0550CSDt\l
065.0-06.0.035
'1070-11.7.001
0704-0')00NUFRI:
0650-0'1.6.01'J
0709-100lNA860
0709-1002NA661
0704-0236CLMNR
0704-0236CLMNR
0709-0665IBLG3
I40I-03.0~00Ij

0704-0310RS013
0704-0370RSOl]
0104-0370RS013
0704-0310RS013
70'JO-1177URGAM
0104-0J70RS013
0704-0310RS013
0704-0370RS013
7070-11.).008
070',-OS76RWN02
0704-0518RWNl)2
0650-02 .. 0.006
7080--S'V-087
1401-10.2.002
0704-1156LRRON
0704-0846ARPLN
0704-0654AMPLG
0704-0654AMPLG
0704-0654AMPLG
0704-0354NA63.
0650--LM-001
0650--lM-009
7010-06.3.003
0704-0525PKNOQ
0704-0311GMMUF
0104-NUCLEAR
0704-1110NUGEN
0704-0911NURTB
0704-0547PFBES
7090-NUCLEAR
0650-06.2.018
0650-06.2.011
06S0-06~2.001

0650-08.2.002
0650-08.2.00J
0650-06.2.004
0650-06.2.005
0650-08.2.006
0650-08.2.006
0650-08.2.013
0650-08.2.01/,
0650-06.2.019

[I

0650-08.2~020

a
B
B
B
B
B
B
B
B
B
B
B

0650-06.2.021
0650-08.2 .. 022
0650-08.2.027
0704-NUGLEAR
0104-NUCLEAR
0104-NUCLEAR
0104-NUCLEAR
0704-NUCLEAR
0704-NUCLEAR
0709-NUCLEAR
1090-NUCLEAR
7090-NUCLEAR

21

flEQUIPOISE
#TWENTY-GRAND
4 CYliNDRICAL GEOMETRY CElL CODE
112DXY
RE DISTRIBUTION IN FUEL ElEMENTS
CTOR ceDE FOR SPHERICAL GEOMETRY
FUSION EC;UATION IN ONE DIMENSION
ORNET REACTOR CODE SPHERICAL GEO
FFusrON EQUATION IN :tx, Yo SPACE
UTRON ATTENUATION-REACTOR SHIELD
Hj-GROUP ONE DIMENSIONAL PROGRAM
SION ECUATION IN CYliNDRICAL GEO
y THE NEUTRON TRANSPORT EQUATION
HANDLE
HURBO
1I0RACQ
HSIllLE
#TEMPEST-II
HFORI-1
IHt:MPEST
IIAETRA
HGAM-I
# S TOY- 3
#ART I
flIABRAC-OI
NATBAC
IiIART 04
118INTO
#F0020
IIHEAT
#PROP AND JET
!ISH CODES
#TEMP-2
ItTURF-6
#WB TSG-l
#PECAN
IIAIMFIRE
NE-DIMENS tONAL
flIWANDA-4
NE-IJIMENSIONAL
HOOM
NE-OII-IENSIONAL
§COGENT
WO-OI~ENSIONAl
flCURE
WO-DIMENSIONAL
#PDO-2
WO-O II"'ENS I ONAL
R'POQ-3
WD-DIMENSIONAL
/lREM
NE-DIMENSIONAL
HIRE
NE-DIMENSIONAL
#WANDA 2,3
HREE-D I "'ENS IONAL
ItTKO
HREE-O I MEN S 10NAL
UUFO
WO-DIMENSIONAL
IIPOQ2-90
NE-DIMENSIONAL
#FOG
NE-DI~ENSIONAL
flAIM-6
HCOFIT
#EXFIT

NUCLEAR-CODE
NUClEAR-CODE
NL:CLEAR-CODE
liS
NUCLEAR-CODE
NUCLEAR-CODE
II TEMPERATU
NUCLEAR-CODE
II BAll A REA
NUCLEAR-CODE
HUNCLE 3 DIF
NUCLEAR-CODE
II BEEHIVE & H
NUCLEAR-CODE
II UNCLE 11 01
NUCLEAR-CODE
II CALCULATE NE
NUCLEAR-CODE
II LIL ABNER A F
NUCLEAR-CODE
If UNCLE 1 DIFFU
NUCLEAR-CODE II A MULTIGROUP P3
NUCLEAR-CODE BURNUP
NUCLEAR-CODE BURNUP
NUCLEAR-CODE BURNUP
NUCLEAR-CODE tlURNUP
NUCLEAR-CODE CROSS-SECTIOr..S
NUCLEAR-CODE CROSS-SECTIONS
NUCLEAR-CODE CROSS-SECTIONS
NUCLEAR-CODE CROSS-SECTIONS
NI';(LEAR-CODE CROSS-SECTIONS
NUC LEAR-CODE ENG I NEER I NG
NUCLEAR-CODE ENGINEERING
NUCLEAR-CODE ENGINEERING
NUCLEAR-CODE ENGINEERING
NUCLEAR-CODE ENGINEERING
NUCLEAR-COOl:: ENGINEERING
NUCLEAR-CODE ENGINEERING
NLCU;AR-CODE ENGINEERING
NUCLEAR-CODE ENGINEERING
NUCLEAR-CODE I:NGINEERING
NUCLEAR-COUE ENGINEERING
NUCLEAR-CODE ENGINE:(RING
NUCLEAR-CODE I:NGINEE:RING
NUCLEAR-COUE ENGINEERING
NUCLEAR-CODE ENGIN[ERING
NUCLEAR-CODE GROUP IJiFFUSION
NUCLEAR-COOl: GROUP DIFFUSION
NUCLEAR-CODE GROUP DIFFUSION
NUCLEAR-CODE GROUP DIFFUSION
NUCLEAR-CODE GROUP DIFFUSION T
NUCLEAR-COOl: GROUP DIFFUSION T
NUCLEAR-CaO[ GROUP DIFFUStOI\l T
NUCLEAR-CODE GROUP DIFFUSION 0
NUCLEAR-CODE GROUP OIFFUSION 0
NUCLEAR-CODf; GROUP DIFFUSION T
NUCLEAR-CODE GROUP DIFFUSION T
NUCLEAR-CODE GROUP DIFFUSION T
NUCLEAR-CODE: GROUP OIFFUSIOtli
NUCLEAR-CODE GROUP DIFFUSION 0
NUCLEAR-CODE MISCElLANEOUS
NUCLEAR-CODE ~ISCELLANEOUS
IIFOD31 NUCLEAR-COOt: ~ISCELLMjEDUS
#EURIPUS-3 NUCLEAR-CODE I-IONTE CARLO
IIDAEDALUS NUCLEAR-COUE MONTl CARLO
IIPOLYPHEML:5 fIIUCLEAR-CODE MO~TI:: CARLO
IISPAN-2 NUCLEAR-CODE MONTE CARLO
IfSPIC-1 NUCLEAR-CODE MONTE CARLO
IITUT-T5 NUCLEAR-CODf MONTE: CARLO
IIPERT NL:CLEAIt-CODE PERTURBATION
#PREP NUCLEAR-CODE PHYSICS
#SOFOCATE NUCLEAR-CODE PHYSICS
HSWAP MU AND NU NUCLEAR-COOE PHYSICS
liPS NUCLEAR-COOl: PHYS IC::,
IIQUERY NUCLEAR-CODE PHYSICS
IIGRACE-I NUCLEAR-COilE PHYSICS
flCLOUU NUCLEAR-CODE PHYSIC::'
#GRACE-11 NUCLEAR-CODE PHYSICS
11CEPTR NUCUAR-COOE TRANSPORT
IIFL IP NL:CLEAR-COD!:: TRANSPORT
IIHERO-1,2, AND 3 NUCLEAR-CODE TRAN~PORT
#PIMG NLCLEAR-COOE TRAN~PORT
#SIMPL-1 NUCLEAR-CODE TRANSPORT
NsrMPL-2 NUCLEAR-COOF. TRANSPORT
!lSNG NUCLEAR-COOE TRANSPORT
fHRIP-l NUClEAR-CODE TRAN~PORT
#~UFT it NUCLEIIR-CODE TRANSPORT
IIRANCH NUCLEAR-CODE TRANSPORT
I/SAIL NUClEAR-COOl: TRANSPORT
#FORTRAN SfII6 NUCLEAR-CODE HAN!>PORT
IAL W/AUTO ERROR ANALYSIS
IfNUM SOLU OF ORDINARY DIFFERENT
#lESS-PHASE lA-NODE NU~'B[I\ING
OF COVARIANCE tJISPROP. SUBCLASS NUMBERS
IIANALYSIS
IS OF VARIANCE,DISPROP. SURCLA$$ NUMBERS
IIA~ALYS
RFCR~IIIIG OPERATIONS WITH COMPLEX NUMBF.RS
!lINTERP. SYS. FOR PE
ATES GFNERATOR
IIRANDQ,"I NUMflERS ANO RANOOr'l NORMAL DEVI
RMALLY DISTRIBLTEO PSEUDQ-RANOUM NUMBERS.
IINO
RMALLY DISTRIBUTED PSEUDO-RANDOM NU~BERS.
IINO
MBOLIC PROGRAM TAPE USING SERIAL NUMBERS..
II UPDATE SY
#B I NARY IN TEGEI{ TO ROMAN NU~ERAL COIIIVERS ION.
RRECH]R
IJNUM[RIC TAPE DUPLICATOR AND CO
PROCECURE FOR USING SUAP hlTH A NL:MERIC 650
#II
/lMUL TIPLE NUMERICAL INTEGRATION
OUHLE INTEGRAL
IINUMERICAl I~TEGRATION OF THE 0
INT PROCEDuRE
#NLMERICAL INT(GRATION BY MIDPO
AU Y SPACED POINTS
ItNUMERICAl INTi::GRAT[ON OF UlIIEQU
/I.E
f1FLOATING POINT NUNER.!CAL !NTEGRAT[ON SUBROUTI
NE
IIFLOATING POINT NUMI:RICAL INTE:GRATION SUBROUTI
POISSON AND HEAT flOW EOUATION
IfNlJMLRICAL SOLUTION Of LAPLACE
TIAL Et;UATIONS OF ORDER N
IINU.'-1EJ{ICAL SOLUTIO~J- OF DIFFEREN
S OIFFERFNrIAL EQUATlorJ
I/NUMERICAL SOLUTION OF LEGENDRF
IINY BOll TRANSITION
GROUT ..
ING ..
L SYSTEM
If FITS .. FOt.;RT[EN 0 ONE INPUT-OUTPUT TAPE CONTRO
/1704 SURGE OBJECT LOADER
DRS OF A MATRIX
#TO DeTAIN EIGENVALUES f: EIGENVECT
#MAKE SAP OCTAL
IIBINARY OCTAL CARU OR TAPE LOADER
R /THREE CA.RDSI.
IIOCTAL COt:t.rMN BINARY CARD LOADE
IIDCTAL CORRECTION CARD READER
IIOCTAL CORRECTION CARD RF.AOER
liON LINE OCTAL ~UMP
IIMURA OCTAL DUMP
IIMNI::MONIC OCTAL LOADER
#BINARY Ot:TAL LOAOER
RhO CARO BINARY AND OCTAL LOADER
IIi3INARY AND OCTAL LOADER
flIABSULUTE AND RELOCATABLE OCTAL LOADER.

IIF~~~~~ :~~g~:~~~~

22

a

gg~~

B 7090-NUCLEAR
Ii 7090-NUCLEAR
B 7090-NUCLFAR
B 7090-NUCLEAR
A 0650-08.2.02(,
B 0650-08.2.016
B 0650-08.2.012
B 0650-08.2.009
B 0650-08.2.011
B 0650-08.2.025
El 0650-08.2.007
B 0650-08.2.010
f:I 0650-08.2.02B
fI 0704-NUCLI::AR
B 0704-NUCLEAR
R 0704-NUCLEAR
B 7090-NUCLEAR
B 7090-NUCLEAR
0 70'10-NUCLEAR
B 70,}0-NUCLEAR
B 7090-NUCLEAR
H 7090-NUCL(AR
8 0 704-NUCLE AR
B 0704-NUCL[AR
0704-NUCLEAR
0704-NUCLEAR
o T04-NUCU:AR
0704-NUCU::AR
0704-NUCLEAR
0704-NUCLEAR
B 0704-NUCLEAR
B OT04-NUCLEAR
R

0704-~jUCLEAR

8 0704-NUCLEAR
B 0704-NUCLl:AR
R 0704-NUCLEAR
B 7090-!IIUCLEAR
B 0704-NUCLEAR
[l 0704-fWCLEAR
0704-NUCLEAR
0704-NUCLEAR
B 0704-NUCLEAR
8 0704-NUCl[AR
Ii Q704-NUCLEAR
B 0704-NUCLEAR
B 0704-NUCLEAR
[l 0704-NUCLEAR
8 0704-NUCLEAR
B 7090-NUCL(AR
B 709Q-NUCLEAR
B 7090-NU(LEAR
0704-NUCLEAR
0704-NUCLEAR
0704-NUCLEAR
0704-NUCLEAR
0704-NUCLEAR
0704-NUCl[AR
0704-NUCLEAR
e704-NUCLEAR
0704-NUCLEAR
7090-NUCLEAR
NORC-NUCLEAR
0704-NUCLEM
0704-NUCLEAR
0704-NUCLEAR
0704-NUCLEAR.
7090-NUCLEAR
7090-NUCUAR
7090-NUCLEAR
0704-NUCLEAR
0704-NUCLEAR
OT04-NUCLEAR
0704-NUCLEAR
0704-NUCLEAR
0704-NUCLEAR
0704-NUCLEAR
0704-NUCLEAR
El 0704-NUCLEAR
B 0704-NUCLEAR
!1 7090-NUCLEAR
B 7090-NUClEAR
[J 0650-04.0.012
e 0650-10.3.007
B 0650-06.0.0':>7
B 0650-06.0.058
Il 1620-02.0.001
tJ 7070-Il.LOOl
(l 0704-057BRWNU2
B 0704-057BRWN02
B 0709-1009WOSER
EI 0704-08 700RfW"~
A 1620--MI-016
B 0650-01.6.012
8 0650-04.0.002
H 0650-07.0.010
B 0704-1017ANDIO
F. 0701,-1l57TU900
Ii 0704-0525PKLAQ
1\ 0704-0525PKLEC
B 0650-04.0.010
B 06'>0-04.0.013
Ii 1401-11.0.002
0704-0216NYPLD

:~i~M~~i0 ~~~iE~P6~Mig~

~~~~=6~:~:6~~

B
B
B
B
B
B
B
B
[}

1401-01.4.011
0704-0871ECOLO
0650-05.2.025
0704-0513HESAK
0704-0690GDBOT
0704-0668~UCI3L
0704-0810MIOCT
C70/,-0830MIOCT
0704-0499CI-'OCO
0704-0251MUO[0
0704-027'tRS014
0704-0215NYBOL
0704-038111SAS5
0709-0951C;lA092
0704-062JELROL

DPI

fi.TRAP OCTAL MEMORY PRINT - /TRAP SCO
#OCTAL MEMORY PRINT OUT PROGRAM
IIDCTAL MNEMONIC flOATING POINT
NMURA READ OCTAL NUMBER ROUTINE
II OCTAL TAPE PRINT
RTRAN LOADER
liRE LOCATABLE OCTAL-COLUMN BINARY ON LINE FO
#
104 OCTAL-DECIMAL DUMP
"DECIMAL, OCTAL, BCD LOADER
NOEC1MAL, OCTAL, 8CD LOADER
#DECIMAL, OCTAL, 8CD LOADER
"DECIMAL, OCTAL, BCD LOADER
IIFORTRAN lION-LINE TO OFF-LINE INPUT MODIFYING SUBR..
NE
RGENERALI ZED, PAC KAGED, OFF-L I NE INPUT-OUTPUT SUBROUT I
•
IIFORTRAN I ION-LINE TO OFF-L INE OUTPUT ~ODIFYING SUBR
IFYING SUBR.
IIFORTRAN II OFF-LINE TO ON-LINE OUTPUT MOD
OR WITt' SOURCE LANG OEBUG
#OFFLINE EDIT FOR FORTRAN MONIT
TlCN..
gOFF SET CIRCLE PROBAAIliTY FUNC
LIC SUflROUTINE LOADER WITH FL.PT.OFL.
IIFN II BINARY SYMBO
#OHIO CUT AND fIll
D-COLU"'N BINARY CARD CONVERSION, ON-LINE
IISTANDARD-T
#ON-LINE BCD CARD READ ROUTINE
#READ BCD TAPE OR ON-LINE CARD READER
E
IIGENERALIZED,PACKAGED,ON-LINE INPUT-OUTPUT SUBROUTIN
BS. AND TSF. CARDS
KON-LINE LOADER FOR COL. BIN. A
#FORTRAN I I OFF"-LlNE TO ON-LINE OUTPUT MODIFYING SUBR ..
NON-LINE: STORAGE DUMP
IFYING SUBR.
HFORTRAN II ON-LINE TO OFF-LINE OUTPUT MOD
FYING SUBR.
IIFORTRAN lION-LINE TO OFF-LII'-lE INPUT MODI
MATHEMATICAL PROGRAMMING SYSTEM ONE
IlFORTRAN
T OF KILTER NETWORK FLOW ROUTINE ONE
#OU
ROUT"
#FACTOR. FOURTEEN a ONE AUTO CONT TEST OPTIMIZING
G ..
ilFAST • FOURTEEN 0 ONE AUTOMATED SYSTEM OF TESTIN
IIWRITES A FOURIER SERIES AS ONE BINARY RECORD ON TAPE.
IIABSOLUTE BINJl.RY UPPER LOADER ONE CARD
LOADER.
H ONE CARD ABSOLUTE I:l INARY UPPER
NONE CARD LOnER LOAD
HONE CARD TAPE COPY ROUTINE
#ONE CARD UPPER LOAD
.IIUNCLE 3 DIFFUSION EQUATION IN ONE DIMENSION NUCLEAR-COOE
SOLVER
fflULTI-MATERIAL ONE DIMENSIONAL HEAT EQUATION
R-CODE
/I LIL ABNER A FEW-GROUP ONE DIMENSIONAL PROGRAM NUCLEA
PUNCHES
IISKIPS ONE FILE ON A "DECIMAL TAPE ANI)
SYSTEM.
IIFITS • FOURTEEN 0 ONE INPUT-OUTPUT TAPE CONTROL
RATE OF RET-PV2A-FINITE CHAIN OF ONE INVESTM[NT
#PRES VAL#ITERATION, ONE OR TWO VARIABLES
liSPS ONE PASS FOR PAPER TAPE
/lONE PHASE MONITOR SYSTEM.
XTREMUtJ OF UNIMODAL FUNCTIONS OF ONE VARIABLE
liE
flBESSEL FUNC TlONS OF ORDER ONE.
IISIMULATJQN OF ONE-ARMED BANDIT .. CARD...
h'l620 SIMULATION OF A ONE-ARI",ED BANOIT .. TAPE.
IRE NUCLEAR-CODE GROUP DIFfUSION ONE-DIMENSIONAL
!IF
2,3 NUCLEAR-CODE GROUP DIFFUSION ONE-DIMENSIONAL
IIWA~OA
A-4 NUCLEAR-COllE
OOM NUCLEAR-COOE
ENT I'4UClEAR-CODE GROUP DIFFUSION ONE-DIMENSIONAL
IICOG
FOG NUCLEAR-CODE GROUP DIFFUSION aNt-DIMENSIONAL
fI
M-6 NUCLEAR-CODE GROUP DIFFUSION ONE-DIMENSIONAL
HAl
UP NUCLEAR-CCDE
II ONE-SPACE-DIMENSIONAL MULTIGRO
#ONE-TO-SEVEN CONV[RTER
MULTIWCRO KEYS. IWHOLE WORD KEYS ONLY/
IISORT, ALGEBRAIC.
IIPUNCHES A FOURIER SERIES ONTO BINARY RElOCATABLE CARDS.
PRE TO FLT PT REPRE
IIINT OP 4 CONII OF NO fROM FIX PT RI::
ORTRAN r::DIT DECK
#OPEN SUBROUTINE ADDITIONS TO F
C. KEY AND ITEr-' LENGTH - 1 WORO.-OPEN.
IISORT, ALGEBRA I
IISTRESS ANALYStS OF OPEN-WEB STRUCTURES
ATRIX.
IIOPERATE ON A REAL, SYMMETRIC M
#PROCESSOR OPERATING SYSTEM
ICOR FLOATING INTERP. COMPATIBLE OPERATION ROUTINE
IIFL
UTINE NOSIR
tlNINE OPERATION SPLIT INSTRUCTION RO
RElIVE SYSTEM
IICOMPLEX ARJTH OPERATIONS IN BElL LAR. INTERP
11709 PROGRAM FOR CHECKING OPERATIONS NEEDING TRANSLATING
IIUNIT OPERATIONS SIMULATOR
IIINTERP. SYS. FOR PERFORMING OPERATIONS WITH COMPLEX NUMBER
#TAPI: OPERATOR PROGRAM ITOPI
II CORBIE, AUTOMATIC OPERATOR SYSTEM
#GS El, HCTR, L INK, MOVE, OPHL T, SEC(;K, SIGN, STR I P, VMC TR
liGEN. TRA ROUTINE PROG TAPE aPR TAPE lBLr.TRAJLER CKN
"OPTICAL RAY TRACING
IISOAP-TYPE OPTIMAL ASSEMBLY PROGRAM STRAP
4000
HSOAP TYPE OPTIMAL ASSH1BLY PROGRAM STRAP
117070 GENERATIONS OF 1401 OPTIMIZED PROGRAMS it GOOP.
IIflOATING POINT OPTIMIlED RUNGE KUTTA
ION.
IIFLOATING POINT OPTIMIZED RUNGE-KUTTA INTEGRAT
12F6.0
1I0PTIMlLEO TAPE READ FOR FORMAT
IIOPTIMIZING PROGRAM
• FOURTEEN 0 ONE AUTO CON-T TEST OPTIMIZING ROUT.
/tFACTOR
/IAN AUTOMATIC METHOD OF OPTIMUM PROGRAMMING
1I0PTIMUM SEPARATOR PRESSURE
nSTR08IC-SKEllY TR. ROUT. wITH OPTION BRE.TRANSf:INO. ADD. CONY
NE, RUNGE-KUTTA INTEGRAT. OF 2ND ORO. EC.
IIFLOAT. PT. MIL
FUNCTIONS FOR RICAL ARGUMENT AND ORDER
/I
BESSEl
BROUTINE
IISECONU OROER DIFFERENTIAL EOUATION SU
TEGRATION OF SPECIAL FORM CF 2ND ORDE.R EQU.
/lIN
ION OF DIFFERENTIAL EQUATIONS OF ORDER N
I!'NUMERICAL SOLUT
IIBESSEL FUNCTIONS OF ORDER ONE.
#SECONO,THIROyAND F-OURTH ORDER RUNGE-KUTTA INTEGRATION
#BESSEL FUNCTIONS OF ORDER ZERO.
FUNCTION OF COlo'PLEX ARGUMENT AND ORDER.
/I
BESSEl
B K TIMES Z OR I
HALL ORDERS OF BESSEl FUNCTION J SU
Y SUB K TI"'ES Z
HALL ORDERS OF THE BESSEl FUNCTIONS
IRUNGE-KUTTA/
HORDINARY DIFf. EQUNS .. SOLUTION
HINTER SUBROU FOR SOLU OF ORDINARY DIFFERENTIAL EQUATION
RROR ANALYSIS
IINUM SOLU OF ORDINARY DIFFERENTIAL W/AUTO E
S SYSTH'
IIFLOATING POINT ORDINARY DIFFERENTIAL I::CUATION
S SYSTEM
IIFlOATING POINT ORDINARY DIFFERENTIAL EQUATION
IINORMAL PROBABILITY - ORDINATE AND AREA
#SMCOTHED ORDINATE ANI) D£:RIVATIVE
BRIDGE
RJo10MENT REACT INFlU LINE ORDINAl!: FROM CONTINUOS GIRD.
OGRAM
IIBPR REVISION OF OREGON HORIZONTAL ALIGNMENT PR
RFILE ORGANIZATION ROUTINES
IM\JLATING THE CARD 650 ON A TAPE ORIENTED 7070
liS
ARES CURVE-FITTING ROUTINE USING ORTHOGONAL
IILEAST SQU
LEAST SQUARES CURVE "FITTING WITH ORTHOGONAL POLYNOMIALS
/I
HER
IIORTHOGONAL POLYNOMIAL CURVE FI
#GENERAL ORTHONORMAliZING SUBROUTINE.
#TRANSLATOR AND OTHER FORMATS TO SOAP RElOKS
lila ASSIGN TAPE UIIIIT USAGE OTHER THAN THAT WHICH IS
#TWElVE UTILITY PROGRAMS OUTLINEO IN 305 BULLETIN NO.1
RELATION ANALYSIS \0-09.5.004
e 0704-0224ASASI
B 1620-09.6.001
B 1620-09.6~002
e 0650-09.8.002
B 0704-0,)00NUFRE
B 0650-09.2.001
B 0650-06.0.051
8 7010-04.4.00'3
B 0704-0432MUR10

n

25

BMURA REFLECTIVE 104
DETER. OF VElOCITY FUNCTION FOR REFRACT. TID DATA
fllEAST SQ.
IilRElOCATABLE TO REGIONAL SOAP I I
TROPY IN LIQUID SUPERHEAT OR WET REGIONS
IENTHAlPY OR EN
IISIMUlATlON OF AN INDEXING REGISTER IN SIR
* FIRSHFlOATlNC' PT. AND INDEXING REGISTER SIMULATOR WITH TRACE
ROUTINE FOR 650 SYSTEM INDEXING REGISTERS
6SYM TRACING
NSTEPWISE REGRESSION
SIS PROGRAM.
'MULTIPLE REGRESSION!:. CORRElATION ANALY
IISTEPWISE MULTIPLE LINEAR REGRESSION Il CARD.
"STEPWISE MULTIPLE LINEAR REGRESSION .. TAPE *
NMULTIPLE REGRESSION ANALYSIS
'MULTIPLE REGRESSION ANALYSIS
IIRAP-A REGRESSION ANALYSIS PROGRAM
AP RAPA TRAP
"MULTIPLE REGRESSION ANALYSIS PROGRAMS R
#MULTIPLE REGRESSION ANALYSIS
TAPE.
IIREGRESSION ANALYSIS PROGRAM.
CARD.
NREGRESSION ANALYSIS PROGRAM.
'SCRAP
SIXTEEN-TWENTY CARD REGRESSION ANALYSIS PROGRAM ..
"STRAP * STEPWISE REGRESSION ANALYSIS PROGRAM.
RATION
flREGRESSION ANALYSIS OATA PREPA
1010 'STEPWISE MULTIPLE LINEAR REGRESSION ANALYSIS ON THE IBM
flCORRElATION AND REGRESSION ANALYSJS,
IH070 STEPWISE MULTIPLE REGRESSION ANALYSIS, MRI
AM.
fl'MULTlPLE REGRESSION BACK SOLUT[ON PROGR
HOD
NMULTIPLE LINEAR REGRESSION BY THE STEPWISE MET
NlNPUT EDITOR FOR MULTIPLE REGRESSION CODE SCRAP.
flSTEPWISE MULTIPLE REGRESSION PROCEDURE
ERENTIAL EQNS.
/;INON-L1NEAR REGRESSION PROCEDURE WITH DIFF
flESSO STEPWISE REGRESSION PROGRAM
NCARP-A CONElATlON Co REGRESSION PROGRAM
,MAIN REGRESSION PROGRAM
FORMATIONS
IISTEPwtSE MULT. REGRESSION WITH VARIABLE TRANS
tlfI,(O VARIAOLE LINEAR REGRESSION!:.CORRELATION
YSIS
flMULTIPLE REGRESSION, COMPREHENSIVE ANAL
'MULTIPLE CORRElATIONS AND REGRESSIONS ANALYSIS
IRCULAR AND HYPERBOLIC FUNCTIONS REGULAR BESSEL FUNCTIONS
NC
IIDE RElATIVIlE PROGRAM
flRELATIVIZE SYMBOLIC DECK
nWO-DI~ENSIONAL MESH FOR RELAXATION CALCULATIONS.
PROGRAM FOR THE GAUSS-SOUTHWElL RELAXATION METHOD
IlA
;N RECTANGULAR COORDINATES
/;IRELAXATION PROG LAPLACES EQUAT
IN CYLINDRICAL COORDINATE SYS
IIRElAXATlON PROG LAPLACES EQUA
IN RECTANGULAR COCRDINATES
HRElAXATION PROG POISSONS [QUAT
NMULTI-PURPOSE ESTJ.'>1ATION FOR RElIABILITY STUDIES
"MEMORY DUMP AND RELOAD ROUTINE
RRElOCATABLE BINARY LOADER
CAROl
#MURA UPPER RELOCATABLE BINARY lOADER lONE
#RElOCATABLE BINARY LOADER
HES A FOURIER SERIE'S ONTO BINARY RElOCATA8LE CARDS.
"PUNC
fliRElOCATABLE FORTRAN BSS LOADER
IIABSOLUTE AND RElOCATABLE OCTAL LOADER.
ON LINE FORTRAN LOADER
/;IRElOCATABLE OCTAL-COLUMN BIHAR
#RELOCATABLE TO REGIONAL SOAP I
IIRElOCATING BINARY LOADER,lOWER
/lRElDCAT ING BINARY LOADER, UPPE
IiRElOCATING BINARY LOADER, LOWER
flRELOCATING BINARY LOADER,UPPER
NRELOCATING LOADER
IIRElOCON
SLATOR AND OTHER FORMATS 'TO SOAP RElOKS
IITRAN
ON n~O-OIMENSIONAL
flREM N~CLEAR-CODE GROUP DIFFUSI
RIDE If SUBROUTINE FOR TRANS FROM REMING TO IBM DATA ECU *
NST
HMATRIX HEADING REMOVAL
!tRENT OR I3UY ANALYSIS
S OF VARIANCE FOR PART. OR SING. REPLICATED KBY
flANAlYSt
G
IIKWIC REPORT FOR PRINTING OR PUNCHIN
IIPRINT CONTROL FOR REPORT GENERATION
/1405 DISK. SEE 1410-PR-I08.
fiRE PORT PRO .. GENERAT. CARD/TAPE
6FARGO REPORT PROGRAM
NREPORT PROGRAM GENERATOR RPG
UTOCOOER ASSEMBLY
fiGARO REPORT PROGRAM GENERATOR AND II
UTOCODER ASSEMBLY
HAPE REPORT PROGRAM GENERATOR AND A
NREPORT PROGRAM GENERATOR
101Q-PR-0 75*
fiRE POR T PROGRAM GENE RA TOR .SEE
F NO FROM FIX PT REPRE TO FlT PT REPRE
UNT OP 4 CONY 0
/lINT OP 4 CONY OF NO FROM FIX PT REPRE TO FLT PT REPRE
FOURIER HALF-SERIES IN CANONICAL REPRESENTATION
IIGIVEN A
ES A FOURlER SERIES IN CANONICAL REPRESENTATION
IfINTEGRAT
RIES.
IIEXPANDS THE REPRESENTATION OF A FOURIER SE
CH A FOURI.ER SERIES IN CANONICAL REPRESENTATION.
IISEAR
TS A FOURIER SERIES IN CANONICAL REPRESENTATION.
flCONVER
T • RGCP If
flREPROOUCE, GANG PUNCH AND PRIN
GRAM FOR THE JBM 1401
!ICARD REPRODUCING AND lOR LISTING PRO
ORTRAN WRITE-UP OF RW REQX .. SPACE REQUIRED-122 CELLS
flF
IIFORTRAN WRITE-UP OF Rw REQX.SPACE REQUIRED-122 CELLS
#THE CORNElL RESEARCH SIMULATOR
ICAL DRUfo'S
II RESf.T AND CLEAR CORE AND N LOG
"'SELF-LOADING DRUM RESET PROGRAM
RAVITY
#RESIDUALS AND DERIVATIVES UF G
IICORRELATIONAL RESIDUE COMPUTATION..
"CRITICAL PATH AND RESOURCE SUMMARY CALCULATION
IIRESTART PROGRAM FOR MD SORT
EDITOR IRL 0400/
liRE START PROGRAM FOR THE [UNARY
NVESTMENT
IIPRES VAL-RATE OF RET-PV2A-FINITE CHAIN OF ONE I
fiAUTOMATIC INFORMATION RETRIEVAL PROGRAM
ACH. II'PRESENT VALt;E AND RATE OF RETUR~ .. PVIA • • INF. CHAIN r.'
TER
IICALCULATIO,,",S OF RATE OF RETURN USING THE IB,"\ 650 COMPU
SYS REVISED BELL LAB TAPE SY~
/;IREvtSEO BeLL LAB INTERPRETIVE
EVISED BElL LAB INTERPRETIVE SYS REVISED BELL LAI3 TAPE SYS
#R
AOJUSTfJENT COMPUTATION
/lREvISED TRAVERSE AND TR.AVERSE
L ALIGNMENT
IIREVISED TRAV[R~[ AND HORIlONTA
RAt FREEWAY ASSIGNr-'ENT. STOCKTON REvISION
ItGENE
SPS TO FORTRAN SUBROUTINE EDIT Il REVISION"
fI
MCS REVISION OF GL OUT2
ALIGNMENT PROGRAM
IIBPR REVISION OF OREGON HORIZONTAL
1IREWIND TAPES
£PRODUCE, GANG PUNCH AND PRINT .. RGCP ..
1IR
NCHNESE BAR AND RING PUZZLE. TAPE
HROAD DESIGN PROGRAM
PATH BET. lONE CENTROIDS OVER A ROAD NETWOR.K
RTRACING A MIN.
NROAOWAY TEMPLATE GENERATOR
I,IRDCKET NOZllE PROGRAM
#SUCKER ROO PUMP DESIGN
!lROD READING CONVERSION PROGRAM
IIBINARY INTEGER TO ROMAN NUMERAL CONVERsrON.
i,lSQUARE ROOT
NCUBE ROOT
IlCO"lPU:X NTH ROOT
II'~URA FIXED POINT CUBE ROOT

26

B
B
B
B
B
B
B
B
B
B
B
B
B
8
8
B
B
B
B
a
a
a
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
8
B
A
A
A
B
0
A
A
B
B
B
B
II
13
B
B
B
B
13
B
B
fl
B

13
[l

B
B
[}
13
B
B
B
B
II
0
[)
B
B
B
C
B
B
B
a
tI
G
B
B
~

A
0
[)
B

0104-0253MU704
0650-09.6.020
0650-01.6.034
1090-1095WHSSI
0650-02.0.016
0650-01.6.050
0650-01 .. 4 .. 007
0105-E2-003-0
0104-0749SCRAP
1620-06.0.007
1620-06.0.006
0650-06 .. 0.046
0650-06.0.001
0650-06.0.018
0650-06.0.030
0650-06.0.031
1620-06.0.001
1620-06.0.002
1620-06 .. 0.003
1620-06.0.004
1620-01.6.00,1
7070-11.3.006
0104-01B2PFCR3
7070-11.3.001
0104-0149scaop
1070-11.3.002
0104-0749SCIEM
0104-0411ERMPR
0104-1119ERNLR
0650-06.0.056
0650-06.0.064
0104-0B22TVREM
109O-1194ERMPR
0650-06.0.054
0104-0915TVHRC
0704-0411PFCR1
0650-03.2.001
0704-0230R5012
0104-0116CLREL
0704-072SPKMER
06S0-09.6 .. 014
0650-04.0.007
06S0-04.0.008
0650-04.0.009
0704-1058WLREL
0650-01.3.008
0704-0467BECS8
0704-0432MURBL
0109-0563SE9RB
0104-078B18PUF
0104-0909MPBSS
0104-0623ELROL
0104-0912ASASa
0650-01.6.034
0704-0S25PKCS6
0104-0525PKCSB
0109-0S63SE1LR
0709-D563SE9UR
1620-01.2.002
0650-01 .. 6.025
0650-01.6.048
0704-NUCLEAR
1401-01.4.013
0104-0085CLMBH
0650-10.1.001
06S0-06.0.063
C104-0913NCKRF
0709-1038RWPCK
1410--KG-910
1401--RG-045
1401--RG-048
]401-01.3 .. 001
1401-01..3.002
1410--RG-103
1070--RG-902
0650-01.6 .. 017
0650-01.6 .. 017
0104-01881BGFL
0104-07881BIFS
0704-0788IBERF
0704-0788IBSFS
0704-07881BWFS
1'+01-13.1.009
]401-01.4 .. 003
0109-0946RWF[Q
0709-0946RWF[Q
0650-10.2.001
070 t l-0443LL024
0104-0376UAlDR
0650-09.6.000
0704-0405PFCR2
1090-llS80RCPS
0709-1160MDSRS
0709-1032RL04I
06')0-07.0.018
0650-12.0.007
0650-01.0.017
0650-09.6.011
06S0-02.0.015
0650-02.0.015
06S0-09 .. 2.015
0650-09.2.084
0650-09.2.079
1620-01.6.009
0704-0204GSOUT
0650-09.2.0S3
0704-0223ClMRT
]401-13.1.009
1620-11.0.003
0650-09.2.029
06S0-09 .. 2.080
0650-09.2.018
0704-1156LRRON
0650-09 .. 6 .. 001
0650-09.2 .. 028
07Q4-08700RROM
0650--LM-006
0650-03.1.001
0704-0354NA61.
0704-0314~UCRT

lING-POINT DOUBLE-PRECISION CUBE
NG-POINT DOUBLE-PRECISION SQUARE
nRIPLE PRECISION SQUARE
'TRIPLE PRECISION COMPLEX SQUARE
1H620 FIX POINT SQUARE
#FIXED POINT SQUARE

ROOT
IIFLOA
ROOT
IIFlOATI
ROOT
ROOT
ROOT
ROOT .. CLOSED. SUBROUTINE
fROOT AND GAIN lOCUS
.DETERMINANT EVALU,ATIeN AND ROOT EXTRACTION
IIPOLYNOMIAL ROOT EXTRACTION * TIREX •
MDOU8LE PRECISION POLYNOMIAL ROOT EXTRACTION PROGRAM
'GENERAL ROOT FINDER FORTRAN SUBROUTINE
NPOLYNOMIAL ROOT FINDER ROUTINES
flROOT FINDING SUBROUTINE
'NTH ROOT FIXEU POINT SUBROUTINE
'NTH ROOT flOATING POINT SUBROUTINE
PRETA.BLfr-OOUBLE PRECISION SQUARE ROOT INSTRUCTION
'INTER
If-NTH ROOT OF X
,MURA FIXED POINT SQUARE ROOT ROUTINE
',.,URA FIXED POINT SQUARE ROOT ROUTINE
liN ROOT ROUTINE
liIOOUBLE ~RECISION SQUARE ROOT ROUTINE
.FLOATING POINT SQUARE ROOT SUBROUTINE
.. SQUARE ROOT SUBROUTINE
HSQUARE ROOT SUBROUTINE
fHLOATING POINT SQUARE ROOT SUBROUTINE
'FLOATING POINT NTH ROOT SUBROUTINE
NCUBE ROOT SUBROUTINE
§.FLOATING POINT SQUARE ROOT SUBROUTINE
nSQUARE ROOT SUBROUTINE
It-VARIABLE FIElD SQUARE ROOT SUBROUTINE
nSQUARE ROOT SUBROUTINE
IISQUARE ROOT SUBROUTINE
flSQUARE ROOT SUBROUTINE
tiS QUARE ROOT SUBROUTINE
tlROOT TRACING
IARCSIN X, ARCCOS X, SQUARE ROOT X
NCUBE ROOT X
tlSQUARE ROOT X
II~URA flOATING POINT CUBE ROOT.
(NARY ARITH
NNORMALIZED SQ.ROOT-EXTENDED RANGE FlOATING B
DIFIED NEWTON-RAPHSON POLYNOMIAL ROOT-FINDER
NA 1'10
ilSQUARE ROOT, FLOATING POINT
IISQUARE ROOT, FLOATING POINT.
IISQUARE ROOT, FlOATING POINT 109 ONLY
IISQUARE ROOT, flOATING-POINT
/;ISQUARE ROOT, flOATING-POINT, FORTRAN
LIB. VERSION
NSQUARE ROOT, TOPLER METHOD
tlCHARACTERlSTlC ROOTS AND vECTORS
#LATENT ROOTS AND VECTORS OF A MATRIX
NMOLE,C.ULAR SPECTROSCOPY LATENT ROOTS AND VECTORS OF A MATRIX
NROOTS OF A FUNCTION OF A REAL
VARIABLE
IIREAL ROOTS OF A REAL POLYNOMIAL USI
NG INTERVAL ARITH.
HREAL ROOTS OF A REAL POLYNOMIAL USI
NG INTERVAL ARITH.
IIROOTS OF POL YNDMIAL WITH REAL
COEFFICIENTS
IINEWTONS METHOD FOR FIND ING ROOTS OF POL YNOMI AL S
IISTRAIN ROSETTE DATA REDUCTION
liTO ROTATE A GIVEN VECTOR X FROM T
HE EQU INOX OF
NEQUATOR-ECLIPTIC ROTATION
IINOR"'AlI lED VAR I MAX FAC TOR ROT A TI ON
I#PATERN QUARTIMAX ROTATION OF A FACTOR MATRIX
IIEQUATOR-ECLI PTI C ROT A TI ON-ROTATE A G I YEN VEC TOR
FLOATING POINT SOAP INTERPRETIVE ROU
IIOOPSIR DOUBLE PRECISION
a ONE AUTO CONT TEST OPTIMIlING ROUT.
flFACTOR • FOURTEEN
• ADO. CONV
flSTROBIC-SKElLY TR. ROUT. WITH OPTION BRCTRANSt.IND
IICORE PRINTOUT ROUTINE-VARIABLE
IITIME SERIES ROUTING
NROW BINARY CARD 'lOADER
NROW BINARY DISASSEMBLY PROGRAM
11709 SELF LOADING ROw BINARY TO COLUMN BINARY CO
NVERTER
11704 ROW BINARY TO COLUMN BINARY CO
NYERSION.
/1104 ROW BINARY TO 709 COLUMN BINAR
Y CQNVERSIOIII.
11709 FOUR CARD ROW BINARY-OCTAL UPPER CARD LO
ADER
#STORE ROw MATRICES INTO A LARGE MATR
IX
NAOSOLUTE ROW OR COLUMN BINARY CARD PUNC
NCARD TO TAPE SIMULATOR ANU ROW TO COLUMN CONVERTER.
IINOR~ALlZE I'!ATRIX BY ROWS
N~ATRIX INTERCHMGE OF ROWS AND COLUMNS
IIREPORT PROGRAM GENERATOR RPG
BASIC FORTRAN If
NRSTR • FUNCTION SUBROUTINE FOR
NINTEGRAL EVAL., SI~PSONS RULE IEQU. INTERV .. I
II]NTEGRAL EVAL .. , TRAPEl. RULE I[QU. INTERVALSI
N
#SI}'PSON'S RULE flOATING-POINT INTEGRATtO
MENT SCHEDULE
HI~,.EAR DECISION RULE FOR PRODUCTION AND EMPLOY
LSI
liN-STRIP TRAPElOIDAL RULE INTEGRATIONIEQUAl INTERVA
ItFLOATlNG POINT OPTIMIZED RUNGE KUTTA
flr.t:URA FIXED POINT RUNGE-KUTTA
NA MORI:: ACCURATE RU.%E-KUTTA
#t'URA FIXED POINT RUNGE-KUTTA
#MURA flOATING POINT RLNGE-KUTTA
#SECO~IJ,THIRO,ANO FOURTH ORDER RUNGf:-KUTTA INTEGRATION
II'FlOATING PT. COWELL 12NO SUMI, RUNGE-KUTTA INTEGRATION
IIFLOATING POI"lT ADAMS-MOULTON, RUNGE-KUTTA INTEGRATION
RD. EQ.
tlFLOAT. PT. I"ILNE, RUtIIG[-KUTTA INTEGRAT. OF 2ND 0
/lFLOATING PUINT Gill METHOU FOR RUNGE-KUTTA INTEGRATION
IIOBL. PREC. flOATING PT. ~IlN[, RUNGE-KUTTA INTEGRATIONHOBL. PREC. FLOATI~G PT .. RUNGE-KL:TTA INT[GHATION OF
flFLOATING POINT OPTIMIZED RUNG[-KUTTA HJTEG~ATION.
flFORTRAN FLOATING POINT RUNGE-KUTTA INT[GRATION.
G DIFFERENTIAL EQUATION ON 650 ,iiRUNGE-KUTTA ROUTINE FOR SOLVIN
LS
#FORTRAN WRITE-UP OF R~ REQX.SPAC!: REQUIRED-122 CEl
111090 S-PROGRA~
E wITH A TAPEREO HUB. CARO"
tlS-1 00 STRESS ANALYSIS OF FlANG
NGED TAPERED Ht;fj • CARD.
IIS-109 STRESS ANALYSIS OF A FlA
flSAIL r~UCLEAR-CODE TRANSPORT
#TAPE PROGRAM FINCER,WRITt:R,AND SALvAC;E
/lPACT lA SAMPLE PROGRAr-'
STIMJiTICN FROM DOUBLY TRUNCATION SAMPLES
liE
tlSAN DIEGO FRHWAY ASSI~NMENT
AUTOMATIC CODER, C-DMPATIBLE WITH SAP
II
POINT H·,AP ROUTINE
704 FORTRAN SAP COOED.
NFLOATING
/lARCTAN AlB, FORTRAN I I vtRSION,SAP COOED.
IIMAKE SAP OCTAL
/IAN EDITOR FOR SAP SVt-'lBOLIC DECKS.
tlENTHALPY OF SATURATED lIQUID
HPRESSURE OF SATURATED LIQUID
NENTROPY OF SATURATED LIQUID
II'TEMPERATURE OF SATURATED UC:UID
#sr;:CIFIC VOLUME OF SATURATED LIQUID
IlTEMPERATuaE OF SATURATED LIQUID FROM I:NTHALPY
HALPY ENTROPY SPECIFIC VOLUME UF SATURATED VAPOI{
RENT

B 0704-0SZ5PKCBR
B 0104-0525PKSQR
8 0104-0481CA003
B 0704-0565CA005
B 1620-01.0.003
B 1620-03.0.002
B 0650-09.8.001
B 0704-0514NA029
B 1010-09.1.001
B 0709-1215AQE13
B 0704-063SRWGRT
B 1090-1124MLHPR
B 065·0-01.0 .. 004
A 065Q--LM-001
A 0650--LM-009
B 0704-038SBSSQR
B 1010-08.3.003
8 0104-0283MUSQR
8- 0104-0263MUSQR
B 0104-0690GONRT
B 1070-08.3.006
B 0650-01.0.011
B 0650-03.1.001
B 0650-03.1.002
A 0650--LM-OIO
B 0104-0S25PKkOO
B 0704-093IPKCBR
B 0709-06191SSQR
D 1401-03.0.003
B 1620-03.0.001
8· 1010-08.3.007
B 1010-08.3.008
B 1010-08.3.009
B 1070-08 .. 3.010
B 1090-1169RCRTR
B 0650-03.1.0Z8
B 0650-03 ...1.029
R 1070-08.3.001
0 0104-0280MUCRT
a 0704-0310RS013
B 0104-0568ELQRC
B 07D4-0641CSSOT
B 0104-0653CSSQT
0 0109-0485MISRT
B 0104-0399MISRT
B 0104-0399MISRT
B 1070-08.3.002
13 0704-0148NYCRV
B 0650-Q5.2 .. 016
B 0650-05.2.024
0 0650-01.0.002
B 0104-0880IBRRP
B 0104-08BOIBRRP
B 07Q9-0921MAPOL
B 0104-011 OGLROP
B 0650-09.5.004
B 0109-0945RWREC
B 0109-0954RWFOO
B 7010-11.3. 008
B 0650-05.1.001
B 0709-0953RWROB
B 0650-02.0.010
B 1401-01.4.007
B 1620-01.4.004
B 1401-01.4 .. 017
B 010S-£2-002-0
B 0709-1034SCCSO
B 0104-0784GERDS
B 0109-0808GDRCC.
B 0709-0951NA901
B 0709-0951NA901
R 0709-0819GOBOC
R 0704-0223CLMST
B 0104-04SSBESCB
[} 0704-10130RCTT
B 0704-0236ClMNR
B 0104-0085CLMIN
A 1401--RG-048
B 1010-01 .. 9.001
B 0704-0116CllNT
B 0104-0116CLINT
B 0709-0982RWS12
B 0650-10.3.001
B 0704-0931PKMTl
B 0704-1147ECRKO
B 0104-08911~URKY
B 0104-0414GLMAR
8 0104-0280MURKY
B 0704-0314~URKY
0 0104-1233AAItH
B 0704-0715RWDE6
B 0704-0450RWDl:;2
B 0104-04S0RWDE3
B 07Q4-0491RWD(4
B 0704-0610R.wOE3
B 0704-0610Rl'iD(2
B Q709-1l70ATRKS
D 0109-1111ATRKS
II 0650-01.0 .. 005
£l 0709-0946RWF!tQ
A 1090--10-0,}~
B 1620-09.7.004
B 1620-09.7 .. 005
B 1090-NUCLEAR
B 06S0-01.5.011
B 0704-C316NA2~9
B 0704-087aBE~ISD
B 0650-09.2 .. 043
6 0704-1220NSABC
B 0104-1071NUH~1
B 0704":0603WH005
B 0704-0'5130ESAK.
B 0104-0960MI[DS
B 70'J0-I095nHHSl
B 7D90-109SWHPSL
B 7090-1095WHSSL
B 7090-109SWHT~.l
B 7090-10'J5wHVSL
B 1090-1095WHTSH
B 7090-1095WHH5V

tlSAVE MEMORY SORT S"-PH3
SAVER
SAVES THE CONSOLE IAC,MQ, IRA, I
SAVES THE CONSOLE /AC,MQ, IRA, 1
SCALAR MULTIPLICATION
SCALE MATRIX INVERSION
SCALING
SCALING
117070 SCAN
o TAPE-CARD READING FOR MULTIPLE SCAN.
'IBC
II'FORTRANSIT SCANNING ROUTINE
"PUNCH A SCAT OECK
tlPART[CLE SCATTERING
tl6K _ LEAST COST ESTI~ATING AND SCHUl.
111401 LESS 8K,12K
AST COST ESTIMATING SCHEDULING. SCHED PORTIONNlESS _ CARD. LE
LE FOR PRODUCTION AND EMPLOYMENT SCHEDULE
IILINEAR DECISION RU
IICOMPLETE PAIRED COMPARISONS SCHEDULE. PAIlCOPLET-2-21.
tlGENERAL AMORTIZATION SCHEDULE PROGRAM
S 4K • LEAST COST ESTIMATING ANO SCHEOULING
1/11,01 LES
S - CARD. LEAST COST ESTl"'ATlNG SCHEDULING. SCHEO PORTIONIlLES
N _/ILESS • LEAST COST ESTIMATING SCHEDULING. SCHEDUliNG PORTIO
AST COST ESTIMATING SCHEDULING. SCHEOULING PORTION -"lESS • LE
IT fUNCTIONS
tlSCHEDUlING WITH ARBITRARY PROf
ESS F. DACKER NlEAST COST EST. (, SCHEDULING-SCHED .. PHASE ONLY L
RA,..-VARIABLE FORMAT
~SCHENEC.TADY D[CIMAL INPUT PROG
IISOLUT ION OF
RADIAL SCHRODINGER EQUATION
TH FlOATING POINT _
IISCION • SCIENTIFIC 1401 PROGRAMMING WI
MMING WITH FLOATING POINT.
NSCION - SCIENTIFIC. 1401 PROGRA
NSCOOP t AND II
IHRAP OCTAL MEMORY PRINT - ITRAP SCOOP/
IISCOPE GR to PLOTTER
IISCQPE GRID PLOTTER
SIMULATOR
111401 SCRAMBLE PERIPHERAL EQUIPMENT
GRESS ION ANALystS PROGRAM
IISCRAP • SIXTEEN-TWENTY CARD RE
TOR FOR,MULTIPLE REGRESSION CODE SCRAP.
ItINPUT EDI
IICOMPUTATION OF BRIDGE SCREED ElEVATIONS
PRCGRAI-IMING SYSTEM - SUCESSOR TO SCROL
/I 7090 LINEAR
IIlP/90 TO SCROL 701. INPUT CONVERTER
IISORT 80 UNDER SCS 80
IISCS BO SUPERVISOR CONTROL
VERSION.
liSD 1402 • SEARCH PROGRAM-CARD
/lFLOATING POINT
UNIVARIATE SEARCH
IIFLOATING POINT BIVARIATE SEARCH
!lEND-OF-FILE SEARCH
IIBINARY TABLE SEARCH
ONICAL REPRESENTATION.
NSEARCH A FOURIER SERIES IN CAN
NE
#KEYS SEARCH BCD
LISTING TAPE ROUTI
.SEARCH MASTER PROGRAM TAPE
NSD 1402 • SEARCH PROGRAM-CARD VERSION.
/HABLE SEARCH ROUTINE
N~URA EFFECTIVE ADDRESS SEARCH ROUTINE
UBINARY SEARCH ROUTINE NA 839
#FORTRAN END CARD SEARCH.
tlBINARY SEARCH, FORTRAN
NSEASONAL ADJUSTMENT OF ECONOMI
C TIME SERIES
"CALCULATION OF SEASONAL ADJUSTMENTS
IIPROGRAM TO CALCULATE SEASONALLY ADJUSTED INDICES
TION SUBROUTINE
'SECOND ORDER DIFFERENTIAL EQUA
NKWIC SORT PROGRAM SECOND PART
OSE
NVIPP MERGER .. SECON~ PHASE OF A GENERAL PURP
RUNGE-KUllA INTEGRATION
/lSECOND,THIRO,AND FOURTH ORDER
EAR-CODE
II LOST A CROSS SECTION AVERAGING PROGRAM NUCL
1Il0HRSB
SEE 0705-10-047
"GET/PUT
SEE 0705-10--047 •
/lSYSTEM SUPERVISOR. SEE 1410-PR-I0B •
IIAUTOCODER
SEE 1410-PR-I0e •
flOCS CARDITAPE - SEE 1410-PR-I0B •
IIIOCS 1405 DISK· SEE 1410-PR-I0B
• GENERAT. CAROITAPEIl405 DISK
SEE 1410-PR-I0B.
UREPORT PRO
NCOBOL
SEE 7010-PR-075
RVAL VELOCITY - CVL •
tlSEISMOGRAM SYN FORM CONT. INTE
#TIME DOMAIN FILTERING OF SEISMOGRAMS
SE NEW ENG ELEC SYS PROG 18
IISElEC ECON. CONO. SIZE-SPEC CA
IISOS PROGRAM LOADER .. CALLS IN A SELECTED SOS PROGRAM
LYNOMIAL
HITTING TO SELECTED TERMS OF A GENERAL PO
NECONOMIC CONDUCTOR SIZE SElECTION BY KelVINS LAW
INE
tlSELECTI'IE FILE: OUPL ICATOR ROUT
11704 SELECTIVE MONITOR TRACE SYSTEM
N704 SElECTIVE MONITOR TRACE:.
NSELECTIVE PROGRAM TRACE.
#SELECTIVE PROGRAM TRACE.
NSElECTIVE TAPE PRINT
NSElECTlVE TRACE
NSELECTIVE TRACE
IISELECTIVE TRACING ROUTINE
PUT DATA.
IISElECTOR OF COMBINATIONS OF IN
NSELF DEMONSTRATOR
UMN BINARY CONVERTER
tl709 SELF LOAOING RO .... I3INARY TO COL
INE
#SELF LOADING TAPE .... RITING ROUT
INE
flSELF LOADING TAPE .... RITING ROUT
M.
IISELF LOADING TAPE .... Rl T1:: PROGRA
IIMOOULUS 11 SElF-CHECKING DICIT CALCULATOR
TOR
IISElF-CHECKING LOAU DECK GENERA
R LOADER
flSELF-LOADlNG BINARY-OCTAL LO .... E
M
IISELF-LOADING DRUM RESET PROGRA
IIFORTRAN I I AND/OR FORTRAN I TO SElF-LOAOING TAPE 1
HOEC l .... AL OUTPUT PROGRAM UNDER SENSE LIGHT CONTROL
HINPUT PROGRAM UNDER SENSE LIGHT CONTROL
# INPUT PROGRAM UNDER SENSE LIGHT CONTRUL
fmECI .... AL OUTPUT PROGRAM UNDER SENSE LIGHT CONTRUL
ISET SENSE LIGHTS
NINPUT PROGRAM UNDER SENSE SWITCH CONTROL
IIOPTIMUH SEPARATOR PRESSURE
/lG SEL , FHCTR, LINK, MOVE, OPlit T, SEQCK, SIGN,S TR I P, IIMCTR
'SEQUENCE CHECK
VING
IISEQUENTIAL CIRCUIT PROBLEM SOL
DATE sY~nOllC PROGRAM T"hiE USING SERIAL NUMBERS.
II UP
ONAl ACJUST~ENT OF ECONOMIC TI~E SERIES
IISEAS
TAPE.
NWRITES po FOURIER SERIES AS ONE BINARY RECORD ON
1130 SERIES BUS LOAD FLOW PROGRAM
TM[~T
IITIME SERIES DECOMPOSITION AND ADJUS
TMENT
#TlME SERIES DECOMPOSITION AND ADJUS
TMENT
UTIME SERIES D,ECOMPUSITION AND ADJUS
NREADS, WITH C~ECKING,
FOURIER SERIES ('R'OM BINARY TAPE
TlON
II INTEGRATES
FOURIER SERIES IN CANONICAL REPRESENTA
T ION ..
IISEARCH A FOURIER SERIES IN CANONICAL REPRESENTA
T ION.
'CONVERTS A FOURIER SERIES IN CANONICAL REPRESENTA
UNPACKS THE INDICES FROM FOURIER SERIES INDEX WORDS,
1/
CAROS.
NPUNCHES A FOURIER SERIES ONTO BINARY RElOCATABLE
FITTING
#TAYlOR SERIES RATIONAL FUNCTION CURVE
RB,IRC.
RB,IRC,

IIERCO SPAC!:;
lITHE. SUBROUTINE
IHHIS SUBROUTINE
/lOOUBLE PRECISION ~ATRIX
#LARGE
NDOUBLE PRECISION INPUT
IWOUElLE PRECISION OUTPUT

070S-CU-002-0
0650-02.0.007
0704-0345ELSAV
B 0104-0345ELSAV
B 0704-07S9AMDPS
B 06S0-05.2.007
B 0104-0334NA022
B 0704-0334NA022
B 7070-04.9.002
11 0104-0904SISCA
B 0650-01.6.055
11 1401-13.1.006
!i 0704-01430RTUR
U 1'.01-10.3.002
B 1620-10.3.003
B 0650-10 .. 3 .. 001
B 06S0-06.0.045
D 0709-09S5VGGAS
B 1401-10 .. 3.001
B 1620-10.3 .. 003
B 1620-10 .. 3.002
[J 1620-10.3.002
B 0709-1086IBAPF
B 0650-10.3.005
B 0704-0204GSIN2
B 0704-1012NUSCH
B 1401-03.0.002
B 1401-03.0.002
B 1401-01.4.012
B 0104-0278UASPO
B Q704-0351MUSC.P
B 0104-0432MUSCO
B 1401-1).3.001
B 1620-06.0 .. 003
B 0704-0749SCIEM
0650-09.2.075
7090-1195IKLP9
0704-0937t::RCON
A 1080--51'1-114
A 1080--SV-1l5

B 1401-01.4.0l0
B 0704-0692JPTAR
B 0704-0692JPWEI
B 0105-tH-007-0
B 0105-PG-001-0
B 0104-078SIBSFS
B 0709-0921VGK[Y
B 0705-AQ-Oll-O
B 1401-01 .. 4.020
B 0104-0J44RL014
B 0704-025JMUEAS
B 0109-0951NA083
0104-0899MEfEN
0709-093SNGBSF
0650-06.0.041
0705-DP 0001
B 0650-06.0 .. 042
B 0704-101311CDI F
B 0704-0914NCKSP
B 0704-0926TA'IIP
B 0704-1l33AA[NT
B 0650-08.2.00"
A 070SA 0705A 1410--SV-907
A 1410--AU-906
A 1410--}0-909
A 1410--[0-911
A 1410--RG-910
A 1070--CB-923
Ii 0650-09.6.018
B 0650-09 .. 6.021
B 1620-09.4.004
B 7090-1229IQCSO
B 0704-1011(',COOO
B 162D-09.4.00S
B 0709-0922AXSFD
B 0704-0708WHSMT
B 0704-0601WHSMT
[] 0109-0605WDLC2
B 0709-0605WOLOC
B 0705-EQ-006-0
A 1620--AT-014
B 1620-01.4.001
B 0650-01 .. 4 .. 005
B 0104-0648AVSEl
D L.20-11.0.010
D 0709-0808GORCC
B 0704-01BIWH004
B 0704-07BIWH004
B 0704-0899METOU
B 7010-02.9 .. 001
~ 0650-01.6.033
B 0109-0999RL03g
B 07Q4-0316UAZDR
B 0704-0769TVF2T
B 0104-0206NYOUT
B 0104-0206NYlNP
B 0709-102S'rIPK06
B 0709-1026WPK01
B 0104-0654AMCHK
B 0704-0206NYINP
B 0650-09.6.005
B 070S-BW-002-0
B 070S-EQ-007-0
B 0704-1103PKSEQ
B 0109-1009WOSt::R
B 0650-06.0.041
" 0104-078BIB .... FS
B 06S0-09.4.012
B 0104-0526TVTSD
B 0704-0861ERTSD
B 7090-1I45ERTSO
B 0104-0788IBRFS
B 0704-07881BIFS
B 0704-07881BSFS
B 0704-07881BWFS
B 0104-01B8IBSPF
B 0704-0188IBPUF
B 7090-1150RLRAT

IITlME
IICONVERTS A FOURIER
#TIME
1180
1#/1005 OR SUBTRACTS TWO FOURIER
/lADOS A TER/-! TO A FOURIER
NCOMIlINES INDICES IN A FOURIER
.EVAlUATES A FOURIER
THE REPRESENTATION OF A FOURIER
III"ULTIPlIES nm FOURIER
I#SPLtTS A FOURIER
PARTIAL DERIVATIVE OF A FOURIER

SERIES ROUTING
SERIES TEnM TO BCD FORM.
SERIES TREND EQUATIONS
SERIES UTILITIES
SERIES.
SERIES.
SERIES..
SERIES..
SERIES.
IIEXPANDS
SERIES.
SERIES.
SERIES.
li'COMPUTES THE
/iSERVICE TAPE GENERATOI~
APPROXIMATION ON A FINITE POINT SET
IIMINIMAX POLYNOMIAL
RING
IISET CODES NUCLEAR-CODE fNGINEE
/lFN II AREA SET GENERATOR SUBROUTI NE..
S FOR BESSEL FUNCTIONS
tlA SET OF INTERPRETIVE SUBROUTINE
/lSET SENSE LIGllTS
IIIFS • AFTER SETTING. XX
tlCHECK TAPE SETTINGS
#SQAP TO SEVEN
/IS EVEN-CARD PUNCH
U:SEVEN-ChRO-LOAOER
IISEVEN-PER-CARD LOADER
"SEVEN-PER-CARD PUNCH ROUTINE
NSEVEN-TD-ONE CONVERTER
FOR PARTITIONING OF ARBITRARILY SHAPED AREA
itA PROGRAM
/#SHARE ASSEMBLER
1401 PROGRAM.
NSHARE CATALOG UPDATeR, LISTER.
/#A 1401 PROGRAM TO MAINTAIN THE SHARE LIBRARY ABSTRACTS
NSOS SHARE-32K ASSEMBLY AND COMPILE
IIINPUT/CUTPUT 5HCEDULING 1/CD&5/CO
LATE NEUTRON ATTENUATION-REACTOR SHIELD NUCLEAR-CODE
II CALCU
IISHIFF
IEARTHWORK LINE SHIFT
#SHDRT CIRCUIT ANALYSIS - CARD
ARO •
#SHORT CIRCUIT CAlCULATIONS. C
/iRADIAL SHURT CIRCUIT PROGRAM
R SYS NETWORK
!tIMPROVED DIGITAL SHORT CIRCUIT SOLUTION OF POWE
IITHREE CENTER CURVES fOR SHORT RADIUS TURNS
UtATION OF ELECTRIC POWER SYSTEM SHORT-CIRCUIT CURRENTS
IICALC
IIFORTRAN SNAP SHOT ROUTINE.
nOCATION OF SHUNT CAPACITORS ON RAOIAL .. lIN
ES
nSIFON4 MURA 650 ON 70'1 SIMULAT
OR
/lDOUBlE PRECISION SIGN COMPATIBILITY
RITE 6-QIGlT DECIMAL INTEGER AND SIGN ON CRT
#W
GSEL,HCTR,LtNK,MOVE,OPHLT,SEQCK,SIGN,STRIP,VMCTR
/I
HARDWARE SIMULATOR.
IIAB FlOAT SIM-ABREViATEO FLOATING POINT
IISIMPL-l NUCLEAR-CODE TRANSPORT
flSIMPl-2 NUCLEAR-CODE TRANSPORT
/#SIMPLE CORRELATION COEfFICIENT
S
OR BAS IC (, AUGM. 650
flSIMPLE CORRELATION ROUTINE. F
IISIMPLE CORRElATION-COR 1
USIMPLE IOCS
IJSTER--' SIMPLE TAPE ERROR ROUTINE.
/fASC SYSTEM AERONUTRONIC SIMPLIFIED CODING SYSTEM.
nSIMPLIFIEO PRIORITY CARD/TAPE
ROUTINE
.INTEGRAL EVAL., SIMPSONS RULE IEQU. INTERV./
#SIMPSONS RULE FlOATING-POUH I
NTEGRATION
IJSIMULATE BASIC 650 COMPUTER WI
TH 704 ..
"SIMULATE PERIPHERAL EQUIPMENT
IISIMULATED PLANT RECORD AUXlliA
RY.
"CURVE FITTING- SIMULATED PLANT RECORD METHOD
IiSIMULATES A DIGITAL DIFFERENTI
AL ANALYZER TO SOLVE
I#SIMULATES INPUT PLUGBOARD OF B
AS IC 650.
READS BCD
IISIMULATING THE CARD 650 ON A T
APE ORIENTED 7010
/,11620 SIMULATION OF A ONE-ARMED BAND
IT-TAPE·
IISIMULATION OF AN INDEXING REGI
STER IN SIR
IISIMULATION OF BASIC 650 ON THE
1010
NSIMULATION OF CARll OR TAPE 650
ON THE 7070
USIMULATION OF OlliE-ARMED BANDIT
• CARD
USIMULATION OF THE 650 ON THE 7
as
tn1l84 AND 80/84 SIMULATION OF THE 114 CARD TO
TAPE.
#650 SIMULATION ON THE 7010
11'717/120 SIMULATION ON 1401
#650 SIMULATION ON 1410
fI 1410 SIMULATION ON 7041709/7090
/HOLtRANCE SIMULATION PROGRAM
" FlOATING TRAP SIMULATION.
#UNJT OPERATIONS SIMULATOR
lITHE CORNEll RESEARCH SIMULATOR
II.SIFON4 MURA 650 ON 704 SIMULATOR
nCHRYSLER INTERPRETfR AND 650 SIMULATOR
II TYDAC /PSEUDO COMPUTER I SIMULATOR
liB I NARY T APE-Te-CArta S I MULA TOR
#TAPE TO PRINTER/PUNCH SIMULATOR
01 SCRAMBLE PERIPHERAL EQUIPMENT SIMULATOR
fI14
tiTRACE
f; IA SIMULATOR
117070 650 PANEL SIMULATOR
/IAN INVENTORY MAr..AGEMENT SIMULATOR _ CARD JINVENTORY MANAGEMENT SIMULATOR. CARD.
NINVENTORY MANAGEMENT SIMULATOR. TAPE.
NVERTER.
tlCARD TO TAPE SIMULATOR AND ROW TO COLUMN CO
N537 SIMULATOR GENERATOR
Nl410 SIMULATOR ON THE 704/9/90
iJI410 SIMULATOR ON THE 704/9/90
#650 SIMULATOR PROGRAM * CARD.
11'650 SIMULATOR PROGRAM ;11 TAPE ;11
#1070 SIMULATOR THE 650 • GRONK It
OATING PT. AND INDEXiNG REGISTER SIMULATOR wiTH TRACE - FIRSNFL
HCARO TO TAPE SIMULATOR.
REVIATED FLOATING POWT HAROWARE SIMULATOR.
IIAB FLOAT 5tM-AB
SION
Jl.INVENTORY MANAGEMENT SIMULATOR1070 fULL FORTRAN VER
OR TAPE TO PRINTER
NSIMULTANEOUS CARD TO TAPE AND I
nONS
IISOLUTION OF N SIMULTANEOUS DIFFERENTIAL EQUA
flSOLUTION OF SIMULTANEOUS EQUATIONS
NGENERAL SIMULTANEOUS EQUATIONS SOLUTIO
IISIMULTANEOUS EQUATIONS COMPLEX
IILEAST SQUARES :jOL. OF SIMULTANEOUS EQUATIONS
#SIMULTANEOUS EQUATIONS, REAL
tiS IMUl T ANEOUS ECUA TIONS, REAL
'NON-L[NEAR SIMULTANEOUS EQUATIONS. REAL
/lNON-L[NEAR S IMUL T ANEOUS EQUATIONS, REAL
/#SIMULTANEOUS EQUATIONS SUBROUT
INE
IISIMULTANEOUS EQUATIONS SOLVER
• TAPE.
tlSIMUL TANEOUS EQUATION PROGRAM
;11
CARD _
USIMUL TANEOUS EQUATION SOLUTION
117010 MATRIX INVERSION AND SIMULTANEOUS EQUATIONS
NLARGE DOUBLE PRECISION SIMULTANEOUS EQUATION SOLVER
IISOLUTION OF SYSTEMS OF SIMULTANEOUS LINEAR EQUATIONS

B
B
B
A
13

070S-E2-002-0
0704-07881BCFT
06'.)0-09.2.049
070S--UT-056
0'1Q1l-07B8IBASF
n 0704-07881BATF
13 0704-0788IBCIF
0704-078BIBEFS
0104-0788IBERF
B 0704-07881BMFS
07Q4-07BBIBSPS
070 11-01881BPOF
B Q704-0',2r,WIlSRV
06S0-06.0~O'+3

B
B

B
B
B
B

A

0704-NUt:LEAR
0704-08'tf1ARGEN
0650-03.2.007
0704-0654AMCHK
0705-PG-005-0
070S-PG-004-0
06S0-01.6 .. 014
0650-01.3.010
0650-01.2.009
0650-01.2.002
0650-01 .. 3.001
0650-01.6.011
0650-09 .. 6.013
0104-0347UASAP
07Q4-1l24UCSCU
0704-1165PNSLI
0109--PR-064
06S0--UT-I05
0650-08.2.025
0650-01 .. 6 .. 041
0650-09.2 .. 022

A
B
B
B
B 1620-09 .. 1+.. 006
B 1620-09 .. '+ .. 001
B 0650-09 .. 4 .. 013
B 0650-09 .. 4.004
B 0650-09 .. 2.020
B 06S0-09.4.007
B 0104-0S95ERSNA
El 1620-09.4.002
B 0104-0548MUSFN
B 0"704-0417PFCSF
B 0704-0362NA1l7
B 0105-B .... -002-0
(} 1070-05 .. 2.001
B 0104-NUCLEAR
B 0704-NUCLEAR
B 06S0-06.0.002
B 0650-06.0.062
B 06S0-06.0.047
B 7070-03~4.002
B 1401-01 .. 4.018
B 1401-02.0 .. 002
B 1010-02.4.004
B 07D4-0116ClINT
0109-0982RWS 12
0704-0480CE650
A 0709--51-071
B 0104-0604TVSPR
B 1620-09.4.009
B 0104-0319GlDAS
B 0704-0480CE650
B 7070-0S.1.004
B 1620-11.0 .. 002
B 0650-02.0.016
B 7070-05.1.002
B 1010-0S.1.00S
B 1620-11.0.011
B 0105-PC 0001
B 0704-06760R714
A 1070--51-079
B 1401-10.2.001
A 1410--SI-101
A 1410--51-042
B 0650-10.2.002
B 0704-0135PFMCF
B 0650-09.6.022
B 0650-10 .. 2.001
0 0104-0S48MUSfN
B 0704-0486CMCIS
B 0704-0441CSTYLJ
0104-0455BETCB
0109-06S1WDTPS
1401-13.3.001
1620-01.4.005
7070-05.1.001

16l0-10.2.001

B

B
A
A
[3

B

B
B
B

B
B
B
B
B
B
B

B
B
B
B
B
B
B

1620-10 .. 2.003
1620-10.2.002
0104-10130RCTT
0650-01.6 .. 051
0704--SI-041
0704--51-042
1620-02.0.004
1620-02.0 .. 005
1010-05.1.003
0650-01.6 .. 050
0709-0605WDCTS
7070-05.2.001
7070-12.1.001
1401-13.1.010
0650-04.0.011
0650-07.0.003
0650-0S.2.019
0704-0116CLSf-l[
0704-0116CLlSQ
0704-0223ClSr'.E
0104-0223CLSME
D704-0213CLSM(
0704-0213CLSME
0704-0355GMSIM
0704-0962SQSIM
1620-05.0.001
1620-05.0.002
1010-10.1 .. 002
1090-1149ASOI2
0650-05.2.021

27

'SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS
HSYMMETRIC SIMULTANEOUS LINEAR EQUATIONS
MATRIX INVERSION AND SOLUTION OF SIMULTANEOUS LINEAR EQUAT
II
OLUTION SUBROUTINE
tlFN I I SIMULTANEOUS LINEAR ECUATION S
NSOLUTION OF SIMULTANEOUS LINEAR EQUATIONS
NSOLUTION OF SIMULTANEOUS LINEAR EQUATION
WITH PI\lortNG
'SLEP, SOLVES SIMULTANEOUS LINEAR EQUATIONS
ION, FlOATING POINT.
flSIMULTANEOUS MULTIPLE INTEGRAT
IAL EQUATIONS SOLVER
NSIMULTANEOUS PARTIAL DIFFERENT
ETERMINANT
flSIMULTANEOUS REAL EQUATIONS, D
flSIMIJLTANEOUS REAL EQUATIONS
If. DOUBLE PRECISION SIMULTANEOUS REAL EQUATIONS,
NWAVE RECORD ANALYSIS OF TWO SIMULTANEOUS RECORDS
.DouaLE PRECISION SIN-COS ROUTINE
NSIN-COS SUBROUTINE
flMURA FIXED POINT SINE
IIMURA FIXED POINT SINE
NARC SINE - ARC COSINE SUBROUTINE
#FLOATING POINT SINE A AND COSINE A
IIARC SINE AND ARC COSINE
iHNTERPRETABLE DOUBLE PRECISION SINE AND COSINE
NLLS.
IISINE AND COSINE FUNCTIONS FOR
IISINE AND COSINE SUBROUTINE
IISINE AND COSINE SUBROUTINE
IISINE AND COSINE, FLOATING
'HYPERBOLIC SINE AND COSINE,FLOATING POINT
IIFlOATING-POINT 109 HYPERBOLIC SINE AND HYPERBOLIC
NSINE COSINE SUBROUTINE
IISINE COSINE SUBROUTINE
FUNCTIONS
NINTER SUBROU FOR SINE INTEGRAL & COSINE INTEGRA
#FN I I S INE-CQS INE INTEGRAL SUBROUT[N
IISINE-COSINE SUBROUTINE
,HYPERBOLIC SINE-COSINE, FLOATING
ROUTINE
NHYPERBOLIC SINE, COSINE AND COTANGENT SUD
NALYSIS OF VARIANCE FOR PART. OR SING. REPLICATED KBY
NA
RAN II INpUT SUBROUTINE
'SINGLE DIMENSION SYMBOLIC FORT
"SINGLE INTEGRATION SUBROUTINE
SUBROUTINE
liS INGLE OR DOUBLE INTERPOLATION
ION
NSINGLE PRECISION MATRIX INVERS
C(SION FORTRAN INPUT
NSINGLE PRECISION TO DOUBLE PRE
NE
'SINGLE-VALUED ARCTANGENT ROUf!
#FLOATING POINT·E A, 10 A, SINH A, COSH A
IA FLOATING POINT'i AT 10 AT SINH AT CO
NSINH FIT
f.lSINH X AND COSH X
ATION OF AN INDEXING REGISTER IN SIR
IISIMUL
NSIR PLUS
flSIR SOAP INTERPRETIVE ROUTINE
NSlx CARD UPPER LOADER
Y TUBE DISPLAY
NMURA SIX COLUMN FRACTION CATHODE RA
NMURA SIX COLUMN FRACTION PRINT
TRAJECTORY PROGRAM
/IISIX DEGREE OF FREEDOM DYNAMIC
",SIX-PER-CARO LOADING ROUTINE
ANALYSIS PROGRAM"
IISCRAP " SIXTEEN-TWENTY CARD REGRESSION
SORT 54 MODIFICATION TO USE FILE SIZE
fI
NECONCMIC CONDUCTOR SIZE SELECTION BY KELVINS LAW
5 PROG 18
NSELEC ECON .. CONO. SIZE-SPEC CASE NEW ENG ELEC SY
IISlllLE NUCLEAR-CODE BURNUP
"SKEWED BRIDGE ELEIiATlONS
NGEORGIA SKEWED BRIDGE PROGRAM
PE AND PUNCHES
HSKIPS ONE FILE ON A DECIMAL TA
N3-SPAN CURVED CONCRETE SLAB BRIDGE PROGRAM
AR EQUATIONS WITH PIVOTING
IISLEP, SOLVES SIMULTANEOUS LINE
T SQRS. BEST 1/2WAVE POTENT. AND SLOPE OF A /IICAlC. OF THE LEAS
IISLOPE STABILITY ANALYSIS
IISLOPE TOPOG PROGRAM
II-SMASHT
ALLY SPACED DATA POINTS
IISMOOTH AND 01 FFERENTI ATE UNEQU
POINTS
NSMOO TH AND 01 FFERENTI A TE OAT A
VE
",SMOOTHED ORDINATE AND DERIVATI
/!!EXPONENTIAL SMOOTHING
TAL TERRAIN ~ODEl SYSTEM PROFILE SMOOTHING PROGRAM DA-3
",OIGI
NMADSMI CURVE SMOOTHING ROUTINE
#FORTRAN SNAP SHOT ROUTINE..
IISNAPSHOT TRACER
IISNG NUCLEAR-CODE TRANSPORT
IIFORTRAN SN6 NUCLEAR-CODE TRANSPORT
/lNO SOAP
ESTION
11650 SOAP CONTROL PANEL WIRING SUGG
M • ASCUP •
IIAUTOMATIC SOAP CONVERSION UTILITY PROGRA
R THE IBM 650
NA MODIFIED SOAP FLOATING POINT PACKAGE FO
NSOAP I TO SOAP I I TRANSLATOR
IIRElOCATABLE TO REGIONAL SOAP II
IIGO SOAP II
NSOAP I TO SOAP II TRANSLATOR
DAD CARD
N402 CONTROL PANEL FOR SOAP [I a-WORD LIST, AND 650 t
I1StR SOAP INTERPRETIVE ROUTINE
DOUBLE PRECISION flOATING POINT SOAP INTERPRETIVE ROU NOOPSIR
NTRANSLATOR 'AND OTHER FORMATS TO SOAP RElOKS
NSOAP TO SEVEN
GRAM STRAP 4000
IIS0AP TYPE OPTIMAL ASSEMBLY PRO
#A PROCEOURE FOR USING SOAP WITH A NUMERIC 650
NaAS IC SOAP 2A
NTAPE SOAP 2A
NSOAP 2L
NSOAP 2L TAPE
'SOAP 4000
IISOAP 42
GRAM STRAP
#SOAP-TYPE OPTIMAL ASSEMBLY PRO
IISOAPY
#SOCOTT TAPE TEST SYSTEM
IiSOFOCATE NUCLEAR-CODE PHYSICS
flLEAST SQUARES SOL. OF SIMULTANEOUS EQUATIONS
EQUATION
HINTER SUBROU FOR SOLU OF ORDINARY DIFFERENTIAL
W/AUTO ERROR ANALYSIS
'NUM SOLU OF ORDINARY DIFFERENTIAL
MATICAL PROGRAMMING SYSTEM I-All SOLUTIONS
'MATHE
#fQU SOLV
DIGITAL DIFFERENTIAL ANALYZER TO SOLVE
IISIMULATES A
MGENERATE MATRICES TO BE SOLVED BY NU TPLl
II ZERO, MINIMUM SOLVER
NSIMULTANEOUS EQUATIONS SOLVER
*lINEAR' HATRIX EQUATION SOLVER
IILINEAR EQUATION SOLVER
'DIFFERENTIAL EQUATIONS SOLVER
S PARTIAL DIFFERENTIAL EQUATIONS SOLVER
IISIMULTANEOU
PRECISION SIMULTANEOUS EQUATION SOLVER
IIlARGE DOUBLE
At ONE DIMENSIONAL HEAT EQUATION SOLVER
NMULTI-MATERI
NDRY CONDITION DIFFERENTIAL EQU. SOLVER
nwo POINT BOU
IILJNEAR EQUATION SOLVER OF BAND MATRICES
AllONS WITH PIVOTING
MSLEP, SOLVES SIMULTANEOUS LINEAR EQU

28

B
B
a
B
B
B
B

8
B
B
B
B
B
B
B
B
B
B
A
B
a
B
B
B
B
B
B

8
B
S

B
B
8
D
B
B
B

B
B

B
B
B
B

B
B
B
B
a
B

e

B
B
B
B
B
B
B

B
B
Ii
B

B
B
B
B

B
B
B
B
B
B
B

B
B
B
B
B
B
B
D
B
B
B
B
B
a
B
B
B
a
B
B
A
A
A
A
A
A
B
B
B
B
B
B
B
B
B
B
D
B
B
B
B
B
B
B
B
B
B
B

0650-05.1.002
0650-05.2.010
0650-0S.2.011
0704-0848ARNXN
1620-05.0.007
7070-10.4.001
7070-10.4.002
0704-0240NOSIG
0104-1043JPSRC
0704-0116CLSME
0104-0116CLSME
0104-0356CA001
0104-0574CSTUK
0704-09290LDPS
0650-03.1.010
0704-02BOMUSIN
0704-0280MUSIN
0704-0246NA135
0650--LM-004
0704-0116CLASC
0704-038SBS9EC
0704-0B370RSCN
7010-08.1.002
1070-0B.l.015
0704-0517RWSC5
0704-0417PFCSH
0109-0941RWHY3
7070-0B.l.011
7070-08.1.021
0650-03.2.004
0704-0848ARCS I
1401-03.0.005
0704-0224ASAS3
7070-08.1.020
06S0-06.0.063
0104-0B4BARINS
0704-0368111A274
0704-1l29AQALl
1070-10.1.003
0709-1201NRDIC
0704-0355GMATN
0650-03.1.020
0650-03.1.020
0650-06.0.017
0650-03.1.009
06S0-02.0.016
0650-02.0.018
0650-02.0.001
0104-1l83GDCOR
0104-0310MUSCP
0704-0314MUPRF
0704-0821LRSFO
0650-01.2.004
1620-06.0.001
0705-XE-002-0
1620-09.4.005
1620-09.4.004
7090-NUCLEAR
1620-09.2.005
0650-09.2.008
0704-1144NCOI4
0650-09.2.060
7010-10.4.002
0650-09.3.003
0650-09.2.026
0650-09.2.024
7090-1130RLAI4
0704-0331CLSMD
0704-0223CLSMO
7090-1248MDSOO
1620-10.2.004
0650-09.2.063
7090-1241MADSM
0704-0595ERSNA
0704-0275NYSNA
0104-NUCLEAR
1090-NUClEAR
0650-01.1.00B
0650-12.0 .. 006
0650-01.6.045
0650-01.1.009
0650-01 .. 6.016
0650-01.6.034
06SQ-12.0.004
0650-01.6.016
0650-12.0.005
0650-02.0.001
0650-02.0.010
0650-01.6.048
0650-01.6.014
0650-01.1 .. 012
0650-01.6.012
0650--SP-201
0650--SP-202
0650--SP-203
0650--SP-204
06S0--SP-20S
0650--SP-206
0650-01.1.001
0650-01.1.005
0705-51-001-0
0704-NUCLEAR
0704-0116CLLSQ
0650-04.0.005
0650-04.0 .. 012
0704-1092RSMlA
0650-0S.2.020
0704-0319GLDAS
0104-1110NUGEN
070~-1041JPZOM

0704-0962SQSIM
0704-063SRWMAT
0104-0742RWLE3
0104-0B25JPDEQ
0704-1043JPSRC
7090-1149ASOI2
0704-06S2RWHF2
0704-0238ATTPI
0109-0990RWLE4
7070-10.4.002

IISEQUENTIAL CIRCUIT PROBLEM
ON 650
NRUNGE-KUTTA ROUTINE FOR
NDIFFERENTIAL EQUATION
fA PROGRAM FOR
lIONS
'RESTART PROGRAM FOR MD
NERALIZED VARIABLE LENGTH RECORD

SOLVING
B
SOLVING DIFFERENTIAL EQUATION B
SOLVING SYSTEM
B
SOLVING SYSTEMS OF LINEAR"' EQUA B
SORT
B
SORT
'709/1090 GE B
'SORT DElETE
A
.SOR T GENERATOR
B
'SOR T I NTERNAll Y
B
NSORT PROGRAM
B
'GENERALIZED RAMAC SORT PROGRAM
A
'KWIC SORT PROGRAM fIRST PART
B
'KWIC SORT PROGRAM SECOND PART
B
IIGENERAL SORT ROUTINE
B
NGENERAL LOGICAL CORE SORT SUBROUTINE FOR 32K704
B
NPROGRAM -TO SORT THE KEY WORDS FROM NCB8
B
NSCRT 1
A
IIISORT 1401
B
nAPE SORT 2
A
'SORT 2
A
NSORT 2, OECENDING
B
./HAPE SORT. 3
.A
'SORT S4
A
.SORT 54 MODIFICATION TO USE FI B
LE SIZE
'SORT 54 T {
A
ISORT 54 TECHNIQUE OF MODIFICAT B
ION OF PHASE II
'SORT 54/
A
'SORT 54T
A
NE
'SORT 55 CHECKING LOADING ROUTI B
'SORT 57
A.
ISOR.T 57 BLOCKED VARIABLE
8
,SAVE MEMORY SORT 57-PH3
B
'SORT 57/
A
ISORT 58
B
IISORT 109
A
.SORT 80
A
"SORT aD UNDER SCS 80
A
'SORT 90
A
'SORT/MERGE 11
A
ISORT (MERGE 12
A
LENGTH - 1 WORD. OPEN.
'SORT, ALGE8RAIC. KEY AND ITEM B
LENGTH - 1 WORD. CLOSED.
'SORT, ALGEBRAIC. KEY AND ITEM B
S. IWHOLE WORD KEYS ONLY/
ISORT, ALGEBRAIC. MULTIWORO KEY B
,
LOGICAL MEMORY SORT, MINIMUM TIME
B
fjlREADS THE SORTEO AUTHOR CROSS INDEX TAPE 13
"READS THE SORTED BIBLIOGRAPHY TAPE FROM
B
NC 142
NREAOS THE FINAL SORT EO BIBLIOGRAPHY TAPE
B

NREADSN~~~O~I!~~ ~~:~~g ~!~E w~:~~ ~~O~3~C

139
SORTER.
SORTER. FIRST PHASE OF A GENER
SORTING PROGRAM
SORTING ROUTINE
'SORTING SUBROUTINE
OM NC 138
"SORTS THE BIBLIOGRAPHY TAPE FR
ISOR9
LER
"SOS IBM-32K ASSEMBLY AND COMPI
GRA~ LOAOER. CALLS IN A SELECTED SOS PROGRAM
ISOS PRO
SELECTED SOS PROGRAM
'SOS PROGRAM LOADER. CAllS IN A
P lLER
NSOS SHARE-32K ASSEMBLY AND COM
P AND LOAD ROUTINE FOR IBM 6S0 " SOSF •
IIDUM
NE EDIT FOR FORTRAN MONITOR WITH SOUR.CE LANG OEBUG
'OFFLI
ilEXTENTIOh OF FORTRAN 2 SOURCE LANGUAGE
*'fORTRAN SOURCE TAPE CORRECTOR
",BACKSPACE FILE,FORWARD SPACE FILE.
11 DIFFUSION EQUATION IN ';tx, Yo SPACE NUCLEAR-COOE
II UNCLE
NFORTRAN WRITE-UP OF RW RfQX.SPACE REQUIRED-122 CELLS
NERCO SPACE SAVER
OOTH ANO DIFFERENTIATE UNEQUALLY SPACED DATA POINTS
IIISM
MERICH INTEGRATION OF UNEQUALLY SPACEO POINTS
,NU
FITTING eN ec;UALlY FOR UNEQUALLY SPACEO PT
NCURVE AND SURFACE
o
NSPAN-2 NUCLEAR-CODE MONTE, CARL
TRANS. IT • COMPILER FOR USE OF SPECIAL CHAR
#MOOS OF INTER
IIINTEGRATION OF SPECIAL FORP. OF 2ND ORDER ECU.
flCOMPUTES A SPECIAL FUNCTION F OF THE INOI
CES.
IISPECIFIC VOLUME OF CO~PRESSED
lIQUID
'SPECIFIC VOLUME OF SATURATED L
IQUID
STEAM
'ENTHALPY ENTROPY SPECIFIC VOLU~E OF SUPERHEATED
NENTHALPY ENTROPY SPECIFIC VOLUME OF SATURATED V
APeR
II NEUTRON ENERGY SPECTRA IN wATER NUCLEAR-CODE
N OF At:TO-CORRElATION FUNCTION £. SPECTRAL DENSITY
MCALCULATIO
ATJNG
NPOWER SPECTRAL DENSITY FUNCTION, FLO
VECTORS OF A MATRIX
RMOLECULAR SPECTROSCOPY LATENT ROOTS AND
IIMOLECULAR SPECTROSCOPY MUL T OF MATRICES
#AUTOCORRELATION AND POWER SPECTRUM
,POwER DE.NSITY SPECTRUM
NAUTO-CORRElATION AND POWER SPECTRUM ANALYSIS
NO. GEN., NERENSON-ROSEN FISSION SPECTRUM. FT.PT
tlRANDOM
NSPEEO CHECK ANALYSIS
NSPEED CODING SYSTEM
fI. BEEHIVE t. HORNET REACTOR CODE SPHERICAL GEO NUCLEAR-CODE
E
/I BALL A REACTOR CODE FOR SPHERICAL GEOMETRY NUCLEAR-COO
o
flSPIC-1 NUCLEAR-CODE MONTE CARL
NTALBOT SPIRAL INTERSECTIONS
lIT ALBOT SP I RAL I NTERSEC T IONS
tlSPL INE CURVE FIT
NSPLINE CURVE READ
,NINE OPERATlO~ SPLIT INSTRUCTION ROuTINE NOSI
·fl.SPLITS A FOURIER SERIES.
NSPOOL SYSTEM
NSPRSP
10 Syp.leOLIC PROGRA"MING SYSTEM" SPS • • CARD"
111620/17
10 SYMBOLIC PROGRAMMING SYSTEM" SPS " " TAPE.
NI620/17
liSPS ONE PASS FOR PAPER TAPE
N104 ASSEMBLY OF 1401 SPS PROGRAMS
N7D4 ASSEMBLY Of 1401 SPS PROGRAMS
IIISPS TO FORTRAN SUBROUTINE EDIT
REVISION.
liSPS TO FORTRAN SUHROUTINE EDIT
'MAST .MINNEAPOi.J ASSEMBLY OF SPS TWO "
ST "FULL MINNEAPOLIS ASSEMBLY OF SPS T~O •
NFULL MA
liSPS T~O PASS FOR CARDS
MSPS TWO PASS FOR PAPER TAPE
'SYMBOLIC PROGRAMMING SYSTEM SPS 1
NSYMBOLIC PROGRAMMING SYSTEM SPS 2
NSPYCE
TH LINEAR INC. OF VEL.
#LEAST SQ. DETER. FOR A VEL FUNCT. wt
N FOR REFRACT. TID DATA
#lEAST SC. DETER. Of VELOCITY FUNCTIO
G BINARY ARITH
"NORMAL tHO SQ. ROOT-EXTENDED RANGE FlOAHN
SLOPE OF A #CALC. OF THE LEAST SCRS. BEST 1/2WAVE POTENT. AND
E
NFN I I NTtl DEGREE LEAST SQU COEF COMPUTATION SUBROUHN
n09 VIPP
AL PURPOSE
fl!VIPP
IICRCWN LIFE INSURANCE COMPANY
/I.
GENERALIZED TAPE

0704-1103PKSEC
0650-07.0.005
0104-0144PKNID
1401-11.0.003
0709-1160MDSRS
0709-l1S9MDSOR
0650--UT-I06
0104-0404G I SG
070S-PG-009-0
0704-0427NSSRT
1410--5"'-110
0104-0914NCKSP
0704-0914NCKSP
0704-0359ElSOB
0704-1054-BSSEA
0704-1144NC013
1401--SM-029
1401-01.2.001
0650--SM-402
1401--SM-043
0650-01 .. 5.009
0650--SM-403
0705--SM-048
0705-XE-002-0
0705--SM-052
0705-XE-001-0
070S--SM-051
0705--SM-049
070S-EQ-00I-0
0705--SM-OSO
0105-CU-OOl-l
0705-CU-002-0
0705--SM-053
0705-511-001-0
0109--SM-066
070S--Sr,;-054
70BO--SM-114
1070--SM-077
1410--SM-111
1410--SM-112
0704-05100RSRT
0704-05700RSRT
0704-05700RSRT
0704-0468CF005
0704-1144NCOI4
0704-1144NCOI4
0704-1144NCOI4

~ ~~~:=g!:~~~~:
B
B
B
B
B

B
A
A

B
B
A
B

B
B
B
B

8
0
B
B
8
B
B
B
8
B
I!
B
B
B
B
B
B
8
B
B
B
B
B
B
8
a

n
fl
B
B
a
B
B
B
A
B
A
A
A
B
B
B
8
e
B
A
A
A
A
B
B
8
B
B
B

0709-1136BWVIP
0704-0926TAVIP
0650-01.5.006
0104-046BCf006
0650-01.1.011
0704-1144NCOI4
7090--SM-922
0109--PR-063
7090-12291QCSO
7090-1229IQCSO
0709--PR-064
0650-01.2.012
1090-1115GPFMS
0704-0812GPFMG
1620-01 .. 5 .. 001
0704-1003GNBSP
0650-08.2.011
0109-0946RWF(Q
0650-02.0.001
0704-0331CLSMD
0704-1157TU900
0650-06.0.021
0704-NUCUAR
0650-02.1.002
0104-0141LAS8B
0704-078BI8SpF
109D-I095WHVCL
1090-1095WHVSL
7090-1095HHHSS
1090-1095WHHS\I
0650-0B.2.021
0650-06.0.049
0104-0577RWPS2
0650-05.2.024
0650-05.2.023
0650-06.0.013·
0704-0B97AAPDS
0704-0296NYCP2
0704-07430RFtS
0650-09.2.023
0650-02.0.005
06S0-08.2.009
0650-08.2.016
0704-NUCLEAR
0650-09.2.045
06S0-09. 2.077
0704-0483NA029
0104-0483NA029
0650-02.0.006
0104-078BlaspiS
7070--10-07~

070S-SR-00B-0
1620--SP-020
1620--SP-021
1620--SP-007
1401-13.2.001
1401-01.1.007
1620-01.6.007
1620-01 .. 6.009
1401-01.1.00,)
1401-1)1.1.006
1620--SP-009
1620--SP-008
I401--SP-021
1401--5P-030
06S0-02.1.004
0650-09.6.016
0650-09.6.020
0704-0370RS013
0650-09.3.003
0704-0B48ARPlN

ENCV TABLE

NCHI SQUARE AND PHI FOR ZX2 CONTING
"GENERAL LEAST SQUARE CUIWE FITTING ROUTINE
IIGENERAL LEAST SQUARE CURVE FITTING ROUTINE.
NCY TABLE
IICHI SCUARE FOR UP TO 10XIO CONTIGE
/ilARGONNE LEAST SQUARE LEGENDRE POLYNOMIAL FIT
D EIGENVECTORS OF
NON-SYMMETRIC SQUARE MATRIX
IIEIGENVAlUES AN
NSQUARE MATRIX TRANSPOSED ON IT
SelF
ELF
IISQUARE MATRIX TRANSPOSE ON ITS
IISQUARE MATRIX TRANSPOSED ON IT
SelF OR DISPLACED IN CORE
N
NWEIGtHED LEAST SQUARE POLYNOMIAL APPROxlMATIO
//lEAST SQUARE POLVNOMIAL FIT IFORTRAN
III
NSC.UARE ROOT
IHRIPLE PRECISION COMPLEX SQUARE ROOT
IITRIPLE PRECISION SQUARE Roor
IIFlOA TI NG-PO tNT DOUBLE-PREC I S tON SQUARE ROOT
111620 FIX POINT S<.;UARE ROOT
INE
IIFIXED POINT SQUARE ROOT. CLOSED. SUBROUT
IIINTERPRETABLE DOUBLE PRf:.CISION SQUARE ROOT INSTRUCTION
tlMURA FIXED POINT SCUARE ROOT ROUTINE
/lMURA FIXED POINT SQUARE ROOT ROUTINE
#DOUBLE PREC I SION SQUARE ROOT ROUT I NE
IIHOATING POINT SQUARE ROOT SUBROUTINE
NSCUARE ROOT SUBROUT INE
IISQUARE ROOT SUBROUTINE
NFLOATING POINT SQUARE ROOT SUOROUTINE
NFLOATING POINT SQUARE ROOT SUBROUTINE
IISQUARE ROOT SUBROUTINE
N~ARIABLE FIELD SQUARE ROOT SUBROUTINE
'SQUARE ROOT SUBROUTINE
II'SQUARE ROOT SUBROUTINE
IISCUARI: ROOT SUBROUT I NE
NSQUARE ROOT SUBROUTINE
MARCSIN X. ARCCOS X, SQUARE ROOT X
NSQUARE ROOT X
IISCUARE ROOT, FLOATING-POINT
ORTRAN LIB. VERSION
NSQUARE ROOT, FLOATING-POiNT, F
nSQUARE ROOT, flOATING POINT
IISQUARE ROOT, FLOATING POINT.
9 CNLV
IISQUARE ROOT, FLOATING POINT 10
IISQUARE ROOT t TOPlER METHUD
"eXPAND TRIANGULAR MATRIX TO SQUARE SYMMETRIC FORM.
ANGULAR FORM.
flCONTRACT SQUARE SYMMETRIC MATRIX TO TRt
NSQUARE TABLE LOOK UP
RDOUBLE PREC .. FLOATING PT. SQUARE-Roor SUBROUTINE.
/lFlOA TI NG-PO tNT SQUARE-ROOT SUBROUT I NE
tPOLLY-POLYNOMIAL FlT BY LEAST SQUARES
IiLEAST SQUARES
IIGENERAL LEAST SQUARES ANALYSIS
"LATIN SQUARES ANALYSIS OF VARIANCE
#lATIN SCUARES ANALVSIS OF VARIANCE
HOGONAL POLYNOMIALS
#lEAST SQUARES CURVE FITTING WITH ORT
USING ORTHOGONAL
IILEAST SQUARES CURVE-FITTING ROUTINE
IIlEAST SQUARES CURVE-FITTING ROUTINE
IA GENf:.RAL LEAST SCUARES FITTING PROCEDURE
HGENERAL LEAST SQUARES FORTRAN SUBPROGRAM.
MA LEA~T SQUARES ITERATION
HPOLYNOMIAL OF BEST FIT BY LEAST SQUARES METHOD
ON..
IIlEAST SQUARES POLYNOMIAL APPROXIMATI
NG ROUTINE
NlEAST SQUARES POLYNOMIAL CURVE FITTI
IILEAST SQUARES POLYNOMIAL FIT
#THREE DIMENSIONAL LEAST SQUARES PROCEDURE.
E FITTING
HLEAST SQUARES RATIONAL FUNCTION CURV
QUATIONS
ItLEAST SQUARES SOL. OF SIMULTANEOUS E
IINON-llNEAR LEAST Sf;JUARES..
,FORTRAN TO SQUOZE CONVERTER
NSQUOlE TAPE EDlTOR
IISRTIME
IISLOPE STABILITY ANALYSIS
LECTRICAL POwER SYSTEM TRANSIENT STABILITY CALCULATIONS
liE
USTAGE CONSTRUCTION PROGRAM
IISTANOARD-TQ-COLUMN BINARV CARD
CONVERSION, ON-LINE:
UBROUT INES • SUDS •
NSTANDARDIZED UTILITY DECK OF S
NSTANOLINK II
NSTANOSPYCE
H70fl SURGE SYSTEM START
E OR COVARIANCE FOR NON-ORTH/D & STAT. OESIGN /lANA LV OF VARIANC
ICIENTS FOR BENEOICT ECUATION OF STATE
#OETERMINATION OF COEFF
#TRANSIENT OR STEAOV STATE TEMPERATURES
BENEDICT-WEDB-RUBIN EQUATIONS OF STATE..
1#
/I READING OF FORMAT STATE~ENTS AT EXECUTION TIME.
A-I
'PROFILE CCMPARISION AND STATISTICAL ANALYSIS PROGRAM 0
OR IBM MAG ORU,.. CALCULATOR
NSTATISTICAL INTERPRETIVE SYS F
ERTIES
HSTATISTlCAl THERMODVNAMIC PROP
G
NSTDY-3 NUCLEAR-COO[ ENGINEERIN
IIlRANSILNT OR STEADV STATE TEMP[RATURES
ODYNAMIC PROPERTIES OF WATER AND STEAM
UTHER~
/tVISCOSITY OF STEAM
V SPECIFIC VOLUME CF SUPERHEATED STEAM
HENTHALPV ENTROP
If.
THERMODVNAMIC PROPERTIES OF STEAM ANO WATER
"MINI~U'" ERROR ROUTINE FOR STEAM TABLE DISTRIBUTION
RlAGRANGIAN INTERPOLATIOI>J FOR STEAM TABLES
TOtJATIC I"INtMUfi WEIGHT DESIGN OF ~Tl:EL FRA"'ES
/tAU
ULTIPLE LINEAR REGRESSION BY THE STEPWISE METHOD
II'"
RRELATION(.REGRESSION ANALYSIS BY STEPWISE METHOD
"MULTIPLE CO
VARIABLE TRANSFOR~ATlONS
IISTEP~ISE MULT .. REGRESSION WITH
SSION • TAPE •
IISTEP~ISE MULTIPLE LINEAR REGRE
SSION .. CARD.
IISTEPWISE MULTIPLE LINEAR REGRE
SSION ANALYSIS ON THE IBM 7070
"STEPWISE MULTIPLE LINEAR REGR[
ROCEDURE
"STEPWISE MULTIPLE REGRESSION P
NALVStS, MRI
117070 STEPWISE MULTIPLE REGRESSION A
IIESSO STEPWISE REGRESSION PROGRAM
IISTEPWISE REGRESSION
ROGRAt-! ..
IISTRAP • STEPWISE REGRESSION ANALYSIS P
NE •
liSTER • SI~PLE TAPE ERROR ROUTI
S PRCG FOR 6S0-653 MAG ORU", CONE STGE COMPU
/fMOD DEll TRAN
NGENERAL FREEWAY ASSIGNMENT, STOCKTON REVISION
AND Aoe
/lPK CLAD (. PK STOD - DOUBLE PRECISION CLEAR
IISTQP NUMBER ORU", AND lAS
UTILITIES FOR ADDITIONAL STORAGE
I#STORAGE DUMP
liON-LINE STORAGE DUMP
HSTORAGE HISTORY TRACE
IIWRITE BSS LOADER STORAGE />',AP
J/WRITE DSS LOADER STORAGE MAP
tWU/>'P STORAGE. CORE, DRUM, AND TAPES
/tDUI-1P STORAGE, CORE, DRUM, AND TAPES
E "'ATRfX
IISTORE ROW MATRICES INTO ALAR:;
POST fRACNTHREE TRACE PROGRAMS, STORED PROGRAM, PROCESS PANEl,
EM
IISTRAIGHT LINE HRIDGE GRID SVST
ARC·
IISTRAIN GAGE DATA REDUCTION" C

Hon

0650-06.0.016
0104-017SR~GLS
0704-0142R~lS3

ti
B
0
B
B

B
B
D
A

B

l\

1I
B
B
B
B
B
B
0
B

0
B

B
8
B
B
B
B
B
B
B

B
B

B
B
B
B
D
B
B

a

B
B

B
B
B
~

0
B
8

B
B
B

B
lJ

B
B
B
B
B

0
B
B
B
B
B
B
B
fI
B

B

0650-06 .. 0 .. 01S
0704-042 1.ANE20
0650-0S.2 .. 01fl
0104-0290GESTO
0104-0432MUMTR
0704-0661GDF02
06S0-06.0 .. 009
0704-0772ANE20
0650--LM-006
0704-0565CA005
0104-0481CA003
0704-052SPKSCR
1620-07.0.003
1620-03.0.002
070 '.-0385ASSQI{
0704-0283MUSQR
0104-0263MUSQR
7070-0B~ 3~ 006
0650-07.0.011
0650-03.1.001
0650-03~ 1.002
0650--LM-OI0
0709-0619IBSQR
1401-03.0 .. 003
1620-03.0.001
7010-08.3.007
7070-08 .. 3.008
7070-06 .. 3. 009
7070-06 .. 3.010
0650-03 .. 1 .. 028
7070-0B. 3. 001
0704-0399MISRT
0704-039 c:lMISRT
0704-0641CSSQT
0704-0653CSSCT
0709-0485MISRT
7070-00.3.002
0704-0460MIEXA
0704-04bOMICNT
0705-AF-013-0
0704-07271BSQO
0104-0817G I F PS
0650-06.0 .. 010
1090-1243SILSQ
0650-06 .. 0.027
0704-071bR~AVS

0704-0491RWAV3
0650-06 .. 0.023
0704-0636RWCF2
0709-0B60RWCF
0104-1076ANE20
0704-063SRWGlS
0709-0934NOLSQ
0650-06.0.006
0704-0611CA021
070S-AO-003-0
0704-0116CLLSQ
0704-0533CF009
0704-0859GSll6
0704-0116CllSQ
0104-08370RNLl
0709-0875RCFNS
0709-1000RSEOT
0705-10-001-0
0650-09.2 .. 026
0650-09 .. 4.001
0650-09.2.070
0704-0374NA217
06S0-03.1..034
0650-01.1.006
0650-01.1.010
0704-0871ECS50
0650-06.0.059
0650-09 .. 3.001
1090-12300RTOS
0104-11871BTEO
0704-0732PFMOD
0650-09.2.074
0650-06.0 .. 017
06')0-09 .. 3 .. 006
0704-NUCLEAR
7090-123BDRTOS
7090-1095WH005
1090-1095WHVIS
7090-1095wHHSS
0704-042BGSSTP
7090-1095WIIOS8
7090-109SWHlOI
06S0-09.2.052
7070-11 .. 3.002
1010-11 .. 3.007
7090-1194ERMPR
1620-06.0.006
1620-06 .. 0.007
7070-11.3 .. 006
0704-0'.77ERMPR
7070-11.3.001
06S0-06 .. 0.056
0705-E2-003-0
1620-06.0.004
1401-01.4.018
06S0-02.1.011
0650-09 .. 2.079
0704-052SPKCLA
0650-01.6.027

B
B
B
B
B
B
B
B
8
B
B
B
B
B
D
A 7072--UT-OB~
B 06S0-01.3 .. 007
B 0650-01 .. 6.030
B 0704-0264ASA~4
B 0704-0830'.qSTP
I:) 0104-0S30MISH'
B 0704-0496CSOS2
0 0704-0420C5D51
B 0704-0223CLMST
0305--AT-007
06S0-09.2.058
1620-09.6.001

API:

•
HSTRAIN GAGE DATA REDUCTION. T
IISTRAIN ROSETTE DATA REDUCTION
AP-TVPE OPTIMAL ASSEMBLY PROGRAM STRAP
IISO
ALYSIS PROGRAM.
1ISTR-AP .. STEPwISE REGRESSION AN
AP TYPE OPTIMAl ASSEMBLY PROGRAM STRAP 4000
IISO
/tPIPE STREES ANALVSIS
APEREO HUB. CARD.
II-S-109 STRESS ANALYSIS OF f\ FLhNGED T
A TAPERED HUB. CARD IIII-S-I00 STRESS ANALYSIS OF flANGE WITH
RUCTURES
IISTRESS ANALYSIS OF OPEN-wEll ST
ATION OF PIPING SYSTEM EXPANSION STRESSES
JlCALCUL
FROM REMING TO IBM OATA EQU..
HSTRIOE II- SUBROUTINE FOR TRANS
FMCTR,LINK,I-IOVE,OPHLT,SEQCK,SIGN,STRIP,VMCTR
IIGSEL,
OPTION BRf.TRANS&IND. ADD. CONV
ItSTROBIC-SKELLY TR. ROUT. wiTH
RYSTAllOGRAPHY
IIA GEN£.RAL STRUCTURE FACTOR PROGRA,," FOR C
NSTRUCTURE FACTORS
IISTRE~S ANALYSIS Of- OPEN-WEB STRUCTURES
IISTUDENT INPUT-OUTPUT
IISTUDENTS T AT .. os LEVEL
RPOSE ESTIMATION FOR RElIAI3ILlTY STUDIES
f/MULTI-PU
NECONOM I C CONDUC TOR STUDY
IIDIVERSITV STUDY
ORDERS OF THE BESSEL FUNCTIONS Y St.:B K TlMlS
"ALL
NALL ORDERS OF BESSEl FUNCTION J SUB K TIMES
OR I
NBESSEL FUNCTION Y SUB N IX/ ..
TO flOATING DECIMAL
IIFlOATER-A SUB. TO CONVERT NO. FRQr) FIXED
ING TO FIXED DECIMAL
IIFIXt:R, A SUlI .. TO CONVERT NO. FRO"1 FLOAT
IlANALVSIS OF COVARIANCE DISPROP. SUBCLASS NUMB~RS
IIANALYSIS OF VARIANCE,OISPROP. SUBCLASS NUMBERS
111620 SUBDIVISION PROGRAM. TAPE·
IIr..H ROOT FIXED POINT SL:BROUTINE
/lNTH ROOT flOATING POINT SUBROUTINE
NFLOATJNG POINT SQUARE ROOT SUBROUTINE
IIROOT FINDING SUl:lROUTINE
II-EN • X .. SUOROUTINE
11K IN • X .. SUBROUTINE
II-FLOATlNG POINT SQUARE ROOT SUBROUTINE
/tCLEBSCH-GORDAN COEFFICIENT SUlJROUTINE
liS QUARE. ROOT SL'BROUTINE
NSORTING SUBROUTlN~
IISC:UARE ROOT SUBROUTINE.
II'SIN-COS SUBROUTINE
IIBESSEL FUN(. nONS SUDROUTINE
U AND ,,"DeIFIED MATHIEU FUNCTIONS SUBROUTINE
#MATHIE
IIHARIo'ONIC ANALYSIS SUBROUTINE
NlAGRANG I AN ttHERPOLA TI ON SUBROUTI NE
IICONTINUEU FRACTION SUBROUTINE
"EIGENVALUE SUBROUTINE
IIARC SINE - ARC COSINE SUBROUTINE
#GMITR3 ITERATION SUBROUTINE
N ITERATION SUBROUTINE
1I00Uil
LE PRECISION flOATING POINT LOAD SUOROUTINE
NDETERMINANT EVALUATING SUBROUTINE
II'DOUBL
E PRECISION flOATING POINT PRINT SUBROUTINE
IISIMUL TANEOUS EQUATIONS SUBROUTINE
NSINGLE INTEGRATION SUOROUTINE
MDOUBLE INTEGRATION SUBROUTINE
II-TRIPLE INTEGRATION SUBROUTINE
#ARBITRARY CURVE PLOTTI:R SUBROUTINE:.
fl-MONITOR SUBROUTINE
UTt-'OSPHERIC DATA SUBROUTINE
TlNUOUS DERIVATIVE INTERPOLATION SUBROUTINE
IICON
tl-GENERAL ROOT FINDER FORTRAN SUBROUTINE
I#MUL Tl-OIJ-!
ENS ION SYI-IBOLIC FORTRAN 11 INPUT SUBROUTINE
#704SAP-CODED MATRIX DIAGONAlllATI0N SUBROUTINE
IIPAGE HEADING OUTPUT FORTRAN I I SUBROUTINE
liNEAR
LY TR!ANGULARIlATION OF A MATRIX SUBROUTINE
1 flOATING POINT OR INTEGER DUI-'P SUBROUTINE
IIFN I
"EIGENVECTOR DETERMINATOR SUBROUTINE
NFN II SINE-COSINE INTEGRAL SUBROUTINE
/I.
A 6 DIGIT flOATING POII'H ARCSINE SUBROUTINE
#FN I I ERROR WALK-BACK SUBROUTINE
HRANOOfol TABLE LOOKUP SUBROUTINE
/lFN II FACTORIAL COMPUTATION SUBROUTINE
/JPOLAR POINT PLOT SUBROUTINE
#FLOATING-POINT SQUARE-ROOT SUBROUTINE
f:.O,PACKAGEO,ON-LINE INPUT-OUTPuT SUBROUTINE
IIGENERALIl
UF I X.ED PO INT EXPONENTI AL SUBROUTINE
/lOCO OUTPUT SUBROUTINE
'LINEAR PROGRAMMING SUBROUTINE
IIFLOAT ING POINT NTH ROOT SUBROUT INE
IIFlOATING POINT N FACTORIAL SUBROUTINE
IIHOA
TING POINT NUMERICAL INTEGRATION SUBROUTINE
NFLOA
TING POINT NUMERICAL INTEGRATION SUBROUTINE
IIBINARY TO BCD CONVERSION SUQROUTINE
NOOUBL
E PRECISION flOATING POINT PRINT SUBROUTINE
IIPOPOUT
A
GENERAL PURPOSE PRINT ANO PUNCH SUBROUTINE
lIATr-'OSPI1ERIC OATA SuBROUTINE
'INTERVAL ARlTl-iMETIC SUBROUTINE
N GENERAlIZEO OUTPUT SUBROUTINE
NARDC ATMOSPHERE SUBROUTINE
IIFCRTRAN II BINOMIAL COEFFICIENT SUBROUTINE
NCUBE ROOT SUBROUTINk:
flPSUEOO-INVERSE SUBROUTINE
UP I-STAR SU8ROUTINE
COND OROER OIFFERH.TIAL EQUATION SUBROUTINE
"SE
I#GEr~ERAL PURPOSE PLOTTING SUBROUTINE
IISINGLE OR DOUBLE INTERPOLATIOb,\ SUBROUTINE
IICURVE PLCTTiNG SUBROUTlNI:
/tBINARY PUNCHING Sl.BROUTINE
IJFLOA
TING-POINT 109 NATURAL LOGARITHM SUBROUTINl:
IIFLOATING-POINT ARCFUNCTION SUBROUTINE
HFLOATlII.G POINT SC:UARE ROOT SUBROUTINE
/lFLOATING POINT ARCCOSINE SUBROUTINE
IIBUFFERED CARD-INPUT SUBROUTINE
NDOUfI
LE PREC. flOATING PT EXPONENTIAL SUBROUTINE
119X9 TEN MILllSECONO MULTIPLY SUBROUTINE
#SCUARE ROOT SUBROUTINE
IISINE-COSINE SUBROUTINE
IIFlDAT SUBROUTINE
#FIX Sl;13ROUTIM:
IIvARIABLE FIelD SQUAR( ROOT SUBROUTINE
NFl
XED POINT SQUARE ROOT. CLOSED. SUBROUTINE
;;CUSEROOT SUBROUTINE
I./SCUARI: ROOT SUBROUTINE
NINTERPOLATION SUBROUTINE
/tRIINOOl-1 NU~BER GENI:RATOR SUBROUTlt~E
#ARCTANGENT SUB~OUTINE
/lLOAO SUI:\ROUTINE
flTAPE CHECK SuBROUTINE
IISINE AND COSINE SUBROUTINE

1J
0
B
B
Ii

D

13
B

B
B
B
B
B
B
B
A
A
A
t\
B
D
B
B
B
B
B
B
B
[l

1620-09 .. 6. 002
0650-09 .. 5. 00'1
0650-01.1.007
1620-06.0.00'~

0650-01.1 .. 012
06S0-09 .. 5 .. 002
1620-09.1.005
1620-09.1.00 1,
06S0-09.2.038
0650-09.5.001
1',01-01.4.013
0705-BW-002-0
1620-01.4.004
7070-07.S .. 001
0650-08.4.001
0650-09.2.03B
0709-1007RL03'J
0704-08370RTOS
0704-1058WLREL
0650-09.4 .. 009
1401-09.4.001
0109-0985RWBF3
0709-0984RWBF1
0704-0104RWBF4
7010-08.9.001
7070-08.9.002
0650-06.0.057
0650-06 .. O. 058
1620-09.2 .. 001
06S0--LM-001
06,)0--LM-009
0650--LM-OI0
0650-07.0 .. 004
0650-07.0.008
06S0-07.0.009
0650-07.0.011
0650-07.0.012
0650-03.1.001
0650-01.1.011
0650-03.1.002
06S0-03.1.010
0650-03.2.005
0650-03.2.006
0704-0121GMHAS
0704-0197WKlIN
0704-0225GrlCFR
0704-0225GMEIG
0704-0246NA135
0704-0259GMITR
0104-035SGHI TR
0704-01BSBSCON
0704-0355GMOE:. T
0704-0385BSOUT
0704-03S5GMS I M
0704-0168NA274
0104-036BNA275
0704-0368NA276
0704-0284WHWH2
0704-0302NYMON
0704-034lAAATM

B
l:I
B
B
B
B
B
B
B
B
B
B
B
B
B
l:I
B
B 0704-0760G~COI
B 0704-0635RWGRT
B 0704-0848ARSYM
B 0704-0697MIHOI
[J 0704-0B4BARHED
[J 0104-0635RWNTR
B 0704-0848ARO"'P
B 0704-0635R~VC T
B 0704-084SARCS 1
13 0104-0649IBASN
0704-0848ARFER
0704-0S51CSOEV
0704-0B48ARTOR
0704-0556ERPLO
0704-0B17GIFPS
B 0704-0573CFOCI
Q 0704-05101 BEXP
B 0704-05008SE"'0
B 0704-0523SCMUS
B 0704-0525PKNOO
U 0104-0525PKFAK
Po 0704-0525PKLt\Q
B 0704-0525PKlEQ
Il 0704-0525PKBCD
H 0104-0529QSOUT
U 0704-0422NOPOU
0704-04 36AAA T M
0704-0B30I!3INT
0704-0988NUOUT
0704-0881HKAHt
B 0704-0918M[PYR
Ll 0104-0931PKCBR
B 0704-0931PKPS I
t\ 0104-I062PKPST
B 0704-10738COI F
B 0704-1085UMPLO
B 0704-1129AQALL
0105-AO-004-0

o 109-0942MLPU[~

0709-0S92RWL"-Il
0109-0B93RWAF3
0709-06191USCR
0109-0507IBACS
0709-0633WDCRU
0709-0839IBEXD
1/.01-03 .. 0.001
1401-03.0.001
1401-03. O. 005
1620-01.6.012
1620-01.6.011
1620-03.0.001
1620-03.0.002
1070-08.3 .. 00S
7070-08.3.007
7070-08.6.001
1070-11.7.002
7070-08.1.012
7070-02.4.005
7070-03.4~00/~

7010-08.1.002

29

#TRIGONOMETRIC FUNCTION
NARCTANGENT
#SINE COSINE
IIHYPERAOLIC TANGENT
f/MOOULO 2PI CONVtRSI0N
IJSINE AND COSINE
IHANGENT COTANGENT
#INVERSE TANGENT/COTANGENT
/lXY
NARCSINE ARCOSINE
BOLIC SINE, COSINE AND COTA"lGENT
IISINE COSINE
IILOGARITHM
IIEXPONENTIAL
IIEXPONENTI AL
IINATURAL LOGARITHM
fl-SCUARE ROOT
IISCUARE ROOT
NSCUARE ROOT
IIGE"NERAUlED INTEGRATION
iI'ISENTROPIC PRESSURE CHANGE
IlERROR DETECTION
N4-POINT GAUSSIAN INTEGRATION
ENSICN SYMBOLIC FORTRAN II INPUT
D,PACKAGED,OFF-LINE INPUT-OUTPUT
CIS ION FLOATiNG POINT ARCTANGENT
ISION flOATING POINT EXPONENTIAL
EGREE LEAST SC:U COEF COMPUTATION
TANEOUS LINEAR EQUATION SOLUTION
IN & TABLE LOOKUP, INTERPOLATION
SIaN FLOATING POINT INTERPRETIVE
IIIDA EDIT
/lEDIT
IIF/F AFP
111620 EDIT
HIOA-EDIT
HF/F AFP
ItOPEN
N EDIT DECK
IIMONlTOR
NFLOATING-POINT 7090 ARCTANGENT
liSPS TO FORTRAN
#SPS TO FORTRAN
.. FUNCTION
IIXRANF •
IIRSTR .. FUNCTION
IIFORMAT CONTROL
#FlOATING POINT
HM FOR
ION
II-A~ INTERPRETIVE
05
#FLOATING POINT

SUBROUTINE
SUBROUTINE
SUBROUTINE
SUBROUTINE
SL:I:IROUTINE
SUBROUTINE
SUBROUTINE
SUBROUTINE
SUBROUTINE
SUBROUTINE
SUBROUTINE
/lHYPER
SUBROUTINE
SU[lROUTINE
SUBROUTINE
SUBROt.:TINE
SUBROUTINE
SUBROt:TINE
SUBROUTINE
SUBROUTINE
SUHROUTINE
SUBROL.:TINE
SUEIROUTINE
SUHROUTINE
SUBROUTINE
/lSINGLE Dlf-'
SUBROUTINE
IIGENERALIZE
SU8ROUTINE
./IDOUeLE PRE
SUBROUTINE
/lDOU8LE PREC
SUBROUTINE
IIFN II NTH 0
SUBROUTINE
HFN II SIMUL
SUBROUTINE
IIlABLE READ
SUBROUTINE
fillOUflLE PRECI
Sli£lROliTiNE
CARD..
SUI3ROUTINE
CARD"
SUBROUTINE .CARD*
SUBROUTINE *TAPE ..
SLBROUTINE *TAPE.
SUBROUTINE .TAPE"
SUBROUTINE ADDITIONS TO FORTRA
SUBROUTINE AND OUTPUT PROGRAM
SUBROUTINE COMPUTES
SUBROUTINE Eorr
SL.:OROUTINE EDIT" REVISION.
SUBROUTINE FOR A BASIC FURTRAN
SUBROUTINE FOR DASIC FORTRAN *
SUBROUTINE FOR CARD FORTRAN
SUBROUTINE FOR NATURAL LOGAR IT
SUBROUTINE FOR THE ERROR FUNCT
SUBROUTINE FOR THE rB~ RAMAC 3
IISUBROUTINE FOR THE IBM 7070
NARC~INE X SUBROUTINE FOR THE IB'" 7070
/lSUI3ROUTINE FOR THE 1070
JlSUBROUTINE FOR THE 7070
I/SUBROUTINE FOR THE 1070
NG TO JB~ DATA EQU"
IISTRIDE" SUBROUTINE FOR TRANS FROM REMI
IIGENERAL LOGICAL CORE SORT SUBROUTINE FOR 32K104
/lSWCHF SUBROUTINE FOR 650 FORTRAN
POINT TO FIXED POINT *
/;/SUBROUTINE FOR 7070 .. FLOATING
INT TO FLOATING POINT *
ttSUBROUTINE FOR 7070 * FI XED PO
ftGENERAL CARD LOADER SUBROUTINE GROUP
MEMORY ALLOCATION
/;/ BINARY SUBROUTINE IDENTIFICATION AND
Fl.
!JFN II BINARY SYl-l,(lOllC SUBROUTINE LOADER WITH FL .. PT.O
IISUBROUTINE LOG EX FOR THE 7070
HFOR TRANSrr SUBROUTINE PACKAGE
IIFORTRAN SUBROUTINE PACKAGE
IIFORTRANSIT SUBROUTINE PACKAG[
IIFORTRAN MAP AND MISSING SUBROUTINf: PRINT-OUT PROGRAM
AC,MC,IRA,IRB,IRC.
itTHIS SLBROUTINE SAVES THE CONSOLE I
AC,~Q,IRA,IRB,IRC,
#THIS SUBROUTINE SAVES THE CONSOLE I
W OF CONTROL
IIFlACK TRACE SUBROUTlNE WHICH DESCRIBES FLO
JJPOL YNOfJ I til EXPANS ION SUBROUT INE.
#FN II AREA SET GENERATOR SUBROt.:TINE.
E PREC. FLOATING PT. SQUARE-ROOT SUBROUTINE.
IIDOUBL
"GENERAL ORTHONORMAlIZING SUBROUTINE.
SDETERMINANT EVALUATOR FCRTRAN SUBROUTINE.
TAPE CREATING PROGRAM AND LOADER SUBROUTINE.
II
#RANDOM NORMAL DEVIATE SUBROUTINE.
NGENERAL CATHODE RAY rUBE COUPLE SUBROUTINE.
HDOUBLE PRECISION ARCSIN/ARCCOS SUBROUTINE.
flFORTRAN 2 INTEGRATiON SUBROUTINE.
NADCRESS LOCATION SUBROUTINE..
S FOR OR ~ONTE CARLO PKG. INOT A SUBROUTINEI
HCONSTANT
ET"'OD
IIlTERATIUN SUBROUTINE, INTERVAL-HALVING M
ATURE fo'ETHOD
"INTEGRATION SU8ROliTINE, 10 PT. GAUSS QUAQR
gUTllITY SUBROUTINES
#ERCD flOATING DECIMAl POINT SUI:IROUTINES
HTEXAS ENGINEERING SL.:BROUTINES
#MAD TRANSLATOR AND ASSOCIATED SUBROUTINES
If CARD SYSTEMS SUBROUTINES
:HAPE READlfIIG AND WRITING SUBROUTINES
MENTAL FlOATING-DECIMAL FUNCTION SUBROUTINES
nWISCONSIN FUNDA
IISTANDAROIZED UTILITY DfCK OF SUBROUTINES. SUDS'"
NS
/lA SET OF INTERPRETIVE SUeROUTINES FOR BESSEL FUNCTIa
"FLOATING POINT SUBROUTINES NORMALIZED
IIBASIC 709 I/O CONVERSION SUBROUTINES.
Nf>'URA MATHIX ADD OR SUBTRACT, FIXED POINT
Hf"ATRIX SUBTRACTION
LE PRECISICN MATRIX AOOITION AND SUflTRACTION.
lIooua
#ADOS OR SUBTRACTS ThO FOURIER SERIES.
7090 LINEAR PROGRAMMING SYSTEM - SUCESSOR TO SCROL
If
/lSUCKER ROO PUMP DESIGN
EO UTILITY DECK OF SUBROUTINES" SlJDS ..
flSTANDAROIZ
11650 SOAP COrltTROL PANEL WIRING SUGGESTION
HFLOATING PT. COWELL I2NO SUMI, RUNGE-KUTTA INTEGRAT ION
IIBID SUMMARIES
HW-6TABLt SUMMARY
#TRAFFIC SL.:MMARY
NCRITICAl PATH AND RESOURCE SUMr-'ARV CALCULATION
11-709017070 SUMULATION
IISUPERUEVATION TABLES
HENT!-' ARC LGTH .. INTERPOLATION FOR SURFACES ANU CURVES
III-'IN
4 SURGE!
IICD SURGE /709-90 CONVERSIU,'Ij OF 70

30

P,
1:1
[J

Il

B
B
B
B
B
B

B
[l

B

8
B
A
1:1

B

B
B
[!

B
B
B
A

B
B
B
B
B
B
8
B
B
B
fI
B
[}
B
B
A
A
A
B
[}
A

B
B
B
IJ

B
B
B
0
B

7070-08 .. 1 .. 007
7070-0fl.l .. 010
7070-08.1 .. 011
7070-08.1.013
7070-08.1.014
7070-08.1..015
7070-08.1 .. 016
7070-08.1.017
7070-08.1 .. 018
7070-08.1.019
7070-08 .. 1.020
7070-08.1.021
7070-08 .. 2.005
7070-08.2.006
7070-08.2.007
7070-08.2.008
7070-08.3.008
7070-08.3.009
7070-08.3.010
7090-1132MAGIN
7090-109SWHISO
7090-1217NUTRA
7090-1230EOGAS
0704-0A48ARINS
0704-0620CFOQ9
0709-1l48NODPA
0704-0B06II:IEXD
0704-0B48ARPLN
070'f-0848ARNXN
07Q4-0659GCTLU
0704-0385BSINT
1620-01.6.005
1620-01 .. 6.011
1620--LM-022
1620-01.6.010
1620-01.6.002
1620--LM-023
0704-10811ROSR
0704-0302NYMON
0709-1016RWAT3
1620-01.6.007
1620-01.6.009
7070-01.9.002
7070-01.9.001
1620-01.6.017
0704-0525PKLGA
0650-03.2.003
0305--LM-006
7070-08.1 .. 00'{
7070-08.1 .. 006
7070-08 .. 3.004
7070-08.1a005
7070-08 .. 2.003
1401-01.4.013
0704-10540SS(A
0650-01.6.042
7070-02.4.002
7070-02.4.003
0704-0446P(CSM
0704-0739ARPEK
0704-0848ARASS
7070-08.2.004
0650-01 .. 6.040
0650--LM-Ol1
0650--LI-1-012
0704-0909MPMAP
0704-0345ELSAV
070t.-0345ElSAV
0704-0907111UBAC
0704-0611AVPOL
0704-0848ARGEN
0704-0727IBSQ[)
0704-0B50BSORT
0704-0635RWOET
0704-0734PFPRO
0704-0550C"SDEV
0104-0439NA029
0704-053BNOASI)
0704-0539GLGAU
0709-1120ATLOC
0704-07430RMOC
0704-0327GMlTf{
0704-0237GLGAU
06~0-01.6.041

B
B
H
B
B
B

R
B
[J

f3
[J

B
n
B
B

0650-02.0.009
0650-09.2.010
0704-1101UMMAQ
1401--LM-007
1401--10-040
0650-03.1.032
0650-03.1.034
0650-03.2.007
1401-03 .. 0.00tf
0709-0388GS7IO
0704-0432MUMAS
0704-0085CLMSB
0704-07 f t4AMDPA
0704-0788IBASF
7090-1l951KLP9
0650-09.6.007
0650-03.1.034
0650-12.0.006
0704-0715RWDE6
0650-09.2.048
0650-09.2.071
0650-09.2.076
7090-11580RCPS
7070-05.1.008
0650-09.2.031
7090-1095WHSSI
7090-1095WHHSS
0650--SV-IOl
1410--SV-907
7080--SV-115
0704-0487DAZOO
0650-08.3.001
0650-06.0.021
0650-09 .. 2.051
0704-0483r~A02g

0709-1063GE:QUD

#704 SURGE OBJECT LOADE.R

11704 SURGE SYSTEM
#704 SURGE SYSTEM START
SURGE 1709-90 CONVERSION OF 704 SURGE!
NQD
HRAYTHEON RAETOR SURVEY· CODES" 7G,2RI •
HSURVEY TRAVERSE
SlAND AREA - SURVEY TRAVERSE
HSURIJEY TRAVERSE PROGRAM
#FIVE LAND SURVEYING PROGRAMS
NSUSPENSION BRIDGE ANALYSIS
YS ICS
"IIS"AP ~U AND NU NUCLEAR-CODE PH
AN
#SWCHF SUBROUTJNE FOR 650 FDRTR
NrNPUT PROGRAM UNDER SENSE SwITCH CONTROL
#T IllE, HALT ANI) S .... ITCH PROGRAM
ON OF A f.'INIMUfo' TWO-LEVEL AND-OR SWITCHING
filCOMPUTATI
OMPUTATION OF A MIN 2 LEVEl f:./OR SWITCHING CIRCUIT
NC
5TH' INDEXING REGISTERS
filSYM TRACING ROUTINE FOR 650 SY
3 • REAL & COMPLEX ARlTHMETIC • IJSYMB INTERP SYS FOR IBM 650-65
11650 FORTRAN SYMBOL EQUIVAUNCE TABLE
T - GENERAL PURPOSE LANGUAGE FOR SYMBOL MANIPULATION
!JCOMI
f/RELATIVIlE SYMBOLIC DECK
IIAN EDITOR FOR SAP SYMElOLIC DECKS..
OUTINE
r'#SIt-;GLE DIMENSION SYMBOLIC FORTRAN II INPUT SUBR
OUTINE
NMULTI-OIM(;NSION SYM130LIC FORTRAN II INPUT SUBR
#A CONDENSER ROUTINE FOR SVMBOLIC INFORMATION..
RIAL NUMBERS.
II UPDATE SYMBOLIC PROGRAM TAPE USING SE
BLY ON THE IBM RAMAC 305
J,lSYMBOLIC PROGRAMMING AND ASSEM
S 1
IISYMBOLIC PROGRAMMING SYSTEM SP
S 2
If SYMBOLIC PROGRAMMING SYSTEM SP
• SPS • • CARD
Jl1620/1710 SYMBOLIC PROGRAMMING SYSTEM.
SPS . . . TAPE
81620/1710 SYMBOLIC PROGRAMMING SYSTEM *
H FL.PT.OFL.
NFN II BINARY SYMBOLIC SUI3ROUTINE LOWER WIT
11709 SYMBOLIC TAPE EDITING PROGRAM
ON
HSYMBOLIC TO AUTOCODER CONVERSI
NMODIFIED SYMBOLIC TRACING ROUTINE' IIPERIPHERAl EQUIPMENT SYMBOLIC TRANSLATOR
#704 TO 709 SYMBOLIC TRANSLATOR
NPOSTMULTIPLY REAL BY SYMETRIC REAL MATRIX
PAND TRIANGULAR MATRIX TO SQUARE SYMMETRIC FORJ.1,.
flEX
NVALUES AND EIGENVECTORS OF REAL SYM~ETRIC MATRICES
UEIGE
BI METHOD
fl-EIGENVALUES OF REAL SYMMETRIC MATRICES BY THE JACO
POINT
IIEIGENVAlUE FOR SYf.',METRIC MATRICES IN FLOATING
SYSTE,....
#EIGENVALUES OF REAL SYMMI:TRIC MATRICES ON 1620 DIP
DIP SYS
ifEIGENVALUES OF REAL SYMMETRIC MATRICES ON THE 1620
ALUES AND £IGENVECTORS OF A REAL SYM~ETRIC MATRIX
NEIGENV
flEIGENVALUES AND EIGENVECTORS SYMMETRIC MATRIX - FI
NSYMMETRIC MATRIX INVERSION.
FORM.
IICDNTRACT SQUARE SYMMETRIC MATRIX TO TRIANGULAR
GENVALUES AND VECTORS OF A REAL, SYM~ETRIC MATRIX.
/lEI
NCPERATE ON A REAL, SYMMETRIC MATRIX.
GRAMMING
#THE SYMMETRIC METHOD OF LINEAR PRO
EQUATIONS
NSYMMETRIC SIMULTANEOUS LINEAR
NSYMMET~ICAl MATRIX INVERSION
ION
#VECTOR BY SYMMETR"ICAL MATRIX MULTIPLICAT
TY * CVL ..
HSEISMOGRAM SYr.j FORM CONT. INTERVAL VELOCI
H709 VIPP SYNONYM DECK
HDIFFERENTIAL FOURIER SYNTHESIS
ECHANISMS
HKINEMATIC SYNTHESIS OF PATH GENERATING M
#305 RAMACODER PROGRAMMING SYSTEM
IISTRAIGHT LINE BRIDGE GRID SYSTEM
61401 ASSEMBLY ON THE 650 TAPE SYSTEM
NSPEED CODING SYSTEM
1110-3 INTERPRETIVE SYSTEM
EO 650 FORTRAN-SCRUB PROGRAM~ING SYSTEM
fl'MODIFI
flDIFFERENTIAL EQUATION SOLVING SYSTEM
IIINPUT-OUTPUT SYSTEM
IILINEAR PROGRAMING SYSTEM
liTHE F SYSTEM
Ii CCRBIE, AUTOfJATIC OPERATOR SYSTEM
Ii- CHEBYSHEV TRUNCATION SYSTEM
/1704 SURGE SYSTEM
MACRO LOOK-UP FOR 705 AUTOCOOER SYSTEM
liNE""
#SOCOTT TAPE TEST SYSTEM
11709/7090 IPL-V INTERPRETIVE SYSTEM
IITAPE LIBRARY CONTROL SYSTEM
IIPROGRAM AND DATA FILE SYSTEM
If PROCESSOR OPERATING SYSTEM
117070 DUAL PROGRAM PROCESSING SYSTEM
N7070 PAT COMPILER SYSTEM
flSPDOL SYSTEM
OGRAM ANALYSIS * "lPA * COMPUTER SYSTEM
fI* ZEUS PR
FOR BElL LA130RATORY INTERPRETIVE SYSTEM
N704 COMPILER
ORDINARY r::IFFF.RENTIAL EQUATIONS SYSTEM
ftFlOATING POINT
ORDINARY DIFFERENTIAL EQUATIONS SYSTEM
IIFLOATING POINT
OCESSING LANGUAGE V INTERPRETIVE SYSTEf~
IHNFORMATION PR
ATIONS IN BELL LAB. INTERPRETIVE SYSTEM
/lcor~PLEX ARITH OPER
L SYMMETRIC ,..ATRICES ON 1620 DIP SYSTEM
IIEIGENVALUES OF REA
M AERONUTRONIC SIMPLIFIED CODING SYSTEM
/lASe SYSTE
111401 TCS * TAPE CONTROL SYSTEM..
o ONE INPUT-OUTPUT TAPE CONTROL SYSTEM
flFITS • FOURTEEN
HINTERPRETIVE PROGRAMM,ING SYSTEM
IPS
CARD
/IlNTERPRETIVE PROGRAMMING SYSTEM" IPS" • TAPE
11162011710 SYMBOLIC PROGRAMMING SYSTEM
SPS. oJ- CARD
#162011710 SYf'BOLIC PROGRAMMING SYSTEM
SPS * • TAPE
IIPAT UTILITY SYSTEM
10nOK *
IIPAT UTILITY SYSTEM
40K *
N 7090 LINEAR PROGRAMMING SYSTEM - SUCESSOR TO SCROL
IILINCOLN IPLV INTERPRETIVE SYSTEM - 709,7090
NCOMPLEX NUMBER INTERPRETIVE SYSTEM IFLOATING POINTI
ceDING SYSTEM"
/lASC SYSTEM AERONUTRONIC SIMPLIFIED
COT *
NMODIFIED ASSEMBLY SYSTEM CONVERTED TO TAPE" fMS
IiCALCULATION OF PIPING SYSTEM EXPANSION STRCSSES
HANALYZING SYSTEM FAILURE DATA
IIGENERAL PURPOSE SYSTEM FOR THE 650 L2
OGRAMS
ftDIGITAL TERRAIN MOOEl SYSTEM HORIZONTAL ALIGNMENT PR
#MATHEMATJCAL PROGRAMMING SYSTEM I-All SOLUTIONS
RAMf-1I~G LANGUAG[ EASY
HSYSTEM IMMEDIATElY MAKING PROG
HSYM TRACING ROUTINE FOR 650 SYSTEM INDEXING REGISTERS
IIFAST .. FOURTEEN 0, ONE AUTOMATED SYSTE~ OF TESTING.
FORTRAN ,uATH[MATICAl PROGRAMMING SYSTEM ONE
II
ROGRAM
NOIGITAl TERR.'lN MODEL SYSTE'" PRELIMINARY EARTHWORK P
AM OA-3
#DIGITAL TERRAIN MODEL SYSTEM PROFILE SMOOTHING PROGR
flCALCULATION OF ELECTRIC POWtR SYSTEM SHORT-CIRCUIT CURRENTS
ISION USING
IIUNEAR SYSTEM SOLUTION IN OOUBLE-PREC
"COMPLEX LU"EAR SYSTE~ SOLUTION PROGRAM
IISYMBOL IC PROGRAMMING SYSTEM SPS I
nSYfo'BOLIC PROGRAMMING SYSTEM SPS 2
11-704 SURGE SYSTH' START
R-I08 ..
IISYSTEM SUPERVISOR
SEE" 1410-P
AM TD-l
(lDIG[TAL TERRAIN MODEl SYSTEM TERRAIN DATA EDIT PROGR

B
B
B
B
B
B
B

B
B
B
B
B
B
B
B

0704-0877ECOLO
0704-0B77ECSUR
0704-0877ECSSO
0709-1063GEQUD
0650-08.2.024
0650-09.2.001
oQ650-09.2.054
0650-09.2 .. 021
0650-09.6.012
0650-09.2.034
0704-NUCLEAR
0650-01.6.042
0704-0206NY INP
0705-DE-002-0
0704-0787PKMIN
0704-1104PKMIN
0650-01.4.007
0650-07.0.016
0650-01.6.038

B

0709-119BMICO~1

B
B
B

8

8 0704-0116ClREl
B 0704-0960MI£OS
B 0704-0848ARINS
B 0704-0848ARSYM
B 0704-0959MICNU
B 0709-1009wOScR
A 0305--SP-003
A 1401--SP-021
A 1401--SP-030
A 1620--SP-020
A 1620--SP-021
B 0704-0848ARBSS
B 0709-0995FDEOI
B 0705-EQ-002-0
B 0650-01.4.011
B 0709-0961PPPES
B 0709-0557RL020
B 0704-0273CLMMP
B 0704-0460MIEXA
B 0704-1029ANF20
B 0650-05.1.006
B 0704-0260NA189
B 1620-05 .. 0.003
B 1620-05.0.004
B 0704-0664ANF20
B 0104-0474NUMXE
B 0704-0573CF009
8 0704-0460MICNT
B 0704-0460MIHOI
B 0704-0460MIOPM
B 0650-10.1.008
B 0650-05.2.010
B 0650-05.2 .. 0}3
B 0650-05.2.014
n 0650-09.6.018
B 0709-1137BW9SY
B 0650-08.4.002
B 0650-09.5.003
0305-02.0 .. 002
0650-09.2.058
0650-01.1.013
0650-02.0.005
0650-02.0.022
0650-02.1.010
0704-0144PKNIU
0704-0261GMIOS
8 0704-0108RSLPS
a 0704-0352GMFSI
B 0704-0372BSCRB
B 0704-1008IBCTR
13 0704-0871ECSUR
B 0705-PG-012-0
B 0705-51-001-0
B 0709-1027RSIPL
B 1401-02.0.001
B 1401-13.1 .. 005
A 1410--PR-I08
[l 7070-03.2.001
A 7070-04.4.002
A 7010--10-076
n 7070-01.9.004
B 0704-0470ELBEl
B 0104-0525PKNIO
B 0704-0525PKNID
B 0704-1006RSIPL
B 0650-02.0.012
B 1620-05.0 .. 003
B 1401-02.0.002
B 1401-01 .. 4.006
B 1401-01 .. 4.011
B 1620-02.0.002
B 1620-02.0.001
A 1620--SP-020
1620--SP-021
1410--AT-I04
1410--AT-I05
7090-1195IKLP9
7090-1l96LLIPL
0704-0B32BE;CPK
1401-02.0.002
1401-01.1.001
0650-09 .. 5.001
B 070'.-1059WLFAI
B 0650-02.0.008
B 0650-09.2.040
B 0704-1092RSMIA
B 0704-1096TVSMP
B 06S0-01.4.007
B 1401-01.4.004
B 0704-086.3RSMI
0650-09.2.042
0650-09.2.063
0650-09 .. 4.007
0704-0543PFSLD
0704-0522PFEl3
A 1401--SP-021
A 1401--SP-030
B 0704-0877ECSSO
A 1410--SV-907
B 0650-09.2.039

CULATIONS
NEUCTRICAL POWER SYSTEM TRANSIENT STABILITY CAL
JlMATHEMATlCAL PROGRAMMING SYSTEM TWO
HDIGITAL TERRAIN MODEL SYSTEM VERTICAL ALIGNMENT' PROG
IIGRIo SYSTEM VOLUME DETERMINATION
#704 SELECTIIJE MONITOR TRACE SVSTEM.
NONE PHASE MONITOR SYSTEt-l.
#-FORECASTING OY ECONOMETRIC SVSTEHS
IIFORE:CASTING BY ECONOMETRIC SYSTEMS
IIFORECASTlNG BY ECON01-4ETRIC SYSTEMS
ULTIPLE UTILITY PROGRAM FOR TAPE SYSTEMS
/1M
OVERHEAO ElECTRICAL DISTRIBUTION SYSTEMS ANALYSIS
II
IICARD SYSTEMS ERROR DETECTION AIOS
IIA GENERAL PROGRAM FOR SYSTEMS EIJALUATION
#lA PROGRAM FOR SOLVING SYSTEMS OF LINEAR EQUATIONS
E<;:UATIONS
#SOLUTION OF SYSTEMS OF SIMULTANEOUS LINEAR
/ICARD SYSTEMS SUBROUTINES
117070/214 COMPILER SYSTEMS TAPE
NCARD SYSTEMS UTILITY PROGRAMS
¥LINEAR PROGRAM SU:'S2
ODE NUCLEAR-CODE
/1.54 CYLINDRICAL GEOMETRY tEll C
HSTUDENTS T AT .05 LEVEL
IISORT S4 TI
F VELOCITY FUNCTION FOR REFRACT .. T/D DATA
ULEAST SQ .. OfTER. 0
/1104 PROGRAM TO GENERATE 1401 TIP PROG~ ON OUTPUT TAPES.
NGENERAL PURPOSE TAB-BACK PROGRAM
NlOAOOHETER W-6 TABLE
QUARE FOR UP TO 10XI0 CONTIGENCY TABLE
UCHI 5
UARE AND PHI FOR 2X2 CONTINGENCY TABLE
#CHI SQ
N6S0 FORTRAN SYMBOL ECUIVALENCE TABLE
"MINIMUM ERROR ROUTINE FOR STEAM TABLE DISTRIBUTION
IIOIVIDED DIFFERENCE TABLE FORMATION
fl'TABLE INlERPOLATlON
HABLE INTERPOLATION ROUTINE
N!NOEPENOANT TABLE LOADER
ItSQUARE TABLE LOOK UP
MN DIMENSIONAL TAOLE LOOK UP
HTRIIJARIATE TABLE LOOK-UP
I/.RANDOM TABLE LOOKUP SUBROUTINE
OROUTIN[
HABLE READ IN G TABLE LOOKUP. INTERPOLATION SU
ERTBL
/lCONSTRUCT A TABLE OF ERRORS FOR PRINTING-IIPRINT TABLE OF ERRORS--PRETB
INTERPOLATION SUBROUTINE
IITABLE READ IN £. TABLE LOOKUP,
NBINARY TABLE SEARCH
/HABLE SEARCH ROUTINE

" RAMS

GRANGIAN

13 0650-09.4.001
0709-}037SCM2
0650-09.2.041
0650-09.6.009
0704-070aWHSMl
7090-1094BESYS
0704-0963IB3FE
0704-0963IB4FE
0709-0'J63IB9Fi::
1401--UT-039
0650-09. 11.000
11,01--AT-Ol1
0704-12'.4ANCOO
11;01-11.0 .. 003
0650-0S.2.021
A tt;Ol--LM-OOl
7070--PR-07S
1401--UT-001
7070-06.1.001
1090-NUCLEAR
B 0104-0B310RTOS
A 070~--SM-OS2
0 06S0-09.6~020
II 0704-1231TVTPI'
B 1401-01.3.003
B 06S0-09.2~037
B 06S0-06.0 .. 01S
B 06S0-06.0~016
06S0-01.6.03B
7090-109SWHOSS
0704-0116CLODT
0704-03SSGMTA[
1010-08~6 .. 002
B 0650-01~2.011
B 010S-Af-013-0
H 7090-1204""ACm
B 0704-04S2SCTRI
13 0704-0S51CSoEIJ
B 0104-0659GCnU
B 0704-0391NOERT
13 0704-0391NOPRT
0704-06S9GCTlU
0705-PG-007-0
0704-0344RL014

INTERPOL:i~6~R~~~V~i~~~ i::t~~

liLA
NGENERAL TABULATION PROGRAM
#TALBOT SPIRAL INTl:.RSECTIONS
#TALBOT SPIRAL INTERSECTIONS
IH ANGENT
#TANGENT COTANGENT SUBROUTINE
rtOQUBLE PRECISION ARC TANGENT INSTRUCTION
#HVPERBOLIC TANGENT SUBROUTINE
NINIJERSE TANGENT/COTANGENT SUBROUTINE
flAT END HORIZONTAL CYLINDRICAL TANKS
NLIOUID VOLUMES IN
MSOAP 2L TAPE
MHOLLERITH CARO TO TAPE
IIWRITE CORE IMAGE ON TAPE
OS THE FINAL SORTED BIBLIOGRAPHY TAPE
ilREA
05 THE SORTED AUTHOR CROSS INDEX TAPE
IIREA
NCREAT( MASTER PROGRAM TAPE
IISEARCH MASTER PROGRAM TAPE
"FORTRAN WITH FORMAT FOR PAPER TAPE
ilFORTRAN PRE-COMPILER FOR PAPER TAPE
liSPS ONE PASS FOR PAPER TAPE
rtSPS TWO PASS FOR PAPER TAPE
RFORTRAN FOR PAPER TAPE
IIGOTRAN FOR PAPER TAPE
111070/214 COMP[lER SYSTEMS TAPE
DIMENSIONAL ARRAY BINARY INFO ON TAPE
#TO WRITE 2
NG, A FOURIER SERIES FROM BINARY TAPE
fiREAOS, WITH CHECK I
ItMULTITRACE .. TAPE..
111620 AUTOPLOTTER .. TAPE
IVE PROGRAMMING SYSTEM" IPS" • TAPE
IlINHRPRET
#650 SIMULATOR PROGRAM" TAPt.
IISIMULTANEOUS EQUATION PROGRAM
TAPE
NREGRESSION ANALYSIS PROGRAM
TAPE"
ISE MULTIPLE LINEAR REGRESSION
TAPE
IISTEPW
HOLYNO~1AL CURIJE FITTING
TAPE
#1620 SUBDIVISION PROGRAM
TAPE
/lCUT AND FILL
TAPE
InRAVERSE ANALYSIS PROGRAM
TAPE"
NGAS NETWCRK ANALYSIS
TAPE
NELECTRtC LOAD FLOW PROGRAM
TAPE
N8BC-vIK BASEBALL CEr40NSTRATQR
TAPE
IISTRAIN GAGE DATA REOUCTION
TAPE
INEAR PROGRAM"'ING FOR THE 1620
TAPE
NL
INVENTORY MANAGEMENT SIMULATOR
TAPE
~
#lESS 11
TAPE
MULATION OF A ONE-ARI-'ED BANDIT
TAPt:
1#1620 51
IICH1N(SE BAR AND RING PUZZLE
TAPE
Jl.EXECUTIVE GAME
TAPE.
I/BLACK JACK GAME
TAPE
LETE ASSEMf\LY ROUTINE ADAPTED TO TAPE
UCARAT I .. COMP
AST COST ESTIMATING£.SCHEoULlNG .. TAPE
#1620 LESS. LE
LETE ASSEMBLY ROUTINE ADAPTED TO TAPE
IICARAT II • COMP
LIC PROGRA~r-'.ING SYSTEM. SPS .... TAPE
111620/1110 SYMBO
NERTIA £. CENTROID CALCULATIONS. TAPE
1I!'I-I00 ~OMENT OF I
lEO ASSEMBLY SYSTEM CONVERTED TO TflPE
MASCOT"
IiMOOIF
I LOADER.
NFORTRM~ CARD OR TAPE /ROW AND/OR COLU11N BINARY
#SKIPS ONE FILE ON A DECIMAL TAPE AND PUNCHES
#lSI1"ULTANEOUS CARD TO TAPE AND/OR TAPE TO PRINTeR
OGRAM.
#TAPE ASS IGNMENT AND CONTROL PR
#TAPE CHARACTERISTICS
NT APE CHECK SUBROlJT I NE
HAPE CO,,",PARE • TPCMP ..
#TAPE COMPARE FOR THE 709
IIREAD-I-iRITE TAPE CONTROL PROGRAM
111401 TCS .. TAPE CONTROL SYSTEI.I ..
TS • FCURTEEN 0 ONE INPUT-OUTPUT TAPE CONTROL SYSTEM.
NFl
[
MCARD TO TAPE CONV[RSION-EDITING ROUTlN
#TAPE COPY AND COMPARE
UTAPE COPV PROGRAM.
#lONE CARD TAPE COPY ROUTINE
#lTAPE COPV ROUTINE
#TAPE TO TAPE COPY wITH CHANGES
InAPE CORRECTOR
IIFORTRAN SOURCE TAPE CORRECTOR
SION
#BINARY TAPE CORRECTOR. NON-SYSTE~ VER
ER SUBROUT INE.
HAPE CREATING PROGRAM AND LOAD

~6~~=~~9~~~~~1
06S0-06.0.04B
06S0-09.2 .. 04S
06S0-09.2 .. 071
0704-0 116CL TAN
7070-08~ 1.016
0704-0423BSATN
7070-08 .. 1.013
7070-08~1.017

B
A
B
B
B
B
B
B
A
A
A
A

0650-09.7.005
06S0--SP-204
0104-052SPKCTH
0704-0830MIWTP
0704-1144NC014
0704-1144NC014
0705-AD-OI0-0
070S-AO-OI1-0
1620--FO-003
1620--FO-005
1620--SP-00?
1620--SP-008
1620--FO-00I
1620--PR-OIO
A 7070--PR-07S
fi 0704-0910NUWTB
e 0104-07B8IBRFS
1620-01 .. 4.006
1620-01.6~001
1620-02.0~OOl

B
B
B
B
B
B
B
B
B

1620-02~O.005

1620-0S .. 0.001
1620-06.0 .. 001
1620-06.0.006
1620-07.0~001

1620-0942.001
1620-09.2.002
1620-09.2.007
1620-09.3.001
1620-D9~4.0Q1

1620-11.0 .. 008
13 1620-0C}.6.002
B 1620-10.1.001
B 1620-10.2.002
l} 1620-10.3.004
B 1620-11 .. 0.002
B 1620-11~O.003
B 1620-11 .. 0.004
[', 1620-11.0 .. 005
B 1401-01 .. 1~003
B 1620-10~3.001
B 1401-01.1.004
A 1620--SP-021
1620-09.3 .. 00')
1401-01 .. 1.001
D709-1163MWRCT
0704-1144NC014
1401-13.1.010
B 0709-0534CSENK
0705-SP-00I-C
7070-03.4.004
t\ 0705-NI1-003-1
B 0709-0S02RLTC9
B 0704-0403MITCR
B 1401-01.4.006
B 1401-01.4.011
B 0704-0387CE14f
010,)-0998RL039
0104-0733PFoUP
0704-0S40SC
B 7070-01 .. 4.001
070'.-0425W[3TTC
0104-0S0BOlTPC
1620-01.5 .. 001
B 0709-105~OIBTC
B 070't-0734PFPRO

IIREAD TAPE DATA.
0.
NDEC IMAL TAPE DUMP
0
NBINARY TAPE OUMP
B
INTI
#TAPE DUMP FOR THE 709/0CTAL Pit B
nAPE DUPLICATE AND COMPARE
B
"#TAPE DUPLICATION
[3
E.
/tUPE DUPL ICATION AND/OR COMPAR l}
111401 TAPE DuPLICATION OR COMPAIt"E
B
/lNUMERIC TAPE DUPLICATOR AND CORRECTOR
A
#TAPE DUPLICATOR FOR THE· 70')
B
#TAPE EDIT
B'
H09 SY~BOLIC TAPE EDITING PROGRAM
B
NSQUOIE TAPE FOIlOR
B
H COMPARE
#TAPE EDlTOR AND DUPLICATOR WIT B
/ilSTER
SIMPLE TAPE ERROR ROUTINE"
[\
'MATES" MASTER TAPE EXECUTARY PROGRAMS
13
111401 TAPE EXECUTIVE PROGRAM
8
nAPE FILE GENERATOR FOR TESTIN A
HSORTS THE OIBLIOGRAPHY TAPE FROM NC 13B
B
jH~EADS THE FINAL SORTED TAPE FROM NC 139
B
NREAQS THE SORTED BIBLIOGRAPHY TAPE FROM NC 142
B
IiSERVICE TAPE GENERATOR
13
lIT APE INPUT IOUTPUT
B
nAPE INPUT/OUTPUT
B
NH.Q~ USAF TAPE INPUT/OUTPUT PACKAGE
8
TINE
ItTAPE LABEl.TRA,CHECK POINT ROU B
NGEN. TRA ROUTINE PROG TAPE OPR TAPE LBLGTRAiLER CKN
B
#TAPE LIBRARY CONTROL SYSTEM
B
/ICARD TO TAPE LOAD
B
/lBINARY OCTAL CARD OR TAPE LOADER
B
MBINARY TAPE LOADER
B
fl'ARGONNE CARD TO BINARY TAPE LOADER
B
HARGONNE TAPE LOWER BINARY LOADER
B
IITAPE MANEUVERING ROUTINE.
B
/HAPE ,",.ERGE 2
A
nAPE OPERATOR PROGRAM /TOP/
B
liGEN .. TRA ROUTINE PROG TAPE OPR TAPE LBLC-TRAILER CKN
B
NGENERATE A FORTRAN II PROGRAM TAPE OR ABSOLUTE BINARY
B
'BINARY TAPE OR DRUM DUMP
B
#READ BCD TAPE OR ON-L INE CARD READER
B
#SIMULATING THE CARD 650 ON A TAPE ORIENTED 1070
B
412
fl'FN 11 BCD TAPE OUTPUT FOR FORMAT 12F6.0. B
M OCTAL TAPE PRINT
B
#SELECTIIJE TAPE PRINT
B
nAPE PRINT our
B
#1401 CARD TO TAPE PROGRAM
B
SALVAGE
IITAPE PROGRAM FINOER,WRITER,ANO B
NOPTlMILED TAPE READ FOR FORMAT 12F6.0
B
UTINES
nAPE READING AND WRITING SUBRO
/lQUADOCTAL TAPE READING PROGRAM
NTRAP .. TAPE RECORD ANALYZER PRINT •
#650 TO 7070 TAPE RECORD CONVERSION. XXA1S B
RTRAN
,
CONVERTS BCD TAPE RECORDS ACCORDING TO A FO B
AND AUTOCODER ASSHBLY
/HAPE REPORT PROGRAM GEN[RATOR
B
IICARO TO TAPE ROUTINE
A
HCOPY BCD TAPE ROUTINE
B
IIKEYS SEARCH 8CD
LISTING TAPE ROUTINE
B
IICHECK TAPE SETTINGS
B
MN CONVERTER.
fIICARD TO TAPE SIMULATOR AND ROW TO COLU B
#CARO TO TAPE SIMULATOR.
B
nAPE SOAP 2A
A
(HAPE SORT 2
A
NlAPE SORT 3
A
II
GENERALIZED TAPE SORTING ROUTINE
B
NTERPRETIVE SYS REVISED BELL LAB TAPE SYS
IIREVISEO BELL LAB I 13
111401 ASSE1'1BLY ON THE 6S0 TAPE SYSTEM
B
NMULTIPLE UllLITY PROGRAM FOR TAPE SYSTEMS
A
IHIULTIPLE TAPE TEST ROUTINE
#SOCDTT TAPE TEST SYSTEM
il401 TAPE TO CARD PROGRAM
#TAPE TO CARD UTILITY PROGRAM
'READ TAPE TO CORE
B
#LOAO BINARY CARD IMAGES FROM TAPE TO CORE AND DRUMS
B
Sl~ULTANEOUS CARD TO TAPE AND/OR TAPE TO PRINTER
/I B
TPOP
IITAPE TO PRINTER OR PUNCH" UC
B
NTAPE TO PRINTER PROGRAM
A
IITAPE TO PRINTER/PUNCH ROUTINE
A
IIUPE TO PRINTER/PUNCH SIMULATO B
NTAPE TO TAPE COPY WITH CHANGES 0
/H620 5-CHANNEL TAPE TRANSLATION PROGRAM
B
T wHICt-! IS
no ASSIGN TAPE UNIT USAGE OTHER THAN THA B
/I UPDATE SYMBOLIC PROGRAM TAPE USING SERIAL NUMBERS.
B
NCARD TO TAPE UTILITY PROGRAM
A
IIFORTRAN TAPE \;RI TE PROGRAM..
B
IISElF LOADING TAPE WRITE PROGRAM.
B
NPROGRAM TAPE WRITER
B
IISELF LUADING TAPE WRITING ROUTINE
NSELF LOADING TAPE WRITING ROUTINE
AND/OR FORTRAN I TO SELF-LOADING TAPE 1
MFORTRAN I I
FROM ASSEMBLY PROG
PRINT RECORD TAPE 40K
#lFlOW CHART LISTING
/lSIMULATION OF CARD OR TAPE 6S0 ON THE 1070
'B
B4 SIMULATION OF THE 714 CARD TO TAPE~
I/.721B4 ANO 80/ B
RAfof-lOAOING TO COPY MEMORY ON TO TAPE.
IIINTERRUPT FORT B
R SERIES AS ONE BINARY RECORD ON TAPE.
I/.WRITES A FOURIE B
SCAN.
/fBCO TAPE-CARD READING FOR MULTIPLE B
NBINARY TAPE-TD-CARD SIMULATOR
B
UCARO TO TAPE, BINARY
B
STRESS ANALVSIS OF FLANGE wITH A TAPERED HUB
CARD
115-100
B
109 STRESS ANALYSIS OF A FLANGED TAPERED HUB'" CARD..
#5- B
IIOUMP STORAGE, CORE, DRU,""
AND TAPES
B
'GENERAL MATRIX ABSTRACTION FROM TAPES
B
NREWIND TAPES
B
UDUMP STORAGE. CORE, DRUM, AND TAPES
B
fIIUNLOAO ALL TAPES
B
ENERATE 1401 T/P PROG. ON OUTPUT TAPES~
/1.704 PROGRAM TO G B
N CURVE FITTING
nAYlOR SERIES RATIONAL FUNCTIO B
111401 TCS .. TAPE CONTROL SYSTEM.
B
SYSTEM TERRAIN DATA EDIT PROGRAM TO-l
ltDIGITAL TERRAIN MonEL
#ACT-AUTO~AT Ie CHECKOUT TECHN IQUE
#TRANSPORTATION PROBLEM" DENNIS TECHNIQUE ..
HASE I I
IIS0RT 54 TECHNIQUE OF ,",ODIFICATION OF P
G
flTEMP-2 NUCLEAR-CODE ENGINEERIN
El ElEMENTS NUCLEAR-CODE
II TEMPERATURE DISTRIBUTION IN FU B
D
#TEMPERATURE OF SATURATED LIQUt D
o FROM ENTHALPY
NTEMPERATURE OF SATURATED LIQUt B
IITRANSIENT OR STEADY STATE TEMPERATURES
B
TlONS
«TEMPEST NUCLEAR-CODE CROSS-SEC B
SECTIONS
NTEMPEST-It NUCLEAR-CODE CROSS- B
IIROADWAY TEMPLATE GENERATOR
B
IIOESIGN TEMPLATE PROGRAM
B

0104-0S87NORTD
0104-042SWBPTD
1401-01.4~008

070,)-OS02RllD9
0709-08B7PPTDA
0705-IB 0007
0109-0717NA098
1401-13~1 .. 001
1.620--MI-016
010,)-0502RLTS9
1620-01.5.003
0709-099SFDEOI
0709-1000RSEOT
0704-0)18GMTEO
1401-01.4.018

7070-03.4~003

1401-01.4.015
7070--MI-0B4

0704-114 /,NC014
0104-1144NC014
0704-1144NCOI4
0704-042SWBSRV
0704-0690GDT I a
0705-SB-005-0
010S-AF-003-1
0705-SR-00I-0
0105-SR-002-0
1401-02.0.001
070S-AF-012-0
0104-0690GOBOT
0704-042SWBTSB
0704-0S03ANIlI
0704-0503AN111
0704-068BGKTMR
06S0--SM-401
0104-0382GSTOP
070S-SR-002-0
0704-07S4CEF2L
0704-0213NYBTD
0704-0073UACSH
7070-05.1.004
0704-1057TVMEP
0704-0301RL013
070S-EQ-006-0
0705-AF-Oll-0
1401-13~1.002

06S0-01.5.011
0104-079lTVMEO
1401--10-040
0704-0221UATSC
1401-01~4 .. 019
7070-02~4~001

0704-0495CV102
1401-01.3~002

06S0--UT-002
0709-0889GOBCO
0709-0921VGKEY
070S-PG-004-0
0704-10130RCTT
0109-0605WDCTS
0650--SP-202
06S0--SM-402
0650--SM-403
0704-0468CF006
0650-02.0~015

0650-01.1.013
1401--UT-039
7090-1113APMTT
0705-51-001-0
1401-13.1.003
1401--UT-028
0704-03B7CE14H
0704-039Sll010
1401-13.1~010

1401-01.4.016
1401--UT-026
06S0--UT-003
0709-0651WOTPS
0704-0425WBTTC
1620-01.6.014
7090-1l99PEIBL
0709-1009WOSER
1401--UT-021
0704-0899MEFOT
0704-0B99METOU
1401-13.1.008
0704-0781WH004
0104-0781WH004
0704-0769TvF2T
0705-1B 0003
7070-0S.1.005
0704-06760R714
0709-1164MWFOT
0704-07BBIBWFS
0704-0904SISCA
0704-04S5BETCB
0104-0425WBCTB
1620-09.7.004
1620-09.7 .. 00S
0104-0420CSOSI
0704-0367MBMTX
0704-0223ClMRT
0104-0496CSOS2
7090-1l75WOSTO
0704-1231TIJTPP
1090-llS0RLRAT
1401-01 .. 4.006
0650-09.2~039

1401-13.1.004
1070-12~9~001

0705-XE-OOI-0
0704-NUCLEAR
0650-08.2 .. 026
?090-1095WHTSL
7090-1095wHTSH
7090-12380RTOS
7090-NUCLEAR
1090-NUCLEAR
0650-09.2.070
0650-09.2.032

31

UTINE
.9X9
LETE GAMMA FUNCTION WITH POISSON
IADDS A
'CONVERTS A FOURIER SERIES
.COMBINES INDICES IN A FOURIER
.FITTING TO SELECTED
.DIGITAL TERRAIN MODel SYSTEM
• INTERP. P.ROG. OA-2 1 'DIGITAL
ATA EDIT PROGRAM TD-l
'DIGITAL
L ALIGNMENT PROGRAMS
'DIGITAL
ALIGNMENT PROGRAMS
'DIGITAL
RY EARTHWORK PROGRAM
.DIGITAL
MOOTHING PROGRAM OA-3
'DIGITAL
.MATRIX lOOP
LOW, UNDERFLOW, AND DIVIDE CHECK
TNI AND /LEVI WITH FLOATING TRAP
IGENERAL PURPOSE BOARD
IAUTO
,NON-PARAHETRICAL
ACTOR - FOURTEEN 0 ONE AUTO CONT
'MULTIPLE TAPE
ISOCOTT TAPE
IPROCEDURE FOR AUTOMATIC
nAPE FILE GENERATOR FOR
URTEEN 0 ONE AUTOMATED SYSTEM OF
'PRINT[NG CONSTANT DECIMALS AND

TEN MILLISECOND MULTIPLY SUBRO B
TERH
'NORMALIZED INCOMP 8
TERM TO A FOURIER SERIES.
B
TERM TO BCD FORM.
B
TERM..
B
TERMS OF A GENERAL POLYNOMIAL
B
TERRAIN DATA EDll PROGRAM TO-I B
TERRAIN MODEL SYS 4 POINT POLY 8
TERRAIN MODel SYSTEM TER.RAIN 0 8
TERRAIN MODEL SYSTEM HORIZONTA 6
TERRAIN MODEl SYSTEM VERTICAl 8
TERRAIN MODel SYSTEM PRELIMINA B
TERRAIN MODEl SYSTEM PROFilE S B
TEST
8
TEST
NOVERF B
TEST
'FORTRAN II fR B
TEST DECK
A
TEST GENERATOR - ATG •
A
TEST OF DISTRIBUTIONS.
B
TEST OPTIMIZING ROUT NF B
TEST ROUTINE
B
TEST SYSTEM
8
TEST-PATA
TESTING
A
TESTING _
.FAST - Fa B
TESTING RANDOMNESS OF DECIMALS B
'TEXAS ENGl~EERING SUBROUTINES
B
PUT
'PRINTER PLOT BCD TEXT GENERATOR FOR FORTRAN OUT B
ASSIGN TAPE UNIT USAGE OTHER THAN THAT WHICH IS
B
SSIGN TAPE UNIT USAGe OTHER THAN THAT WHICH IS
lITO A B
ITHERMAL ANALYZER
B
ITHERMAL ANALYZER
B
.STATISTICAL THERMODYNAMIC PROPERTIES
B
EAM AND WATER
,
THERMODYNAMIC PROPERTIES OF ST B
TER AND STEAM
UHERHOOYNAHIC PROPERTIES OF WA B
BEHAVIOR OF LIGHT HYDROCARBON MITHERMDOYNAMIC PROPS AND PHASE B
UTTA INTEGRATION
.SECOND,THIRD.AND FOURTH ORDER RUNGE-K B
o 200 OR 20S.
NGIVEN X, THIS PROGRAM CALCULATES LN X T B
OLE fAC,MQ,IRA,IRB,IRC,
ITHIS SUBROUTINE SAVES THE CONS B
OLE IAC,MQ,IRA,IRB,IRC,
JTHIS SUBROUTINE SAVES THE CONS B
ITHREACS
A
RADIUS TURNS
UHREE CENTER CURVES FOR SHORT B
S PROCEDURE.
ITHREE DIMENSIONAL LEAST SQUARE B
MTHREE DIMENSIONAL TlCK-TACK-TO 8
ROGRAM, PROCESS PANEL, POST TRACITHREE TRACE PROGRAMS. STORED P A
TKO NUCLEAR-CODE GROUP DIFFUSION THREE-DIMENSIONAL
, B
UFO NUCLEAR-CODE GROUP DIFFUSION THREE-DIMENSIONAL
II B
NTHREE-PDINT SOLUTION
B
nIC-TAC-TOE
B
UHREE DIMENSIONAL TICK-lACK-TOE
8
LOGICAL MEMORY SORT, MINIMUM TIME
B
'HUMAN REACTION TIME DEMONSTRATION ROUTINE
B
OGRAMS
'TIME ODHAIN FILTERING OF SEIS"! B
.SEASONAl ADJUSTMENT OF ECONOMIC TIME SERIES
B
ADJUSTMENT
ITIME SERIES DECOMPOSITION AND B
ITIME SERIES DECOMPOSITION AND B
ADJUSTMENT
.TIME SERIES DECOMPOS1TION AND B
ADJUSTMENT
.TlME SERIES ROUTING
B
IHIME SERIES TREND EQUATIONS
B
F FORMAT STATEMENTS AT EXECUTION TIME.
R READING 0 B
,MOVING AVERAGES OF TIME-SERIES DATA
'B
11K TIMES UNIT MATRIX
8
OF THE BESSEL FUNCTIONS Y SUB K TIMES Z
flALL ORDERS B
ROERS OF BESSEL FUNCTION J SUB K TIMES Z OR T
MALL 0 B
IPOLYNOMIAL ROOT EXTRACTION _ TIREX _
B
,TITlE, HALT AND SWITCH PROGRAM B
UKO NUCLEAR-CODE GROUP DIFFUSI 13
ON THREE-DIMENSIONAL
JTOLERANCE SIMULATION PROGRAM
B
IJSQUARE ROOT, TOPLER METHOD
B
'SLOPE TOPOG PROGRAM
B
,HASH TOTAL
A
.HULTICOMPONENT DISTILLATION TOWER DESIGN CALCULATIONS
8
tlTAPE COMPARE • TPCHP •
B
RATE MATRICES TO BE SOLVED BY NU TPll
BGENE B
nAPE TO PRINTER OR PUNCH - UC TPOP •
8
&IND. ADD. CONY
,STROBle-SKELLY TR.' ROUT.• WITH OPTION BRtJRANS Ii
L8L&TRAIlER CKN
'GEN. TRA ROUTINE PROG TAPE OPR TAPE B
nAPE LABEL,TRA,CHECK POINT ROUTINE
B
RED PROGRAM, PROCESS PANEL, POST TRACMTHREE TRACE PROGRAMS, STO A
.STORAGE HISTORY TRACE
B
NSElECTIVE TRACE
8
JFLOW TRACE
A
":SELECTIVE TRACE
A
ITRACE
&. 1A SIMULATOR
A
INDEXING REGISTER SIMULATOR WITH TRACE _ FIRSIFLOATING PT. AND n
N ~Efl:ORY PROGRAM
MTRACE AND RECORD ALTERATIONS I D
tlTRACE INSTRUCTION ALTERATION
B
OR 109
tlTRACE INSTRUCTION ALTERATION F B
MFLOW TRACE PROGRAM
B
UTPUT
/lTRACE PROGRAM FOR CARD INPUT/O D
, PROCESS PANEL, POST TRACtlTHREE TRACE PROGRAMS, STORED PROGRAM A
ES FLOW OF CONTROL
"BACK TRACE SUBROUTINE WHICH OESCRIB B
n04 SELECTIVE HONITOR TRACE SYSTEM.
B
H04 SELECTIVE MONITOR TRACE.
B
'SELECTIVE PROGRAM TRACE.
B
"SELECTIVE PROGRAM TRACE.
B
NTRAP TRACE, GI TRAP.
B
IIFlOW TRACER
B
WSNAPSHOT TRACER
B
"OPTICAL RAY TRACING
B
STHAN KODAK CON. EDISON TRANSFER TRACING
ilEA B
'ROOT TRACING
B
CENTROIDS OVER A ROAD NETWORK
HRACING A MIN. PATH 8ET. LONE
B
SRAY TRACING PROGRAM
B
IITRACING ROUTINE
D
NSElECTIVE TRACING ROUTINE
B
'GENERAL TRACING ROUTINE
B
NMODIFIED SYMBOLIC TRACING ROUTINE
B
NGENERAL TRACING ROUTINE
A
"PRINT 1 TRACING ROUTiNE
H
'ABBREVIATED PRINT 1 TRACING ROUTINE
e
INDEXING REGISTERS
'SYM TRACING ROUTINE FOR 650 SYSTEM B
ITRAFF IC SUMMARY
B
IJFORECASTING ZONAL TRAFFIC VOLUMES
B
NRAY TRAJECTORY MIGRATION
B
NSIX DEGREE OF FREEDOM DYNAMIC TRAJECTORY PROGRAM
D
OF SPECIAL CHAR
,"'OOS OF INTER TRANS. IT • CO~PILER FOR USE
B
EQU _
.STRICE - SUBROUTINE FOR TRANS FROM RE~ING TO IBM QATA R
M CONE STGe COfo!PU
'MOO BElL TRANS PROG FOR 650-653 MAG ORU B
o NU
IHHE TRANSCENDENTAL FUNCTIONS MU AN B

no

32

1401-03.0.001
7090-1117URGAM
0704-07881BATF
0704-078818CFT
0704-078B I BCIF
0704-1077GCOOO
0650-09.2.039
0650-09.2.062
0650-09.2.039
0650-09 .. 2.040
0650-09.2.041
0650-09.2.042
0650-09.2.063
0104-0085CLMLP
0104-0248CLOUO
0104-0848ARR/L
0305--MI-004
7070--AT-083
0704-0815PFTNP
1401-01.4.007
1090-1113APMTT
0705-51-001-0
1070--AT-082
1070--MI-084
1401-01.4.004
1401-11.0.004
0650-09 .. 2.• 010
0709-1118URPLO
7090-1199PEIBL
1090-1199PE!BL
0104-0671NA031
07Q4-0248CL THA
0650-09.3.006
0104-0428GSSTP
1090-1095WH005
0650-09.).002
0704-1233AAINT
0704-0498CA004
0104-0345ELSAV
0704-0345ELSAV
0650-02.1.012
0650-09.2.020
0704-0533CF009
0650-11.0.002
0305--AT-007
0104-NUCLEAR
0104-NUCLEAR
0650-09.2.056
0705-EQ-009-Q
0650-11.0.002
0704-0468CF005
0650-11.0.005
0650-09 .. 6 .. 021
0650-06.0.041
0704-0526TVTSD
0704-0861ERTSO
7090-1145ERTSD
0705-E2-002-0
0650-09.2.049
0104-0132PFMOO
0704-0335NYMAI
0704-0085CLMKO
0709-0985RWBF8
0109-0984RWBF7
1070-09.1.001
0105-0E-002-0
0704-NUCLEAR
0650-10.2.002
7070-0S.3.002
0650-09 .. 2.024
1620--MI-0151620-09.3.002
0105-NW-00'3-1
0704-1110NUGEN
1401-01.4.016
1620-01.4.004
0105-SR-00Z-0
0705-SR-OOI-0
0305--AT-007
0104-0264ASAS4
1620-01.4.001
1620--AT-013
1620--AT-014
1620-01 .. 4 .. 005
0650-01.6.050
0104-0395LL003
0704-1079NOTIA
0709-1090NOTIA
0704-0161UASPO
1620-01 .. 4.002
030'j--AT-007
0104-0907NUBAC
0704-070SWHSMT
0704-0601WHSMT
0709-0605WDLC2
0709-0605WDLOC
0104-0593GITRA
0650-01.4.002
0104-0275NYSNA
0650-08.1.001
C7D5-EK 000)
7090-1169RCRTR
0650-09 .. 2.0BO
0650-08C1.0D)
0650-01 .. 4,,003
0650-01 .. 4.005
0650-01.4.010
0650-01.4.011
0650-·-AT-OOI
0105-AO-00I-0
0705-AO-002-0
0650-01.4.007
0650-09.2 .. 016
0650-09.2 .. 011
0650-09.6.017
0104-082lLRSFD
0650~02.1.00?

1401-01.04.013
0650-02.1.011
0704-0311G!-1MUF

NMATRIX
BINARY ABSOLUTE, CORRECTION AND
NGENERAUIED
NGENERAL
.ABSOLUTE AND CORRECTION
/lEXTENDED

TRANSFER
TRANSFER
nOADS
TRANSFER ANY ROUTINE
TRANSFER ANY ROUTINE
TRANSFER CARO LOADER~
TRANSFER FUNCTION
URANSFER FUNCTION
'TRANSIENT HEAT TRANSFER PROGRAM
#EASTMAN KODAK CON .. EDISON TRANSFER TRACING
IAPPROXIMATION OF FUTURE TRIP TRANSFERS
JINVERSE LAPLACE TRANSFORM. INVERT
ILAPLACE TRANSFORMATION
'FORTRAN INPUT/OUTPUT TRANSFORMATION
,li!STEPWIS
E ftULT. REGRESSION WITH VARIABLE TRANSFORMATIONS
IHRANSIENT HEAT TRANSFER PROGRA
H
NTRANSIENT OR SHADY STATE TEMP
ERATURES
NS
ilELECTR ICAL POWER SYSTEM TRANSIENT STABILITY CALCULATIO
nOR TRANSIT SUBROUTINE PACKAGE
NNY BOll TRANSITION
COMMON.
.¥TRANSLATE CARD IMAGE TO BCD IN
FOR CHECKING OPERAJ[ONS NEEDING TRANSLATING
.709 PROGRAM
/lMATRIX TRANSLATION A/O TRANSPOSITION
111620 5-CHANNEL TAPE TRANSLATION PROGRAM
.SOAP I TO SOAP II TRANSLATOR
1E0nOR AND TRANSLATOR
N0105/70eo C080L AND COMMERCIAL TRANSLATOR
11104 TO 109 SYMBOLIC TRANSLATOR
NPERIPHERAL EQUIPMENT SYMBOLIC TRANSLATOR
.GENERALIZED ALGEBRAIC TRANSLATOR. GAT _
OR THE 650
JlNTERNAL TRANSLATOR - n - A COMPILER F
IIWOLONTIS INTERNAL TRANSLATOR. WIT OUTINES
"MAO TRANSLATOR ANU ASSOCIATED SUBR
o SOAP RElOKS
tHRANSLATOR AND OTHER FORMATS T
.709/7090 COMMERCIAL TRANSLATOR COMPILER
10-PR-075.
,COMMERCIAL TRANSLATOR-PRELIMINARY -SEE 70
NTRANSMISSION
LOSSES AND PENALT
Y FACTORS
NCEPTR NUCLEAR-CODE TRANSPORT
IFLH NUCLEAR-CODE TRANSPORT
NHERD-l.2, AND 3 NUCLEAR-CODE TRANSPORT
'PIMG NUCLEAR-COCE TRANSPORT
flISIMPL-1 NUCLEAR-CODE TRANSPORT
flISIMPL-2 NUCLEAR-CODE TRANSPORT
.SNG NUCLEAR-CODE TRANSPORT
MTRIP-l NUCLEAR-CODE TRANSPORT
#MUFT It NUCLEAR-CODE TRANSPORT
RRANCH NUCLEAR-CODE TRANSPORT
'SAIL NUCLEAR-CODE TRANSPORT
.FORTRAN SN6 NUCLEAR-CODE TRANSPORT
E II A MULTI GROUP P3, THE NEUTRON TRANSPORT EQUATION NUCLEAR-COO
11704 TRANSPORTATION CODE.
NTRANSPORTATION PROBLEM
OR HUNGARIAN METHO~
.¥THE TRANSPORTATION PROBLEM, FlOWMTRANSPORTATION PROBLEM
fllTRANSPORTATION PROOLEM-INOIREC
T ADDRESS lNG
S TECHNIQUE.
NTRANSPORTATION PROBLEM - OENNI
NTRANSPORTATION PROGRAM FOR THE
IBM 1620
IHRANSPORTATION PROGRAM FOR·162
o
IIMATRIX TRANSPOSE
'SQUARE MATRIX TRANSPOSE ON ITSElF
CEO IN CORE
IISQUARE "ATRIX TRANSPOSED ON nSElF OR DISPLA
ilMATRIX TRANSPOSED ON ITSELF
'SQUARE MATRIX TRANSPOSED ON ITSELF
'MATRIX TRANSLATION A/O TRANSPOSITION
SSION ANALYSIS PROGRAMS RAP RAPA TRAP
IIMULTIPLE REGRE
INT.
NTRAP • TAPE RECORD ANALYZER PR
#104-SAP FLOATING-PT. TRAP MATRIX OIAGONALIIATION
P SCOOP I
IIlRAP eelAL MEMORY PRINT - /JRA
'flOATING POINT TRAP ROUTINE
.FLOATING POINT TRAP ROUTINE
IFLOATING POINT TRAP ROUTINE
104 FORTRAN SAP
CODED.
11 FLOATING TRAP SIMULATION.
I I /RTNI AND ILEV/ wITH flOATING TRAP TEST
IIFORTRAN
NTRAP TRACE. GI TRAP.
Nl004-SAP flOATING-POINT TRAP UNDERflOW CORRECTION
'704-FORTRAN II FLOATING-PT. TRAP UNDERFLOW CORRECTION
NTRAP TRACE, GI TRAP.
R709 VIPP BUG TRAP.
I/'INTEGRAL EVAL., TRAPEl. RULE /EQU. INTERVALS/
QUAL INTERVALS/
NN-STRIP T~APEZOJOAL RULE INTEGRATION/E
nAND AREA - SURVEY TRAVERSE
IISURVEY TRAVERSE
IIREVISED TRAVERSE ANO TRAVERSE ADJUSTMENT COMPUTATIO
IITRAVERSE ADJUSTMENT
RO •
#TRAVERSE ANALYSIS PROGRAM. CA
PE •
NTRAVERSE ANALYSIS PROGRAM. TA
BTRAVERSE AND COORUINATE PROGRA
H
NREVlSED TRAVERSE AND HORIZONTAL ALIGN'"
ENT
NT COMPUTATION
'REVISED TRAVERSE AND TRAVERSE ADJUSTME
"SURVEY TRAVERSE PROGRAM
IITREE OUTPUT TO FREE~AY INPUT
HREND ANALYSIS AND PREDICTION
IlTIME SER1ES TREND EQUATIONS
"TRACT SQUARE SYMMETRIC MATRIX TO TRIANGULAR FORM.
NCON
DETERMINANT EVALUATOR FOR NEARLY TRIANGULAR MATRICES
II
MM[TRIC FORM.
N[XPANO TRIANGULAR MATRIX TO SQUARE SY
SUBROUTINE
NNEARLY TRIANGULARIZATION OF A MATRIX
#TRICO'" II
fHRIGONO".ETRIC FUNCTION SUBROUT
INE
112DT A TIEAR RfGRESSION['COR
REUT tON
#VARtABLE /J,ETRIC MINI~IlATION
IISTEPnISE HULT. REGRESSION WITH VARIABLE TRANSFORMATIONS
IIMOVE VARIABLE. GROUPF.D FiElDS
#MULTlPLE CORRELATlOr-< FOR 50 VARIABLES
PROGRAr-"MING WlTti UPPER BOUNDS ON VARIABLI::S
If LINEAR
TION ROUTINE FOR A FUNCTION OF N Vfl.RIABLES
IIMINJMIlA
#ITERATION. ONE OR TwO VARIABLES
IICDRRELATlNG PROGRAM-UP TO 30 VARIABLES
IIGENERAL ANALYSIS OF VARIANCE
Iff OUR WAY ANALYSIS OF VARIANCE
UANALYSIS UF VARIANCE
IIGENERAL ANALYSIS OF VARIANCE
IILATIN SCUARES ANALYSIS OF VARIANCE
If GENERAL ANALYSIS OF VARIANCE
HATIN SCUARES ANALYSIS OF VARIANCE
IIANALYSIS OF VARIANCE
PLICATED KBY
#ANALYSIS OF VARIANCE FOR PART. OR SING. RE
-ORTH/D (. STAT~ DESIGN IIANAlY or- VARIANCE OR COVARIANCE FOR NON
UST MEANS PROGRAM
UANALYSIS OF VARIANCE OR COVARIANCE AND ADJ
UANALYSIS OF VARIANCE OR COVARIANCE
IIANALYSIS OF VARIANCE PROGRAM
NGENERAL PURPOSE ANALYSIS OF VARIANCE PROGRAM
/IAN ANALYSIS Of VARIANCE PROGRAM FOR THE IB~. 6
50
I#ANALYSIS OF VARIANCE,DISPROP. SUBCLASS NUM
BERS
#FLOATING POINT INI VARIATE PROBA81LITY INTEGRAL
UNORMAULED VARIMAX FACTOR ROTATION
ECLIPTIC ROTATlDN-ROTATE A GIVEN VECTOR
If EQUATORULTIPLICATION
#VECTOR BY SYM~,ETRICAL MATRIX M
IIVECTOR DOT PRODUCT
650RLlNEAR PRG. FORCEO INVERSIOIl VECTOR PART. CODE FOR AUGMENT
l,llo/ECTOR TRIPLE CROSS PRODUCT
lITO ROTATE A GIVEN VECTOR X FROM rHE EC.UINOX OF
IICHARACTERISTlC ROOTS ANt) VECTORS
IIlATENT ROOTS AND VECTORS OF A MATRIX
AR SPECTROSCOPY LATENT ROOTS AND VECTORS OF A MATRIX
IIMOLECUL
ATRIX..
i#EIGENVALUES AND VECTORS OF A REAL, SYMMETRIC M
VEL..
IlLEAST SQ. DETER~ FOR A VEL FUNCT .. \ojITH LINEAR INC. OF
A VEL FUNCT. WITH LINEAR INC. OF VEL.
#LEAST SQ. DETER. FOR
ISMOGRAM SYN FORM CONT. INTERVAL VELOCITY _ CVL •
USE
TID DATA
#LEAST SO .. DETER. OF VELOCITY FUNCTION FOR REFRACT.
MOVEOUT CaMP. FOR LINEAR INC. OF VELOCITY wITH DEPTH
IfNORMfIl
'PERIPhERAL CARD VERIFIER
IIpERIFPHERAL LINE PRINTER VERIFIER
OT, FLOATING-POINT, FORTRAN LIB. VERSION
1I-SQUARE RO
INARY TAPE CORRECTOR. NON-SYSTEM VERSION
.8
EMENT SIMULATOR7010 FULL FORTRAN VERSION
IIINVENTORY MANAG
#SD 1402 * SEARCH PROGRAM-CARD VERSION
IIARCTAN AlB, FORTRAN II VERSION,SAP CODED.
IWIGITAL TERRAIN MOOEL SYSTEM VERTICAL ALIGNMENT PROGRAMS
TINES TO READ A CHRONO-LOG CLOCK VIA 116 ECHO ENTRY
#ROU
11109 VIPP BUG TRAP.
/lVIPP INSERT LEADING BLANKS..
/lVIP? MERGER..
/lVIPP MERGER. SECONO PHASE OF A
GENERAL PURPOSE
11709 VIPP SORTER.
NVIPP SORTER .. FIRST PHASE OF A
GENERAL PURPOSE
11109 VIPI' SYNONYM DECK
IIVISCOSITY OF LIQUID WATER
IiVISCOSITY OF STEAM
LINK. MOVE, opHL T ,SECCK t SIGN. STR IP, V~,C TR
IIGSEL, FMC TR,
RAHAC
. 'CUT [. FIll-EARTHWDRD VOLUME CALCULATIONS ON THE 305
MGRIO SYSTEM VOLljME OETERMINATION
NSpECIF IC VOLUME OF COMPRESSED lIQUID
NSPECIFIC VOLUME OF SATURATED LIQUID
"ENTHALPY ENTROPY SPECIFIC VOLUME OF SATURATED VAPOR
#ENTHALPY ENTROPY SPECIFIC VOLUME OF SUPERHEATED STEAM
flFORECASTING lONAL TRAFFIC VOLUMES
CYLINDRICAL TANKS
illiQUID VOLUMES IN FLAT END HORllONTAL
IILOADOMETER ~-6 TABLE
IIW-6TAOLE SUI-',MARY
UM SOLU OF ORDINARY DIFFERENTIAL W!AUTO ERROR ANALYSIS
liN
OEC INTERP SYS 650 MAG DRUfoi CALC W/IMMED ACCESS BELL I I I
NFL
IIRAt'.jQOM WALK -SIMULATION.
NFN I I ERROR WALK-BACK SUBROUTINE
IFFUSION ONE-DIMENSIONAL
'WANDA 2,3 NUCLEAR-CODE GROUP 0
FUSION ONE-DlIoIENSI0NAl
NWANDA-4 NUCLEAR-CODE GROUP DIF
ODYNAMIC PROPERTIES OF STEAM AND WATER
/I
THERM
/lVISCOSlTY OF LIQUIO WATER
IlHERMOOYNAMIC PROPERTIES OF WATER AND STEAM
'DISTRIBUTION OF WATER FLOW IN A PIPE NETWORK
/lHARDY-CROSS SOLUTION OF wATER FLOW NETWORK
II NEUTRON ENERGY SPECTRA IN WATER NUCLEAR-COOt:
UWATER SURFACE PROFILE PARAMETE
RS
NWATERWAY COMPUTATIONS
#WAVE RECORD ANALYSIS OF TWO SI
MUL TANEOUS RECORDS
IIFOUR WAY ANALYSIS OF VARIANCE
#3 WAY MERGE PROGRAM
Rwa TSG-l NUCLEAR-CODE ENGINEER
ING
1# WOPC BUFFEREO 1/0 PACKAGE FOR
709 FORTRAN.
IIWEGSTE IN ITERATION
HAUTOMATIC MINIMUM WEIGHT DESIGN OF STEEL fRAMES
AL APPROXIMATION
'WEIGHTED LEAST SQUARE POLYNOMI
lITHE 8UCKLEY-LAVERETT WELGE CALCULATlONS
#WELLBORE DEVIATION RECORD
R ENTROPY IN LIQUID SUPERHEAT OR WET REGIONS
IIENTHALPY 0
ANALYSIS
HHE WHERRY-WINER METHOD OF FACTOR
L
NBACK TRACE SUBROUTINE WHICH DESCRIBES FLOW OF CONTRO
TAPE UNIT USAGE OTHER THAN THAT WHICH IS
no ASSIGN
NWHIRLAWAY NUCLEAR CODE
1#650 SOAP CONTROL PANEL WIRING SUGGESTION
-DECIMAL FUNCTION SUBROUTINES
#WISCONSIN FUNDAMENTAL flOATING
'WOLON-TIS INTERNAL TRANSLATOR. WIT ..
WIT •
/iWOLONTIS INTERNAL TRANSLATOR.
#HOLLERITH WORD GENERATOR
'KEY WORD IN CONTEXT
LGEBRAIC. r-',ULTIWORD KEYS .. IWHOLE WORD KEYS ONLY/
If SORT, A
'24 WORD PER CARD BINARY LOADER
50 FORTRAN MODIFIED FOR THE 4000 WORD 650
N6
KS UP TO 6 INDICES FROM AN INDEX WORD.
IlUNPAC

070,)-CU-001-1
010,.-0351MUPRF
0704-0357MUPCl.f
0704-0209NOV~P

1620-03.0.001
0704-0381ASAS5
0704-0856CVVIP
0704-0856CVVIP
B 0709-1135BWVIP
0709-1159~.DSOR

H
B
0
[J

A
['.
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
B
8
B
8
B
B
B
B
B
B
~

B
B
B

B
B
B
B
B
B
B
B
B
B
B
B

B
B
B
B
B
B
B
S
B
8
B
B
B
B
B
B
B
B
B
8

06,)0-06.0.054
07Q4-0'J80ANIOl
70,)0-1194ERMPR
0705-PG-OIO-0
06')0-06 .. 0.007
070 11-0973RSBPl
070 11-0BOIIRWM1\l
0704-0433MCITR
1620-06.0.009
0650-06.0.036
0650-06.0.053
0104-0421AAANV
0104-04'JlRWAV2
0104-04'JlRWAV3
0104-0776RWAV4
0104-0176RWAV5
1620-06.0.010
0650-06.0.063
0650-06.0.059
0650-06.0.034
7090-1212HFAQV
0650-06.0.004
0709-09J3NOANA
0650-06 .. 0.0 1.4
0650-06.0.056
0704-0194RWNP'\
7010-11.3.008
0709-095JRWROB
0650-05.2.014
0104-022JClMVP
0650-10.1.010
070<]-0885VGVPR.
0709-0945RWRfC
070 1t-0148NYCRV
0650-05.2.016
0650-05.2.024
0704-0460MIHOI
0650-09.6.016
0650-09.6.016
0650-09 .. 6.018
0650-09.6.020
0650-09.6.019
0104-0262NYPCV
0704-0262NYPLV
0704-0399MISRT
0709-1055DIBTC
7070-12.1 .. 001
1401-01 .. 4.020
0104-0603WH005
0650-09.2.041
0104-08430RCLK
0709-1131BW9BU
0104-0895TAVIL
0109-1136BWVIP
0704-0926TAVI I'
0709-1116BWVIP
0704-0926TAVIP
0109-1l37BW9SY
1090-1095WHVIS
1090-1095WHVIS
0705-BW-002-0
0305-09.2 .. 001
0650-09.6.009
1090-1095WHVCL
7090-1095WHVSL
7090-109SWHHSV
1Q9Q-I095WHHSS
0650-09 .. 2.011
0650-09.7~005

0650-09.2 .. 031
0650-09.2.071
0650-04.0.012
0650-02.0.021
1620-11 .. 0 .. 009
0704-0B48ARFER
0104-NUCLEAR
0704-NUCLEAR
0704-0428GSSTP
7090-1095WHVIS
7090-1095WH005
1620-09 .. 7 .. 001
0650-09 .. 1.003
0650-08.2.021
0650-09.2.051
1620-09 .. 2.004
0104-0514CSTUK
0650-06 .. 0.053
0104-0421NSMRG
0104-NUCLEAR
0709-091SWDIOF
B 0104-1234AAWEG
8 0650-09 .. 2.052
B 0650-06 .. 0 .. 009
B 0650-09.6~010
B 0650-09.6.001
B 1090-1095WHSS t
8 0650-06~0.028
B 0704-0901NUBAC
!3 1090-1199PEIBL
B 7090-NUCLEAR
B 0650-12.0.006
B 0650-03.1.032
B 0650-02.0 .. 01')
B 0650-02.0.019
B 0709-1219WOHOL
B 0704-0884PKKWI
8 0704-05100RSRT
B 0704-0263MULBL
8 0650-02 .. 1.008
B 0104-0788IBUPF

33

GEBRAIC. KEV AND OEM LENGTH - 1
GEaRAIC. KEY AND ITEM LENGTH - 1
II'READS THE SaRT[O K[V
IIPROGRAM TO SORT THE KEY
NO ICES FROM FOURIER SE~IES INDEX

WOREJ. CLOSED..
NSORT, AL
WORD .. OPt:N.
h'SORT. AL
WOR.DS FROM NC 139
WORDS FROM NCl38
wORDS,
IIUNPACKS THE I
/lWRITE ass LOADER STORAGE <"AP
IHIRITE SSS LOADER STORAGE tolAP
/lltRITE CORE JMI\GE ON TAPE
'READ "'RITE ORUt-'..
NFORTRA~ TAPE WRITE PROGRAM..
'SELF LOADING TAPE WRITE PQ.OGRAM..
RV INFO ON TAPE
liTO WRITE 2 DIMENSIONAL ARRAV BINA
AND SIGN ON CRT
IIWRITE 6-0[GIT DECIMAL INTEGER
IRED-I22 CEllS
IIFORTRAN WRITE-UP OF Rio! REQX .. SPAC[ REQU
M£:RROR CORRECTION CODE kRITER
IPROGRAM TAPE WRITER
ITAPE PROGRAM FINDER,WRITER,AND SALVAGE
BINARY RECORD ON TAPE.,
/lWRITES A FOURIER SERIES AS ONE
"SElF LOADING TAPE WRITING ROUTINE
"SElF LOADING TAPE WRITING ROuTII'IIE
.rAPE READING AND WRI TING SUBROUTtNES
no READ AND CHECK NU WTa-WR tTTEN RE:COROS
NSINH x AND COSH X
'ARCSIN X, ARCCOS X, SQUARE ROOT X
NCUSE ROOT x
"NTH ROOT OF X
"ARCTAN X
'SQUARE ROOT X
.¥EN • X • SUBROUTINE
,KIN. X • SUBROUTI"lE
NSINH X AND COSH X
no ROTATE A GIVEN \lECTOR X FROM THE ECUINOX OF
,ARCSINE X SUBROUTINE FOR THE IBM 7010
EN X, THIS PROGRAM CALCULATES LN X TO 200 OR 20S.
RGIV
NVECTDRS OF THE PRODUCT OF A AND X.
liE IGENVALUES AND EIGE
RV ARITH..
.NORMALIZED E TO X-EXTENDED RANGr:; FLOATING BINA
*ARCSIN X, ARCCOS X, SQUARE ROOT X
IIARCSIN X, ARCCOS X, SQUARE ROOT )C
X TO 200 OR 20S.
NGIVEN X, THIS PROGRAM CALCULATES LN
FORTRAN - FUNCTION
URANF - SUBROUTINE FOR A BASIC
IIIFS • AFTER SETTING - XX
TO 7010 TAPE RECORD CONVERSION - XXAlS 11650
NXV SUBROUTINE
L CRDERS OF THE BESSEl FUNCTIONS Y SUB K TIMES Z
UL
.BESSEl FUNCTION Y SUB N IX/..
CLE 11 DIFFUSION ECUATION IN lX, VO SPACE NUCLEAR-CODE
" UN
IIBESSEL FUNCTIONS JO/X/AND VO/XI
IIBESSEL FUNCTION Jl/XI AND Yi/xi
E BESSEL FUNCTIONS V sua K TIMES Z
IilALL ORDERS OF TH
OF BESSEL FUNCTION J SUB K TIMES I OR I
IAll ORDERS
'CLEAR BLOCK TO ZERO
'ZERO DISK-FILE 1/CO&5/CD
IIBESSEl FUNCTIONS OF ORDER ZERO.
II ZERO, MINIMUM SOLVER
IIZERDS OF A COMPLEX POLVNOMlAl
IIZEROS OF A COMPLEX POLYNOMIAL
E PRECISION
'ZEROS OF A POLVNOMIAL IN DouaL
IlZEROS OF A REAL POLYNOMIAL.
IllEROS OF COMPLEX POLVNOMIALS
II ZEROS OF COMPLEX POLYNOMIALS
Al/zERP/.
#ZEROS, eXTENDED RANGE POLYNOMI
'ZEROS,ARBITRARY FUNCTIONIlARFI
cml,PUTER SYSTEM
,_ ZEUS PROGRAM ANALVSIS _ -ZPA _
'lIP - INSTANT PRINTING _
JFORECASTING ZONAL TRAFFtC VOLUMES
WORK
ITRACING A MIN. PATH BET. lONE CENTROIDS OVER A ROAD NET
ION ONE-DIMENSIONAL
1l00M NUCLEAR-CODE GROUP DIFFUS

34

R 0704-05100RSRT
B 0704-05100RSRT
B 0704-1144NC014
~. 0704-1144:'-1C013
B 0704-0188IBS!>F
B 0104-083D.'lISTP
B 0704-0a30MISTP
B 0704-0830MIIHP
B 0704-0647NPR~'O
B 0704-0899/'1'EFOT
B 0104-0899METOU
B 0104-0910NuwTII
B 0704-0362"14117
B 0109-0'}46RWFEQ
0 0109-0938VGW[C
B 1401-13.1 .. 008
B 0650-01 .. 5.011
[3 0704-07881BWFS
B 0704-0781WH004
B 0104-078}wH004
A 1401--10-040
B 0704-0911NURn
B 0650-01.1.0Q9
B 0650-03.1 .. 028
a 0650-03.1.029
B 7070-08.3.003
B 7070-08.1 .. 001
B 1070-08.3.001
B 0650-01.0 .. 00R
El 0650-07.0.009
B 0650-0) .. }.009
B 0709-094SRWREC;;
B 7070-08 .. 1.006
B 0704-0498CA004
a 0704-0652RWEG2
B Q704-0310RS013
8 0650-03.1.02f1
a 0650-03 .. 1.028
B 0704-0498CA004
B 7070-01 .. 9.002
B 0705-PG-005-0
B 7070-02.4.001
8 7070-0B .. l.0IA
a 0709-0985RWSF8
B 0104-0704RwaF4
B 0650-06.2.011
8 0704-0B33RWBJY
8 0704-0B33RWBJY
B 0709-098SRWBF8
8 0109-0984RWBF7
a 0650-01.6.006
A 0650--UT-I02
B 0704-0636RWBF2
6 0704-\04lJPZOM
a 0704-0405PFIPC
a 0104-0225GMZER
B 0104-0766ANC20
a 0104-D405PFZPR
8 0650-07.0 .. 006
a 0704-0692JPZPO
B 0104-0565CA004
8 0704-0565CA005
B 7070-01 .. 9 .. 004
B 1401-01 .. 4.009
B 0650-09.2 .. 011
B 0650-09.2 .. 080
B 0104-NUCLEAR

A - 305

IBM Appllc:a.tloll • By.tam. Program. Library Ab.trad:

ro. Numbal"

0305-AT-007

Additional Remarks: User should be aware of "Record Advance Overflow" modlIications which must be made to General Purpose Process Control Panel before
operating test deck. Program Is written for use with the 370 Printer.

THREE TRACE PROGRAMS, SWRED PROGRAM, PROCESS PANEL, POST TRACE

A'ostract:

ru. Humber

IBM AppllcaUoft Ie By.lam. Program. Library Ab.tract

0305-PR-OOl

~ One program traces the store processj the second allows the control
panel to be traced by the RAMAC 305 independent of the store program.

A COMPUTER PACKAGE FOR THE IBM 305 RAMAC
IBM AppUc:a.tlon • Sy.tam. Program. Library Ab.trad:

I'U. NumbBl'

0305-LM-005
Purpose: The computer package is an interpretive programming system for
performing scientific and engineering computations on the RAMAl.; 305.

PROGRAMMED DIVISION

Abstract:

Restrictions: 'The package will handle either fixed or floating point numbers.
Fixed point numbers are carried as 10 digits. Floating point numbers are
carried in a 2 and 8 notation.

Purpose: This program presents two methods of division. They are division
using a tape of reciprocals, and division by iterative techniques.

Additional Remarks: The simulated instructions are of the 2 address variety.
Each address may be notified by one of 9 pseudo index registers. The following
functions are included:

Restrictions: The method of reciprocals is feaSible if there are not morc than
1~, 000 divisors..

IBM: Appllcatlon Ie Sy.tam. Programa Library Ab.tract

rUe NumbBl'

Square root
Sine
Cosine
Logarithm
Exponential
Arctangent
Arcsine

0305-LM-006

FLOATING POINT SUBROUTINES FOR THE 305 RAMAC

Abstract:

Machine Requirements:

Purpose: Six floating point subroutines have been developed: Three perform the
arithmetic operations oi (1) floating point add or subtract; (2) floating point
multiply; and (3) fioatin9' point divide. Three routines provide for comparison
of floaUnq point numbers and conversion routines between fixed and floatinq
point numbers.

Storage ReqUirements: 60 disk tracks.

~~~t;§B~n±s:. 9:~~~;?: ~~~~civ~~ts~~~b~r:::~~:~~d::~~..it~~I~OOOO
One utilizes the general purpose process control panel and the other requires a
special wired panel.
Storage Requirements: Three drwn tracks.
Remarks: All operations take approximately 1/2 t.o 1 second. The shorter times
are gained by use of the special purpose panel.
IBM: AppUcaUoD Ie Sy.tam. Program. Library Ab.tract

FUe Humbe" 0305-:Ml-002

AutOInatic division..

IBM Application Ie System. Programs Library Abstract

rna Nwnber

305-SP-003

SYMBOLIC PROGRAMMING AND ASSF.MBLY FOR THE IBM RAMAC 305

Abstract:
Purpose: This system provides the programmer with a symbolic programming
lanquaqe for the IBM RAMAC 305. In addition, an assembly program is provided
for translating the symbolic language into the machine l.angua.qe of the RAMAC 305.
The language contains operations for handling normal proqram exits and. General
Purpose Process Control Panel instructions. The output of the program is a deck
of self-ioad1nq, one-inslruction-per-card load cards, and a listing of the symbolic
program steps and their translation.
Method: Not applicable.

LINEAR PROGRAMMING ROUTINE

Restrictions. Range: Not applicable.

~

Storage Requirements: The General Purpose Process Control Panel is required for
operating the assembly program. Any control panel may be used for operatinq the
assembled program. The assembly program requires 300 sectors of disk storage.

Purpose: The program allows the solution of linear programming problems.
Equipment Specifications: The program requires no optional features.
Method: The simplex method is used.
Restrictions: The maximum array that can be operated upon is 82 x 97.
Storage Requirements: One disk.
Machine Requirements:

Automat1~

Additional Remarks: The 300 sectors of disk storage referred to for operating the
assembly program must be contained in the file containing addresses 000000 to
099999 on a RAMAC 305 which has six character RAMAC addresses. No op code
which contains a disk storage address as an operand can be utilized with a six
digit disk address.

division.

Additional Requirements: All arithmetic computatlons are performed by fioatiIlQ'
point subroutines. Data may be entered in fixed or floating point format.

IBM Application Ie Systems Programs Library Abstrad

Fne Number 305-UT-008

305 UTILITY PROGRAMS
IBM Application&.: System. Program. Library Ahlltract

FUe Numbor 305-MI-004

Abstract:
Purpose: The programs contained in this package may be classified as follows:
programs which transfer data from punched cards to a speCific location
within the RAMAC;
programs which transfer data from one location within the RAMAC to another
(e. cr., from processitlCJ drum to disk storage, and vice versa); and
(3) programs which transfer data from specific locations in disk storage to cards
or printed input.

305 GENERAL PURPOSE: BOARD TEST DECK

(1)

Abstract:

(2)

Purpose:
This card deck Is utilized to insure the proper wiring of a General
Purpose Process Control Panel. Proper communications with the punch, printer,
The program prints out the results of proqram exit
tests as they are accomplished.

Method: Not applicable.

and typewrIter are checked.

Method: Not applicable

Restrictions. Range: Not applicable

Restrictions. Range: Not applicable

Storage ReqUirements: AU oJ the programs operate. froIn. tra.ck I.

Storage Requirements: No disk storage area is required.

Equipment Specifications:

Equipment Specifications: No optIonal features are required.

Additional Remarks: The proqrams which utiliZe disk storage will only operate on
the file containing sectors 000000 - 099999 on an IBM RAMAC 305 which utilizes
six digit disk addresses.

(Continued on next column)

No optional features are required

35

A - 650
IBM Application &. Systems Programs Library Abstract

FUe Nwnber 6uQ-A'l'-001

GENERAL TRACING ROUTINE

IBM Application r.c System. Programe Library Abstract

File Number

G50-FO-303

FORTRANSIT II

Purpose: This program has been designed to aid programmers in debugging programs written in SOAP 11 language for any 650 system.
Range: Docs not apply.

Purpose: Program converts source program written in FORTRAN language into
machine language instructions. Three card passes are required.

Accuracy: Docs not apply.
Floating/Fixed: Docs not apply.
Mathematical Method:

Restrictions: The program processes the following statements: Arithmetic;
~~~ ~u~~IIOE~i,:" 1\), ij IF; PAUSE; STOPj DO; CONTINUE; DIMENSION;

Docs not apply.

Storage Required: The program is available in either regional or syznbolic
form. The sytnbolic program requires ZOO + 3N + 5M + K drum locations,
where N is the number of points within the program to begin tracing, M
the number of distinct loops to be traced, and K the number of stopping
points. The regional program does not require the additional K locations,
and is available for output synchronizers I or 2.. A maximum of 45
stopping points is allowed in dtlll::r program.
Speed: Not given.

Machine Requirements: Floating Point Arithmetic, Indexing Registers, 533 with
alphabetic device.
IBM Application r.c Syetem. Programs Library Abstract

FUe Number

650-FO-301

FORTRANSIT II S

Relocatability: Not given.
~ The program will trace all 650 system instructions.
There arc
two conditions which will cause an automatic skip-out: if a load card is
read, or if an inquiry is made while in the tracing mode. When either of
these occurs tracing ceases, and the program being traced will resume at
high speed. The tracing program will be re-entered at the next encountered skip-in point. U the D-address of a branch-on-inquiry instruction
is chosen as a skip-in point, the inquiry subroutine may be traced. The
programmer, if he so desires, may trace index registers by including a
control card.

Purpose: Program converts source program written in FORTRAN language into
machine language instructions. Three card passes are required.

Requests for program decks should specify which type is desired, i. c.,
syntbolic or regional for output synchronizer I, or regional for output
synchronizer 2..

Restrictions: The program processes the following statements: Arithmetic;
~~k~ ~u~~J;OE~b: •• nil, ij IFj PAUSE; STOP; DO; CONTINUE; DIMENSION;

650 System: One 533 required.

Machine ReqUirements: Floating Point Arithmetic, Indexinq Registers, 533 with
special character device. '

Special Devices: Alphabetic device for SOAP assembly.

IBM Applica.tion Be Sy.teme Programs Library Abstract
IBM Application Be Syeteme Program. Library Ab.trnct

File Number 650-FO-305

rUe Number 650-FO-30l
FORTRANSIT ill

FORTRANSIT I

Purpose: Program converts source program written in FORTRAN language into
machine language instructions. Three card passes are required.
Restrictions: The program processes the following statements: AriUuuetic;
GO TO n; GO TO (n1 • . . ut), ij IF; PAUSE; STOP; DO; CONTINUE; DD.AENSION;
READ; PUNCH; END.

Restrictions: The program processes the following statements: Arithmetic;

~g~;L~~C~~R(~~Dj' PU~2H!; E~b~~~~ irg~; ~~~g~~~u~~~~7::~~;
TAPE; WRITE OUTPUT TAPE; PRINT; BACKSPACE; REWIND; END FILE.
Machine Reguirements: Floating Point Arithmetic; Indexing Registersj 533 with
alphabetic device; three 727 tape drives; standard 407.

Machine Requirements: 533 with alphabetic device.

IBM AppHcatlon It Sy.tema Programs Librnry Abstract

Purpose: Program converts source program written in FORTRAN language into
machine language instructions.

File Number

650-FO-302

FORTRANSIT I S

Abstract:
Purpose: Program converts source program written in FORTRAN language into
machine language instructions. Three card passes are required.
Restrictions: The program processes the following statements: Arithmetic;
~~~ ~~~JjOE~b: •• ni', ij IF; PAUSE; STOP; DO; CONTINUE; DIMENSION;
Machine Reguirements:· 533 with special character device.

37

IBM Application &; Systems Programs Library Abstract

File Number 650- LM-004

FLOATING POINT SINE A AND COSINE Pi

IBM Application &; Systems Progr:uns Library Abstract

File Number

.650-LM-006

SQUARE ROOT

a) Computes the square root of X for any X

~

0 in floating decimal form.

b) Range: Any floating decimal argument,
00 S machine exponent S 99. The error is less than one in the e,ighth place.
Purpose: This subroutine computes the sine or cosine of the angle A
expressed in radians.
Range:

Accepts any argUlnent where !AI .::::: (Z IT . 10 7 ) -

c) Method is a linear approximation involving a table look up followed by two
iterations with Newton's formula.

¥-.

Range of Argument

Ma.'dmum error

IAI <.ZIT

3.5 in the 8th significant digit

.Z IT SIAI O. The number of Significant
places is approximately equal to ten minus the number of preceding zeros in A.
Maximum accuracy - nine digits.

The routine takes 123 ms. for Sine and
128 ms. for Cosine.

Relocatability:

c) Iteration of Bailey's function.

Relocatable SOAP II cards.

Remarks: Relocate only by an even amount.
Note: As the power of 10 increases, the number of significant digits in
the result decreases. This is due to the limitation of significant
dhdts available in the original Angle A.

d) Relocatable SOAP II; occupies 78 locations. Speed is dependent upon Nand
the desired accuracy. The average speed is apprciximately 600 m. s.

650 System:

e) The desired accuracy may be determined by the adjustment of a constant.

One 533 and automatic floating decimal arithmdic.

f) Minimum 650.

IBM Application & Systems Programs Library Abstract

IBM Application &; Systems Program.a Library Abstract
File Number

File Number

650-LM-008

650-LM-005
FLOATING POINT EXPONENTIAL

FLOATING POINT ARCTANGENT

Purpose: This routine computes lOX and eX for floating point arguments
using automatic floating decimal arithm.etic and three indexing registers.

Purpose: This subroutine computes the arctangent of floating point
numbers. The result is in radians.
Range: The rouHne accepts all arguments X where
3. 16ZZ777 x 10- 26

,:<; Ixi

Range: The routine accepts arguments for lOX
-Ixl <49
The routine accepts arguments for eX
Ix) ~ 1I2.8Z666
An error stop is provided for arguments outside this range.
Accuracy: The max.imum error is 1 in the 8th significant digit for positive
exponents and less than 1 in the 7th significant digit for negative exponents.

< 3. 16ZZ777 x 10 24
Floating/ Fixed: Floating decimal aritlunetic.

Accuracy: The absolute error is less than 10- 7 .
Floating/Fixed: The routine is written utilizing automatic floating point
arithmetic .
Mathematical Method: The method is based on the work of Dr. E. G.
Kogbetliantz, IBM, WHQ, and utilizes a continued fraction form of the
expansion of I!X arctan X in the interval (O, 1).

Mathematical Method: (Adapted for floating decimal aritlnnetic and index
registers from W. E. Stuart's "FRATS" library program 3.1.026)
eX is reduced to 10(log e)x = 10' 43429448x which is computed in fixed point
using a Hastings polynomial approximatio1\ over the range 0 ~ uS 1/10.
For negative exponents, eX = IIe Ixl.
Storage Required: Requires 84 drlUIl locations within a group of 100
locations. The unused locations are available to the programmer.

Storage Required: The routine requires 49 locations.
Speed:
Speed: Execution time is 127 milliseconds.
Relocatability: Routine is written in relocatable SOAP II form.

Relocatability:

~emarks:

Remarks: Three indexing registers are used and not restored to their
original values.

Relocate by an even amount.
contents are not restored.

One indexing register is used; the

650 System: One 533, automatic floating decimal arithmetic, and one
indexing register are required.
Special

38

120 rns. for Hr
lZ7 ms. for eX

~evices:

For SOAP assembling, an alphabetic device is required.

Relocatable SOAP 1I form.

650 System: One 533. automatic floating decimal arithmetic, and three
indexing registers.
Special Devices: Alphabetic device for SOAP II assembly.

A - 650
mM. Application k SYBtemB Programll Library Abstract

rUe Nunber

650-GM-009

IBM AppUcaUon ... Syst.,m. Programs Library Ab.tract

rUa "umb.,r 050-LM-012

FORTRANsrr SUBROUTINES

Nth ROOT FLOATING POINT SUBROUTINE

Abstract:
Purpose: This is .R collection of subroutines to be used with the 650 FORTRANsrr
programs. The subroutines are absolute value, cosine, sine, and square root.

Purpose: This Tout.ine computes the Nth Toot of a single precision floating
point argument A.
~

IBM Appllcatlon .. Sy.t.,ms Programll Library Abatract

FUe Number

650-SM-402

+.OOOOOOOOOO:S A :S +.9999999999, N > O.

Accuracy: The subroutine exits to the main program when two successive
approximations di££er by 2. x 10- 8 .
Floating/Fixed: The format of the floating point number is • xxxXxxxxmm,
with floating zeros in the form 00 0000 0000.
Mathematical Method: Iteration of BaUey' s Function.

Speed: Speed is dependent upon N and the desired accuracy.

Method:

RelocatabUity: The subroutine is fUTniBhed in relocatable SOAP II form.
Remarks: The desired accuracy may be modified by the adjustment of a

~

flo~ting

Purpose:

Sort 2 1s a generalized tape sorting program.

Restrictions: Program sorts unblocked fixed-length records. Maximum record
is 60 words. Maximum of 5 control fields. File must be within 1 or 2 reels of
tape.

Storage Required: 79 locations.

650 System: One 533 and automatic

SORT 2

2-way merge.

Equipment Specifications:

727 Magnetic Tape Units

Additional Remarks: Routines for tape labeling, error corrections, restart procedures, ·record count, and hash totals are included.

decimal arithmetic.

Special Devices: Alphabetic device for SOAP II assembly.

IBM Application ... Systam. Programs Library Abstract

Fila Number

650-LM-Ol0

IBM. Application ... Sy.tem. Program. Library Abstract

Fila Number

0650- SP- 201

BASIC SOAP 2A

FLOATING POINT SQUARE ROOT SUBROUTINE

Purpose: This routine computes the square root of numbers in floating
decimal form using an initial approximation an d five iteration iii with
Newton's method. This progranl was designed to use a minimum of drum
space.
~: This routine accepts floating point numbers of the form.
• DDDDDDDDMM. Answers are in floating point form and all eight
Significant digits are exact.

Purpose: This program processes programs written in symbolic language and
produces one-far-one machine language instructions.
Restrictions: A maximum· of 300 labels are processed per pass of card deck.
It assembles instructions for a 2K machine.

Mathematical Method: After taking an initial approximation, Newton's
method is used to fini the square root. With the initial approximation
used, this method converges to eight Significant figures in five iterations.

Machine Reguirements: 533 with alphabetic device.
Storage Required: 2.1 Pennanent drum locations including a programmed
stop for negative argument III. 30 Ten1poraa'y storage locations.
Speed:

140 ms.

The deck is in SOAP 11 form.
Remarks:

The routine uses index r.cgister B which is not reset.

IBM AppUcation .. Systams Programs Library Abstract

IBM 650 System: This routine requiTl!s a 650 with floating decimal
arithmetic device and one index register. An alphabetic device is needed
for SOAP II assembly.

IBM Appllcatlon .. Systems Program a Library Abatraet

FIle Number

Fila Numhar 0650-SP-202

TAPE SOAP2A

650-LM-Oll

FORTRAN SUBROUTINES

Purpose: This program processes proqrams written in symbolic language and
produces one-for-one machine language instructions.
Abstract;
Purpose: This is a collection of subroutines to be used in conjunction with the
650 FORTRAN, Program #650- FO-30a. The subroutines are: absolute value,
cosine, sine, and square root.

'- .-

Restrictions: A maximum of 300 labels are processed per pass. It assembles
instructions for a 2K machine.
Machine Requirements: 533 with alphabetic device; two 727 tape drives.

39

IBM Application It Sy.tem. Program II Llbtary Abstract

rUe Number

0650-SP-203

laM Application &t Systems Programs Library Abstract

File Number 650-UT-002

CARD-TO-TAPE ROUTINE
SOAP 2L

Purpose: This program processes programs written in symbolic language and
and produces one-for-one machine language instructions. SOAP 2L will process
LITERALS and three other pseudo-ops. not handled by SOAP ITA.
.Eestrictionsj A maximum of 300 labels are processed per pass of card deck.
It assembles instructions for a 2K machine.

Purpose: This utility routine for the 650 tape system is designed to
C'OIi"Ve'rtcard records to tape records.

Machine Requirements: 533 with alphabetic device.

Range: Numerical or alphanumerical records contained in from one to
fifteen cards can be converted to tape records of from one to sixty words.
Accuracy: Does not apply.
Floating/Fixed: Does not apply.

IBM Application Ie Sy.tem. Programll Library Ablltract

rUe Number

065Q-SP-204

Mathematical Method: Does not apply.
Storage Required: The program and its five-per-card loading routine use
273 drum locations including the 1951 read bal).d.

TAPE SOAP 2L

Abstract:
Purpose:
This program processes programs written in symbolic language and
produces one-far-one machine language instructions. SOAP 2L processes
LITERALS and three other pseudo-ops. not handled by SOAP II A.

Speed: When tape writing is in the alphanumerical made, operating speed
1S approximately 200 cards per minute if not more than six words are
taken from each card. IT writing is in the numerical mode, the same
speed will be maintained if not more than seven words are taken from each
card. These rates apply to 533 input; if input is by means of a 537 or a
407, the maximum card reading rate (ISO cards per minute) wiU be maintained regardless of the number of words taken from each card.
Relocatability: Not in relocatable form.

Restrictions: A maxirmun of 300 labels are processed per pass. It assembles
instructions for a 2K machine.
Machine Reguirements: 533 with alphabetic device.

Two 727 tape drives.

Remarks: None.
650 System: One 727 tape unit and any card input device.
Special Devices: None.

IBM Application & System. Programll Library Ablltract

rUe Number 0650-SP-205

IBM Application &t Systems Programs Library Abstract

FUe Number

650-UT-003

TAPE-TO-PRINTER/PUNCH ROUTINE
SOAP II A - 4000

Abstract:
Purpose: This program processes programs written in symbolic language and
produces one-for-one machine language instructions.
Restrictions: A maximum of 1200 labels are processed per pass of card deck.
It assembles instructions for a 4K machine.
Machine Reguirements: 533 with alphabetic device. 4K drum.

Purpose: This utility routine is designed to punch or print records from a
reel of magnetic tape. Output is eight words per card or per line.
Range: Nwnerical or alphanumerical records of any length can be processed.
Accuracy: Does not apply.
Floating/Fixed: Does not apply.

IBM Application & Sy.tl!!ma Programll Library Abstract

rUe Number 0650-SP-206

SOAP 42

Mathematical Method: Does not apply.
Storage Required: The routine requires 50 locations plus the read and
punch areas of the 1950 band. (IT indexing registers are not used, 56
locations are needed.)
Speed: Operates at maximum punch or print rates.
Re1ocatability: Written in SOAP II regionalized form.

Purpose:
This program processes programs written in symbolic language and
produces one-far-one machine language instructions.
Restrictions: A maximum of 300 labels are processed per pass of card deck.
It assembles instructions for a 4K machine.
Machine Reguirements: 533 with alphabetic device.

40

Remarks: The program consists of two versions: one for a system with
indexing registers and one for a system without that feature. Requests for
card decks should specify which version is desired.
650 System: One 533 or one on-line 407 printer; one 727 tape unit.
Special Devices: None.

A - 704

IBM Application

&;

Syetomo Programs Library Abstract

File Number

0704-FO-037

IBM AppHcatlon t..; BVlltllma Programs Library Abstract.

FUe Number 070,1· SI-042

4K 704 FORTRAN PROGRAMMING SYSTEM

Simulation of tJ1C 1410 with the 70'1j709/709P
Abstract:

Purpose: Thc IBM Formula Translating System, 4K 704 FORTRAN, is an
automatic coding system for the IBM 704 Data Processing System. More precisely, it is a 704 program which accepts a source program written in the
FORTRAN lanquage, closely resembling the ordinary language of mathematics,
and which produces a machine-lanquage object program ready to be run on a 704.

IBM Application h. Systems Programs Library Abstract

File Number

0704-FO-03c

Purpose: The program enables the user to test and correct 1410 programs
prior to installation of an IBM 1-110 data processing system. The system
or dump simulated programs.

wjll tra("p

Restrictions: The program simulates standard card and tape systems.
The simulated 1410 has 20,000 core storage positions. Using Basic
Aulocodes tile simulator will assemble 1410 programs. A maximum of
one disk of 1405 storage can be simulated.

8K 704 FORTRAN PROGRAMMING SYSTEM

Timing: The 700 takes approximately 20 times longer than if the program
was running on a l4~0 ..

Abstract:

EqUipment Specifications:
32, 6?B words of core storage
,1 tar:e units + 1 for simulated 1410 tape units + 2 for disk

PurpoGe: The IBM: Formula Translating System, 8K 704 FORTRAN, is an
:lutor.1.3.tic codin!} system for the IBM 704 Data Processing System. More precisely, it is a '704 program which accepts a source program written in the
FORTRAN language, closely resembling the ordinary language of mathematics,
and which produces a machine-language object program ready to be run on a 704.

IBM Application &. Systems Programs Library Abstract

FUe Number

Additional Remarks: This program is distributed on a card deck.

0704-FO-039

32K 704 FORTRAN PROGRAMMING SYSTEM
~:

Purpose: The IBM Formula Translating System, 32K 704 FORTRAN, is an
automatic coding system for the IBM 704 Data Processing System. More precisely, it is a 704 program which accepls a source program written in the
FORTRAN language, closely resembling the ordinary language of mathematics,
and which produces a machine-language object program ready to be rlUl on a 704.

IBM AppUcation

&;

Systems Programs Library Abstract

File Number 07o,I-SI-041

Simulation of the 1110 with the 701/700/7090

rrhe program enables the user to test and correct 1410 programs
prior to installation of an IBM 1410 data processing system. The system
will trace or dump simulated programs.

p~

Restrictions: The program simulates standard card and tape systems.
The simulated 1410 has 20, 000 core storage positions. Using Basic
Autocodes the simulator will assemble 1410 programs. A maximum of
one disk of 1405 storage can be simulated.
Timing: The 701 takes approximately 20 times longer than if the program
was running on a 1110.
Equipment Specifications:
32,676 words of core storage
4 tape units + 1 for simulated 1410 tape units + 2 for disk
Additional Remarks: This program is distributed on a systems tape.

41

A - 705

IBM Application Ie Sy.tem. Program. Library Ab.tract

FUe Number

0705-AT-057

IBM Application Ir: Systems Programs Library Abstract

FUe Number

0'(05- PR-044

7058 PROCESSOR
APTS 80
~

~
~

An automaUc program testing system for the IBM '105 ill, consisting
of a coordinated set of the "80 Series" utility proqrams that are used in testing,
modified so that the utility programs themselves may be loaded automatically
from a utility tape, and. their control cards from the card reader or other input
device independent of the utility tape. With APTS 80, aU proqrams being tested
may be loaded from a. single tape, and test data cards and program correction

cards may be read from the card reader.
IBM Application" SYlteml Program. Library Abstract

FUe Number 0705-CV-045

705-1401 A ASSEMBLY PROGRAM
Abstract:
Purpose: To assemble, on the 705, programs written in 1401 symbolic language;
to produce as the end result of the assembly a listing and program cards in
1401 mlIChine language.
Maeh1ne Requirements: The 'l05.. 1401A Assembly Program will run on a Model I,
II, lII, TCU, TRC, DB.
Magnetic Tape Drives Required: Three (3) If card reader inpu~
Three (3) If tape Input-single assembly.
Four (4) 1f tape input-multiple assemblies.

mM Application .. Systems Programs Library Abstract

705 ill

FUe Number 0705-10-047

rocs

Purpose:
The 7058 Processor accept5 six programming languages: Autocoder mj
Decisionj Report/File Writing-; Arithmetic; Table Creating; and FORTRAN. It will
operate with any input/output device, on a 705, 705 ill, or 7080 and assemble proc;rrams for any model 705 or a 7080.
7058 Processor languages, described below, permit a wide variety of programming
to be stated in terms of the data processing results de::;ired, rather than the machine
operations required to accomplish it. Extensive use of these languages will greatly
reduce coding effort and the incidence of clerical and logical errors, and will
Simplify problems of debugging and program mainte.nance. A statement in any of the
languages may cause generation of an entire pretested routine that will efficiently
perform the data processing defined by the statement. Within anyone program,
routines in the various Processor languages may be intermixed.
Autocoder m: This advanced programming language provides a vocabulary of
merunonics corresponding to actual machine operations, and a set of macroinstructions which, when processed, produce coding sequences that will transmit
data, control program branching, perform automatic-decimal-point arithmetic, and
modify addresses. The operands or Autocoder III statements may be written as
symbolic representations of the information to be operated upon, and symbolic
addre:::;ses, or tags, may be used to define the memory locations of data or of particular routines within the program. Data input and output fields may be defined in
terms of the format of the data including the placement of decimal points, commas,
dollar signs, etc.
Reoort/File Writing: 'This language consists of a vocabulary of nineteen words which,
when used in a prescribed manner, cause generation of routines that will create tape
files or produce printed reports. Statements in this language describe the format of
print lines or tape records by specifying the contents and spacing of report headings,
page headings, and detail lines. A date and page numbering may be included in the
reporL PrOvision is made also for accumulating COWlts or totals of any designated
fields in the records being processed, and for printing these in stated formats upon
the oc.~urrence of changes in selected fields of the records. Routines in the Reportl
File Writing language may be included at appropriate points in programs, and when
complied by the Processor will result in error-free sequences of optimal coding
that will produce reports or tape files, the contents and format of which will be
precisely as spec1fied.

this-language; a

~i)e-cisio~-M~iw:-By u~Oi
sinrjle- logical statemenT-may"b"e-"
written at any point in an Autocoder ill portion of a program to specify all the conditions on which a program decision is to be based, and the alternative courses
the program is to follow if the conditions are satisfied or not satisfied. A single
word, TEST, is the vocabulary of the language and is written as the operation of a
Decision-Making statement. The operand is composed of tags, literal constants,
and special codes that express the relationships (e. g., higher than, not zero, etc.)
that define the individual conditions. Conditions are linked within a statement by
An input/output memory restote system (lOMB SB) operates in conjunction with IOCS. logical connectors and are grouped in a prescribed manner to form the complete
conditional statemenL Decision-Making statements are translated by the Processor
to restore program status from periodically recorded checltpoints, so that in the
into instrnction sequences thai will perform the necessary analyses and other proevent of program interruption, previous processing need not be repeated.
cessing by the best possible methods.
Storage Requirements: Preassembled IOCS occupies 17,074 locations.
Arithmetic: With statements similar to Decision-Making statements, mathematical
operations upon any number of fields may be specified, in order to create a result
705 Model ill
Equipment Specifications:
field. The word MATH in the operation field signals that the operand contains a
767 Data Synchronizer
free-form arithmetic expression consisting of tags and/or literals separated by add,
subtract, multiply or divide symbols, with p::>ssible parenthesization. Specialized
error protection, field modification, and redefinition of intermediate results are some
optional features. These statements are translated by the Processor into automaticIBM. Application Pot. Systems Programs Library Ablltract
FUe Number
070ii-MI-058 decimal-point macro-instructions, chained to produce the most efficient machine
coding.
~

Purpose: IOCS handles reading and writing, checkpo1nt and restart, error correction, beg1nn1nq and end-af-reel and beginninq and end-of-iUe processing,
tape record blocldnc;:r and de-blocking, and label checking. Macro-instructions and
control parameters coded by the programmer cause generation of linkages to IOCS
subroutines, Which in turn perform the spec1fied functions.

LIST 75

Purpose: This program, using program cards as input, produces a sorted
llstlnq of a program's instructions by storage location, storage unit,

mnemonic operation code, and address. This output is helpful in analyzing
a program for transfer points, modified instructions, instructions that set
or reset switches, etc.
EqUipment SpecHications:

705 Model I or Model II
754 Tape Control

IBM Application Ie System. Programs Library Abstract

rUe Number 0705-W-059

FORTRAN: This is a laJlquage for programming generalized computational problems.
705 FORTRAN programs may contain Autocoder statements at appropriate points.
705 FORTRAN permits three subscripts and constant values of range 10- 99 . All
the advantages of 7058 Processor assembly are available to the user.
Equipment Specifications:

40,000 positions of storage
8 tape drives.

IBM Application k Systems Programs Library Abstract

LIST 77

FUe Numbor

0705-PR-131

705/7080 COBOL and COMMERCIAL TRANSLATOR PROCESSOR

Abstract:
Purpose: This program, usinq program cards as input, produces a sorted
listing' of a program's 1nstructions by storage location, storage unit, mnemonic
operation code, and address. This output is helpful in analyzing a program for
transfer points, modified instructions, instructions that set or reset switches,

etc.
Equipment Spec1f1cations:

Table-Creating: This language permits automatic use of memory searching techniques by creating a string of variables with their associated data and a set of
controls to accomplish the searching. Following a statement with TABLE in the
operation field and containing defining parameters, the programmer supplies the
table entries or range of entries. These entries are translated by the Processor
into a table suitable for serial or binary searching. Such a table may be utilized
by macro-instructions, Report/File Writing statement andlor Decision-Making
statements.

705 Model I or Model n
2 777 TRC's

~

Purpose: The processor translates programs written either in COBOL 61 or
Commercial Translator to machine language programs for the 705 Models 1, IT
and ill, and the 7080. Use of the processor in programs written for the 705
Models I and II is restricted, in that input/output routines must be written in
Autocoder language. For the 705 Model m and the 7080 it is possible to write
programs completely in COBOL or Commercial Translator. (Continued on next page)

43

The 705/7080 COBOL and Commercial Translator Processor includes all the
features of the 7058 Processor, Version #2. It may be used to compile programs
written in Autocoder, FORTRAN, Report Writer or the Decision, Arithmetic
and Table languages as well as COBOL and Commercial Translator. Further, a
COBOL or Commercial Translator program may utilize any of the languages
available With the 7058 Processor.
Machine Configuration: A 705 Model II, 705 Model m or 7080 with a minimum of
eight tape units plus a card reader or additional tape unit for the source program.
The availability of additional tape units will normally result in increased speed
of compila~~m.

SORT 54/
Abstract:

Purpose: Sort 54/ Is a generalized three-way merge sorting program. It is
capable of modifying itself according to control card spec1f1caUons.
Equipment Specifications:

IBM Application &: Systems Programs Library Abstract

FUe Number

File Number 0705-SM-051

IBM Application lit. SystenlB Programa Library Abstract

0705-SM-048

IBM 705 Model ill
754 Tape Control
7 727 Tape DrIves
717 PrInter

Additional Remarks: Sort 54/ incorporates checkpolnt, restart, and interrupt sort
procedures. It accepts single or blocked fixed lenqth records or Single variable
length records.

SORT 54
Abstract:

IBM Application P.t Systems Programs Library Abstrad

File Number 0705-SM-052

. Purpose: SOrt 54 is a generalized three-way merqe sorting program. It is
capable of modifying itself according to control card specifications.
SORT 54T/

Equipment Specifications:

IBM 705 (Modell or Model
754 Tape COntrol
7 727 Tape Drives
717 Printer

m
Purpose: Sort 54T/ Is a generalized three-way merge sorting program. It is
capable of modifying itself according to control card specifications.

Additional Remarks:
Sort 54 incorporates checkpoint, restart, and interrupt
sort procedures. It accepts single or blocked fixed length records or single
variable length records.

IBM Application &: Systems Programs Library Abstract

File Number

0705-SM-049

SORT 54T

Equipment Specifications:

IBM 705 Model ill
777 Tape Record Coordinator
7 727 Tape Drives
717 Printer

Additional Remarks: SOrt 54T/ incorporates checkpoInt, restart, and interrupt
sort procedures. It accepts single or blocked fixed length records or single
variable length records.

IBM Application &: Systems Programa Library Abstract

FUe Number 0705-SM-053

~

Purpose: Sort 54T is a generalized three-way merge sorting program. It is
capable of modifying itself accordinq to control card specifications.
Equipment Specifications:

IBM 705 (Modell or Model m
777 Tape Record Coordinator
7 727 Tape Drives
717 Printer

SORT 571

Purpose: Sort 571 is a generalized four-way merge sorting program. It is
capable of modifying itself according to control card specifications.

Additional Remarks: Sort 54T incorporates checkpoint, restart, and interrupt
sort procedures. It accepts single or blocked fixed length records or single
~riable ~en~h records.

Equipment Specifications'

IBM 705 Model ill
2 777 ·Tape Record: Coordinators
7 727 Tape Drives
717 PrInter

Additional Remarks: Sort 571 incorporates checkpoint, restart, and interrupt
sort procedures. It accepts single or l>locked fixed length records.
IBM Application lit. Systems Programs Library Abstract

FUe Number

0705-SM-050
[BM Application &t Systems Programs Library Abatract

FUe Nusnbcr

0705-SM-054

SORT 57
SORT 80
Abstract:
Abstract:
Purpose: Sort 57 is 'a generalized four-way merge sorting program. It is
capable of modifying itself accordlng to control card specifications.
Equipment Specifications:

m

IBM 705 (Modell or Model
2 777 Tape Record Coordinators
7 727 tape drives
717 Printer

Additional Remarks: Sort 57 incorporates checkpoint, restart, and interrupt
sort prc;>cedures. It accepts single or blocked fixed length records.

Purpose: A generalized sorting program that will sort files of fixed- or variable-Ie ngth
data records, single or blocked, on a control data word as long as 100 characters
and conSisting of as many as five fields. To facilitate program scheduling, Sort 80
will use whatever tape Wlits are specified in the control information supplied by the
user.
Optional featUres of Sort 80 include an Extended Sort made for sorting particularly large
files, and provisions for label processing and for the accumulation and checking of
hash totals. Exits are prOvided at logical points in the program to allow the user to
include additional routines. Sort 80 also provides checkpoints, interrupt and restart
procedures, and routines which facilitate the correction, or deletion and later recovery
of unreadable records.
Equipment Specifications:

44

705 Madellll or 708)
767 Data Synchronizer
4 Tape Drives

A - 705

IBM Application &. System. Programs Library Abstract

FUe Number 0705-SM-055

MERGE 80
~t:

Purpose: A generalized two- to ten-way merging program that will merge files
of fixed- or variable-length data records, single or blocked, on a control data

word as long as 100 characters and consisting of as many as five fields. To
iac1lltate program scheduling, Merge 80 will use whatever tape units are
specllied in the control information supplied by the user.
Optional features of Merge 80 include prOvisions for label processing and for
the accumulation and checking of hash totals. EJdts are provided at logical
points in the program to allow the user to include additional routines. Merge 80
also provides checkpoint, interrupt and restart procedures, and routines which
facilitate the correction, or deletion and laler recovery of unreadable records.
EqUipment Specifications:

705 Model m or 7080
767 Data Synchronizer
4 tape drives

IB,,{
Application'"
Systems Programs Libra.ry Abstra.ct
FUe Number 0705-UT-056
--- - - - - - -____________________________
m.. .

80 SERIES UTILITIES

Abstract:
Purpose: All "BO Series" utility programs except LOAD BO and CLRM80 contain
routines that will check labels set up in conformance with mM standards, if
desired.
Single Card Load (WADBD): Loads standard 705 program cards from the card
reader or a 729 DS tape.
Clear Memory (cLRM80): Sets memory positions 00160 - 39999 (or 79999) to
blanks, and resets the accumulator and ASUs 01 - 11 without interrupting
automatic operation.
Expanded Loads (LOAD81 and LOAD82): Load standard and/or expanded format
program cards from one or a combination of two input units. Both programs
feature the ability to locate a specified program on a tape.
Tape File Assembler (TPFIBO): Assembles tape files from cards or card images
on tape. Output may be fixed- or variable-length tape records, single or blocked.
Tapes must be used on 729 tape units.
Memory Print (MEPRBO): Produces a printed listing of the contents of any tape
mounted on a 729 tape unit, either directly on a 717, 720, or 730 printer or on a
729 I tape for later off-line printing.
Tape Duplication (TPDP80): Duplicates any 767 Data Synchronizer-controlled
tape or tapes, or any selected file or files thereon.
Equipment Specifications:

705 Model In, or
7080

45

A - 709.

IBM Application &. Sy.tern.. Programs Library Abstract

FUe Number 0709-CV- )65

IBM Application It Sy.toms Program. Library Abstract

rue Number 0709-PR-063

704/709 INPUT/OUTPUT COMPATIBILITY PROGRAM
SHARE OPERATING SYSTEM - IB MONITOR VERSION

Abstract:
Purpose: To make possible the execution of 7J4 programs on the 700 by assuming
responsibility for all input/output functions, and to simulate 704 drum storage in
cores if drums are not present in the 7:19 system.

mM Application &. Systems Programs Library Abstract

FUe Num.be~

0709-CV-070

Abstract:
Purpose: SOS is a set of components controlled by a one-phase monitor
operatinq on stacked jobs. The system compiles symbolic machine-oriented
lanquage into condensed squozed form and/or performs one-pass loading of
squozed decks with symbolic modification. The output includes absolute decks,
listings, and new squoze deck. Features include programmer macros, library
facilities, syswm macros, and routines for symbolic debugging. Tape assignments and system references are symboUc.

709 CARD CONVERSION
IBM Application &. Systems Programs Library Abstract

Purpose: This is a collection of four programs for conversion of card formats.
They are:
1.
2.
3.
4.

IBRBOl
IBRB03
IBRB05
IBRB07

Hollerith to BCD, or Column Binary to Row Binary
BCD to Hollerith
Row Binary to Column Binary
BCD to live image

Restrictions: Hollerith input may contain only those characters listed in Appendix I
of The Share 709 System (SOS) Manual. Part If Preliminary Edition, July. 1958.
including the symbols "normally not used ". Any other character will cause an
error return.

FUe Number

0709-PR-064

SHARE OPERATING SYSTEM - SHARE MONITOR VERSION

Abstract:
Purpose: SOS is a set of components controlled by a three-phase monitor
operating on stacked jobs. The system compiles symbolic machine-oriented
lanquage into condensed squozed form and/or performs one-pass loading of
squozed decks with symbolic modification. The output includes absolute decks,
listings, and new squoze deck. Features include programmer macros, library
facilities, system macros, and routines for symbolic debugging. The SOS
system includes job data editors operating to and following job execution. Tape
assignments and system references are symbolic.

Column binary input must be identified by lis in the sign positions of the 9-left and
7-left words of the card image (corresponding to the control punches in a column
binary card). Absence of these bits will cause the routine to treat the image as

Hollerith, or to transfer to the error returns as specified by the calling sequence.

IBM Application &: Sy.tem. Programs Library Ab.tract

rUe Number 0709-SI-071

SIMULATE PERIPHERAL EQUIPMENT
IBRBOl
IBRB03
IBRB05
IBRB07

80-105 mB

38 ms
158 ms

Abstract:

30-40 mB

Purpose: This is a collection of three programs to Simulate off-line peripheral
equipment. They are:

Storage Requirements:
IBRBOI
IBRB03
IBRB05
IBRB)7

258 + I/O words
131 + I/O words
66 + I/O words
182 + I/O words

IBM Appiication &: Sy.tems Program. Library Abstract

1.
2.
3.
4.

rUe Number

0709-FO-062

IBRB02
IBRB04
IBRB06
!BRB08

Card-to-Tape
'Tape-to-Card Hollerith
Tape-to-Card Binary
Tape-to-Printer

Restrictions: Hollerith input may contain only those characters listed in Appendix I
of The Share 709 System (SOS) Manual, Part I. Preliminary Edition. July. 1958,
including the symbols nnormally not used". Any other characters will cause an
error halt.
Column binary input must be identified by "control punches n in the sign positions
of the 9-left and 7-left words of the card. Absence of these punches will cause
the program to treat the card as Hollerith, or to come to an error halt, as
specified by the entry keys.

32K 709/7090 FORTRAN PROGRAMMING SYSTEM

Abstract:
Purpose: The IBM Formula Translating System, 32K 709/7000 FORTRAN, is
an automatic coding system for the IBM 709/7090 Data Processing System. More
precisely, it is a 700/7090 program which accepts a source program written in
the FORTRAN language, closely resembling the ordinary language of mathematics,
and which produces a machine-lanquage object proqram ready to be run on a 700
or 7090. The system also contains the FAP Assembler and FORTRAN Monitor,
enabling jobs to be compiled, assembled, and executed automatically.

Only the first 72 columns of each card are used. Tape records may be any length.
Storage Requirements:
IBRB02
IBRB04
IBRB06
IBlll308

407 words
261 words
188 words
591_

IBM Application &: Systems Programs Library Ab.tract
IBM Application &: Systems Program. Library Abstract

rUe Number

File Number 0709-SM-068

0709-PR-06::>
SORT 709

7)9/90 9PAC
~

Purpose: 9PAC is a collection of three systems, known as File Processor, Reports
Generator and 9PAC Sort. They respectively maintain, write reports from, and
sort a file. The source language is written on a series of specialized forms and
describes the function to be performed or a pictorial view of the output reports.
I/O is handled by the system and need not concern the programmer. The mode of
operation may be either compile and execute, or load and execute.

~

Purpose: This is a generalized sort program. This program uses a 2 through 5-way
merge. Input is binary or BCD from tape. The tape may consist of one or more
reels of fixed-length records. Input file is sorted into ascending sequence based
upon 1 through 5 control fields arbitrarily arranged within the record. The control
fields may have a total of up to 360 bits.
Use: Control cards specify record length, input and output blackings, control
fields, memory available, merge order, and tape units. Program may be interrupted at any point and later restarted.

47

IBM Application &: Systems Programs Library Abstract

File Number 0709-SM-067

GENERALIZED MERGE

Purpose: This is a generalized merge on 2, 3, 4 or 5 BCD or binary files.
The input may be one or more reels of fixed-length records. The files are
merged into ascending sequences on as many as 360 bits of controlled data
contained in up to 5 control fields. Output is in the same format as input, but
blocked as per control card. Sequenced input files may arise from splitting a
large file to stay within the capacity of Sort 709, or from batch processing.
Timing: Timing is essentially that of one-tape pass for the output file.

IBM Application &: Systems Programs Library Abstract

File Number

07J9-UT-OGB

709 UTILITIES

Purpose: This is a collection of 8 utility routines:
1.

RAFG generates a file of random binary or BCD digits.

2.

gOAL loads instructions punched in absolute octal with their alphabetic
mnemonic operation codes.

3.

YM:SG prints on-line messages.

4.

TeMP compares two tapes word for word.

5.

~

6.

SPTR provides a
upper memory and

7.

TELD builds short tapes for testing and other special purposes.

8.

TD provides an octal or BCD print of tape.

checks the sequence of a file of records.
and have up to five control fields.

Records may be blocked

spot trace. The information is stored in
upon completion of program.

IBM Application &: Systems Programs Library Abstract

File Number 0709-UT-OS9

7J9 DATA PROCESSING PACKAGE

Purpose: The ?Cl8 Data Processing Package is a collection of miscellaneous programming aids to th8 handling of commercial data on the 709. At present it consists of
generalized subroutines which permit numeric data to be converted from and to
binary and to be edited for visible output, and alphanumeric data to undergo movement,
validity checking, and comparison.

48

A - 1401

IBM Application &t System a Programs Library Abatrac:t

FUe Number 1401-AT-017

Use of program:
The user's FORTRAN program statements, punched on cards. are
entered into the 1401 OPS. followed by the FORTRAN compiler, which
may be on cards or tape. The source program 1s translated by Lhe

1401 CARD SYSTEM ERROR-DETEC1'10N AIDS

~r~~~:,r l~i~~f~;~~~;Jr{6~~4CJ.t m~fRJni~ l~~~~~'a %~Or~~gXfh~~ core
compilation which includes the source program statements, diagnostic
information relating to the intelligibiUty and consistency of the source
program, and other u::;cful inforITh'1.tion comprising a record of the
compilation.

Purpose: To provide a simple 1401 system for checking out programs.
Method: Does not apply.
Restrictions. Range: Does not apply.

Machine Configuration:

Storage Requirements: Does not apply.

For compilation of source programs:
1401 Processing Unit (any model with 8000 or more
core storago positions)

Equipment Specifications: No special features required.
Remarks: 'l'he programs provide a control card method for "patching" a 1401 program
with instructions that will either:
1.
Halt the program at selected Urnes;
2.
Print selected areas of storage at selected times.

Advanced Programming Feature
Hi on Chanllel one {I)

JBM Application &. Systema Programs Library Abstract

IBM Application & Systems Programs Library Abstract

The machine configuration required by the

Minimum of 2.0 K storage.
Four rBM 72.9 II, IV, or 7330 Magnetic Tape Units,
An IBM 1402. Card Read Punch.
An IBM 1403 Printer, model 2..

*
*

"* Options

arc available to trade I, 2., or 3 magnetic
1402. and 1403 unit record devices.

File Number

1410-AT-l05

1410 PAT UTILITY SYSTEM (40K)

IBM Application &; Systems Programs Library Abetract

tap~

units for the

File Nwnber 1410-CB-912

1410 COBOL PROCESSOR

E~..:£.9!"!?":

The 1·110 PAT System facilitates the.testing of newly-developed 1410
progr~rn8.
This u.utolnatic tenting proced~1J"e redllces the amount of machine time
and programme r effort required during the testing Iltage of pr03ranl developITlent.
The PAT System also ler.d3 itl;clf to remote tC[Jting. The PAT System provides the
automatic testing facility plus a number of 1410 card, tape, and 1405 disk utility
programs.

Use of

Pro~m:

Purpose: 1410 COBOL Processor accepts progr3.ll1s w.ritten in the
COBOL 61 language as input and produces complete obJect programs
to perform the functions specified in the source statements.
Use of Program: The process involves a COBOL run (which produces
COBOL diagnostics and the source program translated into Autocoder
language and forInat) followed by an Autocoder run (which produces
the object program. asselUbly listing and a condensed deck). The
process is continuous and complete if

The 1410 PAT System comprises a series of program testing

-;~nes-;nd utUity programs that, al· the uirection of the user and under control
of the PAT program, are arranged in conjllnction with the program to be tested on
a PAT tape.
The ro'.llines nnd pro,~rams are arranged on tape in the order they arc to be (~xecuted.
Testinci the program merely requires the loading of the PAT tap~ and an idclltification
c;:!.rd for each program to be tested. The rO'Jtines and proi;:rams o~ tape are automatically executed in predetermined sequence.

(1)

no serious diagnostic errors are discovered, and

(l)

if the system configuration provides tape input to the
Autocoder Processor.

Machine Configuration:

"All lliM 1·110 wilh 40K
b.
d.

1.
l.
3.
4.

position~

o( corll Iltol'age
An IDM 140l C~rd Reader_Punch
An IBM 1103 Maud 2 Printer
At least two IBM 729 or 7330 Tapa Unito on Channel onc (1).

IBM Application

&;

Syeteme Programs Library Abstract

FUe Number

Basic requirements are:

Minimum of 2.0 K storage.
An IBM 140l Card Read Punch, model 2.
An IBM 1403 Printer, model l.
Four IBM 72.9 II, IV or 7330 Magnetic Tape Units (lUay be
intermixed) .

1410-AU-102
IBM Application & Systems Programs Library Abstra.ct

1410 BASIC AUTOCODER

File Number

1410-FO-913

1410 FORTRAN II PROCESSOR

Purpos.e: The 10110 BaBic Autocoder relieves the USBr fro~
writing his. routines in machine language. He may now wnte
his routms uoing a well defined aet of IIU1emonic operation
codes in conjunction with useful and significant labels. which
he defines, and then processes them with Basic Autocoder to
produce an operating object progrant. If the user requires a
lnore detailed deBcriptiOll of this program., he may obtain it
by requesting the Baaic Autocoder Bulletin listed in the
references.

The 1410 FORTRAN (FORmula TRANslating) II Processor
is a 1410 machine-language program. This program converts a
source program written in the FORTRAN II language (which closely
resembles the language of mathematics) into an object program
ready to run on the IBM 1410. The FORTRAN processor thus makes
it possible for personnel trained in mathell1atics but not in programming
to prepare problems for the computer.

UBe of Program.: The source symbolic progrant is combined
with this program in a predescribed manner and is operated
on by the compiler to produce an operating object program..

Use of Program: The proceasor is used in two phases: a FORTRAN
phase and an Autocoder phase. During the FORTRAN phase, the
processor compiles a symbolic program in Autocoder format. During
the Autocoder phase, the proceseor converts tIils Autocoder program
into a 1410 object program.

Machine Configuration: The machine confignration required
by the Basic Autocoder program is:

1.
2.
3.

Minimum of 10,000 core locations.
One 1402 Reader- Punch.
One 1403 Printer.

~

Machine COnfiguration:
use of the program are:

Minim.um machine requirements fot the

20,000 pOsitions of core Btorage

IBM 1402 Card Read-Punch, Model 2
IBM 1403 Printer, Model 2.
IBM 729 II. IV, or 7330 Magnetic Tape Units
(may be intermixed)

S5

IBM Application" Systems Prolrams Library Abstract

.!

rue Number 1410-10-909

Use of Program: A control card and flpecitications carda must be
placed at definite points in the RPG condensed deck, The standard
card loader is used,

1410 INPUT/OUTPUT CONTROL SYSTEM (CARD/TAPE IOCS)
Machine Configuration:
The 1410 Card RPG will handle card input
and card-printer output only. Machine requirements are'
Purpose: The 1410 Card/Tape IOCS relieves the u~er from coding input
and output routines for unit record equipment and :rdagnetic tapes. It
enables the programmer to handle logical.re?ords merely by using GET,
PUTi and related IOCS macro-instructions. The blocking and deblocking
of records is handled automatically by IOCS. Also. IOCS can be instructed
to provide the coding required for the overlapping of input ~d dutput
operations with processing if the 1410 is equipped with the Overlap and
Priority special features.

10K
140Z
1403

storage
card reader /punch
printer (either 100 or 132 character positions)

The report program generated by RPG will have machine requirements
dependent on the specifications provided. The minimum would be:
10K
140Z

storage
card/reader punch

~g!:.2.!!U

For each program which is to utilize the IOCS, the
programmor must:
1.

z.
3.

4.

Use the 10CS macro-instruction in his program.
Write one set of DIOCS statements.
Write one set of DTF statements for each file used by his
program.
Write proper DA statements for each area used by the IOCS.

The IOCS routines are generated by the Autocoder and placed in the user's
program when it is compiled.
Machine Configllration: lOGS has no machine configuration requirements.
Autocoder configurations are, of course. required during IOCS generation

18M: Application" Systems Programs Library Abstract

File Number 1410..10-011

1410 INPUT/OUTPUT SYSTEM FOR 1405 DISK STORAGE

J8M Application. Systema Programs Library Abstract

FU. NUDlber 1410-RG-910

1410 REPORT PROGRAM GENERATOR (CARD/TAPE/1405 _ DISK RPG)

Purpose: The 1.410 RPG accepts report,specifications and produces a
symbolic program deck (Autocoder format) for the' desired report program.
The generated report program c'an produce a wide range of formats,
extracting its data from a card, tape or disk file (one only) and performing
calculations at any pOint in the repol"ting pl'oceas. RPG~generated programs
utilize the 1410 IOCS.
Use of Program: A control card and the report- specifications cards are
placed in proper order in the card reader. The Processor Operating
System Tape, 1410-PR-IOB, and one work tape are used in the RPG run.
An Autocoder run must follow to produce the program deck for the report
program. The output of the generated program can be a printed report
and/or punched cards, or tape records in the move mode, even parity.
Machine Configuration:

Purpose: The 1405 Disk IOCS provides several macro-instructions and
related routines that handle the scheduling of 1405 input and output operations
for random and/or sequential processing.
Use oC Program: This IOCS is used in conjunction with 1410 Card/Tape
IOCS. The appropriate disk ]/0 rout.ines are generated by 1410 Autocoder
according to file specifications and placed in the user's program when it
is compiled.

Minimum requirements are -_
1.

For RPG (to generate the report program) - 1410 system •.•
ZO K storage .•. 140Z Card Read Punch•.. two magnetic tape
units (7Z9 II, IV, or 7330).

Z.

For Autocoder (to assemble the report program) _ 1410 system •••
20 K storage ... 140Z Card Read Punch •.. four magnetic tape
units (U9 n, IV, or 7330) •.• 1403 Printer, model Z. (See
configuration of Autocoder for options.)

3.

For the, report program. (to produce the report) _ 1410 system •..
(:0. K storage ... 1402 Card Read Punch•.. other I/O units
appropriate to the program.

Machine Configuration: The machino configuration required by the
input/output System tor 1405 Dlsk Storage is:
1.
Z.
3.

Minimum of ZOK storage
1405 Disk storage
Processing Overlap and Priority special features.

IBM AppUcat!on II: Systems Pro.rams Library Abstract

rue Number 141O-PR-l08

IBM Appllc:&tlon " By.ten" Pro,ram. Library Abstract

rue Number 1410-sI-042

PROCESSOR OPERATING SYSTEM TAPE
Slmulatlon of the 1410 with ihe 704170917000

Abstract:
Purpose: !rhls is a systems tape containing the iollowing 7 programs:
1410-SV-907
141O-AU-906
1410-10-909
1410-10-911
141Q-RG-910
141O-CB-912
1410-FO-913

System Supervisor
Autocoder
IOCS Card/Tape
IOCS 1405 Disk
Replrt Program Generator
COBOL 61
FORTRAN II

JBM Application Ie Systems Program. Library Abstract

roe Number

1410 CARD REPORT PROGRAM GENERATOR

The program enables tile user to test and correct 1410 programs
prior to installation of an IBM 1410 data processing system. The system
will trace or dump simulated programs.

~

Restrictions: The program simulates standard card and tape systems.
The simulated 1410 has 20,000 core storage positions. Using Basic
Autocodes the simulator will assemble 1410 programs. A ma.x1mum of
one disk oi 1405 ~torage can be simulated.
1410-RG-103

Timing: The 709.takes approximately 20 times longer than if the program
was running on a 1410.
Equipment Specifications:
32, 676 words of core storage
4 tape units + 1 tor simulated 1410 tape units + 2 ior disk
Addltlonal Remarks: ThIs program is distributed on a card dec~.

pUJPose: The 1410 Card RPG condensed deck accepts specifications
an produces a symbolic deck in Basic Autocoder {or a report program. Processing is sequential, without allowance {or overlap and
priority. both in RPG itself. and in the generated report program.
The latter can produce reports in a wide range oC .formats, extracting
its data from a card file and performing calculat:lone very much.after
the fashion of an IBM 407 Accounting Machine. save that multiply,
divide and compare. in addition to mOre ballic calculations, may be
perfn1'med at any point in the total reporting process.

56

IBM 1401 PROGRAM LIBRARY ABSTRACT

File Number

1410-SI.. 101

SIMULATION OF THE IBM 650 ON THE IBM 1410
(ConUnued on next page)

A - 1410

Purpose: The 650 Simulation provides means to run 650 programs
on a production basis on the 40K 1410. U the user requires a
more detailed description on the program, he may obtain it by
requesting the Simulation of IBM 650 on IBM 1410 Bulletin.
Use of Program: The 650 Simulation is to be entered into the
1410 along with control information indicating the system being
simulated. Then the 650 program is run monitored through the
650 Shnulator ProgrlUn.

a)
b)
c)

Minirnwn of 40,000 core locations.
One 1402 Reader-Punch.

IBM Application &. Systems Programs Library Abstract

Une: A minimum of two control cards IHust be prepared by th"
~ prior to operating Sort/Merge IZ on the 1410. Theae carda
supply the progra:m with inIormation it needs to mako itaolf
specific (or the function to be por£ormed, for tho data characteristics
and for the machine configuration.
Machine Configuration: Sort/Merge 12. require a an IBM 1410 Data
Processing Syotorn with tho following zninl.mum configuration:

Machine Configuration: The machine configuration required by
the Simulation of IBM 650 on IBM 1410 program is:
1.
2.

ordered output data. Input records can be fixed or variable
length. sin~le or blocked. Output can be either in ascending
or descending ordor. JulY ordel' of morge up to 5-way may
be employed.

File Number 1410-SM-110

ZO, 000 poaltions of COl'e storage
Procollllip.g Overlap and Priodty Special Features
4 IBM 729 n. 729 IV. and/or 7330 Magnetic Tape Units (may
be inter-mixed) if Sort/Merge 12 is to function as a Sort. (To
perfor:m a Z-way McrEc, only three t .. pes are needod.)
IBM 1402. Card Rcad-PIUlch Model 2.

d)

InM Application !.t Systems ProgranHI Library Abstract

1410 SORT 10

File Number 1410-SV-907

1410 SYSTEM SUPERVISOR
Purpose: Sort 10 ie a generalized sorting program which
emi>loys from 1 to 5 IBM 1405 Diak Storage Units and the
Processing Overlap and Priority Special Features. Input
records can be either on tapo or in disk storage and can be
fixed or variable length, single or blocked. Output will be
on tape in aacending order.

Purpose: The System Supervisor has several functions in the operation
of the Processor Operating System Tape.

Use: A minimum of four control carda muat be prepared by the
U'Se"r prior to operating Sort 10 on the 1410. Those cards supply
the program with information it needs to make itself specific
for the data characteristics and for the machine configuration.

1.

In lhc role of a Supervisor, it picks up i;(ormation (rom
control cards and, acting upon this information, positions
the System Tape. calls in the required phase or program
and then turns control over to the program called.

Z.

The System Supervisor also accomplishes the duplication
of new systern tapes ilS well as the maintenance of the
sy:-;tem tape.

3.

Another part of the System Supervisor is the Library
PRINT Program, which prints any desired section of the
library that is on the Processor Operating Systetn Tape.

Machine Configuration: Sort 10 requiros an IBM 1410 Data
Proceaaing System with the (ollowing minimUIn configurationa:
a)
b)
c)
d)
e)

20, 000 positions of core storage.
I IBM 1405 Disk Storage Unit.
Processing and Overlap Special Features.
1 IBM 729 Il. 7Z9 IV or 7330 Magnetic Tape Unit.
IBM 1402 Card Read-Punch, Model 2.

If storage size is 40K. Sort 10 will use the additional storage. when
necessary. to increase the size of its input/output areas and work

Use o( Program: The System Supervisor consists o( three programs
contained in the systern tape. They are self loading. or are called
by control. cards, and perfortn the functions listed above as directed
by control information.
Machine Configuration: The machine configuration required by the
System Supervisor for system maintenance runs is:

IBM Application &. Systems Programs Libra.ry Abstra.ct

File Number

1410-SM-ll1

1.
2.
3.

SORT/MERG E 11

The machine configuration for the individual programs on the Proccssor
Operating System Tape are specified in the Abstracts of the progratns.
The 1410 Autocoder has the largest minimum requirement.

Purpose: Sort-Merge 11 is a generalized Wl-buffered tape sorting
and merging progratn designed to permit either the sorting or the
tnerging of data 80 as to produce ordered ·output data, Input records
can be fixed or variable length. single or blocked. Output can be
either in ascending or descending order. Any order of merge up to
5-way may be employed.
Usc: A minimum of two control cards must be prepared by the user
prior to operating Sort/Merge 11 on the 1410. These cards supply
the program with information it needs to make itself specific for the
function to be performed. for the data characteristics and for the
machine configuration.
Machine Configuration: Sort/Morge 11 requires an IBM 1410 Data
Processing Systetn with the following minimum configuration:
a}
b)

c)

20,000 positions of core storage
4 IBM 72.9 II, 729 IV. and/or 7330 Magnetic Tape Units (may
be intur-:mixcd) if Sort/Merge 11 is to function as a Sort. (To
perform a 2_way Merge. only three tapes are needed.)
IBM 1402 Card Read-Punch Model 2.

If atorage size is 40K, 60K or HOK, Sort/Merge 11 will use the
additional storage, when necessary, to increase the si1;e of its
Input/Output Areas and Work Areas.

IBM Application &. Systems Programs Library Abatract

Minimum of ZO K storage.
Two IBM 71.9 n, IV, or 7330 Magnetic Tape Units.
IBM 140.2 Card Read Punch.

File Number 1410-SM~112

IBM Application &: Systems Programs Library Abatract

File Number

1410-UT-l06

1410 UTILITY PROGRAMS

Tape File Gcnerat9'!~.! Thi.s program
variable-lcnllth card recordl).

pl'Cpl\l"l1~

unblocked tape files h'OITl

Tape File Generator~.! This progl'am gcncratcs blocked and unblocked tape
fi.les (rom fixed length card records.
Tape Compare ~~~. This program comparcs the contents of two magnetic
tapo;la, each of which can be in odd or even pari.ty, and high or low density. They
may have fixed or variable_lcngth recorda and may be blocked or unblocked.
Only one HIe c:an be compared on a run, and the comparillon may start at any
fUe or rucord on either tap<:.l. If the records are not idulltical, they wlll be
written Ollt.
.!!Ee DUplicale Progra~. Thia program duplicates the contents of O!1C magnetic
tape on a second tape. The duplicated lape can be written in high or low density
and in odd or even parity. regal'dIesB of the density and parity of the original
tape .. The original tape :may conlain fixed or variable-length records, and may
be blocked or unbloclted. Up to nine files of a multi-file reel can be duplicated.
~Bho!..!,,_:.:.o.JL~l!!.'

The Snapshot Program if.l a program testing aid. It points
O"Jt the contents of a specifi.ed area of core !itol'age following the execution of any
speci.fied instrucHon in the object prO~l·aln. Following the execution of the
Snapshot Program, control is rdurncd to tlu! object prograITl. The Snapshot
Program also prints the contents of the Indcx Registers and the settings of the
HIGH-LOW-EQUAL, ARlTIIMETIG-OVEHFLOW, or ZI';RO RESULT indicators.

SORT/MERGE 12

Purpose:
Sort - Merge 12. is a gcnerali:z;ed tape
sorting and merging program which employs the processing
Overlap and Priority Special Features. It is deaigned to perznit
either the sorting or the JYlerging of data so as to produce
(Continued on next colUmn)

Storage PrJ-Ilt Pro~~~:.. The Stol'al~c Print lHogram pdnts out the entire
contents of 1410 core storage. Sllbstitllte characters arc used in place of those
not available on the user1u 1103 Pl·inlcr. WOJ:d Ill-arks are represcnted by the
di~it "1" printed abov~: lh" c:hal·acl"l.' with wlliell the wonl ,"nal'k it> ",ssociated.

57

IBM Application 81; Systems Programs Library Abstract

rUe Number 1410-UT-I07

1410-1405 DISK UTILrI'Y PROGRAMS

Clear Disk Program. The Clear Disk Storage PrograIll erases all
data in all or selected portions of disk storage by writing blanks. The
user also has the option of filling these areas with anyone of tbe other
63 valid characters, and the ability to write a six_digit address in tho
first six: positions of each sector cleared by this prograIll.
Disk-la-Tape Program. The DiBk to Tape tAl PrograIll enables the
user to preserve data contained in all or selected portions of a disk
file before that data is updated or altered.
Tape_to_Disk Program. The Tape to Disk 'AI Program enables the
user to reload into disk storage all or oelected portions of the tape
records that have been unloaded by the Disk to Tape Progratn.
Disk-to-Printer PrograIll. The DiBk to Printer PrograIll Is used
to prlnto~the IBMl403 Printer data contained in all or portions
of a disk file.
Disk File Generator. The Disk File Generator enables the U8er to
load data frOIll plU1ched cards into disk storage.
Use of Programs: The 1410-1405 Disk Utility Programs are u8ed in conjunction with a Machine Specilications Card. and with Area Control
Card(s). The programs will anow the user to clear all of dJsk storage
or selected areas of it to blanks or any other allowable character,
generate data in all or selected areas of disk storage, write the
contents of all or selected areas of disk storage on tape or on the
printer, and reload areas of diek storage that were previously
written on tape. The sIllaUest area that may be acted upon, however,
is a single track of ten sectors.

Machine Configuration
Basic Requirements for all prograllls.
Each progralll requires a mtniIllurn. of:
10,000 positions of core storage
1 IDM 1405 Disk Storage Unit, Modell or Z
1 ffiM 1402 Card Reader Punch
AdditionaL requirements:
1410-1405 Disk-to-Printer PrograIll
1 IBM 1403 Printer, Modell or Z
1410-1405 Disk_to_Tape Progralll
1 IBM 729 II, 729 rv, or 7330 Magnetic Tape Unit
1410-1405 Tape-to_Disk PrograIll
1 IDM 729 II, 729 IV, or 7330 Magnetic Tape Unit

IBM Application to: SYGtems Programs Library Abstract

File Number 1410-UT-117

1410-1405 DlSV FILE PROTECTION PROGRAMS

Disk-to-Tape with Overlap. The Disk-to_Tape File Protection
Program enables the user to preserve data contained in all or
specified portions of a disk file before that data is updated or
altered. Because of the utilization of the Overlap special feature
this program is considerably faster (approximately 35D/o) than the'
DISK - TO- TAPE utility program. This progralll is primarily
written to be used In conjunction with the users production programs.
Tape-to-Disk with Overlap. The Tape_to_Diak File Protection
Program enables the user to reload into disk storage all or
spe.cified portions of the tape records that have been unloaded by
the TAPE_TO_DISK File Protection Prograrn.. Because of the
utilization of the Overlap special feature this progranl is conSiderably faster (approximately ZO%) than the DISK-TO-TAPE
utility prograIll. This program i9 primarily written to be used
in conjunction with the users production prograIlls.
USIS of PrograIIls
These File Protection Program8 can only be used on a machine
that has the Processing Overlap &pecial feature, and only full
tracks are written and loaded. The programs are used in conjunction with a Mac hine Specifications Card, and with Area Control
Card(s). The user can unload onto tape or reload frOIll tape either
a complete disk file or selected areas of the file. Either the Move
mode or the Load mode may be used.

58

A - 162Q
IBM Application &.: Sy.tema Program. Library Ahlltra.ct

FUe Number 162O-AT-013

IBM Application .. By.tema Program. Library Abstract

I'll. Number

1620-FO-OO3

FORTRAN with FORMAT FOR PAPER TAPE

1620 FLOW TRACE PROGRAM

Abstract:

~

Purpose: Program converts source program written in FORTRAN language into
machine language instructions.

Purpose: To enable the proqranuner to check that the path (flow) of his program
1s correct. Should the program deviate from the expected, the trace helps
localize the trouble.

Method: Not given.

Method: The trace program detects every branch that actually occurs in the
object program, types the address of the branch instructor and the address to
which it branched.

Restrictions. Range: Permissible FORTRAN language is a subset of 704/709/7000
FORTRAN language. Number of symbols is limited to SPOt The program wID
process FORMAT statements.

Restrictions. Range: cannot discontinue the trace in the miodle of the subroutine

Storage ReqUirements: Requires 20, 000 storage positions 1620.

linked to the main program by a BT or a BTM and a BB instruction.

storage Requirements' 631 positions of core storage. Program is relocatable.

Equipment Specifications:

Equipment Specifications; 1620 with paper-tape reader. No restriction on 1620

core storage (20K, 40K, 6DK). Trace output is via typewriter. Cannot be used
on machines with Indirect Address1nq .feature.

1620 CPU
1622 Card Read-Punch Unit
1623 Core Storage Unit may be added, at the
user IS option.

IBM Application .. System. ProRtams Library Abstract
IBM Application II: Systems Program. Library Abstract

FUa Numblll'

1620-FO-OO4

rUe NlU'I'lber 1620-AT-014

FORTRAN With FORMAT
1620 SELECTIVE TRACE PROGRAM
~

Purpose: To provide more detailed checking than the FLOW TRACE PROGRAM.
To help pinpoint the exact location of the trouble. To enable the programmer to
check each instruction as it appears in memory and the data fields as they are
manipulated.

~

Purpose: Program converts source program written in FORTRAN language into
machine language instructions.
~

Method: Not applicable.
Restriction, Range: If instruction contains a record mark, only that part of the
instruction up to, but not including the record mark, will be type.. Cannot
terminate the trace during the execution of a subroutine linked to the program
with a BT or BTM and a BB instruction.
Storage Requirements: Program requires 2443 core locations. The small parameter table (containing start trace & stop trace addresses) is located at the end
of the program and the additional storage required by the table will. vary dependinq
upon the number of parameters specified. The program is completely relocatable.

IBM Application It Systems ProRrame Library Abstract

Notgiven.

Restrictions. Range: Permissible FORTRAN language is a subset of 704/709/7000
FORTRAN language. Number of symbols is limited to 300. The program will
process FORMAT statements,
Storage Reguirements: Requires 20, 000 storage positions 1620.
Equipment Specifications:

1620 CPU
1621 Paper Tape Reader
961 Tape Punch
1623 Core Storage Unit may be added, at the userls
option.

FUll Numb8l' 162D-FO-OOl
IBM. Appllcallon .. System. PrDgrams Library Abstract.

1620 FORTRAN (Tape)
~

FU. Number

1620-FO-005

FORTRAN PRE-COMPILE FOR PAPER TAPE

~

Program converts source program written in FORTRAN language
into machine languaqe instructions.

~

~

Notqlven.

Restrictions. Range: Permissible FORTRAN language is a subset of 704/709/
7090' FORTRAN language. Number of symbols is limited to 300.
Storage Requirements: Requires 20,000 storage positions 1620.
Equipment Spec1fications:

1620 CPU
1621 Paper Tape Reader
961 Tape Punch
1623 Core Storage Unit may be added, at the userls
option.

mM Application It Syatems Program. Library Abstract

FUll Number

1620-FO-OO2

1620 FORTRAN (Card)

Storage Requirements: 20, 000 positions.
EqUipment Specifications:

1620 CPU
1621 Paper Tape Reader

IBM Application .. Sy.tem. Programs Library Abstract

rUe Numher

1620-FO-006

FORTRAN PRE-COMPILE FOR CARD

~

Purpose: Program converts source program written in FORTRAN languaqe into
machine language instructions.

Method: Not given.
Restrictions. Ranae: Permissible FORTRAN language is a subset of 704/700/
7090 FORTRAN language. Number of symbols Is limited to 300.
Storage Requirements: Requires 20, 000 storage positions 1620.
Equipment Specifications:

Purpose: This program detects and permits correction of errors in a FORTRAN
source program before the object program is compiled. The Pre-Compile detects
many of the more common programming errors in individual source statements,
and indicates possible logical errors in the source program as a whole.

1620 CPU
1622 Card Read-Punch Unit
1623 Core storage Unit may be added,
at the userls option.

~

Purpose: This program detects and permits correction of errors in a FORTRAN
source program before the object program is compiled. The Pre-Compile detects
many of the more common programming errors in individual source statements,
and indicates possible logical errors in the source program as a whole.
Storage Requirements: 20,000 positions.
Equipment Specifications:

1620 CPU
1622 Card Reader Punch

59

IBM AppUeation Pc System. Programlll Library Abllltract

File Number

1620-LM-017

IBM Application Ie System III Programs Library Abatract

File Number

1620-LM-023

1620 FORTRAN with FORMAT - AU,];OMATIC FLOATING POINT SUBROUTINES,
TAPE SYSTEM

TRANSPORTATION PROBLEM

Abstract:
Abstract:
Purpose: This program soives the transpotation problem. That is, it minimizes
the total cost of shipping from M warehouses to N retailers.
Method: A logical search technique applied to the stepping-stone method.
Restrictions: Problem sizes are indicated by the formula:
6,000 + (M) (N) (MODC) + (M + N) (MODS + MODC + 23) + M(MODS + 12)
~ CORES

+ MODS

where

M = number of warehouses :MAX of 99
N = number of retailers
MAX of 900
MODS = maximum number of digits used to specify units.
MODC = maximum number of digits used to specify cost.
CORES = number of positions of core memory.

Purpose: This subroutine package can be used with the 1620 FORTRAN with
FORMAT, Tape System (Program #1620-FO-003) to realize the advantages of
the Automatic F10ating Point feature. storage requirements for the subroutines
are reduced and execution time of object programs decreased.
Use of the Program: The subroutines may be incorporated into the object program tape at compilation or may be loaded separately prior to the execution of
the object program. Messages are automatically types during compilation and
loading, indicating appropriate action by the user. This subroutine tape is
fully compatible with the two distributed with the 1620 FORTRAN with FORMAT
processor.
Machine Configuration: The subroutine package operates on a 1620 with punched
tape input-output and the Automatic Floating Point feature.

IBM Application

&;

Systems Program III Library Abstract

File Number

1620~:rvIT-01!)

Typical sizes are 40 x 50 with both MODS and MODe equal to 5 digit fields, 40 x 80
with MODS and MODC reduced to 3 digit fields, or if 40K additional memory is available, a 48 x 300 problem may be solved using 3 digit fields.

1620 HASH TOTAL PROGRAM

Equipment Specifications: Card or tape I/O, indirect addressing.

~

Additional Remarks:

Purpose: The purpose of this program is to determine quickly and to a high
probability whether a duplicated tape is an exact character for character copy
of its original. This is accomplished by taking an arithmetic "hash total II of
all the characters on any given tape.

Results of a 40 x 50 Problem
Calculation time for a 40 x 50 test problem varied from 3 min. using
3 digit cost and unit fields to 3 3/4 min. using 8 digit fields. The variation
of core storage used was from about 15, 000 to over 26, 000. The total
card input required approximately 2 1/2 additional min. while the output
added another 1/2 min. J for a total running time of less than 7 minutes.
Other 40 x 50 test problems have required as much as 8 minutes of calculation time, using 8 digit fields and occupying over 26, 000 core locations.
IBM Applica.tion Ie Sy.tem. Programs Library Abstnct

FUe Number 1620-LM·,018

Restrictions, Range: Does not apply.
Method: After each record is read in, it is split into fields of twenty digits and
~ch of these fields, in turn, is subtracted from an area called the accumulator.
At the conclusion of the routine the accumulator is compared with a previously
entered check total and a message indicating the result Is typed.
Storage ReqUirements: The program occupies core locations 402 to 1116 and
19980 to 19999. The remainder is available for input records.
EqUipment Specifications: This program may be used on a basic mM 1620 paper
tape machine with no optional features.

Production Line Balancing
IBM Application

&;

Systema Programs Library Abstract

File Number

1620-:rvIT-OI6

1620 NUMERIC TAPE DUPLICATOR/CORRECTCR
Purpose: This routine assigns operators to jobs on an assembly line.
The assembly line is divided into zones and the assignment is done in a
manner which tends to balance the work load in each zone.
~

A fast approximation method.

Restrictions: There can be up to 99 zones. The maximum number of
jobs per zone is 27 to 98 depending on the average number of precedence
jobs per job. The maximum number of can do jobs is 98.
Timing: A problem with 33[; input cards and 167 can do jobs took about
3 minutes 2xclusive of I/O.
Eguiprn(mt Specifications: Paper tape reader or card reader.
IBM Application at Systems Programs Library Abstract

File Number 1620-LM-022

1620 FORTRAN with FORMAT - AUTOMATIC FLOATING POINT SUBROUTINES,
CARD SYSTEM

~

Purpose: To duplicate or correct 1620 tapes conSisting only of muneric records,
separated by end-ai-line characters.
Method: Punching a tape which is an exact copy of the original or punching a
second tape incorporating the desired changes.
Restrictions. Range: lVIaximum permissible record length Is 8,850. Also, corrections may not increase or decrease the length of any record.
Storage Requirements: Program is loaded into memory from 00402 to 02300.
Each record to be duplicated is loaded from 02301. The program also uses an
area of core storage, ending in 19999 and equal to the length of the record, as a
dump area.
Equipment Specifications: 1620 with paper tape and 20K memory.

IBM Application

&;

Systems Programs Library Abstract

File Number

1620-PR-OI0

1620 GOTRAN (Tape)
Purpose: This subroutine package can be used with 1620 FORTRAN with FOR1vlAT,
Card System (Program #1620-FO-004) to realize the advantages of the Automatic
Floating Point featUre. Storage requirements for the subroutines are reduced
and execution time of object programs decreased.
Use of the Program: The subroutines may be incorporated into the object program
deck at compilation or may be loaded separately prior to the execution of the object
program. Messages are automatically types during compilation and loading, indicating appropriate action by the user. This subroutine deck is fully compatible
with the two distributed with the 1620 FORTRAN with FORMAT processor.
Machine Configuration: The subroutine package operates on a 1620 with the card
read-punch and the Automatic Floating Point feature.

60

~

Purpose: A relatively fast compiler for programs which will generally be
executed only once.
Method: GOTRAN stores the compHe.d pro~ram in ~emory during c~mputation.
The object program is then executed In an mterpretive mode. No object tape or
decl{ is produced. After execution of an object program, computation of a new
object program is possible without loading the processor.
Restrictions. Range: The language used in GOTRAN is a modified subset of
FORTRAN, including the functional subroutines. Arithmetic statements are restricted to one arithmetic operation per statement.
(Continued on next page)

A - 1620

Data 1s handled in the form of 10 digit floating point numbers of 3 diqit f!.xed
point numbers. Input-output is the same form as FORTRAN with the exception
that cards are punched with one item per card.
The maximum number of symbols that may be used is 500 in the tape system and
490 in the card system. The number statements allowed is inversely proportional
to the number of symbols used. Approximately 211 statements can be compiled
using 200 symbols.

IBM Application

& Systems Programs Library Abstract

File Number 1620-SP-009

IBM 1620 SYMBOLIC PROGRAMMING SYSTEM - CARD I/O
~

Storage Reguirements: Not given.

Purpose: This program system assembles symbolic instructions into absolute
machine language. The source program, consisting of the symbolic instructions,
is read twice.

Equipment Specifications: Basic 1620 Tape.

Restrictions. Range: The system can accommodate 312 labels.
Method: Does not apply.

IBM Application ... System. Programs Library Abstract

FUe Number 1620-PR-Oll

Storage Requirements: The system occupies memory from pOSition 100 to 19999.
Equipment Speci:fications: The system is designed to operate on a basic 1620 with
card I/O and can be modified for the additional storaqe unit 1623.

1620 GOTRAN (Card)

Abstract:
Purpose: A relatively fast compiler for programs which will generally be
executed only once.
Method: GOTRAN stores the compiled program in memory during computation.
The object program is UJ.en executed in an interpretive mode. No object tape or
deck is produced. After execution of an object program, computation of a new
object program is possible without loading the processor.
Restrictions. Range: The language used in GOTRAN is a modified subset of
FORTRAN, including the functional subroutines. Arithmetic statements are
restricted to one arithmetic operation per statement.
Data is handled in the form of 10 digit floating point numbers or 3 digit fixed
point numbers. Input-output is the same form as FORTRAN with the exception
that cards are punched with one item per card.
The maximum number of symbols that may be used is 500 in the tape system and
490 in the card system. The number statements allowed is inversely proportional
to the number of symbols used. Approximately 211 statements can be compiled
using 200 symbols.

IBM Application'" Syatems Program. Llbra.ry Ab.trad
1620/1710 SPS, CARD SYSTEM

~

SPS is an extension of 1620 SPS, a symbolic programming system in use
since late 1960. It provides many additional features in the assembly of
source programs, and includes five sets of noating point subroutines for
use on 1620 or 1710 systems of a variety of configurations. 'lhese are:
a)

IBM Application'" Sy·.tems Program. Library Abstract

FUe Number 1620-SP-007

Fixed length floating point nwnbers not using tile Automatic Divide
feature.

b)

Fixed length Hoating point numbers using the Automatic Divide feature.

c)

Variable length floating point numbers not using the Automatic Divide
feature.

d)

Variable length floating point numbers using the Automatic Divide
feature.

e)

Variable length floating point numbers using the Automatic Floating
Point feature.

Storage Requirements: Not given.
Equipment Specifications: Basic 1620, Card.

The range of floating point numbers is:
:!:.100000 ••• 0 x 10- 99 00

IBM 1620 SYMBOUC PROGRAMMING SYSTEM -

ONE-PASS PROCESSOR

:rUe Number 1620-SP-020

t. 99999 ••• 9 x 1099 •

For variable length subroutines the fractional part of the floating point
munber may vary from 2 to 45 digits.

Abstract:

Use of Program

Purpose:
This programming system assembles symbolic instructions into
absolute maChine language instructions. The source program, consisting of the
symbolic instructions, is read only once.

With the SPS processor loaded in the storage, the source statements may be
entered on the typewriter or through the card reader. In the first pass, the

RestrictiOns, Range: The system can process all of the machine operation
codes. It also processes the following declarative operations: DS, DC, DSA,
DORG, and DEND. A maximum of one hundred and ninety-nine labels can be
handled. Multiplication is not allowed in address arithmetic.
Method: Does not apply.
Storage Requirements: The system occupies memory from position 100 to 19999.
Equipment Specifications: The system is designed to operate on a basic 1620 with
tape I/O.

IBM Application

& Systoms Prog:rams Library Abstract

File Number 162Q..SP.OO8

statements arc scanned, certain errors detected, and label table constructed.
In the second pass the source statement.:J are again scannedj additional errors
are indicatedj and the program assembled in machine language. A l1sUng
deck or condensed deck, both self-loading, may be punched. Llsting on the
typewriter is also possible. A map of storage assignments may be typed.
If subroutines are required. the proper subroutine deck will be processed
and subroutines selected for inclusion in the object program.
Machine Configuration
For assembly of source programsj
Basic Card 1620 or 1710 with 20,000 digits of storage. 'The.processor can be
modified for 40, 000 or 60,000 digits of storage to allow an extension of the
label table.
For execution of assembled programs:
A 1620 or 1'/10 system with any optional features.

IBM 1620 SYMBOUC PROGRAMMING SYSTEM - TAPE I/O

IBM Application ... Syatema Programa Library Abstract

FIle Number

H:l~Q..SP-021

~

Purpose: This programming system assembles symbolic irultructions into
absolute machine lanquage. The source program, consisting of the symbolic
instructions, is read twice.

1620/1710 SPS, TAPE SYSTEM

Restrictions. Range: The system occupies memory from position 100 to 19999.
Equipment Specifications: The system is designed to operate on a basic 1620 with
tape I/O, and can be modified for the additional storage unit 1623.
(Continued on next page)

61

SPS is an extension of 1620 BPS. a symbolic programming system in use
since late 1960. It provides many additional features 'in the assembly of
source programs, and includes five sets of floating po.f.nt subroutines for
use on 1620 or 1710 systems of a variety of configurations. '!hese are:
a)

Fixed length floating point numbers not using the Automatic
Divide feature.

b)

FiXed length floating point numbers using the Automatic
Divide feature.

c)

Variable length floating point numbers not using the Automatic
Divide feature.

d)

Variable length floating point numbers using the Automatic
Divide feature.

e)

Variable length floating pamt numbers using the Automatic
Floating Point feature.

'Ihe range of floating point nwnbers is:
±.100000 ••• 0 x 10- 99 to

!. 99999 ... 9 x

1099

For variable length subroutines, the fractional part of the floating point
number may vary from 2 to 45 digits.
Use of Program
With the SPS processor loaded in fue storage, the source statements may be
entered on the typewriter or through the tape reader. In the first pass, the
statements are scanned, certain errors detected, and label table constructed.
In the second pass the source statements are again scarmed; additional
errors are indicatedj and the program assembled in machine language. A
condensed self-loading tape may be pWlched. Listing on the typewriter is
also possible. A map of storage assignments may be typed. If subroutines
are required. the proper subroutine tape will be processed and subroutines
selected for inclusion in the object program.
Machine Con!iouration
For assembly of source programs:
Basic tape 1620 or 1710 with 20,000 digits of storage. The processor can be
modUied for 40,000 or 60,000 digits of storage to allow an extension of the
label table.
For execution of assembled programs:
A 1620 or 1710 system with any optional features.

62

A - 1710

IBM Applic.atlon &. SYllhlm. Program. LlbTb.ry Ab.tract

rUe Nwnber 1710-81-002

IBM Applica.tion & Systems Programs Library Abstract

File Nwnber

1710-SP-00l

1710 SPS/709-7090 PROCESSOR

1710 Simulator/7090

Purpose:
ability to
(1)
(2)

The 7090 Simulator of the 1710 Control System provides the
perform program checkout:
Prior to the installation of a 1710 System.
Subsequent to the installation but without requiring that the 1710
be removed from its normal task of Data Acquisition, Operator
Guide or Closed Loop Control.
(3) Without requiring modification of a physical system to conform
to the program requirements, i.e., modifying a 1710 System
to have the proper function, and filter and matching cards, at
a given 1712 Multiplexer and Terminal Unit Address.

Machine Configuration:
For simulation of the 1710:
7090 with two tape channels (A & B)
4 tapes on channel A
2 tapes on channel B
32, 000 words of core storage
On line printer (SHARE II Board)
The simulator will simulate the following 1710 features:
(1) Random & Sequential Addressing
(2) Interrupt (AOCITAS CompletE: Indicator #40)
(3) Contact Sense (200 pt/sec)
(4) Contact Operate
(5) Analog Input (20 pt/sec)
(6) Analog Output (set point positioner)
(7) 300 M. T. U. Addresses
(8) 1711 Manual Entry Switches
(n) Process Branch Indicators
(10) Process Interrupt Indicators
(11) 1621-1624 (Paper Tape I/O)
(12) 1622 (Card I/O)
(13) Indirect Addressing
(14) Additional Instruction (TNF-TNS-MF)
(15) Divide
(16) 1623 Additional Core Storage 1 or 2 20,000 Digit Modules

The 709/7090 Processor provides the 1710 user with the abUity to assemble programs for a 1710 installation without removing the 1710'5 capability
to perform 1ts normal task of Data Acquisition, Operator Gulde or Closed Loop
Control. The processor provides the user with all of the features of the
1620/1710 SPS while increasing the assembly speed and the size of the programs
that may be assembled.
USE OF PROGRAM
With the SPS Processor loaded into storage under control of the IB SOS
Monitor the source statements are read from Tape A3. In the first pass, the
stateme~ts are scanned. certain errors detected, and the label table 1s constructed (capacity 3000 labels). The processor writes the scanned statement on
an intermediate tape (133) along with certain control information to be used during
the second pass.
Prior to the second pass of the source language (from tape B3) the
label table 1s examined to determine the number of entries. If there are more
than 35 entries, il binary search indices are built up by the processor and a
binary search is made when looking up labels during the second pass.
In the second pass, the statements arc read from the intennediate tape
(B3)c assembled, written on the punch output tape (A.S) (in the format speCified
in the control card for this assembly .. i. c. condensed card or paper tape format), and written on the print tape (A2).
At the end of Pass II if any subroutines were used, the processor selects
the subroutine-set speCified from the subroutine tape (B7) and assembles and
writes the output for listing (A2) and punching (11.5)0 At the end of Pass II, the
processor writes the resultant map of 1710 storage on the'printer tape. The
processor will repeat the assembly process until all source language programs
have been assembled.

MACHINE CONFIGURATION
For assembly of Source Programs:
709/7090 with two tape channels (A & B)
4 tope units per channel
32,000 words of core stGrage
on line printer
Por execution of assembled program:
A 1620 or 1710 System with either paper tape or card I/o and
those optional features required by the Source Languago Program,
such as the 1620 additional instructions or 1710 Random Addressing
Feature ..

63

A - 7070
IBM Application &r. SYlltemll Progra.znll Library Abstract

FUe Number

7070~AT-082

IBM Application'" Syutema Programs Library Abstract

PAT - PROCEDURE FOR AUTOMATIC TESTING

7070-AU-074

AUTOCODER 74

Purpose: The PAT System has been designed to standardize testing procedures
so that they may be just as efficient in a customer installation as they are in a
7070 Data Center with no change in test procedures.
The testing of a program by the PAT System is accomplished in three phases.
The first phase is the creation of the data files by the Tape File Generator program. The second phase is the processing of the object program. The third
is the recording of the results of the test through the use of Storage Print and
Tape Print programs.
PAT testing enables the processing of undebugged programs by remote testing
yet under programmer control. The results including the output from the
Utility programs would be returned to the programmer for desk debugging.
The PAT System provides for the testing of programs by card or tape processing.

IBM Application &r. Systemll Programs Library Abstract

FUe Number

FUe Number

7070-AT-083

Purpose: Autocoder 74 is a symbolic programming system designed to simplify
the preparation of programs for the 7070 Data Processing System. With the increased capacity and versatility of data processing systems, machine-language
instructions have increased correspondingly in both number and complexity.
Coding in machine language today is an extremely tedious and time-consuming
task. The 7070 Autocoder 74 is a symbolic programming system designed to
permit the programmer to code more easily and with greater meaning than is
possible with numerical machine language. Symbolic programming systems also
perform automatically many burdensome tasks such as assigning and keeping track
of storage locations and checking for errors. Use of these systems will save the
programmer a significant amount of valuable programming time and effort.
Autocoder 74 allows the use of IOCS macro-instructions.
Machine Reguirements: 4 tape units.

IBM Application at Syutems Programs Library Abstract

File Number 7070-AU-900

AUTOCODER 7070
7070 AUTO-TEST GENERATOR SYSTEM

The Auto-Test Generator System provides a highly Uexible and e!£ident method
of creating tapes for automatic tape testing.

~urpo~e: To translate a program written in the Autocoder language
mciuding ,macro st,atcmento and/or one-for_one instructions, into
an operatlve machIne language program.

The test tape ill created by the ATG System
l\.1achinc Req~irements: (Include machine components, special features,
storage requirements, control panels-standard or special)

in a one pails Heneration run.
The minimum system configuration required for a Generation RWl is a 7070

Minimum

~:
capacity of SKi one tape channel, and three tape drives.

If available. a capacity over

5,000 words of core storage

6 IBM 729 modelll, IV. V. VI, or 7330 tape units.
3.

Channel I or Channels 1 and Z.

!:

1.
Z.

IBM 7500 Card Reader
IBM 7550 Card Punch
IBM 7400 Printer
~:3~ot!;:r u:~:!tional IBM 729 model

5.

10,000 words of core storage

5K. "tape channels, 40 tape drives. the 7500 Card Reader, the 7501 Console Card Reader,
Optional
the 7550 Card Punch. and the 7400 On-Line Printer may also be ulled in generating the test
tape.

One control card (the ATG Control Card) and the settings of the Console Alteration

Switches specify the machine configuration to be used for the generation run.

(Utility Panel)
(Utility Panel)
(Utility Panel)
II, IV, V, VI, or

Testing may be performed with the generated tape on a system even more basic
than the minimum needed for generating the test tape or may be done on any combination
of the units mentioned above.

One control card for each object program packet (the TD Card)

specHies the machine configuration to be used for te8ting that object program.
The configuration of the system which generates the test tape does not have to be

Capabilities and Limitations:
Autocoder can process any program written for Basic Autocoder
or 4-Tape Autoc~der. II additional tape units are available, it can
process stacked lnput and/or output. Additional macro generators can
be a,d~e.d t~ the system to allow new input statements. There is great
~l:X.lblbty In entering new loads, patching existing loads, and dropping
a :i:~~:dr~:~dS. Only one macro generator can be added or dropped'in

the same as the configuration of the system which performs the testing.
IBM Application It Systems Programs Library Abstract
IBM Application &r. Syetema Programs Library Abstract

FUe Number

707Q..CB-923

rUe Number 707Q..AU-072
7070 COBOL PROCESSOR

7070 BASIC AUTOCODER
~:

The 7010 Basic Autocoder is a symbolic programming system designed
to simplify the preparation of programs for the 7070 Data ProceSSing
System. With the increased capacity and versatility of data processing
systems, maChine-language instructions have increased correspondingly
in both number and complexity. Coding in machine language today i.9
an extremely tedious and time-consuming task. The 1010 Basic Autocoder is a symbolic programming system designed to permit the
programmer to code more easily and with greater meaning than is
possible with numerical machine language. Symbolic programming
systems also perform automatically many burdensome tasks such
as assigning and keeping track of storage locations and checking for
errors. Use of these systems will save the programmer a Ilignificant
amount of valuable programming time and eHort.
The 7070 Basic Autocoder is designed specHkally for use in 7010
Data Processing installations which contain unit-record input/output
equipment only, or a maximum of one or two tape units.
This version includes the addition of the Execute Control Statement,
the ability to mix. condensed card output on the listing tape, the
assignment of relocation indicators, and the typing of the version
and level of the Basic Autocoder processor being used.

Purpose: The COBOL processor translates a source program
~n accordance with the rules specified in the IBM COBOL
General Information Manual, form FZ8-8053-l into a 7070 or
7074 machine - language program which, when read into the
computer, will execute the instructions specified in the source
progrse process control panel
2. A symboUc laTlguage for pre::rnring 305 programs
3. The assembly program which converts symbolic
programs into machine language programs.
Method:

N/A

Restrictions/Range:

N/A

Storage Requirements:

N/ A

Equipment Specifications: IBM 305 System - The assembly programs require
a basic 305 wiUl no special features but can be used to assemble program::; for a
broad range of 305 configurations.

IBM305

PROGRAM LIBRARY ABSTRACT

File Number 9.2.001

305 CUT & FILL
Author Unknown

Direct Inquiries to: Author Unknown
~:

To perform the calculations involved in the cut and fUl problem
of highway construction. It m~y be used to compute either
design volumes based on terrain cross sections or payload
volumes based on final !leld slope staking.

Method: Average end areas
RestrlcttonslRange: Dt.stances - 999.99 feet
Cut and fill volumes - 9,999, 999.9 cubic yards
Storage Requirements; Total accumulated cut and fills - 999,999,999
Equipment Speclftcations: 10 tracks of Dick File uses general Purpose
Control Panel
Additlonal Remarks: Timing - 45-70 seconds per station

73

B - 650

c) Not applicable.
FILE NUMBER

650 LIBRARY PROGRAM ABSTRACT

1. 1. 002
d) Uses most of 2,000 word drum. Can accommodate relocatable subroutines.
e) Reference should be made to original SOAP for details of prog-ram's capacity.
f) Minimum 650.

OPTIMIZING PROGRAM

July 15, 1£155

B. Gordon and A. Dalton
Equitable Life, New York

IBM 650 Library Program Abstracts

Fil~no., 1. l. 006
Utility Programs

STANOLINK II

a) Automatically assigns optimum locations to the instructions and data of a
program.

b) Does not apply.

C. E. Stevens
Standard Oil Company (Indiana)
Detroit, Michigan
Purpose: This is a symbolic optimal assembly system comparable to
SOAP II which uses numeric symbols. There are two 650 programs
included in the system. One edits the symbolic ·coding and punches error
cards for invalid conditions. The other assembles the symbolic coding into
a.n optimally coded absolute program.

c) Does not apply.
d) The program occupies approximately 500 storage locations in addition to
1216 locations for tables. Both input and output are one word per card.

b.

f)

Range:

D

July 27, 1956

with machine language programs.

~

For each instruction traced a card is punched with the location
of the instruction, the instruction itself, the contents of the distributor,
upper and lower accumulators, and the contents of the three indexing
registers. The location of the first instruction to be traced is set in the
storage entry switches. A SOAP II symbolic deck listing with a aample
absolute deck listing is included in the write-up.

f. 650 System: One 533 and indexing registers required.

b) . Does not apply.

Special Devices: Alphabetic device if SOAP II symbolic version is used.

c) Does not apply.
d) Storage required is 150 locations, 1800 to 1949 (or 0800 to 0949).
Tracing is at 100 card per minute.

IBM 650 IJbrary Program Abstracts
GENERAL TRACING

e) Traces any program that the computer. can execute. For each instruction
traced the following information is punched: card number, location of
instruction, the instruction, and contents of upper and lower accumulator
and distributor (before execution of the lnstruction). Entry to, exit from
and traCing of branch orders only is under control of console switches.
Designed for use wUh the general purpose control panel used by the Bell
Interpretive System, Technical Newsletter No. 11.

80

RO~TINE

J. W. Burgeson
IBM. Akron, Ohio
Purpose: This routine traces all instructions, or only those with a
minus sign.
b.

f) Minimum 650.

lillna. 1.4.0)0
Utility Programs

~:

Does not apply.

Accuracy: Does not apply.

B - 650
Floating/Fixed:

File ,zo. 1.5.00·1
Utility Programs

Does not apply.

IBM 650 Library Program Abstracts
c.
d.

Mathematical Method: Does not apply.
Storage Required: This program uses SO storage locations.
MULTIPLE PROGRAM DUMP AND LOADER
~:

Not given.

Relocatability: Relocatable.
Remarks: This program is very nearly identical with File Nwnber
1.4.005. The only difference is that the one deck (45 cards) can be
used for any band of 50 locations, excluding the 1950 band. The user
specifies the band to be used by means of the instruction address in the
console switches when reading in the program deck.
f.

G. M. Stace
Officc Methods &. Procedures
Owens-illinois Glass Co.
Tolcdo 1. Ohio
a. Purpose: These routincs write any number of programs on a single tapc.
Any l'cquired program can be reloaded onto the drul11 by means of a single
load card. A program may be added to the program tape without specifying
the last program number on the tape.

IBM 650 System: One 533 required.
b. Range: Docs not apply.

IBM 650 Library Program Abstracts

Fileno. 1.4. all
Utility Programs

Accuracy:

Does not apply.

Floating/Fixed: AU routines are fixed.
MODIFIED SYMBOLIC TRACING ROUTINE

c. Mathematical Method: Does not apply.

J. May
Hudson Laboratories
Columbia University
Dobbs Ferry, New York

d. Storage Required: The m.axirrmm storage requirement for any routine is
0000-0049 plus the first ten locations of lAS and a read band.

b.

Speed: Not given.

Purpose: This program is to be assembled by SOAP II, along with an
untested program, for use in tracing as a method of debugging. This
routine is a modification of "Symbolic T racing Routine, .' File Number
1.4.001.

e. Remarks: These routines will destroy instructions located in lAS and
indexing registe rs.

~:

£. 650 System: One 533, tape units and indexing registers are required.

Docs not apply.

Rcloeatability: Not given.

Special Devices: None.

Accuracy: Does not apply.
Floating/Fixed: Does not apply.
Mathematical Method:

:1.

Fileno. 1. 5. 006
Utility Programs

IBM 650 Library Program Abstracts

Does not apply.

Storage Required: This routine requires 57 storage locations, including
eight successive words of any punch band.
CROWN LIFE INSURANCE COMPANY SORTING PROGRAM
~:

T racing proceeds at the rate of 100 instructions per minute.

Relocatability: Not given.
Remarks: For each instruction traced, a card is punched with the location
~struction, the instruction itself, the contents of the distributor and
accumulators, and the contents of the indexing registers. The location of
the first instruction to be traced is set in the Storage Entry switches.
f.

IBM 650 System: One 533 and indexing registers.
Special Devices: Alphabetic device required.

IBM 650 Library Program Abstracts

Fileno. 1.5.003
Utility ProgralTIs

I. Ballantyne
Crown Life Insurance Company
Toronto, Ontario

a. Purpose: Program to sort ungrouped 650 tape records.

Record size and
position of the index in the record are located symbolically so that the
SOAP program may be assembled to sort any size record from one to fifty
words in length. The program retains the sequence of equal indice's from.
the input to the sorted output.

b. Range: Sorts on a single word index only. Program. has two phases.
Phase 1 block sorts thirty records and Phase II m.erges these blocks in
multiple passes to com.plete the sort.
Accuracy: Does not apply.
Floating/Fixed:

AUTOSET

M. F.

Does not apply.

c. Mathematical Method:

Row

Federal Bureau of Investigation
Washington 25, D. C.
a. Purpose: This progralTI will set tapes (either "read" or "write") to a
predetermined position. Can be used to set tapes to the position where a
partially completed job was halted on a previous run.
b. Range: Will preset one to six tapes.
Accuracy: Does not apply.

Docs not apply.

d. Storage Required: Requires bands 0450 to 1950 for the internal block
sorting in Phase I, and there arc seventy-seven free locations between
0000 and 0449.
Speed:

Not given.

Relocatability:

Not given.

e. Rctnarks: None.

f. 650 System: One 533, six 727 Magnetic Tape Units. and indexing registers
are required.

Floating/Fixed: Does not apply.
Special Devices: None.
c. MatheJnatical Method: Does not apply.
d. Storage Required: ProgramlTIed for locations 1950 - 1999.

IBM 650 Library Program Abstracts

File no. 1. 5. OU9
Utility Programs

Speed: Approximately that of tape reading.
Relocatability:

May be relocated to any band.

e. Remarks: Identification of predetermined position on tape may be a tape
mark, record number, or any word in a record Which is peculiar to that
specific record.
£. 650 System:

SORT II, DESCENDING
C. E. Perkins
J. R. Casalaspi
National Biscuit Com.pany
New York, New York

One 533, tape units, and indexing registers required.
Purpose: This routine sorts records in desconding order rather than

Special Devices: None.

ascending order.

(Continued on next page)

81

b,

Range:

Does not apply,

b) Does not apply.

Accuracy: Does not apply.

c) Does not apply.
Floating/Fixed:

Does not apply.

d) The deck contains 47 cards. Output is 100 cards per minute.

Mathematical Method: Does not apply.
d,

Storage Required:

Not given,

e) Self-loading. A trailer card placed at the end of the condensed deck makes
it self-transferring.

Speed: Not quite as well optimized as SORT II.
Relocatability: Not given.

f)

Remarks: The methods are covered in the SORT II Reference Manual
(form 328-0415). The !tHigh" and !tLow" exits of the original comparison
blocks have been interchanged.
f.

IBM 650 System: An IBM 650 system with

~our

Minimum 650.

1. 6. 009

FILE NUMBER

650 LIBRARY PROGRAM ABSTRACT

tape units.

ONE TO SEVEN CONVERTER
Special Devices: None.

3-20-1956

P. S. Herwitz
IBM, Washington
Filt"".

1.5. OIl

IBM G50 Library Program Abstracts

a) Converts Single-word load cards to seven-per-card load cards which may
be used with the seven-per-card loader, file number 1.2.002.
TAPE PROGRAM FINDER, WRITER, AND SALVAGE

bl Does not apply.
Mr. Charles Sampson
Kentucky Department of Highways
State Office Building
Frankfort, Kentucky

c) Does not apply.

a. Purpose: These programs are for the purpose of writing any program.(that
is in single or 7-per card) on tape, finding the program. after it is written
on tape and loading it on to the 650, and then transferring the program from.
one tape to another.
b. Restrictions, Range:

c. Method:

d) Storage required is 37 locations, 0000 to 0035 and 1950. In addition, 25
locations are used in the 1900 and 1950 bands for reading, punching, and
loading. Cards read at 200 per minute and punch at approximately 28 per
minute.
e) Loading routine not included in listing.

Does not apply.

Does not apply.

f)
d. Storage Requil'enlents: One band used for Finder Progranl, [our bands
used for each of the othel'. These bands are used m.om.entarily and there
is no need for relocation.
e. Remarks:

Minimum 650.

650 Library Program

ERRATA

~

File No. 1. 6. 009

Follow instructions submitted in write-up.

f. IBM 650 System:

"One to Seven Converter," by P. S. Herwitz

With [AS and tapes.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

1. 6. 006

In the one-page listing appended to the detailed write-up for 1. 6. 009, instruction
number 29 (location 0029) should read:

CLEAR BLOCK TO ZERO

instead of

3-30-56

S. Fleming
G. E., Schenectady

65

0028

0030

65

0028

0039

This is a typographical error in the preparation of the listing; the program deck
is not affected.
April 1958, Bulletin 18 - 37

a) Clears a specified block of storage to zero.
b) Does not apply.

650 LIBRARY PROGRAM ABSTRACT
c) Does not apply.

FILE NUMBER

1. 6. 011

SEVEN TO ONE CONVERTER

d) Storage required is 8 locations, 1951 - 1958.

e) Self-loading.
f)

P. S. Herwitz
IBM, Washington

The block limits are punched in the one card deck.

a) Converts seven-per-card load cards to single instruction load cards.

Minimum 650.

b) Does not apply.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

1. 6. 007
c} Does not apply.

FIVE-PER-CARD CONDENSING ROUTINE

G. E. Mitchell

1-1-56

d) Storage required is 8 locations 1961 to 1967 and 1986. The 1950 band is
used for a read area, punch area, and self-loading routine. Cards are
punched at 100 per minute.

IBM, Houston
e) Self-loading.

a) Condenses a ooe-word-per-card deck to a five-word-per-card deck and
places a loading routine, file number L 2. 003, ahead of the condensed deck.
(Continued on next column)

82

f)

Minimum 650

B - 650

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

1.6.012

d) Storage required including tables is approximately 220 locations.
is approximately 100 cards per minute.

Timing

e) It is assumed that errors detectable by SOAP I have been corrected and
that rclocatable addresses are in the range 0000 - 1999. Only the first ten
columns of the remarks field will be retained. A SOAP II symbolic deck list_
ing and a Iour-per-card absolute deck listing are included.

A PROCEDURE FOR USING SOAP WITH A NUMERIC 650

Jack N. Graham
USAF. Directorate of Intelligence
Mathematical Analysis Branch
WaShington, D. C,

I)

al Enables SOAP to be used with a minimum 650 provided a. 407 with summary
punch is available.

Alphabetic device is necessary.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

1. 6.017

b) Does not apply.

c) Does not apply.

AN INTERPRETIVE OPERATION FOR THE CONVERSION OF NUMBERS
FROM FIXED POINT REPRESENTATION TO FLOATING POINT
REPRESENTATION AND VICE VERSA

d) Approximately 850 storage locations are required.
e) A SOAP deck is partially converted to 650 alphabetic code using the 407
and summary punch. This routine completes the conversion at which time
the regular SOAP program performs the assembly. No special characters

may be used for any part of symbolic addresses,
£)

R. W. Klopfenstein
RCA Laboratories
Princeton, New Jersey

Minimum 650 and 407 with summary punch.

a) Designed as an adjunct to the interpretive system developed at Bell Telephone
Laboratories and described in IBM Technical Newsletter No. 11.
650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

1,6.014

b) Floats a fixed point number or fixes a floating point number. Rounds in the
last place in both floating and fixing.

SOAP TO SEVEN

James D. Chappell
IBM, Washington

December 31, 1956

c) Not applicable.
d) Programmed for locations 001-049. (Note: Interpretive system proper occupies
locations 1000-1999).

a) WUl convert single instruction load cards to seven-per-card load cards.
SOAP output cards may be converted immediately without removing special
type cards. Only those locations from the FWA to the LWA are punched with
the further provision that no output card shall begin with an unused location.
b) Does not apply.

Relocatable to any 49 consecutive locations in lower memory (excepting 0000) by
means of the Bell Telephone Laboratories translation routine. Preferably relocated
by multiples of 50 locations.
e) Programmed stop with 8888 in the address lights occurs if an overflow would

c) Does not apply.

result upon fixing a given floating point number.

d) Uses entire 1950 band.
speed.

Running time is approximately read and punch

e) The 1. 2. 002 loader is punched along with the 1. 6. 001 stop number routine
prior to punching the converted program deck. A 1. 2. 002 transfer card is the
last card punched. No single instruction load cards can be processed for loading into the area used by the 1.2.002 loader.
f)

Running Time: Approximately 60 milliseconds.

f) Minimum 650.

650 LIBRARY PROGRAM ABSTRACT

Minimum 650.

Fileno. 1.6.014
ERRATA

"SOAP to Seven," by J. D. Chappell
Under INPUT on page laC the write-up, the statement should read as follows:
I

1. 6.020

INTERPRETIVE FLOATING DECIMAL ROUTINE

IBM 650 Library Program

•

FILE NUMBER

the location in columns Z3-2.6, and the word to be loaded in columns

31-40."

R. R. Haefner
E. 1. du Pont de Nemours & Co., Inc.
Savannah River Laboratory
Aiken, South Carolina
a) This routine is a modification of the Trimble interpretive floating decimn.l
system described in roM Technical Newsletter No.8. It is designed for the 650
installation equipped with the automatic floating decimal device to provide a
compromise between rewriting infrequently used programs which incorporate the
Trimble routine and inefficient machine utilization while running such programs.
b) Floating arithmetic.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

1. 6. 016
c) Modification of methods in Trimble routine.

SOAP 1 TO SOAP II TRANSLATOR

S. Poley
IBM, New York

d) Uses 243 storage locations in a block of 390 locations. The routine is 75%
faster than the Trimble routine with no recoding required.
December 1, 1956

e) None
a) Translates symbolic carda prepared for SOAP I into symbolic cards acceptable to SOAP II.

f) 650 with automatic floating decimal device.

b) Does not apply.
c) Does not apply.

(Continued on next column)

April 1958, Bulletin 18 - 11

83

Clear Drum and lAS to Minus Zeros
Dump lAS and Drum onto Tape
Load lAS and Drum from Tape
Print lAS and/or Drum
Universal Tape Print
Dete rmine Footage of a Reel of Tape
"SNIP" ~ Measure Off Predetermined E;ootage of Tape

Fileno. 1.6.021
Utility Programs

IBM 650 Library Program Abstracts

DAYS BETWEEN DATES

R. Strauss
IBM, Jacksonville, Florida

h. Range: Does not apply.
Accuracy: Does not apply.

a. Purpose: Subroutine to determine the number of days between two dates.

Floating/Fixed: Does not apply.

b. Range: Up to the limit of the upper accumulator.

c. Mathematical Method: Does not apply.

Accuracy: Inaccurate one day for each leap year.
Floating/Fixed:

d. Storage Required: Varies from eight locations to twenty-four depending
upon routine used.

Computation is in fixed point.

c. Mathel1latical Method: Does not apply.

Speed: Varies depending upon routine and job to be done.

d, Storage Required: 69 words plus 10 words for each time the subroutine is
used in the program.

Relocatability: Not in relocatable form.

Speed: Variable.

e. Remarks: None.

Relocatability: Not gi yen.

f. IBM 650 System: Most of these routines reqUire one 533 and indexing
registers in addition to the eqUipment specified in the title~

e. Remarks: The earliest date must be used as the first date and the most
current date as the last date. The date must be six digits and read into the
650 in year, month, and day order. To compute the days between dates in
different centuries, the dates must be eight digits and read in the 650 in
century, year, month, and day order.
f. 650 System:

Special Devices: None.

IBM 650 Library Program Abstracts

One 533 required.

Filtno. 1.6.025
Utility Programs

Special Devices: None.
RELOCON
Filtno. 1.6.022
Utility Program.s

IBM 650 Library Program Abstracts

E. D. Mounts
National Homes Acceptance Corp.
Lafayette, Indiana
Purpose: This prograrn converts single_instruction load cards to four~per_
card load cards where other than the 1950 band is used for read-in and
relocates the "Four-Per-Card Loader," File Number 1.2.001, automatically.
It will also convert the 1950 band.

FIVE-PER-CARD CONDENSll'lG ROUTINE

J. H. Cooper
R. P. Fraser
T. H. Green
Shell Oil Company
P. O. Box 2527
Houston I, Texas
a. Purpose:
~

b.

Range:

Does not apply.

Accuracy; Does not apply.
Floating/Fixed; Does not apply.

Condenses one-per-card instructions of either SOAP I or SOAP

Mathematical Method:

b. Range: Does not apply.

d.

Accuracy: Does not apply.
Floating/Fixed: Does not apply.

Does not apply.

Storage Required: The program uses 170 storage locations from location
1800 to location 1999, excluding the read-in locations 1951 to 1960, punch
locations 1977 to 1986, the self-loader locations 1995 to 1999. and the
trailer load card location.
Speed: The input speed is ZOO cards per rninute and the output is approximately 50 cards per minute.

c. Mathernatical Method: Does not apply.
d. Storage Required: About 400 drurn locations are required for program.
and storage.

Relocatability; Does not apply.
Rernarks: All routines to be converted must reserve locations 45, 46, 47,
48, and 49 (or their equivalents) in the desired read_in band, for self-loader
instructions. The routine could be easily altered for other locations. Output
is complete and ready for subsequent loading. It is assUIned that any
program being converted has been used and proved in single instruction load
card form. SOAP o.utput decks may be used without disturbing their sequence.
The relocated self-loader is pWlched out in front of the output deck.

Speed: Card reader operates at maxim.urn speed.
RelocatCiLbility: Not given.
e. Rernarks: The entire drurn is available to object program since object
~instructions, which overlay locations used by the 5/card loader,
are autornatically saved until last and punched in self-loading 2/card form..
The condensed cards are counted when punched and this count is punched
in the last card,thus each time the condensed deck is loaded the count is
cornpared with the original count.

f.

IBM 650 Systern: One 533 required.

IBM 650 Library Program Abstracts

f. 650 System: One 533 required.

Filt no. 1. 6. 026
Utility Programs

Special Devices: None.
LOAD DECK GENERATOR

IBM 650 Library Program Abstracts

Fileno. 1.6.023
Utility Programs

MISCELLANEOUS UTILITY ROUTINES
a. Purpose: Six of the seven short utility routines originally published in
IBM 650 Bulletin 12 and three contributed routines of a sirnilar nature have
been assem.b1ed to provide a convenient "package" for installations with an
expanded IBM 650 systern. The routil).eS included are:
Clear Drurn to Zeros between Limits
Clear lAS to Zeros between Limits

84

(Continued on next column)

C. E. Stevens
Standard Oil Company (Indiana)
Detroit, Michigan
Purpose: This program produces a seven-per-card load deck preceded by
a zero clearing routine and a seven-per-card loading routine, for any band
of the drum. The program to be punched ll"lUst first be loaded on the drum.
The Load Deck Generator generates the necessary variable instructions so
that the zero clearing routine and the seven-per-card loading routine will
read into any band specified by the progranuner. Many zero locations are
not punched, thus reducing the multiple-instruction-per-card deck to
minimum size.
(Continued on next pagel

B - 650
b.

Range:

Docs not apply.

Accuracy:

re-entry and restarted at the point of interruption. A program being debugged and beset with anomalies may be dumped and listed for inspection.
A debugged ready-to_operate program may be condensed for permanent
use, without reserving any special area on the drum for the condensing
routine itself. The dump program is read into any single available read
band of ten words, and docs not disturb any other locations.

Does not apply.

Floating/Fixed:

Does not apply.

Mathematical Method: Docs not apply.

b.
d.

Storage Requircd: There are two sections to the subject program. The
Hrst section is read into the last band and punches seven words per card
for locations 0000-1950. The second section, if used, requires a second
loading of the program to be puncht:d. This section is read into the first
two bands and punches two instructions per card for locations 1951-1999.

Range:

Docs not apply.

Accuracy:

Docs not apply.

Floating/Fixed:

Docs not apply.

Mathematical Method:
Speed: Punching speed for both sections of the program is 100 cards per
ntinute. Loading speed of the seven~pcr_card deck output is 200 cards per
ntinute.

d.

Storage Required:

Does not apply.

Any read band - ten words.

Speed: Not given.
Relocatability:

Not given.
Relocatability: Relocatable.

Remarks: This program is self-zero clearing with self-loading output.
f.

Rerrlarks: If operating program is stopped following division without reset
(14), the upper accumulator will be restored with the sign of the lower. If
invalid information (blank bits, etc.) is present on the drum, special steps
may be taken.

IBM 650 Systent: One 533 required.

Filtno.
1. 6.02.7
Utility Programs

IBM 650 Library Program Abstracts

f.

IBM 650 System: One 533 required.

STOP NUMBER DRUM AND lAS

IBM 650 Library Program Abstracts

J. B. Reid
Trans-Canada Air Lines
Montreal Airport
Quebec, Canada

CDCSB

Purposc: This progrant loads all drwn locations (except 1951-1960)
and IAS locations with: 01 aaaa 8888, whcre aaaa is the address of the
location.
b.

Range:

D. A. DIEsopo
P. H. Butterfield
Stanford Research Institute
Menlo Park, California

Does not apply.

Purpose: This program permits the use of the command diffen:nce method
of address modification in the SOAP language. This command difference
coding technique can save initialization and modification instructions when
it is used on a series of variable commands which have a conunon
modification increment and which are m.odified as a group.

Accuracy: Does not apply.
Floating/Fixed: Does not apply.
Mathematical Method:
d.

Does not apply.

b.

Storage Required: Storage locations 1951-1960 and IAS locations 9000-9007.

Does not apply.
Does not apply.

Floating/Fixed:

Relocatability: Not given.

f.

Range:

Accuracy:

Speed: Total of 5.7 seconds for drwn and !AS loading with stop codes.

~:

File no.
1. 6. 029
Utility Programs

Does not apply.

Mathematical Method:

None.

d.

IBM 650 Systcm: One 533, IAS, and indexing registers.

Does not apply.

Storage Required: This program requires 23 storage locations plus that
needed for parameters.
Speed: Not given.

Flit no.

IBM 650 Library Program Abstracts

1.6.027
Errata

Relocatability:

Not given.

Remarks: The 23-card symbolic deck can be punched from the listing
included in the write_up.
"Stop Number Drum and lAS" by J. B. Reid

f.

IBM 650 System.: One 533 required.
Special Devices: Alphabetic device required.

The following corrections have been submitted for the abstract for the above program
published in Distribution No. 43 of IBM Library Program Abstracts:
In paragraph (a) delete lI(except 1951-1960)".

IBM 650 Library Program Abstracts

In paragraph (d) Storage Required. should read "Does not apply."
Reloeatability should read HDoes not apply. "

ON-LINE STORAGE DUMP

FiltnD.l.6.030
Utibty Programs

H.R. Vandenburgh
Fileno. 1.6.028
Utility PrograITls

IBM 650 Library Program Abstracts

Princeton University
Princeton. New Jersey
Purpose: This program causes a pr~nt-out of the contents of the lndexing
registers, distributor, accumulators, and drum storage.

UNIVERSAL MEMORY DUMP AND CONDENSING ROUTINE
B. M. Taylor, Jr.
North Carolina State College
Raleigh, North Carolina

b.

Range:

Does not apply.

Accuracy:

Purpose: This program dumps entire contents of druITl, accumulator, and
~tor as a numbered, self-reloading, self-starting, condensed
re-entry deck of not more than 360 cards. Any operating program may be
interrupted and dumped at any point; reloading the output automatically
restarts the operating program at the point of interruption. An operating
program beset with a validity error may be dumped and repaired for

Does not apply.

Floating/Fixed: Does not apply.
Mathematical Method:
d.

Storage ReqUlred:
Speed: Not given.

(Continued on next column)

Does not apply.

Locations 1951-1960, 8001-8003, and 8005-8007.
(Continued on next page)

85

Relocatability:

Mathematical Method: Does not apply.

Not given.

The labeled contents of 1951-1960 and 1963-1972 are meaningless.

Remarks:

d,

IBM 650 System: One 533, indexing registers, and an on-line 407 are
required.

£.

Storage Required: The last band is used by the program to handle locations
0000-1950, and the first two hands to handle 1951-1999.
Speed: PUnching of the condensed deck proceeds at the rate of 100 cards per
minute; loading of the output is at the ~ate ot 200 cards per minute,

Special Devices: None required.
Remarks: The program is self-zero-clearing, self-loading and self-checking.

Fileno,

IBM 650 Library Program Abstracts

1.6.031

f.

IBM 650 System: One 533 required.

Utility Programs
Special Devices: None required.

MATRIX TRANSLATION A/D TRANSPOSITION
R. L, Freeman
Portsmouth Naval Shipyard
Portsmouth, New Hampshire

IBM 650 Library Program Abstracts

Purpose: This program is designed to separate, translate, or transpose
matrices. The matrix to be manipulated may be stored on the drum or in
a form to be loaded by the standard four-per-card loader or the n_per_
card loader (IBM 650 Library Programs number 1. 2. 001 or 1. 2. 002). The
repositiolled makix is stored in cards in a form to be reloaded by the nper-card loader. This program is written to prepare data output of one
routine in forms suitable for uses in other routines.
b.

Range:

G. J. Porter
Project Matterhorn
Princeton, New Jersey

Purpose: This program converts subroutines written in relocatable SOAP II into
normal SOAP n by maldng the relocatable addresses into regional addresses.
These subroutines are acceptable to either 650 FORTRAN or FOR TRANSrr •

Does not apply.

Floating/Fixed:

b.

Does not apply.

Mathematical Method:
d.

RELOCATABLE TO REGIONAL SOAP II

Does not apply.

Accuracy:

Does not apply.

Speed: Governed by the input_output speeds.

Floating/Fixed: Does not apply.
Mathematical Method: Does not apply.
d,

Relocatability; Relocatable by modifying type cards and re-assembling.
The following restrictions apply:

Relocatability: Not given.
Remarks: Requires minor modifications to SOAP II board.

=

f.

q = num.ber of words per card output
n = number of columns of input matrix

=

IBM 650 System: One 533 required.
Special Devices: For SOAP version of the deck, the alphabetic device is
requlTed; however, for the condensed deck, the alphabetic device is not
required.

IBM 650 Library Program Abstracts

Fileno. 1. 6. OB
Utility Programs

SELF-CHECKING LOAD DECK GENERATOR

IBM 650 Library Program Abstracts

ERL GENERAL UTILITY PROGRAM

Purpose: This program was designed to faciUtate the comparison and assimilation
of sete of data output from mathematical programs, It is useful for the interpretation of output data and the preparation of data for plotting by hand or machine.
For sets of data in B words-per-card format, by means of control cards, it can be
used for conversion between number systems, finding the range of data. conversion
to logarithms to the base 10, normalization of data, and rearrangement of output
carel formats.

Purpose: With the 650 doing all the work, this program will produce, for
any read area of the drum, a condensed load deck consisting of the following
sections:
1.
2,

3.
4.

5,
6,
7.

b.

Drum zeroing routine
Seven-per-card, self-checking load routine
Seven instructions per card, 0000-1950
Self-checking card, 0000-1950
Load routine erasing card
Two instructions per card, 1951-1999
Self-checking card, 1951-1999

Floating/Fixed: Either floating or fixed decimal input and outplt may be utilized.
Mathematical Method: Not given.
d.

Relocatability: Not relocatable,

Does not apply.

Remarks: All auxiliary routines used are included in the seven-per-card listings
and program decks.

Does not apply.

Floating/Fixed:

Storage Required: The entire drum is used.
Speed: Part It the rangefinder. runs 4 secO'nds per data card input. when all "8
words of the data card are processed. Part 2 runs 3.5 seconds per data card
input, for processing of 8 words.

U loading stops with 01 2345 6789 in the program register, something is
wrong with the load deck; cards are missing, or have been added or altered.

Accuracy:

Range: Not given.
Accuracy: Not given.

Many zero locations are bypassed in producing the seven-per-card and two~
per-card sections, reducing the size of the load deck. The entire output is
loaded in the same order as punched with one console setting.

Range:

File no.
1.6. 035
Utlltty Programs

Judy Psygoda
Electronics Research Laboratories
New York, New York

C. E. Stevens
Standard Oil Company (Indiana)
Detroit, Michigan

f.

Does not apply.
(Continued on next column)

86

IBM 650 System: One 533 required.
SpeCial Devices: Alphabetic device required.

m
number of rows of input matrix
0:: = code; 8 means non-transpose; 9 means transpose matrix

b.

Storage Required: The program including the loader occupies locations 1800-1999.
Speed: Not given,

when ex: = 8, q::; 6 ::; n
when 0:: 9, q::;6sm

£.

Range: Does not apply.

Accuracy: Does not apply.

Storage Required: The program and subroutines use all the drum storage
locations,

Remarks:

File no.
1. 6. 034
Utility Programs

IBM 650 System: One 533 required.

B - 650
File no.

IBM 650 Library Program Ab.tract.

used with systems (e. g. RAM:AC). They are useful both as program error-dctection
aids and utility programs. The routines included, and the LADPAC number for
each are:

1. 6, 036

utility Programs

Number
MATRIX PACKAGE

~

V. Kahan
w.n. Thorpe
V. Sears
v. SoolB
L. S. Green
Computation Centre, University of Toronto

1215
1232
1251
1252
1261
1262
1272
1281
1282

Toronto, Canada
Purposo: The matrix package is an interpretive system designed to reduce a

sequence of matrix operations to a sequence of pseudo-instructions.
b.

Range: Maximum size of matrices handled is 37 rows X 50 columns.

Accuracy: Dependent on matrices being processed by matrix operation.
Floating/Fixed: Both can be used.
Mathematical Method: The inversion subroutine uses Jordan's Elimination Method.
d.

storage Required: Dependent on size of matrices used.
Speed: Not given.
Relocatability: Not given.

Remarks: Tbe package cont.a.inll the following operations:
Input
39 Multiplication
OJtput
20 Transpose multiplications
Fixed point output
33 Add Transpose
Fixed to floating
35 Column augmentation

70
71
90
99
32
22
34
f.

Linear combination
Transfer
Inversion

36 Row augmentation
37 Partition
78 Checkswn output

IBM 650 System: Tape system consisting of one 533, indexing registers, one 727
magnetic tape unit.

1312
1313
1317
1332
1337
1352
1356
1362
1372
1391
1392
1393
1394
1395
1401
1402
1403

1411
1412
1413
1421

Number
~
1733
1777

Routine
LADPAC SOAP
Library Checkmate
Standard 3/ ed Loader
5/ed Loader (high)
5/ed Sequencing loader (high)
6/cd Loader (high)
6/cd Sequencing Loader (high)
7/ed Sequencing Loader (high)
l/ed Translating Loader (high)
l/ed Sequencing Translating
Loader (high)
l/ed Punchout (high)
l/ed Punchout (core)
l/ed Punchout (low)
3/cd Punchout (high)
3/ ed Punchout (low)
S/ed Punchout (high)
5/ed PUnchout (low)
6/ed Punchout (high)
7/ed Punchout (high)
Drum Print
Band Print (high)
Core Print
Band Print (low)
Band Print (core)
Basic Punch Trace (low)
Basic Punch Trace (high)
Basic Punch Trace (rclocatable)
Basic Print Trace (low)
I. R. Print Trace (low)
Set Format Trace (low)
Basic Print Trace (high)

Routine
Selective RAMAC Zero
Selective RAMAC Change
Memory and Arithmetic Units
to RAMAC

File no.
1. 6, 038
Utility Programs

IBM 650 Library Program Ab.tracts

b.

Number

Routine

~

I. R. Print Trace (high)

1423
1431
1432
1433
1442
1452
1472
1485
1495
1496
1541
1551
1552
1553
1561
1571

Set Format Trace (high)
Basic Print Trace (reloclltable)
1. R. Print Tracc (relocatablc)
Load Card Trace (high)
I. R. Punch Trace (low)
I. R. Punch Trace (high)
I. R. Print Punch Trace (core)
1. R. Trace to Tape (high)
Snapshot Print Trace (high)
Snapshot Print Trace (high)
Copy Tape
Mcmory to Tape
Tape to Memory
Read Check Tape
Tape to Printer
Memory and Arithmetic Units
to Tape
Reeall Memory and Arithmeti
Units from Tape
Clear Memory to Zero
Set Memory to St0p Codes
Partial Drum Clear
Drum Clear to Zero
Set Drum to Stop Codes
Clcar Drum Between Limits
Drum Search
Zero RAMAC Betwecn Limits
Zero Disk File
RAMAC to Tape
Tape to RAMAC
Selective RAMAC Print

1582
1651
1652
1654
1655
1656
1658
1666
1701
1702
1711
1712
1731

Number
~
1841
1842
1892

Routine
Recall Memory and Arithmetic
Units from RAMAC
Tape Quality Preparation'
Tape Quality Analrsis
Deck Numbering Routine

Range: Does not apply.
Accuracy: Does not apply.

650 FORTRAN SYMBOL EQurvALENCE TABLE
Floating/Fixed: See the program writeup.
W. M. Compton
Arabian American on Company
New York 22, N. Y.

Mathematical Method: Does not apply.
d.

a.

b.

Purpose: This program automatically prepares SOAP II IOEQU It cards defining the
storage locations of each non-subscripted variable and the location of the first 650
instruction compiled for each statement in a 650 FORTRAN source program. This
symbol table aids in program error-detection operations.

Relocatability: Some routines are relocatable.
Remarks: All rOutines have been tested and put to use at the Los Angeles Data
ProceSSing Center. In addition to the routines, an extensive commentary is
included to fully explain the standard procedures employed. A trace table is included to assist the customer in choosing the proper trace. Descriptions in detail
of the LADPAC Utility Read/Punch panel (largely 80-80) and the LAD PAC 407 Online Print panel are included. Most routines will operate with only a load hub
wired to column 1, or with a ten word print panel. Standard card formats are
described. Floating point mathematical routines for the basic functions are included in both SOAP relocatable and SOAP symbolic. An explanation of the numbering system used in identification of these routines is included, together with symbolic
and absolute listings.

Range: Does not apply.
Accuracy: Does not apply.
Floating/FLxed: Does not apply.
Mathematical Method: Does not apply.

d.

Storage Required: Not given.
Speed: Symbol table pUnched at the rate of 100 symbols per minute.

Punchout routines always include, as the first cards of the outJX,lt, a routine to
load that deck. T!rls loader will operate from the same storage locations as the
punchout. Most of the punchout and loader routines are written for the basic machine.

Relocatability: Not given.
Remarks: None.
f.

storage Required: See the program writeup. Some routines operate from core.
Speed: See the program writeup.

f.

IBM 650 System: One 533 and indexing registers.

IBM 650 System: One 533 required.

Special Devices: Group 11 special character device required.

IBM 650 Library Program Ab.tract.

Fileno.
1.6.039
Utility Programs

IBM 650 Library Program Ab.lracts

1.6.040
utility Programs

File no.

FOR TRANSIT SUBROUTINE PACKAGE
LADPAC UTILITY ROUTINES
C, W. Zahler
United states steel Corporation
Pittsburgh. PennsylVania

Los Angeles Data Processing Center
Los Angeles. California
a.

Purpose: These programs are a compatible set of utility routines for many dIfferent
configurations of 650 systems. They use standard console settings throughout. The
routines range from those useful with basic machines through those wbich may be
(Continued on next co1unm)

W. J. Lee
IBM Corporation
Pittsburgh. Pennsylvania

(Continued on next page)

87

a.

Purpose: This package includes subroutines for ABSF, COSF, SINF. ATANF.
SQRTF, EXPF, LGNF, ANTLF, CLOGF.

b.

Range: Maximum.

Relocatability: SWCHF is written in SOAP II and is used' in symbolic
form during 650 FORTRAN PASS II assembly. Available tocations
are assigned by the FORTRAN PASS II deck, and may be anywhere on
the drum.
•
e. Remarks: The subroutine uses the rightmost three Storage Entry
~ on the 650 console to timulate sense switches, and control
progratn branching.

Accuracy: Maximum.

Floating/Fixed: Floating decimal arithmetic is used.
f. IBM 650 System: Same as needed for·6S0 FORTRAN.

c.

Mathematical Method: standard iterative teclmiques are employed.

d.

Storage RequIred: Not given.

Fil,,,,,.

1.6.0-43

IBM 650 IJbrary Program Abstracts

Speed: Not given.

Relocatability: Not given.

UTILITY SUBROUTINES

Remarks: All subroutines are in 5/card format.
f.

IBM 650 System: One 533 required.

IBM 650 Library Program Abstract.

Filt"o.

1.6.041

George Radin
Daniel Salkoff
New York University College of Engineering
University Heights
New York, N. Y.

a. Purpose: The package has the advantage of offering a system with
uniform linkage, 4-character local addresses, "and index-register
preserving routines.
AUTOMATIC PERSONAL IDENTIFICATION CODE
(AUTO PIC)

Routines included:

1. Float X
2. Fix: X

3.rx

Jack Melnick
IBM - Trenton
l15 West State Street
Trenton 8, New Jersey

4. Arctan X

5. Ln/xl
Ex:p X,

6.
7.
8.
9.

a. Purpose: To numerically code alphabetic names of individuals and
assign unique identifying data to each individual.

lOX, Sinh X, Cosh X
Sin X, Cos X
n-Pt GausBain Integral
Gamma X

b. Restrictions, Range:
c. Method:

b. Range: Not applicable.
Accuracy: Expected accuracy of 85-95'10 alphabetic sequence with an
expectancy of .01-.02% duplications.

FlOAting decimal.

Docs not apply.

d. Storage Requirements:

Does not apply.

e. Remarks: Does not apply.
f. IBM 650 System: 650 with Floating Decimal and Index Register.

c. Mathematical Method: Not applicable.
d. Storage Required: 1727 words for tables; l67 words for program,
constants, and input-output areas; 6 words available.
~:

Filen". I. 6. 044

IBM 650 IJbrary Program Abstracts

100 cards per tninute.

Relocatability: Non-relocatable.

GOUTY II A

e. Remarks: Limits of tables: 768 first namesi 9590 last names broken
into 10 phases of 959 words each.
f. 650 System: Minimum 650 with alphabetic device.

Fi[~no.

1.6.042

A. Wachowski
J. L. Overbey
Research Department
Automatic Electric Laboratories, Inc.
-400 North Wolf Row
Northlake, Illinois

IBM 650 IJbrary Program Abstracts
Purpose: This program with associated 533 and 407 control panels form
a unified system of programmed input and output both in numeric and
alphabetic form for the scientific use of the IBM 650.
SWCHF SUBROUTINE FOR 650 FORTRAN

b. Range, Accuracy, Floating/Fixed: Not applicable.
Mathematical Method: Not applicable
d. Storage Required: 177 locations.

David L. Grobstein
Concepts and Applications Laboratory
Pica tinny Arsenal
Dover, New Jersey

Speed:

Maximum read and punch speed.

Relocatability: Not relocatable.
~: The 533 Control Panel may also be used as a General Utility
Board with 80-80 Read and Punch, as Load or Non-Load cards.

f.

a. Pt:trpose: This subroutine makes available to 6s0 FORTRAN a
statement resembling the IF (SENSE SWITCH i) n l , n instruction
available in 704-709 FORTRAN.
2

Equipment Specifications: 650 with Alphabetic Device and an off-line
407 accounting machine.
FilUl". 1. 6. 0-45

b.~:

Docs not apply.

IBM 650 IJbrary Program Abstracts

Accuracy: Docs not apply.
Floating /Fixed: Doe s not apply

AUTOMA TIC SOAP CONVERSION UTILITY PROGRAM IASCUP)

c. Mathematical Method: Does not apply.
d. Storage Required:
S~

2.8 drum locations

Varies from 10 to 60 milliseconds depending on the degree
of optimization.
(Continued on next ~olumn)

88

T/Sgt. Robert D. Drury
5755 Hickam Drive
Dayton 31, Ohio
(Continued on next page)

B - 650
a. Purpose: A program to translate routines written in post-SOAP (one-word
per card), four-worl! per card, five-word per card (6-10 iormat), and sevenword per card Into SOAP rclocatable (type Z) farm.

a. Purpollc:
Program automatically converts sequentially coded 650
progralTllI to Soap ItA Input for optimization.
h, Restrictions, Range:

Docs nat apply.
h. Restrictions, Range:

c.

~

Docs not apply.

Does not apply.

c, Method:

Doell not apply.

d. Storage Requirements: Load deck contains 164 cards - 100 card per minute output.
c.

~

Program must be reloaded for each program being converted.

f. IBM 6S0 System:

Alphabetic device necessary_

d. Storagc Requirements: The program occupies locations 0000 through 1036
inclusive. Program speed is punch limited.
<:,

File no. 1. b. 046

IBM 650 Library Program Abstracts

Remarks: The fivc·woJ;'d per card (6-10 form;J.t) routines arc always
translated correctly and every address referred to, but not used as a
location, will be reserved when assembling. Other formats rcquirc hand
checking in order to ascertain that they have been treated as intended.
U it is desired, a group of constants may be held fixed by preceding them
with a load card containing all nines in the Ii rat word.

BLOCK CORRELATION - CORl.

A post-SOAP and seven word per card listing is Included.

Numerical Computation Laboratot'y
Ohio State University Research Center

f. IBM 650 System:

Minirm.lm 6S0 equipped with alphabetic device.

Columbul lZ, Ohio
~

CORZ will produce all the correlation a for a block of variable.
which are to be correlated with themaelves or with another block of
variablea. Reaulta include sumB, sums of .quares, sums of croaaproducta.
meana, atandard deviation, variance, covariance, correlation coefficient.
and ita aq.uare.

a.

b.~:

Not given.

~

filt"0.1.6.049

F[RSrn.

Not given.

Floating {Fixed: Fixed point data (aee write-up for varloua data (orma).
c. Mathematical Method: COR Z uses the following formula in the computationa.
N

ILXlX,) -iX,) ILX')

Fred G. Gro ss
IBM - Los Angeles
3424 Wilshire Blvd.
Beverly Hills, Cattlornia

a. Purpose:

'12= ~ IIx/) -0/ .iN fx,'> - 0/

To aimulate index registers on a basic 650.

b. Restrictions, Range:
c. Method:

d. Storage Requirements: Permanent locations: 0000 and 1067 thru 1999.
Unu.ed locations: 1995, 1996, 1998. Reeerved for sume: 0001 thru 1066.
~:

IBM 650 Library Program Abstracts

Fixed decimal.

Doe! not apply.

d. Storage ReqUirements: Approximately 300 locations are required.
varies with type of problem run.

Speed

Time req.uired (or accumulation of Sumll ill approximately (in minutes)

~

(Z.5a

+

b)c where a

=number of variables.

b:: number

of correlations, c:: number of observations.

e. Remarks: Trace is included.
f. IBM 650 System:

Minimum 650.

Correlation requires approxima.tely (in seconds): 1.5n, where
n b number of correlations.
Relocatability: Not re1ocatable.
e.

Remark.: COR hal attached to the front of the 7/card deck the loading
by ffie program.
.

r~d

f. 650 SYDtem:

Fil~"o.

1.6.050

IBM 650 Library Program Abstracts

Bade 650; no special equipment necessary.
FLOATING POINT AND INDEXING REGISTER SIMULATOR WITH TRACE
(FIRST)
filuo.

IBM 650 Library Program Abstracts

1. 6. 047

SHIFF

Peter W. Pakcltis
Computing Center
Northwestern University
Evanston, lllinoi$
a. Purpose: To make available to programmers of the basic 650 all the
operation codes, addresses, automation and apparent behavior of a
650 eqUipped with automatic floating decimal device and three indexing
registers.

Richard E. Chandler
Research Computing Center
Florida State University
Tallahassee, Florida

Programs existing or intended for the above augmented IT'''lchine are
immediately compatible with any 650 provided drum space is available
for this simulator. Entrance and exit procedures are quite simple and
the simulator can be used as a subroutine in the main program or as a
general interpretive program by c,.tering from the console switches
once per program.

a. Purpose: SHIFF is a FOR TRANSIT I (s) subroutine designed to shUt a fixed
point number a desired number of places right or left (or both).
b. Restrictions, Range:
c.

~

Fixed point.

Does not apply.

d. Storage Requirements:

The writewup includes detailed flow charts and listings so that less
general versions of the simulator can be assembled as special subroutines
requiring leBs storage if desired.

17 locations plus 1454 and 1951 w195Z.

e. Remarks: SHIFF operates with the argument (number to be shifted) in the
lower. Since the first shift performed is to the right, all digits shifted
"off" will be lost.

f. IBM 650 System:
devices.

Minimum 650 with alphabetic and special character

This simulator is especially intended for training programmers in the
use 01 the automatic devices and their operation codes when only a basic
650 is available.
b. Range, Accuracy, fixed or floating point are as for augmented 650.
c. Mathematical Methods: Not pertinent.

IBM 650 Library Program Abstracts

Filt no. 1.6.048

TRANSLATOR· OTHER FORMATS TO
SOAP RELOCATABLE (TYPE Z) DECKS

e. Remarks: Program is available on single or double word seHwloading cards
assembled for locations 1500 thru 1894. To enter: RAL first command of
main program to be interpreted and go to 1500. To leave: Address control
to a negative command, read a load hub card, or attempt an invalid command.

w.

H. Lewellen
D. L. Weimer
Ohio Department of Highways
Columbus 15, Ohio

d. Storage Requirements: 394 adjacent drum locations are required for the full
sim.ulator. The speed of the main program. being interpreted is roughly ten 650
operations per second. Relocation is possible in multiples 0150 locations by
changing SOAP II pseudo·operationll as explained in writewup for re-assembly.

(Continued on next column)

r.

~

Minimum 650.

No special wiring.

89

Fileno, 1,6,051

IBM 650 Library Program Abstracts

Fileno. 1,6,054

IBM 650 Library Program Abstracts

537 SIMULATOR GENERATOR
FCRSCAN

Q. J. Maltby

North American Life Assurance Co.
Toronto, Ontario, Canada

AN IBM 650 COMPUTER ROUTINE FOR
MACHINE EDITING OF FORTRAN PRCGRAMS

a. Purpose: Generates on SOAP II input card fot'mat a subroutine for use
within a program.
The subt'outine genel'ated, after assembly within
a program will simulate in the 533 the operation of a 537 inputoutput unit to the extent of punching the output on the input cards.
Misfilings between reading and punching are detected.

C. A. Irvine
Monte G. Smith

b. Range: Does not apply.

Contin(mtai Oil Company
P. O. Drawer #1l67
Ponca City, Oklahoma

Accuracy: Does not apply.
This routine will scan a program wt'itten in the "650 FORTRAN"
language and will examine the program for forty~seven types of errors.
These errors fall into three major categories: (a) transcribing and
keypunching, (b) violations of system restrictions, (c) logical flow

a.~:

Floating/Fixed: Does not apply.
c. Mathematical Method: Does not apply.
d. Storage Required (re the generated subroutine): The results storage
area used by the subroutine is defined by the input prepared for the
generator. (This area should be as large as possible for easy card
handling). The subroutine programme is contained with 100 consecutive
locations (with a few spaces in the middle).
~:

Unknown.

However the subroutine was hand optimized.

b. Range: Does not apply.
c. Mathematical Method: Does not apply.
d. Storage Required: 1849 locations.
Speed: Approximately 16 cards per minute.

Relocatability: The subroutine is fully relocatable. The translation
desired is specified in the input prepared tor the generator.
e. Remarks: The input to the generator must specify the number of "answer"
~.,d.,d and the punch words from which they will be available for
output. Thus there is cor.siderable flexibility in programme design, as
the generator analyses the variables and puts out a complete subroutine
which is ready to use,
f. 650 System: One 533 required.

RelocatabHity:

Non~relocatable.

e. Remarks: Since the "650 FORTRAN" system contains virtually no
diagnostic features, the use of FORSCAN should greatly reduce thc
number of unsuccessful compilations. Machine editing with FORSCAN
is considerably faster than the 650 FORTRAN to SOAP phase of the
compiling process.
C.

Special Devices: Alphabetic device required.

650 System: Minimum 650.
Special Devices: Indexing accumulators, special character device, and
alphabetic device.

Fileno. 1.6,052

IBM 650 Library Program Abstracts

650 DIAGNOSTIC

FORTRANSIT SCANNING ROUTINE

T. L. Yates
Oregon State Highway Department
Salem, Oregon

George Brooks
Applied Science Representative
IBM - Tulsa,
1307 S. Boulder Avenue
Tulsa 19, Oklahoma

A program to detect irregularities in IBM 650 routines.

a, Purpose:

a.
h. Range:

Does not apply,

c. Mathematical Method:

Purpose: This routine is designed to scan FORTRANSIT Statements for
most of the common errors that occur in the wl'iting of the statements and
also check the flow of logic of the program. U errors are detected, an
card is punched and the program continues to scan.

Does not apply,
b.

d. Storage Required: Operates at full read-punch speed,
500 words of drum storage. Non-relocatable.

Range:

Does not apply.

Uses approximately
Mathematical Method:

e,

f.

Remarks: Input to this program consists of load cards in the SOAP
output format. Output consists of 30 columns of alphabetic from punch
words 1-6.
IBM 650 System:

Jon Pegg
S. Togasaki
IBM Advanced Systems Development
Monterey &: Cattle Roads
San Jose. California

Purpose: 650 FORTRAN Editor: A method of detecting many errors
in 650 FORTRAN statements.
~:

650 Set up for FORTRANSIT, reads at 40-50 cards

d.

Storage Required:
per minute.

e.

Remal'ks:
This diagnostic will not check all possible errors (i. e.
misspelling) but will provide a fairly thorough check for the most co:rnm.on
errors .• The program is open ended and future plans include checking
for misspelling and other possible errors not included in thi.1I system,

f.

IBM 650 System: FSR I will take care of the FORTRANSIT I and II
while FSR (5) will take care of the FORTRANSIT I (s) and II (s) systems.

Filii no, 1. 6. 053

650 FORTRAN EDITOR

b.

Does not apply.

Minimum 650 with alphabetic device.

IBM 650 Library Program Abstracts

a.

Filtno.l,6,055

IBM 650 Library Program Abstracts

Does not catch all errors.

Mathematical Method:

Does not apply.

Filuo.l,6.056

IBM G50 Library Program Abstracts

GENERAL PURPOSE 407 CONTROL PANEL

Robert C. Hessing
Cities Service Resea.t'ch and Development Company
920 East Third Street
Tulsa 20, Oklahoma

d. Storage Required: Speed about 100 cards per minute.
Remarks:

C.

None,

IBM 650 System:

lAS, 407, Indexing registers, alphabetic device.

a. Purpose: This control "anel allows the 407 user to list all card fnmate
which arise in normal 650 programming and data processing: FORT~N.

(Continued on next page)

90

B - 650
SOAP, and machine language procescling (sec (e) below). FORTRAN
statement cards, data cards, answer <,;ilrdm, SOAP instruction <,;ardll,
machine language cards, and five per card condenaed decks are examples
of formata which may be printed. In addition to the above, any title of
32 characters (or less) may be stored and subsequently printed ';)n the
first lin!! of !!ach form.
b. Range, Accuracy, Floating/Fixed:

Copies of the new

write~up

are available (either separately or combined with

the original report) from the IBM 650 PrograITl Librarian.

Does not apply.

Fileno.
c. Mathematical methods:
d. Storage:

f.

IBM 650 Library Program

Docs not Olpply.

2.1.001
ERRATA

Does not apply.

Remarks: Standard 407 accounting machines COlnnot be programmed to
print FORTRAN statement cards or t'l bring information out of storage
~n the first line of the first form.

"Internal Translator (ITI,.A Compiler for the 650," by A. J. Perlis,
J. W. Sm.ith, and H. R. Van Zoeren.

Cards must contain identifying punches where necessary.

In the SOAP listing of the com.piler the following changes should be made:

E9UipTllent specifications:
1) Standard 407 accounting machines (16 co-selectors, 15 pilot sele<,;tors,
and Z digit selectors) allow printing of all card forTllats Tllentioned
above except FORTRAN IItatcment cards.

Card No.

2) 401 accounting Tllachines equipped with 16 additional co-selectors,
5 additional pilot selectors, and 1 additional digit sekctor allow
printing of all card formats mentioned above including FORTRAN
statement cards.

File no. 2.. O. 00 I
Programming System!)

IBM 650 Library Program Abstracts

~

AOOOI
1. 0341
SUP
2. A0341
NEWAB
STU
0603
BS
LDD
DROPU
3.
4. Ao603
RAL
NEWAll
5. Bob03
NZA
BSA
6. 0606
AOOOI
BSA
STL
7.
0607
BSA
RAU
N
BN!
8. 0650
LDD
LDSR
9.
Delete cards 651, 652, 653, and 1692.

1065
1137
0987
0690
0298
1485
0786

1413

11

21
69
65
45
20
60
69

0383
0845
0690
0845
0786
0383
0484
1377

1137
0887
0893
02.98
0640
0786
1039
1038

The above changes are corrections to the compiler and do not represent
misprints in the listing. Changes 1 - 7 are necessary since the compiler.
as distributed, would incorrectly erase an entry in the abeon table every
time a floating point constant with a negative exponent was compiled, regardless of whether the exponent had previously been stored as a constant.
Changes 8 and 9 are necessary to make room for the insertions.

SIR: SOAP INTERPRETIVE ROUTINE*
B. G. Oldfield
W. Hem.m.erle
IBM, New York

The above changes have been made in all decks supplied on or after June I,

a. Purpose: A rclocatable library program which is used with the SOAP

1958.

system to handle floating decimal interpretive operations.
b. Range: Does not apply.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

2. O. 002

Accuracy: Does not apply.

MITILAC

Floating/Fixed: Does not apply.
c. Mathem.atical Method: Does not apply.
d. Storage Required: The program if' separated into 9 sections and only
those required for a particular problem. need be assem.bled. Storage
for individual sections varies from. 31 to 184 locations.
Speed: Timing is a function of the operation being performed.
Relocatability: Relocatable SOAP program cards are available.

R. H. Battin, R. S. O'Keefe, M. B. Petrick
MIT, Boston

September, 1955

a) A general purpose multiple address interpretive routine for floating point
numbers.
b) Does not apply.

e. Remarks: Included, in addition to the arithmetic operations, are trace,
float, fix, square root, sin-cos, In, expo and arctan. Entry and exit
from the interpretive routine arc at the discretion of the programmer.
The program is available from the Program. Library in 3 fornls:

c) Does not apply.
d) The complete routine requires aU but 390 locations 0010 to 0399,

This

amount may be increased to approximately Slia by not using all the features
of MITlLAC. Timing is a function of the operation being performed.

an absolute 7-per-card condensed deck
a synlboUc deck in SOAP I format
a symbolic deck in SOAP II format
Modified SOAP I and SOAP II decks are also available from the Library
and must be used in assembling the SIR symbolic decks. If possible, usc
of the condensed deck is advised.

f. 650 System: One 533 required.

e) Included, in addition to the arithmetic operations, are sin, cos, arctan,
square root, exp, In, log as a special case, absolute value, solutions for
simultaneous differential equations, 10 index registers, read, punch, and
various branch operations.
f)

Minimum 650.

Special Devices: Alphabetic device necessary.
*This abstract, which has been revised to reflect the current status of the
system, should be lIubstituted for the existin~ abstract for 2.0.001.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

2. O. 003

Fileno. 2.0.001
ADDENDA

IBM 650 Library Program Abstracts

COMPLEX ARITHMETIC INTERPRETIVE ROUTINE

Tsai H. Lee
Detroit Edison, Detroit
"SIR: SOAP Interpretive Routine, .. by B. G. Oldfield and W. Hemmerle

The original

sm write-up has

a) Interprets and executes multiple address complex arithmetic instructions
in addition to performing the normal 650 instructions.

been rewritten by Dr. J. A. Kearns and

Mrs. Helga Shareshian, IBM Education Center, New York, to conform. to

b) All complex numbers are assumed to be of the form. xxxx.x xxxx.x + j
SOAP II.

The new report, .known as "SIR 11"

18

written as a textbook rather

than as a reference manual and. is being added to the original

write~up

. xxxxx xxxxx.

as an

c) Does not apply.
addendUIll.

(Continued on next column)

(Continued on next page)

91

d) The interpretive routine occupies 284 locations, 0000 to 0283.
is a function of the operation being performed.

Timing

e) Twelve instructions may be interpreted: add, subtract, multiply, divide,
shift left, shift round, store complex accumulator, transfer complex number
from mzmory to memory. sum a block of complex numbers, square of absolute value, vector-vector multiplication, and unconditional transfer. Negative instructions are interpretedj positive instructions are executed normally.

a) This routine Is designed to save programming space by exe~uting two instructions per line. The floating decimal point instructions are add, sUQtract,
multiply, negative multiply, divide and add absolute as well as reset add, reset subtract, store and branch minus.
b) Range: _10 50
arithmetic.

< x < 1050 •

Accuracy: 8 places. Number system: floating

c) Does not apply.
f) Minimum 650.
d) Storage required is 150 locations.

650 LIBRARY PROGRAM ABSTRACT

2. o. 005

FILE NUMBER

SPEED CODiNG SYSTEM

e) This routine embellishes the 650 computer, but all ordinary 650 instructions
can be used in conjunction with this system. A tracing routine has been developed and can be put into any punch band.
f)

Minimum 650.

H. M. Sassenfeld
Redstone Arsenal, Huntsville, Alabama

a) A three address interpretive routine for both fixed and floating-point
decimal arithmetic.

650 LIBRARY PROGRAM ABSTRACT

b) Does not apply.

FILE NUMBER

2 0 008

GENERAL PURPOSE SYSTEM FOR THE
650: L2

c} Does not apply.
d) Storage required is. from 600 to 855 locations depending upon how many of
the function subroutines are needed.
e) There are 45 possible instructions including mathematical functions,
memory, dump, restart procedure, three index registers, and optional use
of normal 650 operations. Programs coded in the Speed Coding System may
be simulated on the 704 by use of the 650 simulator program prepared by
Redstone Arsenal.
f)

R. W. Hamming and Miss R. A. Weiss
Bell Telephone Laboratories, Inc., Murray Hill, N. J.

August 24, 1956

a) A general purpose three address floating point interpretive system designed
to be easy to learn and use. The orders are not assigned definite locations
so that prograIl1 changes are very easy to make.
b)

The 8 place floating point system of numbers with exponent range of
-50 to + 49. A fixed point addition is also included.

c) Does not apply.

Minimum 650.

d) Storage required for the interpretive system is 1100 locations, 0900 to 1999
System is not relocatable but library routines are relocatable. The main
program of a problem automatically relocates itself as required.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

2. o. 006

NINE OPERATION SPLIT INSTRUCTION ROUTINE: NOSIR

August 3, 1956

L. M. Harvey and J. C. White
G. E •• Schenectady

e) In addition to the standard arithmetic operations there are: square root,
eX, logex, lOX, 10g10x; sin x, cos x, arctan JC (both degrees and radians)
all with full range of arguments and 8 place accuracy; block read in, punch
out, and move; five index registers; transfers on minus, zero, and exponent;
transfer to library and subroutines; and tracing orders. Conditional error
stops for division by zero, square root of negative numbers, etc .• for which
error cards are automatically punched. Calculations can be continued after
these stops by pushing the program start button.
f)

a) A floating-point interpretive routine using 5 digit instructions so that
problems with a large number of instructions may be solved with a single
program loading.

Minimum 650.

(File numbers 2. O. 008 and 2. O. 008R refer to the same item, i. e., this
General Purpose System.)

b) The interpreted operations use the built-in floating-point operations.
c) Does not apply.
d) Storage required is 94 locations 0000 to 0093.

ERRATA

650 Library Program - File No.2. O. 008

e) Instructions consist of a one-digit operation code and a four-digit data

address. Operations include the arithmetic operations, store, branch
minus, branch zero, and exit. Interpreted instructions are stored two to
a word and are executed in sequence; the two instructions in a word are
performed before proceeding to the next word, Subroutines and normal
650 instructions may be used as needed.
1)

An error has been discovered in certain copies of the L2 program deck furnished
to 650 users. In the main deck, column 18 of card 30 should contain a zero punchj
in the incorrect copies, this oolumn is blank.

Floating decimaJ device is required.

650 LIBRARY PROGRAM ABSTRACT

"General Purpose System for tbe 650: L 2, tt by R. W. Hamming and Miss R. A.
Weiss

FILE NUMBER

2. O. 007

It is recommended that all copies of this deck be examined and, if necessary.
corrected. L2 decks furnished by the 650 Program lJbrary on or after March 3,
1958, have been corrected.

ERCO SPACE SAVER
W. G. Rouleau and E. H. Weiss
EnCO Division, ACF Industries, Inc., Riverdale, Maryland
(Continued on next column)

92

April 1958, Bulletin 18 - 39

B - 650

FILE NUMBER

650 LIBRARY PROGRAM ABSTRACT

2. O. 009

EftCO FLOA TING DECIMAL POINT SUBROUTINES

b) Floatinf!; point numbers between 10- 50 and 10+49 with eight significant fi~ures
(for both real and imar;lnary parts).
c) Not relevant.

J. K. Carl and E. H. Weiss

d) Uses 1000-1999; and 0002-0004 erasable storage, 0000-0001 for previous
result. Sacrifices arctangent, but provides supplementary (Slower) program to
evaluate arctangent, using 950-999. Operation times much slower than for real
floating decimal operations.

ERCO Division, ACF Industries, Inc .• Riverdale, Maryland

a) Performs eight floating decimal point instructions, namely: add, multiply,
divide, subtract, negative multiply, negative divide, add absolute and suh
w

tract absolute.
b) Range: _10 50 .( X
decimal point.

e) Special {unctions are not available for complex arguments.

< 1050,

Accuracy: 8 places.

Number system: floating

Tile Bell Laboratories Interpretive System is described in IBM Technical
Newsletter No. 11.
f) Minimum 650.

c) Does not apply.

d) This routine uses only memory locations 1900-1999.

Fiitno. l.O.013
Programming Systems

IBM 650 Library Program Abstracts

e) Does not apply,
AUT OF LIN

f)

Minimum 650.

H. L. Pickering

FILE NUMBER

650 LIBRARY PROGRAM ABSTRACT

2. O. 010

a. Purpose! Autoflin is a general purpose, interpretive system which combines some of the features of the IBM Technical Newsletter No.8 Floating
Point System with the Bell Telephone Laboratories System. In addition,
looping codes with many of the properties of the FORTRAN DO statements
are provided. An auxiliary input-output system may also be used.

DOPSIH: DOUBLE PRECISION FLOATING POINT SOAP
INTERPRETIVE ROUTINE

Hebron E. Adams

W. C. Lake
Pan American Petrolewn Corporation
Research Department
Tulsa. Oklahoma

January 2, 1957

IBM, Washington

b, Range:

Depends on the operation being performed.

Accuracy: Depends on the operation being- performed.

a) DOPSlK is both a system of coding (uses a set of mnemonic operation codes

in which all arithmetic operations are performed with double precision floating
decimal numbers) and a relocatable library program, which interprets the said
system.
b) Range of variables: 10- 49 to 10+ 5

°.

Accuracy: 18 places.

Floating paint.

c) Conventional floating point methods.

Floatingl Fixed: The internal system uses automatic floating point. The
auxiliary input-output system provides for fixed decimal input-output.
c. Mathematical Method: Function routines for sine, cosine, logarithm and
exponentiation similar to those used in the Bell system are provided. An
arctangent routine is provided based on D. W. Swc('ney's routine described
in Abstract 3. 1.017.
d. Storage Required: The interpretive system itself is divided into four parts
as follows:

d) Storage required' 670 locations maXImum. Speed: interpretation-execution
time averages 60 milliseconds. Relocatable library program.

Drum Locations

II
III

e) DOPSIR is. in most ways, analagous to SIR, and all SIR operations are included in DOPSIR. In addition, such features as interpretive floating decimal
to fixed declmal and fixed dl;'cimal to floating decimal commands, an improved
inh.'rpretive tracing system, and an addressable pseudo-accumulator have been
included. Inasmuch as DOPSIR is a somewhat extensive system, the text of
the report should be referred to for precautions and restrictions.
f)

IV

Basic Arithmetic
Logarithm-Exponential
Sine- Cosine
Arctangent

Part I may be used alone. Anyone or more of the remaining parts may
be added if needed, but may not be used without Part I. The complete
auxiliary input-output system uses drum locations 1785-1999.

Alph;lbetic deVIce is necessary.

~

Operating speeds are two to three times faster than those for
the Bell system, depending somewhat on the problem type.
Rclocatability:

650 LIBRARY PROGRAM ABSTRACT

0000-02l0
Ol21-0376
0377-0491
0492-0563

FILE NUMBER

2. O. 012

COMPLEX ARITHMETIC OPERATIONS
IN THE BELL LABORATORIES INTERPRETIVE SYSTEM

Not gIven.

e. Remarks: The AUTQFLIN system allows the programmer to write
programs which use the computer effectively with only a superficial
knOWledge of the 650. No assembly m.achine pass is required.

L

650 System: One 53}. indexing regi!ltcrs, and automatic floating dechnal
arithnletic are required.

P. M. Marcus
Carnegie Institute of Technology
Pittsburgh, Fa.
D. L. Blackhurst
Mellon Bank
PIttsburgh, Fa.
a) Complex Arithmetic Operations in the Bell Laboratories Interpretive System
provides the five arithmetic operations - addition, subtraction, multiplication,
division and negative multiplIcation - with the same code structure as for real
operations. The 650 must be sent into a complex mode of operation by a special
command; however, previous results and looped operations are preserved, and
there is also a complex move; all other operations send the 650 back to the usual
mode. Complex numbers are stored in two floating decimal parts in successive
registers.
(Continued on next column)

Special Devices: None.

IBM 650 Library Program Abstracts

Fil~no.
2,0.015
Programming Systems

REVISED BELL LAB INTERPRETIVE SYSTEM; REVISED BELL LAB TAPE
SYSTEM
D. J. Hall

Research Computing Center
Indiana University
Bloomington, Indiana

(Continu~d on next page)

9~

Purpose: "Revised Bell Lab Interpretive Systell'ltt: This prograll'l is a
revision of the Bell Lab Interpretive Systell'l (see Technical Newsletter
No. 11) to extend its principles to include the use of indexing registers,
lAS. and autoll'latic floating decill'lal aritlunetic feature.
IIRevised Bell Lab Tape SysteDl": This prograDl is a supplcDlent to
"Revised Bell Lab Interpretive SystCDl." Both systeDls were asseDlbled
separately; thus the program decks are not the saDle in sill'lilar parts.
The tape cODlDlands were added to perDlit the user of the Bell Lab System
to have access to tape storage.
b.

Range: Will vary depending upon the function being

b.

Range:

Does not apply.

Accuracy: Does not apply.
Floating/Fixed:

Does nat apply.

Mathematical Method: Does not apply:
d.

Storage Required: Not given.
Speed: Not given.

executed~

Relocatability: Not given.
Accuracy: Will vary depending upon the function being executed.
Remarks: This program can be modificd to perform symbolic assembly
on programs in aU known one, two and three address sequential interpretive
systems for the IBM 650.

Floating/Fixed: Floating decimal.
MatheDlatical Method: See the program write-up.

f.
d.

IBM 650 System:

Storage Required: "Revised Bell Lab Interpretive System": 819 drum
storage locations and 60 lAS locations are required. "Revised Bell Lab
Tape System": 998 drum storage location5 and 60 lAS locations are
required.
Speed:

Will vary, depending upon the function being executed.

One 533 required.

Special Devices: Alphabetic device required.

Fileno.

IBM 650 Library Program Abstracts

2. O. 018

Programming Systems

Relocatability: Not given.
Remarks: The unused drum. storage locations could he us-ed to add more
codes to the revised systems.
f.

IBM 650 System: "Revised Bell Lab Interpretive System tl : One 533.
indexing registers, lAS, and automatic floating decimal arithDletic feature
are required. tlRevised Bell Lab Tape System l l : Same as above plus at
least two 727 tape units.
Special Devices: Alphabetic device required if reassembly is desired.

sm

B. Kallick
R. W. Floyd
Armour Research Foundation
Dlinols Institute of Technology
Chicago, DIrnois

a.

IBM 650 Library Program Abstracts

PLUS

Fileno. 2.0.016
Programming Systems

b.

Purpose: This program augments the SOAP Interpretive Routine with three tenw
digit indexing registers permitting address modifications while in the interpretive
mode.
Range: Does not apply.

SIMULATION OF AN INDEXING REGISTER IN SIR

Accuracy: Does not apply.
B. Leavenworth
American Machine &: Foundry Company
Greenwich. COImecticut

Floating/Fixed: Does not apply.

Purpose: This program is a modification in SIR ("SOAP Interpretive
Routine." File NUll'lber 2. O. 001) to simulate an indexing register.
b.

c.

Mathematical Method: Does not apply.

d.

storage Required: This program requires 47 storage locations.

Range: Does not apply.

Speed: Not given.

Accuracy:

RelocatabU1ty: Relocatable.

Does not apply.

e.

Floating/Fixed: Does not apply.

Remarks: Must be loaded after the sm deck. Should be used with non-standard
SOAP n deck.

Mathematical Method: Does not apply.

f.
d.

Storage Required: Requires the nlodification of 14 SIR instructions. If
the function. subroutines (SIN-COS, LOG. EXP, ARCTAN) are not used,
this prograDl requires the reservation of only seven storage locations in
addition to MAIN SIR.

IBM GSD IJbrsry Program Abstracls

Speed: Not given.
Relocatability: See File Number 2. O. 001.

IBM 650 System:

Barry J. Mitchel
Carnegie Institute of· Technology
Pittsburgh, Penna.

a. Purpose: This system permits the programmer to code problems in the
three-address language of the Wolontis Interpretive System, developed in
1956 at Bell Telephone Laboratories, and described [n IBM Technical
Newsletter No. II.

One 533 required.

Special Devices: Alphabetic device required.

IBM S50 Library Program Abstracts

Fileno. 2.0.017
Programming Systems

b. Restrictions, Range: The WIT compiler, which will operate on any 650,
translates the Wolontis program into 650 machine code, and prepares a
permanent program utilizing automatic floating-decimal arithmetic, magnetic
core storage, and (if desired) the indexing accumulators and RAMAC
disk storage unit.

UNIVERSITY OF HOUSTON ASSEMBLER FOR THE PROCESS ENGINEERING
INTERPRETIVE CODING SYSTEM

~

d.

V. Schorre
E.1. Organick
University of Houston
Houston, Texas
Purpose: This program combines the functions of symbolic assembly with
those of the executive routine. For many applications this system possesses
greater advantages than either function utilized separately.
(Continued on next column)

94

Fittnll. Z. O. 019

WOLONITS INTERNAL TRANSLATOR
(WIT)

Remarks: The simulation of an indexing register in SIR is accomplished
by providing for two new pseudowoperation and tagging instructions with a
negative sign for address modUication. The only sacrifice made is the
trace negative SIR instructions feature. Otherwise, the system is
unchanged.
f.

IBM 650 System: One 533 required.
Special Devices: Alphabetic device required.

Notglven.

ReqUIrements This translation results in an operating speed
increase of about five to one.

Stora~e

e. Remarks:
The card formats for a WIT program and its aS50ciated data
and output are irlentical to those specified for the corresponding Wolontitjl
program. For this reason it is possible to check out programs using
the TRACE morle of the interpretive system before translation by WIT.
(Continued on next page)

B- 650
Thl;l r.'Bult or translation is a machine code program on rour~pcr-card
103d cards. The operating program deck is prepared by prefixlng to
thls the WIT basic package, and appending tbe subroutine card package II
called [or by the program. Drum memory is cleared at the initiation of
loading of the operating program.

!. IBM 650 System:

Bell tIl will operate, for a given problem, at least 35 percent faster than
Bell I while even greater operating speeds are attaInable with extcnlllve
programm ed usa Qf the Previous Numerical Result. It conllists of a
Systems Load Program (6 cards), a Systems Deck (177 cardll) and Drum
Clear (3 cards) in that order.

IBM 650.

lift 110.

IBM 65D IJbrary Program Abatracta

e. Remarks: Precautions:
1. There is no error stop for zero before 1I0ating divide operation II. A new
interpretive command TR ZERO (transfer on zero in PR) has been provided.
Floating~decimal overflow and under!iow modulo 100 is possible.

Z.0.020

2. For ~reatest advantage II the Systems program uscs the automatic !ioatingdecimal arithmetic feature of the auxiliary 653 unit. Consequently, t~e FD

FLICOR: FLOATING INTERPRETIVE COMPATIBLE OPERATION ROUTINE
S. I. Scblesinger
L. Sashkin
Aeronutronlc Systems Incorporated

b.

I'ilerao. Z, O. Ol2

IBM 65D IJbrary Program Abatracts

Purpose: This routine was designed to simulate floating decimal arithmetic
and indexing register operations using the IBM 650 basic card machines,
Programs written for use with this interpretive routine are compatible with
programs intended for usc with the IBM 650 equipped with floating decimal
device and indexing registers, and may be run on such machines by changing
only two instructions, In addition to the main routine, a tracing routine for
debugging Is included, as are a set of certain basic arithmetic subroutines.

lD-3 INTERPRETIVE SYSTEM

Bonner and Moore Engineering Associates
Houston, Texas

Range: Does not apply to the main routi.ne. See the program writeup for
the range of the subroutines.

a. Purpose:
This routine 111 a spedal Interpretive system designed (or
use In the process industry.

Accuracy: Does not apply to the main routine. See the program writeup
for the accuracy of the subroutines.

b. Restrictions, Rance:
Accuracy:

Does not apply.

Does not apply.

Floatins/Fixed: Does not apply.
Floating/Fixed: Fixed point.

d.

Mathematical Method: Does not apply to the main routine. See the program
writeup [or the methods used in the subroutines.

c. Method:

Storage Required: The main routine requires 475 storage locations. The
(ollowing subroutines require the number o( storage locations indicated:

d. Storage Requirements:
Instructions.

Speed:

-

49:

SIN X

-

84;

COS X

-

72:

e

-

82:

ARCTAN X

-

1350 drum locations are available for interpretlve

e. Remarks: The 10-3 sylltem is used to write the e)C:ecutive program for
~perations Simulator. Operation codes of ID-3 are of the type that
greatly reduce the prog't'amming time for the Process engineer.

84:
-

Does not apply.

87.

For the main l.'outine, the following approximate speeds are given:

f. IBM 650 Syatem:

Basic 650 is required.

Arithmetic operations
45 to 52ms.
Store, reset, index register operations - 18 to 30 mil.
For the following subroutines, the approximate speeds are as follows:
LOG

X

205 ms,: SIN X

200ms.: COS X

-

205ms.

j

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

2.1.001

x

x
210 ms.: ARCTAN X - 240 ms.
Relocatability: The main routine is relocatable, with some restrictions.
205 ms.:

e

e.

Remarks: Tagging (or address modification is interpreted (or the data
addren portion only o( the instruction word. The subroutines (arithmetic)
mentioned are independent of the main routine in operation, and
may be assembled separately.

[,

IBM 650 System: One 533 required.

IBM 65D IJbrary Program Abatracts

FiltFlD.l,O,Oll

INTERNAL TRANSLATOR (IT)
A COMPILER FOR THE 650

A. J. Perlis
J. W. Smith
H. R. Van Zoeren
Carnegie Institute of Technology, Pittsburgh 13, Pa.

A COMPLETE FLOATING-DECIMAL INTERPRETIVE
SYSTEM FOR THE IBM 650 MAGNETIC DRUM CALCULATOR
AND IBM IMMEDIATE ACCESS STORAGE UNIT
(BELL III)

a) Programs written as a sequence o( statements in a general algebraic
language (roughly similar to that o( FORTRAN) are translated into programs in
symbolic, i. e., SOAP I form.

Robert L. Farrow, Ph. D.
Biophysics Division
Department of Physiology
Ohio State University
Columbus la, Ohio

b) Programs employing both fixed and floating point constants and variables may
be translated.
c) Does not apply.

a. Purpose:
This program is a general purpose scientific and engineering
interpretive program. It ts designed to replace the orIginal Bell
lnterp~tive System Program when running Bell language programs on the
IBM 650 equipped with an auxiliary 653 unit.
b. Restrictions, Range: The range of this program is identical to the original
Bell I program as written by Dr. Wolontis (viz: mM Technical Newsletter
No. n, 1956). The accuracy of the floating-decimal subroutines is generally
plus or minus one In the eighth place except for LOG and the SIN-COS
subroutines which contaln optional machine stops to lndicate loss of accuracy.
Externally, this systems program is identical to Bell I with three necessary
exceptions noted under "precautions", below.
c. Method: Subroutines for the transcendental functions are balled upon the
ei.ght digit Rand approximations for digital compl1tcrs, and in fact are the
same as those found in Bell I except for the calculations of the £loating_
decimal chara.cteristic.
d. Storage Requirements: The systems program uses core addresses 9000
to 9049 and addresses 9050 to 9059 for erasable storage as well as drum
locations 1000 to 1999. (Note! A separate subroutine is provided to locate
some ZOO plus unused registers).

(Continued on next column)

d) The translator requires the entire drum. Output is approximately 50 SOAP I
cards/minute.
e) The SOAP I type programs produced are assembled by a modified SOAP I
deck whose output is a machine language program punched 5 words/ card.
These ·machine language programs require, during operation, an auxiliary
package of subroutines which include floating point, input-output, and optional
logarithm, power and exponential routines. Depending on the option, these
packages require from 270 to 500 locations. The remainder of the drum is
available (or program and data. A general technique may be used to incorporate
additional subroutines.
The system includes a programming manual, 533 wiring dia~ram. the
translation program, the modified SOAP I program, reservation and subroutine
packages, and sine, cosine, and square root floating point subroutines.
f) Alphabetic device is required.

95

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

2.1. 002

IBM G50 Library Program Abstracts

File no. Z. I. 004
Prograruming Systems

SPYCE

MODIFICATIONS OF THE INTERNAL TRANSLATOR' (IT)
COMPILER FOR USE OF SPECIAL CHARACTERS

J. M. McKeever
IBM, Los Angeles, California
Purpose~

This routine translates English sentences into symbolic program
language. The output of this routine may then be assembled using an assembly program of the user's choice.

J. N. Rogers
C. M. White
GE VallecJtos Atomic Laboratory
Pleasanton, California

b . . Range:

a) These revisions are to take advantage of some of the FORTRAN symbols in
writing IT statements for the compiler. The following table gives the correspondence between the revised symbols and the representation for the computer.

Symbol Name

Representation
d.

/

Not relocatable.

Remarks: By using SPYCE, programming time is greatly reduced and
much of the detail effort is eliminated. At any time the programmer may
switch from sentence to SOAP mode. SPYCE is applicable to both those
commercial and engineering problems which require large volwnes of input/
output data.

A sample statement would appear as below:
(2.85 + C (12 + 14» / 5.82
f.

b) Does not apply.

IBM 650 System: One 533 required.
Special Devices: Alphabetic device and read. half-time emitter are required.

c) Does not apply.
d) All other aspects of the IT system remain the same. The card deck and the
listing appended to the write-up include only the change cards for the IT deck.
e) Alphabetic device and Group

This routine requires all of drum storage except six

This routine compiles at punch speed.

Relocatability:

+

= (C13 x Y5) -

Does not apply.

Storage Required:
locations.
Speed:

Comma

Y2

Does not apply.

Floating/Fixed:

Mathematical Method: Does not apply.

Left Parenthesis
Right Parenthesis
Decimal Point
Equality (substitution sense)

Addition
Division
Negation

Does not-apply.

Accuracy:

n

File no.

IBM G50 Library Program Abstracts

2.1.006

Programming Systems

special character device are required.
BUMP, BOSTON UNIVERSITY MATRIX PROORAM

•

650 Ubrary Program Abstract Number 2. 1. 001, Internal Translator (IT) A

Compiler for the 650, A. J. PerUs, J. W. Smith, H. R. Van Zoeren, Carnegie
Institute of Technology, Pittsburgh 13, Pa.

L. E. Belsky
Boston University
Boston, Massachusetts

Purpose: This is an interpretive program which will perform matrix-vector
operations automatically, including: add, subtract. multiply, invert, transpose,
trace, ,scale, scalar multiply, as well as internal operations: read, punch, move,
stop, go, etc.

April 1958, Bulletin 18 - 13

G50 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

2.1.003

b.

IT - 2

Range: Maximum size matrix is 10 X 10, without partitioning.
Accuracy: Not given.
Floating/Fixed: Floating decimal arithmetic is used.

H. R. Van Zoeren
Computation Center
Carnegie Institute of Technology
Pittsburgh 13, Pa.

c.

Mathematical Method: Does not apply.

d.

Storage Required: Entire drum is used. 750 locations allocated for instructions,
data.

~~ l~~f>r::st;:~\~e~S~r~~fr;~~foo~:~~\~r:~~~~~I; rl::::::t~:ei~ ~~~~~r~ct
instructions/card form.

Speed: Not given.
Relocatability: Not relocatable.

b) Same as 2. 1. 001.

Remarks: Use of larger systems outlined by method oi matrix partitioning. Example
of 20 x 20 inversion included.
f.

IBM 650 System: One 533 required.

c) Does not apply.
d) The translator requires the entire drum. Output is approximately 20 cards per
minute (100 instructions per minute).
e) The machine language programs produced require, during operation, an
auxiliary package of subroutines which include floating point, input-output, and
optional logarithm, power and exponential routines. Depending on the option, these
packages require from 270 to 500 locations. The remainder of the drum is available for program and data. A general technique may be used to incorporate
additional subroutines.

File no.

IBM G50 Library Program Abstracts

GENERALIZED ALGEBRAIC TRANSLATOR (GAT)
B. Arden
R. Graham

University of Michigan
Ann Arbor, Michigan

The system includes the translation program, relocation routine and subroutine
packages, and associated function subroutines.

Apri11958, Bulletin 18 - 15

96

Purpose: This routine translates programs written as conventionally parenthesized
algebraiC statements into optimized IBM 650 instructions.
b.

f) Alphabetic device is required.

2.1.007

Programming Systems

Range: Does not apply.
{Continued on next page)

B - 650
Fileno. 1..1.010

Accuracy: Docs not apply.

IBM 650 IJbrary Program Abstracts

Floating/Fixed: Docs not apply.
MODIFIED 650

Mathematical !llethod: Docs not apply.
d.

FORTRAN~SCRUB

PRCGRAMMING SYSTEM

John n. Janicek
Cities Service Research and Development Company
Production and Exploration Laboratories
91.0 East Third Street
Tulsa lO, Oklahoma

Storage Required: Not given.
Speed: Not given.
RelocatabUity: Not given.

Purpose: The IBM 650 FORTRAN prugramming system has been modified
to incorporate the following advantages:

Remarks: The translation is accomplished in a single pass and the resulting
program is produced on nve-per-card load cards. Subroutines called for by the
source program are selected by means of a symbolic linkage and relocated at the
time of execution.
f.

1\

IBM 650 Systems: One 533, automatic floating decimal arithmetic feature and
indexing registers are required.

The SCRUB routine (Soap Condenser Removing Unnecessary Bulk\ may
be used as an optional pas;-in the system to reduce the numb';-r of
instructions in the final object program, especially whcre subscripting
is extensively used. The SCRUB routine takcli the SOAP output of the
FORTRAN compiler as input and produces all output an equivalent
SOAP program for specific. commonly occurring redundant sequencell
and rearranges them into shortcr, equivalent sequence~.

Special Devlccs: Group II special character devicc is required.
l) The output of SOAP assembly may now be obtained in a one instruction
per card format (or in a five instruction per card format). A condensing
r'>utine is provided which will accent the entire object program in Ilcard
form as input (including the package subroutines) and produce an
equivalent program in Sicard form.

Filt no.
2. 1. 008
Programming Systems

IBM SSD Library Program Abstracts

3) Corrected Fen.. TRAN statements can be reprocessed without rec0mpiling
the entire FORTRAN prngram. This is made possible in the modificd
system by punching out reloadable availability and symbol tables after
SOAP assembly.
---

650 FORTRAN MODIFIED FOR THE 4000 WORD 650

4) When the input-output format is sufficiently simple, the SCRUB routine

Dr. H. Klein
Mrs. Ann Miller
Lycoming Division
AVeO Corporation
Stratford, Conn.
11.

also pe rmits the reading and punching of data by means of FORTRAN
statements using an tl instruction subroutine instead of the lt9 instruction
READ-PUNCH ~ubl"outine built into the systcm.
b. Pro" rams employing both fixed point and floating point variables and
constants may be translated.

Purpose: To provide a FORTRAN system for the 4000 word 650. The system
consists of two major parts:
1. The compiler, 650 FORTRAN, which accepts FORTRAN statements
and compiles 650 instructions in symbolic SOAP II language.

c. Mathematical Methods:
d. Storage:

Remarl:s: The efficiency and speed of the SCRUB routine drops off sharply
~TRAN statement cannot be SCRUBBED down to less than about
34 SCAP instructions. The SCRUBBING pass cannot be bypassed if the

2. The assembler, II. modified version of SOAP IIA-40C.U, which produces
an optimized machine language program from the symbolic instructions.

b.

Does not apply.

The SCRUB routine utilizes the entire 2000 word drum.

optional input-output system is utilized.

Range: Does not apply.
I.

Equipment Specifications: Same as for 6S0 FORTRAN - Translation,

Accuracy: Does not apply.
Floating/Fixed: Both where applicable.
c.

Mathematical Method: Does not apply.

d.

storage Required: The compiler occupies most of the drum; the assembler utilizes
the entire drum.
Speed: Compiler: varies with complcxity of source statement.
- - Assembler: ApprOximately 75-80 cards per minute.
RclocatabiUty: Not relocatablc.
Remarks: lAS is used by thc package subroutine deck suppUed with the system.

f.

Filtno. 2..1.010

IBM 650 Library Program Abstracts

IBM 650 System: One 533, indexing registers, and 4000 word drum are required.

Special Devices: The machine on which the object program is to be nm requires
the automatic floating decimal arithmetic fcature.

Fileno,

2..1.009

IBM 650 IJbrary Program Abstracts

Scrubbing, and Assembly require a basic 650 with Index Registers and
Special Character Device. To run the object program the machine must
also have a Floating Point Arithmetic Device. The 650 FORTRAN 533
panel must be modified to obtain the l/card object program. The modified
panel may he used with the unmodified 650 FOR TRAN systelTI decks and
with the FORSCAN routine (for checking 650 FORTRAN programs [or
logical and clerical errors). By sacrificing some of the efficiency in
using index registers to improve the compiled program. the SCRUB
r·')utine can be used with the unmodified 650 FORTRAN syatem decks and
533 panel.

Fillrlo.2..1.011

IBM 650 IJbrary Program Abstracts
MODIFIED BELL TRANS LA TION PROGRAM FOR THE
IBM 650- 653 MAGNETIC DRUM CORE STORAGE COMPUTER
Robert L. Farrow, Ph. D.
Biophysics Division
Dept. of Physiology
Ohio State University
Columbus 10, Ohio

FLATRAN

Frank Dow Vickers
University of Florida.
Tallahasse, Florida

a. Purpose: An automatic coding system using a FOR TRAN
language and a modified FORTRAN SIT I control panel.

~

like

b. Restrictions, Range: Interpretive £IoaHng point routines with 8 digit
mantissa and 2 digit exponent.
c. Method:

·Does not apply.

d. Storage Requirements:
desIred.
e. Remarks:

One or two passes, depending on optimization

a. Purpose: This program, "Modified Bell Tranalation Program for the IBM
650-653 Magnetic Drum-Core Storage Computer" ill an extension of the
existIng Bell Translation Program for the IBM 650. The purpose of the
Program is to permit the user to translate basic machine language subroutines occuring aa part of a Bell Interpretive program. The program will
properly translate basic machine language instructions that have been
"tagged" f~r the Index Accumulators if they are in the Bell user's region,
while leaving untranslated "taggcd" instructions referring to the Systems area.
b. Restrictions, Range: The program is contained on fifty-two cards of 6
words each, and is placed immediately behind the Bell Translation Program
for the IBM 650, written by Miss Dolores C. Leagus of the Bell Laboratories.
It is punched aa Deck l. Translation is restricted to the range of 0000 to
0999 and thel·e are error- stops provided for overflow and underflow outllide
of this area during translation. Two additional control cards are prOVided
for options in translating instructions referring to Index Accumulators (t. e.
op codes 50's and 80's\. The progralTI functions with the existing Bell
program, not sepa.rate from it.
-

The source progralTI must be correct in every detail.

f. IBM 650 Program:
access storage.

2000 or 4000 word 650 with or without ilTIlTIedIate

c. Method: Translation is accomplished by splitting the i.nstruction oIl into the
Indexing accumulators and branch_ing to 1400+0P. From there to various
lIubroutines to determine if the data address and instrucHon address should

(Continued on next page)

97

be translated or not. Error stops are branches to 9999. and a display and
l"estart procedure is given.
d. Storage Requirements:

FILE NUMBER

650 LIBRARY PROGRAM ABSTRACT

3. 1. 002

Not given.

e. Remarks:
Precautions: Instructions to be translated must be in the range
0000 to 0999. The program is for use with the Bell III Interpretive Program
as it checks for 3 return addresses to Bell I and translates then to the
corresponding Bell III Systems locations. There are no provisions for
RAMAC or tape instructions.
f. Equipment SpeCifications: Basic IBM 650 and 533 card input-output device.
and the 653 Auxiliary IAS unit with 60 words or core storage and 3 lndex
Accumulators.

FiI~PIO.

2. I. 012

SQUAHE HOOT SUBROUTINE

a) Computes the square root of a single-precision fixed-point number.
bl Range:

IBM S5D Library Program Abstracls

1-30-55

G. H. Trimble, Jr.
1B1'1, Houston

O~A;:::. 9999999989. Maximum error is 3.10- 10

c) Newton's method is used.
THREACS

d) LWA is 0030 with 16 words open in the relocatable version.
argument 120 ms. are required.

S. Nakai
Applied Science Dept.
IBM ~ Japan, Ltd.
Tokyo, Japan

e) Both absolute and SOAP relocatable deck listings are included.
f)

a. Purpose: This system is a compiler, which accepts THREACS
instructione which are in three address form and produces 650
inetructione in eymbolic language. These symbolic instrut:tione
can be aaaembled by the etandard SOAP II. Thie system hae two
main advantages. One le that the SOAP eymbolic codes abo can
be directly written in the source program together with THREACS
inetructions for higher ef(iciency and flexibility than other compilers.
The other ie that it is possible to translate a program written in the
LZ interpretive form into a SOAP program.
h.~:

For a random

Alphabetic device if relocatable version is used.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

3. 1. C03

CUBE ROOT

Does not apply.

June 24, 1955

W. K. Pence

Accurat:y: Does not apply.
Floating /Fixed: Both fixed and floating point operations are contained.
c. Mathematical method: Does not apply.

a) Computes the cube root of a single-precision fixed-point number.

d. Storage reguired: This system requires aU of drum etorage.

b) Range
~

O~~.

999999999. Accuracy information not given.

Unknown.

Relocatability: Not relocatable.

c) The method is to make first approximation followed by an iterative formula.

e. Remarks: None.

d) Storage required is 22 locations, 0000 to 0021; the routine may be translated an even number of locations. ReqUires approximately 14.4 + 24n ms.,
where n is the number of iterations.

f. 650 System:

One 533, indexing registers and the floating arithmetic
device are required.

Special device: Alphabetic device.

e) None.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

3. 1. 001

SQUARE ROOT SUBROUTINE

G. E. Collins
IBM, New York

f)

Minimum 650

650 LIBRARY PROGRAM ABSTRACT
3-22-56

a) Computes the square root of a single-precision fixed-point number.

FILE NUMBER

3. 1. 004

EXPONENTIAL

March 28, 1956

S. Fleming
G. E., Schenectady

b) The argument must be such that at least one of the two highest order

digits is non-zero and that the decimal paint must be an even number of
placE'S from the extreme left. All 10 digits of !x are Significant.
c) The method is a table look-up operation followed by two modified
Newtonian iterations.

a) Computes eX for a single-precision fixed-point number.
b) Range: -16.11

 version is used.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

3.1. 014

SINH X AND COSH X
NATURAL LOGARITHM
Barbara Martin

August 8, 1955

Detroit Edison, Detroit

3-26-56

S. Fleming
G. E., Schenectady
a) Computes sinh X or cosh X for a single-precision fixed-point number.
b) Range: 0 < X

< 20

a) Computes In X for a single-precision fixed-point number.
Accuracy information not given.

c) Method is to calculate eX from the subroutine given in Technical Newsletter
No.9, page 50, and then determine sinh or cosh from the standard formulas.

b) kange: 10- 9 ~ X < lOla, Accuracy: error is less than 2 in the 7th decimal.
c) Method not given.

d) Storage required is 62 locations, 0000 to 0061, including the eX subroutine.
The routine may be translated an even number of locations.

d) Storage required is 54 locations, 0000 to 0053,

e) The eX subroutine is not included in the deck listing.

e) None.

f)

f)

Minimum 650.

650 LlBRARY PROGRAM ABSTRACT

FILE NUMBER

3.1. 010

Minimum 650.

650 LIBRARY PROGRAM ABSTRACT

SIN-COS SUBROUTINE

1-30-55

a) Calculates sin X or cos X for a single-precision fixed-point number.

c) Method: 12th power in Taylor series.
No.9, p. 34.

Alphabetic device if relocatable version is used.

7 -27 -55

a) Converts single-precision fixed-point polar coordinates to single-precision
fixed-point cartesian coordinates.
b) Range: r

Running

e) Both absolute and SOAP relocalable deck listings are included.
f)

Barhara Martin
Detroit Edlson, Detroit

Maximum

Reference: Technical Newsletter

d} LWA is 0099 with one word open in the relocatable version.
time is 123 ms.

3.1. 015

POLAR TO CARTESIAN COORDINATES

G. R. Trimble, Jr.
IBM, Houston

b) Range: Forgsin X, -7. 2:2X:27. 2; for cos X, -8. 8 :2X~8.4.
error is 3·10- .

FILE NUMBER

< 100,

0

< Q < 2'11',

c) Method is to use the sln ... cos subroutine in Technical Newsletter No.9,
page 39 and then to use the standard conversion formulas.
d) Storage required is 67 locations, 0000 to 0066, including the sin-cos subroutine. The routine may be translated by an even number of locations,
e) The sIn-cos subroutine is not included in the deck listing.
f)

Minimum 650.

99

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

3.1. 019

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

3.1. 026

FLOATING POINT LOG IAI AND LN IAI
FRATS
(Fast, Relocatable, Arithmetic and Transcendental Subroutines)

Prepared by IBM 650 Applied Programming
G. J. Porter
IBM, New York

W. E. Stewart

a) This subroutine computes Log loA and Ln A utilizing the floating decimal
arithmetic device and indexing register A. This routine has maximum range
and accuracy with running time minimized as much as possible.

a) Provides general utility routines for floating point calculation. The operations
are listed below.

b) Range: IAI > 0

Accuracy: Error < 10- 8
Floating Point
c) Method:

Department of Chemical Engineering
University of Wisconsin
Madison, Wisconsin

A = M x lOP, w,here P is an integer

Multipliers Ai are found such that m = M

b) The routines deal with floating point numbers in the form

T Ai

± (xxXXXXXXXX)
Digits in the 650

The Ai are chosen so that 1 < m < 1. 1
LoglOm is computed by use of a relaxed Taylor series for

L

LoglOAj

Ln A is secured by multiplying Log A by Ln 10
This subroutine uses multipliers in which the sum of the digits is
minimized thus taking advantage of the variable multiplication time
of the 650.

c) Square root is computed by the Newton iteration method, using three iterations.
The exponential fWlction, eX or aX (a ~ 10), is evaluated using a table of y
lOW
at interval 6w
0.1, and a fifth-degree polynomial for interpolationj the 650
table lookup operation is not used. The logarithmic function, In Z, is evaluated

=

=

d) Storage requirements: 100 locations with 15 open.
Speed: Log: 130 m. s.
Ln: -140 m. s.
Relocatable SOAP II cards.

using a seventh-degree expanSion in odd powers of ~:~. Values of y and loglO y

e) Indexing Registers: Indexing register A (B005) is used in this subroutine, thus
the information in A bEjfore entrance into the subroutine is destroyed.

are obtained, by table lookup, from the sametable used for the exponentialiunctlon.

f) 650 equipped with flc!lating point device and indexing registers. The alphabetic
device is also required because of the relocatable (SOAP II) featUre.

d) The complete set of routines occupies 398 locations including temporary
:;;torage, and can be loaded in locations 0001 - 0399 or any 8 consecutive bands on
the drum. The routines are relocatable by SOAP II to any higher region on the
drum, except that the address increment for Natural Logarithm must be evenly
divisible by 50. Any block of routines may be omitted without affecting the others,
except timt Multiply-Add requires Blocks 1 and 2.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

3.1.020

April 1958, Bulletin 18 - 17

FLOATING POINT eA. lOA SINH A, COSH A

Drum Locations Used,
Unrelocated
Total
Lowest Highest Number

Prepared by IBM 650 Applied Programming
G, J, Porter

IBM, New York
a) Subroutine for eA , lOA, Sinh A and Cosh A utilizing the floating decimal
arithmetic device and indexing register A. Maximum accuracy and range have
been secured with reasonable running time and storage requirements,
b) Range: eA: A < 100; lOA: A::: 43.4: Sinh A and Cosh A: IAI < 100
Accuracy: Relative accuracy of 10· B
Floating Point
c) Mathematical methods:
e A : By several reductions A is reduced to the range lA 1< ,054.
A relaxed Taylor series is then used.
lOA; A is multiplied by Ln 10 converting to an exponential function. The method
used in e A is then used.
Sinh A, Cosh A: These are simply extensions of the eA method. For more
detail refer to the program write-up.
d) Speed: e A : 180 m. s.; loA: 185 m. s.; Sinh A and Cosh A: 240 m, s,
Storage: 150 Locations for the entire routine. If only e A and loA are desired,
25 Locations can be omitted. For convenience these 25 are located
at the end of the program.
Input: Relocatable SOAP II cards.
e) Indexing register A is used in the program and is not restored to its original
state. ~r it is necessary to save the contents of this register changes can be
made in the program to accomplish this, These changes are listed in the program
write-up.
f) 650 equipped with floating decimal arithmetic device and indexing registers is
required. The alphabetic device is also required because of the relocatable
(SOAP II) feature.

100

± (X. XXXXXXX) (10",,-50)
Scientific notation

The range of the exponent, xx, is therefore 0 ~ xx ~ 99. Ul'Ulormalized num~
bers may be used as input to any of the routines. Results are normalized, except
in FIX and unnormalized ADD. Given exact, normalized input, the maximum
result error is about ± O. 56 units of the last result digit, except for logarithms
of numbers near unity, which are correct within ± 3 x 1O~1O before normalization
and rounding. Unnormalized input is handled with equal precision, except when
added or used as numerator in division.

Log lO (1+ x), 0< x <.1

Finally, LoglOM = LoglOm -

=

1
1
1
2
1,2
1,2
3
3
4
5
6
1-3
1-4
5,6

ADD (normalized or unnormalized)
76
FLOAT, and set ADD to normalize
S*
FlX, and set ADD to not normalize
S*
59
MULTIPLY
MULTIPLY-ADD, link and
execute
MULTIPLY-ADD, execute only
Divide by S002
Jf-------------\142
DI vide S002 by (k)
\...
Square Root
55
Exponential, eX or aX
0000
0099
75
Natural Logarithm
0063
0149
90
196
0001
0199
0001
0249
24S
0000
0149
150

Jt-------...,C6*

Execution
Time,
Milliseconds

29
20
39
31
64
59
37

32
103
108 for eX
126

• In addition to parent operations.
The aoove execution times do not include access time for factors and exit
instructions. Access time ranges from 0 to 20 milliseconds for random access,
depending on the number of new factors.
e) The invalid~addreBs stops use addresses aoove 9990, and are effective for any
combination of accessories now available. Programs which will utilize these subroutines may be written in symbolic form for SOAP assembly, or coded directly
in machine language.
f) Minimum 650.

April 1958, Bulletin 18

~

18

B - 650

Fileno. 3.1.028
Mathematical Functions

IBM 650 Library Program Abstracts

ARCSIN X, ARCCOS X, SQUARE 'ROOT X

PARABOLIC INTERPOLATION

V. E. Korunan

A. R. Barton, Jr.
J. H. Schenck
Curtiss-Wright Corporation
Propeller Division
Caldwell, New Jersey

CurtiaB~Wright Corporation
Propeller Diviaion
Caldwell, New Jersey

a. Purpose: Computes arcsin X, arccos X. square root X (or a singlcprecision floating point nutnber.

b. Range: Arcsin I Arccos!

- 1

- - Square root!

~

X

.:s

L

Fileno. 3.1.030
Mathematical Functions

IBM 650 Library Program Abstracts

a. Purpose: To interpolate the f(x) value corresponding to a given x value by
fitting a parabola through 3 given points which define the curve on which
f(x) lies. AU valUes must be in normalized floating point form.

Any positive floating point argument.
b. Range: The routine will use any set of numbers supplied.

Accuracy: Maximum error

< L 5 x 10- 7
Accuracy: The region of the curve under consideration must be parabolic,
and the axis o£ symmetry of the assumed parabola must be perpendicular
to the x-axis £01' most accurate results.

Floating/Fixed: Floating.
c. Mathematical Method: Arcsin

I

Arccos:

Square Root:

d. Storage Required:

Polynomial approximation by
Hastings.
First approximation involving
a table look-up followed by
three iterations with Newton' B
formula.

140 locations arc required.

Floating/Fixed: Floating.
c. Mathematical Method: The three given points are used to set up 3 simultaneous linear equations. Solution of these equations yields the equation of
the parabola from which £(x) is calCUlated.
d. Storage Required: 80 locations in 2 adjacent bands plus a previously
defined region K of 6 words are required.

Speed: Approximate running tim.e is 310 rna. for arcsin or arccos, or
~s. for square root.

Speed: Not given.

Relocatability: As written, the 0000, 0050 and 0100 bands are used but
may be relocated an even amount.

Relocatability: Not given.

e. Remarks: SOAP II symbolic and relocatable decks are included. Error
stops are provided for a negative argument for square root routine or an
argument greater than!l for arcsin / arccos routine:

e. Remarks: There are no error stops. It is left to the programmer to
determine if a curve of the form f(x)
a xl + b x + c is applicable and
if the unknown f(x) will lie on the curve defined by the 3 given pOints
before using this routine.

£. 650 System: One 533, automatic floating decimal arithmetic, and indexing
registers are required.

£. 650 System: One 533, automatic floating decim.al arithmetic, and indexing
registers are required.

=

Special Devices: None.

Special Devices: Alphabetic device for SOAP II assembly.

IBM 650 Library Program Abstracts

Fileno. 3.1. 03Z
Mathematical Functions

WISCONSIN FUNDAMENTAL FLOATING - DECIMAL FUNCTION SUBROUTINES

IBM 650 Library Program Abstracts

Fileno.3.1.0Z9
Mathematical Functions

G. W. Struble
Department of Mathematics
Numerical Analysis Laboratory
University of Wisconsin
Madison 6, Wisconsin
Purpose: This program consists of five subroutines designed to evaluate
t'h'C1OTIOwing {unetions: eX, In x, arctan x, sin x or cos x and.rx, where
x is expressed in normalized floating decimal form.

CUBE ROOT X
A. R. Barton, Jr.
CUrtiss-Wright Corporation
Propeller Division
Caldwell, New Jersey

b.

a. Purpose: Computes the cube root of any single-precision noX"rnalized
floating-point number.
b. Range:

Any floating-point argument.

x>O, no restriction, Ixl < (2 Tf)(107), x 2:0.

Variable. but in general the result has seven significant

Floatin~/Fixed:

Floating decimal.

Mathematical Method: The square root subroutine uses a Newton-Raphson
iteration. All others use relaxed polynomial approximations. The
methods were chosen primarily to yield subroutines taking little space
and yet maintaining suitable accuracy and speed.

Floating/Fixed: Floating.

d. Storage Required:

For subroutines given in (a) above, respectively:

< 111.675,

Accuracy:
figures.

Accuracy: Maximum error of one in seventh digit.

c. Mathernatical Method: First approximation is followed by an iterative
formula.

Range:
Ixl

d.

Storage Required: For the subroutines given in (a) above, the number of
storage locations required is, respectively: 41, 57, 48, 56 and Z3.

61 locations are required.

Speed: Average running time is 950 ms.

Speed: For the subroutines given in (a) above, the average computation
~ are, respectively: 158, 147, 175, 156, 130 and 188 milliseconds.

Relocatability: As written, the 0000 and 0050 bands are used but relocation may be made by an even am.ount. (Program is in relocatable SOAP II
fonn.)

Relocatability: The program decks are in relocatable SOAP II form, and
should be relocated an even num.ber of locations to preserve optimization.

e.~

Remarks: Indexing register A is used for eX and arctan x only, but is
reset by the subroutine to its contents upon entry.

None.

f. 650 System.: One 533, automatic floating decimal arithmetic, and indexing
~re required.
Special Devices: None.

f.

IBM 650 System: One 533, indexing registers, and automatic floating
decimal arithmetic feature are required.
Special Devices: Alphabetic device is required.

101

b) Arguments are fixed-point in the form xx. xxxxxxxx; answers are given in
both fixed and floating-point form. Range for sin x and cos x is Ix I < 100; for
sinhxandcoshx, Ixl <5.29;10(x), x<6.32;11(x), x<6.52·1 2 (x), x <6.77;
13('), x<7.15; JO(x) and J3(x), x <7.82, Jl(~)' x <9.62; J 2
x <8.94. The
serIes is summed until the new term is < 10- •

Fileno, 3.1.033
Mathemaucal FuncUons

111M 650 Library Program Abstracts

1.),

PRIME NUMBER GENERATOR

c) Series expansions are used.

J. J. Di Giorgio

New York T(lst Center
New York City

d) Storage required is 150 locations, 0000 to 0149, and may be translated by an
even amount.

Purpose: To generate prime numbers within a given range.
b.

e) None.

Range: 1-324,000.000.
Accuracy: Does not apply.

f)

Minimum 650.

Floating/Fixed: Not given.
Mathematical Method: A number 18 tested for primeness by dividing by all prime

numbers up to the square root of the number tested.
d.

650 LIBRARY PROGRAM ABSTRACT

storage Required: The program 1s stored in the first 200 drum locations. A table
is created from 0200 upwards; depending on the range of numbers desired.

FILE NUMBER

3. 2. 002

IRREGULAR BESSEL FUNCTIONS

Speed: Is a function of the range. For example, program execution time for the
range 30,000 to 31, 000 18 ten minutes.

May, 1956

Julius C. English
Savannah River Laboratory, duPont, Augusta, Georgia

Relocatabllity: Not given.
Remarks: None.

f.

a) Computes In x, Yn(x}, and Kn(x) for n = 0, 1, 2, or 3.

IBM 650 System: Qle 533 reqUired.

Fil,,,I7.

3.1.034

IBM 650 Library Program Abstract.
STANDARDIZED UTILITY DECK OF SUBROUTINES
(SUDS)

c) Series expansions are used.

T. A. Wen
Raytheon Company
Wayland, Mae8.

d) Storage required is 449 locations, 0000 to 0448, and may be translated by
an even amount.

a. Purpose: Computes Sine, Cosine, Tangent. Arcsine, Arctangent, Square
Root, Log, Natural Log, Anti-Log, Anti-Naural-Log, Hyperhollc Sine,
Hyperbolic Cosine. Arcosine, and x-ID-the-y.

e) This program includes W. V. Baxter's routine for sin, cos, sinh, cosh,
In(X} , and In(x), file number 3.2.001.

b. Restrictions) Range:

f)

Floating point througbout, angels in radians.

Minimum 650.

Accuracy generally 7 significant digiti or better.

zit'

Range: Sine Cosine, Tangent
Ixl<
x 107
Arcsine, Arcoaine
Jx~I.O
Arctangent, Squa1>e Root
any
Log, Natural LO'g, x-tC?-the-y J xl"> 0
Anti-Log
x <.49
Anti-Natural-Log
x < UZ.8Z667
Hyperbolic Sine, Hyperbolic
/:!<1411Z.8Z667
Cosine

650 LIBRARY PROGRAM ABSTRACT

3.2.003

AN INTERPRETIVE SUBROUTINE FOR THE ERROR FUNCTION
AND THE COMPLEMENTARY ERROR FUNCTION

c. Method: Square root uses 3 iterations of Newtonls method. All others use
stanclard truncated e,;cision The program is written for the
W010ntls JnterprE"tiv{> Routine described in Technical Newsletter No. 11. Program decks are available upon request from thE' author
f) Minimum 650.

c. Mathematical Method: Finite difference method for unequal spacing,
allowing both over-relaxation and under-relaxation.
d. Storage Required: Full drum storage required.
Speed: Speed is approximately. 35 seconds per interior point per iteration.
Reloeatability: Not relocatable.
e.

~

Program must be reloaded for each new case.

f. 650 System: One 533, indexing registers, and automatic floating
decimal aritlunetic are required.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

4.0.006

Special Devices: None.

ELLIPTIC INTEGRALS

IBM 650 Library PrDgram Abstracts

File no. 4. O. 007
ERRATA/ADDENDA

R. Pexton
R. Carpenter
University of California Radiation Laboratory
Livermore, California

'IRelaxation Program: Laplacets Equation in Rectangular Coordinates, It
by D. Dorfman.

a) Computes complete and incomplete elliptic integrals of the first and second kinds.

The following changes in the deck and listings should be made:

b) The elliptic integrals cantatn two parameters whose ranges arc: 0 S. k S. l' 0;
Os. Q !ii1T /2. k is defined as the modulus and Q is defined as the amplitude of the elliptic
integrals.
Magnitudes of parameters arc cxpressed in floating point notation. The two high order digits
determine the location of the decimal point: XXYYYYYYYY.
i. c.
5010000000"" l' 0
Q Is measured In radians.
The results arc accurate to seven decimal digits when the parameters arc in the foUowing
ranges: 0:$ k:$ '8 and 0:$ Q S. 1·4 (_SOO). Outside this runge, the accuracy decreases,
particularly when both parameters arc close to their upper bounds.
c) Repeated application of Landen's transformation permits one to replace a numerical
integration process with an algebraic expression whose members arc easily produced.
The magnitudes oC the algebraic members rapidly converge to a constant value (0.E!. 1. 0)
and hence only a rew terms arc required for the desired accuracy.
(Continued on next column)

Location

!'!

~

0440
1853
1903

24 1958 0490
24 1954 1857
2.4 1955 1808

24 1958 0194
24 1955 1857
2.4 I954 1808

The following additions should be made to the program write-up:
Restrictions on types of parabolic points:
Experience in using the relaxation programs dictates that parabolic points
should be avoided wherever possible, because account is not taken about
points in the neighboring strips, or the proximity of the boundary.
1£ parabolic paints cannot be avoided:

(Continued on next page)

105

'there is a further restriction on a parabolic point near the upper boundary:
II a paraholic point occurs near the upper boundary, the point following the
.parabolic point cannot have as neighbors any points, either to the right or
left, that fall on the boundary.

parabolic point cannot have as neighbors any pOints, either to the right or
left. that fall onth";b"oundary.
For Example:

For Example:

upper boundary

Not allowed as a parabolic
point. This can be eliminated
by adding the dotted vertical
grid O'r by removing the horizontal
grid on which this point lies.

IBM 650 Li.brary Program Abstracts

This is allowed as a parabolic
point because the following
point has all interior points
as neighbors.

Fift no. 4. O. 008
Differential and Integral Equations

Not allowed as a parabolic
point. This can be eliminated
by adding the dotted vertical
grid or by removing the horizontal
grid on which this point lies.

The development of the finite difference equations in the write-up, equation
3 on top of page 2, holds for radially decreasing I/J values, but since this
is not the case, the equation is actually programmed as:

0/ 0 ~
RELAXATION PROGRAM:
COORDINATE SYSTEM

This is allowed as a
parabolic point because the
following point has all interior
points as neighbors.

dl.llh20/1

+ .II h l0/3) + ailr 2 0/ 2 II
ac

LAPLACE'S EQUATION IN THE CYLINDRICAL

+

bd -

ak{.6.r~

- k( 2 )

+ .6rl0/4

II

+ k6r l )

- 6.rj)

which is correct in the general application.

D. Dorfman
Lycoming Division of AVeO Mfg. Corp.
Gas Turbine Department
Stratford, Connecticut

IBM 650 Library Program Abstracts

Filtno. 4. o. 009
Differential and Integral Equations

a. Purpose: Solves axisymmetric incompressible flow problems with
variables r (radial distances), and h (axial distances) only.
b, Range: An effective field of up to 1500 points can be represented with a
limitation of 900 interior points distributed as follows:
I.
2.
3.

Up
Up
Up
(32

Accuracy:

to 50 radial distances, including boundaries.
to 30 axial distances excluding boundaries.
to 30 interior points along any radial coordinate strip
including the boundaries).
Can be controlled to up to 8 significant digits.

RELAXATION PROGRAM: POISSON'S EQUATION IN RECTANGULAR
COORDINATES
D. Dorfman
Lycoming Division of AVCO Mfg. Corp.
Gas Turbine Department
Stratford, Connecticut
a. Purpose: Solves problems for systems that can be represented by the
Poisson partial differential equation in rectangular coordinates.

Floating/Fixed: Floating.
c. Matheznatical Method: Finite difference method for unequal spacing,
allowing both over-relaxation and under-relaxation.

1.
2.
3.

d. Storage Required: Full drum st;rage required.
Speed: Speed is .45 seconds per interior point per iteration.
Relocatability: Not relocatable.

Special Devices: None.

c. Mathematical Method: Finite difference method for unequal spacing,
allowing both over-relaxation and under-relaxation.
d. Storage Required:

4. O. 008
ERRATA/ADDENDA
FlIt no.

IBM 650 Library Program Abstracts

Full drum storage required.

Speed: Speed is approxiznately .35 seconds per interior point per iteration.
Relocatability: Not relocatable.

Laplace's Equation in the Cylindrical Coordinate System, "

e. Reznarks: Program must be reloaded for each new case.
f. 650 System: One 533, indexing registers, and automatic floating decimal
arithmetic are required.

The following changes in the deck and listings should be made:

1290
1853
1903

Can be controlled up to 8 significant digits.

Floating/Fixed: Floating.

f. 650 System: One 533, indexing registers, and automatic floating decimal
arithmetic are required.

~

Up to 50 vertical distances, including boundaries.
Up to 30 horizontal distances excluding boundaries.
Up to 30 interior points along any of the vertical coordinate
strips (32 including the boundaries).

Accuracy:

e. Remarks! Program must be reloaded for each new case.

"Relaxation Program:
by D. Dorfman.

b. Range: An effective field of up to 1500 points can be represented with a
limitation of 900 interior points distributed as follows:

!=.
24 1958 1340
24 1954 1807
24 1955 1808

Special Devices: None.

~
24 1958 0194
24 1955 1807
24 1954 1808

The following additions should be made to the program write-up:

IBM 650 Library Program Abstracts
IIRelaxation Program:
D. Dorfman.

Filt no. 4. O. 009
ERRAT A/ADDENDA

Poisson's Equation in Rectangular Coordinates," by

Restrictions on types of parabolic points:
Experience in using the relaxation programs dictates that parabolic points
should be avoided wherever possible, because account is not taken about
points in the neighboring strips, or the proximity of the boundary.
If parabolic points cannot be avoided:

There is a further restriction on a parabolic point near the upper boundary!
If a parabolic point occurs near the upper bOW1dary, the point following the
(Continued on next column)

106

The following changes in the deck and listings should be made:
Location
0540
1853
1903

Should Be
24 1958 0590
24 1954 i85'7
24 1955 1808

24 1958 0194
24 1955 'i8"57
24 1954 1808
(Continued on next page)

B - 650
The following additions should be made to the program write-up:

IBM 850 Library PrDgram Abstracts

Fileno. 4.0.011
Differential and Intcgral Equations

Restrictions on types of parabolic points:
Expt.lrience in using the relaxation programs dictates that parabolic
points should be avoided wherever possible, because account is not
taken about points in the neighboring strips, or the proximity of the
boundary.

If parabo:k points cannot be avoid~d:

SOLUTION OF N SIM.ULTANEOUS DIFFERENTIAL EQUATIONS
R. R. Haefner
Savannah River Laboratory
E. L du Pont de Nemours & Co.
Aiken. South Carolina

There is a further restriction on a parabolic point ncar the upper
boundary: If a parabolic point occurs ncar the upper boundary, the
point following the parabolic point cannot have as neighbors any
points, either to the right or left .. ~ll on the boundary.

a. Purpose: This routine is designed to obtain the solution of a sct of
ordinary differential equations ~
Ay, where A is an N x N matrix whose
clements can depend upon the time or upon the components of the vector y.

For Example:

b. Range: N;!; 30.

=

Accuracy: Not given.

upper boundary

Floating/Fixed: Computation is in floating decimal arithmetic.
c. Mathematical Method: 4th order Runge-Kutta and 5th order Milne.
d. Storage Required:

Not allowed as a parabolic
point. This can be eliminated
by adding the dotted vertical
grid or by removing the horiz;ontal
grid on which this point lies.

IBM S5D Library Program Abstract.

This is allowed as a
parab."llic point becaUSe
the following point has
all interior points as
neighbors.

Fileno. 4. O. 010
Differential and Integral Equations

ZOOO storage locations are required.

Speed: 3.9 sec /pt for N = 7
- - 9.5 sec/pt for N = 14
1-1 sec/pt for N = 18

(or - 2.N non-zero matrix clements

Relocatability: Non- relocatable.
e. Remarks: None.
f. 650 System: One 533. automatic floating deeimal arithmetic, and indexing
registers.
Special Devices: None.
Fileno. 4. O. OIZ
Differential and Integral Equation5

NUMERlCAL SOLUTION OF LAPLACE, POISSON. AND HEAT FLOW
EQUATIONS

IBM 650 Library Program Abstracts

J. B. Annable
Jack &: Heintz, Incorporated
Cleveland I, Ohio

NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS WITH
AUTOMATIC ERROR ANALYSIS

a.

~~rL~~l~c;~i: ~~~::::w~~~lhs:~;~yPt:r~~~ :~~::~:~~~i~~~~~~:~t~~:i~:
for a field T, where T is known for the boundaries. The field to be studied
is represented by a grid approximation and T is found for each intersection
by a finite difference approximation E applicable to that point. Output is
both T and the residual at each point.

N. J. Saber
Computation and Data Processing Center
University of Pittsburgh
Pittsburgh 13, Pennsylvania
Purpose: This p%ogram consists of two separate routines for solving
differential equations. One makes use of Runge-Kutta-Gill over the whole
range of integration. The other uses the Milne method as a main process
and uses the Runge-Kutta-Gill as a starting procedure and as an auxiliary
process for changing the mesh size when desired.

b. Range: The size of the field is limited such that T:$ 104; and E :!i: 50.
Accuracy: Not given.
h.

Floating/Fixed: Both input and output data are fixed point form.

The values of the coefficients are determined by an analysis of the properties of the region at each intersection point. The equations are solved for
TO at each pOint by setting RO = 0 and using an iterative process. Convergence is controlled by:

=point

number, n

= number of points

See the program write-up for detailed information.

Floating/Fixed: Floating decimal.
Mathematical Method: The Runge-Kutta-Gill and the Runge-Kutta-GillMilne methods are used.
d.

where m = iteration number, i
O:!i: X:!i 5.

~:

Accuracy: The programmer specifies the number of significant figures
(:!i: 7) he desires when using the Milne method. The routine automatically
checks the truncation error at each step to see that it is not significant
enough to affect the desired accuracy. The routine also checks to see
whether the truncation error is so slight that a significantly larger interval
may better be used.

c. Mathematical Method: The numerical method used, based on a (inite
difference approximation to the partial differential equation, yields
equations of the form:

and

Storage Reguired: The RKG routine requires Z8S storage locations
including printout subroutines. The RKGM routine requires 795 storage
locations including printout subroutines.
~:

Not q:iven.

Relocatability: Not given.
d. Storage Required: The entire drum is used; however, locations may be
used with a consequent decrease in the :maximum valUes of T and E.
Speed: Running time is approximately .4 seconds per point per iteration.

Remarks: The changing of mesh size is done automatically under control
of the program. There also exists a facility for punching out errors involved
at each step. This punchout consists of the round-a£( error at each step
when using RKG and the truncation error at each step when using Milne.

Relocatability: Not given.
e. Remarks: Convergence is not trivial and should be analyzed by a careful
study of the problem to be solved. The convergence of the problem does
not necessarily signify an error to the same number of decimal places as
the convergence criteria specified above. Consequently. the error
analysis is extremely difficult:
f. 650 System: One 533 required.
Special Devices: None.

The routine is written in SOAP II and may be used as an extension for any
SOAP 11 version of the Carnegie Tech Compiler (IT) in the usual automatic
way. However, it may also be used as a Compiler I extension or as a
separate SOAP 11 subroutine. In this case the programmer must make the
{allowing provisionli;
1) Reserve an adequate block of storage.
Z} Insert the subroutine variables into the 1950 read band as indicated
in the write-up.
3) Make the uecessary regional and symbolic address assignments as
indicated by the main program.
(Continued on next page)

107

f.

The printout subroutine used is Compiler Extension 3 and may be used by
any other part of the prograrn by making the usual reference.

d) Storage required is 450 locations, 1200 to 1649. Speed not given.

IBM 650 System: One 533, automatic: floating decimal arithmetic feature,
and indexing registers.

e) It is required that (n+1)(n+b) <1200.
restoring.

The routine is self-loading and self-

Special, Devices: Alphabetic device required.

Minimum 650.

f)

FilenD.

IBM 650 IJbrary Program Abstracts

4.0.013

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

5.1. 003

NUMERICAL SOLUTrON OF DIFFERENTIAL EQUATIONS OR ORDER N

COMPLEX ARITHMETIC MATRIX INVERSION
Dennis M. Sinnett
University of Michigan
Willow Run Laboratories
Computation Department
Ann Arbor, Michigan

a. Purpose:

a) Computes the inverse of a complex matrix up to size 27 x 27 or the solutions
to b systems of lint>ar equations with a common coefficient matrix.

The routine rolves diff",rential equations of order N.

b. Restrictions, Range:
Accuracy:

Tsai H. Lee
Detroit Edison, Detroit

N~6.

b) Matrix elements are fixed-point of the form xx. xxxx xxxx.

Specified by user.

c. Method: Combined Runge-Kutta Milne ITlethod, with an option for
Runge-Kutta solution only.

c) Standard elimination method is used.

d. Storage RC9UireITlents: 620 locations 0100~0720, with 100 or less
stonge locations (000l~0099)depending on the order of the equation.

d) Storage required for the program is 135 locations, 0300 to 0434. Storage
for the complex matrix re quir s 2n2 locations; working storage 2n locations.
Approximate running time is n (.27n ..... 22) sec.

2

e. Remarks:
The user specifies the function to be integrated, its order,
and the initial conditions.

r.

Time: Milne - .2N seconds per point. Runge-Kutta - .6N seconds per
point. Plus- .5 seconds per card punched.

e) None.

IBM 650 System:

f)

Uses index registers and floating decimal arithmetic:.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

5.1. 001

Minimum 650.

650 LIBRARY PROGRAM ABSTRACT

MATRIX INVERSION

FILE NUMBER

5.1. 004

MATRIX-VECTOR MULTIPLICATION
2-28-56

A. O. Garder and J. M. Kibbee

IBM, Houston

a) Inverts matrices of 25th order or less.

July 9, 1956

J. D. Brown
IBM, New York

a) Multiplies a fixed-point, single-precision, square matrix M of order
n ~ 42 by a vector X.

b) Matrix elements are ten-digit fixed-point numbers.
h.' Each partial product is half-adjusted to reduce truncation error.
c) The inverting part of the routine is that of Mr. Dura Sweeney's, and performs Gaussi-ln Elimination using eight-digit floating-point arithmetic.
d) The program with storage space for the ma~ix utilizes essentially the complete drum. For a matrix of order n .00004n (n4-5) hours are reqUired.

c) Does not apply.

d) LWA is 0075 in the relocatablt> version with no words opt'n.
timp rf'quired is (89.1 ... 37. 2n+43. On 2) ms.

Maximum

e) The output consists of the inverse in fixed-point form and ~o figures of
merit which represent the accuracy with which the product of the matrix and
its inverse approximate the unit matrix.
f)

Minimum 650.

f)

Alphabetic devi('e if rl'locatable version is used.
Filt!nQ.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

5.1.002

IBM 650 Library Program Abstracts

5.1.006

Matrix Programs

SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS
EIGENVALUES OF REAL SYMMETRIC MATRICES BY THE JACOBI METHOD

A. O. Garder
IBM, Houston

April 1, 1956

a) Solves b systems of n simultaneous Hnear equations with b righthand sides
and a common coefficient matrix.

K. M. Howell
D. J. Hall
Research Computing Center
Indiana University
Bloomington, Indiana
a. Purpose: This progratn will find the roots and vectors of real symmetric
matrices.

b) Arithmetic is fixed-point form.
b. Range: The program consists of three parts:

c) Method not given.

Part I which finds all roots and vectors of matrices up to 32 x 32;
(Continued on next column)

lOB

(Continued on next page)

B - 650
Floating/Fixed: Fixed decimal arithmetic is used.

Part II which finds all roots only of matrices up to 56 x 56; and
Part Ill, the eigenvector rC6) coefficients
of s-mall powers in the characteristic equation lose significance.
(Continued on next column)

110

FILE NUMBER

5.2.009

DOUBLE PRECISION MA TRlX INVERSION
James D. Chappell
IBM J Washington

December 31, 1956
(Continued on next page)

B - 650
a) Inverts a matrix and solves systems of simultaneous linear equations in
double precision floating point arithmetic, a revision o( 5.2.004 to provide
greater flexibility of input and output and increased speed.
b) Matrices up to 25 x 25 may be inverted and V systems of N eC!.uations may
be solved where 2 (N+l) (N+V) ~ 1300.
c) Method is Gaussian elimination, pivotal elements are selected in order without regard to size.

8. N. Carr
IBM Corporation

a) Inverts matril'es and solvcs simultaneous linear equations. This routine is
more than three times as fast as programs which do not use index registers
and the floating: decimal device.
b) Square matrices, (nxn), can be inverted where n (11 + 1) ~ 1999. Rectangular
arrays, nx (11 + m), can be solved where (n + 1) (n + m};;' 1999. As with any
similar procedure, error due to accumulated roundings may be lar~e.

d) Not relocatable. running time is approximately. 30N 3 seconds.
c) A progressive elimination technique is used to perform the inversion.
e) The program contains its own load and punch routines and is self-restoring.
f)

Minimum 650.

ERRATA

650 Program Library - File No.5. 2.009

d) The entire drum, except 0000, can be used for matrix element storage. For
any matrix, (n + 1) (n + m) consecutive locations arc used starting with 0001.
Immediate access storage is used for the load routine, the inversion program,
and the output routine. The progr.am is not relocatable. The time for inversion
is approximately. 02n 3 seconds. The program contains 32 instructions and 2
constants.
e) 'The inversion program fails if ai, lor any element which takes its place
during the calculation is zero. 'The program is written in machine language.

"D::mble Precision Matrix Inversion, 11 by J. D. Chappell

a 650 equipped with the floating decimal device,
index registers, and immediate access storage.

f) 'This routine requires

The following correction should be made in the detailed write-up:
On page 3, in the paragraph headed "Deck Description, " the last sentence should
read: "The deck consists of 106 cards serially numbered from 001 to 106. "
The program deck 1s correct as distributed.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

5.2.012

April 1958, Bulletin 18 - 45
MATRIX INVERSION ROUTINE 1 (MlR I)

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

5.2.010

K. 8. Williams
University of California Radiation Laboratory
Livermore, California

SYMMETRIC SIMULTANEOUS LINEAR EQUATIONS

a) MIR 1 inverts a matrix of order n or solves b sets of linear equations with
a common coefficient matrix.
H. L. Norman

Servi.ce Bureau Corporation
Washington, D. C.

b) Matrix elements are floating point numbers of the form. XXXXXXXX YY
where Y is the exponent (excess 50) base 10.

a) 'This program will solve tlb tl systems of tin" simultaneous linear equations
conSisting of "b" constant right-hand column vectors with a common symmetric
nxn coefficient matrix and/or solve the determinant of the symmetriccoeHicient
matrix. Both load and punch routines are incorporated in such a way that any
number of systems can be solved with one program setup. By taking advantage
of symmetry, this program is twice as fast as the correspondIng non-symmetric
general solution. Many desirable options are incorporated to increase the
flexibility of the input and output.
b) Both input data and the solutions are in floating decimal point form. 'The
size of the system to be solved is limited such that (n+ b)2 - b~ 1450.
c) Tlw simultaneous equations are solved by the Doolittle method, the b
column vectors of constants considered to be on the right-hand side of the
equation. The determinant is obtained by the product of the diagonal elements
of the diagonali zed matrix.
d) The program uses locations 1451 to 1999 with the exception of 46 scattered
locations. The input matrix occupies locations 0000 to n (n + b) - 1 and the
solution uses locations 0000 to (n + b)2 - b. Calculation time is roughly
. 03 n (n+ b)2 seconds. Loading and punching are at full speed. The program
is not in relocatable form.

c) The method is by Gaussian Elimination.
The programming technique is a modification of one devised by R. W. DeSio.
d) MIR 1 occupies 79 locations from 0000 to 0078. It can be translated to any
desired block of locations by an even amount (using a translating routine supplied
with MIR 1). Approximately 10n 3 milliseconds are required to invert a matrix
assuming average times for floating point operations.
e) Location of the matrix on the drum is arbitrary.
Also, (n + 1) (n + b) 5: 1921. MIR 1 must be loaded with a loading routine, SLR 2,
which is supplied with the program.
f) 650 equipped with indexing accumulators and floating decimal device.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

5.2.013

SYMMETRICAL MATRIX INVERSION
J. Giblin
Detroit Edison Company
Detroit, Michigan

e) 'The coefficient matrix must be symmetric.
f) Minimum 650.

a) Computes the inverse of a symmetrical matrix up to size 54 or inverts and
solves a rectangular system satisfying the inequality n 2 + n(1 + 2b) S 3298,
where b is number of b vectors, with 1900 band open for punch routine.
650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

5.2. all
b) All operations are in floating point arithmetic. Accuracy is that obtained by
conventional elimination techniques.

MATRIX INVERSION AND SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS

Prepared by 650 Applied Programming, IBM, New York
(Continued on next column)

c) The method is based upon standard elimination methods modified to require
knowledge of only the elements on and above the main diagonal.
(Continued on next page)

111

d) Speed is that of fastest standard method to size 12 x 12, but from this paint
the necessarily complex address modification increases running time as n. and
hence the number of iterations. increases.

a) Calculates all the latent roots and vectors of a real but otherwise arbitrary
matrix. All the latent roots and vectors are assumed real.

c) Since the product of a matrix and its transpose is a symmetrical matrix, the

b) Matrix input is assumed to be in floating decimal form. The SIR routine is
used for floating arithmetic operations.

routine can be extended to non-symmetrical matrices to size 54 x 54.
f)

c) The method used is described by Bodewig in "Matrix Calculus, " pages 309-310.

Minimum 650.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

5.2.014

VECTOR BY SYMMETRICAL MATRIX MULTIPLICATION

d) As a guide to time estimation, one iteration for an 8 x 8 matrix requires
approximately 15 seconds. Iterations dominate latent vector computations.
e) Three programs are included:
1. Program I can calculate all the latent roots and vectors of a matrix up to
a maximum size of 20 x 20 (unless round-off errors interfere).

S. Young
Detroit Edison Company
Detroit, Michigan

2. Program D can handle a maximum size of 25 x 25, but will calculate, at
most, seven latent roots and vectors for this maximum siZe.

a) Performs and punches the results of a vector by symmetrical matrix
multiplication.

3. Program DI involves more card handling than the other programs, but
wUI handle a maximum size of 34 x 34 and obtain all 34 latent roots and vectors
(unless round-off errors interfere).

b) Multiplies an n-dimensional vector by an n x n symmetrical matrix, where
n :!i: 45. All operations are in floating point arithmetic.

f) Minimum 650.

April 1958, Bulletin 18 - 27

c) Conventional vector by matrix multiplication methods are used, with modifications such that only those elements of the matrix which lie on or above the diagonal
and the elements of the vector need to be loaded into the machine.

Fife1llJ.

IBM 650 Library Program

5.2.016
ERRATA

d) Speed and storage requirements are dependent on the size of the matrix. In the
case of an n x n matrix, n [~] storage locations are needed to put the matrix
in memory.

"Latent Roots and Vectors of a Matrix," by W. Granet

e) None

The following statement should be added to the write-up as the second
sentence in the second paragraph on page 2:

April 1958, Bulletin 18 - 23

f) Minimum 650.

"This program is not designed to obtain multiple roots."
On page 10 of the write-up following line 14 which reads:

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

5.2.015

"y = 7 minus the remainder when xx is divided by 7, e. g. , for xx
Y " 7 - 3 = 4." the following statement should be added:

= 10,

"When the remainder is zero, y:: 0."

MATRIX INVERSION
J. C. English
F. K. Townsend
E. I. du Pont de Nemours & Co., Inc.
Savannah River Laboratory
Aiken, South Carolina

Fileno.
5.2.0IB
Matrix Programs

IBM 650 Library Program Abstracts

a) Provides a matrix inversion routine with load and punch routines.

EIGENVALUES AND EIGENVECTORS OF A NON-SYMMETRIC SQUARE
MATRIX

b) The routine will invert up to a 40th order matrix. The automatic floating
decimal arithmetic of the 650 is utilized.

H. Klein
D. Dorfman
Lycoming Division of AVCO Mfg. Corp.
Gas Turbine Department
Stratford, Connecticut

c) Gaussian Elimination.

a. Purpose: Determines eigenvalues and eigenvectors for both symmetric and
non-symmetric real square matrices.
b. Range: Maximum size matrix can be of order 24.

e) If a matrix system has b constant vectors, then n + b working storage locations
are required beyond the matrix and vector storage locations. Location 1936
contains zero to prevent optional punch out.
f) 650 with automatic floating decimal device and indexing registers. The alphabetic device is desirable.
April 1958, Bulletin 18 - 25

Accuracy: Accuracy can be controlled up to 7 signiIic.ant digits.
Floating/ Fixed: Floating,
c. Mathematical Method: Iteration and acceleration.
write-up.

References given in the

d. Storage Required: Full drum storage.
Speed: Speed is approximately 15 seconds per iteration during acceleration
for a 24 x 24 matrix.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

5.2.016

LATENT ROOTS AND VECTORS OF A MATRIX
W. Granet
Boston University
Boston, Massachusetts

112

RelocatabiHty: Not given.
e. Remarks: Program is self restoring.

Two types of floating point permitted.

f. 650 System: One 533, indexing registers, and automatic floating decimal
arithmetic are required.

(Continued on next column)

Special Devices: Alphabetic device required,

B - 650
Fif~no.

IBM 650 Library Program Abstracts

5.2.,019

Accuracy:

Matrix Programs

Matrix clements are ten-digit floating decimal numbers.

Floatin~/Fixed;

Floating decimal.

Mathematical Method: The Gauss-Jordan elimination method is used.
Pivotal clements arc selected according to size. Zero clements may
appear on the main diagonal.

GENERAL SIMULTANEOUS EQUATIONS SOLUTION

J. H. Schenck
Curtiss-Wright Corporation
Propeller Division
Caldwell, New Jersey

d.

Storage Required:

The entire drum is used.

~:

The time required for the inversion process is approximately
0.044 n 3 seconds, where n is the order of the system.

a. Purpose: This program solves a series of inhomogeneous simultaneous
equations in floating-point single-precision arithmetic.

. Rclocatability:

Not rclocatable.

b. Range: A maximum of 40 equations may be solved.
Remarks:
Accuracy: Accuracy of solution is indicated by residuals calculated from
~ row of the equation matrix according to Crout's method.
Floating/Fixed:

A matrix check program is included.

IBM 650 System: One 533, indexing registers, and automatic floating
decimal arithmetic feature.

f.

Floating.

c. Mathematical Method:

Crout's method.

d. Storage Required: Requires all of drum, but about 2.00 locations may be
used to develop equations before solution instructions arc cnto!red, or most
of drum may be used to operate on solution after obtained.

Fill: no.
5. Z. 022.
Matrix Programs

IBM 650 Library Program Abstracts

MATRIX mVERSlON WITH ITERATIVE IMPROVEMENT OF ACCURACY
Speed: Speed varies from approximately 30 Illinutes for 40 equations to
about 2 minutes for  7. O. Wllson-Hllferty approximaUon, requiring a table of
Nonnal Probabilities, was used.

d.

Storage Required: EnUre drum Is used.

Mathematical Method: The least squares solution for scale values is used.
Scale values are computed using the normal deviate, the arc sine, and the
logistic transform.
d.

Storage Required: The program uses 1,904 drum storage locations.
Speed: Each subject is processed in approximately 35 seconds. The final
paired comparisons computations for the total group requires approximately
fifteen minutes.

Speech About seven seconds for 20 probability values.
RelocatablUty: Not relocatable.

Relocatability: Not relocatable.

Remarks: Up to twenty proba.bU1tles are packed per output card. The levels at
are calculated can be very easily changed.

WiiiCii1iie probabllitles
Remarks: It is desirable to use the auxiliary checking program to insure
that the input cards are in correct form. This program checks to see that
the cards are in consecutive numerical order and that each item contains
some permutation of the rank orders I to 6. Errors here may produce
misleading results.
f.

f.

Pil. no.

IBM 650 Library Program Abstracta

6. O. 041

Statistical Programs

IBM 650 System: One 533 required.

IBM 650 Library Program Abstracts

Filuo. 6. o. 039
Statistical Programs

SEASONAL ADJUSTMENT OF ECONOMIC TIME SERIES

S. H. Haeeksl
IBM. st. Lwis. Mo.

ORTHOGONAL POLYNOMIAL CURVE FITTER
E. McCauley
J. Kaehler

PUrpose: Tbls program Is designed to isolate aDd. remove the seasonal factor in
~1es.

Wayne State University
DetrOit, MiChigan

.

Purpose: The program fits least square polynomial of i points to degree m.

Range: From five to ten years of monthly data may be adjusted at one Ume.
iiiiieS may be broken down Into ten-year periods and overlapped.

Range:

Accuracy: Does not apply.

b.

b.

IBM 650 System: One 533 required.

Z SiS 99; 1 S m S 19.

Accuracy:

Floatblg/Flxed.: FOR TRANSIT floating decimal mode.

The coefficient output is computed to double precision accuracy.

MathemaUcal Method: Shiskin-Eisenpress.

Floating/Fixed: Input and output are in fixed decimal form.
Least squares curve fitting with orthogonal poly-

Longer

d.

Storage Required: The enUre drwn is used.

c.

Mathematical Method:
nomials.

d.

Storage Required: Program requires approximately 1900 10c!1tions; locations
0900-0999 are reserved for an optional weight computing subroutine.

Relocatabillty: Not given.

Speed: Maximum time for curve fitting is Z5 minutes.

Remarks: The original so\U'ce program was written In FOR TRANSIT. and may
thus be complled OIl the "700 series" machInes.

Relocatability: Not given.

Speed: Ten years of monthly data are processed. in thirty minutes.

f.

IBM 650 System: One 533 required.

Remarks: Three methods IJf weighting may be used:
Speotal Devices: None.
1.

Uniform weights.

Z.

Weights arbitrarily assigned to each point.

3.

Weights as computed by any subroutine not longer than 100 words.

Fire no.

The complete routine consists of three sections:
1.

Curve Fitter

Z.

Discriminator, which selects and evaluates best fitted curve.

IBM 650 Library Program Abstracts

6. O. 042

Statistical Programs

PROGRAM TO CALCULATE SEASONALLY ADJUSTED INDICES

W. Mebl
PrudenUal LIfe Insurance Company
Newark. New Jersey

3.

f.

Evaluator (in SOAP II form) which may be utilized to evaluate any
polynomial (I S m :s 19) from section 1 above.

M.Turln
IBM. New York

IBM 650 System: One 533 required.

a.
Special Devices: Alphabetic device required if re-assembly of SOAP 11
deck is desired.

Purpose: The program ~ll adjust a time series, generally composed of a trend.
cycUcal movement, seasonal variat1ons, and random or irregular Quctu&Uons, to
a fonn that shows primarlly the non-eeaaonaI movements.
(Continued on next page)

123

b.

Range: The program will process series of from 6 years through 21 years duration.
~r1giDal observations may be missing.

Accuracy: Final

FloatlDg/Fbted: Fixed decimal arithmetic.
Mathematical Method: Double precision ari~et1c is used. Computational techniques are those described in Bennet and Franklin. Statistical Analysis in ChemJstry
and the ChemJcallndustry, Wiley, New York.

movmg seasonal indices to 0.1%.

Floattng/F1xed: Fixed decimal arithmetlo is used.
d.

Storage Required: Not given.

c.

Mathematioal Method: The method is a modW.cat1ou. of the B.lreau of Census
MOihOd L

d.

Storage Required: The entire drum 18 used..

RelocatabU1ty: Not given,

Speed.: 10 year serles (120 inptt items) .. approximately 4 minutes.
- - 21 year series (252 inPQ.t items) .. approximately 15 minutes.

Remarks: 1. The ratio of the nwnber of levels in the sample to that in the corresponding
- - - population Is entered as either 0 or 1. That is, finite random models cannot
be analyzed with this program..

Speed: The example problem required about 75 seconds.

RelocatablUty: Not relocatable.
e.

Remarks: Doe to storage space requirements. it is necessary to reload the
iDStnlctiODS with each series to be adjusted.

f.

IBM 650

~,

2. The program may be comlitioned to punch the partial sums and means,
and cell sums of squares and variances.

f.

a.. 533 reqalred.

IBM 650 System: One 533 required.

Special Devices: Alphabetic device required.
File '/10.
6.0,043
BtaUstica.l Programs

IBM 650 Library Program Abstracts

IBM 65D Library Program Abstracts
MINIMAX POLYNOMIAL APPROXIMATION ON A FINITE POINT BET

D.

w.

COMPLETE PAIRED COMPARISONS SCHEDULE
(PARCOPLETwZ w2l)

Marquardt

Mary Anne stormfeltz

Harold Gulliksen
Psychology Department
Princeton University
Princeton, New Jersey

E. I. duPont de Nemours & Co•• Inc.
Wilmington, Delaware

a.

Purpose: To compllte the polynomial of specified degree n which approximates in
set of points (values of some funcUon f (X) on a finite

iiieiiiiiiimax sense to a f1ntte
lnIerval).

b.

Range: Up to 100 values of f(Xl); where the

aeaIreci CD any finite interval.
Degree of polynomial: 1 S n

Fi'",,,. 6. O. 045

x.,. i = I,

2 ••••• N may be spaced 88

a. Purpose: Thls program utilizes input data (rom a paired comparison
questionnaire of 21 objects or leu (with or without the LikewDlslike
aection) and punches out the summary data for each subject and the
scale values. The detail paired comparison matrix may be punched
out or omitted as desired.
•

:s: 12

x.,

Accuracy: Program normalizes range of
to ..l
error. Accuracy is limited only by roUIdoff.

:s: xt

b.

S 1. to mID1mize rOUDJoff

::;~99 ~:~J~:~~Yin !l~~~~~!/~i:;:.: i~:er::l:~~SW::~::;~::h:~~imum
Proportions are rounded to foul' decimals .. The approximation for the
normal deviate, arc slne, and logistic have a maximum discrepancy of
.0005 (or proportions between. 98 and. 02.

Floating/Fixed: FloatlDg decimal arithmetic is used.
Mathematical Method: This program uses the Iterative method of P. C. CUrtis
W. L. Fr8iik, as described in the Preprints of papers presented at the June
1958 meeting oft.he Association for Compating Machinery, pages 23-1 to 23-3.

ana
d.

Storage Required: Most of dl'UDl, all of immediate access storage.

.-5
.-7
.-5

time = 3 min•
time = 5 min.

• -3

N '" 33
N'" 33
N=33
N '" 51

time = 12 min.
"time = 6 min.

Relocatabtltty: Not reloeatable.

IBM 650 System: One 533 (or one on line 407). indexing registers, lAS ami
automatie noatlDg decimal arithmetic feature.
Fjl~nQ.

IBM 650 Library Program Abstracts

6.0.044

input~output.

FihtlO. 6.0.046

IBM 65D Library Program Abstract.
MULTIPLE REGRESSION ANALYSIS

Statistical Programs
Numerical Computation Laboratory
Ohio State University Rellearch Center
Columbus lZ, Ohio

AN ANALYSIS OF VARIANCE PROGRAM FOR THE IBM 650

a. Purpose: This program performs the multiple regression analysis
under the hypotheSiS

J. W. Johnson
Canadian Army Operational Research EstabUsbment
ottawa. Ontario

y

Canada

a.

e. Additional Remarks, Precautions or Restrictions: It is desirable to
use the aWClhary checking program to insure that the input cards are
in correct form. This prOgrarr checks to see that the cards are in
consecutive numerical order and that each item response is a 1 or a
2. Errors here may produce misleading results.
f. Equipment Specifications: It reqUires the minimum ~50 inatallation and
uses the standara 80~go board for eight ten~digU words for the 533

Rental'k8:" Ontpu.t includes: coefficients ofminlmax polynomial. m1nJDlBlI: error
of the apprOXimation, normalization constants. Utility board is used.
f.

d. Storage Requirements, Speed, Relocatability: The analysis program
utilizes 197Z drum locations, and is not relocatable. Depending on

the number of stimuli in the questionnaire the program processes
each subject in about three to 15 seconds and the final paired comparisons
computations for the total group take from One to five minutes.

Speed: Depends upon N. n, and number of Iterations required.
Typical cases:

c. Mathematical Methods: The least squares solution for scale values is
used. Scale values are computed, ualng the normal deviate, the arc
sine, and the logistic transform.

Purpose: This program calculates the analysis of varJ.ance table including the components of variance for crossed, nested, or mixed experiments with three or fewer
factors,

=bl:l) t

b 2 x 2 t· .. + blI

+

bl+ l '

The Xi are the observable Independent variables, the y ill the
observable dependent variable, and the b i , called the regression
coefficientS, are the constants to be elltimated.
b. Range: Not given.
Accuracy: Not given.

b.

Range: The restrictions imposed by use of this program are:
- - qr+rS920
(number of digits in x ) S 10
(number of digits in x2) S 20
The sizes of p and n are restricted only by word size.
The number of replicati.ons must be constant.

Floating/Fixed: All input data must be described by six digit fixed
point numbers of the form XXX. XXX.

r
r

c. Mathematical Method: The method used is a standard one {or
multiple regression analysis. Details are contaIned in the program
writewup.

Accuracy: Double precision arithmetic is used in summing squared terms to preserve

iCciiril"CY.

124

(Contin~ed

on next column)

d. Storage Required: ThiB program utillzes the entire drum and high
speed storage.
(Continued on next page)

B - 650
~:

Not given.

of 5 or less columns each. As many as 6 fields of 10 digits or less may
be tabulated at one time. No total must exceed 10 digits.

Rclocatabitity: Not relocatable.

By punching one control card~controls can be shifted to any columns o!
the card and Helds in any part oC the data card may be tabulated.

e. Remarks: Several sets of y's may be used with the same set of x's.
~cms will be solved simultaneously and separate sets of
solutions for the b i will be obtained. In particular, if

b. Restrictions, R.lnge: S\lmo accumulated must be 10 digits or leos.
Fixed decimal point is used throughout.

I '" maximum number of independent variables
J = maximum number of dependeni variables
K:: 1

c. Method:

+J

it is pOSSIble to solve any problem [or arbirary I and J provided
I t J=K~lOandI~18.
The number of observations which can be accomodated, N, is in
the range I N
9999, subject to the mathematical relltriction
N'> I + 1. -

e. ~

r.

Can be

IBM 650 System:

u~ed

to tabulate fewer than (, Helds If desired.

Runs on minimum 650 equipment.

FilrntJ. 6.0.04/,

IBM 650 IJbrary Program Abstracts

Filrno. 6.0.04'1

IBM 650 IJbrary Program Abstracts

If several separate problems are to be solved, they may be stacked
consecutively.

Does not apply.

d. Storage Requirements: Storage required is approximately 800 locations.
Program is written in one per card SOAP 11 language and can be completely
relocated.
Speed varies from 150 to 200 Input cards per mInute depending
upon the number of fields tabulated.

All punched results will contain Ipecific identification.

This program contains four subroutines; they are used for tracing,
punching. and loading.
!. 650 System: This program utithes the basic 650 and all of the
features of the 653B4 - high IIpeed storage, three indeXing accumulators.
and the automatic floating decimal device.

CALCULATION OF THE AUTO-CORRELATION FUNCTION
AND THE SPECTRAL DENSITY

Mrs. V. D. Mikuteit
Battelle Memorial Inltitute
505 King Avenue
Columbus I, Ohio
a. Puxpose:

This computer program computes the auto-correlation function
The progl'axn is divided into two phases as follows:

~pectral denaity.

Phase I ~ Part t: Calculation of the xnean value, 7
Part 2: Calculation of the auto-corxelation function, Rf{K)

F,leno.6.0.047

IBM 650 IJbrary Program Abstracts

Phase II - Calculation oC the I!rpectral density, Wf(w).
SIMPLE CORRELATION - CORI

The two phases are used independently.
for Phase II.

Numerical Computation Laboratory
Ohio St... te Univer~ity Rellcarch Center
Columbus ll, Ohio

a. Purpose: CORI computes simple correlations between two variables,

~

and Xl' Results include Bums. sums of squares, sums of crossproducts,
means, standard deviation, variance, covariance, correlation coefficient,
and its square.

The output of Phale I is the input

b. Limitations of Program: Range: Phase I - The input data must not exceed
four slgmucant dlgds over the range -1000 < {{t).:;. 1000 where the decimal
point may be arbitrary. The nuxnber of observations (N) mUlt be le811 than
10,000.
Phase II - The range of the discrete variable K xnust be less
than 1350. In general the range of K is defined as O~ K< N/5*.
Accuracy: Phase I - The mean value is calculated to the saxne numbe:r- of
significant digits as the given function. The auto·correlation function is
computed to one more significant figure than the given input.

b. Range: This routine will handle up to 60 variables at a time and compute
up to 427 correlations.
Accuracy: Not given.

Phase II - The spectral density is evaluated to one more
significant figure than the auto-correlahon function.

Floating/Fixed: Fixed point data forms - see write-up for details.
c. Mathematical Method: Formulae are given in the write-up.
c. Mathematical Method:

The computations of CO~ are baaed on the formula:
d. Storage Requirements: Phase I - ApprOXimately 500 drum locations are used.
Phase II - Almost the entire drum is used. Locations 0000-1350
are, however, reserved for storage of input data. For open memory
locations of both phases see the availab_ility tables included in the write-up.
Speed: Computation speed of the coxnputer program is dependent on the
number of input data. Approxirn.ate formulae axe given in the write-up.
Relocatability:

d. Storage Requirements:
Speed:

COR I occupies essentially the entire drum.

Tim~ requiTed for accumulation of sums is approximately {in minutes}

625 (2. Sa

+

The program cannot be relocated.

e. Remarks: NO.le.
f. 650 System: One 533, indexing regIe tel's, floating poInt device, and three
~re xequired.

b)c where a " nUlTIber of variables
b", number of correlations
c :: number of observations

Special Devicel: None

Correlation requires approximately (in seconds)
1.5n, where n is number of correlations.

Fileno. 6.0.050

IBM 650 IJbrary Program Abstracts

Relocatability: Not relocatable.
CALCULATION OF THE CROSS-CORRELATIO~ FUNCTION
AND THE CROSS-SPECTRAL DENSITY

e. ~ See write-up lor restrictions of input deck.

C. 650 System: Minimum 650; no special equipment required.
Fil'n~.

IBM 650 IJbrary Program Abstracts

6. O. 048

Mrs. V. D. Milkuteit
Battelle MelUorial Institute
505 King Avenue
Columbia 1, Ohio
a. Purpose: This computer program computes the cross-correlation function
and the eroso-spectral densi.ty. The program is divided into two phases
as follows:

GENERAL TABULATION PROGRAM

Phase 1 - Calculation of the cross-correlation functions Ruv(K) and Rvu(k).
V. H. Nicholson
Agricultural Marketing Service
U.S. Dept. of Agriculture
Wa shington 25, D. C.

Phase II - Calculation of the cross-spectral density. Wvu(w).
The two phases are used independently.
for Phase II.

a. Purpose:
The purpose of this program is to tabulate any desired field
of 10 digits or less controlling on minor, intermediate, and major fields

(Continued on next column)

b.

The output of Phase 1 is the input

Range: Phase I - The input data lUust not exceed
four Significant digits over the range 0 L. u(t), v(t) t.. 1000 where the
decimal pOint may be arbitl'al'y. The number of observations, N must be

~Q~

(Continued on next page)

125

less than la, 000.

Floating/Fixed: Floating Decimal.

Phase II ~ The range of the discrete variable K must be less than 700.
In general the range of K is defined as 0'::: K::: N Is. >:<

c. Mathematical Method: See program

Timing approximation
l
Input--seconds/observation; V

+ lO - l5
100
Output--seconds/problem ; 0.5 (V)(V-l)
where V '" number of variables.

Phase II _ The cross-spectral density is evaluated to the same significant
figure as the cross-correlation function.
c. Mathematical Method:

write~up.

d. Storage Required: Entire lOOO word drum.

ACCUJ;"acy: Phase I ~ The cro6s~corre1ation function is computed to one
more significant figure than the given input.

Formulae are given in the write-up.

Relocatability: Not relocatable.

d. Storage RequirementB: Phase I - ApproKimately 260 drum locations are
used.

e. Remarks: Original data cardEi may be uEled as input.
vana6leEi reqUire the use of an unpacking routine.

Phase 11 - Approximately the entire drum is used. Locations 0000-1400
are, however, reserved for storage of input data. For open locations
of both phases see availability tables of the write-up.

Eleven or marl)

f. IBM 6S0 System: One 533, lOa a word drum, indexing registera aIld
automatic lloatlDg decimal arithmetic.

~

Computation speed of the program is dependent on the number of
input data. Approximate fo-rmulae are given in the write-up.

Fil~Tlo.

IBM 650 IJbrary Program Abstracts

6.0.053

Relocatability: The program cannot be relocated.
e. Rema:-ks: None.
£. 650 System: One 533, indexing registers, floating point device, and two
tape units are required.

FOUR WAY ANALYSIS OF VARIANCE

Numerical Computation Laboratory
Ohio State University Research Center
Columbus 12, Ohio

Special Devices: None.

Fi/t!Tlo. 6.0.051

IBM 650 IJbrary Program Abstracts

a. Purpose: This routine produces the analysis of variance table as
described in the detailed program write-up. All means on one, two,
three, and four subscripts (i.e., replications are always averaged)
together with estimates for the nlain effects and first and second interaction
effects are computed.

FITTlliG OF DATA TO THE TWO PARAMETER GAMMA DISTRIBUTION
WITH SPECIAL REFERENCE TO RAINFALL DATA

b.

~:

Not given.

Accuracy: Not given.
H. O. Hartley
W. T. Lewish
Computing Group
Statil!ltical Laboratory
Iowa State Univenity
of Science and TeChnology
Ames, Iowa

Floating/Fixed: Fixcd point illput and output.
the error computation.

Included in the output is

c. Mathematical Method: See program write-up.
d. Storage Reguirements:

Locations occupied: 14S0-1999 (859 words)

Speed: Not given.
Rclocatability: Not relocatable.

q

a. Purpose: Calculates the two parameters andJ:,.for the Gamma.
distribution as welI as the mean, vaJ"iance and the covariance.
b.

~:

Remarks: This routine is easily adapted to any bmaller dimensional
analysis of variance, with or without replications. The replication
subscript is always -~-~.

Input - 4 digits or less and leSll than 20,000 observations
Output -lI,~. and i.:S,lOO
Variance and coval"iance scaled I

The program card deck includes the loading and punching subroutines
(and the necessary control cards for these subroutines) which are
used by the program.

Accuracy: If cf:..u~.S77l maximum error q '" 0.0088%
If .S77l

~

u

=- 4

m.aximum error'" 0.0054"1Q

for additional information see reference in the program
description.
Floating/Fixed: AU calc,dations in IixC!d.

[. 650 System: Minimu:m 650, no special equipment is needed.

Filt!"o. 6. O. 054

IBM 650 IJbrary Program Abstracts

c. Mathematical Method: Greenwood and DUmond'EI polynomial approximatlonl!l
to the maximum likelihood method.

TWO VARrABLE LINEAR REGRESSION AND CORRELATION

d. Storage Re9uirementEl: Entire drum (2,000 words).
~

4 digits input data. about 170/min. 3 digits or leu at lOO/min.
Punch loop o{ about l seconds.

Philip J. Kinsler
Oscar Mayer &: Co.
Madison, Wisconsin

e. Remarks! Test example and answers contained in description.

r.

a. Purpose:

IBM 650 System: One 533 required.
Fi/trlo. 6.0.052

IBM 65D IJbrary Program Abstracts

by the method of Least Squares. It also produces the arithmetic mean
and standard dev\attonof each variable, the simple correlation coefficient
and the standard error of estimate about the fitted line. If desired, the
basic summations developed for calculation coefficient and the standard
error of estimate about the fitted line. If desired, the basic summations
developed for calculating these statistics can be punched out.

54 X 54 CORRELATION COEFFICIENTS
b.
James E. Farmer
Computing Center
Wa,hington State University
Pullman, Washington

This program fits a straight Hne:

y; a 1- bX

Restrictions, Range:
Input data are limited to fixed decimal numbers
of no more than 8 digits. The number of observations is essentially
unlimited. (99,999 observations maximum). Output is in floating decimal
notation.

c. Method:

The Method of Least Squares is used for fitting the line.

The

~d deviations are computed as unbiased estimates.

a. Pur'f'.lse: This program provides dmp!e correlation coefficients aIld
related statistics for aU combinations of up to 54 variables. Zero is
consldered as a significant obl!lervation.
b. Range: Maximum number of variables 54. Maximum !!Iize of any
variable is eight digits {pollitive or negative}.
(Continued on next colunm)

126

d. Storage Reguirements: Uses 371 instructions in three·instruction-percard format. Data cards feed at 60 cards per minute. Punch· out occurs
almost immediately after last data card is read. This program is not
relocatable.
e. Remarks:
Program deck includes the Erco Floating Decimal Point Subroutine (650 lile Z. O. 009) and the square root subroutine from the Trimble-

(Continued on next page)

B - 650
Kubic Intel'pretLvc Floating Decimal Point System ([13M Technical
Newsletter No. BI. Bolh o£ thesc subroutines arc mouWeu slir,htly.
f. IBM 650 System:

Floating/Fixed:
c. Method:

Minimum 650.

Floatina point arithmetic is used.

The method of "fitting constants" is used.

d. Storage Requlrementa: The entire ZOOO-word drum is used.
~
Speed is a function of the number of factors and number of levels
within factol's.

Flltn'" 6.0.055

IBM 650 Library PrDgram Abstracts

Rcloeatab1.lity: Not in rc10catable Corm.
MISSING DATA CORRELATION COEFFICIENTS

e. Remarks: 1) Thls routine used IBM 650 Libl'ary Program No. as. Z. OIZ,
--Matri.x Inversion Routine.
l) Special remarkll are contained in the progra.m write-up.

James E. Farm!;!r
Computing C!;!ntel'
Washington State Univel'sity
Pullman, Washington

f. IBM 650 System: Three indexing accumulators and the floating decimal
feature are used In the program.

a. PUl'pose: This progl'am provides simple cOl'l'elation coefficients and
related statistics fol' aU combinations of up to Z3 variables. zlro is
consjdel'ed as a non-significant or missing datum, the zel'o variable
and its pairs are eliminated from the computation for this observation.
The progl'am makes maximum utilization of data not miuing (;I 0).
b. Range: Maximum number of variables hi l3. Maximum size of any
variable is eight digits (positive or negative).
Floatinll/Fixed:

Floating decimal.

d. Storage Required: Entire 2, 000 word drum.
13!V)(V-l)
Speed: Timing approximation: Input--secondlil/observation;'
2.08
Output--seconds 0.75 (V)(V-I)
where V number of variables.

=

Relocatability: Not relocatable.
e. Remarks: Original data cards in any format may be uliled alii input.
Eleven or more variables require the usc of an unpacking routine.
£.

ANALYSIS OF VARIANCE, DISPROPORTIONATE SUBCLASS NUMBERS

Glenn R. Ingram
Assistant Computing Analyst
Washington State University
Pullman, Washington

c. Mathematical Method: See progl'am write-up.

=

Fileno. 6. O. 058

IBM 650 Library Program Abstracts

a. Purpose:
Thls pl'ogram computes the statistics Cor an analysIs of val'iance,
allOwing for dlsproportionate subclass numbers, and assuming that interactions
are zel'o. The analysi.s Is completed, and an F~value given for each factor
tested.
b. Restrictions, Range:
point device.

IBM 650 System: One 533, Z. 000 word drum, indexing registers and
automatic floating decimal arithmetic.

Accuracy:

Not specified.

Floating/Fixed:
Fi~n".

IBM 650 Library Program Abstracts

6.0.056

c. Method:

Floating point arithmetic is used.

The method of "fitting constants" is used.

d. Storage Requirements:
ESSO STEPW[5E REGRESSION PROGRAM

No l'estrictions except those requtl'ed by the floating

The entIre lOOO-word drum Is used.

Speed:. Speed is a function of the number oC factors and number of leveh
within factors.

M. A. Efroymson
Esso Research &: Engineering
Linden, N. J.

e.~

a. Purpose: Computes and prints the F-value, regression coefficients,
standard error Dr coefficients, "A" coefncients, invel'se of variables in
regression and variance of actual and predicated values of dependent variable.

£. IBM 650 System: Three indexing accumulators and the floating decimal
feature are used In the program.

Relocatabtlity:

The equation may contain up to 33 independent variables, and each set oC
data can be assigned a difCerent weight if desired.
Variables enter automatically on basis of goodness of Ht 01' in any desired
preselected order. From one liIet of da.ta, either one or a number of
dlffel'ent regression can be automatically calculated correlating any of the
variables against any group of other variables.
b. Restrictions, Range:
c. Method:

Fil,"0.6.0.059

IBM 650 Library PrDgram Abstracts
ANALYSIS OF VAPtANCE OR COVARIANCE FOR
NON-OR THOGONAL DATA AND FOR ANY STATISTICAL DESIGN

Data are entered in 10 digit fixed points.
John R. Howell
Agricultul'al E:d:

~tical

The computation is done in fixed point arithmetic.

Method:

Refer to "The functions En(x)

=~-xuu-ndu" G.

Placzek. in "Tables of Functions and of Zeros of Functions" National
Bureau of Standa:rds Applied Mathematics Series. 37.
d. Storage Required:

250 locations (0000 through OZ49) are used.
(Continued on next column)

130

FLOATING POINT SQUARE ROOT SUBROUTINE

Charles Goldberg
IBM 650 Applied Progra:mming
Time &: Life Building
New York, New York

a. Purpose: This routine computes the square root of numbers in floating
decimal for:m using an initial approximation an d five iterations with
Newton's method. This program was designed to use a minimum of drum
space.

(Continued on next page)

B - 650
b.

~: This routine accepts floating point numbers of the Corm.
o DDDDDDDDMM.
Answers are in floating point form and all eight
signmeant digitI are exact.

c. Mathematical Method: After taking an initial approximation, Newtonia
method is used to find the square root. With the initial approximation
used, thil method converges to eight lIigniiicant figure. in five iterations.
d. Storage Required: 2.1 Permanent drum locations including a programmed
stop for negative arguments. 3 Temporary storage location8.
Speed:

140 ms.

Lloyd W. Dreher
ComputaUon ClII!ntcr
Unlverslty of Texas
Austin IZ, Texas

a. Purpollc: Thill package of programs 1& deatgned to facilitate arithmetic
operations wLth complex numbers of the form .a+ib.

b. Restricttons" Range:
c.

The deck is in SOAP II form.

e.

~

The routine uses index register B which hi not t'eset.

f. IBM 050 System: This routine requires a 650 with floating decimal
arithmetic device and one index register. An alphabetic device is needed
lor SOAP II assembly.
I'j/",o. 7.0,OIZ

Does not apply.

~

Mathematical Method: All arithmetic operations are performed In
floatlng-poLnt arIthmetic. In some operations a method ol exponent
adjustment Is used to prevent overflow and underflow.

d. Storage Requiremenh:

Drum locations 0000, IZ80 through 1999.

e. Remarks:
The program incorporates a floatlng-decimal aritlunetic
~d a square root subroutine to perform necelsary arUhmetic
operations.
f. IBM 650 System:

Minimum IBM 650.

IBM 650 IJbrary Program Abstracts
Fil."o. 7.0.015

IBM 650 IJbrary Program Abstracts
CLEBSCH -GORDAN COEFFICIENT SUBROUTINE

B. E. Chi
Rensselaer Polyteclmic Institute
Troy, New York

COMPLEX 11
AN INTERPRETIVE PACKAGE FOR COMPLEX ARITHMETIC

a. Purpose:

The subroutine computes the Clebscb-Gordon or vector.
coupling coefficient C(jtiV3 ; mImZm3J or IjlmlJzmz/JlJzjJm3)'

b. Range: h .... jz .... h ~ IS. Accuracy, 2. parts in 8th decimal place.
Input-output is fixed pdnt.
c. Mathematical Method: Not applicable.
d. Storage Required:
305 consecutive locations at'e required.
routine is written in SOAP-U relocatable forma.t.

Loyd W. Dreher
Computation Center
University of Texal
Austin lZ, Texas

The suba. Purpose: This package of programs ia designed to facUitate adthmetic
operations with complex nuni:lera of the form a + i b.

l. IBM 650 System:
requirements).

Minimum 650 with alphabetic unU (minimum SOAP

Fileno.. 7. O. 013

IBM 650 IJbrary Program Abstracts

b.

~.Does

not apply.

c. Mathema.tical Method: AU arithmetic operations are per£ot'med in
floating-point arithmetic. In some operations a method of exponent
adjustment is uled to prevent overflow and underflow.
d. Storage Requiremenh: Dt'um locations 1600 to 1900, cot'e locations
9050 through 9059. Index Register. A. B, and C.

PYRAMID OF RANOMANU
e. Remarks: The program incorporates a floating decimal square root
~e t") extract square roots.

John Burgeson, Robert Bushnell
IBM
340 S. Broadway
Akron 8, Ohi.o

f. 650 System: IBM 050 with core storage, index registet's and floatingpoint device.

a. Purpose: TbiB program generatsa a aet of !!.ndom .!!.2.n-.!!!!,tched ~bers
which span a predetermined t'ange or field aize.

IBM 650 IJbrary Program Abstracts
b. Range: Up to 99,999 numbsra may be generated lor each co:mputer paBS.
Any (leld size from a minimum of (lve "cella" may bs uaed. Normal
UBe of the program cans for a field size of CC columnl 01 (. CC < 99
by 10 row., the "cell." being nu:mbered 000 to 10CC-I.
c. Mathematical Method: Does Dot apply.
d. Storage RequIred: About 600 warda of 650 memory optimally scattered
in lower memory.
~: Depend. on field size uaed and the number of t'a-no-ma-numbera
desired. Usually runs close to lIz punch speed.

Relocatability: The program deck is furnished on SOAPed single lnBtt'uction load card. and Is therefore relocatable by further SOAPing.
e. Re:markl: I. The progt'am is furniahed in SOAP lorm
ficationa :may be made easUy.

80

that modi-

Z. Thia program was desi.gned to give a "dictionary" of
numbers for use in an infot'mation retrieval aystem centering about a
It h pOI sible to generate a let of ra-no-rna-numbers, use them,
then run the program again. obtaining a new and completelY diHerent
set of ra-no~ma-numbcrs. none of which duplicate any number in the
fbat run. For practical applicationa. this pt'ocess can repeat itself indeHni.tely.

108.

f.

IBM 650 System: Mi.nimum 650.

I'iII1l0.7.0.016

SYMBC'LIC INTERPRETIVE SYSTEM FOR THE IBM 650 - 653
(REAL AND COMPLEX ARITHMETIC)
ISIS)
Toru Takeshita
Applied Science
IBM Japan
Tokyo. Japan
a. Purpose: This system Is an ~ - interpreter processor, which
accepts a program written in symbolic synthetic language and performa
the actual computation in a single machine pass. The symbolic commands
are translated into their nu:meric equivalences while being loaded. To
facilitate debugging, the symbolic commands (originally wrltten in the
coding Iheets) are reproduced in the traCing outputs. Complex arithmetic
and machine language operations can be included by uBlng mode change
commands.
b. Range: Depends on the operation being performed.
Accuracy: Depends on the operation being pet'lormed.
Floating/Fixed: Computation il normally performed in floating point
arithmetic, but a command for fixed point additiD.n-subtraction is included.
c. Mathematical Method: The built-in subroutines Cot' sine. cosine. arctan,
expo and log. junctions adopted from the "050 Rocket Package" and the
modified version of Sweeney's "SQUARE ROOT X" are prOVided.

Fjlu".7.0.014

IBM 650 IJbrary Program Abstracts

COMPLEX I
AN INTERPRETIVE PACKAGE FOR COMPLEX ARITHMETIC
(Column on next column)

d. Storage Requirements: The SIS system program occupies the dru:m
locations above 1000 and the remainder (1000 locationa) are available for
an SIS programmer.
Speed: The Loading ~ Assembly speed is 150 - ZOO c.p.m. The computing
speeds are several times faster than those (or the Bell L2.'
Retocatability: The system program is not relocatable, but library routines
are relocated when loaded.
(Continued on next page)

131

e. Remarks: This system was specially designed for small- and intermediatesize problems of non-repetitive nature in science and engineering, and, for
such problems, can reduce the overall cost of programming and machine
operation to a greater extent than the FOR TRANSIT system.

e.

IBM 650 System: IBM 650 with alphabetic device, one 533, automatic
floating decimal, lAS, indexing registers.

f.

~None

f. IBM 650 System:

One 533, indexing registers and automatic floating decimal
arithmetic are required.
~~~ Alphabetic device and 10 additional pilot selectors are

Fileno,7.0.019

IBM 650 Library Program Abstracts

required; the latter are not absolutely essential.
Tiltlno.7.0.017

IBM 650 Library Program Abstracts

IBM 650 PROGRAM FOR THE ANALYSIS OF
TWO-LEVEL FACTORIAL DESIGNS

Mal'garet Younge Kreig
Leslie Zul'ick
The Brown University Computing Laboratory
Box 1885
Providence Il, R. I.

pRESENT VALUE AND RATE OF RETURN
(PVIA)
(INFINITE CHAIN OF MACHINES)

a. Purpose: IBM 650 Program for the analysis of Two-Level Factorial
Designs.
Martin B. Solomon, Jr.
University of Kentucky
Lexington, Kentucky

b. Range:

Fixed point, 5 digit data.

c. Mathematical Method: Methoq, based on Yates' algoritiun, developed in
collaboration with Mr. Cuthbert Daniel.
'

a. Purpose: Will compute the present value of an investment at the end

d. Storage Required;

of each year of its useful life and the discounted rate of return over the
whole life. It assumes an infinite chain of replacements.
b.~:

Life can range from 1 to 50 years.

Accuracy: Present value to eight significant digits.

Rate of return to

Does not apply.

Speed: Timing: About three minutes requil'ed by basic program for a 16
run experiments with eight cases taken out. The graph program requires
about four minutes for the same experiment.
e. Remarks:

None.

t~mals.

f. IBM 650 System:

Basic IBM 650

Floating/Fixed: Floating Point generally, although a few input and
output figures are fixed point.

\

Mathematical Method: PV

~

- EI

{l+r}

d. Storage Required:
drum.

RZ - El

=- - + - - +

Speed: Computes present value in a few seconds. Rate of return is
computed by successive approximations. Requires about 6 seconds for each
percent computed.
Relocatability:

Remarks:

8.1. 001

OPTICAL RA Y TRACING

Dale 1. Raar
IBM, Detroit

November 29, 1955

Not relocatable.

e. IBM 650 System: IBM 650 with alphabetic device, one 533, automatic
floating decimal, lAS, indexing registers.

f.

FILE NUMBER

650 LlBRARY PROGRAM ABSTRACT

(ltr)l

Optimized by SOAP II so program is scattered throughdUt

None

a) Determines the path of a beam of light as it passes through an optical
system consisting of a number of different media with spherical boundaries.
b) Arithmetic Is fixed-point in the form xx. xxxx xxxx. Any size system may
be traced.

Fileno. 7.0.018

IBM 650 Library Program Abstracts

c} The standard formulas for refraction are used.
d) Approximately 300 locations are used for the program. Time required is
less than one second per surface.

PRESENT VALUE AND RATE OF RETURN
(PVlA)
(FOR A FINITE CHAIN OF ONE INVESTMENT SING LE MACHINE HORIZON)

e) All rays are considered to be skew.
f)

Minimum 650.

Martin B. S')\omon, Jr.
University of Kentucky
Lexington, Kentucky

IBM 650 Library Program Abstracts
a. Purpose: Will compute the present value of an investment at the end of
each year of its useful life and the discounted rate of return over the
whole life.
b. Range:

Life can range from 1 to 50 years.

Accuracy: Present value to eight Significant digits.
three decimals.

d. Storage Required:
throughout drum.

R\ - El
PV:: - (Itr)

Rl - E2

+-- +
(1+r)l

--;c---c
(1+ r)n

Optimized by SOAP II so program is scattered

~:

COIllputes Present Value in a few seconds. Rate of return is
computed by successive appr')xiIllations. Requires about 6 seconds for
each percent computed.
Relocatability:

Not relocatable.

TRANSIENT HEAT TRANSFER PROGRAM
J. T. Anderson
Meeh. Eng'g, Dept.
West Virginia University
West Virginia

Rate of return to

Floating/Fixed: Floating Point generally, although a few input and output
figures are fixed point.

c. Mathematical Method:

Fileno.8.1.00l

(Continued on next column)

K. W. Cheng
Mecb. Eng'g, Dept.
Tulane University
W. Nettleton
Computer Center
Tulane University

a. Purpose: Transient Heat Transfer Program to find the temperatures in
complex, composite geometrical bodies, as function to time and location.
The geometry is broken into up to 100 nodes, in two or thl'ee demensions,
and input data on each node allows the program to assemble in eqns. in
unknowns for each time step of the transient, using the backward tilne step,
which insures convergence of the system for Gauss Seidell iteration
regardless of the length of time step. Up to four materials, each having
properties as functions of temperature and five sets of boundary conditions.
each as function of time, may be used. Program h"ndles conduction,

(Continued on next page)

132

B - 650
convection, internaL generation and thermal storage. The program
calculates the surface areas and volumes of regular nodes automatically.
Techniques for extending the usc of the program are easy to apply
because of the general form of input, e. g. contact coeHieients may be
taken into account using the concept of an irregular node. Steady state
temperature distributions are easily found using the program.
b. RanGe: Program will handle almost any problem which can be described
in 100 nodes or less, while accuracy dependa upon the amount of truncation
in setting up the nodes and time ateps, it can easily be held to under 2'1t

c.

Mathematical Method: Gauss-Seidell iteration was chollen because of the
inherent speed and small storage requirements as opposed to the time and
s~orage required for matrix inversion.

d.

Storage Requireme~ Storage of about 2000 words on the drum plus up
4000 words on magnetic tape arc needed. Machine time for 7 node
problem with 30 time steps is about 20 minutes. Time increases linearly
wlth number of nodes and number of time steps, assuining reasonable rates
of convergence, i. e. 5 sweeps per time step.

650 LIBRARY PROGRAM ABSTRACT

8.2.001

R. Stuart.
University of California Radiation Laboratory, Livermore, California

a) Solves the one-dimensional neutron diffusion equation. The multi-group
diffusion equasion is solved for the case of a sphere, a.cyHnder, and a slab.
b) A maximum of three different material regions and eighteen groups can be
handled. Fixed decimal arithmetic is used.
c) The method is an iterative process.

e. Remarks: Modifications were made to the object program to incorporate
a tape unit.
f. iBM 650 System: For Transit n was used for computing, on an
augmented lBM-650 with 533 card reader and punch and one 727
magnetic tape unit.

FILE NUMBER

MOONSHINE

d) The entire drum is required. Total running time, using all eighteen energy
groups, is about thirteen minutes.
e) Two or three iterations are usually needed for a solution.

Filt1lo.8.1.003

IBM 650 Library Program Abstracts

f)

Minimum 650.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

8.2.002

A RAY TRACING PROGRAM

PARACANTOR
J. May
Columbia University
Hudson Laboratories
Dobbs Ferry, N. Y.

s.

P. Stone
University of California Radiation Laboratory, Livermore, California

a. Purpose: Traces the path of a ray in a layered inhomogenious medium
with regular boundries.
b. Range: Maximum of 48 dif{erent Velocity points.
Floating/Fixed

Floating Point Arithmetic

a) Paracantor 1 is a two energy groupo, two region, time independent reactor
code, which obtains a closed solution for a critical reactor assembly for cylindrical reactors of finite length and with a radical reflector of finite thickness.
Paracantor 11 computE's thE' fluxes, including the adjoint fluxes, from the output
of Paracantor I.
b) Floating-point arithmetic is used.

c. Mathematical Method: Snell's law ill used at the boundries between
layers. See L. Gardner, Hudson Laboratories Technical Report No. 47
dated June 4, 1957.

c) The method, in general, fonows the two energy group theory found in The
Elements of Nuclear Reactor Theory by Glasstone and Edlund.

d. Storage Required: Approximately 150 unused drum locations.
Speed: Depends upon number of layers.

Up to 100 points per minute.

d) The entire drum is required. The average running time for Paracantor I
is 5 to 8 minutes; for Paracantor II 5 minutes.

Relocatability: Not relocatable.

e) The program contains all of the load, punch, and interpretive routil1;es,
tables, and miscellaneous constants necessary for running.

e. Remarks: None.
f. Special Devices: Automatic Floating Point, Three Indexing Registers.

f)

Minimum 650.

';14 M. 8.1.004

IBM 650 Librar( Program Abstracts
850 LIBRARY PROGRAM ABSTRACT
SOLUTION OF HEAT DIFFUSION EQUATION

R. R. Haefner
Theoretical Physics Division
E. I. du Pont de Nemours & Co.
Savannah River Laboratory
Aiken, S. C.

FILE NUMBER

8.2.003

ONE-SPACE-DIMENSIONAL MULTIGROUP

G. J. Habetler and V. A. Walbran
GE, Knolls Atomic Power Lab, Schenectady

December 1, 1956

a) Solves the one-space-dlmension mulUgroup formulas.
a. Purpose: Equations and a routine are presented to obtain the temperature
distribution in a section of a tubular holat source. The solution of the
heat diffusion equation in (r ....... ) geometry is approximated by the solution
of a set of appropriate difference equations. Three regions with possible
differences in heat conductivity or heat source are allowed in the radial
direction, e. g., inner cladding, fuel, and outer cladding. Heat is
transferred to a hulk coolant at each radial surface. The program can
be used to study the effects of nonbonding between regions an4 of
inhomogeneities in the surface heat transfer and in the 00 at source.
b.

~

Floating.

e.~;

2000 locations.

Speed depends on number of

Not given.

f. IBM 650 System:

c) The method is described in a 43 page paper which is supplied with the
write-up and listing.
d) The entire drum is used. Timing is from 20 seconds to one minute per
group for a 40-point mesh, depending on the choice of input data.

c. Mathematical Method: Not given.
d. Storage Rcquirements:
grid points used.

b) Input is in fixed decimal form. Approximately 50 groups, each of a 50
point mesh, may be handled. The exact range of the many variables is given
in the write-up.

Model 2 with Floating decilnal &. index registers.

e) The program is divided into two parts, the Multigroup Calculation and the
Power Calculation. Allowance has been made for variations in geometry,
boundary conditions, and handling of scattering cross sections.
f)

Minimum 650.

133

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

8.2.004

LOST, A CROSS-SECTION AVERAGING PROGRAM

C. J. Hibbert
G.E., Knolls Atomic Power Laboratory, Schenectady

a) Computes cross-section integrals over specified lethargy groups.
b) Input is in floating-point form.
200.

650 LIBRARY PROGRAM ABllTRACT

FILE NUMBER 8.2.007

LIL ABNER: A FEW-GROUP ONE-DIMENSIONAL CODE

H.Bohl
G.Gelbard
R. Suarez
Westinghouse Electric Corp., Pittsburgh, Pa.

The maximum number of lethargy points is
a) Lil Abner is a one-to-eight group code designed, primarily, to treat
one-dimensional rSactor and cell problems.

c) Integrations are performed using the trapezoidal rule.

b} This code will handle a maximum of ten regions and one hundred mesh

d) Storage required for the program is 424 locations, 1571 to 1994. The rest
of the drum is used for data storage. Time required for a t.ypical compostion
with six materials and selC-shielding for 170 point and 15 point files is 12.5
minutes and 1. 24 minutes respectively.

c) The method is an iterative process,

points,

e) The program distinquishes between the absorption of moderator or noofissionable materials and those of fissionable or associated fission product
materials.
f)

Minimum 650.

Floating pOint arithmetic is used.

d) None.
e) All physical parameters in the Few-Group equations as well as the mesh
width must be constant within each region. In the fast groups these
parameters may be obtained directly from MUFT III (8. 2, 006) calculations
or from microscopic cross sections fitted to match MUFT III results.
Sample problem is enclosed,
f) Minimum 650,

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER 8.2.005
650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

8.2.008

DONATE
K-CODE

Harvey Amster and
Roland Suarez
Westinghouse Bettis Plant, Pittsburgh Pa,

May 1956

a) Distribution of neutrons at thermal energi.es - a solution for the energy
distribution of neutrons in equilibrium with an infinite homogeneous medium
of pure monatomic hydrogen undergoing thermal motion. Allowing varying
cross sections, elements other than hydrogen and a buckling turn for leakage
from a finite volume.

W. V. Baxter
Savannah River Laboratory, du Pont, Augusta, Georgia

December, 1955

a) Obtains the transients of neutron flux in response to a change in the reactivity of a reactor.
b) Eleven delayed groups of neutrons and two power' coeffiCients of different
relaxation times are allowed. FloatLng decimal arithmetic is used,

c) Theoretical treatment is given in a paper by H. D. Brown, submitted for
the journal uNuclear Science and Engineering" under the title, "A General
Treatment of Flux TranSients. "

b) Floating point.
c) Milne's Predictor-corrector formulas,
3 point Lagrangian interpolation,
5 and 8 point integration formulas.

d) Storage required is approximately 1800 locations. One time increment
requires 30 seconds.

d) 3 runs,
e) None,

e) A very general change in reactivity as a function of time can be made by
proper input parameters. The set of differential equations is solved by lntegraticn of the associated difference equations.

f) Minimum 650.

'f) Minimum 650.
650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER 8.2.006
650 LIBRARY PROGRAM ABSTRACT

MUFTUI

R. L. Hellens
R. W. Long, and
B.H. Mount
Westinghouse Electric Corp., Pittsburgh, Pa.

July 1956

FILE NUMBER

8.2.009

BEEffiVE AND HORNET
REACTOR CODES FOR SPHERICAL GEOMETRY

S. P. Stone (Beehive)
S. p, Stone and R, Shaffer (Hornet)
University of California Radiation Laboratory
Livermore, California

a) Computes the energy distribution of neutrons having a given FaudeI' mode

in an infinite medium,
b) Four approximations are provided with the inclusion of isotropic inelastic
scattering, resonance capture, and fast fission. Fixed point arithmetic
is used.

a) "Beehive',' is a five energy group, two region, time independent, spherical
reactor code, It considers the problem of a reactor system in which the core
material is assumed to be at a higher energy (temperature) than the reflector
material. The companion code, "Hornet," computes the neutron fluxes for the
critical assembly determined by the Beehive calculations.

c) The output includes flux, current, and slowing density spectra and computes
the fast constants for a variety of few group schemes.

b) The majority of arithmetic is performed in interpretive floating point.

d) Solution requires two runs through the computer. The entire drum is used.
e) Twenty is the maximum number of elements that can be used as input for
anyone problem.
f) Minimum

134

6~0.

c) The code obtains a closed solution fOr the critical reactor assembly by a
procedure which is a logical extension of normal two group theory. The
solution is obtained by an iterative process,
(Continued on next page)

B - 650
d) Storage: 2, 000 words. Speed: "Beehive" requires 2-1/2 minutes per
iteration, and 5 or 6 iterations. "Hornet" requires 7 minutes.

650 LIBRARY PROGRAM ABSTRACT

e) Only a preliminary investigation has been made Cor cases where the
G/2 2-5 spacing is "close," a situation in which the critical 10 x 10
determinant evaluation might be subject to error.

FILE NUMBER

8.2.013

VA LPROD
C. M. Whlte
GE, Vallecitos Atomic Laboratory
Pleasanton, California

r) Minimum 650.
a) Once dimensional reactor flux calculation for slab. cylinder, and sphere.
it is too complex for this

~~st~:cet~ point, Range is discussed in the report;
650 LIBRARY PROGRAM ABSTRACT

B. 2. 010

FILE NUMBER

UNCLE I

c) TWs is PROD 1I in a form more convenient for usc. PROD 1I is described in
abstract 8.2.003. References are KAPL-1415, KAPL-1531. and GEAP-0952
d) Full 2000 words of drum. Non~relocatablc.
.
e) None.
f) Minimum 650.

THE DIFFUSION EQUATION IN CYLINDRICAL GEOMETRY
R. R. Haefner

E. I. du Pont de Nemours & Co., Inc.
Savannah River Laboratory,
Aiken, S. C.
a) UNCLE 1 - Solution of the Neutron Diffusion Equation in Cylindrical Geometry.
b) Uses network of g points in the r-direction and 16 in the z-direction. Fixed
decimal.
c) Extrapolated Liebmann Method.
d) 20 scconds pel' iteration.
e) One group only.
f) Minimum 650.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

B. 2. on

UNCLE II
THE DIFFUSION EQUATION IN (x, y) SPACE

ADDENDA/ERRATA

650 Library Program - File No.8. 2. 013

"ValPROD," by C. M. White

The program write-up for ValPROD has been amended by the inclusion of two
memoranda supplied by the original contributors. The first of these dated
June 18, 1957, deals with a reviSion of the program designated ValPROD II'
the ot.her, dated January 15, 1958, discusses in detail several coding erro;s
;contruned in ValPROD I and ValPROD II. Program decks for the revised programs
are designated ValPROD IB and ValPROD ITB.
AEC cont.ractors and other 650 users concerned with nuclear reactor problems
may obtam the amended program material in the usual manner.

R. R. Haefner
E. I. du Pont de Nemours & Co., Inc.
Savannah River Laboratory,
Aiken, S. C.

a) UNCLE II

~

April 1958, Bulletin 18

~

51

Solution of the Neutron Diffusion Equation in (x, y) Space.
650 LIBRARY PROGRAM ABSTRACT

b) Uses network of 9 points in the x-direction and 16 in the y-direction.
Fixed decimal.

FILE NUMBER

8.2.014

P-3 FLUX DISTRIBUTION

J. W. Wen
P. Cabral
GE Atomic Power Equipment Dept.
San Jose, California

c) Extrapolated Liebmann Method.

d} 20 seconds per iteration.
e) One group only . ..!.1..=0 at x = 0 is a restriction on the types of problems
that can be SOlved. () x

As the program for UNCLE II is the same as that for UNCLE I with a few
exceptions, the write-up for UNCLE II does not include a complete listing
of the program instructions, but only the exceptions. A complete listing is
included in the UNCLE I write-up.

a) This code computes the one-velocity neutron flux distribution in concentric cylindrical
geometry using a P3 spherical harmonics approximation to the neutron tran:>port equation.
Anisotropic scattering is included and each region may have different properties and may
or may not have a neutron source. The propertics of anyone region and a source in that
region must remain constant throughout the region.
b) There is no limit to thc number of concentric cylindrical regions which can be handled.
The codc operates in floating point interpretive mode.
c) The P-J Flux Code is an analytic solution of the P3 flux probl(~m. Details of the code
have been published through the American Nuclear Society. Further information may be
obtained from KAPL 1173 (Secret).

f) Minimum 650.

d) The program occupies Virtually the entire 2000 word drum and is thus not relocatable.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

8.2.012

e) Thc following difficultics have been observed but do not limit thc normal utiliZation of
the code.

UNCLE 1lI
THE DIFFUSION EQUATION IN ONE DIMENSION
R. R. Haefner
E. 1. du Pont de Nemours & Co., Inc.
Savannah River Laboratory.
Aiken, S. C.

Regions of high cross section at large radii will cause a machine stop bceause
the calculated Bessel functions become too large for the floating point
representation.
iI)

11i)

a)
b)
c)
d)
e)

UNCLE ill - Solution of the Neutron Diffusion Equation in One DimenSion.
Uses network of K + 1 points, K'" 36. Fixed decimal.
Extrapolated Liebmann Method.
Time required: 0.16 K seconds/Iteration.
One group only.
f) Minimum 650.

Regions of small cross sections which do not include the origin will cause
difficulty. This is most easily recognized by irrcgularities in the resulting
fluxes.
The code will not handlc regions with zero absorption. The inscrtion of a small
absorption cross section will, howcver, not affcct the flux distribution and will
permit the code to operate.

The P~3 Flux Code will automatically compute the neutron flux distributions throughout the
regions in the problem (the number of points computed is controllable) and will also provide
average fluxes in each region.
f) Minimum 650.

135

Fileno. 8. Z. 014

IBM GSD Library Program

ERRATA

IBM GSD Library Prog,.am Abstracts

lip _ 3 Flux Distribution," by J. W. Well and P. Cabral

UNCLE IV

Part I of the P - 3 program deck originally furnished to the library was
discovered to contain erroneous multiple punches in column 70 in several
cards. A number of copies of the deck were furnished to 650 installations
before the errors were noted. Accordingly, it is recommended that any
decks obtained from the library prior to August I, 1958 be replaced. Decks
mailed on or after that date have been corrected.

W. V. Baxter
E. I. du Pont de Nemours &: Company, Inc.
Savannah River Laboratory
Aiken, South Carolina

April 1958, Bulletin 18 - 31

Fikno.

Physical

S.Z.ors
Sci~llcea

a. Purpose: One Dimensional Solution of the Neutron Diffusion Equation in
Cylindrical Geometry.
b. Range: Uses 64 lattice spaces in 1 to 6 radial regions. Can obtain
~ity by varying B2 in all or in anyone of 6 regions, or by varying
the radius of any region.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

8.2.016

Accuracy: Not given.
Floating/Fixed: Fixed decimal.
c. Mathematical Method: Integration of a difference equa.tion.

BALL
A REACTOR CODE FOR SPHEmCAL GEOMETRY

d. Storage Required: 750 locations.
Speed: 3 minutes per problem.

S. P. Stone
T. B. Kerr
University of California

Relocatability: Not given.
e. Remarks: One group only.

Radiation Laboratory

livermore, CaHfornia

f. 650 System: One S33 required.

a) Ball is a two-energy-group, two-region, time-independent reactor code. It
obtains a closed solution for a crit1cal reactor assembly of spherical geometry,
and also computes the normal and adjoint fluxes.

Special Devices: None.

b) Floating point. Accuracy is dependent on input data.
c) Iterative solution.
d) Approximately 1,700 storage locations are used. A typical problem requires
eight to ten iterations and takes approxImately 2 1/2 minutes.

IBM GSD Library Program Abstracts

Fileno. 8.2.019
Physical Sciences

ARMOUR REACTOR KINETICS (ARK-I) CODE

e) None

T. Engelhart
W. E. Loewe
Armour Research Foundation of
Dlinois Institute of Technology
Chicago 16, illinois

f) Minimum 650.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

8.2.017

NED

D. B. MacMillan
GE Knolls Atomic Power Laboratory
Schenectady, New York
a) NED is a 650 program for computing the Wigner-Wilkl.ns kernel (reference:
AECD 2275).

b) The value of the kernel is computed in fixed point arithmetic at the points of
an N by N mesh, where N may not exceed. 34. Accuracy of 5 to 7 decimal places
is obtained; see the write-up for a more specific statement.
c) The numbers are computed in parallel, or parameter study, style.

a. Purpose: This routine is used to obtain the transient~ of neutron flux in
~ to a change in reactivity of a nuclear reactor. The routine is a
modification of the Savannah River Laboratory K-code (IBM 650 Library
Program 8.02.008), from which it differs in the following respects: (I)
driven changes in reactivity remain arbitrary functions of time, but must
occur as a result of a cbange in the average neutron absorption cross
section; (2) temperature coefficients are restricted to those affecting
r'ak .. ; (3) the feedback equations are slightly more general; and (4) a
substantial savings in running time is realized. This last difference
results from the fact that integration is accomplished by a fourth order
Runge-Kutta technique.
b. Range: Six delayed groups of neutrons and two reactivity feedba.ck loops
are allowed.
Accuracy: Not given.
Floating/Fixed: Computation is in the floa.ting decimal mode as described
by G. R. Trimble in Technical Newaletter 8, pp. 37 - 4j.
c. Mathematical Method: Integration is accomplished by the fourth order
Runge-Kutta.
d. Storage Required: Approximately 193.0 storage locations are required.
Speed: A representative problem using the full program takes about I hour+

d) The program uses the whole drum and is not relocatable. For H moderator,
sample calculations required 4minutes. For B,e moderator, sample calculations.
required

fa

Relocatability: Not relocatable.
e. Remarks: Recipes are provided to reduce to several special cases of
physical interest. D~rections are given to allow addition of one more
feedback loop.

minutes.

f. 650 System: One 533 required.

e) None.

Special Devices: None.

f) Minimum 650.

136

April 1958, Bulletin 18 - 33

B - 650
. Fileno.

IBM 1i511 Library Program Abstracts

S.l.OZa

Physical Scicncc9

IBM 1i511 Library Program Abstracts

ART-J

ENSIGN CODE

F. Narin
E. J. Voltaggio
Armour Research Foundation of
Illinois Institute of Technology
Chicago 16. Illinois

B. L. Anderson
H. Bohl, Jr.'
Bettis Atomic Power Division
Westinghouse Electric Corporation
Pittsburgh 30, Pennsylvania

a. Purpose: ART-I evaluates the analytic solution of the equations describing
the hme dependent temperature distribution in a three region composite
slab during a nuclear power excursion. The slab typifies clad nuclear
reactor fuel elements immersed in a coolant, and consists of a homogeneous heat source which varies exponentially with time, followed by two
consecutive slabs of non- source material. Heat transfer is by conduction
only.

Purpose: ENSIGN is a few-group, one-dimensional code designed to handle
symmetric slabs, nonsymmctdc slabs, and cylinders.
b.

Range: Problems may not exceed 4 groups, 10 regions, and 100 points.
Accuracy: Not given.
Floating/Fixed: Fixed point arithmetic is used.

b. Range: Not given.
~

Fiteno. 8.Z.0ZZ
Physical Sciences

Mathematical Method: Fluxes and eigenvalues are computed by means of an
"iterative scheme in which it is necessary to make an initial source guess.
At either of the outer boundaries, there may be a flux of zero or a derivative
of the flux equal to zero. The balance check method is used for crossing
internal boundaries.

Notgivcn.

Floating/Fixed: Floating point arithmetic is used.
c. MathelIlatical Method: The code evaluates the solution given in the Argonne
Nati.onal Laboratory Report ANL·4951, "Reactor Engineering Division
Quarterly Report, September I, 1952 through November 30, 195Z."

d.

d. Storage Required: The program consists of 204 instructions and one
constant.

Relocatability: Not relocatable.

Speed: Running time is two seconds per point. Loading time of inter·
pretative system deck with program is Z. Z5 minutes.

Remarks: Since fixed point arithmetic is used, limits :must be set on the
input. Even with these lhnits, an overflow condition may occur. Also,
many restrictions are placed upon the magnitudes of the parameters.

Relocatability: Not given.
e. Remarks: Transient terma, important for the first six peri.ods only, are
neglected. All material constants are fixed for a.ny one run. The progran.
ia written in the Bell Telephone Laboratories LZ General Purpose System,
IBM 650 Library Program Z. O. 008.

StoraRe Required: The program requires ZOOO words of storage.
Speed: The time required for a Z-group, 100.point, 7·iteration proble:m
is ZO minutes.

f.

IBM 650 System: One 533 is required.

IBM 1i511 Library Program Abstracts

f. 650 System: One 533 required.

Fileno. B.Z.OZ4
Physical Sciences

Special Devices: None.
RAYTHEON REACTOR SURVEY CODES ZG ZRl, ZG ZRII, AND ZG 3R

8. Z. 021
Physical Sciences
Fileno.

IBM 6511 Llbrsry Program Abstracts

L. Holway
Research Division
Raytheon Manufacturing Company
Waltham, Massachusetts

Purpose: These routines will find the critical radius or the critical value
of the infinite multiplication constant using two energy group diffusion
theory in thernlal reactors with two or three regions.

NEUTRON ENERGY SPECTRA IN WATER
J. C. English
E. I. du Pont de Nemours and Company
Aiken, South Carolina

b.

Accuracy: Depends upon the number of iterations as determined by the
comparison constant used.

a. Purpose: This code computes the distribution in energy from zero to
Z.5 ev. It includes the effects of moderator motion and chemical binding.

Floating/Fixed: Floating pOint arithmetic is used.

b. Range: Not given.

Mathematical Method: The continuity conditions joining the analytic
solutions at a boundary produce a determinant which is solved by an iterativ.
process for that value of the radius (ZG ZRI) or kCl) (ZG ZRlI and ZG 3R)
which makes the determinant equal to zero.

Accuracy: Not given.
Floating/Fixed: Computation is in fixed decimal arithmetic.
c. Mathematical Method: The equation for the conservation of neutrons is
expressed in difference form as the matrix equation N = KN which is solved
by iteration.
"

d.

Speed: For ZG ZRI and ZG ZRn the running time is about 45 seconds per

Relocatability: Not given.

d. Storage Required: Not given.

Relocatability: Not given.
e.

Storage Required: Approxinlately 575 storage locations for ZG ZRI and
ZG ZRlI; approximately 900 storage locations for ZG 3R.
~ data, and for ZG 3R. about I minute.

The Rand fit to the erf function is used in the evaluation of elements of the
matrix.

Speed: The matrix Q is obtained in about twenty minutes. Distributions
Wiihthree digit precision are obtained with about twenty·five minutes of
iteration.

Range: Includes all values of core radius greater than 15 centimeters in
2G ZRI and all values of kcngreater than 1. I in ZG ZRn and 2G 3R.

Remarks: None.
f.

IBM 650 System: One 533, indexing registers, and automatic floating
decimal arithmetic feature are required.
Special Devices: None.

~

The code as written assumes that the input parameters are in
the range of those for HZO and DzO moderators.

£. 650 System: One 533 reqUired.
Special Devices: None.

IBM 1i511 Library Program Abstracts

File no. 8. Z. OZ5
PhYSIcal Sciences

AN IBM 650 PROGRAM TO CALCULATE THE NEUTRON ATTENUATION IN
A WATER-METAL REACTOR SHIELD
(Continued on next page)

137

constanl, absorption cross section, and the removal cross sectLon
respectively

H.S, P. Jones
Numerical Analysis Section
Computer Department
RoUs-Royce Limited
Derby, England

d. Storage Requirements: Approximately 1750 storages are required.
including input data allocation. The program Is supplied in SOAP II
format and deck.

Purpose: This program calculates the neutron attenuation in water-metal
reactO'rshields in one dimension of plane or cylindrical geometry for up
to fourteen regions.
b.

Range:

--

Relocatability:

Not give!'

None,

IBM 650 System: Tape system, consisting of one 533, one 'on line' 407,
lAS, one 727 Magnetic Tape Unit, indexing registers, and automatic floating
decimal arithmetic feature.
File no.

IBM 650 Library Program Abstracts

8,2. 026

Physical Sciences

Richard R. Haefner
E. I. du Pont de Nemours &; Co.
EJeplosives Department
Atomic Energy Division
Technical Division
Savannah River Laboratory
Aiken, South Carolina

a. Purpose: An IBM 650 routine that computee the spherical harmonic
approximation of the neutron transport equation in five energy groups,
in one dimension, and for cylindrical geometry. The P3 approximation
Is used for the lowest energy group artd-t:he PI approximation is used for
the higher energy groups.
.
b. Restrlctionll, Range:
c. Method:

e.

~

2,000 words, 10 minutes/region.

None.

f. IBM 650 System: Model 2 computer with automatic floating decimal and
indexing registers.

G. R. Hoke
E. 1. duPont de Nemours & Company
Savannah River Laboratory
Aiken, South Carolina
Purpose: Equations and a routine for the IBM 650 to calculate axial temperature
distribution in fuel assemblies are presented. The routine can accommodate as
many as three heat sources and four coolant channels alternately spaced in either
plane or cylindrical geometry.

IBM 650 IJbrary Program Ahstracts

Range: Not given.

LQC SURFAyE FITTING PROGRAM FOR BASIC 650

Fileno.

8.3.001

W. C. Krumbein
Department of Geology
Northwestern University
Evanston, nliJni s

Accuracy: Not given.
Floating/Fixed: Floating decimal arithmetic.

•

Mathematical Method: Not given.

C. E. Faulkner
IBM, UK, Ltd.
London, England

Storage Required: 1750 words.

a. Purpose: To fit linear, quadratic, and cublc surfaces to map data where
the points of observation are distributed irregularly over the map area,
rather than on a rectangular grid.

Speed: One minute per problem.
Relocatability: Not given.
Remarks: None.
f.

Floating.

Analytic.

d. Storage ReqUirements:

TEMPERATURE DISTRIBUTION IN FUEL ELEMENTS

d.

8.2.028

A MULTIGROUP P3 PROGRAM FOR THE NEUTRON TRANSPORT EQUATION

See the program write_up.

Speed: Time required per point is 2n seconds, where n is the total number
of divisions of range.

Remarks:

Fil,no.

All calculations are done in floating decimal arithmetic,

Storage Required: On tape the program is stored in fourteen 53-word records,
the last three words of each record containing reference data.

b.

registers.

IBM G50 IJhr....f Progr.m Ahstracts

Mathematical Method:

a.

Inde~

Not given.

The results cannot be accepted to more than three significant

Floating/Fixed:

f.

Requl.res automatic floating decimal feature and

1 < n ::; 398, where n is the total number of divisions of range.
1 < m ::; 14, where m is the number of regions.

Accuracy:
figures. -

d,

e. Remarks:

1. IBM 650 System:

IBM 650 System: One 533, indexing registers and automatic floating decimal
arithmetic feature are required.

b, Restrictions, Range: The program handles ae many as four mapped
variables al! a time for an indefinite number of map pointe, inaemuch
as the computations are in floating point.
Accuracy: Double precision used in matrix inversIon and computation
of coefficients. Other computations in Bingle precision.

Firtno, 8.2.02.7

Floating/Fixed: Input"in fixed point.
point. Output in floating point.

IBM G50 IJhrsry Progr.m Ahstr.cts
c.

~

Program converts to SIR floating

Least squares polynomial fitting.

MUL TIREGROUP
~:

Part I computes basic IO,x 10 cublc matrix and four 10 x 1 vectors
at the rate of 1 data card per 9 seconds. The output is in the form of 10 x 10,
6 x 6, and 3 x 3 matrices and their corresponding vectors.

J. C. English
Savannah River Laboratory
E. I. du Pont de NelTlours &; Co.
Aiken, S. C.

Part IIinvertSthc L, Q, and C matrices and computes the coefficients at
the rate of 10 minutes per mapped vat-iahle.

a. Purpose: This program solves the one~dimenBional neutron diffusion
equation by lTleans of the associated difference equations in several energy
groups. The program is essentially the WAPD "LU' Abner" code rewritten
for the Model 2 IBM 650. A gain in sp~ed of a .hetor of five over "Lil'
Abner" is realized.
b. Restrictions, Range:
c.

Floating point arithmetic is used.

~

Difference equations which approximate the set of coupled
differential eouations
.
_Di 2~i (Ii L~""DiB;).pi:XiS1-r;-l·F-I
are useX' to obta!n~lux prOltles tor each neutron group. Here Bi is the
transverse buckling; i is the group index; D,La, andLr are the diffusion

(Continued on next column)

J38

Part m computes 3 answc:.; ear.tls per data card every 4 seconds (ObServed
value, computed value, and dq'Viation). Sums of ~quare.s cards at end.
Relocatibility:
e. ~

Not relocatlble.

Full description of data and output cards in program write-up.

f. roM 650 System:

Basic 650 and 533.

B - 650.
Fikno. 8.-1:.001
Physical Sciences

IBM 650 Library Program Abstracts

Mathcrnatic,d Methot!: The expres9ions of electron density in the International
Tables for X~ray crystallography are used directly or expanded and combined.
d.

STRUCTURE FACTORS

Storage Required: Not given.
Speed: The following examples of speed are given:

R. Shiono
University of Pittsburgh
Pittsburgh 13, Fa.

600 rene"io~s
approx. 40 minutes/atom
1200 reflexions

Purpose: The programs compute structure factors of triclinic. monoclinic
and orthorhombic space groups. The output cards of these programs are
used as the input cards for "Differential Fourier Synthesis II program (File
No.8, 4.0020). Six individual programs were prepared for centric and noncentric space groups of the three classes respectively, and the modifications
for any particular space group are made by addition of a few cards.

Rc1ocatability: Not given.
~ The necessary modification cards for each space group are listed.

f.

h.

Range:

Number of independent atoms (at a ti:me)
Number of different kinds of atoms
Number of temperature factors;
1. Isotropic telTlp. factor for each kind
2. Individual anisotropic telTlp. factor
Indices of reflexion:
1. Centro-symlTletric
2. Non-centrosylTllTletric
Accuracy:

50

650 LIBRARY PROGRAM ABSl'RACT

9.2.001

SURVEY TRA VERSE
no lilTlit

J. T. Ahlin and G. E. Mitchell
IBM, Houston

99

May I. 1956

Not given.

Floating/Fixed:

Fixed point.

Storage Required: Most of the 2000 storage locatio
~:

FILE NUMBER

50

MathclTlatical Method: Geometrical structure factors are computed with
simplified expressions in the International Tables for X_ray Crystal~ography.
Trigonometric functions are computed with Trimble's subroutine (IBM
Technical Newsletter No.9, 1955). Atomic scattering factors are stored
in table form and linear interpolation is used.
d.

IBM 650 System: One 533 required.

The following upper limits are given:

a) Computes the departures and latitudes (or each traverse line, the x and y
coordinates (or each station, and the length, bearing, departure and latitude of
the closure.

b) Angle data &.re to eUher the nearest second or the nearest hundreth of
minute; distance data in the form xxxxx. xx feet. Sines and cosines are computed to six decImal places.

arc used.

c} Does not apply.

9 atoms, 2 kinds

3.5 sec/reflexion

d) Storage required is about 500 locations between 0000 and 0999. Speed is
100 stations per minute.

7 atoms, 7 kinds

8 sec/reflexion

The following exalTlples of speed are given:

e) Self-restoring.
28 atoms, 2 kinds,
anisotropic temp. factors

P l

20 sec/reflexion

f)

Minimum 650.

Relocatability: Since the programs occupy most of the drum, it is not
convenient to relocate. The programs are written in SOAP I.
Remarks: The necessary modification cards for each space group are
listed (except for Fdd2 and Fddd).
f.

Fileno.

IBM 650 Library Program Abstract.

Errata

have been Bubmitted in the listing of the writeup of the above

program:

PAGE

LOCATION

LINE

49
50

0427
0392

233
308

WORD

WORD

60 0126 0432 should be
69 0134 0442 should be

6501180384
69 0375 0442
File nQ. 8.4.002
Physical Sciences

IBM 650 Library Program Abstracts

R. Shiono
University of Pittsburgh
Pittsburgh 13, Pa.

b.

a) Computes the amount of cut and fill voluITle between survey stations on a
highway using the data from the original survey and from either a final survey
(for billing) or design specification.
b) Fixed~point arithmetic is used with a maximum of lao points per station
with no limit to the number of stations, Volumes are punched to the nearest
cubic yard, areas to the nearest hundredth square foot, horizontal distances
to the nearest tenth of a foot, vertical distances to the neare:;t hundredth of a
foot.
c) The average end-area is used for computing volumes.
d) Storage required is about 975 locations assembled between 0800 and 1950.
Input data and computed tables occupy locations 0000 to 0799. Timing is a
function of the number of'stations and readings at each station. For 25 readings per station and 100 stations per mile computations require about 15 min~
utes per mile.
e) For design purposes the program also computes the slope stake points
(intersections of proposed road with terrain). A SOAP symbolic deck listing
in addition to an absolute deck listing of the program assembled between 0800
and 1950 is included.

DIFFERENTIAL FOURIER SYNTHESlS

a.

9.2.002

8.4.001

"structure Factors, II by R. Shiono

~orrecUons

FILE NUMBER

R. W. Blaylock and J. M. Kibbee
IBM, Houston

IBM &50 System: One 533 required.

The following

650 LIBRARY PROGRAM ABSTRACT

f)

Purpose: This program uses the output cards from the program "Structure
Factors" (File No. 8.4.001) as the input cards. It computes the electron
densities, their nine derivatives of observed and calculated structure
factors at a given coordinate, and solves the shift from them.. The m.odifications for each space group are made by the addition of a few cards.
Range: There is no limit to the number of reflexions.

Alphabetic device if the SOAP symbolic version is used.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

9.2.004

CUT AND FILL

Accuracy: Not given.
Floating/Fixed:

Fixed point.

(Continued on next column)

J. M. Kibbee andJ, W. Robinson
IBM Houston

(Continued on next page)

139

a) Computes slope stake intercepts, cut, fill, and net V'Jlumes, adjusted, and
accumulated volumes.
b) Fixed dec\mal.

e) The program is seH restoring and will process either many loading configurations for the same truss or many trusses, or any combination, in s..equence,
automatically. For indeterminate trusses, see Abstract 9.2.007, "Connector and
Redundancy Programs for Indeterminate Truss Analysis."
fl Minimum 650.

c) Average end-area method.
d) Uses entire memory: approximately 1200 program steps
approximately 800 table locations.
Speed varies with type of problem run.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

9.2.007

e) Road is described in terms of crown height and width, and slope depth and
width.
.
CONNECTOR AND REDUNDANCY PROGRAMS
FOR INDETERMINATE TRUSS ANALYSIS

f) Minimum 650.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

9.2.005

MOMENT DISTRIBUTION

Irene Tung
University of Houston
Computing and Data Processing Center
Houston, Texas
a) Designed to compute true axial forces in all membeJ;'s of indeterminate
trusses from output of "Truss Analysis" program.
b) Fixed point except the Sweeney Matrix Inversion routine which Is incorporated.

J. D. Hutchinson.
University of Houston
Computing and Data Processing Center
Houston, Texas

c) Castigliano's Theorem of Least Work is applied. (See any standard text on
indeterminate structures. )

a) Computes the bending moments In structural members of a rigid frame,
given fixed end moments.
b) Meets all engineering requirements. The program is written in fixed point.
c) The "Moment Distribution" method of Hardy Cross is used. (See Paper 1793,
Trans, A. S. C. E., 1932.)

d) The Connector requires 750 locations for program and data. The Redundancy
Program requires 1725 locations for program and data. The programs are
written in SOAP in fixed paint except the Sweeney Matrix Inversion program
which is incorporated.
e) Up to 24 redundants in a truss can be handled.
f) Minimum 650.
Aprll1958, Bulletln 18 _ 5

d) Program requires 540 memory locationsj data require 10 words per member
in the frame. Speed: 1/8 to 1/10 seconds per member per joint per iteration.
Relocatability: Program is written in SOAP, but all data locations are in
absolute.
e) Handles frames with up to 100 members. Not more than 8 members can
meet at any given joint.

650 LIBRARY PROGRAM ABSTRACT

f) Minimum 650.

FILE NUMBER

9.2.008

GEORGIA SKEWED BlUDGE PROGRAM

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

TRUSS ANALYSIS

A. A. Aucoin
J. D. Hutchinson
University of Houston
Computing and Data Processing Center
Houston, Texas
a) Computes axial forces in statically loaded, simple, determinate, pinned
trusses.
b) Range: Loads varying from 1 to 99999 (units arbitrary). Accuracy: Depends
on number of significant figures in data; 1 part in 500 accuracy can be obtained
on large trusses. Program is written in fixed point.

C. P. Reed
Rich Electronic Computer Canter
J. M. Nieves-Olmo
State HighwaY Department of Georgia
Atlanta, Georgia
a) This program determines the placement of bents, the intersection of radial
lines with concentric circles, the chord distances between bents, and other
related data for substructure of a curved bridge.

b) Accuracy to tenths of a aecond for angles. Most calculations are performed
in lloating decimal with part of input being submitted in floating decimal.
c) Makes use of plane geometry and tr1gonometry which pertain to chords of
concentric circles and radial triangles.
d) Uses entire drum. Speed: 4 seconds per radius per bent.
e) Can handle any number of bents and up to 17 concentric circles at each pass.
Can handle either left, right, or partially skewed bridge.

c) The "Method of Joints" is used. (See any standard text on truss analysis.)
fl Minimum 650.
d) The program requires 1200 memory 10 cationsj data require six locations per.
member. Speed: Approximately jj seconds where jj is the number of joi~ts in
the truss. RelocatabUity: Since the program and data occupy most of the drum,
it is not convenient to relocate. The program is written in SOAP, however.

140

April 1958. Bulletln 18 - 7

B - 650

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

9.2.009

b) Will solve any system with up to 192 zones. All data is in fixed point.
c) Uses the method of Howard W. Bevis presented in "Traffic Quarterly" Volume
X, No.2, April, 1956, pages 207-222, entitled "Forecasting Zonal Traffic
Volumes. "

MOMENT DISTRIBUTION

d) Program occupies 930 positions of memory storage and is not relocatable.
Speed is punch speed (100 per minute).

P. Yeager
L. C. McReynolds
Computer Section
Washington Department of Highways
Olympia, Washington

e) None.

a) Computes final end moments in beams and in column tops of continuous beams
built integrally with columns when distribution coefficients, carry-over factors
and fixed-end moments are given.
b) Wilt solve any single story continuous frame bridge structure with up to 15
spans. All data is in fixed point.

f) Minimum 650.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

9.2.012

MAXIMUM DENSITY OF GRANULAR MATERIALS
c) Uses Hardy Cross method of moment distribution.
d) Program occupies 1158 positions of memory storage and is not relocatable.
Speed is 3 seconds per joint.

R. V. LeClerc
H. E. Sandahl
Materials Laboratory
Washington Department of Highways
Olympia, Washington

e) None.

a) Computes paints on a curve for determination of the maximum densities of
coarse granular materials.

f) Minimum 650.

b) Input and output are in fixed point.
650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

9.2.010

c) Used with laboratory method (or determining maximum density developed by
H. W. Humphres.

d) Program occupies 363 positions on drum and is not relocatable. Speed is
2 seconds.

TEXAS ENGINEERING SUBROUTINES

e) None.

Texas State Highway Department
Austin, Texas

f) Minimum 650. Alphabetic device is required if alphabetic identification is used.

a) To convert degrees to radians, radians to degrees, and bearing to slope, and
to perform 20 digit divisions.
b) Range: 0.00000000 to 9.99999999 radians.
Accuracy: XXXO XX' XX. X"
Fixed point arithmetic.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

9.2.013

ANALYSIS OF LATERALLY LOADED PILES

c) Normal conversion formulas.
C. B. Rader, Sr.
C. R. Hobby
E. I. Organick
University of Houston
Computing and Data Processing Center
Houston, Texas

d) Locations: 1801-1899. Non-relocatable.
e) None.
f) Minimum 650.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

9.2.011

a) Computes lateral deflection, bending moment, shear, fiber stress due to
vertical as well as horizontal loading, and soil pressure for t + 1 positions
along a pile divided into t sections (t S 49). Piles are assumed to be made of
pipe or to have a circular cross section.
b) The program is written in fixed point machine language; range and
are discussed in program write-up.

FORECASTING ZONAL TRAFFIC VOLUMES

~ccuracy

c) Focht and McClelland method (see Texas Engineer, Vol. 25, nos. 9, 10, 11,
Sept., Oct., NOv., 1955).

J. Petersen
Computer Section
Washington Department of Highways
Olympia, Washington

d) The program is not relocatable and uses approximately 1000 storage locations.
Time required, for each wall thickness, is (t + 3) seconds plus punCh-out time,
where t is the number of divisions of the pile; punCh-out occurs at maximum rate.

a) Computes future zone-to-zone traffic movements given the present zone-to-

e) Does not apply.

zone movement and the estimated growth factors for each zone, using a method
of successive approximations.
(Continued on next column)

f) Minimum 650.

141

Fileno.

IBM 650 Library Program Abstracts

9.2.013

Errata

d) The entire program requires about 300 locations, but this number may be
reduced if the punching phase is separated from the reading phase. The program
should not be relocated except to separate punching from reading phases. Speed
varies with the concentration of tr~ps within the particular swath being processed.

"Analysis of Laterally Loaded Piles. " by C. B. Raeder. Sr .• C.R. Hobby. E.!. Organick.

The following correction has been submitted for the listing of the writeup. Page 19.
loeation 0784, should be changed from 10 1411 0794 + to 11 1411 0794 +.
This change affects only those cases where the slope of the pile at the top is other than

e) Reading of trip cards may be suspended and the trip values for each coordinate
point may be punched out at any time so th~t the 650 does not need to be reserved
for the entire time necessary to compute a given swath.

f) Minimum 650.

zero.
Also note that the one per card listing in the writeup should be ignored.
per card deck listing should be considered reliable.

650 LIBRARY PROGRAM ABSTRACT

Only the five

FILE NUMBER

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

9.2.017

9.2.015

FREEWAY ASSIGNMENT PROGRAM
REVISED TRAVERSE AND TRAVERSE ADJUSTMENT COMPUTATION
J. A. Haller
California Division of Highways
Sacramento, California

California Division of Highways
Sacramento, California
a) Determines best alternate route for a proposed freeway based on time-ratedistance studies of existing traffic.

a) This routine calculates traverse data for the typical highway survey. right of
way. or design problem. Input is in the form of one card per course. Any two
unknowns within a traverse may be accepted. Results are punched one course to
a card and show identification, distance, bearing, sine, cosine, latitude, departure, and coordinates for regular courses. Areas are obtained for closed figures
and segment areas are also computed. The factors developed in one traverse
may be stored for use in a later traverse. Where two mathematically correct
solutions are possible, both solutions are presented from a single set of input
data, and the engineer must choose the proper solution.

b) FIxed decimal.
c) Formula as outlined by the Traffic Section, California Division of Highways.
d) Uses all locations except 1000 and 1999.
e) Will handle one alternate freeway at a time and up to 3 speeds on city streets.

b) Ninety-eight regular courses may be submitted for each traverse. Cards need
not be sorted by course number, but all cards for a given traverse must be together. Distances are given to thousandths of feet and bearings to seconds.
Functions are computed to nine decimal places.
c) Library subroutines used are from Technical Newsletter #9 for sine .. and cosine,
arctangent, and arcsine.

f) Minimum 650.

FILE NUMBER
650 LIBRARY PROGRAM ABSTRACT
9.2.018
- - - - - - - - - - - - - - - - - - - - - - -_ _ __

d} Ninety-eight locations each are required for storage of sine, COSine, distance,
and bearing. Other program and temporary storage requirements use the remainder of the two thousand drum locations, with the exception of seventy-nine
locations. Speed is about two thousand courses per hour. The program is considered optimum and is not in relocatable form.

CURVED BRIDGE PROGRAM
Texas Highway Department
Austin, Texas

e) Some coded stops may be reached because of incorrect input data.
f) A 650 with twenty pilot selectors, half-time emitters, and alphabetic device
is used.

a) This program relieves the detaUer of much of the laborious computation
involved in the plan preparation of a curved bridge.
b) Fixed point. Accuracy varies for different variables in program.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

9.2.016
c) Mathematical formulas as now used by bridge designers.
d) Optimized through most of memory. About 500 program steps.

CONTOUR CHART OF TRIP DESIRES
e) Only 20 bents may be computed at one time. The values of radii are limited
to less than 10,000. Other limitations given in write-up.

J. A. Haller
California Division of Highways
Sacramento, California

f) Minimum 650.

a) This program computes the desire line trip values for each coor?inate ~oint
within a traffic survey area. The output from the program may be hsted WIth
proper spacing to post contour values. The listing may then be used to draw a
contour chart of trip desires.

b) Up to approximately 1750 contour pOints may be posted in one pass of the trip
cards. Coordinate boundaries for each pass must be set up.
c} The X and Y coordinates of each point alo,ng a straight line from origi,n to,
destination are computed. The number of POtots computed for any ~ne trip wll,l
be one more than the number of ordinates crossed by the longer aXlS of the trIp.
(Continued on next column)

142

IBM 650 Library Program Abstracts

File

"0.

9.2.019

Engineering Applications

COMPOSITE BEAM.

R. E. Shields
J. A. Haller
California Division of Highways
Sacramento, California

(Continued on

next

page)

B -

a.

Purpose: This program will compute stoel girder tdzc and all other factors needed
to complete the design of a concrete-steel composite girder.

650 LIBRARY PROGRAM AllSTnACT

FILE NUMBER

650

U. 2. 021

Range: 138 plate sizes from 10" x 5/8" to 28" x 3-1/4" arc available as trial sizes.

b.

Accuracy: Not given.

TRAVERSE AND COORDINATE PROGRAM

Floating/Fixed: Fixed decimal arithmetic is used.
Mathematical Method: The routine picks a trial size of top {llld bottom flange, computes
the stresses on such a beam, and then mooifies top and bottom flange sizes
separately as a result of the test of the stresses. \Vhen both top and bottom flangcB
aro within the proper stress band, the program computes reductiens in flange
sizes, end reactions, or shear stress, and pWlches results. A single card input
produces a single card output for each beam to be designed. AASHO recommendations are observed.
d.

storage Required: Approximately 1700 locations of table, instruction, and temporary
storage are used.
Speed: Varies, but the average beam will be designed in 25 to 60 seconds.

K. F. Kohler
R. R. DeClar!\.

Bureau of Public Roads
Portland, Oregon

a) Using either Stations and Deflection Angles right or. left, Len~th of Courses
and Dcflection An~les right or left, or Stations and AZlmuths as lIlpul, the .
Bearings, Stations, Length of Courses, Course Lats. and Dcp~, and Co?rdlllates
of angle points are computed. Using P. I. Numbers and Coordmates as mput, the
Bearil1~s, Delta Angles, and Length bf Courscs are computed. In all, fourteen
different problem types are computed.

Relocatability: Not given.
Remarks: Provision is made to compute initial factors which arc not specified by the
engineer. The minimum data include span length, spacing between girders, structure
depth, and steel stress. If other data arc given, these data will be used in place of
values computed from the minimum. The design engineer may restrict the solution
to a specified width for top plate, bottom plate. or both plates. Error cards will
be pWlched if no flange of specified width can satisfy the maximum stress requirements.

c) Does not apply.

Plate girders without composite action may also be designed by the program.

f.

b) Coordinates ec, CCC, CCC. CC, Bearings N. or 5. DDMM5S E. or W., Stations
SSSS+SS.S5, Deflection Angles DDDMM5S R. or L., Delta Angles DDDMMSS, P. 1.
Numbers PP, PPP, PPP, and Course Lengths LLL, LLL. LL, (L, LLL. LL when
using coordinates as input). The subroutines used are SR-3 (Square Root), SC-l
(Sine - Cosine) and AS-l (Arcsine). Program is in fixed point.

IBM 650 System: One 533 required.

d) Storage required is about 1000 locations between 0000 and 1836. Speed is 40
courses per minute.

Special Devices: None.
"'This program supercedes the original program bearing the same name and file number.

e) Program is written in SOAP.
f) 650 with alphabetic device.

IBM 650

Library Program Abstract.

Fileno. 9.

z.

019

ADDENDUM

1

IBM 650 Library Program Abstracts

CALIFORNIA COMPOSITE BEAM

The "ddendum <::a!tses the Composite Beam program to furnish design
data for low allry steel (AZ4Z) as well as any type of carbon steel as

Filt:no. 9.2.022
Engineering Applications

EARTHWORK LINE SHIFT

before.
C. Travis
S. R. Cason
Computer Section
Washington Department of Highways
Olympia, Washington

The writeup and Hst of <::oded instructions are ava.Uable from the library.
Any request received after March I, 1961 will automatLcally receive
thi:;; revision.

a. Purpose: Shifts the center line on earthwork cross-section and interpolates
a rod reading for the new center line if the new center line is located at a
point for which no rod reading was given.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

9.2.020

b. Range: Makes both left and right shifts of any size which will not cause the
final distances to exceed four digits.

Accuracy: Not given.
Floating/Fixed: The program is in fixed point arithmetic.

THREE CENTER CURVES FOR SHORT RADIUS TURNS

c. Mathematical Method: The interpolation is a straight line interpolation.
d. Storage Required: 436 drum locations.

California Division of Highways
Sacramento, California

Speed: Program runs at almost punch speed.

a) This program performs the computations of short radius turns as set forth in
the Planning Manual of the California State Highway Department.
b) The value of the angle A carmot fall within the ranges between 179055' and
180 005', and between 359055' and 0°5'.

Relocatability:

Program may be relocated.

e. Remarks: Self loading five instructions per card deck is_available.
f.

650 System:

One 533 required.

Special Devices! None.

c) Uses IBM sine-cosine, square root, and arc-sine subroutines.

IBM 650 Library Program Abstracts

Fikno. 9.2.023
Engineering Applications

d) Uses approximately 650 locations. Can be relocated anywhere on drum.
e) The program was written for the ranges prescribed in the Planning Manual
so not all possible variations have been tested.
'
f) Minimum 650.
(Continued on next column)

SPEED CHECK ANALYSIS
C. Travis
Computer Section
Washington Department of Highways
Olympia, Washington

(Continued on next page)

143

a. Purpose! COll1putes 850/0 speed, average speed, standard deviation, 0;0' S
over given speed and S curve %' s.

Contours are developed and tabulated in a form ideally suited for plotting
purposes. The output for each section is the station, the elevation and
distance of the left-most topog point, aU contours as elevation and distan.ce
from centerline that lie between the left-most topog point and centerline.
the elevation of centerline, all contours as elevation and distance from
centerline that lie between centerline aQd the right-most topog point, and
the elevation and distance of the right~most topog point.

b. Range: Handles speeds froll1 5 to 80 MPH with as many observations as
desired. Six groups may be read in for each station.
Accuracy: Most answers are given to 1/10%.
Floating/Fixed: COnlputatlon is in fixed point arithnletic.
c. Mathenlatical Method: Usual nlcthods for average speed and

0/0'

s.

Standard deviation by the following equation:

Variance

h. Range: Desired Contour Interval, (I1.1) on header card. Topog cards
(type "0" cards) used as input are sam.e as used in the Design Cut and Fill
PrograITl (H841 B. p. R. revised). Station (SSSS + SSI, H. 1. {EEEE + EEl,
Rod Reading (RRR,R±), and Distance (DDD.D). The output is Station
(SSSS + SS). Elevation of contours, end topog points or centerline
(EEEE.El, and Horizontal Distance from centerline (DoD.D).

=G 2

Accuracy: As indicated above.
Floating/Fixed: Program. is in fixed point arithmetic.

d. Storage Required: Progranlleaves 329 locations available.
c. Mathematical Method:
~:

d. Storage ReqUired: Approximately 560 locations between 0000 and 1800 are
reqUired.

Relocatability: Progranl is non- relocatable.
e.

Does not apply.

Requires about 2 nlinutes per problenl.

~

Speed: Computation time varies with the number of topog points per section
and the number of contours within a section.

Self loading five instructions per card deck is available.

£. 650 SysteITl: One 533 required.
Relocatability: Not given.
Special Devices: None.
e. Rem.arks: None.

IBM 650 Library Program Abstracts

Fileno. 9.2.024
Engineering Applications

f. 650 System: One 533 required.

Special Devices: None.

SLOPE TOPOG PROGRAM

IBM 650 Library Program Abstracts

K. F. Kohler
R. R. DeClark
Bureau of Public Roads
Portland, Oregon

SLOPE STABILITY ANALYSIS

a. Purpose: Converts cross section slope topog (slope in.percent or degrees
and slope distance) to H. 1. and rod topog.

J. Petersen
Computer Section
Washington Department of Highways
Olympia, Washington

b. Range: Input is Station (SSSS + SS), Base Elevation (EEEE.EE), Slope in
Degrees (SS.S1) or Slope in Percent (PPP.±), and Slope Distance (DOD.).
Output is Station (SSSS + S5). Base Elevation (EEEE.EE), Rod Reading
(RRR.Rt) and Horizontal Distance (DDD.D). Output is type "0" forITl used
in the Design Cut and Fill Program, (H841, B. P. R. revised), and other
related programs developed or revised by the Bureau of Public Roads.
The subroutines used are SC-I (Sine-Cosine) and SR-3 (Square Root).

Fileno. 9 . .2.026
Engineering Applications

a. Purpose! Computes the factor of safety against failure of an embankment
orwITf'Tind the steepest embankment slope with a factor of safety greater
than one.
b. Range: Three layers of different materials may exist below the em.bankITlent.
Accuracy: Not given.

Accuracy: As indicated above.

Floating/Fixed: Not given.

Floating/Fixed: Program is in fixed point arithITletic.
c. MathcITlatical Method: Does not apply.

c. Mathem.atical Method: Uses the Swedish Slip-Circle method.

d. Storage Required: Approximately 890 locations between 0000 and 1800 are
required.

d. Storage ReqUired:

1397 positions of memory.

Speed: Speed varies from 45 seconds to 5 minutes.
Speed: The computation tiITle varies with the number of readings per
section and is slightly less for the Percent Slope Topog cornputation than
for Degree Slope Topog.

Relocatability: Program is not relocatable.
e. ReITlarks: Self loading five instruction per card deck is available.

Relocatability: Not given.

r.

This program was developed on the supposition that between any
pair of topog points the instrument height and target height above the actual
ground would be the same, and that the chaining height at both points would
be equal. The program does not provide for a height of instrument correction.

650 System: One 533 required.

e. Remarks:

f.

Special Devices: None.

IBM 650 Library Program Abstracts

Fiuno. 9 . .2.0.27
Engineering Applications

650 System: One 533 required.
Special Devices: None.
SURVEY TRAVERSE PROGRAM

IBM 650 Library Program Abstracts

Fileno. 9.2.025
Engineering Applications

S. E. LaMacchia
Ohio Department of Highways
Columbus, Ohio
a. Purpose: Using as input the following survey m-averse information:

CONTOUR INTERPOLATION

I) Course length
2) Course angle:
Bearing
Deflection
Azimuth
the program computes and supplies as output the latitude, departure.
station coordinates, and components of closure error.

K. F. Kohler
R. R. DeClark
Bureau of Public Roads
Portland, Oregon
a. Purpose: This program develops the location of e'ach contour within any
highway topog cross section that is in the H. 1. and rod and dist'ance form.
The contour interval desired is selectable between 00. a and 99.9 feet.
(Continued on next column)

144

b. Range: In the case of a closed traverse, the number of courses must be
less than one hundred.
(Continued on next page)

B - 650
Accuracy:

The sections can be read into the machine in any order provided links are
set by LDI (IBM 650 Library Program 1.2.007).

Output data is accurate to the nearest one-tenth ioot.

Floating/Fixed:

Computation is made in fixed point aritlunetic.
Speed: An average station reqllires approximately 20 seconds.

c. MathelTmtical Method: The angle is first converted to an a:dmuth and then
added to the previous sum. Latitudes and departures arc computed with
the use of the sine-cosine subroutine, SC Z.
d. Storage Required: Memory locations 1 - 50 and 200 - 600 approximately,
are used.
~peed:

Speed is approximately the maximum for card reading and punch-

Rclocatability: All sections of the routine are relocatable within the
present limits of 0400 and 1823.
e. Remarks: The number of points on each side of the center line of.the roadway cannot exceed 33. The number of points of each side of the center
line of aurvey cannot exceed 66. The input cannot have X and Y both zero.
The shoulder cannot be at the center line of survey.

lng.

f. 650 System: One 533 required.
Rclocatability: The program is rclocatable.
Special Devices:

None.

e. Remarks: None.
f. 650 System: One 533 required.

Fileno. 9.2.030
Engineering Applications

IBM 650 Library Program Abstracts

Special Devices: None.

Fileno. 9.Z.028
Enginee ring Applications

IBM 650 Library Program Abstracts

ROD READING CONVERSION PROGRAM

a. Purpose: Computes areas at each station, volumes between stations, and
seeding area between stationa, and accumulate::! volumes for entire project.

M. Gold
Ohio Depart:ment of Highways
Columbus, Ohio
a. Purpose: The program reduces rod readings to elevations for use in the
Road Design Program (lBM 650 Library Program 9.2.029).
b. Range: The maximum X value is 999.9 feet.
99.9 feet.

b. Range: A maximum of 100 pOints each for road and terrain points.
Nwnber of stations that can be processed is only determined by size of
accumulated volumes.
Accuracy: Volum.ea are punched to nearest cubic yard. Areas to the
nearest square foot, and seeding area to the nearest square yard.

The maximum R value is

Floating/Fixed:

Accuracy:

Values are rounded to the nearest tenth from the field notes.
~ple process of one subtraction of these values, the difference
remains significant to the nearest tenth.
Floating/Fixed: The decimal is fixed in all calculations.

c. Mathematical Method: Silnple ariUunetic is used.
d. Storage Required:
drum.

OHIO CUT AND FILL
T. S. Gemmell
Ohio Department of Highways
Columbus, Ohio

368 memory locations in the firs{: eight bands of the

d. Storage Required: Storage requirements are: tables between 1000 and
1799, square root routine and LDI loading routine (IBM 650 Library
Program 1.2.007) 1850 - 1999, and 774 coding locations between 0000 and
0999.
~:

Timing is a function of the number of stations and readings at each
station. With seeding area for 51 readings per station, and 107 stations
per mile, an average of 48.2 minutes per mile; without seeding area, an
average of 30. 1 minutes per mile.

Speed: Data is processed at card reading speed.
Relocatability: The program is rclocatable in multiples of fifty.

Relocatability: Not given.

e. Remarks: None.

e. Remarks: Program will compute through a station equation, allow
shrinkage factor to apply to cut and fill, and will either compute or. not
compute seeding area.

f. 650 System: One 533 required.

Special Devices: None.

f.

IBM 650 Library Program Abstracts

Fileno. 9.2.029
Enginee ring Applications

650 System:

One 533 required.

Special Devices: None.

IBM 650 Library Program Abstracts

ROAD DESIGN PROGRAM
B. T. Wade
Ohio Department of Highways
Columbus, Ohio

Fileno. 9.2.031
Engineering Applications

SUPERELEVATION TABLES

a. Purpose: Computes coordinates of the road design template from the
shoulder to the slopestakes according to design criteria.
b. Range: The range of input is as follows: 0.00:5. station:5 999,999.99;
-999.9 S offset :S: 999.9: 0.0 :S: elevation :S: 9999.9; 0.00 S profile
grade:S 9999.99: 0.00:5. shoulder slope :5. 99.9; 0.0 S ditch slopes :s 9.9.
The range of the output is the same as input except that elevations are not
punched but rather distances above or below profile grade which have the
sam.e range as the offsets.

C. R. Caylor
Ohio Department of Highways
Columbus, Ohio
a. Purpose: Computes the coordinates of the surface of the pavement for
statlOns which arc within the limits of a curve and its transition.
b. Range: The X ordinates have a maximum value of 100 feet, the Y ordinates
have a maximum value of 10,000 feet.
Accuracy: All valUes are to the nearest 100th of a foot.

Accuracy: Values are com.puted to the nearest tenth foot.
Floating/ Fixed:

Fixed point arithmetic is used.

c. Mathematical Method: The trapezoidal and intersecting triangle lTlethod is
used for computing areas. The average end area method is used for
computing volume s.

Values arc com.puted in fixed point arithmetic.

c. Mathematical Method: The methods used incorporate analytical geometry
plus com.parisons on design criteria.
d. Storage Required:

Floating/Fixed:

Computation is in fixed point arithmetic.

c. Mathematical Method: Simple mathematics.
d. Storage Required: 850 consecutive memory locations.
Speed: Punches at approximately maximum speed.

0000 - 0399 Tables
0400 - 1715 Program
1823 - 1900 Constant and temporary storage locations.
(LD I occupies 1900 - 1999 but is wiped out by the

Rclocatability: Program is relocatable by multiples of 50, plus the last
ZOO locations which cannot be transferred.
program~

(Continued on next column)

e. Remarks: None.
(Continued on next page)

145

f. 650 System: One 533 required.

E. D. Lee
J. Petersen
Computer Section
Washington State Highway Department
Olympia, Washington

Special Devices: None.

IBM 650 Library Program Abstracts

Fif(:no. 9.Z.03Z
Engineering Applications

a. Purpose: Computes deflections, moments and shears in stiffening truss
of a two hinged suspension bridge. Computes cable tensions at supports.
b. Range: Computes values for three span suspension bridge with or without
anchor spans, sidt:: spans suspended or not suspended.

DESIGN TEMPLATE PROGRAM

Accuracy: Not given.

C. R. Caylor
Ohio Department of Highways
Columbus, Ohio
a. Purpose:

Floating/Fixed: Input and output is in floating point.
c. Mathematical Method: Uses Exact (Sine Series) Method wherein deflected
structure is represented by a Fourier series.

Computes the design template for any given station.

b. Range: The maximum X value is 1000 feet.
10,000 feet.

The maximum Y value is

d. Storage Required: Program is split into two parts with 1218 locations
available in the first part and 49 locations available in the second part.

Accuracy: The coordinates are computed to the nearest tenth of a foot.
Floating/Fixed:

Speed: Speed is approximately 15 minutes for the first loading and 12
minutes for successive loadings.

Computation is in fixed point arithmetic.

c. Mathematical Method:
d. Storage Required:

Relocatability: Not given.

Trigonometry.

e. Remarks: Self loading 5 instruction per card deck is available.
in SOAP using SIR.

1099 consecutive memory locations.

Speed: Not given.
f.

Relocatability: Program is relocatable by multiples of fifty.

Written

650 System: One 533 required.
Special Devices:

None.

e. Remarks: None.
f. 650 System:

One 533 required.

Special Devices:

IBM 650 Library Program Abstracts

IBM 650 Library Program Abstracts

Fileno. 9.Z.033
Engineering Applications

MOMENT DISTRlliUTION AND INFLUENCE LINE CALCULATION

APPROXIMATION OF FUTURE TRIP TRANSFERS
E. A. Radsliff
California Division of Highways
Sacramento, California
a. Purpose: The program utilizes the Fratar Method* to compute one 0r
~ccessive approximations of future trip transfers between zones.
Input data consist only of a set of initial trip transfers and (per zone) trip
end growth factors. Trip transfers will be apprOXimated for all pairs of
zones up to a maximum of 70 zones.

P. Yeager
L. C. McReynolds
E. D. Lee
Computer Section
Washington State Highway Department
Olympia, Washington
a. Purpose: Computes final end moments in beams and column tops of single
story continuous frames. The beams may be integral with the columns.
Computes influence line ordinates for loads at all the tenth points or for
loads at the .3, .5, and. 7 points. These ordinates are the final moments
at the beam ends and at the respective points in the span. Shear values
are also computed. Information required for input is the distribution
coefficients and carry-over factors, fixed end moments if they are to be
distributed, and span lengths and load to be used if influence line ordinates
are to be computed. When influence line ordinates are to be computed, a
table of fixed end moment coefficients must be supplied only if the beams
are ~ prismatic.
b. Range: Will distribute fixed end moments for any single story continuous
frame structure with up to 15 spans. This program will also compute
influence line ordinates for a structure with up to 5 spans.
Accuracy: Not given.
Floating/ Fixed; All data is in fixed point.
c. Mathematical Method: Uses the Hardy Cross method of moment distribution.
d. Storage Required: Program occupies 1869 positions of memory storage.
Speed: Not given.

b. Ran'ge: Initial and approximated trip transfers have a range up to 9999.9
but any transfer which is initially zero will remain zero. Growth factors
may range up to 99.999. Initial or approximate trip ends (per zone) may
not exceed 100.000.
Accuracy:

Not given.

Floating/Fixed: Fixed point arithmetic is used throughout.
c. Mathematical Method: *The Fratar Method formula was taken from
"Vehicular Trip Distribution by Successive Approximation", Thomas J.
Fratar, Traffic Quarterly, January 1954.
d. Storage Required: Essentially the entire drum is used by the program.
Only 460 locations arc used for instructions or constants, but 1488 fixed
locations are required for storage of data.
Speed: Time for loading and punching blocks is normal machine speed.
Calculation time varies with the number of zones (N) and the nUlllber of
non-zero initial trip transfers (M). A rough time forllluia (in minutes)
is
[(5N 2 + 3M) + 1, 000] per approximation.
e. Remarks: All data are first loaded and then one or more approximations
may be obtained (in succession at the programmer's option). Optional
percentage criteria (in terms of approxilllated trip ends as compared to
expected trip ends) are available to define the standard of accuracy of the
final approximations.
f. 650 System: One 533 required.

Relocatability: Program is not relocatable.
e. Remarks: Self-loading five instructions per card deck is available.
in SOAP.
f.

Fil(:no. 9. Z. 035
Engineering Applications

None.

Written

650 System: One 533 reqUired.

Special Devices: None.

File no. 9. Z. 035
Addenda/Errata

IBM 650 Library Program Abstracts

Special Devices: None.
"Approximation of Future Trip Transfers," by E.A. Hadsliff.

IBM 650 Library Program Abstracts

Fikno. 9. Z. 034
Engineering Applications

SUSPENSION BRIDGE ANALYSIS
(Continued on next column)

146

The following additions should be made to the wiring diagram of the 533 control
panel on pages 45 and 46 of the program write~up:
Columns Z5 and 26 of Read Card A to Storage Entry A, Word 9, positions
6 and 5. Emit zeros to positions 4,3, 2, and 1.
Wire #9 (a rea.d timed 9) terminiltes at Storage Entry A, Word 10, position 2.
(Continued on next pagel

8- 650
430
430
430
430
430
430
430
430

Wire '8 (a read timed 81 terminates at Storage Entry A, Word 10, position 1.
Wire' 54 (a three-ended wire) leads from Punch Digit Emitter, digit O.
Wire H 55 leads from Punch Digit Emitter, digit Z.
Wire H 56 (a four-ended wire I leads from Punch Digit Emitter, digit 3.
Wire II 51 (a four-ended wirelleads from Punch Digit Emitter, digit 4.
The following corrections should be made to the same wiring diagram:
Wire H 12. should lead from Read Card A, column 80 to Read Selector
Common (location R, Zl).
Wire
13 should lead from digit Z of Read Digit Selector to Entry A.
Wire 1# 14 should lead from digit 0 of Read Digit Selector to Entry B.
Wire 1# 50 should lead from position 2 of Control Information to Punch B.

*

170Z
1652
160Z
145Z
140Z
1352
1904
19Z1

~

Card

M. Brubaker
R. Bieber
California Division of Highways
Sacramento. California

~

030
035
046
075
081
085
086
091
03.
341

430
430
430
430
430
430
430
430
001
430

GENERAL FREEWAY ASSIGNMENT

~
102·1
1103
1901
1011
175Z
170Z
165Z
lZ59
1053
lZ49

a. Purpose: The purpose of this routine is to compute time and distance on
a freeway system and then compare it to an existing system to determine
if the proposed freeway system would be adequate.
b. Range: The routine can handle any ten routing cards per routing.
years of trip data can be handled at one time.

65
16
16
20
65
16

1186
1826
18Z8
182.1
1116
1830
1832
20 1831

I.

1652
1602.
145Z
140Z
1352
1904
1921
1877

Add to the program the following instructions:

Fileno. 9. z. 036
Engineering Applications

IBM 650 Library Program Abstracts

441
451
461
471
481
491
501
511

Instruction
69
24
69
60
30
15
20
21
21
45

1309
1551
1021
8002.
0002
1551
1551
1821
1821
1l0Z

1103
1901
1030
175Z
1702
165Z
1259
1074
1074
1877

Fileno. 9.2.036 Cont'd

Addenda I Errata

Three
This is a revision of the block diagram for Block 430 to replace page 31
of the program write-up.

Accuracy: Not given.
Floating/Fixed: The entire routine is procened in fixed point.

Problem'SI

Block430

CalcWateTril'l&'lgned

c. Mathematical Method: Does not apply.
d. Storage Required: The entire drum is used. 1000 locations are used to
store cUIllulative time and distance between zones. For problems not
requiring this many zonal interchanges, additional locations can be made
available.
~

Not given.

Relocatability: Not given.
e. Remarks: Total vehicle miles and minutes for each alternate processed
are punched out at the end of the problem by the use of the end of file card
The program was written in SOAP 1.
f. 650 System: One 533 with 20 pilot selecton and 20 co-selectors required.
Special Devices: Alphabetic device.
Fileno. 9. Z. 036
Addenda/Errata

IBM 650 Library Program Abstracts
"General Freeway Assignment,

11

by M. Brubaker and R. Bieber.

The following additions should be made to the program

write~up:

An error has been discovered in the Freeway Assignment Program due to
rounding the computed trips assigned to the basic best freeway and second best
freeway routes.
In Block 430 of the program the trips assigned to the basic route were computed
by multiplying the per cent times the number of trips and rounding the results.
The trips assigned to the second best freeway route were obtained in the same
manner. Trips assigned to the best freeway route were obtained by subtracting
the sum of the basic and second best assignment from the' total number of trips.
This was done to insure assigning all the trips and never to assign more than
the total number of trips. However, if all of the trips fall into the two computed
categories and values are such that each computation is rounded up by one half
of a trip, the two computed categories have one more than the total trips to be
aSSigned, and the number of trips assigned to the best freeway trips becomes a
minus 1. The following corrections should be made in the program to use
decimal accumulation and avoid the result stated above.
Delete from the program the following instructions:

Block

430
430
430
430
430
43~

430
430

Card
36
46
81
91
341
401
411
421
431

Code

Lac.
1053
1024
1071
IZ59
IZ49
1103
11)01
1551
1752

IBM 650 Library Program Abstracts

LOADOMETER
Instruction
20
69
31
20
45
65
16
16
20

18Z1
10Z7
0002
laZI
1102
lOIS
18Z4
18ZZ
18Z3

1074
1030
IZ59
1074
1103
1901

1551
175Z
110Z

(Continued on next column)

w-6

Fileno. 9.2.037
Engineering Applications

TABLE

J. H. Harbour
California Division of Highways
California

Sacrame~tol

a. Purpose: Edit data and calculate per cent of overload on total weight and
each axle of trucks and truck combinations with one or more axles 18,000
pounds or more, and single unit trucks weighing 13 tons or more per
California Wheel Base Law and II AASHO", American Association of State
Highway Officials, recommenda.tions.
b. Range: A maximUIll of 1 axles per vehicle.

(Continued on next page)

147

Accuracy: Per cent violation to 1/10 of one per cent which is converted to

MatheInatical Method:

~

d.

Storage Required:

Does not apply.

Not given.

Floating/Fixed: Fixed decimal point.
Speed: Operates at read speed (200 cards per minute).
c. Mathematical Method: Arithmetic.
d. Storage Required:

Relocatability:

2000-word drum.

Remarks:

Speed: Approximately 700 vehicles per hour.
Relocatability:

f.

Not given.

Not in relocatable form.

None.

IBM 650 System: One 533 required.
SPecial Devices: Alphabetic device requlTp.d.

e. Remarks: Minor changes in program may be required subject to changes
in State Wheel Base Law and "AASHO",American Association of State
Highway Officials, recommendations.

IBM 650 Library PrDgram Abstracts

File no. 9.2.040
Engineering Applications

f. 650 System: One 533 required.
Special Devices: None.

DIGIT AL TERRAIN MODEL SYSTEM HORIZONT AL ALIGNMENT PROGRAMS
HA-I, 2, 3,and 4.

IBM 6SIl Library Program Abstracts

FIleno. 9.2.038
Engineering Applications

STRESS ANALYSIS OF OPEN-WEB STRUCTURES

Massachusetts Department of Public Works
C. L. Miller
R. A. Laflamme
Photogrammetry Laboratory
Massachusetts Institute of Technology
Cambridge, Massachusetts

C. W. Zahler
United States Steel Corporation

Purpose: HA-l. DTM Basic Horizontal Alignment Program:
Computes the geometry of a highway centerline defined
by coordinates of P. I. 's and the radii of the curves.
Relates the DTM Terrain Data Sections to this centerline
and computes the terrain elevation at the centerline for
each section.
HA-2, DTM Even Station Interpolation Program:
Takes the centerline terrain elevations (which are on odd
centerline stations) and interpolates for elevations on
even stations.
HA-3, DTM Parallel Offset Alignment Program:
Takes the same input as HA-I, includes the saIne output
but also computes the data for two parallel offset lines.
HA_4, DTM Special Alignment Georn.etry Program:
The same as HA-I except that it computes only centerline
geometry. It o;:an be used independently of the DTM System.

J. E. O'Keeffe
American Bridge Division
Pittsburgh, Pennsylvania
~.

Purpose: Several specific computer programs concerned with obtaining the
axial stresses in Inembers of an open_web system, together with their
relative geoInetry, provide a basis for a brief sketch of the various .phases
of development of the systeIn from conception to utilization.

b.

Range: Simple web, 99 panels;
Subdivided, 62 panels;
"K" type, 88 panels.
Accuracy:

Not given.
b.

Floating/Fixed: Fixed point arithmetic is used.
Mathematical Method:
d.

Storage Required:

The standard formulas are used.

Accuracy:

The entire drum.

d.

Remarks: This routine consists of several packages: Load Routine; Indexing
Register Simulator; Reaction program; Truss Geometry and Stresses: Simple
Web, Subdivided Panel, and "Kit System. Mathematical subroutines include:
SINE, COSINE, SINH, COSH, eX, LOGe' ARCSINE, ARCTAN,

Also,~2tb2-tc2, ~c2

Not given.

RelIlarks: HA-3 and HA-4 are options of HA-I.
but is loaded with HA-l.
f.

_ 2 ab COS (J.

Fileno. 9.2.039
Engineering Applications

DIGITAL TERRAIN MODEL SYSTEM TERRAIN DATA EDIT PROGRAM TD-l
Massachusetts Department of Public Works
C. L. Miller

R. A. Baust
Photogrammetry Laboratory
Massachusetts Institute of Technology
Cambridge, Massachusetts

DIGITAL TERRAIN MODEL SYSTEM VERTICAL ALIGNMENT PROGRAMS
VA-I and VA-2
Massachusetts Department of Public Works
C. L. Miller
R. A. Laflamme
Photogrammetry Laboratory
MassachUsetts Institute of Technology
Cambridge, Massachusetts
a.

Purpose: VA-I, Basic' Vertical Alignment Program:
This program computes the geometry of the vertical
alignment of a highway and computes the profile elevation
at each cross section. The input is the profile definition
data and the output of the DTM HA-I program.
VA-2, Highway Profile Geometry Program:
This program. computes the geometry of the vertical
alignment of a highway and computes the profile elevation
at even stations along the alignment. The input is the
profile definition data and the increment between even
stations. Can be used independently of the DTM System.

b.

Range:

Purpose: The Digital Terrain Model (DTM) System Series of computer
programs requires the terrain data to be in a certain format and to meet
a set of specifications. This program checks the terrain data to insure
that it is in the proper format and meets the required specifications. Error
cards are punched to identify terrain data cards and points which are not in
proper format or sequence.
Range:

Doe 5 ;not apply.

Accuracy: Does not apply.
Floating/Fixed:

148

Fileno. 9.2.041
Engineering Applications

IBM 650 System: One 533 required.

IBM 651l Library Program Abstracts

b.

HA-2 is a separate program

IBM 650 System: One 533 required.

IBM 6SIl Library Program Abstracts
I.

There are 200

Not given.

RelocatabHity:

Y;-,\IiAi.

_ a2 _ b2 ,

Storage Required: HA-I, 2, 3,and 4 are loaded together.
locations available.
Speed:

In the right triangle a, b, c, any of the following are computed, with or
without their natural functions:

~a2-tb2

All lengths and distances are computed to three decimal places.

Mathematical Method: Coordinate transformations and trigonometry are used.

Not relocatable.

~£z7,FT.

Maximum number of

Floating/Fixed: Fixed point arithmetic is used.

Speed: Not given.
Relocatability:

Range: Maximum number of horizontal curves is 50.
points per cross section is 200,

Does not apply.

(oontinued on next oolumn)

Maximum. number of vertical curves is 98.
(Continued

OD

next page)

B - 650
Accuracy; All·lengths and distances arc computed to three decimal places.
Grades are computed in decimal form and arc carried out to ten decima.l
places.
Floating/Fixed:

Fixed point arithmetic is used.

Mathematical Method:
d,

Storage Required:
Speed:

Remarks: The routine can handle only ten routing cards per· routing. Three
years of trip data can be handled at one tim.e. Total vehicle miles and
minutes for each alternate processed must be punched out on com.plction'
of the problem. by the use of a special punch routine. The prograITl is written
in SOAP I.
•

Standard parabolic vertical curves are used.

VA-l and VA-2. are loaded together and use 600 locations.

f.

IBM 650 System.:

One 533 required.

Special Devices; Alphabetic device, 10 extra pilot selectors (for a total
of 2.0), and lZ extra coselectors (for a total of 2.0) are required.

Not given.

Relocatability:

filtno.9.2..043
Addenda!l;:rrata

Not in relocatable form.

IBM 650 Library Program Abstracts
Remarks;

f.

None.

IBM 650 System: One 533 required.

"San Diego Freeway Assignment,"

by M. Brubaker and R. Bieber.

The following additions should be made to the program.

IBM 650 Library Program Abstracts

FiI~ 110.
9.2..042.
Engineering Applications

DIGITAL TERRAIN MODEL SYSTEM PRELIMINARY EARTHWORK PROGRAM
EW-2.
Massachusetts Department of Public Works

C. L. Miller
R. A. Laflamme
PhotogralTllTletry Laboratory
Massachusetts Institute of Technology
Cambridge, Massachusetts
Purpose: This is the basic progralTl for cOlTlputing earthwork quantities in
location studies. A si:mplified template is used for the efficient evaluation
of a number of trial lines. The input is the template definition data, the
DTM terrain data deck, and the output of the DTM VA-l program. The
output is the template definition data for each section and the volumes at
each section.

In Block 430 of the program the trips assigned to the basic route were com.puted
by multiplying the per cent times the number of trips and roundin~ the result.
The trips assigned to the second best freeway route were obtained in the same
m.anner. Trips assigned to the best freeway route were obtained by subtracting
the sum of the basic and second best assignment from the total number of trips.
This was done to insure assigning all the trips and never to assign m.ore than
the total number of trips. However, if all of the trips fall into the two cornputed
categories and values are such that each computation is rounded up by one half
of a trip, the two computed categories havt: one more than the total trips to be
assigned, and the number of trips assigned to the best freeway trips becomes
m.inus 1. The following corrections should be made in the program to use decim.al
accumulation and avoid the result stated above,
Delett: from the program the following instructions:

Block
b.

Range:

Volum.es are com.puted to the nearest cubic yard.

Floating/Fixed:

Fixed point arithm.etic is used.

Mathematical Method:
the volumes.

The average end area method is used to compute

Storage Required: Program. uses 1900 locations.
Speed:

Not given,

Relocatability: Not in relocatable forITl.
Rem.arks:
f.

Card

Code

Lac.

Instruction

MaximUlu number of points per cross section is 2.00.

Accuracy:

d.

write~up;

An error has been discovered in tho;: Freeway Assignment Program. due to
rounding the computed trips assigned to the basic best freeway and second
best freeway routes.

None.

IBM 650 System.: One 533 is required.

430
430
430
430
430
430
430
430
430
430
430
430
430
430
430
430

36
46
81
91
341
401
4ll

1603
1474
1461
1509
1417
1852
1902
1994
1546
1496
1646
1596
1746
1995
1846
1996
1946

·1:2.1

431
441
451
461
471
481
491
SOl
5ll

16

1810
142.7
0002
1810
1370
1565
1812.

lb

1810

20
69

31
20
45
65

1413
1380
1509
1413
1471
190Z
1994
1546
1496
1646
1596
1746
1995
1846

20 1811
65 1404
16 1813
16 1815
20 1814,
65 1364
16 1816 1996
16 1818 1946
20 1817 1471

Add to the program the following instructions;

IBM 650 Library Program Abstracts

Filtno. 9.2..043
Engineering Applications

SAN DIEGO FREEWAY ASSIGNMENT

M. Brubaker
R. Bieber
California State Division of Highways
Sacram.ento, California
Purpose: This routine com.putes time and distance on a freeway system. and
com.pares this data with that of a basic system to determ.ine whether the
proposed freeway system would be adequate.
b.

Range:

Not given.

Accuracy:

Card

030
035
046
075
081
085
086
091
036
341

Code

Loc.
1474
1852
1994
1461
1546
1646
1596
1509
1603
1417

Instruction

69 1309
24 1902
69 1427
60 8002
30 0002.
IS 1902.
20 1902
21 1810
21 1810
45 1370

1852.
199-}
1380
1546
1646
1596
1509
1413
1413
1471

Addenda/Errata

Fixed point arithmetic is used.

Mathematical Method:
d.

,130
430
430
430
430
430
430
430
001
430

FilttJo·9.2.043 Cont'd

Not given.

Floating/Fixed:

Block

This is a revision of the blOCk diagram for Block 430 to replace page 12
of the program write-up.

Not applicable.

Storage Required: The entire drum. is used. Gum.u1ative time and distance
between zones are stored in lZ99 locations. For a problem. not requiring
this m.any zonal interchanges, additional locations can be m.ade available
to the routine.
Speed:

Not given.

Relocatilbility:

Not relocatable.

(Continued on next column)

(Continued on next page)

149

a.

Purpose: The basic purpose or-this program is to compute the coordinates
of the point of intersection of a given line with a line offset a given distance
from a Talbot spiral, the radial bearing at this point and the distance along
the offset line from the beginning of the spiral. It will also compute the length
and bearing of lines joining successive sets of coordinates. The coordinates
developed in one problem may be stored for use in later problems.

b.

Range: Only one spiral at a time may be used, but an unlimited number of
problems based on this spiral may be calculated. An unlimited number of
distances and bearing computations is possibie.
Accuracy: Distances are given to thousandths of a foot and bearings to
seconds.
Floating/Fixed: Input and output are in fixed pointi floating point is used
within the program.
Mathematical Method: Intersection is found by iteration.

d.

Storage Required: The program occupies 176Z storage locations.
Speed: The cOInputations for each intersection require approximately 30
seconds. Distance and bearing computations proceed at about 30 per minute.
Relocatability: Not relocatable.
Remarks: The program is written in SOAP I form.
SOAPTiiiterpretive Routine, File No. Z. O. 001.

f.

It uses portions of

IBM 650 System: One 533 required.
Special Devices: Alphabetic device required.

IBM 650 Library Program Abstracts
IBM 650 Library Program Abstracts

Filt! no. 9. Z. 046
Engineering Applications

9. Z. 044
Engineering Applications
File no.

PROFILE GRADE

EARTHWORK OAT A CHECK

J. Oakes
Oregon State Highway Department
Salem, Oregon

K. F. Kohler
R. R. DeClark
Bureau of Public Roads
Portland, Oregon

a.

a.

Purpose: This program indicates and locates all probable major errors,
~s or deviations contained in design earthwork data, When an error
or significant deviation is detected, an errOr card is punched which indicates
and locates the deviation or error.

h.

Range: Minor errors are not detected. The break_point between IDajor
errors and minor errors may be designated by the design engineer. This
program does not contain program stops. The amount of input or output
is unlimited. The routine checks Earthwork Design Data Cards in any of
the following arrangements:

1.
2.

Purpose: This routine computes gradients between PI's and

profn~

grade

~s for either defined incremented stations or selected stations.

Type "0, II "p' or r'2," separately
Type "0" combined with type Ill" or type 11211

The program will compute :lor either plus or minus stationing and in either
ascending or descending order. It will handle both horizontal and vertical
equations caused by c.hanges in datum. or di:lferences in depth of surfacing.
b.

Range: The program will handle up to 98 changes of grade.
Accuracy: To hundredths for all factors except grade, which is to ten
~9. Stationing may be selected to either the nearest foot or the
nearest hundredth of a foot.
Mathematical Method: Standard.

d.

Storage Required: The program requires approximately 1950 storage
locations.

Accuracy: Not given.

~

Floating/Fixed: Fixed point.

Relocatability: Not given.

Mathematical Method: Simple arithmetic is used.

The routine operates at full punch speed.

~

d. Storage Required: The program and data use 1960 storage locations.

f.

None,

IBM 650 System: One 533 required.
Special Devices: Ten extra pilot selectors (for a total of 20) are required.

Speed: The progr

4.>
Relocatability:

5.0
5.8

Not relocatable.

6.6

(Continued on next column)
Relocatability:

Not relocatable.

151

Remarks: The program is self-restoring and punches codes for obvious
errors in input data. NOTE: ONLY the program deck is available in the
normal manner through the IBM 650 Program Library. Requests for
information regarding the availability of the detailed write-up should be
sent to the author.
f.

A. L. Stewart
IBM, Tulsa, Oklahoma
R. J. Jacobs
Sunray Mid-Continent Oil Company
Tulsa, Oklahoma

IBM 650 System: One 533 required.
Purpose: This program calculates area and traverse data for the typical
land survey. Input used is standard surveying notation, i. e., metes and
bounds, and is in the form of one card per course. Distance may be in
either feet or varas. The survey may be a closed traverse or may have
one unknown side. Results are punched one traverse per card. If it is a
closed traverse, the following information is punched: identification, bearing
and length of error of closure, number of measured courses, ratio of
precision, and area in acres (after balancing). The adjusted be<}ring and
length of each course may also be obtained if desired. If the traverse
contains an unknown course, the bearing and length of that course and the
area of the traverse including that course are punched in addition to
identification and number of measured courses.

Filt no. 9.2.052
Engineering Applications

IBM 650 Library Program Abstracts

AUTOMATIC MINIMUM WEIGHT DESIGN OF STEEL FRAMES

R. L. Stone
Division of Applied Mathematics
Brown University
Providence, Rhode Island
Purpose: Given the centerline dinlensions of a plane structure and the loads
acting upon it, this program computes the bending moment distribution which
minimizes the structural weight.
b.

b.

Range: Frames up to and including 3-bay, 4_storey or 4_bay, 3-storey.
Accuracy:

Floating/Fixed: Not given.

Not given.

Floating/Fixed:

Mathematical Method: Balancing is achieved by means of the compass rule
and area is calculated by double-meridian distances (DMO). Library
subroutines used are from IBM Technical Newsletter No.9 for sine,
cosine, and arctangent. A trace subroutine (IBM Bulletin No. 135) is
also included.

Fixed Point.

Mathematical Method: A method which was devised by J. Hcyxnan and
W. Prager of the Division of Applied Mathematics of Brown University.
d.

Range: The program handles any traverse with up to 200 courses.
Accuracy: Distances are given to thousandths of feet or varas and bearings
to hundredths of seconds. Area, in acres, is computed to four decimal
places. Subroutine functions are computed to nine decimal places.

Storage Required: The entire drwn is used.
d.
Speed: Varies considerably with the size of the frame being designed.
following examples are typical:

The

Speed: Approximately 3000 courses per hour.

1. A one-bay, one-storey frame was designed in 3 minutes.
2.
3.

Storage Required: This program, including subroutines, requires about
1000 storage locations. There are 650 more storage locations reserved
for tables.

A two-bay, two-storey frame was designed in one hour and 45 minutes.
A three_bay, three_storey frarn.e was designed in slightly over 4 hours.

Re1ocatability: The program is considered optimized and is not in
relocatable form.

Relocatability: Not relocatable.
Remarks: To obtain correct areas, the courses must be in order; and
in any case all the cards for a given traverse must be together. Except
for double punches and blank columns, there should be no foreseeable
machine stops. Error cards are punched and the program proceeds to
the next traverse automatically.

Remarks: The program is completely automatic, requiring no intermediate
intervention by the operator. It consists of 15 subroutines (a total of about
2400 instructions).
f.

IBM 650 Systern.: One 533 required.
f.
Filtno. 9.2.053
Engineering Applications

IBM 650 Library Program Abstracts

IBM 650 System: One 533 required.
Special Davices: Alphabetic device is required.

BPR REVISION OF OREGON HORIZONTAL ALIGNMENT PROGRAM

IBM 650 Library Program Abstracts
K. F. Kohler
C. L. Borstad
Bureau of Public Roads
Portland, Oregon

Purpose:

GEORGIA EARTHWORK PROGRAM

This program will compute curve and spiral data. and stationing

~dinates, for curve points of a projected alignment when the

coordinates of the P. I. ts are scaled from a,detail map and the degree of
curve and length of spirals are assigned.
b.

+

Range: Stationing (S5S5
S5.SS). all distances, and coordinates are full
~l range and to two decilllal placesi angles (DDDMMSS) and bearing
(DDMMSS) are either as indicated or selectable to the nearest 30 seconds
or minute.
Accuracy:

H. Wesson

R. Arbuckle
IBM, Atlanta, Georgia
Purpose: This program is designed to calculate the following:
For the Design Problem:

Computations are in floating pointi input and output are in

Mathematical Method:
circular curve.
d.

W. L. Anderson
T. R. Smith
R. M. Pryor, Jr.
State Highway Department of Georgia

Consistent with normallllanual methods.

Floating /Fixed:
fixed point.

Based on Talbot Spiral using 'tArc

tl

Cut, fill, fill plus shrinkage volurn.es
Mass ordinates
Slope selection
Slope stake offset and elevation
Summarization of cut and fill volumes at five station intervals

definition of

Storage Required: Approximately 1888 storage locations are used.

For the Final Pay Problem:

Speed: Computing time is approximately 18 seconds per simple curve and
~onds per spiraled curve.
Remarks: The program is written in SIR (2.

o.

Cut, fill, fill plus shrinkage volumes
Mass ordinates
Borrow pits

001).
b.

f.

FiitJ'lo. 9,2.055
Engineering Applications

~:

Not given.

IBM 650 System: One 533 required.
Special Devices:

Accuracy:

Alphabetic device is required.

Not given.

Floating/Fixed: Fixed decimal.

IBM 650 Library Program Abstracts

Filtno. 9.2.054
Engineering Applications

Mathematical Method: The average end_area lllethod.
d.

LAND AREA - SURVEY TRAVERSE
(Continued on next column)

152

Storage Required: Approximately 1,200 storage locations are used for the
program and approximately 600 for the tables.
(Continued on next page)

B - 650
~:

Rem.arks:
f.

Purpose: This program computes the necessary information needed for
detailing a tangent bridge. The information calculated includes the following:

Eight to 15 m.inutes per m.ile.

Relocatability:

Not given.

1.
Z.
3.

None.

IBM 650 System.: One 533 required.

IBM 650 Library Program Abstracts

·L
5.

Fileno. 9.Z.050
Engineering Applications

6.
b.

The station of a point.
The P. G. elevation of a point.
A longitudinal distance back to the preceding point.
A skewed distance along the centerline of a substructure clement, from
one point to the next succeeding point.
A final surface elevation.
A total skewed distance from a point to the centerline of survey.

Ran~c:

The maximum number of points on any substructure clement is 20.
Any number of substructure elements are allowed.

THREE-POINT SOLUTION
Accuracy:

D. Geister
Oregon State Highway Department
Salem. Oregon

All calculations are accurate to at least three decimal places.

Floating/Fixed:

Fixed decimal.

Mathematical Method: Elementary arithmetic, algebra and trigonometry.
Purpose: This program is designed to compute the coordinates of a point
by the Three~Point method. It can handle from three to nine known points
computing a solution for every combination of three known points. The
selection of the most desirable solution is left to the engineer submitting
the data.
b,

d.

Storage Required: The program requires the first 725 drum storage locations;
subroutines Included require about ~50 additional locations.
Speed:

~:

From three to nine known points are acceptable in the input data.
The output will include every combination of three points.

The time required by the program is approximately as foHows:

58 + O. 5n seconds, where n is the number of points to be computed.
Re1ocatability:

Accuracy:

Not given.

Not given.
Remarks:

Some precautions which should be ob:.erved arc:

Floating/Fixed: Floating decimal, using SIR.
Mathematical Method: Three-point solution; see the program
for further details.

d.

Storage Required:

1.

write~up

Not given.

f.

3.

~:n~:~res:~e:~e9~~;;~\::~.eed the problem format. Any Dl distance

IBM 650 System: One 533 required.

Remarks: Subroutines used in SIR are Float. Fix. Sin, and Cos.. For best
results, angles greater than ZOo should be used. Three-point problems in
which aU points including unknown are on a circle have an infinite number of
solutions, anyone of which the program may produce as its result.
f.

Negative information must be identified by a negative overpunch in the
units position of the appropriate input word.
A plus sign need nat be punched for any value other than in the first
word of data cards 3 and 4 (column 8). In these words, the overpunch
serves to identify the card as having ten words of information in it.

1,700 storage locations.

Speed: Not given.
Relocatability:

2.

Special Devices: None required.

IBM 650 Library Program Abstracts

IBM 650 System: One 533 required.

Fi/tno. 9.Z.0S9
Engineering Applications

CIRCULAR CULVERT ANALYSLS

IBM 650 Library Program Abstracts

Fileno. 9. Z. 057
Engineering Applications

R.N. Boden
Ohio Department of Highways
Columbus, Ohio

MOMENT AND REACTION INFLUENCE LINE ORDINATE FOR SYMMETRICAL
3-SPAN OR 4-SPAN CONTINUOUS GIRDER BRIDGES

Purpose: This program determines the proper method of analysis for a
culvert acting under a given set of conditions and determines the most
economical size of circular section.

J. W. Chambers
C. Cook
B. Williams
Bridge Design Division
Alabama State Highway Department
Montgomery, Alabama

b.

Range: Maximum design discharge is 9999 cis; maximum length of conduit
is 999 feet. Circular pipe sizes analyzed by the program range from 12 in.
to 108 in.
Accuracy:

Purpose: This program calculates moment and reaction influence line
ordinate for synunetrical 3-span or 4-span continuous girder bridges
with constant moment of inertia, or for symmetrical 3~span or 4-span
continuous concrete girder bridges with parabolic haunches at the
intermediate supports (with limitations as stated in program write_up).
b.

All machine calculations are rounded to five decimal places.

Floating/Fixed:

d.

Fixed decimal.

Mathematical Method: A variation of the slope-deflection principle,
d.

Fixed decim.al arithmetic is used.

Mathematical Method: Primarily, algebra and trigonometry. Manning's
Equation is used to compute the hydraulic values of conduits flowing full.
Chezy's Formula is the basis for computing the hydraulic clements of partially
full conduits.

Range: See the program write-up.
Accuracy:

Not given.

Floating/Fixed:

Storage Required: 959 drum storage locations are reserved for tables,
subroutines and loading routines; 1034 locations arc required for the program.
This leaves seven remaining storage locations; however, additional drum
storage space may be found within the area reserved for the Square Root
Subroutine.
Speed: This is a function of the type of analysis chosen by the program to
compute the hydraulic elements of the conduit.

Storage Required: Not given.
Speed: Not given.

Relocatability:

Not relocatable.

Relocatability: Not given.
~:

f.

Remarks: The program is primarily designed for checking culvert designs;
however, an additional feature is included whereby a culvert may be designed
provi.ding certain conditions exist. SOAP symbolic deck listing is included.

None.

IBM 650 System: One 533 required.
f.

IBM 650 Library Program Abstracts

Fi/tno. 9.2.058
Engineering Applications

STRAIGHT LINE BRIDGE GRID SYSTEM
D. L. Herke
Ohio Department of Highways
Columbus, Ohio

IBM 650 System: One 533 required.
Special Devices: Alphabetic device. However, the'program can very easily
be revised to operate without this device.

IBM 650 Library Program Abstracts

File no. 9. Z. 060
Engineering Applications

(Continued on next column)
3-SPAN CURVED CONCRETE SLAB BRIDGE PROGRAM

(Continued on next page)

153

interpolation is used giving a better representation of the terrain than straight
line interpolation (used in the DTM HA-Z Program, IBM 650 Library Program
File Number 9. Z. 040).

D. L. Herke
Ohio Department of Highways
Columbus, Ohio
b.

Purpose: This program is designed to generate and compute a station
number; a profile grade elevation; an X and Y coordinate; and a final surface
elevation for a number of specified and given points on the abutments and
piers of a 3~span curved concrete slab bridge.
b.

~

R

~

The increment between even stations may be any positive, nonzero number.

Z.

A profile having any number of points may be used.

Floating/Fixed: Fixed decimal arithmetic is used.

316zz6. 00 ft.

Mathematical Method: Aitken's method of iteration is used to compute the
polynomial.

89 0

00 - I' 05 11 :i: D :i:
_ 59'59",
where D = Degree of Curvature
For Sl - SZ' incl., O.OOO:S S

1.

Accuracy: The output has as many significant digits as the input.

Range: The range of the important portion of the input data is as fallows:
For RI - Ro' incl., 0.01 ft.

Range:

s: 99. 999

d.

For -&, 0  distance to horizontal and verti.cal components.
The program may also be used to reduce any known slope distance in
meters or feet to horizontal and vertical components. In this case
also, either the vertical anglc or difference elevatIon must be used.
b. Restrictions, RanSe:

Fixed point.

Computed to 1/100th foot.

c. Method: The mathematics used closely follows the hand calculated
procedure making numerous decisions Collowing the standard rulcs oC the
program. IBM Library SIN routine is utillzcd.
d. Storage Requirements: Uses apprOXimately 905 location a including table
areas. Will process approximately twenty-nyc input problems per minute.
e. Remarks:
Blocks 160 and 170 or program are tolerance tests and the
limits used as constants meet requircments of this organizatLon but may
not be required by other users.
f. IBM 650 System:
Alphabetic device and special shift utilized although not
necessary. Otherwise minImum 650.

A 650 with half-time emitters and alphabetic device is

IBM 650 IJbrary Program Abstracts
IBM 650 IJbrary PrDgram Abstracts

C. L. Miller

REVISED TRAVERSE AND HORIZONTAL ALIGNMENT

L. E. Nihen
D. E. Weisberg
Ci.vil Engineering Computer Laboratory
Massachusctts Institute oC Tec.hnology
Cambridge, Massachusetts

Purpose: The routine will calculate traverses with two unknowns or with
no unknowns in each traverse. Input is in the fonn of one course per
card. Results are punched one course per card and show identification,
distance, bearing, latitude, departure, and coordinates for regular
c.ou:t'ses and also c!Oliure error. Areas for closed figures and segment
areas are computed. Although two solutions are mathematically possible
for some combinations of unknowns within a single traverse, only real
liolutions are presented as output. The routine will also compute horizon~
tal circular curve problems having either the ending station or the radial
bearing to the ending station unknown. Factors in anyone horbontal
curve or traverse problem may be stol'ed for use in a later problem.
Only factors which are luIown in a traverse may be stored for recall within
the same traverse. Bearings stored as interdependency factors can be
used as base lines for deflection.

?urpose: The EA-Z program is used to evaluate land or other zonal
~henever the area of interest can be divided into classified zones.
The most apparent use of "this program is the evaluation of right-oC~way
costs for various highway alignments. The input to the program is zone
type and cost data presented at DTM scan lines and right-of-way limits.
The output is the amount and the cost of ten different classes of land falling within the right_of_way limits.
b.

Accuracy: Areas to nearest thousandth of acre and cost to nearest cents.

d.

Plane geometry.

Storage Required: Entire drum is used.
Relocatability: Not relocatable

RaIl.l!je: Ea.ch tra.verse may have a maximum of ZO regular courses.
e.

Floating/Fixed: Does not apply.

f.

Storage Required: One hundred ninety storage locations are required for
regular table storage. Eighty locations are required for interdependency
table storage. Other program and temporary storage requirements U5e
the remainder o( the two thousand drum locations.

Range: 650 sean lines.

Mathematical Mcthods:

Accuracy: Distances are given to thousandths of feet and bearings to
seconds. Functions are computed to nine decimal places. Area is cal_
culated to square feet and thousandths of acres.

Mathematical Method: Library subroutines are from Technical News_
letter 119 for sine, cosine, and arctangent. Area is calculated using the
criss-cross method.
d.

9.2.086
DTM ZONE-COST EVALUATION PROGRAM EA_Z

S. F. Persselin
J. Vliet
California Division of Highways
llz0 N. Street
Sacramento, California

b.

Fileno.

File no. 9. Z. 084

Remarks: This program operates in conjunction with 9. Z. 040 DTM
~l Alignment Program and is one of a series of programs in the
Digital Terrain Model System.
650 System: Minimum 650
Special Devices:

Alphabetic device is used to punch "Total" card.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

9.3.001

~

Speed is approximately two thousand courses per hour. The program is considered optiInum and should not be relocated although the
program is in SOAP I terminology.

~:

IBM 650 IJbrary Program Abstracts

f.

DETERMINATION OF COEFFICIENTS FOR THE
BENEDICT EQUATION OF STATE

The program has several routines which test for invalid data

Fileno. 9. Z. 084

C. R. Hobby
University of Houston
Computing and Data Processing Center
Houston, Texas

in the various problem types, and when errors are detected, coded stops
will occur.

a) Determin:;ltion of Coefficients [or the Benedict Equation o[ State.

IBM 650 System: A 650 with alphabetic device and read half-tUne emitter
is used.

b) Floating point (SOAP - SIR)

IBM 650 IJbrary Program Abstracts

Fileno.

9.Z.085

MODEL" GEODIMETER

c) Special least square fitting originally developed by Brough, H. W., Schlinger,
W. G., and Sage, B. H., Industrial and Engineering Chemistry, ~, p. 2442,
November, 1951.
d) Entire drum is used.
Speed: (7N + 140) seconds [or Urst set of coe[[icients, (1. 5N + 140) [or succeeding
sets,
2N seconds [or statistical summary.
N = the number o[ data pOints.

Virgil T. Green£teld
Division of Highways
Planning Survey Department
Division of Highways
Sacramento, California

a. Purpose: To take readings {rom the Model 4 Geodimeter and compute the
slope distance between two points. Usin~ the vertical angle measured

e) Does not apply.

f) MinimUm 650.
(Continued on next column)

159

Fileno. 9.3.002
Engineering Applications

IBM 650 Library Program Abstracts

THERMODYNAMIC PROPERTIES AND PHASE BEHAVIOR OF LIGHT
HYDROCARBON MIXTURES

J. H. Erbar
R. N. Maddox
OklaholTla State University
Stillwater, Oklahoma
a.

W. Edwards
E. 1. Organick
L. Larrey
Computing Center
University of Houston
Houston, Texas

b.

Range:

Not given.

Accuracy: Not given.
Floating/Fixed: Input and output are in fixed point notation.
are carried out in floating decimal notation.

a. Purpose: Computes density, com.pressibility factor, enthalpy, entropY.
and equilibrium ratios of single and two phase systems.

Calculations

Mathematical Method: The conventional relative volatility method of Lewis
and Matheson is used in this program.

h. Range: Handles mixtures with up to nine components.
Accuracy: Not given.

d.

Floating/Fixed: Single precision floating point with input and output data
supplied in fixed point (Humble floating point interpretive routine),

Storage Required: This program uses approximately 1500 storage locations
scattered over the entire drum.
Speed: With heat balances, the speed is approximately 0.6 seconds per
component-tray per trial. Without heat balances, the speed is approximately
0.3 seconds per cOlTlponent~tray per trial.

c: Mathematical Method: Rigorous thermodynamic solution based on:
1.

Purpose: This program will determine the separation that can be obtained
The calculations Jl.re based on a given number
of stages, reflux ratio, distillate rate, feed plate location, and feed
cOlTlposition.

~istillation column.

Benedict, Webb, Rubin Equation of State for pure components and
mixtures; and

Relocatability;

Nat in relocatable form.

~

2.

The program is limited to a maxilTlum of 20 components and 98
theoretical trays. It is further limited to a single feed stream, two-product
system.

Zero pressure therm.al properties of pure components.

d. Storage Required: Approxim.ately 100 unused drum locations.
f.
Speed: Speed depends upon number of phases, num.ber of components, and
on option to compute enthalpy and entropy.

IBM 650 System: On~ 533, automatic floating decimal arithmetic feature,
lAS, and inde,dng registers.

Relocatability: Program is non-relocatable.

IBM 650 IJbrary ProlJl'am Abstract.

Filln". 9.3.005

e. Remarks: None.
f. 650 System.: One 53.3 required.

MOMENTS OF INERTrA POLYATOMIC MOLECULES

Special Devices: None.

Fil~no.

IBM 650 Library Program Abstracts

9.3.003

Engineering Applications

CALCULATION OF THE LEAST-SQUARES BEST HALF-WAVE POTENTIAL
AND SLOPE OF A POLAROGRAPHIC WAVE
.
D. L. McMasters
W. B. Schaap
Indiana University
Bloomington, Indiana

E= El/2+~10g(~...=...i) ,
n

i

by the method of least squares using current-voltage data taken from a
polarogram.
Range: This program is set up to analyze only polarographic reduction waves.
Accuracy:

Not given.

Floating/Fixed:

Floating decimal arithmetic is used in the Bell Labs System.

Mathematical Method: See a. above.
d.

Storage Required: Most of the locations from 0100 through 0400 are used
by the entire program.

c. Method: The product oC the three principal moments of inertia is computed
~iTschfeldeT'sl method.
d. Storage Requirements: The progTam uses 595 storages including the storage
routine. and the floating decimal sub-routine and instructions for the program.
The time required for the com.putation depends upon the number of atoms,
being approximately expressed by 3 n seconds where n is the number of
atoms.
e. Remarks: It is also possible to calculate each of the thTee principal moments
of inertia from the i2termediate results of this computation, by using the
additional program.
f. IBM 650

System:

MiniqlUm IBM 650.

1. J. O. Hirschfelder; J. Chern. Phys. B. 431 (1940)
Z. G. J. Janz and Y. MikaWil; Molecular-Spectroscopy, Part II, IBM 650
Library Program.

Speed: The entire routine requires just 15 seconds for each complete
calculation.

IBM 650 IJbrary Program Abstract.

Relocatability:

STATISTICAL THERMODYNAMIC PROPERTIES

The program would be difficult to relocate.

Remarks: This program, written in the Bell Labs Interpretive System (see
TNL No. 11), was designed for poiarogralTls recorded by the Sargent Model
XXI Visible Recording Polarograph; however, with only a few obvious and
minor changes in the recording of the data (and not in the program.), this
program can be adapted to other manually and electronically recorded
polarograms.
f.

a. Purpose:
The product of the three principal moments of inertia Is
computed fOT a rigid polyatomic molecule, provided the location of the
constituent atoms are known with the reference to an arbitrary Cartesian
coordinate system and atomic weights of the component8 al"e given.
b. Restrictions, Range:
Providing the molecule may be assum.ed rigid, any
type of m.olecular system can be tTeated. The floating decimal Corm is used
in the whole computation.

Purpose: This program. calculates the half-wave potential and slope of a
polarographic wave,

b.

George J. Janz
Yuklo Mikawa
Department of Chemistry
Rensselaer Polytechnic Institute
Troy, New York

IBM 650 System: One 533 required.

IBM 650 Library Program Abstracts

Fileno. 9.3.004
Engineering Applications

Filtn".

9.3.006

Gcol"ge J. Janz
Yukio Mikawa
Department of Chemistry
Rensselaer Polytechnic Institute
Troy, New York
a. Purpose: The thermodynamic functions: (H o - Hi)/T, C~, - (F o - Hg) T
and SO are computed from the fundamental vibrational fTequencie8. the
product of the Inertia, syntmetry number and molecular weight of the
polyatomic molecule.

(Continued on next page)
PLATE-TO-PLATE CALCULATIONS

160

(Continued on next column)

B - 650

b. Restrlctlons, Range: The progr.:t.m calcul.:t.tes the above properties or any
poiyatomlc non-linear molecular system In the Ideal g.:t.seous state (or the
rigid rotator - simple bivrator model. The contributions [or hindered
internal rotation cannot be gained by thlll program. The mathematical
accuracy is"t. 0.00001 unit.
c. Method: The calculatLons or the exponential and the logarithmic function II
~de by the use of the sub-routine.
d. Storage Requirementa: The number of storages used for the whole
computation is 504. When the number of the fundamental frequencles Is
nine, the time reqUired for the computation for an assigned temperature
Is I.Z sec.
e. Remarks:
Either the vibrational contribution or the sum of the translational
~onal contributions may be calculated separately.
f. IBM 050 System:

IBM 650 Library Program Abstracts

Filt: no. 9.4.003
Enginccring Applications

FIFTY BUS LOAD FLOW PROGRAM
R. J. Brown
W. F. Tinney
Bonneville Power Administration
Portland, Oregon
a. Purposc: This program is designcd to solve electric utility power network
flow problcII1s for systems of no more than 50 busses and seven lines per
bus.
b. Range: The scaling was dcterII1ined experimentally to accoII1II1odate the
range of data in problems solved at Bonneville. This scaling may not be
satisfactory for all other systems. A power base of I pu
100 MVA is used.

Minimum, IBM 650.

=

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER 9.4.001

Accuracy: Not given.
Floating/Fixed: Arithmetic is in fixed point.
c. Mathematical Method: The Gauss-Seidel method is used.

ELECTRICAL POWER SYSTEM TRANSIENT STABILITY CALCULATIONS
d. Storage Required: The program uses almost all drum. locations.
Speed: Approximately one hour is required for an average system.

J. E. Rowe and J. L. Gabbard, Jr.
Union Carbide Nuclear Ca .• Oakridge, Tenn.

November 1, 1956

a) It is possible to make the transient stab1Uty calculations for any system that
can be represented by 19 eQ.uivalent machines or tess. However. if the
number of equivalent admittances required to represent the network does not
exceed 200, a program limit of approximately 50 machines is possible
( a 30 machine system has been studied ). Induction machines as well as
syt'lChronous machines can be handled.

RelocatabUity: Program is not relocatable.
e. Remarks: Considerable study is necessary far effective operation of the
system.

f. 650 SysteIIl: One 533 required.
Special Devices: None.

b) Uses fixed deCimal arithmetic.
c) Uses transient stability theory, symmetrical component theory, and network
theory. Makes use of Starr's equivalent circuit for the n - terminal network
expressed in matrix farm and as admittances rather than impedances.
Calculations are made in the per unit system and care must be exercised
in .selecting the system base in order to avoid field excess ions with the
fixed decimal program. The transient stability differential equations
are solved using the method of 1st order forward dlfferences.
d) Uses 718 wards plus data and output. Time approximately 1 1/2 - 2 1/2
hours depending an variables.

IBM 650 Library Program Abstracts

Filt:no. 9.4.004
Engineering Applications

IMPROVED DIGITAL SHORT CIRCUIT SOLUTION OF POWER SYSTEM
NETWORKS
M. J. Lantz
Bonneville Power AdIIlinistration
portland, Oregon
a. Purpose: Precalculates short circuit currents at various possible locations
in the system.

e) Contains an excellent flow chart.

o Minimum 650.

b. Range: Solves a 20 x ZO matrix which is equivalent to a network having 45
impedance elements.

FILE NUMBER 9.4.002

650 LIBRARY PROGRAM ABSTRACT

Accuracy:

Not given.

Floating/Fixed: Floating point.
c. Mathematical Method: Loop equations are used to reduce matrix size.
d. Storage Required: Not given.
Speed: Solution time per fault is approximately. 00Z5 N 3 minutes, where
N is the matrix size.

NETWORK REDUCTION

P. E. Scott and E. M. Kidd
Union Carbide Nuclear Ca., Oak Ridge, Tenn.

October 19, 1956

RelocatabUity: Not given.
e.~

a) A network reduction program - dlscribes an automatic method of reducing
an electrical power network to a smaller equivalent network.
b) Limitations as to size of matrix to be handled are nol: 20, n2+ nb ~ 800
n=order of M

Special Devices: None.

b=order of K

Uses floating point arithmetic. The matrix of coefficients for the entire
system is partitioned into M and K which represent those junctions to be
eHminated and those to remain respectively.
c) Matrix theory and network theory.
d) Approximate time (. 576n 3+ 1. 273nb+ .726) seconds storage required·
460 wards plus data and output.
e) Number of output cards = 1+ b(b+l) /2
Has an excellent flaw chart. Applicable to linear J bilateral, passive networks
f) Minimum 650.

None.

f. 650 System: One 533 required.

IBM 650 Library Program Abstracts

99~BUS

Filuo. 9.4.005
Engineering Applications

LOAD FLOW PROGRAM

W. F. Tinney
Bonneville Power Administration
Portland, Oregon
a. Purpose: Solves AC load flow problems for power systems with up to 99
~nd 199 branches.
b. Range: As above.
Accuracy: Any degree of precision desired.
(Continued on next page)

161

system driving-point and transfer admittances (equivalent circuits).
does not handle ll'lutual impedances.

Floating/Fixed: Fixed point aritlunetic is used.

It

c. Mathematical Method: The nodal iterative method of solution is used.

f.

IBM 650 System: One 533 required.

d. Storage Required: Almost entire drwn.
Fill! no. 9.4.008
Engineering Applications

Speed: A function ot' desired precision. Approximately 0.9 seconds per
bus per iteration, exclusive of input and output time. One-half to one and
one-half hours over-all computing time for full capacity problem.

IBM 650 Library Program Abstracts

Relocatability: Non- relocatable.

OVERHEAD ELECTRICAL DISTRIBUTION SYSTEMS AN'ALYSIS

e. Remarks: Input data are pr'cpared and punched from convenient standard
forrns. Output consists of complete load flow information including bus
voltage and angles. real and reactive flow into and out of each branch,
losses in each branch, and total system losses.

J. B. Jones
F. J. Farese
IBM, Houston, Texas

f.

G. W. Oprea
Houston Lighting and Power Company
Houston, Texas

650 Systern: One 533 required.
Special Devices: Alphabetic device.

IBM 650 Library Program Abstracts

Purpose: This program calculates voltage drops at various load points
along a given circuit, based on total loading of circuits, physical and
electrical design, and customer demand at designated load points.

Fill! no. 9.4. 006
Engineering Applications
b.

Range: Maximum of 40 load points per circuit.

PROBABILITY OF LOSS OF LOAD

Accuracy: Not given.

H. D. Limrner
Public Service Electric & Gas Co.
Newark, New Jersey

Floating/Fixed:

Fixed point arithmetic is used.

Mathematical Method: Does not apply.

a. Purpose: Calculates the probability of loss of load (due to lack of
sufficient generation or interconnections) of a power systell'l.

d.

Storage Required: The entire drum is required for instructions and data,
Speed: About 3 seconds per point.

b. Range: Will handle at least 50 machines.
Relocatability: Not relocatable.
Accuracy: Not given.
Remarks:

Both absolute and SOAP listings are included.

Floating/ Fixed: Not given.
f.
c. Mathell'latical Method: Based on ll'lethod outlined in AlEE paper 58-139,
published in Power Apparatus and Systems, August 1958, pp. 544-550.
d. Storage Required:

IBM 650 System: One 533 required.
Special Devices: Alphabetic device required.

Not given.

Speed: Running time varies with size of system, A 35-machine system
takes about 4 hours. Program can be re-run in 4 minutes if only the
characteristics of the load or finn interconnection capacity are changed.

IBM 650 Library Program Abstracts

Fill! no. 9.4.009
Engineering Applications

ECONOMIC CONDUCTOR STUDY
Relocatability: Not in relocatable form.
K. F. Thomas
Consumers Power Company
Jackson, Michigan

e, Remarks: None.
f.

650 System: One 533 required.

Purpose: This program is designed to determine the economic conductor
size for a proposed electrical transmission line.

Special Devices: None.

IBM 650 Library Program Abstracts

Fill! no. 9.4.007
Engineering Applications

Accuracy:

CALCULATION OF ELECTRIC POWER SYSTEM SHORT-CIRCUIT CURRENTS

Purpose: This program computes the total fault current and the currents
in the lines connected to the faulted bus. The real and imaginary components
and the magnitude of the currents are punched out together with the X/R
ratios. The input data can be arranged so that the location of the fault can
be changed automatically.

d.

Relocatability: Not given.
Remarks: Card format, control panel and operating instructions are as
prescribed by the interpretive system used (see par. b. above). An
exception is that the Programmed Bwitch is set to the IIRun" position,

Accuracy: Depends on the convergence tolerance specified.
Fixed point arithrnetic is used.

f.

Mathematical Method: A nodal analysis is used to form a set of simultaneous
equations with complex coefficients. These equations are formed by the
program and solved by the Gauss-Seidel iteration method with acceleration.
d.

Storage Required: This program uses 1253 storage locations.
Speed: The running'time for one conductor size is approximately 100
seconds.

Range: The program will accommodate networks of up to 96 buses and/or
150 lines.

Floating/Fixed:

Bell Labs Floating Decimal Interpretive System (TNL # 11)

Mathematical Method: The equations used in calculating the electrical
characteristics of transmission lines are those equations commonly used
to calculate impedances, sending-end and receiving-end power, etc., based
upon a symmetrical pi equivalent circuit.

L. W. Coombe
The Detroit Edison Company
Detroit, Michigan

b.

Eight decimal digits.

Floating/Fixed:
is used.

IB.M 650 System: One 533 required.

IBM 650 Library Program Abstracts

Fitl!no. 9.4.011
'Engineering Applications

Storage Required: Not given.
CORRECTION OF COAL MOISTURE MEASUREMENTS
Speed: Rcqui,res approximately O. SSB seconds per iteration, where B is
the number of buses, The number of iterations required depends on the
system and accuracy desired, usually ranging between 6 and 60 iterations
per fault.
Relocatability: Not given.
Remarks: A routine is included to convert the form of the input from
impedances to admittances. The program may also be used to determine
(Continued on next column)

162

N. Savage
The Detroit Edison Company
Detroit, Michigan
Purpose: This program calculates the constants of a linear equation which
relates percentage moisture in coal at two different locations in a power
plant, Then, for 120 equal increments of percentage moisture at one
(continued on next page)

B - 650

location (Xl, the corresponding values of percentage moisture at the other
location (Yl are calculated.

FILE NUMBER

650 LIBRARY PROGRAM ABSTRACT

9.5.001

Range: The input data consists of up to 39 pairs of measu~ed values of
~tage moisture in coal. AU measurements are consldered to be of

b.

equal weight in the computation.
Accuracy: The output consists of corresponding values of (Xl and (Yl with
(Xl ranging from 0.10 to 12.00 in increments of 0.10.
Floating/Fixed: The input and output data are in fixed point decimal form.
Computations are performed in the G. E. floating decimal mode.
Mathematical Method:
found is of the form:
d.

Storage Required:

The Method of Least Squares is used.

The equation

a) Calculates piping systems with three anchors and no intermediate constraints
or the equivalent case of two anchors with one constraint.

For 12 pairs of input data, total machine time is approximately

b) fnput-output is in fixed decimal form.

~inutes.
Relocatability:

Not given.

c) The KeUog method is used.

Remarks: The program includes an interpretive routine to perform the
floating decimal arithmetic. The number of values, increment size, and
range of the output data can be easily modified.

f.

M. Alfieri, B. Whipple, P. O'Neill
General Dynamics Corp., Electric Boat Division, Groton, Conn.

Y = Ao+AlX,

The program, including data storage, uses locations

0000-0601.
Speed:

CALCULATION OF PIPING SYSTEM EXPANSION STRESSES

IBM 650 System: One 533 required.

File"",9.4.012

IBM 65D Library Program Abatracts

d) The program is divided into three parts with a total of 2500 instructions"
The three parts are processed as one complete operation and the entire drum
is used.
e) A write-up of this program is in Technical Newsletter No. 10, pp. 195-213.
Operator's notes, deck listing and description, and 533 wiring instructions are
available from the 650 Program Library.
f)

30 SERIES BUS LOAD FLOW PROGRAM

Carlos O. Love
Texas Power &r. Light Co.
P. O. Box 6331
DallaB ZZ, Texas

Minimtlm 650.

650 LIBRARY PROGRAM ABSTRACT

StudieB service conditionB on ralial and series diBtribution
systems and supplements system load flow studies.

FILE NUMBER

9.5.002

a, Purpose:

30 buses maximum including source,bus. Calculatlon
and punch time is approximately 6 seconds/bus/problem With a tolerance
of O.30'a.

PIPE STRESS ANALYSIS

b. Restrictions, Range:

c. Method:

Per unit notion on an equivalent single phase system is used Cor
~nal calculations . .Input and output data are noted in standard
electrical units. Iterative solution.

d. Storage Requirements:
for program and data.
e. Remarks:

Complete 2000 drum locations are req\\ired

Only three phase loads may be considered. May be used to
The absolute and SOAP deck listings

~t system load flow studies.

W. S. Pickrell
J. H. Rogers
L. S. Woo
IBM, Los Angeles
a) Computes the bending moment, torsional moment, bending stress, torsional
stress, and the resulting combined stress at each end and the midpoint of every
bend or elbow in a piping system. Also, the three moments and three forces
acting at each anchor are computed ..

are included.
£. IBM 650 System:

Basic IBM 650, standard 80 column, 8 word panel.

Fileno. 9.4.013

b) Either two or three anchor problems with no intermediate restraints may be

analyzed. The piping system may include any number of members in any arrangement in space. There may be any changes in section or material within the system
and the branches may be at different operating temperatures. All computations are
performed in floating point while both the input and output are in fixed point form.

IBM 65D Llbr ....' Program Abstr.cts
c) The Kellogg Method is used for the calculations, while the stresses and the
anchor reactions are computed according to the ASA Pressure Piping Code.
RADIAL SHOR T CIRCUIT PROGRAM

d) The program consists of two parts, each of which uses the entire drum. An
average two anchor problem is completed in approximately six minutes, while
the average three anchor problem uses approximately twelv(;: minutes of machine
time.

Carlos O. Love
Texas Power & Light Co.
P. O. Box 6331
Dallas 2Z, Texas
a. Purpose: Computes three phase, phase-to-phase, and phase-to-ground
short circuit currents on a radial or tree system.
b. Restrictions, Range:
c. Method:

Up to 80 fault points per problem.

Based on mathematical system of symmetrical components.

d. Storage Requirements: Approximately 1900 drum locations are required
for progl'am and data. Average calculation time is 4 seconds/bus/problem.
e.~

e) Part I of the program is loaded on the drum and intermediate results for all
problems to be analyzed are punched. These are used with Part 2 of the program
and the final answers for all problems are punched. Two test problems and
detailed instructions as to how to prepare the input data are included in the
write-up.
f) Minimum 650.

The absolute and SOAP deck Hstings are included.

f. IBM 650 System:

Standard 80 column, 8 word panel.

IBM 650 Library Program Abstracts

Fill! no. 9. 5. 003
Engineering Applications

KINEMATIC SYNTHESIS OF PATH GENERATING MECHANISMS

G. N. Sandor
TIME, Inc.
Springdale, Connecticut
(Continued on

next page)

163

F. Freudenstein
ColUITlbia University
New York 27, New York

Floating/Fixed:' The Bell Labs Interpretive System described in'lBM
Technical Newsletter No, 11 is used.
Mathematical Method: See pages 8 through 14 of the write~up.

Purpose: Given five points an a desired path, the program calculates the
dimensions of pivoted four-link mechanisms in the plane to generate a path
through these five points. It is programmed in the Bell L2 System, IBM
650 Program Library File Number 2. O. 008.

d,

Storage Required: Including the interpretive system, the program l'equires
ZOOO storage locations.
Speed:

b.

Range:

Accuracy:

Relocatability:

Better than 10- 5 at the five prescribed points.

Floating/Fixed:

The computations are made with complex numbers.

f.

This is caused

IBM 650 System: One 533 is required.

Storage Required: Together with the Bell L Z System, the program occupie!
the entire drum with few gaps.
Speed: The existence of solutions is ascertained in about Z minutes. The
calculations take 3 to 4 minutes per solution for the 2 or 12 solutions.
Computation of the generated path takes 7 seconds per degree of driver
crank rotation, or a maximum of 42 minutes.
Relocatability: Not in relocatable form, except for twa subroutines and a
library routine for operations with complex nwnbers.
Remarks:

The program automatically calculates all existing solutions
~lZ linkages), selects one on the basis of a quality index and
computes its generated path. An auxiliary program computes the generated
path of any pivoted four-link mechanism.
f.

Not relocatable.

Remarks: The stop most frequently encountered is 7777.
by cards missing or out of order in the input deck.

Floating point arithmetic is used.

Mathematical Method:
d.

The average is one m.inute for each set of operating pressures.

Values of r =ALQ2

The main length and now may be in any units whatsoever.

d41!#R'"

HARDY-CROSS SOLUTION OF WATER FLOW NETWORK

b. Range: Networks with 1800 main sections may be analyzed and any flow
formula which can be reduced to the form

can be used.

Fileno. 9.7.003
Engineering Applications

WW*,\¥WfS

b.

Accuracy: The network may be balanced to a predetermined limit of
accuracy.

~:

A network of up to 99 loops, containing up to 199 pipes, can be
handled by this program. The pipes may be up to 99, 999 yards in length
and of any diameter.
Accuracy: The user may control the accuracy of the solution.

Floating/Fixed: Computations are in a fixed point.

Floating/Fixed: Fixed decimal arithmetic is used.

c. Mathematical Method: Itcrative procedure based on a modified HardyCross Method is used.
d. Storage Required: Storage varies f~r the separate sections of the program.
Maximum storage requirement is 125 locations.

Mathematical Method:
d.

Hardy~Cross.

Storage Required: Virtually the entire drum is used.
Speed: Approximately one second per pipe per iteration, plu:; two
minutes for read-in, punchout and initialization.

Speed: Speed is dependent on accuracy dcsired.

Relocatability: Not relocatable.

Relocatability: Not given.

Remarks: If the initial estimate of flow is too poor, the Hardy-Cross
~ill not converge, in which case the program stops,

e. Remarks: There are some limitations on size and length; see program
write-up.
f.

f. ~ One 533 required.

IBM 650 System: One 533 required.

Special Devices: None.

IBM 650 Library Program Abstracts

Fileno. 9.7.00Z
Engineering Applications

HYDRAULIC NETWORK ANALYSIS

IBM 650 Library Program Abstracts

File no. 9.7.004
Engineering Applications

BACKWATER CURVE ANALYSIS
(Continued on next column)

(Continued on next page)

169

E. V. Griffith
IBM, Lansing, Michigan
Purpose: Starting at a given point in a river or stream it is desired to
determine water surface elevations at points upstream for a given sized
flood. This program analyzes the stream, section by section, computes
various hydraulic elements, balances energies, and gives water surface
elevations at each section moving upstream.
b.

Range:

See the program write-up.

Accuracy: Elevations are given to nearest 0.01 ft., energies are balanced
to a tolerance of 0.05 ft. This tolerance may be varied, however.
Floating/Fixed:

G. Hamilton Harbison
Phlladelphia Gas Works
Dtvision of United Gas Improvement Company
Philadelphia, Pennsylvania

a. Purpose: This routine computes, by means cd' successive corrections,
the distribution of flow in a gas distribution network.
b. Restrictions. Range: The program can be used for low pressure systEml
networks consisting of up to 599 separate mains. or allowing for mains
cornman to mo:re than one loop. a total of 900 representations of mains.
Resistance coeffici.ents are calculated fo:r gas of 0.65 specific gravity.
Accuracy:
Undistributed pressure drop within anyone loop less tha:rJ .004
in, flow correction factor fo:r any single loop less than. 005 Mcf per hour.

Fixed decimal arithmetic.

Floating/Fixed:

d.

c. Method: Procedure of successive corrections (slightly modified Hardy
Cross Method) is used.

Storage Required: The program occupies 1200 drum locations between 0000
and 1499. Tables of data are stored in locations 1700 to 1897.

d. Storage Requirements:
333 locations.

Speed:

Speed:

Varies with the type of data, from about 5 to 25 sections per minute.

Relocatability:

Not relocatable.

Maximum storage requirement for the program is

Speed depends on the number of internal iterations requ ired.

Relocatability:

Remarks: The input involves a table of widths versus elevations to define
each cross section, and special cards to define bridges and branch streams.
The program will handle overbank areas separately, branch streams flowing
in or out, and bridge sections, including cases where water flows over bridge
embankznents. Provision is made for changing roughness coefficients and
bridge contraction coefficients at any point in the analysis.

f.

Fixed point arithmetic is used.

Mathematical Method: Manning's formula is used for friction losses, and
orifice and WEIR form.ulas are used for losses through bridges. An iterative
technique is used to balance energies.

Not relocatable.

e. Rema:rks: Resistance constants are ~alculated and stored in table form
~diameters of 4 to 42 inches. inclusive. The length of mains, in
feet, must be within certain limits (See program write-up).
£. IBM 650 System:

Special Devices:

One 533 required.
None.

IBM 650 System: One 533 required.
Special Devices: Alphabetic device is required only if alphanumeric
identification is desired.
~ile'''J.

IBM 65D Librar, Program Abstracts

9.7. 007

FLUID FLOW DISTRIBUTION: HARDY CROSS METHOD

IBM 650 Library Program Abstracts

Fjl~no.

9.7.005

Engineering Applications

Wm. F. Atchi.son, Head
Rich Electronic Computer Center
Georgia Institute of Technology
Atlanta 13, Georgia

a.

LIQUID VOLUMES IN FLAT END HORIZONTAL CYLINDRICAL TANKS

Purpose~
The program will compute the approximate distribution of
fluid flows in pipe network!l.

b. Restricti.ons, Range: The program utilizes a floating point representation,
hence no range limitations exist. Systems with a maximum of 375 pipe
sections may be analyzed, and there is no limit on the number of pipe
sections in each loop.

A. J. Sadler
Vestal, Incorporated
st. Lows, Missouri
a.

Purpose: This program calculates the volume of liquid, at height of liquid h.
contained in a flat-end horizontal cyltndrical tank.

c. Method: The Hardy Cross Method of successive corrections is used.
Energy loss calculations are based on the Darcy-Weisbach equation for
energy loss in a straight pipe.

b.

Range: Depends on system of units selected to measure dimensions of tank.

d. Storage Requirements:

Accuracy: Greatest possible error = O. 23%.
FloatinglFixed: Fixed decimal arithmetic is used.
c.
d.

Does not apply.

Speed:
The cmnputer requires approximately 2 seconds per loop per
iteration.
e. Remarks: Tolerance. Computations are terminated when all correctlons
applied to the network during one iteration cycle are within a prescribed
tulerance. It is also pos sible to halt computations after any complete
iteration cycle.

Mathematical Methoo: Does not apply.
storage Required: 110-120 storage locations.

f. IBM 650 System:

Minimum 650.

Speed: About 5 minutes for a tank 90" in diameter and 170" in length.
Relocatability: Not given.
Remarks: None.
f.

IBM 650 System: One 533 required.

IBM 65D IJbrsry Program Abstracts

Filtl1lo.9.7.008

A GAS NETWORK ANALYSIS PROGRAM WITH AUTOMATIC RECYCLING
(IBM 650)
Arthur James
Public Service Electric and Gas Company
Newark, New Jersey
File no. 9. 7 . 006

IBM 65D IJbrary Progrsm Abstracts
GAS FLOW ANALYSIS
(Continued on next column)

170

a. This program was written to solve gas network problems for the Public
Service Electric and Gas Com.pany. The program. using the ntodUied
Hardy Crolls technique, will be used to supplement the studies being
made on the Mcilroy Pipeline Network Analyzer. This presentation
discusses and exemplifies the intermediate or high pressure network.

(Continued on next page)

B -

b. A comparhon of the largest correction ( 0) with the de5ired limit of
accuracy., caU5es the program to perform additional iterations or punch
results. This feature permits the problem to be solved during other
than prime machine time. A punch of the largest ( Q) at the end of each
tteration provides a check. on convergence. When the desired accuracy
is obtained, flows and pressure drops arc punched for all pipes in the
network _ including dead-end pipes.
e. The modified Hardy Cross Method is used in the program. Thili
technique is used throughout the industry. The Spitzglass co-efficients,
which are supplied with the program deck., tllay be changed easily.

650

c. Mathematical Method: Employs aerial survey parallax computation
methods au uaed on''BPR Parallax Computation Sheet", Fortn PR-471
(Revised 1958).
d. Storage Re9uired: Approximately 970 litorage

locatjon~

are used.

~

Operates at approximately 9/10 full read speed depending on the
number of points In the aection.

e.

~

Program is written in SOAP II.

f. IBM 650 System: Basie 650 with Alphabetic Device ia used.
d. The program was arbitrarily limited to 400 drum locations, providing
1600 locations for data storage. These locationll are nOl'lnally reserved
for 700 pipe sections and 900 items of loop data. Division of the 1600
locations tllay be altered to speCific problem requiretnents.
The program was written in machine language and may not be relocated.
Optimum locations were initially ali signed.
e.~

FILE NUMBER

650 LIBRARY PROGRAM ABSTRACT

None

f. The program was written for the basic 650.

IBM 650 Library Program Abstracts

10.1. 001

Wiring is for the 533.

Fileno. 9.8.001
Engineering Applications

LINEAR PROGRAMMING
ROOT AND GAIN LOCUS

H. F. Smith
IBM, Chicago

R. D. Blosser
F. A. Vandenberg
Firestone Tire & Rubber Co.
Los Angeles, California

a) Solves a Unear programming problem.

Purpose: This program. determines the transient behavior of a control
system. as a result of changes in loop gain, component tim.e constants, and
stabilizing network configurations.
b.

Ra.nge:

Degree of forward and feedback loop must be less than 14.

Accuracy:

c) Method not given.

Seven significant figures.

Floating/Fixed:
fixed decim.al.

Polynom.ial coeHicients: floating decimal.

Mathem.atical Method:
d.

b) AU numbers are of the form xxxx. x.xxxxx. An M by N system may be
solved where M ~ 30, N;2 59 and M(N+l) < 1400 (these values pertain to the
system after the slack vectors and artificial vectors have been adjoined).

Storage Required:
locations.

Gain values:

d) The entire drum is used.
for one iteration.

The program occupies approxim.ately 1500 drum !ltorage

Speed: Requires 45 to 90 seconds for each value of gain for a first order
over a quartic.

e) Input consists of matrix elements, cost coefficients, indices of basis, and
constants. At the end of each iteration the program punches out the number
identifying the variables in the basis, the values of these variables, the value
of the functional, and an iteration count.
f)

Relocatability:

Time required is approximately. 09 MN seconds

Root Locus: C. J. Savantj Root Extraction: Milne.

Minimum 650.

Not given.

Rem.arks: The program. is self-loading. It does not always work for
multiple roots. Transfer functions m.ust be linear polynom.ials with constant
coeHicients.
f.

IBM 650 System:

One 533 required.

Special Devices:

None required.

Fil,no. 10.1.()()1

ADDENDA

IBM 650 Library Program Abstracts
LINEAR PROGRAMMING

IBM 650 Library PragramAbstracts

Fileno. 9.8.00l

Linear programming always maximizes the objective fUnction. Most
usually this means maximizing a profit function. In this case each variable in the initial program--each structural variable--is assigned a
positive unit pronto However, it may be desirable to use cost as the
objective and minimiz;e a cost function. Minimiz;ing a function is the same
as maximizi.ng the negative of the function. Hence to minimi:::e a cost
fUnction, each structural variable must be assigned a negative unit cost.
Whether unit profits or costs are used, artificial variables are always
assigned large negative values, and slacks are given positive zero values
in the objective function.

BPR PARALLAX REDUC TION PROGRAM

K. F. Kohler, Highway Engineer
R. R. DeClark. Engineering Tech.
L. D. Tinsey. Photogrammetr1c Engineer
Department of Commerce
Bureau of Public Roads
Region 8
Portland. Oregon

On page 5 of the writeup in the typical matrix layout, the values 3.19,
l.16, 4.l4 and 3.60 in the first line represent unit profits. 1£ they are
to represent unit costs, they must be mac1e negative.

a. Purpose: Reduces distancei!l manually i!lcaled from aerial vertical
photographs to actual elevations and distaneea.
b.

H. F. Smith

~:

Control Stationing (SSS+SS.SS), and Elevationa (EEEE.EE).
Cross section-topog Roda (RRR.R), Di.atance (000.0), Stationa (SSSS+SS)
and Base Elevation (EEE~.EE).

Experience has shown that artificial cost coeflicicnts which are about
10 times as large as the largest structural cost or profit coefficient arc
sufficiently large to prevent the artificial variable from appearing in the
optimal solution. An artificial cost of 100 times as large as indicated
in section A(l) of the writeup may cause overflow stops.
The program stops with O()OO in the address lights rather than 0350 as
stated in section E.

Accuracy: Consistcnt with manual methods.
Floating I Fixed: Fixed.

The program is mathematically correct in the way it solves Linear Programming problems. However, there is a cumulative rounding error
In this program as in any iterative process.

Subroutines: None.

(Continued on next column)

(Continued on next page)

171

By changing one instruction it is possible toreduce this cumulative rounding
error below itl. present level.
The instruction in location 0068 now reads: 30 0003 0129.
changed to read 200069 0172.

b) All input data are restrictE>d to a maximum size of five digits and all OPE'rations are in fixed-point. An approximation to the maximum number of destfnations, m, and origins, n, is 5m+6n<2300 wit]t n<100.

It should he

c) Method is essentially the same as the iterative. method proposed by A.
Charnes and W. W. Cooper in "Management Science," October, 1954.

This change may be made in the following manner.

1.

Place a correction card just before the last card of part 5 of the program deck. Part 5 consists of those cards in the program deck which
follow the matrix elements and which precede the constants.

d) The entire drum is used.

Time estimates not given.

e) Provision is made for alternate solutions which yield the same minimum
total cost. A SOAP symbolic deck listing with a sample absolute deck listing
is included.
f)

Alohabetic device if the SOAP symbolic version is used.

Fittno. 10.l.001
ERRATA

IBM G50 IJbrBry Program AbBtractB

650 Ubrary Program - File No. 10. 1. 003

ERRATA
LINEAR PROGRAMMING BY H. F. SMITH

"Transportation Problem," by S. Poley

On Page 2, Section B. Scaling .••.. , the third sentence now reads
"The cost coefficient 5 must be scaled so they
are all less than 1."
This sentence should be c:'anged to read:
All cost coefficients except the artificIal cost
coefficients must he scaled so they are less than 1."

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

1O. 1. 002

It has been discovered that the copies of the program deck for Program In
(Alternate Optima) of the Transportation Problem furnished by the 650 Program
Library prior to February 28, 1958, contain several erroneous cards. The
corrections are too numerous to list here; 650 users who expect to run this part
of the program may obtain corrected copies of the deck from the library in the
usual manner.

The program listing contained in the detailed write-up is correct as issued.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

10.1. 004

LINEAR PROGRAMMING

L. S. Woo
IBM, Los Angeles

March 23, 1956
LINEAR PROGRAMMING

a) Solves a linear programming problem.

J. W. Davis and D. H. Brown
Esso Standard Oil, Baton Rouge, Louisiana

b) A maximum of 97 equations, not including the objective functions, is possible. The number of variables is unlimited. Input is 10 digit fixed-point numbers which are converted to double precision floating-point numbers for the
calculations.
c} Method is Recursive Generation of Vectors for the Modified Simplex Methor'
as described by Kurt Eisemann.

March 29, 1956

a) Solves a linear programming problem.
b} Fixed decimal arithmetic of the form xxxxx. xxxxx is used.
tions and any number of variables may be handled.

Up to 40 equa-

c} The modified simplex method is used.
d) The entire drum is used. Timing varies from 4 minutes per iteration for
the first 10 up to 13 minutes per iteration for the 31st through 40th.
e) A SOAP symbolic deck listing is included in addition to an absolute deck
listing of the assembled program.

d) The program is divided into four parts. Storage required is approximately
211, 57, 44, and 114 locations respectively. The parts occupy the same area
of the drum and are read in only when needed. Timing information not given.
e) Information on alternate optima or near optima is supplied by the program.

f)

Alphabetic device if the SOAP symbolic version is used.
f)

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

Minimum 650.

10.1. 003
850 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

10.1. 005

TRANSPORTATION PROBLEM

S. Poley
ffiM, New York

LINEAR PROGRAMMING

May 17, 1956

a) Solves the transportation problem, L e" given the requirements at m destinations, and amounts available a.t n origins, and the cost. of shipment from
any origin to any destination the program will dE>termine the minimal mode of
transportation of a homogeneous product
(Continued on next column)

172

R. L. Graves
Standard Oil, btdiana

a) Solves a minimlzing linear programming problem.

b) A maximum of 33 equations in 1000 variables can be accommodated. All
numbers are in floating-point form.
(Continued on next page)

B - 650
Floating/Fixed: Not given.

c) The dual and direct forms of the revised simplex method are used.
d) The entire drum is required.
system.

c.

Mathematical Mcthod: See IBM

d,

Storage Required: Not given.

~neral

Information Manual, form E20-4040.

About 26 minutes are required for a 22 x 46
Speed: Not given.

e) A modified Trimble-Kubic interpretive system is used for the floaUngpoLnt arithmetic, see Technical Newsletter No.8.

Relocatability: Not given.
Remarks: None.

f) Minimum 650
Fileno, 10.1.006
Management Science

IBM 650 Library Program Abstracts

IBM 650 System: One 533 required.

f.

Special Devices: None.

LINEAR PROGRAMMING CODE FOR THE AUGMENTED IBM 650
File no. 10.1,008

IBM 650 Library Program Abstracts

O. R. Perry
IBM, Los Angeles 5, California

THE SYMMETRIC METHOD OF LINEAR PROGRAMMING

J. S. Bonner
Bonner & Moore Engineering Associates
Houston 11, Texas
Purpose: This routine provides a method to find optimal solutions for
relatively large linear proeramming problems with Hexibility of input and
detailed resulta, while maintaining simplicity and speed in operation.

h.

Range: The size of the problem which can be handled is restricted by the
foUowing relationship:
(M

+ Z)

(N - M

+ Z} t!

L. E. Winslow
Marquette University
Milwaukee 3, Wisconsin

Purpose: Thls routine solves a linear progralnming problem using the
Symmetric Method which eliminates slack and artificial vectors.
b.

Range: The oi.,e of the problem which can be handled is restricted by the
ToIT'OWing relationship:
(M'" 1) (N'" 1) .f. 1300, M ~ 50, and N <$ 50 where:

1900, where:

M is the number of independent variables;
N is the number of restrictions.

M is the number of restrictions;
N is the number of independent variables, including slacks and artificials.

Accuracy:

Single Precision.

Accuracy: Single precision.
Floating/Fixed:

The Wisconsin Floating DeciInal routine is used.

Floating/Fixed: Floating deciInal arithmetic is used.
Mathematical Method: Composite Algorithm; reverts to Simplex Algorithm
when feasibility has been achieved.
d.

d.

Storage Required: This routine uses the entire drum; however, if the
prOblem is less than maximum size a large portion of the drum will be
available for other use.
Speed: Compu.ting speed depends on several factors. As an example, in a
problem where M
17 and N
57, the speed is approximately ZO seconds
per iteration.

=

=

Storage Required: This routine uscs the entire dru:m; however, if, the
problem is less than Inaximum size a large portion of the drum WIll be
available for other use.
Speed: Co:mputing speed depends on several factors; howe"!:er. it averages
approxitnately
(N 40 1) (M ~ 1)/4 seconds per iteration.
Relocatability:

e.

Relocatability: Not in relocatable forll1.

(M-r 1) (Nt- 1) '*'M -r N~ 1400.

~ Input and output are in fixed point with automatic conversion
to floating point for computation. The ability to make changes in the problem
specifications without repetition of prelirr;l.inary iterations is provided.
Shadow prices and ranges on shadow prices and cost coefficients are provided.

f.

Not in relocatable form.

Retnarks; If the program is resoaped, the writeup includes a copy of the
S"OA'Pdeck, the range is:

At times this allows a larger progratn to be run than the above restrictions
indicate.

f.

IBM 650 Systetn:

One 533 is required.

IBM 650 System: One 533, automatic £loating decimal arithmetic feature,
lAS, and indexing registers.

Fileno,

10,1.009

IBM 650 Library Program Abstracts

IBM 650 Library Program Abstracts

File no. 10.1. 007
Management Science

LII'EAR PROGRAMMING FORCED INVERSION
CODE FOR THE AUGMENTED 650

F. P. Fisher
Western Region Programming System
3424 Wilshire Blvd.
Los Angel('s, California

RENT OR BUY ANALYSIS
L. Quinto
S. Freid
IBM, White Plains, New York

The pr::lgram is designed for usc with the Linear Progratntning
AUGmented 650. It has the following features as compared
to existing codes lor the 650: (1) Allows the analyst to pre-select the
[inal Cas is variables. If a proper selection is made, the number of
iterations required to obtain an optimal solution tnay be greatly reduced.
As a result, loss of significance due to round off may also be itnproved.
(2) Is completely compatible with the existing version of the l.inear
Programming Code for the Augmented 650.
Purpose:

~the

A. Fields
The Service Bureau Corporation
New York City
C. Burrill
New York University
New York City.

Purpose: This program is designed to assist management in making a rent or buy
decision on a capital investment. It will compute a rate of return from one to fifteen
years. The Present Value Method Is utilized because it considers the time distribution of an irregular pattern of savings occurring in the future. In addition to
induatrial corporations this program will make special evaluations for utilities,
banks, insurance companies and nonprofit organizations. The program will also
evaluate new assets and asaets purchased under a special option plan. While the
program description refers specifically to the pUrchase of IBM data processing
equipment it is sllfficienUy general to be easily adapted for any type of capital asset.

b.

~

c.

~

Single precision Hoating point.

Selected variables are forced into the final basis by a modified
simplex procedure. If optimality has not been achieved, the composite
algorithm is utilized to complete the solution.

d, Storage R,"Juirements: Th", entire storage will ordinarily be required.
However, on problems tess than the maximum size, storage will be
available for other purposes.

e.~Nonc

f. Equipment Specifications'

Basic 6S0 with index registers, floating point

and lAS.

b.

Range: Not given.
Accuracy: Not given.

(Continued on next column)

113

Fir~"o.

10.1.010

b.

IBM 650 Library Program Abstracts

Range: Assemblies of up to 50 independent dimensions may be studied.
locations are available for building histDgraIps.

Fifty

Accuracy: Does not apply.
LINEAR PROGRAMMING FORCED INVERSION VECTOR PARTITIONING
CODE FOR THE AUGMENTED 650

Floating/Fixed: Fixed decimal arithmetic is used.

F. P. Fisher
International 3usinesB Machines Corporation
Western Rr'gion Programming Systems
3424 Wilshire Blvd.
Los Angeles. California

Mathematical Method: The program uses the Monte Carlo method.
d.

a. Purpose: The program is designed for use with the Linear Progranuning
Code br the Augmented 650. It has the following features:
I. Is completely compatible with the existing versions of Linear
Programming and Vector Partitioning Codes for the Augmented

h. Accuracy:

One

Relocatability: Not relocatable.
Remarks: The "construction" of a group of mathematical models of the assembly Is
monitored by this program. The user must supply a sub-program describing the
assembly under study and the distributions of given dimensions.
f.

IBM 650 System: One 533 required.

Single precision floating point.

~

Vect'Jrs outside the Tnatrix during inversion are updated by the
inverse o' the previous basis. Updated vectors that are in the Forced
Inversion direct-:>ry are placed into the matrix and other vect0rs are
punched out in the updated hrm. Forced Inversion continues until all
vechrs have been forced into the basis. The problem is then cheel_cd
or optimization by the conventional simplex and partitioning programs.

d. Storage Requirements:
~:

Locations

Speed: The speed of the program varies greatly with the size of the program.
thousand gear assemblies have been done in less than 30 minutes.

650.
2. Allows the analyst to pre· select the final basis variables.

Selected
non·basis vect'.'.lrs in the matrix are forced into the basis and non-basis
vect'.'.lrs outside the machine are updated and placed in the matrix if
they are in the Forced Inversion directory.
3. Experience ems indicated, if a proper selection is made, the time
to complete a partitioned problem can be reduced to one·third Qf the
former time.

storage Required: The routine assumes the use of the entire drum.
0700-1499 are available for the sub-program.

650 LIBRARY PROGRAM ABSTRACT

FILE NUMBER

10.3. 001

LINEAR DECISION RULE FOR PRODUCTION
AND EMPLOYMENT SCHEDULING

The entire st"rage will ordinarily be required.

None

f. Equipment Speciflcations: Basic 650 with index registers, Cloating
point and lAS.

IBM S50 Library Program Abstracts

File no. 10.2.001
Management Science

W. Folsom
C. C. Holt
Industrial Administration
Carnegie Institute of TechnOlogy
Pittsburgh, Pa.
a) Calculates optimal linear rules for making decisions on aggregate production
and employment utilizing quadratic cost functions.

THE CORNELL RESEARCH SIMULATOR

R. W. Conway
B. M. Johnson
W. L. Maxwell
Cornell University
Ithaca, New York

b) Floating decimal point.
c) The mathematical methods are described in papers appearing in "Management
Science" Volume 2, No. 1 and 2, October 1955, January 1956.

Purpose: To simulate the operation of a system that consists of a network of queues.
b.

Range: The minimum number of operations per job with the basic program is seven.

d) The program requires the following decks:

Accuracy: Not given.
Floating/FIxed: Not given.
Mathematical Method: Not given.
d.

Speed: Its speed depends largely upon characteristics and dimensions of the system

The Wolontis System* deck
Complex Operations deck
~~cta;. ~elocated deck (decks 2 and 3 developed by Dr. P. Marcus,

(4)

The Linear Decision Rule Program deck

These programs are not relocatable.
All four decks are supplied in a single package.

Storage Required: One hundred eight storage locations are available for records of
jobs in process.

iii1CI'er consideration. Depending upon these factors the simulator will have an average

(1)
(2)
(3)

e) Standard Wolontis· 533 and 402 boards are used.

processing time of from one to twenty seconds per job.

f.

Relocatability: Not given.

f) Minimum 650.

Remarks: The CORE Simulator is intended to be a research device rather than the
basis of a routine operating procedure for a production control operation. As such.
flexibility and susceptibility to modification were considered more important in its
construction than speed of operation for a particular situation. Although dimensional
limitations of the program will preclude its use for direct one-four-one representation
of most manufacturing shops. the Simulator can be used to study the operating charac~
teristlcs of such shops by conSidering systems which are dimensionally smaller but
logically similar.

• Bell Laboratories Interpretive System described in IBM Technical Newsletter
No. 11.

IBM S50 Library PrDgram Abstracts

File no. 10. 3. 002
Manag~ment

Science

IBM 650 System: One 533 required.

PRODUCTION LINE BALANCING
10.2.002
Management Science
File no.

IBM S50 Library PrDgram Abstracts

J. W. Burgeson

TOLERANCE SIMULATION PROGRAM

IBM, Akron, Ohio

a.

J.E. Monsma
IBM Corporation
Peoria, illinois
a.

Purpose: This program is intended to aid in the choice of tolerance values for a
manufactured item. Assembly of the item is simulated within the computer.
(Continued on next column)

174

T. E. Daum
Westinghouse Electric Gorp.
Mansfield, Ohio

b.

Purpose: Given the times and precedence relationships between basic jobs
on a zoned assembly line. and given the production rate desired, this
routine assigns jobs to operators in such a manner as to minimize the total
number of operators required.
Range: Maximum of 95 "can do" jobs per line.

zone:- Maximum of 24 jobs per operator.

MaxiInum of 50 jobs per

(Continued on next page)

B - 650
Accuracy:

Docs not apply.

Floating/Fixed:

are provlded which do not stop the 650 but allow the programmer to take
such action as is necessary. The range of the calendar may be extended
merely by relocating either the program or the table.

Not given.

Mathematical Method: An approximation method is employed, which may
not give a minimum figure in all cases. The exact method of computation
has been programmed but is prohibitively long in machine time. The method
employed has shown a substantial savings over hand methods. The total
idle time on the entire line has been exceeded by the maximum allowable
operator time in 90% of the cases run to date.
d.

Speed: For a job-operator ratio of about 6: I, speeds of 0.4 to 0.8 minutes
per operator have been attained.

IBM 650 Library Prouram Abatracta

Filt"o.

10.3.005

LESS

Purpose: The program. is designed to answer the question, "At what
tiIne and how fast should each and every job be done so as to complete
the project at a minim.um cost or in a specified time?"
b.

Range/Restrictions:

File no. 10. 3. 003
Management Science

IBM 650 Library Program Abstracts

The program must start at 001 and a maximwn of

500 jobs can be used.

IBM 650 System: One 533, indexing registers, and lAS.

Floating/Fixed: Not given.
c.

Mathematical Method: NJA

d.

Storage Required: The second and third tables can occupy 500 positions
of memory (locations 0801-1300, 1301-1800 respectively).

!.

IBM 650 System: One 533 is required.

Remarks:
ZDT:

Alphabetic device required for the SOAP I version.

Frederick Backer, Jr.
IBM Applied Science
Dallas, Texas

Not relocatable.

Remarks: In using the program, the production line is divided into physical
"zones. It An operator will not be assigned to jobs in more than one zone.
Jobs are subdivided into two types, "must do" and "can do." A "must do"
job can be performed in only one particular zone, while a "can do" job
might be performed in one of several zones. The routine decides the best
zone for each "can do" job.
f.

IBM 650 System: One 533 required.
Special Devices;

The routine takes up the entire drum and IAS.

Storage Required:

Relocatability:

f.

None

A TWO-DIMENSIONAL TRIM ROUTINE

J. W. Burgeson
G. Kenny
IBM, Akron, Ohio

IBM 650 Library Program Abatract.
a.

Purpose: This program assigns to any given rectangular "stock" piece
a layout pattern for smaller rectangular pieces to be cut.

b.

Range: The program can handle only one stock piece at a time, bul. up
t'0355 unique sizes of pieces to be cut, up to 999 of each. On saITlple
programs the routine has given patterns with as little waste as 1. 40/0.
The program does well with as few choices as 50 pieces of five unique
sizes.
Accuracy:

MAN - SCHEDULING

H. N. Perk
Texas Division
The Dow Chemical Cotnpany
Freeport, Texas

Does not apply.

Floating/Fixed:

The "LESS" program. assutnes that the only restriction on
starting a job is that every job that precedes it in the arrow d.iagratn has
been completed. "Man - scheduling" adds a lurther restrtctton in thlt
the total usage of tnanpower of all jobs in process at anyone titne
cannot exceed specified maximum litnits. Limits on 10 classes, or
crafts, can be specified.

~s_e:

Does not apply.

Mathematical Method: An approximation method is used.
d.

Sto:rage Required;
Speed:

The entire drwn.
b.

Averages about five minutes per run.

~:

~

None.
c.

C.

Docs not apply.

Accuracy: Does not apply.

Relocatability: Not relocatable.
Remarks:

Flit no. 10.3.006

IBM 650 SysteIl'l:

One 533 required.
d.

Approximately 1600 drum locations are used.

File no. 10.3. 004
ManageIl'lent Science

IBM 650 Library Program Abstracts

Fixed point,

Mathematical method: The program is a continuous updating of job
priorities and rearrangement of gueue s of waiting job~ in pro gress.

Running Time: Running tUne depends on how tight Inanpower availability
restrichons are set. A test problem of 79 jobs ran 5 minutes with
unhmited availabilities and Z5 mlnutcs when availabilities were at
minImum values.

PRODUCTION DAY CALENDAR

Remarks: None.
R. L. FreeITlan
Portsmouth Naval Shipyard
Portsmouth, New HaITIpshire

IBM 650 System:

f.

Basic 650.

a,

Purpose: This program is written to be used as a subroutine for scheduling
~hich are based upon norITlal productive working days.

IBM 650 Library Pro!Jl'am Abatracla

b.

Range: The sample calendar is for a five-year period beginning January
T958and ending December 196Z.

LESS - Phase lA - Node_Nutnbering

Accuracy:

Docs not apply.

Fi/t".

0704

22'3ClDPD1

LIBRARY

DOUBLE PRECI.SION FLOATING DIVIDE
OBTAINS THE OCUt;LE PRECISION CUOTIENT OF TWO DOUBLE PRECISION
FLOATING NUMBERS.
REQUIRES 54 STORAGES, NO CO~MON.

0104
213NYBT04

PROGRAM

AVAILABLE PRIOR TO JANUARV 1962

B I NARY PUNCH PROGRAM
NY BPUS WIll PUNCH A BLOCK Of N WORDS FROM MAGNETIC CORE
STORAGE ONTO ABSOLUTE BINARY CARDS. THIS ROUTINE IS SELFLeADING INTO UPPER CORE STORAGE. 0-2 AND 77706-11717 OCTAL
LOCATIONS. THE LOCATION OF THE BLOCK IS SPECifIED BY CONTROL
CARDS OR MANUAllY ON THE CONSOLE. ANY NUMBER OF BLOCKS MAY BE
PUNCHED .. THE CONTROL WORO IS, 9LO- FIRST WORD ADDRESS, 9LALAST wORD ADDRESS.

0704

0704

223ClMTAI

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

NY BOll TRANSITION
INTERRUPTS CARD LOADING BY NY BOLl AND SIMULATES PRESSING THE
LOAD CARDS BUTTON

HAIR 1 X TRANSFER
TO EXECUTE A TRANSFER WITHIN THE MATRIX ABSTRACTION.
REQUIRES 4 STORAGES

161

IElM

0104~

0104

PROGRAM

LIBRARY

223f-LMVPl

ABSTRACT

AVAILABLE PRIOR TO JANUARY. 1962

VECTOR DOT PROQUCT
COMPUTES THE SCALAR PRODUCT OF TWO N TH ORDER REAL OR
COMPLEX VECTORS.
REC:;UIRES 205 STORAGES PLUS COMMON THROUGH COMMON &10

0104

22)CLSMD2

AVAILABLE PRIOR TO JANUARY 1952

SMeOTH AND DIFFERENTIATE DATA POINTS
TO SMOOTH N INIS GREATER THAN OR EQUAL TO 11 POINTS,
WHICH MAY [JE UII/EQUALlY SPACED, BY THE METHOD OF LEAST
SQUARES.
OPTIONS TO MIN1I"llE RANDOM I:.RRORS AND TO
DIFFERENTIATE ARE PROVIDED.
THE DATA POINTS MUST B[ IN
NORMALIZED FLOATING POINT NOTATION
REQUIRES 422 WORDS PLUS COMMON THROUG'" COMMON &65. CORR./332

0704

223CLSME5

224ASAS03

0104

0704

AVAILABLE PRIOR TO JANUARY 1962

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

POLYNOMIAL COEFFICIENT REDUCTION
REDUCES THE NUMBER OF COEFFICIENTS FOR A POWER SERIES
APPROXIMATION OF A FUNCTIC~, MAINTAINING A SPECIFIED ACCURACY
THE ORIGINAL SERIES, AS DP FP COEffiCIENTS IS REDUCED ANO
ROUNDEO TO SINGLE PRECISION. PRINTING OF COEFFICIENTS AN~
A PROOF IS INCLUDEO.

0704

224ASAS33

AVAILABLE PRIOR TO JANUARY 1962

HYPERBOLIC SINE-COSINE, FLOATING
CO/o'PUTES FLOATING POINT SINH AND COSH OF A FLOATING POINT
ARGUMENT. COSH IN MQ ON EXIT. SINH [S ACCURATE TO 2 BITS LESS
THAN THE ""UMBER OF FRACTlONAL BITS ]N THE ARGUMENT, BUT NO
MORE THAN 25 SITS. REQUIRES 71 STORAGES &5 COMMON. TIMING IS
5.112 MS. CORR. I 437

0704

225GMCFRl

AVAILABLE PRIOR TO JANUARY 1962

CONTINUED fRACTION SUBROUTINE
A FLOATING POINT SUBROUTINE FOR EVALUATING A CONTINUED
FRACTION. SUCCESSIVE CONVERGENTS ARE ACCUMULATED BY MEANS OF
THE STANDARO RECURRENCE RELArIONSHIPS. REQUIRES 57 CElLS
PLUS 5 CQM'""ON.

0704

22SG~E(G2

AVAILABLE PRIOR TO JANUARY 1962

EIGENVALUE SUBROUTINE
FLOATING POINT ALL EIGENVALUES AN~ CORRESPONDING
EIGENVECTORS OF A REAL NXN MATRIX USING A POWER METHOD.
REQUIRES 280 STORAGE CELLS PLUS 3N CELLS DETERMINED BY THE
PROG/tAI'IMER.

0104

225GMIEFI

AVAILABLE PRIOR TO JANUARY 1962

INCOMPLETE ELLIPTIC IIiTEGRALS
I.S A SUBROUTINE WHICH EVALUATES THE INCOMPLETE ELLIPTIC
INTEGRAL S OF THE FIRS T AND SECOND KIND FROM A KNOWN PH 1 AND
K. AUSSIAN INTERGRATICN DEFINED BY THE LEGENDRE POLYNOMIAL
1 S EMPlOYEO.

182

232NYDMII

AVAILABLE PRIOR TO JANUARY 1962

233ATMGOI

AVAILABLE PRIOR TO JANUARY 1962

?35NYOBOI

AVAILABLE PRIOR TO JA"lUARY 1962

0704

PROGRAM

235NYDHll

LIBRARV

ABSTRACT

AVAILAElLE PRIOR TO JANUARY 1962

nco

Te HOLLERITH
CONVERTS 12 OR LESS CONSECUTIVE WORDS OF 6 BCD CHARACTERS
fACH TO A 12 COLUMN DECIMAL CARD IMAGE. IT USES 102 LOCATIONS

236ClMNR2

AVAILABLE PRIOR TO JANUARY 1962

NCR,..ALIlE MATRIX AY ROWS
TO DIVIDE EACH ELfMENT OF A MATRIX BY THE ELEMENT OF LARGtST
ABSOLUTE: VALUE IN THE ROW CONTAINING THE ElEMENT.
REQUIRES 154 STORAGES PLUS COMMON THROUGH COMMON &13.

0704

236CLMr-.R3

AVAILABLE PRIOR TO JANUARY 1962

NORMALIZE MATRIX BY COLUMNS.
TO DlvtoE EACH ELEMENT OF A MATRIX BY THE ELEMENT OF LARGEST
AFlSOLLTE VALUE IN THE COLUMN CONTAINING THE ElEMENT.
REC:;UIRES 152 STORAGES PLUS COMMON THROUGH COMMON £12.

0104

237GlGAUS

AVAILABLE PRIOR TO JhNUARY 1962

I,\lTEGRATlON SUBROUTINE, 10 PT. GAUSS QUADRATURE METHOD
THE: GAUSS QUADRATURE TECHNICU( 110 POINTf INTEGRATES A
FU,~CTION OVER THE INTERVAL 10,11 BY CALCULATING AIFXl£.A2FX2(.
. . . E.AI0FXIO GIVEN AltA2 ••••• AIO AND Xl,X2, ••• ,XI0. SINCE AlAID. A2-A9, •• ,A5-A6 AND XI-/I-lClO/, X2-Il-X9/, . . . X5-/I-X61
TH I S FORMULA ] S S I ~PLlF I EO TO AlIF-X l&FX 10I&A2/FX2&FX9/& •••
&A5/FX5&FX6/. THE S.UBROUTINE DIVIDES THE INTERVAL IA,SI INTO
N ECUAL INTERVALS ANn BY THE PROPER TRANSFORMATION EACH
INTERVAL IS INTEGRATED OVER THE INTERVAL 10,11.

0704
0104

AVAILABlI: PRIOR TO JANUARY 1962

HOLLERITH TO BCD CONl/l:RSloN
CONVERTS 72 CARO COLU~NS OF HOLLERITH CODE TO 12 CORE
LOCATIONS OF BINARY COOEO DECIMAL. IT USES 148 LOCATIONS.
CORR.I 456

0704
0704

230RS0128

MESH GENERATOR
GENERATES A hD OIMENSIONAL MESH OF POINTS DESCRIBING
POLYGONAL REGIONS BY ASSIGNING TO EACH POINT A CORE WORD
CONSISTI.NG OF AN OCTAL COOE DESCRIBING HE TYPE OF VERTEX,
BOUNDARY, OR. INTERIOR POINT AND IUENTIFYING ALL SURROUNDING
REGlo~S FROM INPUT GIVING JUST He COOROINATES OF THE
VERTICES OF EACH REGIONS.

IBfoI

224ASAS14

AVAILABLE PRIOR TO JANUARV 1962

MATRIX INVERSION
DCUBLE-PRlCISION, FLOATING-POINT MATRIX INVERSION OF REAL
SQUARE MATRIX, WITH POSITIONING FOR S1lE AND ROW SUM CHECKING

10M

0704

225GMlERl

ABSTRACT

Dt.: R(LAT I VI lE PROGRAM
TAKES A SHARE RELATIVE SYMBOlIC DECK ISUCH AS THAT PRODUCED
BY CL RElI ANO PROOUCES A SHARE SYMBOLIC DECK IN WHICH
SY~~OLS ARE ASSOCIATED WITH ALL RHERENCED LOCATIONS .. INPUT
AND OLTPUT MAY BE ON-LINE OR OFF-LINE. CORR./492

0704

PROGRAM

LIBRARY

ZEROS OF A COMPLEX POLYNOMIAL
A FLOATING POINT SUBROUTINE FOR COMPUTING THE COMPLEX lEROES
OF A POLYNOMIAL OF ARBITRARY DEGREE. THE COEFFICIE",TS OF THE
POLYNOMIAL ARE ASSUMED TO BE COMPLEX AND ALL ZEROS BOTH REAL
AND COMPLEX MAY BE EVALUATED WITH EQUAL ACCURACY. THE COMPLEX
NEWTON. ~APHSONIERATIVE PROCEDURE IS EMPLOYED. THE METHOD IS
UNSUITED TO POLYNOMIALS WITH ZEROS OF MULTIPLICITY GREATER
THAN TWO. THE OPTION OF DETERMINING ONLY A SINGLE ZERO IS
AVAILABLE REQUIRES 212 CELLS PLUS 16 COMMON.

EXPONENT I AL, FlOATI NG
COMPUTES FLOATING POINT EXPONENTIAL OF A FLOATING POINT
ARGUMENT. ACCURATE TO 24 EIlTS MINUS THE NUMBER OF BITS IN THE
INTEGER PART OF THE ARGUMENT. REQUIRES 39 STORAGES E.3COMMON.
TIMING IS 2.460 MS. CORR .. I 431

0104

PROGRAM

AVAILABLE PRIOR TO JANUARY 1962

SIMULTANEOUS EQUATIONS, REAL
CALCULATES K VECTOR SOLUTIONS OF N SIMULTANEOUS EQUATIONS ..
ARJTHMETlC OPERATIONS ARE SKIPPEO ON ZERO ELEMENTS.
SOLUTION ARE IMPROVED BY ITERATIONS.
REQl.JIRES 580 STORAGES PLUS COMMON THROUGH COMMON &25

0704

0104

0704

AVAILABLE PRIOR TO JANUARY 1962

2Z3CLSME4

SIMUL TANEOUS EQUATIONS, REAL
CALCULATES K VECTOR SOLUTIONS OF N S IMUL TANEOUS EQUATIONS.
ARITHP-'ETIC OPERATIONS ARE SKIPPED WHEN A lERO ELEMENT IS
ENCOUNTERED.
REQUIRES 176 STORAGES PLUS B COMMON.

0704

IBM

23BATTPI

AVhlLABLE PRIOR TO JANUARY 1962

TWO POINT BOUNDRY CONDITION OIFFERENTIAL EQU. SOLVER
SOLVES A SET OF SIMULTANEOUS EQUATIONS FORMED BY DIFFERENCE
ec:UATlONS REPRESENTING A SECONO ORDER,ORDINARY,
DIFFERENTIAL EQUATION wIT ... A TWO POINT BOLNDRV CONDITION.

IBM

0701t

0704

PROGRA.M

LIBRARY

240NOS IG

ABSTRACT

AVA I L ABLE PR lOR TO JANUARY 1962

S I MULT ANEOUS MULT I PLE INTEGRA T1 ON, FLOA T I HG PO INT ~
CARRI£::S OUT SIMULTANEOUSLY N IMULTIPLE IF DESIRED/ INTEGRAlIONS BE·TWEEN SAME LIMITS..
FLOATING POINT~
MODIFIED
SIMPSON RULE WITH INTERVALS AUTOMATICALLY ADJUSTING TO
MEET
ERROR SPECIFICAlIONS~
FOR MULTIPLE INTEGRATION, SUBROUTINE
NEED BE ENTERED IN MEMORY ONLY ONCE.
REQUIRES 243 WORDS
STORAGE PLUS COMMON THROUGH COMMON G 4.

IBM

AVAILABLE PRIOR TO JANUARY 1962

Z46NA1353

ARC SINE - ARC COSINE SUBROUTINE
TO COMPUTE THE ARC SINE OR ARC COSINE OF A FLOATING
POINT NUMBER

0704

248CLpINZ

AVAILABLE PRIOR TO JANUARY 1962

BIVARIATE PARABOLIC INTERPOLATION
INTERPOLATES A FUNCTION, Z-F/X,VI,
GIVEN N VALUES OF X. M
VALUES OF Y" AND THE CORRESPONDING l-F/X,YI.
REQUIRES 136
STORAGES PLUS 29 CO~MCN.

AVAILABLE PRIOR TO JANUARY 1962

248CLPMC1

EIGENVALU£:: SOLUTION, COMPLEX
TO F INIl THE HIGHEST EIGENVALUE ANO CORRESPONDING
EIGENVECTORS OF A ~ATRIX.
REQUIRES 858 STORAGES PLUS COMMON THROUGH COMMON & 42
PLUS THE HAT'RIX MULTIPLY ROUTINE AND DRUMS 2, 3, AND 4.
IBH

0704

PROGRAM

AVAILABLE PRIOR TO JANUARY 1962

253MU104R

AVAILABLE PRIOR TO JANUARY 1962

256MUBPUI

AVAILABLE PRIOR TO JANUARY 1962

MURA B tNARY PUNCH ROUTINE
PUNCHES A BLOCK OF N WORDS FROM CORE STORAGE ONTO ABSOLUTE
BINARY CARDS~
LOADING ADDRESS ON CARD SAME AS LOCATION IN
S TORAGE~
37 WORDS OF PROGRAM Co 4 WORDS COMMON.
905.4 MS.
AVERAGE TIME FOR FIRST CARO IF PUNCH IS NOT IN MOTION ON
ENTRY~
FULL SPEED /l00 CARDS/MIN .. / IF TIME BETWEEN EX.IT AND
RE-ENTRY DOES NOT EXCEED 24.6 MS.

0704

LIBRARY

2S6MUBPU2

AVAILABLE PRIOR TO JANUARY 1962

MURA B INAiRY PUNCH ROUTINE
PUNCHES A BLOCK OF N WORDS FROM CORE STORAGE AT LOCATION R
ONTO ABSOLUTE BINARY CARDS WlTH INITIAL LOADING ADORESS S.
SAND R MAY BE EQUAL.
ALTERS ONLY THE LOAD ING ADORE SS AND
NOT THE ACDRESS PORTION OF THE wORD.
40 WORDS OF PROGRAM Eo 5
WCRDS COl-'MON.
905.4 MS. AVERAGE TIME FOR FIRST CARD IF PUNCH
NOT IN MaTtON ON ENTRY ~
FULL SPEED /100 CARDS/MIN./ IF TIME
OET'tIEEN EXIT AND RE-ENTRY DOES NOT EXCEED 24.6 MS.

0704

0704

253MUFRDI

B - 704

AVAILABLE PRIOR TO JANUARY 1962

248CLOUDI

OVERFLOW, UNDERflOW, AND DIVll)E ChECK TEST
TESTS CONDITION AND fURNS OFF OVERFLOW, UNDERFLOW AND
DIVIDE CHECK INDICATORS~
REQUIRES 34 STORAGES.

0104

ABSTRACT .

AVAILABLE PRIOR TO JANUARY 1962

248CLDEQ

rJIfFERENTIAL EQUATIONS ROUTINE
AN OPEN SUBROUTINE TO SOLVE A SET OF N SIMULTANEOUS FIRST
ORUER DIFFERENTIAL EClUATI.CNS.
REQUIRES 285 Eo 20N STORAGES.

0704

LIBRARY

It . . . . . . . . . . . . 111111 . . . . . . . . . . . . . . . 111.111 • • • • • • • •

MURA REflECTIVE 104
V
CAUSES THE 704 TO BEHAVE LIKE A 407 IN ITS ROLE AS A READER
AND PRINTER OF CARDS.
53 WORDS PROGRAM PLUS 24 WORDS
TEMPORARY~ TIMING, 11250 PLUS 11150 MIN. PER CARD PROCESSED.
SUPERSEDED BY MU R704 OIST. 432 ..

0704
0701*

PROGRAM

MURA FRACTION DUMP
PRINTS THE CONTENTS OF A eLOCK OF CORE STORAGE AS FIlI:ED POINT
FRACTIONS.
LOCATIONS 0-105 /DECIMAL! ARE OVER WRITTEN.
PRI NTER OPERATES AT fULL SPEED.

0704

0104

0704

•••• • "",11" ..............

256MUOpA2

AVAILABLE PRIOR TO JANUARY 1962

MURA DOUBLE PRECISION ADDITION /FlxED POINT/
ADDS A DOUBLE PRECISION NUMBER IN AC-MQ TO A SIMILAR NUMB£::R
IN COMMOt~-COMMONEo1.
RESULT IN BOTH AC-MQ AND COMMONCOJII~ON£.l.
THE SIGNS Of THE MSP AND LSP IN THE AC AND MQ MUST
AGREE~
THE ROUTINE GUARANTEES THIS IS TRUE OF THE ANSWER~
22 WORDS Of PROGRAM, 2 WORDS Of COMMON..
TIMING .55MS ..

AASTRACT

• • • • • • • • • • t! • • • • • 111 . . . . . . . t! . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111 . . . .

0104

248CL THAI

AVAILABLE PRIOR TO JANUARY 1962

l'HERMAL ANAL YIER
THIS IS A COMPILER-TYPE PROGRAM TO SOLVE TRANSIENT AND
STEADY-STATE THERMAL PROBLEMS WHICH CAN BE REPRESENTED
BY A SIMPLE ELECTRICAL NETwORK.
USES TAPES 3, 4, 5 AND 6 ..

0704

250NYFSCl

AVAILABLE PRIOR TO JANUARY 1962

FIXED POINT FOURIER COEFFICIENTS
COMPUTES FOURIER COEFFICIENTS FOR A GIVEN FIXED POINT,
SINGLE PRECtSION FUNCTION, GIVING EITHER C.OMPLETE
FOURIER SERIES, SINE $ERIES, OR COSINE SERIES ..

0704

251MUINDl

AVAILABLE PR tOR TO JANUARY 1962

MURA INTEGER DUMP
PRINT'S THE CONTENTS OF A BLOCK OF CORE STORAGE AS FIXED POINT
INTEGERS.
lOCATIONS 0-102lDEC1MALI ARE OVERwRITTEN.
PRINTER OPERATES AT FULL SPEED.

IBM

0704

251MULBl3

AVAILABLE PRIOR TO JANUARY 1962

MURA LOWER BINARY LOADER lONE CARD/
LOADS ABSOLUTE BINARY CARDS PRODUCED BY EITHER UA SAP OR
MURASS.
EXECUTES TRANSFER CAROS.
RECOGNIZES SUBSEQUENT SElF
LOADING PROGRA~S.
OCCUPIES FIRST 24 WORDS OF THE MEMORY.
SELF LOADI NG ..

251MUOCDI

AVAILABLE PRIOR TO JANUARY 1962

MURA aCT AL DUMP
PRINTS THE CONTENTS OF A BLOCK Of CORE STORAGE AS OCTAL
MEMORY LOCATIONS 0-99 /OECIMALJ ARE OVERWRITTEN AND
NUMBERS..
THE CONTENTS OF 11-99 /DECIMAL! ARE RECORDED ON CARDS BEFORE
OVERWRITING.
PRINTER OPERATES AT FULL SPEED.

0704

0704

253MUEASZ

AVAILABLE PRIOR TO JANUARY 1962

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

256MUEXP2

AVAILABLE PRIOR TO JANUARY 1962

256MUROtl

AVAILABLE PRIOR TO JANUARY 1962

MURA READ DECIMAL IfljTEGER ROUTINE
READS AT FULL READER SPEED A SEQUENCE OF DEC IHAL INTEGERS
FROM CARDS, CONVERTS THEM TO BINARY INTEGERS AND STORES THEM
IN THE MEMORY.
EACH CARD CONTAINS A LOADING ADDRESS AND THE
INTEGER.
CONTROL IS RErURNED BY ANY CARD HAVING A 12R PUNCH
WITH 12R IN THE AC~

Z59GMITR3

AVA I LABlE pR lOR TO JANUARY 1962

GMlTR3 ITERATION SUBROUTINE
GMITR3 IS A MODIFICATION OF lTRI FOR SOLUTION OF
SIMULTANEOUS NON-LINEAR EQlIATIONS~ IT CONTAINS AN IMPROVED
TECHNIQUE FOR ROOTS NEAR LERO~ 160 CELLS Eo 7 COMMON.

070 l ,

MURA tffECTJ.VE ADDRESS SEARCH ROUTINE
SELF LOADING..
SEARCHES MEMORY FOR ANY EFFECTIVE ADDRESS
I I .. E. ACCOUNT TAKEN OF INDEXING/ SET UP ON PANEl SWITCHES.
ACCOUNT IS TAKEN OF MULTIPLE INDICES.
LOCATIONS AND ""OROS
FOUND ARE PRINTED.
OCCUPIES FIRST 110 WORDS OF MEMORY
TIMING. ABOUT 4 SECONDS PER ADDRESS SEARCI-lf.D PLUS ONE LIN£:: OF
PRINT FOR EACH REFERENCE THERETO FOUND.
C(t.-(R/8QO, MU EAS3

256MUEXPI

LIBRARY

MURA EXPONENTIAL, Bl\SE 2
GIVEN X, A NEGATIVE FIXED POINT FRACTION OR ZERO, COMPUTES 2
TO THE X AS A FIXED POINT FRACTION.
TIME, 4~2 MS~ SPACE, 26
WORDS PROGRAM, 1 COf"MQN.
ERROR LESS THAN 2 TO THE -31 ANI)
FOR X LESS THAN 1/2 THE ERROR IS LESS THAN 2 TO THE -33

0704
0704

PROGRAM

MURA EXPONENTIAL, BASE E
GIVEN X, A NEGATIVE FIXED POINT FRACTION, COMPUTES E TO THE
X AS A FIX.ED POINT FRACTION..
TlM[, 4.4 MS~
SPACE. 26 WORDS
PROGRAM, 1 COl<'MON.
ERROR LESS THAN 2 TO THE -31 AND FOR X
LESS JHAN 112 THE ERROR IS LESS THAN 2 TO THE -33.

0704
0704

0104

260NA1891

AVAILABLE PRIOR TO JANUARY 1962

EIGENVALUE FOR SYMMETRIC MATRICES IN flOATING POINT
THOMAS KASPARIAN
THE PIJ~POSE Of THIS SUBROUTINE IS TO FINO
THE EIGENVALUES OF A S,(MMI;;l,1.IC MATRIX USING NORMALIZED FlOATI
NG POINT NUMBERS, THE ROUTINE OCCUPIES 364 LOCATIONS WITH TEM
pORARY STORAGE INCLUDED J.N THE PROGRAM

183

IBM 0704
LIBRARY ABSTRACT
....................................................................

IBH 0104 PROGRAM LIBRARY ABSTRACT
.............
.......................................................

0704

0704

~ROGRAM

261G1"IIOSI

AVAILABLE PRIOR TO JANUARY 1962

INPUT-OUTPUT SYSTEM
AN EXECUrtVE ROUTINE WHICH CONTROLS MUL T]JOB NON-STOP
OFF LINE OPERATION OF THE 104 .. OpERATES IN THREE PHASES
III CONVERTS ALL JOBS FROM BCU TO BINARY. 121 SUPERVISES
S[QUENCING OF JOBS DURING PROGRAM EXEC.UTION AND 131 CONVERTS
BINARY OUTPUT TO BCD FOR ALL JOBS. ALSO PROVIDES SAP
ASSEMBLIES WITH OPTIONAL IMMEDIATE EXECUTION, TwO TYPES OF
DEBUGGING ROUTINES AND .JOB ACCTG. REQUIRES 6 TAPl:S, 1 CORE,
DRUM 1 AND A PROGRAMMABl~ CLOCK IOPTIONALI.

'

0704
0704

AVAILABLE PRIOR TO JANUARY 1962

270GIDBUG

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

262NYPCV,1

PERIPhERAL CARD VERIFIER
VERIFIES AN N CHARACTER BC,!,) TAPE RECORD OF M FIELDS ON
SELECTED INPUT INY PCR2I OR OUTPUT /NY PCP2I TAPE. SUB-PROGRAM
OF THE N. Y.. INPUT-OUTPUT SYSTEM. USES 125 LOCATIONS.

DEBUGGING ROUTINE
DEBUG IS A COLLECTION OF THREE SUBROUT JNES USED IN DEBUGGING. 11 l'RACE IS A COMPLETE FULL TRACE PROGRAM. 21 TRAP IS
A PARTIAL TRACE USING THE TRAPPING MODE .. 3/ DUMP IS A CORE
DUMP ROUTINE .. USES THE LAST 780 STORAGE CELLS IN MEMORY ..

0704

0704

262NYPLVI

AVAILABLE PRIOR TO JANUARY 1962

PERlFPHERAL LINE PRINTER VERIFIER
TO VERIFY AN N CHARACTER BCD RECORD OF M FIELDS ON A
SELECTED OUTPUT TAPE FOR PERIPHERAL PRINTING

0704

0104

AVAILABLE PRIOR TO JANUARY 1962

263~UBPU3

MURA BINJIRY PUNCH ROUTINE
PUNCHES A BLOCK OF N WORDS fROM CORE STORAGE ONTO ABSOLUTE
BINARY CARDS.
LOADING ADDRESS ON CARD SAME AS LOCATION IN
STORAGE.
PARAMETERS R,N MUST BE ENTERED INTO THE MQ.
41
WORDS OF PROGRAM.
THE PUNCH OPERATES AT FULL SPEED
1100 CAR.DS/MIN./.
SElF-LOADING.

IR/-'

0704

0704

PROGRAM

LIBRARY

263MULBL4

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

24 WORD PER CARD BINARY LOADER
A ONE CARD SELF-LOADi.NG PROGRAM.
THIS ROUTINE CONSECUTIVELY
LOADS ABSOLUTE BINARY CARDS WITH 24 WORDS PER CARD. A
PROGRAM STOP "llOWS THE USER TO ENTER MANUALLY AN INITIAL
LOAOING ADDRESS INTO THE
THIS ADDRESS MUST BE LARGER
THAN 7 ..

"'0.

0704

263MURDI2

273CLMMOl

AVAILABLE PRIOR TO JANUARY 1962

MATRiX ELEMENT BY elEMENT MULTIPLY OR DIVIDE, REAL
OPERATES ON TWO MATRICES BOTH OF kHICH ARE REAL AND ENTIRELY
IN CORE, TO FORM A RESULTING MATRIX REAL AND ENTIRElY IN CORE
BY AN ELE~ENT BY ELEMENT MULTIPLICATION OR DIVISION.
REQUIRES 81 WORDS PLUS 'C.O"'HON THROUGH COMMON & a CORR. 3"3

AVAlLABlE PRIOR TO JANUARY 1962

2&3/-'UATNl

MURA FIXED POINT ARCTANGENT ROUTINE
COMPUTES ARCTAIIIGENT OF A fIXED POINT FRACTION ..
REQUIRES 27 WORDS PLUS 2 COMMON.
TIMING 4.5 MS.

0704

?73CL~MP2

AVAILABLE PRIOR TO JANUARY 1962

POSTMULTIPLY REAL BY SYMETRIC REAL MATRIX
TO POSTMULTLPlY A REAL MATRIX, WHICH IS IN CORE, BY A
SYfo/fo'ETRIC REAL MATRIX WHICH IS IN CORE, IN AN ElEMENTAL
MAt'4NER. THE PRODUCT WILL BE IN CORE. USES MATRIX INTERPRETATION ROUTINE, CL MTX!. REQUIRES 306 WORDS PLUS COMMON
THROUGH CO~MON £. 16. CaRR. 343

0704

273ClSME6

AVAILABLE PRIOR TO JANUARY 1962

NON-lINE,IIR SIMULTANEOUS EQUATIONS, REAL
TO CALCULATE A VECTOR SOLUTION OF N SIMULTANEOUS
QUADRATIC EQUATIONS IN THE NEIGHBORHOOD OF A VECTOR GUESS.
THE RCUTINE ASSUMES T~E SOLUTIONS HAVE CONVERGED WHEN THE
SUMS OF 'J1HE ITERATES OF TWO SUCCESSIVE ITERATIONS AGREE TO
FOUR OCTAL FIGURES .. REQUtRES 364 WORDS PLUS COMMON THROUGH
COtlMON £. 14 ..

..................................................................
IBM

0704

0704

PROGRAM

273CLSME6

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

NON-LINEAR SIMULTANEOUS ECUATIONS, REAL
TO CALCULATE A VECTOR SOLUTION OF N SIMULTANEOUS
QUADRATIC EQUATIONS IN THE NEIGHBORHOOD OF A VECTOR GUESS.
THE RQUT[.NE ASSUMES THE SCLUTIONS HAVE CONVERGED WHEN THE
SUMS CF THE nERATts Of TwO SUCCESSIVE ITERATIONS AGREE TO
FOUR OCTAL fiGURES.
REQUIRES 364 WORDS PLUS COMMON THROUGH COMMON £. 14 CDRR. 343

AVAILABLE PRIOR TO JANUARY 1962
0704

274RS0140

AVAILABLE PRIOR TO JANUARY 1962

MURA READ DEC I MAL INTEGERS ROUTINE
READS ONE OR TWO DECIMAL INTEGERS FROM A CARD AND PLACES
THEM IN CORE STORAGE.
STORflGE REQUIRED-62 WORDS PROGRAM £. 6
CO"'MON.
EXLT IS AFTER EACH CARD kITH 12R IN AC.
FOR FUll
READER SPEED, 24.9 MS .. ARE AVAILABLE FOR COMPUTATION BETWEEN
EXIT AND RE-ENTRY.

MNEMONIC OCTAL LOADER
LOADS INSTRUCTIONS WITH OCTAL ADDRESSES, TAGS, AND DECREMENTS AND MNEMONIC OPERATiONS FROM THE SHARE EXTENDED ORDER
LI ST INTO DESIGNATED OCTAL LOCATIONS IN MEMORY GREATER THAN
403.

0704

0?04

263MURONl

AVAILABLE PRIOR TO JANUARY 1962

MURA READ OCTAL NUMBER ROUTINE
REAOS OCTAL ADDRESSES AND WORDS FROM CARDS, CONVERTS TO
BINARY, AND PLACES THE WORDS INTO THEIR SPECIFIED LOCATIONS.
EITHER A SElF-LOADING PROGRAM OR A CLOSED SUBROUTINE WITH
EXIT TO ZERO.
UP TO FOUR OCTAL WORDS PER CARO ARE ALLOWEO ..
CARD READER RATE OF 250 CARDS PER MINUTE IS MAINTAINED

0704

263MUSCR2

AVAILABLE PRIOR TO JANUARY 1962

MURA FIXED POINT SQUARE ROOT ROUTINE
CO.'1PUTES THE SQUARE ROOT OF A SINGLE OR DOUBLE PRECISION
FIXED POINT FRACTION. REQUIRES 18 WORDS PLUS '3 COMMON.
Tllf1-NG .5MS MINIMUM.

0704

264ASAS49

AVAILABLE PRIOR TO JANUARY 1962

STORAGE HISTORY TRACE,
PRINTS ONLY THE REFEkENCES TO A GIVEN BLOCK OF
STORAGE WITHIN A GIVEN PART OF A PROGRAM-TRACING
INFORMATION COMING FROM COtoTROL CARDS. USES
OCTAL LOCATIONS 0 TO 403.

184

267PKEOIT

EDITOR AND TRANSLATOR
TRANSLATES BCD,AND BINARY TO DECIMAL,FIXED ro FIXED,FlOATlNG
TO FIXED OR. flOATING TO FLOATING. WRITES ON PRINTER,PUNCHED
CARDS OR'TAPE. TSX SEQUENCE WITH CONTROL WORDS SPECIFYING
TYPE OF TRANSLATION AND PRINTED LINE, PUNCHED CARD OR TAPE
RECORD FORMAT .. PRINTS OR PUNCHES 72 COLUMNS PER CARD OR LINE
£. WRITES 120 CHARACTERS PER TAPE RECORD. REQUIRES 442 STORAGE
CELLS.

275NYSNAP

AVAILABLE PRIOR TO JANUARY 1962

SNAPSHOT TRACER
PROVIDES, AT ANY POINT IN A PROGRAM UNDER TEST, SNAPSHOTS OF
ANY SELECTED PORTIONS OF MEMORY.
OUTPUT IS WRITTEN ON A
BINARY TAPE, THE MACHINE CONDITION COMPLETELY RESTOREU,
AND THE PROGRAM CONTINUED AFTER EACH SNAPSHOT.
AT COMPLETION Of PROGRAM OR UNEXPECTED STOP, A POST MORTEM MAY BE INITIATED WHICH WIll GIVE ANY FURTHER SNAPSHOTS DESIRED.. AN
OUTPUT PROGRAM READS IN THE BINARY TAPE AND CONVERTS THE
SNAPSHOTS TO FIXEO DECIMAL, flOATING DECIMAL. OCTAL, OR BCD
FORMAT..
ON-LINE OR OFF-LINE PRINTING AVAILABLE ..

0704

27BUASP04

AVAILABLE PRIOR TO JANUARY 1962

TRAP OCTAL MEMORY PRINT - ITRAP SCOOPI
PRINTS, IN OCTAL, OFF-LINE AND/OR ON-LINE, THE CONTROL PANel
INFORfoIATION AND THE CONTENTS OF ANY NUMBER Of BLOCKS OF CORE
STORAGE.
PRINTING MAY BE PERFORMED DURING THE EXECUTION OF
TIlE PROGRAM, WITHOUT OTHERWISE AFFECTING THE ACTION OF THE
PROGRAM IN ANY WAY.
PRINTING IS SPECIFIED BY CONTROL CARDS,
EACH TRAP BEING SPRUNG WHEN A SELECTED IN'STRUCTION HAS BEEN
EXECUTED A DESIGNATED NUMBER OF TIMES. PRINTING MAY ALSO BE
PERFORMEO AFTER THE PROGRAM HAS STOPPED.
THE ROUTINE IS
STORED ON A DRUM AND READ INTO CORE STORAGE WHEN NEEDED.

10M

0104

0104

PROGRAM

LIBRARY

27<)PK9AP4

ABSTRACT

AVAILABLE PR:OR TO JANUARY 1962

104 ASSEMBLER OF 709 PROGRAMS
MODIFICATION OF UA SAP2 TO ASSEMBLE 709 SYMBOLIC PROGRAMS ON
TIiE 704 ..

0704

2BOMUCRTl

2BOMUDPAl

AVAILABLE PRIOR TO JANUARY 1962

MURA FLOATING POINT DOUBLE PRECISlur~ ADDITION
AllDS TWO flOUBLE PRECISION FLOATING POINT NUMBERS, ONE LOCATED
IN AC AND MQ, THE OTHER IN COMMON AND COMMON!:.I.
THE MSP OF
EACH NUMBER MUST BE NORMhLIZED.
32 WORDS OF PROGRAM (. 4
COIIIION.
TIMING .6-1.4 MS.

0104

2BOMULCG2

AVAILABLE PRIOR TO JANUARY 1962

HURA FIXED POINT LOGARITHM. BASE 2
GIVEN fI. FIXED POINT FRACTION X MORE THAN ZERO AND LESS THAN·
I. LOGAR IT H1-'. X BASE 2 IS COMPUTED.
MAXIMUH ERROR 2EXP-34.
MINIMUM T-l~E 1'>.9 MS •• MAXIMU~ TIME 19.2 MS.
46 ~ORDS
PROGRAM & 5 ~ORllS COIIMor~.

0704

280MURKYI

AVAILABLE PRIOR TO JANUARY 1962

/'IURA FIXED POINT RUNGE-KUllA
SOLVES A SET OF N SIMULTANEOUS FIRST ORDER DIFFERENTIAL
ECUATlONS.
52 WORDS OF PROGRAM PLUS 3 COMMON PLUS 3N WORDS
OF STORAGE.
TIMING 4.22N r. 0.59 1-15. PLUS AUXllllARY T1~E PER
SEE S.D. 02 HU RKY4 891
RUNGE-KUTTA STEP.

0104

2!lOMUSIN2

AVAILABLE PRIOR TO JANUARY 1962

~URA

FIXED POINT SINE
CQI"PUTES THE SINE OF AN ANGLE EXPRESSED IN RADIANS.
ENTER
WIT,", IINGLEI!2PII IN AC.
EXIT WITH l/2 SINE IN AC.
MAXIMUM ERROR 1.2 X 2 EXP-3/+.
RMS ERROR 1.4 X 2 EXP-36.
38 I;ORDS PROGRAM r.. 3 WORDS COMMON..
TlMING 3.1 MS.
IBM

0104

0104

PROGRAM

2!lOflUSIN3

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

MURA FIXED POINT SINE
COtlPUTES THE SINE OF AN Af'..GLE EXPRESSED IN RADIANS.
ENTER
WITH IINGLEII2PII IN AC.
EXIT WITH 1/2 SINE IN AC.
MAXIHLM ERROR .1 X 2 EXP-33.
RMS ERROR 2 EXP-35.
34 WORDS
PROGRAM & 3 WORDS COMMON.
TIMING ).1 MS.

0104

282PKCKRS

IBM

0101t

0104

AVAILABLE PRIOR TO JANUARY 1962

~URA IJINARY PUNCH ROUTINE 4
PUNCHES BINARY INFORMATION FROM CORE MEMORY ONTO 104 BINARY
THE FIRST WORD ADDRESS AND
CARDS WI TH .24 WORDS PER CARD.
TOTAL NUMBER OF WORns DESIRED TO BE PUNCHED ARE SPECIFIED BY
MANUAL ENTRY INTO MQ.
A SELF-LOADING PROGRAM OF 20 WORDS.
PUNCH OPERATES AT FULL SPEED.

281~ULOG3

AVAILABLE PRIOR TO JANUARY 1962

MURA FIXED POINT LOGARITHI-', BASE E
CIWPUTES THE NATURAL LOGARITH/A. OF l&Y IN FIXED PO{NT
ARlTHt-'ETIC. FOR Y GREATER OR EQUAL TO -1/2 AND LESS THAN 1.
Rf'lS ERROR ABOUT 1.5 TIMES 2 EXP-35, MAX ERROR LESS THAN
2 EXP-32.
TlI":E 2.71"5. 41 WORDS PROGRAM & 3 WORDS COl-',MON.

283f"UROF3

B - 704

AVAILABLE PRIOR TO JANUARY 1962

283MURFD2

AVAILABLE PRIOR TO JANUARY 1962

0104

2B3MUSCR3

AVAILABLE PRIOR TO JANUARY 1962

HURA FIXED PonH SCUARE ROOT ROUTINE
COMPUTES THE SQUARE ROOT OF A SINGLE OR DOUBLE PRECISION
rtXED POINT FRACTION.
RECUIRES 21 WORDS PLUS 3 COMMON.
TlfHr~G •• 5f~S': ~ItH~Ut-l.

AVAILABLE PRIOR TO JANUARY 1962
ARBITRARY CURVE PLOTTER SUBROUTINE
PLOTS SIMULTANEOUSLY FROM 1 TO 6 FUNCTIONS USING ON-LINE
PRINTER. COORDINATE LINES PRINTED AT SPECIFIED INTERVALS.
PLOOTING CHARECTER FOR EACH VARIABLE MAY BE CHANGED AT WIll.
PRINT WHEEL POSITIONS 8 THRU 108 ARE USED.
TIMING DEPENDENT
UPON VALUES PLOTTED. VARIES FROM 75 TO 150 LINES/MIN. RESOLUTION t: OR - o. PER CENT FULL SCALEE. CDRR./391.

0104

2B6NYDSOI

AVAILABLE PRIOR TO JANUARY 1962

OCTAL MEMORY PRINT OUT PROGRAM
PRINTS IN OCTAL. AND WITH ALPHABETIC INTERPRETATION OF
OPERATION CODES,T!:.E CONTENTS OF CORE STORAGETDRUMS,rAPESTAND
THE ~ACHINE CONOtTION.AT THE USERS OPTlON,RESTORES THE
ORIGINAL MACHINE CONDITION AND CONTENTS OF STORI15.EXCEPT
corU: LOCATIONS 0-1 AND AND ONE LOGICAL DRUM

IBM

010'+

0104

P.ROGRAM

290GEMTOI

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO .JANUARY 1%2

MATRIX TRAI'4SPOSED ON ITSELF
I-'IITRIX CONSISTS OF IJCI WORDS
THE FIRST OF WHICH IS A CODE WORD
IA EQL; ZER 1.0,J
THE R[MAINING IJ .. OROS IN ROW FORM
81 LOCATl.ONS (. 1 COMMON STORAGE a CORR.916

290GESTOI

AVAILABLE PRIOR TO JANUARY 1962

SCUARE MATRIX TRANSPOSED ON ITSELF
MATRIX CONSISTS Of ~.Il1.nl WORDS
THE FIRST OF WHICH IS A CODE WORD
IA t;Qt; lER M.O,M
THE REMAINING MIMI WORDS IN ROW FORM
58 LOCATIONS r. 6 CO~MCN STORAGE

296NY CP2

AVAILABLE PRIOR TO JANUARY 1962

AUTO-CORRELATION AND POWER SPECTRUM ANALYSIS
TO COIIPUH EITHER OR IWrH THE AUTO-CORR.ELATtON COEFFICIENTS
AND TI-'E PC'nER SPECTRUII OF A SET OF Tlt-:E-SERIES DATA.
IF
IT IS DESIRED. THE DATA MAY BE NORMAUl[D OEFORE BEING USED
IN THE ABOVE COMPUTATION.
IN THIS CASE TI-'E FREQUENCY DISTRIBUTION OF THE NORMAltZEO DATA IS ALSO COMPUTED.
THIS
DIFFERS FROl-'. NY CPl IN THAT CORE STORAGI::: Of 8192 IS REqUIRED.
UP TO 5300 OBSERVATIONS MAY BE HANDLED.
CORR.I 680

010 1•

300CSRDMl

AVAILABLE PRIOR TO JANUARY 1962

RANDO'" NUI-'.BE-R GENERArOR
GENERATES A FLOATING POINT RANDOM NUMBER IN THE
ACCLMLLATOR DRAWN FR01-' A SQUARE DISTRIBUTION. IT USES
TEN CELLS AND .S MILLISECONDS

0104
0104

283MUROF4

ABSTRACT

HURA READ FLOATING DECIMAL ROUTINE
READS A NUMBER AND AN ADDRESS FROM A CARD AND PLACES THE
NUMB[R IN CORE AT TIlE SPECIFIED ADDRESS.
EXIT IS UPON END
OF FILE OR ON 12 RIGHT WITH 12 RIGHT IN THE ACCUMULATOR AS A
LOGICAL WORD.
STORAGE REQUIRED. 164 WORDS!:. 10 COMMON.
UNllER EX.CEPTtONAL CIRCUMSTANCES THE READER MAY NOT BE
OPERATED AT FULL SPEED ..

0104

0104

LIBRARY

MURA READ DECIMH FRACTION ROUT[NE
READS A DECIMAL ADDRESS ANO FRACTION FROM A CARD AND PLACES
THE'" IN COtJMON AND COMMON &1 RESPECTIVELY.
ACCURACY 15
I 2EXP-J6.
STORAGE REClUIREO--B9 PROGRAM !:.9 COMMON.
EXIT IS
AFTER EACH CARD WITH 12R LOGICALLY IN AC.
FOR FULL READER
SPEED 15 MS. ARE AVAILABLE BETWEEN EXIT AND RE-ENTRY.

0104

283~UBPU4.

PROGRAM

AVAILAflLE PRIOR TO JANUARY 1962

CHECK[R OE~.ONSTRATI0N PROGRAM
WILL PLAY A STANDARD CHECKER GAME. USING A STA"IOARO CHECKER
HOARll WHICH IS NUMBER[D. USES STANDARD SHARE BOARDS. REQUIRES
A ~ASK FOR THE I-'Q REGISTER NEONS ON OP. PANEL.
OP. PAN(L
KEYS SHOULD BE RENUMBERED. PR}!'.JTS OUT THE MOVES FOR BUTII
SlOES AND AN ANALYSIS.
~.ACHINE WILL STOP IF ITS OPPONENT
ENTERS AN ILLEGAL MOVE.
~ILL PUNCH OUT A CARD CONTAINING
THE PCSITIONS OF THE PIECES ON THE BOARD IF THE GAME IS TO BE
CONTlJliUEO AT A LATTER TIME.

010'+

0704

AVAILABLE PRIOR TO JANUARY 1962

HURA FLOATING POINT CUBE ROOT.
COMPUTES CUBE ROOT OF A NORMALIZED FLOATING POINT NUMBER
RESIDING IN THE ACCUMULATOR.
UPON EX-IT THE NORMALllED RESULT
IS AGAIN PLACED IN THE ACCUMULATOR.
REQUIRES 30 WORDS PLUS
3 CO~MON.
TIMING IS 5.1 MS.

0104

.........................................................

301Rl\1l31

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

ROF3 MUR.A READ DECIMAL FRACTION
REACS AND CONVERTS TO BINARY DECIMAL FRACTIONS AND ADDRESSES.
CARDS ARE PUNCHED WITH ONE FRACTION AND ADDRESS ON EACH.
ANY
PUNCHING IN 12R WILL CAUSE ROUTINE TO GIVE UP CONTROL.
~HEN READING.
CONVERSION OF FRACTION IS ACCURATE TO 35 BITS.
THE CARD READER IS KEPT AT FUll SPEED.
REQUIRES 93 STORAGE
CElLS PLUS 8 CEllS OF TEMPORARY STORAGE.

OCTAL TAPE PRINT
prUNTS A TAPE. 01'\1 LINE OR OFF LINE. BINARY OR DECIMAL.
CONTROL CARD PRDVIOES---OPl[ONAL RE,"INO, OPTIONAL BACKSPACING
OR SKIPPING OF RECORDS, SELECTION OF THE NUt-IBER OF FILES OR
RECORDS TO BE PRINTED, SELECTION OF ANY N CONSECUTIVE WORDS
~ITHIN RECORDS, OPTIONAL USE OF IDENTIFICATION.

185

tBM

0704

0704

PROGRAM

L1BRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

302NYMONI

MONITOR SUBROUTINE
PRIJIoTS ONLINE IN OCTAL THE CONTENTS OF ANY SPECIFIED CORE
LOCATIONS ALONG WITH ANY DESIRED BCD INFORMATION.
THIS
SL;aROUTINE ~AY BE USED TO MONITOR PROGRAMS, E.G. TO PRINT
OUT THE CONTENTS OF A VARIABLE CONTROL WORD UPON ENCOUN
TERING AN ERROR.

IflM

0704

AVAILABLE PRIOR TO JANUARY 1962

310MUSCP2

MURA SIX COLUMN FRACTION CATHODE RAY TUBE DISPLAY
SCOPE SIX FIXED-POINT FRACTIONS LOCATED IN SUCCESSIVE CORE
MEMORY LOCAl'tONS AS ONE LINE.
93 PROGRAM PLUS 7 COMMON
WORDS.
TIMING 5S0 MS. 1 UNE.

0704

AVAILAOLE PRIOR TO JANUARY 1962

311GMMUFI

THE THANSCENOENTAL FUNCTIONS MU AND NU
COMPUTATION OF THE TRANSCENDENTAL FUNCTIONS MU AND NU
US[O IN THE HERTZ STRESS FORMUlAS. GIVEN COS TAU, MU
AND NU ME COMPUTED BY A FIFTH OR NINTH DEGREE
POLYNOMIAl APPROXtMAT[ON .. REQUIRES GMSQTl BASED ON
UASCR3 WITH AN ERROR RETURN. 107 CellS f. 11 COMMON

IBM

0704

0704

PROGRAM

3l4~UCRT3

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANuARY 1962

MURA FIXED POINT CUBE ROOT
COMPUTES THE CUBE ROOT OF A SINGLE OR DOUBLE PRECISION FIXED
POINT FRACTION.
REQUIRES 28 WORDS PROGRAM PLUS 3 TEMPORARY.
TIMING IS 1.2 MS PER ITERATION

0704

314MUPRF4

AVAILABLE PRIOR TO JANUARY 1962

MUR.A SIX COLUMN FRACTION PRINT
TO PRINT SIX FIXED POINT FRACTIONS ON ONE LINE OF THE 716
PRINTER.
THE LOCATION OF THE FIRST FRACTION IS GIVEN IN THE
CALLING SEQUENCE.
A MAXIMUM ERROR OF 3 IN THE ElEVENTH
DECIMAL PLACE IS INTRODUCED DURING CONVERSION.
THE SHARE
PRINTER BOARD NO.1 IS USED.
114.8 MS OF CALCULATING TIME
IS AVAILAflLE BETWEEN SUCCESSIVE ENTRIES WITHOuT REDUCING THE
PRINTER SPEED OF 150 LINES PER MINUTE.

0704

314MURKY3

AVAILABLE PRIOR TO JANUARY 1962

MURA flOATING POINT RUNGE-KUTTA
SOLVES A SET OF N SIMULTANEOUS FIRST ORDER DIFFERENrtAL
ECUATIONS.
114 WORDS OF PROGRAM £. 8 WORDS TEMPORARY £. 7N
WORDS OF STORAGE.
TIMING. 72MS. £./4.98£.X/N MS. £. 4/AUXIlIARY
SUBROUTINE Ttl>'E/MS. PER INTEGRATION STEP.

0704

3"I4MUSCP3

AVAiLABLE PRIOR TO JANUARY 1962

GENERAL ALPHANUMERIC CATHODE RAY DISPLAY
DISPLAYS ALPHANUMERIC MESSAGES ON THE 740 OUTPUT RECORDER.
144 HeRDS PROGRAM r. 7 WORDS COMMON.
Tl"lE ABOUT 8.5
MIU"'!."SECONOS PER CHARACTER ..

0704

316NA0259

AVAILABLE PRIOR TO JANUARY 1962

PACT lA SAMPLE PROGRAM-,
PROVICES AN EXAMPLE OF PACT IA INPUT AND OUTPUT AND PROVIDES
A SIMPLE TEST OF COMPilER OPERATION ON ANY MA3HINE CONFIGURATION. PROGRAM IS WRITTEN IN PACT lANGUAGE.

186

3 [SGMTEOI

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1%2

319GUJASI

AVAILABLE PRIOR TO JANUARY 1962

SIMULATES A DIGITAL DIFFERENTIAL ANALYlER TO SOLVE
SIMULTANEOUS ORDINARY DIFFERENTIAL EQUATIONS OF ANY ORDER,
UNUR OR NON-LINEAR. INTEGRATORS ARE DEFINED TO OPERATE IN
THE MANNER OF THOSE OF CONVENTIONAL DIGITAL DIFFERENTIAL

:~~~ ~~~~SpO~N~U~~~ ~~~~~I'~~R~~~~~~Ai~~ciu~~ri8~L~o ~u

I
USED.
SCALING OF THE INTEGRATORS IS REQUIRED. EMPIRICAL FUNCTIONS
"lAY BE INTROOUCEO INTO THE EQUATION/51. THE NUMBER OF
INTEGRATORS AVAILABLE IS APPROXIMATELY 300 PER 4096-CORE
STORAGE.

AVAILABLE PRIOR TO JANUARY 1962

304NORNGN

RANDO,.. NUMBER GENERATOR
GENERATES FIXED OR FLOATING POINT UNIFORM RANDOM NUMBERS

0104

LIBRARY

AVAILABLE PR[OR TO JANUARY 1962

302NYMON2

MCNITOR SUBROUTINE AND OUTPUT PROGRAM
£.RINTS ONLINE IN OCTAL THE CONTENTS OF ANY SPECIFIED CORE
LeCATIONS,ALONG WITH ANY DESIRED BCD INFORMATION.
THIS
SUBROUTINE MAY BE USED TO MONITOR PROGRAMS,E.G.,TO PRINT
OUT THE CONTENTS OF A VARIABLE CONTROL WORD UPON ENCOUNT
ERING AN ERROR. MON2 CONTAINS NY DUn WHICH MAY BE USED
I NDEPENOENTl Y.

0704

PROGRAM

TAPE EDITOR AND DUPLICATOR WITH COMPARE
TO TRANSFER ANDIOR COMPARE IN ANY ORDER, ANY RECORDS OR
ANY FILES FROM ANY TAPE OR TAPES TO ANY OTHER TAPE
OR TAPES 305 CELLS FOR PROGRAM REMAINDER OF CORE
ERASABLE

0704
0704

0704

0704

32H'UFDD2

AVAILABLE PRIOR TO JANUARY 1962

,"IURA FLOATING DEC IMAl DUMP
PRINTS A SPECIFIED BLOCK OF NUMBERS FROM STORAGE IN FLOATING
POINT FORM.
MURA PRINTER BOARD 1 IS REQUIRED.
THE LOCATIONS
FRCr-' 0 THROUGH 2M ARE USED BY THIS ROUTINE, AND WORDS IN
THEM ARE DESTROYED.

0704

321MUSCP8

AVAILABLE PRIOR TO JANUARY 1962

MURA CATHODE RAY TUBE POINT PLOTTER
DISPLAYS A SEQUENCE OF POINTS ON THE CRT.
POINTS ARE PLOTTED
AT REGUUR INTERVALS ALONG THE X AXIS.
73 WORDS PROGRAM.
AVERAGE TIME PER POINT PLOTTED IS I.ISMS.ON SUBSEQUENT ENTRY.

0704

324NYDM13

AVAILABLE PRIOR TO JANUARY 1962

MATRIx INVERSION BY PARTITIONING
INVERSION OF POSITIVE DEFINITE SYMMETRIC MATRICES OF ORDER
UP 10 ISO.

IB1".

0704

0704

PROGRAM

3'25RS0141

LIBRARY

ABSTRACT

AVAILAALE PRIOR TO JAIIIUARY 1962

FIXED AND FLOATING DECIMAL CARD INPUT REPLACES RS0046
RHOS UP TO FOUR DECIMAL NUMBERS PER CARD AND STORES THEM IN
COI{E STORAGE AS EITHER NORMALIZED FLOATING POINT OR FIX(D
POINT BINARY NU,,"BERS. ALLOWS FOR COMPUTING BETWEEN CARDS IF
DESIRED AND FOR ALTERING THE EFFECTIVE STORAGE LOCATION.
NOR,..AL TSX SEQUENCE WITH ONE CONTROL WORO,ERROR RETURN,AND
nw NORMAL RETURNS DEPENDING UPON WHETHER THERE IS COMPUTING
BET',jEEN CARDS.
USES 352 STORAGE CEUS £. 41 COMMON. THIS
PROGRAM MADE VOID BY RS0046 DIST. 386

0704

327GMITR2

AVAILABLE PRIOR TO JANUARY 1962

I TERATION SUBROUTINE, INTERVAL-HALVING METHOD
GIVEN F/X/, TO FIND A VALUE FOR X I1ITHIN A GIVEN
EPSILCN OF RELATIVE ERROR IN A SPECIFIED INTERVAL IA,O/.
THE INTERVAL-HALVING "'ETHOD IS PREFERRED OVER THE ME THOU
USED IN GMITRI WHEN X ~UST flE BOUNDED BY 11, OR FOU"lt) IN
A GIVEN INTERVAL IA,B/. THE INTERVAL IS THEN HALVED
SL'CCESSIVHY TOWARD F/x/-O UNTIL THE PRESCRI8ED ACCURACY
IS SATISFIED REQUIRES 134 STORAGES CEllS £. 2 COMMON.

0704

329NYDFMl

AVAILABLE PRIOR TO JANUARY 1962

DOUBLE-PRECISION FLOATING BINARY ~ATRIX CONVERSION PROG
TO CONVERT A MATRIX OR VECTOR IN FLOATING DECIMAL ON A BCD
TAPE TO DOUBLE-PRECISION FLOATING BINARY ON A BINARY TAPE,
ZEROS INSERTED \ojHERE NECESSARY.

0704

331CLSMD3

AVAILABLE PRIOR TO JANUARY 1962

SMOOTH AND DIFFERENTIATE UNEQUALLY SPACED DATA POINTS
TO SMOOTH N POINTS, WHERE N EQUALS OR 1S GREATER THAN 7,
WHICH MAY BE UNEQUAllY SPACED, BY THE METHOD OF LEAST
SQUARES.
OPTIONS TO MINI1"IlE RANUOM ERRORSIl.E. DISCARD
THIS
WILD POINTSI AND TO DIFFERENTIATE ARE PROVIDED.
ROUTINE DIFFERS FROM CL SMD2 IN THAT THE FIRST DATA POINT
tS ANCHORED. I.E., UNCHANGED, SO THAT THE CURVE WILL ALWAYS
PASS THRCUGH THIS POINT.
REQUIRES 448 WORDS PLUS 66 COMMON.

.................................................................

ABSTRACT
IBM 0104 PROGRAM LIBRARV
•••••••••••.••• •• • •• • •••••••••••••••••••••••••••••••• c •

0104

0704

10M

0704

P:ROGRAM

LIBRARY

33)CWBDO

AOSTRACT

AVAILABLE PRIOR TO JANUARY 1962

BINARY DECK MINIMIZER
REDUCES ,THE SllE OF A RELOCATA8LE BINARY DECK OR AN
ABSOLUTE BINARY DECK CONTAINING PATCH CARDS BY PUNCHING
ANEW ABSOLUTE DECK. USES CELLS 0-35

0704

AVAILABLE PRIOR TO JANUARY 1962

334NA0226

DOUBLE PRECISION INPUT StALING
FRANK HAJOALI
CONVERTS A GIVEN DOUBLE PRECISION BINARY
INTEGER TO A SCALED, FLOATING AND NORMALllED DOUBLE PRECISION
BINARY NUMBER X WITH COMPATIBLE SIGNS AND CHARACTERISTIC OF L
SH EQUAL CHARACTERISTIC OF MSH LESS 21.
SPACE REQUIRED 103 CELLS

070r.

334NA0229

AVAILABLF PRIOR TO JANUARY 1962

DOUBLE PRECt.StON OUTPUT SCALING
FRANK MAJDALI
SCALES A DOUBLE PR!)39S90N 6L01TING BINARY
NUMBER TO A DOUBLE PRECISION BINARY
INTEGER FOR OUTPUT.
SPACE REQUIRED 160 C.ELLS

0704

33SNYMAOl

0704

3'38CLPMC2

AVAll.ABLE PRIOR TO JANUARY 1962

EIGENVALUE SOLUTlON, REAL
TO FINO THE HIGHEST EIGENVALUE AND CORRESPONDING EIGENVECTORS OF THE MATRIX EQUATION
IAI IX SUB 11 - LAMDA SUB I IX SUB 11
WHERE ILAMDA SUB 11 IS AN EIGENVALUE AND IX SUB 11 IS THE
ASSOCIATED EIGENVECTOR OF THE MATRIX IA/.
THE MATRIX
MULTIPLY ROUTINE, CLMHPI MUST BE ASSEMBLEO CONCURRENTLY
REQUIRES 651 WORDS PLUS COMMON THROUGH COMMON & 40 PLUS
THE MATRIX MULTIPLY SUBROUTINE, DRUMS 2.3,4 AND TAPE 5.

.................................................................
0704

0704

PROGRAM

3'4UAATMl

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

ATMOSPHERIC DATA SUBROUTINE
THIS SUBROUTINE EFFECTIVELY REPRODUCES PORTIONS Of THE
ATMOSPHERIC DATA BASED ON THE ARDC HODEL ATMOSPHERE
FOR 1956 UP TO 53 KILOMETERS.
GIVEN ALTITUDE, FIND CORRESPONDING TEMPERATURE IN
DEGREES RANKINE. PRESSURE RATIO, DENSITY RATIO AND
VELOC ITY OF SOUND IN FT PER SEC ..
REQUIRES A SQUARE ROOT, LOGARITHM AND EXPONENTIAL
SUBROUHNE. USES 168 STORAGE CELLS PLUS 5 COMMON NEEDED
FOR St;R. RT. EXP, AND LN. ·SUBRO~nNES. TIME APPROX U.OMS.

0704

344RL0146

AVAILABLE PRIOR TO JANUARY 1962

T AALE SEARCH ROUT 1 NE
ROUTINE USES BINARY SEARCH TECHNIQUE TO FINO AN ENTRY
IN AN ORDERED TABLE.
CENTRAL SEARCH LOOP CONSUMES NINE
CYCLES FOR EACH ENTRY EXAMINED.
TABLE LENGTH MAY VARY
FROM CNE WORD TO ALL OF STORAGE.
MEAN SEARCH TIME: FOR
A lCOO WORD TABLE IS1.260 MS.
RL 0146 REQUIRES 65
STORAGE CELLS PLUS TWO COMMON.
ROUTINE IS NON-STANDARD
IN THE SENSE TI-IAT THE RESULT APPEARS IN INDEX 1.

0104

345ELSAVI

345ELSAV2

AVAILABLE PRIOR TO JANUARY 1962

354NA61.3

AVAILABLE PRIOR TO JANUARY 1962

COMPLEX NTH ROOT
YARBROUGH
COMPUTES THE NTH ROOT OF A COMPLEX NUMBI::R
PERfORMS PSEUDO-OPERATION IN COMPLEX ARITHMETIC ABSTRACTION
SPACE REQUIRED, 48 LOCAT ION$ CORRECTS NO. 87

0704

354NA66.3

AVAILABLE PRIOR TO JANUARY 1962

COMPLEX NATURAL LOGARITHM
YARBROUGH
COMPUTES NATURAL LOGARlTHM Of A COMPLEX
NUMBER. PERFORMS A PSEUDO-OPERATION IN THE COMPLEX ARITHMETIC
ABSTRACTION. SPACE REQUIRED 21 LOCATIONS

0704

354NAB7.3

AVAILABLE PRIOR TO JANUARY 1962

RECTANGULAR TO POLAR CONVERSION
YARBRCUGH
CONVERTS COORDINATES FROM RECTANGULAR TO
POLAR. PERFORMS A PSEUDO-OPERATION IN THE COMPLEX ARITH"1ETIC
AaSTRACTION. SPACE REQUIRED, 19 LOCATIONS

IBM

070 /,

PROGRAH

LIBRARY

ABSTRACT

••••••••••••••••••••••••••••••••••••••••••••••••••••••••• c •••••••

0704

35SGMATNl

AVAILABLE PRIOR TO JA.\\UI\i\Y 1962

SINGLE-VALUED ARCTANGENT ROUTINE
COMPUTES ARCTAN QUOTIENT CF TWO ARGUMENTS WITH PROPlR
QUADRANT ALLOCATION. DIvtSION IS CHECKED. USES 122 CE.LL5 PLUS
9 COt"MON. TIMING. t-IUIMUN 6.1 MILLISECOND.

0704

355GMDETR

AVAILABLE PRIOR TO JA'IIUI\Il.Y 1962

OETER"'INANT EVALUATLNG SUBROUTINE
GIl/EN AN ARBITRARY SQUARE MATRIX A AND SOME FLOATING .Pl)ltiT
VARIABLE 0, THIS SUBROUTINE WILL EVALUATE THE EXPRES~ION.
D X DET IAI. REQUIRES 426 MEMORY LOCATIONS PLUS (. COM~·:()~.
THIS ROUTINE IS PART OF TI-1E SURROUTItiE GMStMQ.

0104

355GHOTAB

AVAILABLE PRIOR TO JANUhRY 1962

DeUOLE INTERPOLAT ION
COMPUTES Y ECUALS F OF X AND Z FROM A TABLE OF X,Y,Z. ALL
VALUES AND CALCULATIONS ARE IN FLOATING POINT. GM TABI ~UST
ALSO 8E IN CORE STORAGE. REQUIRES 122 STORAGE CELLS & COMMON
DEPENDING UPON TABLE SIZE. EXTRAPOLATES FOR X OUTStDE TABLE.
CORR.1394

AVAILABLE PRIOR TO JANUARY 1962

THIS SUBROUTINE SAVES THE CONSOLE IAC.MQ.IRA,IRB,IRC.
AC AND MQ OVERFLOW, DIVIDE CHECK, TAPE CI-IECK, 4 SENSE LIGHTS,
AND SENSE SWtTHES 1-5/ AND ALL OF CORE STORAGE AND WRITES A
SELF LOADING TAPE. THIS TAPE WILL LOAD ITSELF, RESTORE CORES
AND ThE CONSOLE AND RETUP,N CONTROL TO THE I~AIN PROGRAM.

070r.

352GHFSOl

TI-IE F SYSTEM
THIS IS AN EXECUTIVE PROGRAM THAT CONTROLS FORTRAN
TO ALLOW MULTI-JOB-MULTt-FUNtTION OPERATION. ANY
CCMBINATION OF COMP1LE, EXECUTE. OR COMPILE ANO EXECUTE
JOBS MAY DE PLACED ON THE INPUT TAPE. NORHAL OPERATION
UTILIZES INSTRUCTION DECKS HAT ARE ACCEPTABLE TO THE
PERIPhERAL EQUIPMENT. BINARY4DECKS MAY 8E OBTAINED. THE
SAP7LISTJ,NG HAY BE PRINTED OR PUNCHED. OPERATION IS
SINGLE PHASE WITH FORTRAN UNCHANGED. IT REQUIRES 3 TAPES
BEYOND THE MACHINE COMPONENTS NEEDED BY FORTRAN.

0704

IBM

AVAILABLE PRIOR TO JANUARV 1962

SHARE ASSEMBLER
ASSEMBLES PROGRAMS WRITTEN IN SYMBOLIC fORM.
INPUT AND OUTPUT .MAY BE EITHER OFF-LiNE OR ON..
PRINTED OUTPUT INCLUDES
THE GIVEN PROCRAM IN SYMBOLIC AND THE ASSEMBLED PROGRAM IN
OCTAL.
OUTPUT IS ALSO PUNCIIED ON BINARY CARDS, OR IT MAY BE
WR ITTEN ON TAPE IN B I NARY CARD IMAGE FORM.
DEC IMAL t DC T AL.
AND HCLLERITH DATA MAY BE USED.
A LItSRARY OF STANDARD SU8ROUTINES IS AVAILABLE ON TAPE.
ADDRESS ARITHMETIC MAY BE
PERFORMED.
UA SAP 3-7 SUPERCEDES UA SAP 1-2. CORRI 431,457,
WRITE-UP OISI. S64. CORR.1716

AVAILABLE PRIOR TO ;JANUARY 1962

MOVING AVERAGES OF TIME-SERIES DATA
TO ANALYl.E A SET OF NON-STATIONARY TIME-SERIES OATA -::OR
PERIODIC AND TREND COMPONENTS. HOVING lVSR175S OF THE DATA
ARE USED TO MEASURE THE TREND OR NON-STATIONARY COMPONENTS,
WHEREAS THE DEVIATIONS OF THE ORIGINAL 41Tl FROM THE MOVING
AVERAGES INDICATE SHORTER FLUCTUATIONS. PERIODIC AVERAGES
OF THE DEVIATIONS GI.VE AN ESTlMAT5 OF THE PERIODIC COMPONENTS
IN THE ORIGINAL DATA. THE OUTPUT OF MOVING AVERAGES AND
DEVIATIONS MAY BE USED DIRECTLY AS INPUT WITH NY CP2. IT WILL
HANDLE UP TO 3200 OBSERVATIONS.

0704

3lt7UASAP3

B - 704

0104

35'iGMlTRF

AVAILABLE PRIOR TO JANUARY 1962

ITERATION SUBROUTINE
GIVEN X-R/X/. TO FIND A VALUE FOR X WITHIN A GIVEr-. EPS,lLON OF
RELATtV6 ERROR. THIS T(CHNIQUE ACCELERATES THE RAT[ or
CONVERGENCE IF THE ITERATION CONVERGES AND INDUCES
CONVERGENCE If THE ITERATION DIVERGES.

AVAILABLE PRIOR TO JANUARY 1962

THIS SUBROUTINE SAVES THE CONSOLE IAC.MQ,IRA,IRB,IRC,
AC AND MQ OVERFLOW, DIVIDE CHlCK, TAPE CHECK, 4 SENSE LIGHTS,
AND SENSE SWlTHES 1-5/, DRUMS 1-4, AND ALL OF CORE STORAGE
AND WRITES A SELF LOADING TAPE. ThiS TAPE WILL LOAD ITSELF,
RESTORE CORES, DRUMS 1-4 AND THE CONSOLE AND RETURN CONTROL
TO THe MAIN PROGRAM.

0704

355GMS IMC

AVAILABLE PR lOR TO JANUARY 1962

S I MUL T ANEOUS" EQUAT IONS SU BROUT INE
SOLVES AX EQUALS B WI-IERE A,B, AND X ARE MATRICt:S N BY N.N
BY S, AND N BY S~ S LESS THAN OR ECUAL TO N. ALL ElEMHHS
MUST BE STORED IN FLOATING POINT FORM. SUBROUTINE D(STROYS A
AND B. RECUIRES 415 STORAGE CE:LLS. 2 MINUTES TO INVERT A 40
BY 40 MATRIX.

187

....................•............................................
IBM

0701t" PiROGRAM

0704

355GMTABI

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

fABLE -INTERPIOLATION
ALL FLOATING POINT. "GIVEN X COMPUTES Y EQUALS F OF X FROM A
TABLE OF" X. Y VALUES. USUAL TS X SEQUENCE WITH RETURN TO Lt,3.
'REQUIRES 99 STORAGE CELLS £. COMMON DEPEND]NG UPON TABLE SIZE.
EXTRAPOLATES "FOR X OUTSr.oE TABLE. CORR /408

.................................................................
IBM

0104

AVAILABLE PRIOR TO JANUARY 1962

CADDIS

DOUBLE AREC]SION SIMULTANEOUS REAL EQUAT90NS,
DETERMINANT
K VECTOR.. SOLUTIONS AND DETERMINANT OF SIMUl TANEOUS EQUATIONS.
REQU9R5S 542 STORAGES PLUS 8 COMM'ON.

AVAILABLE PRIOR TO JANUARY 1962

CA0022

DOUBLE PRECIS[ON DET'ERMtNANT EVALUATION
EVALUATION BY CROUTS METHOD. REQUIRES
236 STORAGES PLUS 8 COMMON

0104

AVAILABLE PRIOR TO JANUARY 1962

J51MULOG4

HURA FIXED POINT LOGARITHM, BASE 2.
GIVEN A FIXED POINT FRACl'[ON X MORE THAN 0 AND LESS THAN ·It
LOGAR I THM X" BASE 2, IS COMPUTED.
MAX[MUM ERROR 2EXP-34.
MINIMUM TIME 16.6 MS.,MAXIMUM TIME 19.9 MS.
3B WORDS PROGRAM
£. 4 WORDS COMMON.

0704

.................................................................
0704

0104

PROGRAM

LrIBRARY

357MUPRF5

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

MURA VARIABLE COLUMN FRACTION PRINT
THIS ROUTINE PRINTS. ON LINE, ONE TO FIVE FIXED POINT
FRACTIONS PLUS A FIVE DIGIT INTEGER LINE LABEL.
THE MURA
PRINTER BOARD 1 IS REQUIRED.
ACCURATE TO -3 IN THE ELEVENTH
OECIMAL PLACE.
THE PROGRAM USES 82 WOROS STORAGE PLUS 20
WORDS TEMPORARY.

0704

357MUPRF6

AVAILABLE PRIOR TO JANUARY 1962

MURA VARIABLE COLUMN FRACTION PRINT
THIS ROUTINE PRINTS, ON LINE, ONE TO F[VE FIXED POINT
FRACTIONS PLUS AN INTEGER UNE LABEL.
THE MODIFIED SHARE 1
BOARD IS REQUIRED.
ACCURATE TO -3 IN THE ELEVENTH DECIMAL
PlLACE.
THE PROGRAM USES 81 WOROS STORAGE PLUS 26 WORDS
TEMPORARY.

0704

3'51HUSCP9

359ELSMOI

AVAILABLE PRIOR TO JANUARY 1962

362NA1l1l

AVAILABLE PRIOR TO JANUARY 1962

WRITE !rDIGn DECIMAL INTEGER AND SIGN ON CRT
K. SHIMIZU
WRITE 6-DIGIT DECIMAL INTEGER WITH BINARY
SCALE 35 AT SPECIF[ED LOCATION ON CRT. WIll PRINT MINUS SIGNS
AND SUPP,RESSES PLUS SIGNS. SPACE REQUIRED - 58 LOCATIONS
PLUS 66 WORDS OF A MODIFIED VERSION OF NA-109 WHICH INCLUDES
A TABLE OF TEN CHARACTERISTIC WOROS

0704

363NYAROl

AVAILABLE PRIOR TO JANUARY 1962

AUTOREGRESSlON ANAlOSIS
NYARI PERHns A REGRESSION ANALYSIS TO BE PERFORMED UPON THE
THE RESULTS OF AN AUTOCORRELATION ANALYSIS.
THE AUTOCORRELTHE REGRESION ANALYSIS
ATtON ANALYSIS IS PERFORMED BY NyePl.
IS PERFORMED flY CERTAIN PARTS Of NYMRI.
T85 NY3Pl PROGRAM
HAS BEEN SO MODIFIED THAT ITS OUTPUT MAY BE DIRECTLY UTILIZED
BY THE REGRESSION PARTS OF NYMRI.

3!59ELSM02

0704

363NYAR02

AVAILABLE PRIOR TO JANUARY 1962

AUTOREGRESS tON ANAL YS IS
NYAR2 PERMITS A REGRESSION ANALYSIS TO BE PERFORMED UPON THE
THE RESULTS OF AN AUTOCORRELATION ANALYSIS.
THE AUTOCORRELATION ANALYSIS IS PERFORMED BY NYCP1.
THE REGRESION ANALYSIS
[S PERfORMED BY CERTAIN PARTS OF NYMR2'
T85 NY3Pl PROGRAM
HAS BEEN SO MODIfiED THAT ITS OUTPUT HAY BE DIRECTLY UfILIZEO
BY THE REGRESSION PARTS OF NYMR2.
.

...................."............................................
]BM

0704

0104

PROGRAM

361MBHTX2

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

GENERAl MATRIX ABSTR:ACTION FROM TAPES
USED IN CONJUNCTION WITH MB MTXl FOR MAHtIX MANIPULATIONS
WHERE EITHER OR BOTH OF THE MATRICES A AND B ARE TOO LARGE
FOR AVAILABLE C.S.
PERFORMS THE FOLLOwrNG MATRIX OPERATIONS
ON ReAL OR COMPLEX MATRI,CES
1. ADD
2. SUBTRACT
3. MULTIPLY
4. MULTIPLY A MATRIX BY A DIAGONAL MATRIX
5. TRANSPOSE

0104

36BNA2740

AVAILABLE PRIOR TO JANUARY 1962

SINGLE INTEGRATION SUBROUTINE
ROGER MILLS
INTEGRATES A SINGLE VALUED FUNCTION OVER
A FINITE RANGE. USES COTES NUMBERSAS WEIGHTING COEFFICIENTS.
SPACE REQUIRED - 59 LOCATIONS PLUS 5 COMMON.

0704

36BNA2750

AVAILABLE PRIOR TO JANUARY 1962

DOUl:llE INTEGRATION SUBROUTINE
ROGER MILLS
COMPUTES A TWICE ITERATED INTEGRAL Of A
SINGH VALUED FUNCTION OF A SINGLEVARIABLE OVER A FINITE
RANGE. USES COTES NUMBERS AS WEIGHTING COEFFICIENTS. SPACE
REQUIRED - 56 LOCATIONS PLUS 6 COMMON ..

0704

368NA2160

AVAILABLE PRIOR TO JANUARY 1962

TRIPU: INTEGRATiON SUBROUTINE
ROGER MILLS
COMPUTES A THRICE ITERATED INTEGRAL OF A
SINGLE VALueo FUNCTION OF A SINGLEVARlABLE OVER A FINITE
RANGE. USES COTES NUMBERS AS WEIGHTING COEFFICIENTS.
SPACE
REQUIRER-69 LOCATIONS PLUS 8 COMMON

AVAILABLE PRIOR TO JANUARY 1962

BCD ARJTHMET IC CORRECT ION

0104

ARE CORRECTED AT ONCE. 22 StORAGE LOCN PLUS) COMMON.
MINIMUM TIMING 348 MleRDSEC MAXIMUM 396 MICROSEC.

NORMALIZE-D ADD-EXTENDED RANGE FLOATING BINARY ARITH.
TO AOD OR SUBTRACT TWO NUfofBERS EXPRESSED, [N EXTENDED
RANGE FLOATING BINARY. EACH NUMBER OCCUPIES 2 MEMORY
CELLS. 35 aiT FRACTION AND 35 BIT EXPONENT. 83 CEllS & 2
CELLS OF COMMON.

:E~~~~~ ~~~ ~~~~~~S o~o~~~~~g~ ~~D S~~!:~C!~~N S~: ~~~R!~~~~~

188

359ELS083

AVAILABLE PRIOR TO JANUARY 1962

BCO ADO-SUBTRACT
ADDS OR SUBTRACTS TWO SIGNED 12 DIGIT BCO NUMBERS. ADDS 6
DIGITS SIMULTANEOUSLY. USES ElSM02 TO RESTORE CORRECT BCD
FORM. 42 STORAGE lOCN PLUS 4 COMMON MINIMUM TIMING 1.6 MSEC,
MAXIMUM OVERALL 2.3 MSEC~

0704

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

SCOPE GRID PLOTTER
TO DISPLAY ON THE 740 OUTPUT RECOROER A GRID Of HORIZONTAL
AND VERTICAL LINES.
PROVISION IS MADE FOR PLOTTING CERTAIN
SPECIfIED LINES HEAVIER THAN OTHERS.
PROGRAM REQUIRES 51
weRDS STORAGE PLUS 2 TEMPORARY.

0104

3'59ElSM09

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

351MU~CI2

NCI2 FIXED POINT NEWTON-COTES QUADRATURE
APPROX[MATES THE VALUE OF AN INTeGRAL OF THE FORM ZY SQUARED
ox BETWEEN XSUB ZERO AND XSUB4.
THE VARIOUS VALUES fOR YARE
ASSUMED TO 8E LOCATED IN THE HEMORY.
Z IS TO BE SUPPLIED BY
AN AUXILIARY SUBROUTINE.
COHPUTATION IS DONE IN DOUBLE
PRECISION.
REQUIRES TWO AUXILIARY SUBROUTINES HU OPA2 AND
FACT.
OCCUPIES 17 STORAGE CEllS PLUS 10 TEMPORARY.
TIMING
IS ABOUT 4 MS PER INTEGRATION STEP.

.BH

LIBRARY

GENERAL SORT ROUTINE
1'0 SORT A TABLE IN WHICH THE UNIT RECORD IS LONGER THAN ONE
704 WORD. MASKS HAY BE USED TO SELECT THE BITS OF A RECORD
TO BE USED tN SORTING.

0104
0104 356

AROGRAM

BINARY TO PACKED BCD CONVERTER
CONVERTS STGNED BINARY INTEGERS IN CONSECUTIVE LOCATIONS TO
EQUIVALENT BCD NUMBERS ALSO IN CONSECUTIVE LOCATIONS. SIGNS
MAY BE IGNORED IF DESIRED.

0704
0704 356

0704

370Rso130

AVAILABLE fiRIOR TO JANUARY 1962

IBM
......................................................................................
070 1,

070~

PROGRAM

1I0RARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

310RS01~1

NOR,..ALllED MULT.--f:XTENDEO RANGE FLOATiNG BINARY ARITH.
TO ,..ULTIPLY TWO NU~BERS EXPRESSED IN [HENUEU RANGE
flOATING BINARY. EACH NUMllER OCCUPIES 2 I".[MORY CELLS,
3') All FRACTION AND 3:' BIT EXPONENT. 27 CEllS f. 2 CELLS
Of COr--,"lON.

AVAILABLE PJUOR TO JANUARY 1962

370~SOI12

0704

"lORI"ALtLEO DIVIDE-EXTENIJ[O RANGE flOATING BINARY ARITII.
TO DIVIDE TIoIO NUMB!::RS EXP~ESSED IN EXTENDED RANGE FLOATING
BINARY. tACH NUMBER OCCUPII::S TWO MEMORY CELLS, 35 BIT
FRACTION AND 35 BIT EJ(.PONENT. PROVIDES FOR ERROR RETURN IN
CASE CF A DI'IID( CHECK. 39 CELLS f. 2 Ct:.tLS OF Cm~MON.

0,04

AVAILABLE PRIOR TO JANUARY 1962

370RS0133

NOR!-AAL I lED LOG-EXTEND[D RANGE FLOAT ING BINARY AR I TH.
TG [VALUATF THE NATURAL LOGAR I THM OF A NUMBER EXPRESSED IN
EXTENDED RANGE FLOATING BINARY. NUMBER OCCUPIES 2 "10WRY
CElLS, )'j AIl FRACTION AND )5 BIT EXPONf:NT. ERROR Rt:TUR'"
PROV1CED. RSOI10 MUST BE IN MEMORY. 131. CELLS (. 6 CELLS
OF CCr-'~ON~ CORRI 5'34

IBM

0704

AVAILABLE PRIOR TO JANUARY 1962

370RS0134

NOIH'ALllHl E TO X-ExTENDED RA'J(;E FLOATING BINARY MITH.
TO t:.VALUATE THE EXPONENTIAL OF A NW\O[R EXPRESSED I!'.j EXTENfJED
RIH1GE FLOflTING BINARY. NUJ>'ElER OCCUPIES 2 1-'E~U~Y CELLS. )5 !:)IT
FRACTIOf'.l ANO 3~' BIT EXPONENT. PROVIDES FOR ERROR RETURN WHEN
OLT OF RANCE. 1~8 CULS f. 8 CEllS OF COMMOI\I.

0104

U704

0104

PROGRAI".

370RS0116

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1.962

NORMALIZED SQ. ROOT-EXTENDED RANGE flOATING BINARY ARtTH
TO EVALUATE THE SQUARE ROOT OF A NUMBlR EXPRESSED IN EXTENDED
RANGE FLOATING BINARY. NUI"SER OCCUPIES 2 MEMO~Y CEll!:., 35 BIT
FRACTION AND 35 I1IT EXPONENT. PROvIDES ERROR RETURN FOR
NEGATIVE ARGUf.'ENTS. 42 CELLS f. 5 CELLS OF COMMON.

070',

37QRS0139

AVAILABLE PRIOR TO JANUARY 1962

DECl~AL

PRINT-EXTENDED RANGE FLOATING BINARY ARITH.
TO PRINT ON-LI'~E UP TO 6 NUI-IBERS PER LINE, NUMBERS IN MEMORY
AS EXTENDED RANGE FLOATING BINARY. A 10 DIGIT FRACTION PLUS
SI~N AND A 3 DIGIT EXPONENT PLUS SIGN IS PRINTED. PROVIDES
FOR It.{)EXABLE MEt'WRY LOCATIONS. COMPUTING BEhEEN LINES. AND
ECHO CHECKING ~lTH OVER-PRINT ON FAILING COLUMNS. )56 CElLS ~
1,6 CELLS OF CO"'MON.

370RS0148

AVAILABLE PRIOR TO JANUARY 1962

FLOATING POINT f. FIXED POINT DECl~AL INPUT.
REACS UP TO FOUR DECIMt'tL NUMBERS PER CARD AND STORES THEM IN
CORt:. STORAGE AS EITIIER NOR."\ALllED FLOATING POINT OR. f-IXED
POINT ElINARY NUMBERS. ALLOWS FOR COMPUTING BETWEEN CARDS IF
DESIRED AND FC;1. ALTERING THE EFFECTIVE STORAGE LOCATION.
NURMAL TSX SEQUENCE WITH ONE CONTROL .... ORD, ERROR RETURN, AND
T .... O NGRMAL RETURNS DEPENDING UPON WHETHER THERE IS corl,PUTHIG
BElI-EEN CARDS. USES )50 STORAGE CELLS f. 41 COMMON.
PROGRA.'''' MADE 1,1010 BY RS 0046 OIST. 386

010~

372 BSCRB

373 BSRN

ABSTRACT

B - 704

AIJAILABLE PRIOR TO JAI\lUARY 1962

0704

374NA2710

AVAILABLE PRIOR TO JANUARY ,l'J62

STMWARlJ-TO-COLUMN BINARY CARD CONVERSION. ON-LINE
CONVERTS SHARI: STANDARD BINARY CARDS TU CULUMN BINARY CARDS.
NOT,.. SUBROUTINE.
134 LOCATIONS.

0701;

37'jUAUPE2

AVAILAf)U: PRIOR TO JANUARY 1962

UNi"ARtATE POLyr-.OMIAL EVALUATION
IF A FUNCTION HAS BUN APPROXIMATI:D BY A SEQUENCE OF ONE OR
MORE POLYNOMIAL ARCS. AND THE CUEFFICIENTS OF THESE SECTIONS
HAVE BEEN STORED IN CCRE, TH[S ROUTINE Idll SEflRCH OUT TH(
APPROPRIAT[ SECTION AND EVALUATE IT FOR TI-'E GIVEN VALUE OF X.
THE NUMBER OF SECTIONS IS NOT RESTRICTED, NOR MUST ALL OF THE
SECTIONS BE OF THE SA~E DEGREE.
CHANGES IN THE NUMBER OF
SECTICNS, OR IN THE DEGREE OF ANY SECTIONISI, CHANGE GJliLY THE
COEFFlCIENT STORAGE - CALLING SEQUE:NCE/SI BEING UNAFfECTED.
USES ~2 Cf:LlS PLUS 3 COl"MCN PLUS CUEFt-ICIENT STORAGE.

375UAUPE1

t'tVAIlABLE PRIOR TO JANUARY 1962

UNIVARIATE POLYJ\QMIAL EVALUATION FOR fORTRAN I PROGRAMS
BASICALLY, THIS ROUTINE IS UA UPE 2 MODIFIEO SO THAT IT CAN
BF. USED WITH SUCH FORTRAN I PROGRAI-',S AS REQUIRE UNIVARIATE
POLYNOMIAL INTERPOLATION.
THE FINAL RUNNING DECK IS MAO[ UP
OF THE FORTRAN I OBJECT PROGRAM, UA UPE 3 ITSlLF, AND A SAP
ASSEMBLY OF THE POLYNOMIAL COEFFICIENTS AND CERTAI"J OTHFR
FORTRAN SOURCE
AUXILIARY nATA, - ALL IN RHOCATA8lE BINARY.
LANGUflGE REFEREJIICES ARE OF THE FORP. SGMEF/N,XI W!-lE:RE N TELLS
Wt-'ICH FUNCTIOr-. IS TO BE It\TERPOLATED lAS MANY MAY Bl US[D A!!
hRE NI:.EDEO/. AND I( IS THE INDEPENDENT IJARIABLE.

0704

AVAILABLE PRIOR TO JANUARY 1962

COReIE, AUTOMATIC OPERATOR SYSTEM
REAUS SYMBOLIC CODE CAROS.
STORES CODES ON TAPe.
AUTCMtlTICALLY FINDS CODES ON TAPE AND CORRECTS THE"!
OR RUJ\S THE~.
PRINTS MONITORED RE30R4 2UT NO LISTING.
LIBRARY OF 'SUBROUTINES IS AVAILAOLE ON TAPE.
INCLUDES
NO PERIPHERAL TAPE EQUIPMENT IS USELJ.
SAP A!!SH'BLER.
SUITABLE FOR REMOTE USE OF COMPUTeR BY PROGRAMMERS.
CODE CHECKING fEATURES ARE INCLUDED.

176UAlO;U

AVAILABLE PRIOR TO JANUARY 1')62

~[LF-LOAOING

OQ.UN RESET P~OGRAM
RLSt:.TS O"l[ OR MDRI:: DRUMS TO PLUS ZEROES.
CONTROL PUNCHING
ONE
I'll 7R DFCREt-'ENT INDICATES WHICH DRUMS ARE TO fiE RESET.
SI:.LF-LOAOING URO.

I Pt-'.

0704

0104

PROGRA~'

31eCAOOI2

LIURARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

TRIPLE PRECISION ARITHMETIC PACKAGE
PERFORt-'.s BASIC ARITH~lTIC OPER .... TIONS ON TRIPL[ PRFCISION
FLOATING POINT NU"1BERS.
EACt! NU"lCER RtPRt~ENTF.O AS A SIG~~FO
70 BIT rRACTION ANO A SIGNED 15 BIT EXPONENT.
69 BIT~ OF
ACCURACY ~trH ROUNDING ARE RE:TAI,\tEIl.
USES 372 Ct:.LLS.

0104

378CA0025

AVAILABLE PRIOR TO JANUARY 1962

TRIPLE PRECISION OUTPUT
CONVERTS N TRIPLE PRECISION FLOATING BINARY NUMBERS TO
HCD LINE l~IIGE rORr~ WITH) FLOATING UI::CIMAL
Nt,;MBERS PER LINE. PROGRAr-'MER MU~T PRDVID( OWN
BCD TAPE IIRITING ROUTINE.USED WITH CAOl2 TRIPLE PRECISION
PACKAGE ExTENT 108 WORDS PlUS 2 COMMON.

0704
0704

LIBRAtlY

AVAlLflALE PRIOR TO JANUARY 1962

370fl.SOl)~

NCRtJALll['D ARCTAN-EXTENIlED RANGE fLOATING tllNARY A~lTH.
TO EVALUATE THE ARCTANGENT OF A NUMBER EXPRESSEll ll\l EXTENDf:O
RAI'iGE flOATING BINARY. NUMBER OCCUPIES 2 MEMORY CELLS. 15 I3IT
FRACTION AND )5 BIT EXPONENT. RS0130 MUST tiE IN MEMURY. 295
CELLS r. 2 CLLLS Of em-'MON.

IBM

PRCGRAr-!

FIXED POINT PSEUDO RANDOM NUMBER GENERATOR

07011
070'1

070'.

381ASA550

t'tIJAILABLt PRIOR TO JMJut'tRY 1962

T~O CARD BINARY ANI)' OCTAL LOADER
LOADS ABSOLUTE BINARY AND OCTAL CARDS IN ANY ORDER. EXE~UTES
TRANSFER CARDS. THE PUNCH TO IGNORE BINARY CHECK SUMS liS
RECCGJ\llEO. UP TO FOUR OCTAL WORDS, WITH THEIR LOCATIONS. PER
CARD.

0704

381ASAS5:'

AVAILABLE PRIOR TO JANUARY 1962

VARIABLE FIxEO FORYAT CARO READ
REACS CARDS, WITH FORMAT AND LOCATIONS FIXED BY TH£;' CALLING
S[QUENCE, AT FULL CARO REIIDfR SPEED. FIXED Ot:.CIMAL,', FLOATING
DECIMAL. AND HOLLERITH WILL BE CONVERTED. CORR. I ',31

010'+

)82GSTOP

AIJAILABLE PRIOR TO Jt'tNUARY 1962

TAPE GPERATOR PROGRAM ITOPI
TOP IS A SfLF-CONTAINI:O PROGRAM THAT AUTOMATICALLY SECU[NCES
A SET OF COMPLETELY INDEPENDENT CAL~ULATIONS. THE PROGRAMS

~~ ~~ ~ ~ ~ ~ O~

~~ ~ ~~ ~ ~t~ ~: ~ ~ ~~ ~ A~ ~ ~ ~~~~ ~N ~ ~t~ ~ ~~ ~~~A ~~

0; R
A
U
E/O E
N
L FPHOGRAMS,OR FROM BINARY CARDS. OR CHINfrSf: BINMY TAPE. THE
INPUT DATA FOR THE CALCULATIONS ANO THE CI-'INESE BI'\lARY
PROGRAMS,tF ANY,ARE ENTER EO ON THE INPUT TAPE. TOP INSPECT!!
THE II-lPUT FILE TO DETERMINE THE PROGRA."\ REQUIREO,LOCATES THIS
PROGRAM AND INITIATES A SELF-LOADING SEQUENCE FOR THE PROGRAM

189

IBM

0704

0704

PROGRAM

LIBRARY

ABSTRACT

36513SCONV

AVAILAOLE PRIOR TO JANUARY 1962

DOUBLE PRE( I S I ON FlOA TI NG PO INT l DAD SUBROUTINE
REAOS RCD DOUBLE PRECISION NU~BERS FROM CARDS AND CONVERTS
nIH' TO BINARY, STORING EACH NUHBER IN 3 CONSECUTIV( CORE
LOCATIONS. USES UA CSII2. REQUIRES 211 STORAGE PLUS
26 COfJMON CEllS.

0704

38'5BSEXP

AVAILABLE PRIOR TO JANUARY 1962

INTERPRETABLE DOUBLE PREC lS-fON EXPONENTIAL INSTRUCTION
USED ~Y GIVING PSEUDO-t~TRUCTlOfli WHILE IN THE· INTERPRETIVE
MOllE OF BS INTP.
EXPONENTIAl IS ACCURATE TO 18 DECIMAL
PLACES. USES 8S INTP..
REQUIRES 81 STORAGE PLUS
2/1 CO,..MON CELLS.

0704

"l858S INTP

18'"

0704

385aSLNX

LIBRARY

"390p.1

'.17PFCSFI

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

lJOUBLE PRECI.SION MATRIX INVERSION
F LOA TI NG POI NT I NVERS I ON AND SOLUT ION OF LI NE AR
S'IISTEMS. INr:UT.OUTPUT BY TAPE. THE ORDRE OF THE
MATRIX IS ILLIMITED .. THE ROUTINE WORKS ALSO
IN SINGLE PRECISION.
OCCUPIES 311 STORAGE CEtLSa

DGUI:lLE PRECISION SIGN COMPATIBlllTY
GRANT::, IDENTICAL SIGNS TO 2 PORTIONS OF
A flOATING POINT DOUBLE PRECISION NUMBER
OCCUPIES 47 STORAGE CEllS.

0104

HYP[IHlOllC SINE AND COSINE,FLOATING POINT..
OCCL.:PIES 11 STORAGE CELLS

0104
4QSPFMVP1

AVAILABLE PRIOR TO JANUARY 1962

EIGENVALUE COMPUT ATI ON.
DETERI'INATION OF THE M LARGEST EIGENVALUES OF AN
M.. ORDRE MATRIX AND OF THE CORRESPONDING
EIGENVECTORS .. ITERATIVE METHOD ..
OCCUPIES 956 CELLS&VARIAALE BLOC.

0104

405PFPFOl

AVAILABLE PRIOR TO JANUARY 1962

BINARY PUNCH PROGRAM
PUNCHING INTO ABSOLUTE DINARY CARDS THt CONTENTS
OF SEVERAL STORAGE BLOCKS. SELF-LOADING ..
OCCUPIES CELLS 24 THRU 59 ..

0101+

4Q5PFSMLG

AVAILABLE PRIOR TO JANUARY 1962

070"

'd 7PFCSH 1

417PFDCRl

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

ALPI-"ANUME'RICAL READING AND BCD CONVERSION
REACING OF 12 .. COLUMN CARDS ALPHANUMERICAllY PUNCHEO
AND CONVERS [ON INTO 12 WORDS BCD.
OCCUPIES 112 STORAGE CEllS ..

0704

417PFSACI

AVAILABLE PRIOR TO JANUARY 1962

flOATING POINT COMPLEX ARITHMETICS ..
EXECUTION OF MACHINE OPERATIONS 0,\1. COMPLEX NUMBERS
BY A PROGRAM wRITTEN IN ORDARY MACHINE LANGUAGE ..
OCCUPIES 328 STORAGE CELLS.

CHECKSUM CORRECTOR
SElFlOADING ONE-CARD PUNCHING PROGRAM ..
0704

0704

405PFlPC 1

AVAILABLE PRIOR TO JANUARY 1962

ZEROS OF A COMPLEX POLYNOMIAL
SINGLE PRECISION FLOATING POINT COMPUTATION OF A
POLYNOMIAL WITH COMPLEX COEFFICIENTS.
OCCUP I ES 765 STORAGE CtlLSa

0704

0704

405PFlPRl

AVAILABLE PRIOR TO JANUARY 1962

ZEROS OF A REAL POLYNOMIAL.
SINGLE PRECISION FLOATING POINT COMPUTATION OF A
POLYNOMIAL ~ITH REAL COEFFICIENTS
OCCUPIES 765 STORAGE CEllS.

417PFSOPl

AVAILABLE PRIOR TO JANUARY 1962.

FLOATING POINT DOUBLE PRECISION ARITHMET1CS ..
EXECUTION OF !-lACHINE OPt:RATtONS O~ DOUI:lLE PRECISION
NUMBERS BY 1\ PROGRAM WRITTEN IN ORDINARY LANGUAGE
OCCUPIES 326 STORAGE CELLS ..

417PFZPQI

AVAILABLE PRIOR TO JANUARY 1962

GENE:RAL POLYNOMIAL PROGRAM
COMPUTATION OF lEROS OF A POLYNOMIAL WITH
REAL OR COMPLEX COEFFICIENTS.SElF-LOAOlr-.G.
METHOD OF NEWTON ..

191

IlW

P704

0704

PROGRAM

lIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

420CSO$01

DUMP STORAGE, CORE. DRUM, AND TAPES
ndS IS A MODIFICATION OF NO DS1 w&IC& WILL DUMP CORES, DRUMS
I\ND TAPES, NOT REQUIRING THE USE OF 1\ LOGICAL DRUM FOR SAVING
THE FIRST 2048 hORDS OF CORE MENOROC A MAGNETIC TAPE /lOGICAL
1 Te 81 I,S USED FOR SAVING INSTEAD. THE SAME SENSE OPTION AS
NYOS1 IS USED TO SELECT THE TAP~. WITH CS DSl IT IS POSSIDLE
TO DU"P ALL OF CORE AND ALL OF LJRUM MEMORY WITH ONE PASS ON
THE MACHINE. SELF LOADING &INARY DECK. REQUIRES MINIMUM 704 &
711 CARD REflDER, 727 TAPE AND 716 PRINTER OR AN ADDITIONAL
1'l.7 TAPE.
SUPERSEDED BY CS-DS2 DIST. 496.

·············It······. ············· ...............................
IBM

070-4

AVAILABLE PRIOR TO JANUARY 1962

-421AAANVA

ANALYSIS OF VARIANCE
COMPUTES />'EANS,SUMS OF SQUARES,DEGREES OF FREEI10M AND F
FI\CTOn. FOR UP TO 13 WAY_ ANALYSIS. ANY NUMBER OF VARIABLES
PER WHY AN[) ANY AMOUNT OF- DATA MAY BE USED.

AVAILABLE PRIOR TO JANUARY 1962

'.22NOPCUT

POPOUT-A GENERAL PURPOSE PRINT AND PUNCH SUBROUTINE
THIS SUBROUTINE IS II MODI.FICATJON OF GLDUT-2 CAPABLE OF
PERIPHERIIL ANDIOR ON-LINE PRINTING ANDIOR PUNCHING OF UP
TO 120 CHARACTERS. OTHER OIFFERENCES WITH GLOUT-2 ARE--1. eN-LINE PRINTING IS NOT ECHO CHECKED.
2. TAPE WRITING IS NOT CHECKED BY RE-REAOING.
3. LOCATIONS OF CALL SEQUENCE ERRORS ARE NOT PRINTED.
4. THE END-OF-TAPE TEST IS MAD~.
THE SLBROUTlNE USES 347 INSTRUCTION CElLS & 51 ERASABLE CEllS

AVAILABLE PRIOR TO JANUARY 1962

423BSIITN

DOUBLE PRECISION ARC TANGENT INSTRUCTION
cm'~PUTES DOU~LE PRECISION ARC TANGENT OF A DOUBLE
PI{ECISION ARGUMENT, AS DESCRIBED IN BS tNTP.
REQUIRES 8S INTP AND 25 COMMON STORAGES.
BS AT/'; REQUIRES 73 STORAGE LOCATIONS.

0704

AVAILABLE PRIOR TO JANUARY 1962

423BSDCHl

BCD TO BINARY CONVERSION OF UNRESTRICTED INTEGERS ..
CONVERTS A BCD INTEGER OF 6 OR 12 CHARACTERS TO A
BINARY INTEGER. ASSUMES THAT SIGN IS IN FIRST BIT
POSITION OR OVERPUNCH OVER LEFTMOST POSITION.
RANGE IS -3'.,359,738.367 TO t:34,359,738,367. USES 63
STORAGE CEllS PLUS 4 COMMON.
I.6M

0704

PROGRAM

LIBRARY

1,23BSFREl

423BSGC I

423BSHQI

AVAILABLE PR lOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

INHGRATION BY HERMITE QUADRATURE
HH~GRATES FROM MINUS INFINITY TO PLUS INFINITY BY
3.4 ••••• 10.15. OR 20 POINT QUADRATURE. REQUIRES 192 STORAGE.

0704

424ANE201

AVAILABLE PRIOR TO JANUARY 1962

CARC TO TAPE, fl INARY
IS A ~ElF-LOADER TO WRITE ONE BINARY FILE ON TAPE 1 FfWM
NON-RELUCATABLE BINAR);,,,.-C.AROS. ~ITH we TSB2 ICF.I IT CONVERTS
It. PROGRAM FRO~ CARDS TO TAPE IAlSO READ BY WB RWT4/.
LOCATIONS A THRU B INTO WI-'I>'ON-ME THOD OF CONGrtUENCES

0704

432~UMMH

AVAILABLE PRIOR TO JANUARY 1962

MURA ~ATRIX MULTIPLY IFLOATING POINTI
MULTIPLIES AN MXN MATRIX BY AN NXC MATRIX TO GIVE AN MXQ
MATRIX.
THE ELEMENTS OF EACH MARTIX ARE SEQUENTIAllY LOCATED
BY ROilS.
REQUIRES 88 WORDS PROGRAM PLUS 7 TEMPORARY.

0704

432MUMASI

AVAILABLE PRIOR TO JANUARY 1962

"IURA MATRIX ADD OR SUBTRACT. FIXED POINT
GIVEN MATRIX A, ADO TO OR SUBTRACT FROM IT MATRIX B, IN FIXED
POINT ARITHMETIC. RESULTING IN MATRIX C..
OCCUPIES 30 WORDS
OF STORAGE.

10M

0704

0704

PROGRAM

LIBRARY

fiBS-TRACT

Ifl~

B - 704

AVAILABLE PRIOR TO JANUARY 1962

445PEPARD

AVAILABLE PRIOR TO JANUARY 1962

DIFFERENTIATION AND PARTIAL DIFFER. OF RATIONAL FUNCT ..
fO OPERATE ON AN EXISTING PROGRAM FOR A FUNCTION IN CORE
STORAGE AND GENERATE THE OERIVATIVE OF THE FUNCTION ..

070',
AVAILABLE PRIOR TO JANUARY 1962

432MUR104

MURA REFLECTED 704
CAUSES THE 704 TO BEHAVE LlKE A 401 IN ITS ROLE AS A READER
AND PRINTER OF CARDS..
50 WORDS PROGRAM PLUS 24 WORDS FOR
LOWER BINARY LOADER.
REACER A"lO PRINTER OPERATE AT FULL
SPEED ..
SUPERSEDES MU 104R D.IST. 253 ..

446PECSMO

AVAILABLE PRIOR TO JANUARY 1962

GENERAL CARO LOADER SUB ROUT INE GROUP
TO REAO AND TRANSLATE HOllERITH DATA PUNCHED ON CARDS.
EITHER ON Uf'.;E OR FROM BCD TAPE PREVIOUSLY PREPARED BY THE
CARO-TO-TAPE UNIT, IN A VARIABLE FORMAT CONVERTING HOLLERITH
TO BCD, OCTAL INTEGERS 10 BINARY INTEGERS, FIXED DECIMAL
TO FLOATING BINARY, AND FIXED DECIMAL TO FIXED BINARY ..

0104

449Mt.9SIM

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

432MUSCOI

SCOPE GRID PLOTTER
TO DISPLAY ON THE 740 OUTPUT RECORDER A GRID OF HORIZONTAL
AND VERTICAL LINES ..
PROVISION IS MADE FOR PLOTTING CERTAIN
SPECIFIED LINES HEAVIER THAN OTHERS.
PROGRAM REQUIRES 53
WORDS STORAGE PLUS 2 TEMPORARY.

LOADS BINARY ABSOLUTE, CORRECTION AND TRANSFER
CARDS-SIMULATES 109 EXECUTION OF PROGRAM .. BY MEANS OF CONTROL
CARDS, LOGICAL TRACE IS AVAILABLE. BY HEANS OF CALL CARD,
MEMORY DUMP IS AVAILABLE. CaRR/ 471

0704
0701t

ABSTRACT

AVAILABLE PRIOR TO JANUARY }962

432~URI\Ll

MURA UPPER RELOCATABLE BINARY LOADER lONE CAROl
LOADS STANDARD RELOCATABLE BINARY CARDS WItHOUT ALTERATION OF
LOADING ADDRESSES.
EXECUTES TRANSFER CARDS..
OCCUPIES LAST
22 "OROS OF MEMORY.
SELF LOADING.

0704

LIBRARY

!H:SI::T AND CLEAR CORE AND r~ LOGICAL DRUMS
O"lt CARD SELF LOADING PR0\:iRAM TO CLEAR CONSECUTIVE LQGICAL
DfWtJS, CORES. AC, Me, AND ALL INDEX REGISTERS .. 10 RESET
TRAP, CHECK, DIVIDE CHECK, AC OVERflOW, MQ OVERFLOW AND All
SENSE LIGHTS [JEFORE LOADIt-;G IN NEXT CARD. CORR! 461

0104

0704

PROGRAM

AVAILABLE PRIOR TO JANUARY 1962

~32MUMTRI

SQUARE MATRIX TltANSPOSE ON ITSELF
TO SUPPLY THE TRANSPOSE OF II MATRIX STORED ROW-WISE IN CORE
STORAGE AND PLACE: IN THE SAME LOCATIONS AS HIE ORIGINAL
MATRIX..
PROGRAM REQUIRES 33 rJOROS PLUS 4 TEMPORARY..
AN 80
BY BO MATRIX 15 TRANSPOSEC IN LESS THAN 800 MICROSECONDS.
CORRI 472

0704

0704

43"JMCI nn

AVAILABLE PRIOR TO JANUARY 1962

I fERATION t ONE OR TWO VARlAALES
GIVEN X-FIX.YI, Y-G/X,Y/, TO FINO A VALUE FOR X ANO '1'
WITHIN A GIVEN EPSILON OF RELATIVE ERROR ..
REQUIRES 265 WORDS PLUS 36 ERASABLE STORAGES .. CORR. 1442

450RWDE2F

AVAILABLE PRIOR TO JANUARY 1962

FLOATING POINT ADAMS-MOULTON. RUNGE-KUTTA INTEGRATION
INTEGRATES A SYSTEM OF N SlMULTANI::OLis. FIRST ORDER, ORDINARY
DIFFERENTIAL EQUATIONS. OPTION OF USING EITHER 4TH ORDER
RUNGE-KUTTA METHOD OR 4TH ORDER PREDICTOR-CORRECTOR METHOD
IADAMS-MOULTON! IS PROVIDED. ALSO OPTION OF AUTOMATIC ERROR
CONTROL WITH V~RIABLE STEP-SIZE IS PROVIOED .. INPUT AND OUTPUT ARE SINGLE PRECISION BUT DOUBLE PRECISION [S USED INTERNAllY TO CONTROL ROUND-OFF ERRORS .. REQUIRES 12N & 3 CELLS
FOR DATA AND 610 WOROS FOR PROGRAM ..

..................................................................
IBM

0704

0704

PROGRAM

435MA'CEQ

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

nETERMINANT EXPANSION
THIS ROUTINE CALCULATES H-E CHARACTERISTIC EQUATION OF M OF
THE DETERMINANT Mt.1 lAMBDA.
REQUIRES 390 WORDS OF STORAGE £.
COIIMON THRU COMMON r. 2N r. 9 WHERE N--ORDER OF THE MATRIX
CORRI 1024

IBM

010 fl
0704

435MAMHIo!

AVAILABLE PRIOR TO JANUARY 1962

MATRIX MULTIPLICATION
MULTIPLIES TWO MATRICIES OF THE fORM A X B - C IN FLOATING
POINT ARITHMETIC REQUIRES 77 WORDS OF STORAGE

0704

435MA.POLM

AVAILABLE PRIOR TO JANUARY 1962

POLYNOMI AL E-XPANS ION
COMPUTES THE POLYNOMIAL RESULTING FROM THE MULTIPLICATION OF
LINEAR AND QUADRATIC FACT'ORS9 REQUIRES 139 WORDS OF STORAGE
PLUS 62 WORDS OF COMMON STORAGE

0704

43bAAATM2

AVAILABLE PRIOR TO JANUARY 1962

ATMOSPHERIC DATA SUBROUTINE
GIVEN A GEOfolETRIC ALTITUDE H IN THE RANGE 0 TO 295,000 FEET,
COMPUTE THE FOllOWING -UANTITIES - 1 TEMPERATURE liN DEGREES
RANKINE/. 2 DENSITY RATIO. '3 PRESSURE RATIO .. 4 VELOCITY OF
SOUND IFT .. /SEC .. I .. ROUTINE REQUIRES 158 CELLS PLUS COMMON
STORAGE AS NEEDED FOR S-RT SUBROUTINE.

0704

439NA0290

AVAILABLE PRIOR TO JANUARY 1962

GENERAL CATHODE RAY TUBE COUPLE SUBROUTINE ..
THIS SUBRCUl'INE WILL DRAW A SUB-DIVIDED GRID,WRITE A TITLE A
TOP OF GRID,WRITE A LABEL AND APPROPRIATE SCALE LABELS,AND PL
OT POINTS,OR SYMBOLS fOR POINTS ON THE: 740 CRT OUTPUT RECORD

ER.

0704 441

CSTYD

AVAILABLE PRIOR TO JANUARY 1962

PROGRAM

450RW0E3F

LIBRARY

AilS TRACT

AVAILABLE PRIOR TO JANUARY 1962

FLOAT .. PT. MILNE. RUNGE-KUTTA INHGRAT. OF 2ND ORO. EQ.
INTEGRATES A SYSTEM OF N SIHULTAN[OUS, SECOND ORDER, ORDINARY
DIFFERENTIAL EQUATIONS WITH MISSING FIRST DERIVATIVES .. OPTION
OF USING EI1'HER 4TH ORDER RUNGE KUTTA METHOt) OR 5TH ORDER
'-IIlN!: METHOD IS PROVIDED .. ALSO OPTION OF AUTOMATIC ERROR CONTROL \! A PERSONNEL MASTER FILE THE DATA NECESSARY TO RUN A
PAYROLL.
USES 93 WORDS OF STORAGE AND 1 WORD OF COMMON.

0104
0104

578RWND2X

NORMALLY DISTRIBUTED PSEUDO-RANDOM NUMBERS.
EACH ENTRANCE PROOUC.ES THE NEXT NUMBER lIN FIXED POINT!
IN A RANDOM SEQUENCE OF PSEUDO-NORMALLY DISTRIBUTED
NUMBERS WITH ZERO MEAN AND UNIT STANDARD DEVIATION.
REQUIRES 22 CelLS AND 2.9,76 MILLISECONDS.

592NUMLEV

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

AUTO- AND CROSS-CORRELATION FUNCTION GENERATOR.FLOATlNG
TO COIJPUTE ONE POINT OF E[THER THE AUTO- OR CROSS-CORRELATION
FUNCTION" GIVEN A SET OF TlME-SERIES DATA FOR EQUALLY-SPACED
POINTS. 29 LOC .. f. 6 ERASABLE.

FORTRAN 2 EIGENVALUE-EIGENVECTOR SUBPROGRAM ..
THIS PROGRAM IS A REVISION OF NU-MLEV FOR USE WITH FORTRAN 2 ..
IT CO~PUTES THE EIGENVALUES AND VECTORS OF A REAL SYMMETRIC
MATRIX BY THE GIVENf., .METHOD. CORR .. /7aO

199

IBM

0704

0704

PROGRAM

LIBRARY

593GITRAP

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

TRAP TRACE, G I TRAP.
CONVERTS TO OCTAL AND I'IIRIlES CONTENTS OF ACCUMULATOR, MCI.
OP ellS, INDEX REGISTERS, LOCATION, AND INSTRUCTION FOR EVERY
REQUIRES 94
EXECUTABLE TRANSFER WHILE IN TRAPPING MODE.
LOCATIONS PLUS 22 WORKING STORAGE.
TIMING IS 21.25 MS PER
TRANSFF.R.

0704

595ER5NAP

AVAILABLE PRIOR TO JANUARY 1962

FORTRAN SNAP SHOT ROUTINE.
TO TAKE SNAP SHOTS AT THE PREDETEMINEND PLACES IN A FORTRAN
PROGRAM.

0704

598WHOQ54

AVAILABLE PRIOR TO JANUARY 1962

704 ARCTAN AlB
COMPUTES FLOATING ARCTAN OF QUOTIENT OF 2 flOATING POINT
NUMBERS WITH PROPER QUADRANT AllOCAflON IN RANGE -PI TO Pl.
REQUIRES ARCTANGENT SUBROUTINE. USES 36 STORAGE CEllS &.1
CO/o'MON. SUPERSEDES WC03T DISTC 057.

IBM

0704

601WHSMT

AVA1LABLE PRIOR TO JANUARY 1962

704 SELECTIVE MONITOR TRACE.
PROVIDES DETAILED TRACE OF EVERY INSTRUCTION,/2I TRAP TRACE
OF TRANSFER INSTRUCTIONS, 131 TRACE OF STORE INSTRUCTIONS
ONLY, OR 14/ ANY COMBINATION OF THESE MODES - UNDER CARD CDNTHOL wITH SENSE SWITCH OPTION TO PRINT. USER MAY ELECT TO
HAVE I/O SelECT INSTRUCTIONS CAUSE EXIT FROM TRACING MODE, OR
TO CONTINUE TRACING WITH 110 OPS INEFFECTIVE. AC AND MQ CONTENTS PRINTEIJ IN OCTAL AND flOATING OECIMAL. REDUNDANT INFO
SL;PPRESSED. DN-LIN[ PRINT ONLY - WITH SPECIAL PRINTER BOARD.
1040£. STORAGE CELLS, RHOCATABLE.

0704

6031oH0055

AVAILABLE PRIOR TO JANUARY 1962

ARCTAN AlB, FORTRAN II VERSIONTSAP COOED.
FUNCTION SUBROUTINE FOR FORTRAN II LIBRARY. COMPUTES FL.POINT
ARTNF/A,B/ IN RANGE -PI TO I:PI. USES IBATNl. REQUIRES 117
STORAGE CEllS [,3 (-MM-NC

IflM

0704

PROGRAM

LIBRARY

ABSTRACT

PROGRAM

LIBRARY

6l4NUUDPI

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

UNNORMALIZED DOUBLE-PRECISION ARITHMETIC PACKAGE 1.
PERfORMS BAS J C AR I ~HMET IC OPERAT IONS wITH ACCURACY IND ICA TI ON
ON DOUBLE-PRECISION flOATING POINT NUMBERS.
THE ACCURACY
IS CARRIED BY ALLOWING lEROS TO ACCUMULATE IN THE FRACTIONAL
PART, I.E. IF THERE ARE N LEADING BINARY lEROS IN THE
FRACTIONAL PART, ONLY THE REMAINING 154-NI BITS CAN
REASONABL Y BE EXPECTED TO BE ACCURATE.
IN ORDER TO PERFORM
THE OPERATION H, THE INSTRUCTION, TSX UDPI&.M.4, MUST BE
GIVEN.
MAXI.MUM ACCURACY IS 54 BITS.
USES 364 STORAGE CEllS
&. 10 COMMON ...

0704

614NUUDP2

AVAILABLE PRIOR TO JANUARY 1962

Uf\NORMALIIED DOUBLE-PRECISION ARITHMETIC PACKAGE 2.
THIS CODE IS A MODIFICATION OF UDPI.
IT HAS BEEN MADE TO
MIMIC CA 001 IN All ESSENTIALS EXCEPT THAT IT CARRIES AN
ACCURACY INDICATION.
IT MAY BE USED IN PlACE OF eA 001 AS
A TEST ON THE ACCURACY OF THE NUMBERS COMPUTED WITH CA 001.
USES 341 STORAGE CEllS r. 8 COMMON.

0704
0704

0704

b1.7CA021A

AVAILABLE PRIOR TO JANUARY 1962

lEAST SQUARES POLYNOMIAL APPROXIMATION.
DOUBLE PRECI.SION LEAST SQUARES POLYNOMIAL APPROXIMATION
Y ECUALS FIXI OF DEGREE M THE SOLUTION OF N SETS OF POINTS
TO SPECIFIED DEGREE M TO BE THE BEST POSSIBLE FIT TO ALL
THE POINTS tN THE LEAST SQUARES SENSE.
REQUIRES 644 CELLS
PLUS 8 C01':MON.

0704

620CF0096

AVAILABLE PRIOR TO JANUARY 1962

GENERAL lIEO, PACKAGED r OFF-LI NE INPUT-OUTPU r SUBROUTINE
ACCEPTS VARtABLE FIELD INPUT DATA FROM A BCD TAPE. CONVERTS
F I XED-IO-F IXED,FIXED-TO-FlOATING,OR HOATING-TO-FLOAT ING.
VARIABLE FORMAT OUTPUT MAY BE ON-LINE OR OFF-LINE. CONVERTS
F !XED-TD-F IXEO ,flOAT ING-TO-F UEO, FLOAT ING-TO-FLOATlNG,
BCD-TO-BCD,OR OCTAL-TO-OCTAl. PRINTS PAGE IDENTIFICATION
AND HEADtNGS WITH AUTOMATIC PAGE OVERflOW.
REQUIRES 1033 CElLS r. 181 COMMON.

IBM

0704

PROGRAM

LIBRARY

ABSTRACT

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . lI • • • • • • • • • • • • • • • • • • • • • • • • • • • • • •

0704

60'fTVSPRA

AVAILABLE PRIOR TO JANUARY 1962

0704

AVAILABLE PRIOR TO JANUARY 1962

ABSOLUTE AND RElOCArAALE OCTAL LOADER.
LOADS ABSOLUTE AND RElOCATABLE OCTAL CORRECTION CARDS.
MODIFIES THE FORTRAN II ass LOADER.

0704

0704

609CA0034

AVAILABLE PRlOR TO JANUARY 1962

EXTENDED RANGE COMPLEX ARITHMETIC PACKAGE
PACKAGE CONTAI:.tS SUBROUTINES TO AOOT SUB, MPY, DIV, AND TAKE
SQRT OF EXTENDED RANGE COMPLEX NRS.
ALSO MULTIPLIES AND
DIVID[S EXT RANGE COMPLEX NRS BO EXT RANGE REAL NRS.
EXT 230
CElLS I: 8 COf-lt-'ON.

610RWOE2G

6IORWDE1G

0704

611AVPOll

630WBHEX

AVAILABLE PRIOR TO JANUARY 1962

HASTY EXPONENTIAL. flOATING POINT
COMPUTES E TO THE MINUS ABSOLUTE X TO FOUR SIGNIFICANT DIGITS
IN APPROXIMATELY .95 MILLISECONDS IF X IS LESS THAN B8.028 IN
MAGNITUDE, RETURNS WITH ZERO IN .120 MILLISECONDS OTHERWISE.
RETURN IS 1,4. 20 INSTRUCTIONS PLUS 67 CONSTANTS FOR A TOTAL
OF 87 LOCATIONS PLUS 2 ERASABLES DEFINED AS COMMON AND
C01"MON£.1.

AVAILABLE PRIOR TO JANUARY 1962

DeL. PREC. FLOATING PT. MILNE, RUNGE-KUTTA INTEGRATIONOF SECOND ORDER ECUATlONS. DOUBLE PRECISION VERSION OF
R>'IIOE3F. IJIoTEGRATES A SYSTEM OF N SIMULTANEOUS SECOND
ORU!:R, ORDINARY DIFFEr-ENTIAL EQUATIONS WITH MISSING
FIRST DERIVATIVES. OPTIOfll OF USING EITHER 4TH ORDER
RUNGI;-KUTTA MOHon OR 5TH ORDER MILNE METHOD IS
PROv-.'CED .. ALSO OPTION OF AUTOMATIC ERROR CONTROL WITH
VARIABLE, STEP-SIZE IS PROViDED. REQUIRES 26N &. 5 CElLS
FOR 'DATA AND 856 WORns FOR PROGRAM.

0704

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

OBL. PREC. flOATING PT. RUNGE-KUTTA INTEGRATION OFSECOND ORDER EQUATIONS. DOUBLE PRECISION VERSION OF
R~Dt::2F. INTEGRATES A SYSTEM OF N SIMULTANEOUS, FIRST
ORDER, ORDINARY DIFFERENTIAL EQUATIONS. REQUIRES 12N £. 5
CElLS FOR DATA AND 255 WORDS FOR PROGRAM.

0704

624RWDL2F

flOATING POINT DEFINITE INTEGRAL EVALUATION
TO EVALUATE A DEFINITE INTEGRAL GIVEN THE TABULAR
FUNCTION Y/X/. SINGLE PRECISION FLOATING POINT
ARITHMETIC IS USED ..

0704
0704

AVAILABLE PRIOR TO JANUARY 1962

POLYNOMIAl EXPANSION SUBROUTINE.
COMPUTES THE POLYNOMIAL ItESULTING FROM THE
MULTIPLICATLON OF ANY NUMBER OF POLYNOMIALS OF VARYING
DEGREES. REQUIRES 108 WORDS OF STORAGE

200

623ElROll

SIML:LATEO PLAI\T RECORD AUXILIARY.
TO "RITE IOWA TABLES ON BINARY TAPE.
UNKNOI-oN CONTINOUS DISTRIBUTIONS THIS PROGRAM

634TVFNSH

AVAILABLE PRIOR TO JANUARY 1962

FOR TRAN-TO-SHARE
TO CRE . . . TE SHME SYMBOLIC PROGRAM FROM TAPE 2 OUTPUT OF
FORTRAN I COMPILATION

0704

635RWOET

AVAILABLE PRIOR TO JANUARY 1962

DETERMINANT EVALUATOR FORTRAN SUBROUTINE ..
Tt-!IS FORTRAN SUBPROGRAM EVALUATES THE DETERMINANT OF A
MATRIX A-ALPHA TIMES I WHERE A IS OF DIMENSION N TIMES
N AND ALPHA IS A SCALAR. IT HAS A DIMENSION STATEMENT
A/50,50/ WHICH CAN BE CHANGED ACCORDING TO NEEDS OF THE
PROGRA~MER. INPUT MATRIX A IS DESTROYED IN COMPUTATION.
237 CELLS EXCLUDING ARRAY A ARE REQUIRED.

.................................................................
IBM

07011

0104

PROGRAM

L1DRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

635RWDETN

DETERMINANT EVALUATOR fOR NEARLY TRIANGULAR MATRICES
THIS fORTRI\N SUBPROGRAM EVALUATES THE DETERMINANT Of
A MATRIX A-ALPHA TIMES I \ljHERE A 15 A NEARLY TRIANGULAR
MATRIX OF DIMENSION N TIMES N AND ALP~A IS A SCALARa
IT HAS A DTMENSION STATEME,"H OF A/50,50/ AND 8/501
WHICH CAN fiE CHANGED ACCORDING TO NEEDS Of THE PROGRAMM[R. INPUT MATRIX A IS NOT DESTROYED BY THE PROGRAM a
216 CHLS EXCLUDING ARRAYS A AND·8 ARE RECUIREDa

070t;

AVAILABLE PRIOR TO JANUARY 1962

635RWEIGN

REAL EIGENVALUES Of REAL HATRICES
THIS fORTRAN SUhPROGRAM DETERMINES THE N REAL [lGENVALUES OF A REAL MATRIX A. IT HAS A DIMENSION STATEMENT
Of A/50.501. 0/501 AND CI501 AND USES THE COMMON REGION
J,NPUT MATRiX A IS OESTROYED DY THE COMPUTATION. THE
PROGRAM REQUIRES 3 SUBSIDIARY SUBROUTINES IN ADDITION
TO THE PROGRA~S WHICH WRITE OUTPUT ON TAPE. THE PROGRAM
nECK FOR EIGN ALREADY INCLUDES THE 3 SUBSIDIARIES. CDRR./684

0704

AVAILAt:lLE PRIOR TO JANUARY 1962

61SRWGLSQ

GENERAL LEAST SQUARES FORTRAN SUBPROGRAM.
GIVES THE LEAST SQUARES SCLUTION TO A SYSTEM OF OVERDLTERMINEO LINEAR EQUATIONS BX EQUALS C WHERE B IS AN
N T1M(5 M MHRJX WITH N GREATER TI-'AN, OR EQUAL TO M
AND C A COLUMN VECTOR OF DIMENSION N. IT "'AS A DIMENSION STATEMENT A/50,251 X/2S1 AND Il/251 WHICH C.M~ BE
CHANGED TO NEEDS OF THE PROGRAMMER. INPUT DATA IS DESTROYED DURING COMPUTATION. REQUIRES 341 CELLS EXCLUDING
ARRAYS A. X AND IL AND THE SQU.ARE ROOT ROUTINt.

0704

AVAILABLE PRIOR TO JANUARY 1962

635RWGIH

GENERAL ROOT f [NDER FORTRAN SUDRDUT [NE
TH 1 S FDR:TRAN SUBPROGRAM F INOS THE REAL LEROS Of ANY
ANALYTIC fUNCTION flX/. IT HAS A DIMENSION STATEMENT
CI501 WHICH CAN BE CHANGE[: TO sun NEEDS OF THE PROGRAM
MER. RECUIRES 4')3 CEllS EXCLUDING THE ARRAY C, THE OUTPUT SUBROlJTlNES, THE SQUARE ROOT ROUTINE AND THE AUXllI ARY PROGRAM.

I AM

0104

0704

PROGRA~.

63')RWMATS

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1%2

LINEAR MATRIX ECUATION SOLVER
THIS fORTRAN SUBPROGRAM FINDS THE SOLUTION X OF A
LINEAR MATRIX ECUATtON POX EQUALS C WHERE THE MATRIX B
15 OF ORDI::R N TIMES N AND THE MATRIX C IS OF ORDER N
Tti".ES 1",. If C IS THE lOENTITY MATRIX THEN X EQUALS
IN\lERSE Of 13. IT HAS A OIt-'ENSION STATEMENT Al50,501 ANO
'1./25,251 WHTC~ CAN BE CJ-.lANGED ACCORDING TO NEEDS OF THE
P~OGRA""MER. INPUT DATA IS D[STROYED DURING COMPUTATION.
IdB CELLS EXCLUDING ARRAYS A AND X ARE REQUIRfD.

0104

0704

63SR'ftNTRI

AVAILABLE PRIOR TO JANUARY 1962

NEARLY TRIANGULARIZATIDN Of A MATRIX SUBROUTINE
THIS FORTRAN SUD PROGRAM TRANSFORMS A REAL MATRIX A INTO
A NEARLY TRIANGULAR II-SUB TRIANGULARI MATRIX M BY
SIMILARITY TRANSfORMATIONS. IT HAS A DIMENSION STATEM[NT Cf AlSO.SOI AND B/501 WHICH CAN ~t; C,,",ANGED ACCORDING Te THE NEEDS OF THE PROGRAMMER. THE INPUT MATRIX A
IS DESTROYED DuRING COMPUTATION. 33q CELLS REQUIRED
EXCLUDING ARRAYS A AND B.

0704

63SRWVCTR

AVAILABLE PRIOR TO JANUARY 1962

EIGE~lVECTOR

DETERMINATOR SUBROUTINE
GIVEN A RI:AL EIGENVALUE ALPHA OF'A MATRIX A OF ORDER
111 TIMES N, THIS fORTRAN SUBPROGRAM DETERMINES THE
CDRRESPONDING REAL EIGENVECTOR V. IT HAS A DIMENSION
STATEi"ENT Al50,501 AND \//501 WHICH CAN BE CHANGED
ACCORDING TO NEEDS OF THE PROGRAMMER. THE INPUT MATRIX
A IS C[STROYED IN COMPUTATION. 345 CElLS REQUIRED
CORRI B16
EXCLUDING ARRAYS A ANO v.

0704

636RWBF2f

BESSEL fUNCTIONS Of
COMPUTES J lERO ANO
FOR!'!ULAS.
RECJUIRES
SQUARE ROOT AND LOG

AVAILABLE PRlOR TO JANUARY 1962
ORD[R LERO.
Y LERO Of X FROM ASYMPTOTIC
232 CELLS PLUS 10 COI-\HON.
SIN,
ROUT INES INCLUDED

636RWBf3f

ABSTRACT

B - 704

AVAILABLE PRIOR TO JANUARy"I')62

636R'ftCF2F

AVAILAALE PRIOR TO JANUARY 1962

631ANl010

AVAILADLE PRiOR TO JANUARY 1962

fORTRAN liON-LINE TO OFF-LINE OUTPUT MODifyING SU8R.
fORTRAN Ll SUBPROGRAM TO !>I.ODIFY THE OBJECT PRO:;RAM RESULTING
FROM PRI.NT STATEMENTS TO ONE EQUIVALENT IN EFFECT TO THAT
RESULTING fROM WRITE OUTPUT TAPE I STATEMENTS. PROVISION IS
MADE fOR RESTORING THE ORIGINAL PROGRAM If SO DESIRED

0104

637ANlOll

AVAILABLE PRIOR TO JANUARY 1962

fORTRAN II OH-LINE TO ON-LINE OUtPUT MODifYING SUBR.
fORTRAN II SUBPROGRAM TO MODifY THE OBJECT PROGRAM RESULTING
fROM .,RITE OUTPUT TAPE I STATEMENTS TO ONE EQUIVALENT IN
EFHCT TO THAT RESULTING fROM PRINT STATEMENTS. PROVISION IS
I'IAOE FOR RESTORING THt: ORIGINAL PROGRAM If SO DESIREO

0104

o37ANl012

AVAILABLE PR(OR TO JANUARY 1962

FORTRAN Ll ON-LINE TO OFF-LINE INPUT MODIFyING SUBR.
FORTRAN 11 SUBPROGRAM TO MODIFY TIlE ODJECT PI~OGRAM RESULTING
fROt' READ STATEMENTS TO ONE EQUIVALENT IN EFFECT TO THAT
RF.SULTING FRO~ READ INPUT TAPE I STATEM[NTS. PROVISION IS
MAUE FOR RESTORING THE ORIGINAL PROGRAM If SO DESIREO

0704

PROGRAM

641CSS~Tl

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

SCUARt:. ROOT, FLOATING POINT
FULL SINGLE PRECISION ACCURACY. TIMING 1.0% MILLISECONDS.
SPACE. 3'J CELLS PLUS 2 COt-'MON.

0704

641NPOFCI

AVAILABLE PRIOR TO JANUARY 1962

flOUBLE PREC 1-S I ON COMPLEX AR ITHMET IC PACKAGE.
PROVIDES A DOUBLE PRECISION FLOATING POINT COI-',PLEX
COMPUTING PACKAGE CONTAINING 30 BASIC ARITHMETIC AND
LOGICAL COt'MANDS ENABLING THE USER TO CODE IN SINGU
AODRESS COMPLEX MODE. INSTRUCTIONS ARE OF THE SM'.E FOR:-I
AS THEIR 704 CO~HAND EQUIVALENTS. EXTENT-6J9 LOCATIONS.

07011
0704

LIBRARY

LEAST SCUARES CURVE-FlTTING ROUTINE USING ORTHOGONAL
POLYNOMIALS. STATIST[CAL VALUES INDICATING RELIADIUTY
Of tHE DERIVATIVES ARE PROVIDED. 'nEIGHTS OTHER THAN
ONE MAy BE OPTIONALLY PROVIDED. ThE MINIMIlATION MAY
BE CPTIONALLY CCNSTRAINEO TO fORCE UP TO SI::VEN OF THE
LOW-ORDER COEffICIENTS TO VANISH. 388 CELLS PROGRAM
STORAGE PLUS fEMPQRARIES.

0104
0704

PROGRAM

BESSEL fUNCTIONS Of ORDER ONE.
COMPUTES J ONE AND Y ONE OF X fROM ASYMPTOTIC FORMULAS.
REQUIRES 235 CElLS PLUS 10 COMMON .. SIN. SQUARE ROOT AND
LOG ROUTINES INCLUDED.

13M

IBM

0704

647NPPl>'C2

AVAILABLE PRIOR TO JANUARY 1%2

ftGENVALUE SOLUTIO"l, REAL
TO FINO THE HIGHEST EIGENVALUE AND CORRESPONOING UGENVECTORS
OF THE MATRIX EC:UATION IAI IX SUti II - LAMOA SUH I IX SUB II
WHERE ILAr.'DA SUB II IS AN EIGENVALUE AND /X SUB II IS THE
ASSGCIATEO EIGENVE'CTOR Of THE MATRIX IA/a

0704

61;

7NPRWfl2

AVAILAI.\LE PRIOR TO JANUARY 1%2

REAC IoRIT[ DRUM.
ROUTINE UTILIZES MULTIPLE RECORD FEATURE FOR OPTIMILING
THE TRANSfER OF THE CONTENTS OF UNIfORMLY DISTRIBUT[O
DRU~ LOCATIONS INTO THE CCNTENTS OF UNIfORMLY OISTRIBUTED
CORE LOCATIONS OR VICE VERSA. ALL AfFECTED LOCATIONS ON
DRUM AND IN CORE MUST BE EQUALLY S?AC[O. aut THE SPECifiC
SPACING 01- THE: AfFlCTEn LOCATIONS ON THE DRUM NEED NOT BE
T~E SAME AS fOR THE CORE. EXTENT. 53 LOCATIONS. NO COMMON.

Cl704

648AVS£Ll

IIVAILADLE PRIOR TO JANUARY 1962

S[LECTOR OF COMBINATIONS CF INPUT OATA.
ALL DATA CTIES. TO BE USED ME STOREO IN CORES. AND fRO.t..\
THESE SEll FORMS IN AN ORDER EO fASHION co~,es. OF l~rUT DATA.
THE SLBRTN. ASSIGNS A" COMe. NO. TO EACH COMB. THE USER ~AY
DESIGNATE CaMElS. HE WISHES SELl TO OMIT. AFTER SELECT IN'; A
COMEl. Of IfliPUT DATA, SELl TRANSFERS CONtROL TO NOR~AL RFTL.:RN
WHERE OATA PROCESSING PROGRAM SHOULD BEGIN. AT THE END OF THE
LATTI::R PROGRAtJ THE USER TlUNSFERS BACK TO SUDlnN. WHICH
SElECTS NEXT CC~B. ETC. WHE~ ALL COMB~. PROCESSED SEll WILL
TRA TO f tNAl RTN.

201

t tlM

0704

.1704

PROGRAM

LI BRARY

IDM

ABS TRACT

6491811SN1

AVAILABLE PRIOR TO

JA~UARY

1962

A 6 DIGIT flOATING POINT ARCSINE SUBROUTINE
INPUT~~NOR"'ALllED flOATING POINT ARGUMENT, OUTPUT CONTAINS
AT LEAST 6 USUAllY 7 SIGNIFICANT DIGITS~ COMPUTATION
TIME FROM 1~64 TO 2~47 MS, III LOCATIONS AND 4 COMMON~

0704

650RWAOO

UBRARY

654A~CHKF

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

654AMPlGF

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

PARTIAL DOUBLE PRECISION FLOATING POINT ADDITION
THIS FORTRAN SUBPROGRAM ADDS A DOUBLE PRECISION FLOATI NG PO I NT NUMBER AND A S 1 NGL E PREC I S I ON flOAT ING POI NT
NU/o'flER AND EXPRESSES THE SUM AS A DOUBLE PRECISION
FLOAT ING POINT NUMBER .. USES 22 CElLS.

0104

PROGRAM

SET SENSE LIGHTS
FQRTRAN SUBROUTINE TO TEST BITS 1-4 OF 9 LEFT ROW AND TURN
ON CORRESPONDING SENSE LIGHTS.

0704
0104

0704

AVAILABLE PRIOR TO JANUARY 1962

650RWDPFA

DOUBLE PRECISION FLOATING POINT ADDITION
THIS FORTRAN SUBPROGRAM ADDS TWO DOUBLE PRECISION
FLOATING POINT NU~BERS, EXPRESSING THE SUM AS A DOUBLE
PRECISION flOATING POINT NUMBER. USES 25 CELLS~

NTH LEGENDRE POLYNOMIAL
FORTRAN VERSION OF AMPLGN. CORR. DIST. 865

0704

654AMPLGN

AVAILABLE PRIOR TO JANUARY 1962

NTH LEGENDRE POLYNOMIAL
SINGLE PRfCISION flOATING. TWO ENTRIES,ACCURACV-8DICITS.
RECUIRES 29 STORAGE CEllS AND 2 COMMON .. CORR. DIST. 865

0704

654AMPlGX

AVAILABLE PRIOR TO JANUARY 1962

NTH LEGENl)RE PUl YNOM I AL
FIXED POINT ROUTINE, TWO ENTRIES
ACCURACY - 8 DIGITS. REQUIRES 10 STORAGE CElLS AND 2 COMMON
0704

650RWFOV

AVAILABLE PRIOR TO JANUARY 1962

l)CUBlE PRECISION FLOATING POINT DIVISION
THIS FORTRAN SUBPROGRAM PERFOR~S THE DIVISION OF ONE
OOUBLE PRECISION FLOATING POINT NUMBER BY ANOTHER AND
EXPRESSES THE QUOTIENT AS A DOUBLE PRECISION flOATING
POINT NUMRER~ USES 13(' CELLS.
CORRI 886

0704

650RWMULT

654AMWOTP

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

DOUBLI:: PRECISION flOATING POINT MULTIPLICATION
THIS FORTRAN SUBPROGRAM MULTIPLIES TWO DOUBLE PRECISION
FLOI\TI"IG POINT NUMBERS, EXPRESSING THE PRODUCT AS A
nOUBLE PRECISION flOATING POINT NUMBER. USES 48 CEllS

0704

0704

BCD Ot. TPUT PROGRAM
WRI TES A BCD RECORD OF ANY LENGTH ON TAPE AND/OR PRINTS ON
LINE I-ilTHOUT THE USE OF SENSE SWITCHES.
THIS IS A MODIFICATIOI'. OF UA SPHI~

650RWREAD

AVAILABLE PRIOR TO JANUARY 1962

oeuel!:

0704

659GCTlUI

AVAILABLE PRIOR TO JANUARY 1962

TABLE READ IN & TABLE LOOKUP, INTERPOLATION SUBROUTINE
FOR Ft;NCTlONS OF ONE, TWO, AND THREE VARIABLES. STORES All
TABLES AS A SINGLY-SUBSCRIPTED ARRAY. PROVISION TO READ IN
ADDITIONAL TABLES AS NEEDi::D. SUITABLE ERROR RETURNS PROVIDED
FOR BY A COMPUTED GO TO .. SAME STANDARD CARD FORMATS FOR All
TABLES~ TABLES ARE SEQUENCE CHECKEl) WHILE BEING READ IN FROM
RCD TAPE OR CARD REAO[;R. CORR/770

PRECISION FLOATING POINT CARD INPUT
THIS FORl'RAN SUBPROGRAM READS A 16 DECIMAL DIGIT
IDOUBLE PRECISIONI FLOATING POINT NUMBER FROM A CARD~
REQUIRES 502 CELLS.
CORRI 8B6

tl3M

0704

PROGRAM

LIBRARY

IBM

ABSTRACT

0701,

PROGRAM
~

07{)4

652RWEG2F

AVAILABLE PRIOR TO JANUARY 1962

0704

b61GOF020

~.*.*

ABSTRACT

............... ,.,. ........................ .

AVAILABLE PRIOR TO JANUARY 1962

EIGENVALUES AND EIGENVECTORS OF THE PRODUCT OF A AND X~
EQUALS THE I<4AVE LENGTH TIMES THE PRODUCT OF B AND X,
WHERE A AND BARE SYflMETRIC, AND B IS POSITIVE DEFINITE
COMPUTES IN SINGLE PRECISION FLOATING POINT~ THE
COMPUTATlON OF THE: EIGENVECTORS IS OPTIONAL.
CORRI 675, 803

SQUARE MATrlIX TRANSPOSEO ON tTSELF OR DISPLACED IN CORE
MATRIX CAN BE STORED ROW-WISE OR COLUMN-wiSE
ELE~Er.T AII,JI IS STORED INTO A/J,II OR B/JrIl
2R STCRAGl LOCATIONS
soxeD MATRIX TrlANSPOSEO IN 615 MILLISECONDS

0104

0704

65?RWFT2F

FLOAT ING
PROvllJES
FLOw AND
OCCUPIES

0704

AVAILABLE PRroR TO JANUARY 1q62

POWT TRAP ROUTINE
OPTIONAL METHODS OF HANDLING AC AND MQ OVERUNDErlFlO" WHILE IN THE FLOATING TRAP MODE~
152 CELLS AND CONTAINS ITS OWN TEMPORARY~

652RkHF2F

0704

0704

652RWPRT2

SCUARE ROOT, FLOATING POINT.
FUll SINGLE PRECISION ACCURACY IN
CEllS.

66 1,ANF402

AVAILABLE PRIOR TO JANUARY 1962

MATRIX INVERSION WITH SOLUTION OF LINEAR EQUATIONS
FORTRAN U SUBROUTINE SOLVES THE ~ATRIX EQUATION
AX-B. WHERE A IS A REAL, SQUARE COEFFICIENT MATRIX AND
B IS A MATRIX OF CONSTANT VECTORS~ THE INVERSE MATRIX
AND OHERI-'INANT ARE ALSO OBTAINED~ A IS DESTROYED IN
THE INVf.RSION~ REQUIRES 458 CelLS PLUS VARIABLE COMMON.

0704

AVAILABLE PRIOR TO JANUARY 1962
I~008

MILLISECONDS USING 41

66DMUCBLI

AVAILABLE PRIOR TO JANUARY 1962

OCTAL COLUr-'N BINARY CARD LOADeR ITHREE CAROS/~
READS A FILE OF CARDS PUNCHED IN THE OCTAL COLUMN BINARY FORM
AT FUll SPE:ED ON THE 111 />'ODEl 1 OR MODEL 2 CARD READER. AN
OCTAL COLUMN BINARY TRANSFER CARD IS RECOGNIZED AND CONTROL
IS TRANSFERRED TO THE LOCATION SPE:CIFIED. THE PROGRAM IS SELF
-LOADING Ar-JD USES THE FIRST 96 LOCATIONS IN MEMORY.

0704
653CSSQT2

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

GENERAL OUTPUT ROUTINE
SETS UP ONE LINE OF OUTPUT AS SPECIFIED IN THE CALUNG
SECUEf'oCE AND wRITES THE LINE ON TAPE 6 FOR PRINTING OR
TAPE lJNlT 5 FOR PUNCHING IF SWITCH 2 IS OFF, DR PRINTS
OR PUNCHES THE ltNE ON THE ON-LINE PRINTER OR PUNCH IF
Si'lt'rJ:.h 2 IS ON. IT IS ALSO POSSIBLE TO SET UP A LINE
AS SPeCIFIED IN THE CALLING SEQUENCE AND TO PRINT OR
PUN.CH THE LINE ON THE ON-LINE PRINTER OR PUNCH ONLY,
REGARDLESS OF THE SETTING OF SWITCH 2. REQUIRES 389
CELLS PLUS 51 COMMON~

0704

664ANF202

EIGENVALUES AND EIGENVECTORS OF A REAL SYMMETRIC MATRIX
FORTRAN LI SUBROUTINE FINDS ALL SCALAR SOLUTIONS, L
IINCLlJOING PROPER MULTIPLICITY/. AND, OPTIONALLY, THE
ASSOCIATETJ UNIT NORM VECTORS, X, TO THE MATRIX EQUATION
AX-LX. REQUlRES 935 CElLS PLUS VARIABLE CO"MQN.

AVAILABLE PRIOR TO JANUARY 1962

MULTI-MATERIAL ONE DII"ENSIONAL HEAT EQUATION SOLVER
SOLIIES NUMERICALLY THE ONE DIMENSIONAL HEAT FLOW
fQUATION WITH VARIABLE THER~1AL PROPERTIES THROUGH A
LAMINI\TEO SLAR t OF AS MANY AS stx MATERIALS, WITH
RELhT 1 VEl Y GENERAL BOUNDARY CDND I T IONS

202

LIBRARY

............... ........ *

668/o'UCE I 1

AVAILABLE PRIOR TO JANUARY 1962

MURA COMPLETE ElLIPTIC INTEGRALS
APPROXIMATES THE VALUES OF THE COMPLETE ElLIPT IC
REQUIRES THE
INTEGRALS -K AND E SCALED 2EXP-3.
SUBROUTINE MU LOG3..
61 WORDS PROGRAM PLUS 11 WORDS
CO"'~ON.
TIMING 10.3 MS.

.. ... ........... ..... ........ .... ... .......... .... ...............
t.OM

070 f ,

070/,

PROGRA~

LIBRAI~Y

673WH005?

AUSTRACT

AVAILABLE PRIOR TO JANUARY 1962

hl\SOLUTE ANO CQRRECTIO"l TRANSFER CARO lOACER.
LOADS SHARE STANDARD ABSOLUTE BINARY AND CfT CARDS.
ALL CARDS I-'.AY AE CHECKSUM VERIFIED. REQUIRES 60 LOCATIONS
hND INllEX REGISTER 4. MACHINE MUST NOT BE IN TRAPPING MODE.

0704

674RWSPAD

......................................................
1£\1-(

0704

b760R7lttS

AVAILABLE PRIOR TO JANUARY 1962

72/84 AND 80/B4 SIMULATION OF THE 714 CARD TO TAPE.
R[OU[R(S NON-STANDARD 711 ClL. PANEL, EXTRA CARDS Hl DECK IF
READING 80 COL.
NO CHECKING DONE.
USES CE 141, NY Bll.

6'.l2JPT AIIN

ABSTRACT

B - 704

AVAILABLE PRIOR TO JANUARY 1962

0704

677NA0314

692JPWEIR

AVAILABLE PRIOR TO JANUARY 1962

FLOATING POI,NT BIVARIATE SEARCH
GIVEN A BLACK BOX ROUTINE WITH TWO INPUT AND HID OUTPUT
PARAMETERS, THIS ROUTINE ADJUSTS THE INPUT PARAMETERS TO THE
DESIRED VALUES OF THE OUTPUT PARAMETERS. THIS IS OONE BY
APPROXIMATION TO THE FIRST PARTIAL DERIVATIVES.
REC;UIRES 20B LOCATIONS r. 9SPACES AT COMMON.

692JPZPOL

AVAILABLE PRIOR TO JANUARY 1962

ZEROS OF COMPLEX. POLYNOMIALS
CO~PUTES THE ZEROS OF A POL YNO~ I i'lL wiTt-' COMPLEX
COEFFICIENTS USING A SINGLE PRECISION QUADRATIC
METHOD. STORAGE LOCATIONS 467 f. 38 ERASABLE f. 21Nf.lll

0104

697MIHDJiI

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

THERMtlL ANALOlER
THIS IS A I'1DDIFICATION TO SHARE SUBROUTINE CLTHAI WHICH SOLVE
50 THE GENERAL PROBLEM OF SHADD STATE AND TRA~StENT HEAT TRAN
SFER. MULTIPLE CASES CAN 8E HANDLED WITH EITHER PIRTIAL PARAM
EYER REPLACEMENT OR DOING A COMPLETE NEW PROBLEM ..

0704

LIBRARY

FLOATtNG POINT UNIV~RIATE SEARCH
GIVEN A BLACK BOX ROUTINE COMPUTING FIXI FROM A GIVf:N
X, THE SEARCH ROUTINE VARIES C TO OBTAIN A DESIRED VALUE
OF F/X/.
REQUIRES 208f./2N(.AI STORAGE LOCATIONS /INCLUDING JP GNAT/.
REQUIRES Nf.7 LOCATIONS AT COMMON.

0104

0704

PROGRAM

AVAILABLE PRIOR TO JANUARY 1962

ELLIPTIC PARTIAL OIFFERENTIAL EQUATIONS
THIS PROGRAM FINDS THE APPROXIMATE SOLUTION OF A SET OF
ELLIPTIC PARTIAL DIFFERENTIAL EeUATIONS ON A TWO
01 Mt:NS IONAL REGION WITH PRESCR I BED. BOUNUARY COND I T IONS
BY THI: METHODS OF FINITE DIFFERENCES AND SUCCESSIVE OIlERRELAXATl.ON. THE REGION MAY BE ARBITRARY IN SHAPE AND MAY
INCLUDE INTERFACES AND HOLES. THE UOUNDARY CONDITIONS MAY
BE I-'IXED.
THE MAIN PROGRAM REQUIRES 5966 CELLS,
EXCLUSIVE OF THE THREE SUBROUTINES THE USER MUST SUPPlY.
OF THE THREE SUBROUTINES THE USER MUST SUPPLY. CORR.9B9

0704

07011

704-SAP-CODED MATRIX DIAGCNALIlATION SUBROUTINE
THIS SUBROUTINE DIAGONAlIlES A REALI SYMMETRIC HATRIX
BY MEANS OF JACOBIS METHOD WHEN THE MATRIX ELEMENTS ARE
SINGLE-PRECI.SIONI FLOATING-POINT NUMBERS STORED IN
TRIANGULAR FORI": MHRtCES OF LARGE ORDER ,N, ARE
DIAGONALlZED IN A TIME PROPORTIONAL TO N CUBED AND WITH
A MINIMUM NUMBER OF ROTATION.

AVAILABLE PRIOR TO JANUARY 1962

0871 BNll

AVAILABLE PR.IOR TO JANUARY 1962
NON-LINEAR ESTIMATION IPRINCETON-IBMI
GIVEN A FUNCTIONAL RELATION AND DATA FOR N OBSERVED VALUES OF
A SINGLE DEPENDENT VARIABLE, NK CORRESPONDING VALUES FOR K
INOHENOENT VARIABLES, AND INITIAL VALUES FOR P PAIl.AMETERS,
THE PROGRAM III PROVIDES BY AN ITERATIVE LEAST SQUARES
PROCEOURE ESTIMATES FOR THE PARAMETERS AND 121 PROVIDES
STATISTICAL INFORt-'ATION TO ASSESS THE WORTH OF THE ESTIMATED
PARAM£TERS.
USE OF THE PROGRAM FOR MORE THAN ONE DEPENDENT
VARIABLE IS POSSIBLE. THE FUNCTIONAL RELATION MAY BE NONLINEIIR OR' LINEAR IN THE PIIRAM. f. INOEP. VAR.
CORRI 845

OCU8LE PRECISION ~ATRIX MULTIPLICATION ..
MULTIPLIES TWO REAL MATRICES WHOSE ELEMENTS ARE STORED
CONSECUTIVELY BY ROWS IN CORE STORAGE USING DOUBLE PRECISION
ARITHtJETIC.
THE ELEMENTS OF PRODUCT MATRIX ARE STORED IN
THE SliME MANNER IN CORE STORAGE.
REQUIRES 145 STORAGE PLUS
16 COtJMON. CL OPAl AND CL DPMI r~UST BE ASSEMBLED
CONCURRENT LY..

IBM

0104

PROGRAM

lIBRARY

ABSTRACT

•••••••••••••••••••••••••••••••• * ••••••••••••••••••••••••••••••••
IBM

0704

PROGRAM

LIBRARY

ABSTRACT
0704

0704

Of!8GKT~Rl

AVAILABLE PRIOR TO JANUARY 1962

TAPE MANEUVERING ROUTINE.
nR IS A TAP,E COpy ROUTINE WITH A NUMBER OF SUBROUTINES WHICH
PERMIT RECORD MANIPULATION AND MOOIFICATION IN ANY OF SEVERAL
WAYS. THESE INCLUDE INDIVIDUAL WORD CHANGES AND CHECKSUM
CORRECTION, AS WELL AS RECORD READ-IN FROH CARDS WHILE
COPYING TAPES. ITS CHECKING M(THOD HAKES IT A LITTLE SLOWER.
THAN GHTED OR RL0044 IN SOME RESPECTS, BUT WHERE MERGING OF
SEVERAL TAPES IS DESIRED, IT IS FASTER.

0704

690GDI!OTl

MAILABLE PRIOR TO JANUARY 1962

BINARY OCTAL CARD OR TAPE LOADER
FIVE CARD HIGH ORDER SELF LOADING PROGRAM TO LOAD
ABSOLUTE SHARE STANDARD AND CAGE BINARY, OCTAL f. OCTAL
TRANSFER CARDS .. OPTION AVAILABLE FOR ~RITING A SELF
LOADING RECORD FROM CORE BEFORE EXECUTING TRANSFER CARD.

0704

690GDNRTl

AVAILABLE PRIOR TO JANUARY 1962

N ROOT ROUTt NE
COMPUTES THE NTH ROOT OF A NORMAlIlED FLOATING POINT
NUMBER .. ARGUMENT IN THE ACCUMULATOR AND N IN INDEX
REGISTER 1 UPON ENTRY. RESULT IN ACCUMULATOR UPON RETURN.
ERROR RETURN IF COMPLEX ROOT.

0704

690GDTl01

AVAILABLE PRIOR TO JANUARY 1962

T APE INPUT lOUT pUT
TO READ OR WRITE A VARIABLE LENGTH BINARY OR BCD RECORD
WI TH OR WITHOUT CHECKING.AND CHECK FOR AN END OF FILE OR
END OF TAPE CONDITION ..

0704

692JPGNAT

AVAILABLE PRIOR TO JANUARY 1962

LAGRANGUN LNTERPOlATION ROUTINE
GIVEN A TARLE OF N PAIRS OF X AND F/X.I AND A GIVEN VALUE
OF Xl. THE ROUTINE WILL USE IN-ll THE ORDER INTERPOLATION
TO COHPUTE F/X1/.
LAGRANGIAN COEFFtEIENT FUNCTIONS ARE USED.
REQUIRES 77 STORAGE LOCATIONS FOR PROGRAM AND rH:'6 AT COMMON.

AVAILABLE PRIOR TO JANUARY 1962

7DSMLFlT2

AVAILA8LE PRIOR TO JANUARY 1962

704-SAP FLOATING-POINT TRAP UNDERflOW CORRECTlON-SL:BRDL;TlNE..
AN INITIAlIlING CALLING SEQUENCE TO THIS
SL;BRQUTlNE SETS THE COMPUTER IN THE flOATING TRAP MODE SO
THAT IIHEN SUBSEC:UENT UNDERFLOW OCCURS, THE PROPER REGISTER
lAC AI'I

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

708WHSMT2

70 1, SELECTIVE MONITOR TRACE SYSTEM ..
TO BE SET UP AT EXECUTION TIME BY MEANS OF CONTROL CARDS TO
PROVICE 111 A DETAil PRINTOUT OF LOC, OP, EFF AOOR,CIEI,C/ACI
C/~Q/,TAG,c/IR/, OV IND FOR EVERY INSTRUCTION, OR 121 A TRAP
TRACE OF EACH EXECUTADLE TRANSFER, OR 131 A TRACE OF ALL STOR
I,NSTRUCTIGNS EXECUTED, OR 141 ANY COMtHNATlON OF THESE MODES
OVER ANY SElECTED PORTIONS OF PROG BEING CHECKED. TRACES PROGRAJ-IS WHICH OPERATE IN TRAP MODE, AS WELL AS 110 OPERATIONS
flY SI~ULATION. FL DEC IIC AN!} MQ .. ON-LINE PRINT ONLY ..
903(. STORAGE CEllS, RELOCATABLE ..

71 SRWCA21

0'704

AVAIlAOLE PRIOR TO JANUARY 1962

flOATING POINT COMPLEX ARITHMETIC ABSTRACTION
TO FACILITATE EXECUrlGN OF A PROGRAM USING EITHER REAL
OR COl>'PLEX ARITHMETIC WITHOUT MODIFICATION OF THE PROGRAM
AND WITH NEGLIGIBLE LOSS OF TIME WHILE USING REAL
ARITH~ETIC .. REQUIRES 434 CELLS AND CONTAINS US OWN
TEMPORARIES.

IBM

0704

0704

PROGRAM

LIBRARY

742RWLS3F

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

GENERAL ,LEAST SQUARE CURVE FITTING ROUTINE ..
SOLVES THE VECTOR V IN LEAST SQUARES SENSE..
REQUIRES
757 CElLS OF PROGRAM AND CONSTANTS /INCLUDES LOF,
AOU. AND DOUI PLUS N£.5 CELLS OF COMMON.

7430RAlI

070L.

AVAILABLE PRIOR TO JANUARY 1962

RANDO/" NUI>'AE-R GENERATOR,

0704

7430RCAUC

RANDOM

NU~BER

0704

7430ftEXPR

All MUTHAL ANGLE .. FIXED POINT ..

AVAILABLE PRIOR TO JANUARY 1962

GENERATOR,

CAUCHY DISTRIBUTION .. FT. PT ..

AVAILABLE PRIOR TO JtlNUARY 1962

RANDOI>' NO. GENERATOR, EXPONENTIAL OISTp,IBUTlON.
0704

0704
TwO-DIMENSIONAL MFSH FOR RELAXATION CALC ATIONS ..
SYSTEf" OF PROGRAMS FOR SOLUTION OF PA
IAL DIFFERENTIAL
ECUATIONS BY THE SUCCESSIVE OVER-RE XATlQN METHOD.
CONTAINS MESH GENERATOR, ITERATOR, OUTPUT PRINTER,
INTERPOLATOR AJl,jO OTHER AUXILIARY PROGRAMS.

AVAILABLE PRIOR TO JANUARY 1962

726SCXPCO

704 TRANSPORT AT I ON CODE ..
704 TRANSPORTATION CODE USING JAMES MUNKERS AlGORlTHM ISlAM
JOURNAL, MARCH 1957/ .. REQUIRES 8K CORE. 4 DRUMS AND AT LEAST
1 TAPE UNIT.

7430RF ISH

AVAILABLE PRIOR TO JANUARY 1962

RA"'IDOM NO. GEN., NERENSON-ROSEN FISSION SPECTRUM. H.PT

0704
070 /,

FT.PT ..

AVAILABLE P.R1.0R TO JANUARY 1962

725PKMERE

7430RFLOT

AVAILABLE PRIOR TO JANUARY 1962

flOAT A FRACTION
CONVERTS A FRACTION TO FLOATING POINT FORMAT.

0704

1430RFLRN

AVAILABLE PRIOR TO JANUARY 1962

RANDOM NUMBER GENERATOR, FlOATING POINT.
AVAILABLE PRIOR TO JANUARY 1962

727IBSQo

0704

0704
DOUBLE PREC .. flOATING PT .. SQUARE-ROOT SUBROUTINE ..
RELATIVE ERROR lESS THAN 2.5XIO-16. 2 .. 02 MS, 54 LOCATIONS (. 4

7430RFXRN

AVAILABLE PRIOR TO JANUARY 1962

RANDOM NUMBE·R GENERATOR,

FrXED POINT

COI'MO~.

10M

0704

PROGRAM

• • I I . II • • ., . . . . . . . . . . .

0704

LIBRARY

ABSTRACT

* .. ., II . . . . . . ., • • • ., ** ** ..... ., • .,.,.* ........ *.* * .............. *.

732PFMODL

AVAILABLE PRIOR TO JANUARY 1962

READING OF FORMAT STATEMENTS AT EXECUTION TIME.
FORfRAN-2 SUBROUTINE TYPE PROGRAM.

0704

71)PFOUP3

AVAILABLE PRIOR TO JANUARY 1962

TAPE COPY PROGRAM.
BINARY OR: BCD ."lOoE MAY BE IMPOSED AS WEll AS INTEGRAL COPY
OR NUfJBER OF FILES OR NUMBER OF RECORDS TO BE COPIED CAN BE
PRESET .. CHECKSUM AND OPTIONAL RTT VERIFICATION IS EFFECTUATED

lAM

0704

PROGRAM

LIBRARV

ABSTRACT

.* •• .,.,. ••••• * •••••• *** G. **. *., ..... _., .. ** •• * ...... * •• ** •••••• ,. * ••••••
0704

7/f30RGAUR

AVAILABLE PRIOR TO JANUARY 1962

RANDO,... NO .. GENERATOR, GAUSSIAN DISTRIBUTION. FT .. PT.

0704

7430RMAXB

AVAILABLE PRIOR TO JANUARY 1962

RANDO,... NO. GENERATOR" MAXWEll-BOLTZMANN OIST ..
070"

73t.PFPROG

TAPE CREATING PROGRAM AND lOADER SUBROUTINE.
THIS IS A ass LOADER THAT CREATES A PROGRAM TAPE FOR PROGRAMS
COMPILED BY FORTRAN 2 AND EXCEEDING STORAGE CAPACITY.
SU~ROl.JTINE PROG IS USED TO CAll IN THE PROGRAM TAPE.

070'1

735PFMCFL

FT. PL.

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

FlOATING TRAP Sr~ULAT!ON.
rORTRAN-2 SUBROUTINE PERFORMING HOATING OVERflOW-UNDERFLOW
AND DIVIDE CHEC DETECTION. CONSOLE GIVES DETAILED
INFORMATIO"J ARDUT CONDITIONS. THERE ARE POSSIBILITIES TO
CONTINUE BY AUTOMATIC CORRECTION OF RESUL TS ..

0704

7430RMOCO

AVAILABLE PRIOR TO JANUARY 1962

CONSTANTS FOR OR MONTE CARLO PKG .. INOT A SUBROUTINEI

0704

7430RPOll

RANDOM NUMBE'R GENERATOR,

0704

7430RTURN

AVAILABLE PRIOR TO JANUARY 1962
POLAR ANGLE. FLOATING POINT.

AVAILABLE PRIOR TO JANUARY 1962

PARTICLE SCATTERING
Vt:CTOR ROTAT'lNG SUBROUTINE OF MONTE CARLO PACKAGE.
0704

739ARPEK2

AVAILABLE PRIOR TO JANUARY 1962

BINARY SUBROUT I NE IOENT IF ICA r ION AND MEMORY ALLDCA TlON
READS FN II BINARY PROGRAM DECK LISTING ON-LINE OR OFF-LINE
THE SUBROUTINES IN THE DECK, ALSO VECTORS,LENGTH,ENTRIES
CO .... MCN REt::UIREf'o!ENTS .. UPON FINDING FN II TRANSFER CARD,STATES
ACTUAL NEXT AVAtLABlF. CELL AND LOWEST COMMON CElL REFERENCED
IN ~!l.OGRAM .. MAKES NO CHECK FOR MISSING SUBROUTINES ..

0704

742RwLE3F

AVAILABLE PRIOR TO JANUARY 1962

LINEAR EQUATIO-"l SOLVE~
GIVEr.! A LINEtlR MATRIX E'OUATION AV-B. WHERE A HAS THE
DIMENSIONS M X NAND 0 IS A COLUMN VECTOR OF DIMENSION
M X 1., THIS ROUTINE FINDS THE SOLUTION V IN THE LEAST
SCUARE:S SENSE. RE(;;UIRES 466 CElLS OF PROGRAM AND CONSTANTS
ItNCll;oES AOU AND DOUI. PLUS N£.5 CElLS OF COMMON ..

204

0704

744AMOPAS

AVAILABLE PRIOR TO JANUARY 1962

DOUBLE PRECI.SION MATRIX ADDITION AND SUBTRACTION.
ADDS OR SUBTRACTS TWO REAL MATRIC.ES WHOSE ELEMENTS ARE STORED
CONSECUTIVELY BY ROWS IN CORE STORE USING DOUBLE PRECISION
ARITHI>'ETIC.
THE ELEMENTS OF THE SUM OR DIFFERENCE MATRIX ARE
STORED IN THE SAME MANNER IN CORE STORAGE.
REQUIRES 80
STORAGE PLUS 8 COMMON.
CL OPAl MUST BE ASSEMBLED
CONCURRENTLY.

0704

749SCBOP1

AVAILABLE PRIOR TO JANUARY 1962

MULTIPLE REGRESSION BACK SOLUTION PROGRAM ..
TO PROVIDE BACK SOLUTIONS FOR THE RESULTS OF THE MULTIPLE
REGRESSJ.ON CODE SCRAP.

..................................................................
IBM

0104

0704

PoROCRAM

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

1lt9SC I E~R

INPUT EblTOR FOR MULTIPLE REGRESSION CODE SCRAP.
THIS 704 PROGRAM USES FORTRAN TO CALCULATE FUNCTION VARIABLES
FROM OBSERVED VARIABLES AND PLACE THEM IN THE FORMAT REQUIRED
FOR THE MULTIPLE REGRESSION CODE SCRAP.

0704

0704

AVAILABLE PRIOR TO JANUARY 1962

152GMEPAC

FORTRAN ERROR PACKAGe
A FORTRAN II SUBROUNNE WITH SEVERAL ENTRIES TO PROVIDE ERROR
DIAGNOSTIC OUTPUT ON A BCD OUTPUT TAPE A. ERROR CONTROL, AND
FLOATlNG POHT OVERFLOWIUNDERFLOW ADJUSTMENT DURING THE
EXECUTION OF A PROGRAM. A DIAGNOSTIC CONSIST OF AN ERROR
DESCRIPTlON AND A SUBROUTINE NAME-STATEMENT NUMBER TRACE BACK
FROM THE ERROR SOURCE TO THE MAIN LINE PROGRAM. REQUIRES
FLOATING POINT TRAP AND FORTRAN 11 STANDARD ERROR PROCEDURE.
USES 325 CORE LOCATIONS •.

..................................................................
0104

FlROGRAM

154CEF2LD

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

GENERATE A FORTRAN II PROGRAM TAPE OR ABSOLUTE BINARY
CARDS. LOAOS A FORTRAN It PROGRAM ONTO A BINARY TAPE AS ONE
RECORD WITH A BOOTSTRAP PREFACE, OR PUNCH OUT THE PROGRAM
ON ABSOLUTE BINARY CARDS, DR BOTH.

0704

756RWtNPS

AVAILABLE PRIOR TO JANUARY 1962

DECIMAL, OCTAL, Bcn LOADER
READS BCD TAPE 4/wITH REDUNDANCY CHECKINGI IF SENSE SWITCH
1 IS UP, OR ,""OLLERITH PUNCHED CARDS ON-LINE IF SS-1 IS
DOWN, CONVERTS TO BINARY AND STORES IN CORE. THE FORMAT
ACCEPTABLE TO UADBCl HAS BEEN EXTENDED SO THAT INPUT. PREPARATION MAYBE MORE EASILY DIVORCED FROM PROGRAMMING
TECHNIQUES. REQUIRES 668 WORDS OF CORE. ALL TEMPORARY
STORAGES ARE SELF-CONTAINED.

0704

156RWINP5

AVAILABLE PRIOR TO JANUARY 1962

OEC1MAL, OCTAL, sca LOADER
ALLOWS SELECTIVE INPUT WITH A SINGLE CALL STATEMENT, AND
ALLOWS FOR CHANGES IN VALUES WHICH WERE NOT ORIGINALLY
DESIGNATED AS INPUT. REQUIRES 612 WORDS OF STORAGE wITH
ALL TEMPOR~RIES SELF-CONTAINED. CORRI B14

0104

159AMDPSM

AVAILABLE PRIOR TO JANUARY 1962

DOUBLE PRECI,SION MATRIX SCALAR MULTlPLlCATtON
MULTI PLIES A REAL MATRIX WHOSE ELEMENTS ARE STORED
CONSECUTIVELY BY ROWS TIMES A SCALAR IN CORE STORAGE USING
DOUBLE PRECISION ARITHMETIC.
THE ELEMENTS OF THE PRODUCT
MATRIX ARE STORED IN THE SAME MANNER IN CORE STORAGE.
REQUIRES 62 STORAGE &7 CO"'MON. CL DPMl HUST BE ASSEMBLED
CONCURRENTl Y.

07Q4

0704

760GECDIS

AVAILABLE PRIOR TO JANUARY" 1962

762RFEOO

AVAILABLE PRIOR TO JANUARY 1962

166ANC203

AVAILABLE PRIOR TO JANUARY 1962

ZEROS OF A POLYNOMIAL IN DOUBLE PRECISION
COMPUTES IN DOUBLE PREC IS (ON THE REAL AND COMPLEX ZEROS OF A
REAL POLYNOMIAL. OUTPUT OF ZEROS WITH MULTIPLICITIES AND
REMAINDER TERMS AS WELL AS ORIGINAL COEFFICIENTS. OPTIONAL
OUTPUT Of MODU LI AND COEFF It I ENTS OF POL YNOM J AL GENERA TED
FROM LEROS FOUND. MODIFICATION OF ROOT-SQUARING METHOD.
C203 IS A COMPLETE PROGRAM WHICH INCLUDES- BS INTP, BS CONV.
as OUT, BS LNX. BS DPSQ. BS EXP. UA CSH2, UA SPH1, HU ROt 2.

761UASP03

AVAJLABLE PRIOR TO JANUARY 1962

FLOW TRACE PROGRAM - UA SPO 3
ON- ANDIOR OFF-UNE OP-PANEL PRINT AFTER EXECUTION OF EACH
TRACE-ABLE TRANSFER INSTRUCTION WHILE IN TRAPPING MODE.
CONOI 1I0NAl ANDIOR UNCONDITIONAL ENTRANCE TO AND E>tIT FROM
TRAPPING MODE MIiOE FLEXIBLE BY CONTROL CARD. PRINTING HAY BE
CONTROLLED BY INDEX REGISTER CONTENTS. CORE STORAGE· LOCATION
CONTENTS, COUNT-DOWN ON NUMBER OF TRANSFERS TO OR FROM SOME
CORE STORAGE lOCATION, OR MANUALLY BY THE SETTING OF A SENSE
SWITCH. USES CORE STORAGE LOCATIONS 100000-007171B.

070"

AVAILABLE PRIOR TO JANUARY 1962

CONTINUOUS DERIVATIVE INTERPOLATION SUBROUTINE
COMPUTES Y AS A FUNCTION OF X FROM A TABLE OF X AND Y VALUES
SUC~ THAT THE FUNCTION Y AND ITS FIRST AND SECOND DERIVATIVES
ARE CONTINUOUS IN THE RANGE OF X IN THE TABLE WR ITTEN AS 2
FORTRAN 11 SUBROUTINES.

AVAILABLE PRIOR TO JANUARY 1962

768UADBC2

DECIMAL-TD-BINARY CONVERSION PROGRAM - VA DBt 2
FIXED POINT, FLOATING POINT, INTEGER OR BCD CONVERSION.
VARIABLE FIXED FIelD FORMAT A LA FORTRAN. FLAG COLUMNS HAY DE
SPECIFIED TO CAUSE INTERRUPTION Of CONVERSION. UPON INTERRUPT
NUMBERS MAY BE SCALED, REPLACED. IGNORED, ETC. LOADING IS BY
BLOCK, BUT THE INTERRUPT ALLOWS INPUT TO BE LOADED INTO
ARBITRARY CORE LOCAHONS. REQUIRES THE USE OF UAT·SM2 OR
UACSH2 TO READ TAPE OR CARDS. OCCUPIES 467 CORE STORAGE
LOCAn ONS AND 40 wnD'nc:. tu: COMMON "TOG AGE ..

...................................................................
IBM

0704

PiROGRAH

.769TVF.2TP

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

FORTRAN Ll ANOIOR FORTRAN I TO SELF-LOADING TAPE 1
TillS PROGRAM HAKES A SELF-LOADING TAPE 1 OF ANY NUMBER OF
INDEPENDENT FORTRAN 11 AND/OR FORTRAN I PROGRAMS. A LOAD
FUNCTlON IS REQUIRED IF MCRE THAN ONE PROGRAM IS TO BE
LOADED. THIS FUNCTION IS DESCRIBED IN APPENDIX A OF THE
WRITEUP OF TV F2TP.

0104

112ANE206

AVAILABLE PRIOR TO JANUARY 1962

LEAST SQUARE POLYNOMIAL FIT IFORTRAN III
GIVEN A SET OF N VALUES OF X WITH· WEIGHTS W, AND ONE OR MORE
SETS OF CORRESPONDING VALUES OF Y. ROUTINE DETERMINES THE M
COEffiCIENTS OF THE POLYNOMIAL/SI OF DEGREE M-l WHICH GIVES
THE BEST FIT TO THE SET/SI OF Y. THE RESIDUALS. WEIGHTED
SUM/SI OF SQUARES OF RESIDUALS, AND THE ERROR MATRIX ARE ALSO
COMPUTED. REQUIRES 296 CEllS PLUS VARIABLE COMMON.
SUBROUTINES POLYEI AND XLOC INCLUDED IN DECK. USES ANF40Z.

0104

715RWDE6F

AVAILABLE PRIOR TO JANUARY 1962

FLOATING PT. COWELL 12ND SUMI, RUNGE-KUTTA INTEGRATION
OF SECOND-ORDER EQUATIONS. SOLVES A SET OF N SIMULTANEOUS
SECOND-ORDER ORDINARY DiffERENTIAL EQUATIONS, IN WHICH
FIRST DERIVATIVES MAY OR HAY NOT APPEAR.

0704

715RWGLSC

AVAILABLE PRIOR TO JANUARY 1962.

GENERAL LEAST SQUARE CURVE FITTING ROUTINE
GIVEN AN N X M MATRIX A, AN M DIMENSIONAL ·ROW VECTOR B
AND AN N X N DIAGONAL MArRIX S ISTORED AS A ROWI THIS
ROUTINE FINDS AN N DI.MENStONAL ROW VECTOR V. IF THE USER
SETS ALL S - 0 SOLVES V IN THE lEAST SQUARES SENSE.

0104
0704

B - 704

LAGRANGIAN INTERPOLATION ANDIOR DIFFERENTIATION
GIVEN H fABLES YK-F/XI WHERE X IS EQUALLY SPACED KTH ORDER
INTERPOLATION AND/OR DIFFERENTIATION OF T~E LAGRANGIAN
FORMULA tS P,ERFORHEO ON ALL TABLES. TABLES HUST ALL BE OF SAME
FORMAT. REQUIRES 214 CELLS AND COMMON TO COMMON&"7 &K.

0704
0104

162FlFDOO

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

753NUEXPI

EXPONENTIAL INTEGRAL
COMPUTES EIIXI, EXPI-XI"EI/X/, OR Etlxl - LOG/X/. FORTRAN 2
SUHROUTINE VERSION OF NU EXPI ON RELOCATABLE BINARY CARDS
INCLUOtNG LOG AND E)(.P SUBROUTINES. 292&.19 COMMON STORAGE.

[8M

LIBRARY

AVAILABLE PRIOR TO JANUARY 1962

153NUEXPl

E XPONE NT I At INTEGRAL
COMPUTES EIIXI, EXP/-X/.El/XI, OR EIIXI - LOG/XI .. CLOSED
SUBROUTINE ON SAP SYMBOLIC CARDS. REQUIRES 192£.19 COMMON
STORAGE CELLS PLUS LOG AND EXP SUBROUTINES. ALSO EXISTS AS
FORTRAN 2- SUBROUTINE.

0704

P.ROGRAH

DIFFERENTIAL .EQUATION
.
.
SQLUTION OF N FIRST ORDER DIFFERENTIAL EQUATIONS USING THE
EULER-CAUCHY METHOD. PROV,ISIONS FOR ERROR CONTROL AND
PREDICTED STEP SIZE. REQUIRES 16B CELLS, 1 COHMON AND A BLOCK
OF 2N&1 CELLS.

0704
0104

0704

AVAILABLE PRIOR TO JANUARY 1962

149SCRAP

MUL TlPLE REGRESSION r. CORRELATION ANALYSIS PROGRAM.
PROVIDES MULTIPLE CORRELATION COEFFICIENTS, STANDARD ERROR OF
ESTIMATeS, MEANS, STANDARD DEVIATIONS. REGRESSION COEffICIENTS
AND T-TABLE ENTRIES FOR UP TO 39 INDEPENDENT VARIABLES WITH
AS MANY AS 400 OBSERVATIONS PER VARIABLE. REQUIRES 4K 104
WITH 1 DRUM AND AT LEAST It TAPES. CORR/944

0704

t:BM

776RWAV4F

AVAILABLE PRIOR TO JANUARY 1962

GENE RAL ANAL YS t S OF VAR 1 ANCE
TO COMPUTE AND PRINT ALL SUMS OF SQUARES ASSOCIATED
WITH FACTORIAL EXPERIMENTATION. All SUMS OF OBSERVATIONS
ENTERING INTO EACH SUM OF SQUARES ARE ALSO PRINTED.
POLYNOMIAL PARTITIONING OF MAIN EFFECT SUMS OF SQUARES
IS OPTIONAL.. ANy1:GEGREE OF FRACTIONAL REPLICATION CAN DE
HANDlED,AS WELL AS A HIGH DEGREE OF MULTIPLE REPLICATION.
CORRI B14

205

.......................................................................
IBM

0'104

0704

PROGRAM

liBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

716RWAV5F

IroATlN SQUARES ANALYSIS OF VARIANCE
TO CO"'.PUTE AND PRINT All SUMS OF SQUAR.ES ASSOCIATED
WITH LATlN SQUARES EXPERIMENTATION. SUMS OF OBSERVATION
OVER EACH LEVEL OF EACH FACTOR ARE ALSO PRINTEO.
POLYNOMIAL PARTITIONING IS OPTIONAL. A HIGH DEGREE OF
MULTlPlE REPLICATION IS PERMISSIBLE.

...................................................................
IBM

0704

181WH0042

AVAILABLE PRIOR TO JANUARY 1962

SELF LOADING TAPE' WRITING ROUTINE
V407
TO LOAD THE INFO'RMATION FROM A FORTRAN OBJECT PROGRAM
ONTO A MASTER PROGRAM TAPE. TO BE USED wITH ALL BUT THE
nECK fRHJ.CH MAKES UP THE FINAL RECORD. A CI1ECK SUM IS
COMPUTED FOR EACt. RECORDC
.

0704

7BIWH0043

7BBIBCFTD

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

78eIBCIFS

AV~ILABLE

PRIOR TO JANUARY 1962

COMBINES INDICES IN A FOURIER SREIES.
INPUT AND OUTPUT WILL BE IN CANONICAL REPRESENTATION.

0104

78BIBCIFT

AVAILABLE PRIOR TO JANUARY 1962

COMBINES INDICES IN A FOURIER TERM.
BOTH INPUT AND OUTPUT WIll BE IN THE CANONICAL REPRESENTATION

0704

788IBEFSI

AVAILABLE PRIOR TO JANUARY 1962

EVALUATES A FOURIER SERIES.
FOR GIVEN NUMERICAL VALUES OF ITS INDEPENDENT VARIABLES .. THE
SERIES TO BE EVALUATED MUST BE GIVEN IN EXPANDED
REPRESENTATlON AS DEFINED ON THE WRITE UP FOR ERFS1. TIMING
U321( & 101 CYCLES, WHERE K- THE NUMBER OF INDICES PER. TERM,
AND 13 THE NUMBER OF TERMS IN THE SERIES TO BE EVALUATED.

AVAILABLE PRIOR TO JANUARY 1962

182PFCR3

CORRElATION ANO REGRESSION ANALYSIS.
CALCULATIONS ARE PERFORMED AS SPECIFrED BY A CONTROL CARD.
OPTIONAL OUTPUT FORMAT. PROVISIONS ARE MADE FOR PROGRAM INTERRUPTION AND RESTART. ACDITIONAL COMPUTATION MAY BE INTRODUCED. MAXIMUM NUMBER OF VARIABLES IS 110 ISINGle PRECI OR BO
/DOUBLE PREC/. NUMBER OF OBSERVATIONS IS 2"28-1.

0704

LIBRARY

AVAILABLE PRIOR TO JANUARY 1962

SElF LOADING TAPE WRITING ROUTINE
V407
TO LOAD THE INFORMATION FROM A FORTRAN OBJECT PROGRAM
ONTO A MASTER PROGRAM TAPEC TO BE USED WIT& THE DeCK
WHICH MAKES UP THE FINAL RECORD.

0704

PROGRAM

CONVERTS A FOURIER SERIES TERM TO BCD FORM.
USING TWO BINARY WORDS AND BCD WORD AS INPUT AND SIX BCD
WORDS AS' OUTPUT.

0704
0104

0704

AVAILABLE PRIOR TO JANUARY 1962

7B4GECDS1

COLUMN BIN.eRY DISASSEMBLY PROGRAM
THIS PROGRAM WILL READ A COLUMN BINARY ABSOLUTE
OR RELOCATABLE DeCK AND TRANSLATE THE INFORMATION
BACK TO SYMBOLIC FORM. SEE Ge RDS1

0704

7B8IBERFS

AVAILABLE PRIOR TO JANUARY 1962

EXPANDS THE REPRESENTATION OF A FOURIER SERIES.
WHICH IS GIVEN IN CANONICAL REPRESENTATION. IN. THE EXPANDED
REPRESENTATION THE fIRST THREE WORD LOCATIONS CONTAIN THE
NUMBER Of INDICES, THE NUt'BER OF SINE TERMS AND THE HUMBER
OF COSINE TER"'S RESPECTIVELY, SUCCEEDING LOCATIONS
CONTAIN REPRESENTATIONS OF THE TERMS OF THE SERIES IN THE
SAME ORDER AS IN THE GIVEN CANONICAL SERIES. TIMING NOT
OVER U6lK&1:8DT & 130 CYCLES, WHERE K3 THE NUMBER OF
INDICES PER TERMS AND T3 THE NUMBER OF 04013005 TERMS
IN THE SERIES.

0104

7BBtBFIR2

AVAILABLE PRIOR TO JANUARY 1962

INTERPRETIVE ROUTINE.
WHICH FACIliTATES THE EXECUTlOt..l OF A SEQUENCE OF FOURIER
SERIES OPERATIONS.

IBM

0704

PROGRAM

liBRARY

ABSTRACT

• • • • • • • • tf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ..

010.4

7B4GERDS1

AVAILABLE PRIOR TO JANUARY 1962

ROW BINARY DISASSEMBLY PROGRAM
THIS PROGRAM WILL READ A ROW BINARY ABSOLUTE OR RELOCATABLE
DECK wITH BINARY TRANS n ION-CORRECTION CARDS AND
TRAr-.SLATE THE INFORMATION BACK TO SYMBOLIC
FOR'" WHICH WOULD BE ACCEPTABLE TO SAP 3-7.
AN OPTIONAL FORM OF OUTPUT IS A LISTING SIMILAR
TO THAT PRODUCED BY THE SAP 3-7 ASSEMBLER

...........................................................................
IBM

0704

785GEGERR

AVAILABLE PRIOR TO JANUARY 1962

ERROR PROCEOURE FOR FORTRAN II
THE INCORPORATION Of THE STANDARD ERROR PROCEDURE fOR
FORTRAN 11 INVOLVED THE WRITING Of AN ERROR SUBROUTINE AND A
REVIS tON OF THE LIBRARY SUBROUTINES TO MAKE USE OF ERROR
RETUR/ljS.. FORTRAN LIBRARV SUBROUTINES WERE MOOIF}[D, AND IN
SOME CASES REPLACED BY BETTER ROUTINES.
CORRI 857

0104

7B7PKMIN2

AVAILABLE PRIOR TO JANUARY 1962

AODS' OR SUBTRACTS TWO FOURIER SERIES ..
IN CANONICAL REPRESENTATION OBTAINING AS THE RESULT A THIRD
FOURIER SERIES IN CANONICAL REPRESENTATION.

0104

788IBATFS

7881BIFS1

AVAILABLE PRIOR TO JANUARY 1962

78BIBMFS2

AVAILABLE PRIOR TO JANUARY 1962

0704

78BIBPDFS

COMPUTES THE
IN CANONICAL
OBTAINING AS
TIMING 2.040

AVAILABLE PRIOR TO JANUARY 1962

PARTIAL DERIVATIVE OF A FOURIER SERIES.
REPRESENTATI.ON WITH RESPECT TO ANY VARIABLE,
A RESULT A SERIES IN CANONICAL REPRESENTATION.
t. .. 7S6T MILLISECONDS MAXIMUM.

18BIBPUFS

AVAILABLE PRIOR TO JANUARY 1962

PUNCHES A FOURIER SERIES ONTO .BINARY RELOCATABLE CARDS ..
CANONICAL REPRESENTATION IS USED, BUT NO RESTRICTIONS ARE
IMPOSED ON THE INDEX VECTORS. TIMING 100 CARDS PER 1'IINUTE
MAXIMUM ..

18BIBRFST

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

ADDS A TERM TO A FOURIER SERIES.
II\) CANONtCAL REPRESENTATION 08TAINING AS THE RESULT A FOURIER
SERIES IN CANONICAL REPRESENTATION.

206

AVAILABLE PRIOR TO JANUARY 1962

MULTIPLIES TWO FOURI.ER SERIES.
IN CANONICAL REPRESENTATION OBTAINING AS THE RESUL T A THIRD
SERIES IN CANONICAL REPRESENTATION. REQUIRES THE SUBROUTINE
ATFS1 ..

0704
0704

ABSTRACT

INTEGRATES A FOURIER SERIES IN CANONICAL REPRESENTATION
REQUIRES AN UNINCORPORATED SUBROUTINE TO DETERMINE THE
SPEC IAl FUNCTION F OF THE INDICES.

070r.
7BBIBASFS

7B818GFLl

LIBRARY

AVAILABLE PRIOR TO JANUARY 1962

COMPUTATION OF A MINIMUM TWD-LEVEL AND-OR SWITCHING
C I RCUT GENERATES A MIN IMUM TWO-LEVEL SW ITCH ING C IRCUT WHERE
ONE LEVEL IS All ANDS AND THE OTHER LEVel IS All DRS.
DONT-CARE CONDITIONS ANI"> MULTIPLE OUTPUT PROBLEMS ARE
PERIHTTED. CAN BE DIRECTLY APPLIED TO THE MINIMIZATION OF A
BOOLEAN FUNCTION IN NORMAL FORM, AND TO THE MINIMIZATION
OF TOPOLOGICAL COVERS OF CUBICAL COMPLEXES. PROGRAM MAY BE
RUN ON A MACHINE WITH 2 OR 4 137S OR A 730 MENORY FRAME.
IT ALSO REQUIRES SIX TAPES AND FOUR LOGICAL DRUMS. CORRI BB4

0104

PROGRAM

GIVEN A FOURIER HALF-SERIES IN CANONICAL REPRESENTATION
GFll SEARCHES FOR. AND CONVERTS TO BCD THE NEXT TWO TERMS
IN OROER OF MAGNITUDE OF COEFFICIENTS, THE LARGEST
COEFFICIENT FIRST THE OUTPUT IS 12 BCD WORDS.

0704
0704

0704

READS, WITH CHECKING, A FOURIER SERIES FROM BINARY TAPE
INTO CORE STORAGE, IN CANONICAL REPRESENTATION.

........................................................................
IBM

0704

0704

PROGRAM

LIBRARY

1BBIBSFSI

ABSTRACT

AVAILABLE PH10R TO JANUARY 1962

SEARCH A FOURIER SERIES IN CANONICAL REPRESENTATlO"l.
FOR THE'COEFFICIENT Of A SPECIFIED TERM. TIMING IF P IS THE
NUMBER OF TERr-'S, SINE OR COSINE, OF 11"E TYPE ~EING LOOKED FOR
IN THE SERIES, EX[CUTION TIME DOES NOT EXCEt:D 5% SP CYCLES.

IB~

0704

7BOIBSPFI

PltOGRAM

LIBRARY

004RWMIN

ABSTRACT

B - 704

AVAILABLE PRIOR TO JANUARY

I'J62

MINIMIZATION ROUTINE FOR A FUNCTION OF N VARIABUS
LOCATES THE MINIMUN OF A FUNCTION OF N VARIABLES
REQUIRES 272 CELLS

0704
0704

0704

BOGIBEXDI

AVAILABLE PRIOR TO JANUARY 19(,Z

AVAILABLE PRIOR TO JANUARY 1962

UNPACKS THE INDICES FROM FOURIER'SERIlS INDEX wDRUS,
CONVERTS THEM TO NOR"IAllHO FLOATIJljG-POINT FORM, AND
CC,..PUTE;S 1 t. KR, WHERE:. I Mm K AR!:: Tilt: INDICES. ANO B 15
AN ARl!ITRARY PARM~ETER SPFI2 IS DESIGNED FOR USE AS A
SUBROUTINE OF ISFl.

nOUBLE: PRECI,SION FLOATING POI.'H EXPONlNTIAL SUBROUTINE
X BETViEEN -SS AND CBB. 18.67 MS FOR EXI'/x/. 1".08 MS rop..
EXP/-X/, 148 CELLS, LAST 8 ERASAllLE

0704

S07GOAOll

AVAILABLE PltiOR TO JANUARY 1%2

FORTRAN I I DOUBLE-PRECIS ION FLOhT IJljG-PO INT PACKAGE
0704

AVAILABLE PRIOR TO JANUARY 1962

788IBSPf2

COMPUTES A SPfCIAL FUNCTION F OF THE INOICES.
IN ONE TERM OF A FOURIER SERI(S. USES UI'FI AS A SUBROUTINE.

0704

AVAILABLE PRIOR TO JANUARY 1962

7881BSPSI

SPLI TS A FOURIER SERIES.
WITH THE FOLLOWING RESULT IHTH 51 AS THE INPUT SERIES, THE
OUTPUT CONSISTS OF 52 WHICH ARE THOSE TERMS OF 51 WHICH ARE
INDEPENDENT OF THETA, AND 53 WHICH IS THE RESULT OF SETTING
THE INDEX OF THETA TO lERO IN EACH TERM OF S1 AND 52 ..

0704

B09PFTESI

AVAILABLE PRIOR TO JANUARY 1962

FORTRAN INPUT/OUTPUT TRANSFORI1ATIUN
THIS SUBROUTINE PERMITS CHANGING ANY I/O STAH:MENT/SI FROM
ON LINE TO OFF LINE AND/OR VICE VE~SA.
RECUIKES 55 OCTAL STORAGE CELLSt) CO,..J.10N.

0704

812GPHGP

hVAILAliLE PRIOR TO JANUARY 1962

EXTE~T ION OF FORTRAN 2 SOURCE LANGUAGE
TO INCLUDE AIWREVIATlONS AND MACHINE LANGUAGE INSTRUCTIONS

AVAILII.BLE PRIOR TO JANUARY 1962

78SIBUPFI

UNPACKS UP TO 6 INOICES FROM AN INDEX WORD';
OF A FOURIER SERIES IN CANONICAL REPRESENTATION AND CONVERTS
THEM TO NORMALIZED FLOATING POINT NUMBERS.

0704

'0704

0704

815PFTNI'1

AVAILABLE PRIOR TO JANUARY 1%2

NON-PARAMETRICAL TEST OF OISTRIBUTIONS.
T\.O SECUENCES OF DATA REING GIVEN COMING FROM
TESTS FOR THE IDENTITY OF THESE PARENT DISTRIBUTIONS.

AVAILABLE PRIOR TO JANUARY 1962

7881BWFST

WRITES A FOURIER SERIES AS ONE BINARY RECORD ON TAPE.
WITH LOGICAL CHECK SUM AS THE LAST WORD ON THE RECORD.

0704

B17GIFPSR

AVAILABLE PRIOR TO JANUARY 1962

FLOATING-POINT SQU.'.RE-RQOT SUBROUTINE
COMPUTES THE SQUARE ROOT OF A FLOATING-POINT NUMBER SITUATEll
IN THt: flC AI\D Me REGISTERS.

.....................................................................
IBM

0704
IBM

070/f

0704

PROGRA~

788lBWFSI

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

CONVERTS A FOURIER SERIES IN CANONICAL REPRESENTATION.
TO BCD AND WRITES THE RCD SREIES ON ANY DESIRED TAPE.
PRINTING IS OPTIONAL.

0704

189IBMll

AVAILABLE PRIOR TO JANUARY 1962

MACHINE LOADING PROBLEM OF LINEAR PROGRAMMING
SOLVES A GENERALlZArtON Of THE TRANSPORTATION PROBLEM
I.N wHICH EACH TERM OF ROW ANDIOR COLUMN SUMS
MAY BE WEIGHTED BY ARBITRARY NON-UNITARY COEFFICIENTS ..
SAP LISTING DISTRIBUTED IN S.D. 883

0704

791TVME05

AVAILABLE PRIOR TO JANUARY 1962

OPTIMIZED TAPE READ FOR FORMAT 12F6.0
THIS FORTRAN I [ SUBROUTINE READS FROM TAPE t. CONVERTS, i\T
0f111MIZEO SPEED, DATA PUNCHEn IN THE FORMAT 12F6.0.
11
ALLO .... S RE'ADING AND CONVERSION TO PROCEED AT ESSENTIALLY THE
SAME SPlen NORMHLY REQUIRED FOR READING ALONE, THUS
EllMINATING THE STOP'-START TlME AT INTER-RECORD GAPS.

0704

794RWNP3F

AVAILABLE PRIOR TO JANUARY 1962

FLOATING POINT INI VARIATE PROBABILITY INTEGRAL
OBTAINS THE PROBABILITY INTEGRAL FOR N/2 LESS THAN OR
EOUAL N LESS THAN OR EQUAL 51 VARIATES OF Tt'ENTS MAY BE LOGGED ON OUTPUT TAPE 2.

10M

0104

0704

PROGRAM

830MIOCTN

8370R.NLLS

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

OCTAL CORRECTION CARD REACER
~'IOCTI~-A 70'f SAP-COOED FORTRAN II SUBPROGRAM TO
LGAC RELoeATABLE OR ABSOLUTE OCTAL CORRECT ION
CA~DS AND COMMENT CARDS.
CORRECTIONS AND
CO!-'I-'ENTS MAY DE LOGGED ON-L INE.

0704

8310ROUNL

810tJISLAM

AVAILABLE PRIOR TO JANUARY 1962

FLOATING-POINT OVERFLOW/UNDERFLOW ROUTINE FOR NllS ..
OR NllS MUST BE USED.PR1NfS ON-LINE THE lOCATION OF THE ORDER
CAUSING FLOAT·ING-POINT OVERflOW OR UNDERFlOW. SETS OVERFLOWED
REGISTERS TO 35 BINARY ONES WITH THE CORRECT SIGN AND UNDERFLOWED REGISTERS TO lERO.USES 60 LOCATIONS.

0704

8370RSCNL

AVAILABLE PRIOR TO JANUARY 1962

SINE AND COSINE FUNCTIONS FOR NLlS.
OR NLlS MUST BE USEO.YODIFIED VERSION OF IB SINl.USES 104
LOCATIONS IN LOWER MEMORY.
CeRR/ 838

...................................................................
IB.M

0704

0704

AROGRAM

83 lORTOS

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARV 1962

STUDENTS T AT .05 LEVEL
COMPUTES STUDENTS r AT THE .05 LEVEl FOR A FIXED OR FLOATING
paINT ARGUMENT. TIMING - la6 MS. USES 15 LOCATIONS IN LOWER
MEMORY.

0704
0704

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

830MI.NOLO

PRINT ass LOADER LJIAGNOSrICS
,"'INCLC-A 704 SAP-CODEf) FORTRAN II SUBPROGRAM TO
SUPPLY ON-LINE OIAGNOSTIC COMMENTS ON THE
ACTIVATEO ERROR STOPS OF MII'SS2 LOAOER.

0704

0704

NON-LINEAR LEAST SQUARES ..
ITERATES FOR THE LEA'Sf SQUARES ESTIMATES OF PARAMETERS WHEN
DATA ARE BEING FITTED WITH NON-LINEAR FUNCTIONS. THE USER
PROVIDES A PROGRAM TO EVALUATE THE FUNCTION AND ITS DERIVATIVES. THE VARIANCE OF ANY FUNCTION OF THE PARAMETERS CAN BE
ESTIHATEDa
.

8370R.)('1Nl

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

rOltTRAN OVERlCADER SUBPROGRAM
~lISLAI-'-A 704 SAP-CODED SUBPROGRAM THAT ACTS AS AN
OVERLCADER FOR RUNNI.NG PROGRAMS THAT EXCEED CORE
1-1C:I"CRY SIZE. CORR. oIST. 866

EXPONENTIAL/J/ROUTINE FOR NlLS.
OR NllS MUST BE USED.COMPUTES E TO X, 10 TO X, lOGE X,
LOGIO X, AND A TO X.INCLUDES A MODIFIED VERSION OF IB FXP.
THE lOG ROUTINE RETURNS AT LEAST 7 SIGNIFICANT DIGITS. TIMING
FOR LOGE X IS 2.1 MS. THE PACKAGE USES ISS LOCATIONS IN LOWER
M[~ORY.

070/,

83QMJSTPF

AVA ILA8LE PR lOR TO JANUARY 1962
0704

W~ITE BSS LOADER STORAGE ~AP
!'-1ISTPF-A 704 SAP-COOED FORTRAN II SUBPROGRAM
THAT hRITES ON TAPE 2 THE CORE MHlORY STORAGE MAP
FOR~EC HY THE MIBSS2 LOADER.

0104
0704

fJ30MISTPN

AVAILABLE P,RIOR TO JANUARY 1962

WJUTf. CORE I~AGE ON TAPE
MI WTPE-A 704 SAP-CODED FORTRAN I I SUBPROGRAM
TIIAT ",RITES THE CONTENTS OF CORE MEMORY AS A
SING(E SElF-LOADING RECORD ON TAPE 4.

B32BECPK

AVAILABLE PRIOR TO JANUARY 1962

COMPLEX NU!>'BER INTERPRETIVE SYSTEM /FLOATING POINT/
A n.O-ADDRESS COMPLEX NUMBER INTERPRETIVE SYSTEM OESIGNED
TO ~ORK wITHIN SAP PROGRA~S~
IT OFFERS A TOTAL OF TWELVE
ALGEBRAIC OPERATIONS. FOUR CONTROL OPERATIONS AND THREE
TRACE OPERATIONS.
LNOEXING IS AVAILABLE BUT IS LIMITED
TO CNE:. I NOEX REG I S fER.

208

AVAILABLE PRIOR TO JANUARY 1962

B44r-:EGPll

AVAILABLE PRIOR TO JANUARY 1962

GENERAL PROGRAM LOADER
S CARD SELF-LOADING PROGRAM WHICH LOAllS BINARY, OCTAL
AND TRANSFER CARDS, ANY OF WHICH MAY BE EITHER
Af\SCUTE OR RElOCATABLE..
USES 167 OCTAL LOCATIONS.
LOCATION IN CORE IS DETERMINED AT ASSEMBLY TIME.

0704
0704

843QRICBH

I"ICRH'ENT COLUMN BINARY I~AGE OF HOLLERITH NUMBER
ADDS 1 TO 3-DtGIT HOL. NO.
IMAGE IN 1 COLUMN-BINARY WORD.

070 /,
830MIWTPE

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

WRITE B$S LOADER STORAGE I-'AP
MISTPf',-A 104 SAP-COOED FOiHRAN II SUBPROGRAM
THAT PRINTS ON-LINE THE CORE MEMORY STORAGE MAP
fORf.'Eo BY THE ~,IBSS2 LOADER.

010lt

8430RClK

RourlNES TO READ A CHROND-LOG CLOCK VIA 116·ECHO ENTRY
TIME IN BCD AND/OR BINARY. DATE FROM SWITCHES, OPTIONAL ..

B4BAR8SS2

AVAILABLE PRIOR TO JANUARY 1962

FN II BINARY SYMBOLIC SUBROUTINE LOADER WITH Fl.PT .OFl.
LOADS FORTRAN I I PROGRAMS WITH SAME STOPS AS NORMAL ass
ass LOADER. LOADS OCTAL CORRECTIONS, HW WORDS PER CARD.
ENTERS FLOATING POINT TRAP AND WIll STOP ON OVERFlOW,BUT
WILL CORRECT OFFENDING REGISTER/S/ UPON UNDERFLOW.

IBM

0704

0704

PROGRAM

LIBRARY

ABSTRACT

AVAILAllLE PRIOR TO JANUARY 1962

BttOARCS.l1

FN II SINE-COSINE INTEGRAL SUBROUTINE
COMPUTES INTEGRAL /lSIN/YI/Y/.DVI FROM a TO x AND INTEGRAL
/lCOS/VI/V/.Ov/ FROM INFINITY TO x, FOR X GOING FROM MINUS
TO PLUS INFINITY .. REOUIRES AR TOR 1. USES 606 ~ORDS.

0704

AVAILABLE PRIOR TO JANUARY 1962

B48AR.DHP1

FN I t FLOATING POINT OR INTEGER DUHP SUBROUT INE
OUMPS BY BLOCK OR SINGLE VARIABLES IN EITHER FLOATING POINT
OR INTEGER FORMAT .. EACH DUHP WILL BE IDENTIFIED ..
USES 220 WORDS OF STORAGE.

0704

AVAILABLE PRIOR TO JANUARY 1962

84BARFERl

FN 11 ERROR WALK-BACK SUBROUTINE
WRITES ON TAPE,CONSOLE STATUS, WHERE ERROR OCCURED BY
SUBROUTINE NAME AND FORMULA NUMBERS. WILL WALK BACK
TO SUPERPROGRAM. REQUIRES 276 WORDS OF STORAGE.
CORRI 905

0704

IBM

01D4

PROGRAM

LIBRARY

849MIOll\T

ABSTRACT

B - 704

AVAILABLE PRIOR TO JANUAR'I' 1962

OIATOl"IC MOLECULAR INTEGRAL PROGRAM
PROGRAM CALCULATES ANY OR ALL 1 AND 2 ELECTRON 1
AND 2 CENTER INTEGRALS BI;H~EEN SETS OF BASIS
FUNCTIONS BY NUMERICAL INTEGRATION USING THE
AARNETT-COULSON METHOD FOR THE 2 CENTER INTEGRALS. THE BASIS SET MAY CONSIST OF UP TO 20
FUNCTIONS PER CENTER. A FUNCTION CONSISTS OF A
LlNE,1R CO"'SLNhTION OF SLATER ORBITALS 116 TERMS
MAXIMUM/. INDICATIONS OF INTEGRAL AND SUM CONV[RGENCE ARE GIVEN .. PUNCHED/PRINTED/BINARY OUTPUT.

0104

85DBSORTH

AVAILABLE PRIOR TO JANUARY 1962

GENERAL ORTHONORMALlZING SUBROUTINE.
A.. ORTHONORMAlllES A SET OF VECTORS WITH RESPECT TO A GENERAL
INNE:R PRODUCT ..
B.. APPROXIMATES A GIVEN FUNCTION BY A
LINEAR COMBINATION OF ARBITRARY FUNCTIONS DEFINED NUMERICALLY
BY A SET OF VALUES. C .. FINDS BEST /LEAST SQUAREI POLYNOMIAL
FIT TO GIVEN FUNCTIONS.
D. DETERMINES ORTHONORMAL EXPANSIONS
OF FU,,"CTIONS .. E. FINDS BEST SOLUTION llN L .. S.S.I TO A SYSTEM
OF ,.. LINEAR EQUATIONS IN N UNKNOWNS .. /N LESS THAN OR ECUAL TO
MI. CDDE OCCUPIES 1111 CELLS AND USES 15 COMMON CELLS.
1221

0104

BS3ME020a

AVAILABLE PRIOR TO JANUARY 1962

FORTRAN OUTPUT MERGE PROGRAM
PRODUCES A SAP-LIKE L1SrtNG FROM THE BINARY AND BCD
INFQR,..ATION PROOUCEO BY A SUCCESSFUL FORTRAN SINGLE
COMPILATI,O~..
USES LOAD CARD SEQUENCE W HtCH TERMINATES
FORTRAN COMPILATION.

AVAILABLE PRIOR TO JANUARY 1962

848ARHEOI

PAGE HEADING OUTPUT FORTRAN 11 SUBROUTINE
WIll READ A HEADING CARD FRDM CARDS DR TAPE,UNDER SENSE
SWITCH CONTROL, MAY RECEl'JE LINE FROM AR INS 2 OR AR SYM 1.
WIll PRINT LINE. WILL WRITE LINE DN TAPE, THEN UNDER SENSE
SWITCH CONTROl,MAY ALSO PRINT LINE. REQUIRED BY ElTHER
AR INS 2 OR AR SYM 1. REQUIRES AR R/L 1. USES 163 WORDS OF
STORAGE PLUS SUBROUTINE.

DI04

AVAILABLE PRIOR TO JANUARY 1962

B48ARI~S2

856CVVIPE

AVAILABLE PRIOR TO JANUARY 1962

VARIABLE INFOR,..,ATION PROCESSING PACKAGE ECUlvALENCE
SAP ECUIVAlENCE DECK TO BE ASSEMBLED WITH SAP ROUTINES USING
CV-VIPP.

0704
0704

0704

AVAILABLE PRIOR TO JANUARY 1962

B48ARGENI

FN 11 AREA SET GENERATOR SUBROUTINE.
CHANGES ENTRY SET-UP TO HIGH-SPEED PROGRAM FOR QUICK LOOP
TO STORE A GIVEN VALUE IN SEVERAL EQUAL ARRAYS.
REQUIRES 35 WORDS OF STORAG(.

0104

.......................................................

856CVVIPP

AVAILABLE PRIOR TO JANUARY 1962

SINGLE DIMENSION SYMBOLIC FORTRAN II INPUT SUBROUTINE
DATA FROM CARDS OR rAPE PER SENSE swITCH OR LITE..
STORES
FLOATING OR FIXED POINT AND INTEGERS PER SYMBOL GIVEN IN
CALL STAHMENT. WILL GENERATE TABLES OF FLOATING POINT OR
INTEGER NUMBERS.
WILL SET A VECTOR TO A GIVEN FLOATING
POINT OR INTEGER VALUE .. WILL READ A 12-COL.LINE OF TEXT FOR
HEADING PAGES OF OUTPUT..
REQUIRES AR HED 1 FOR ouTPUT OF
HEADING LINE .. REQUIRES 492 WORDS PLUS SUBROUTINES.

VhRIAI3LE INFOR""/iTION PRDCESSING PACKAGE
GENERAL PURPOSE DATA PROCESSING SUBROUTINE SYSTEM FOR 104
1 REAC-WRITE I3UFFEREO TAPES
9 TAPE CONTROL COUNTS
2 VARIABLE LENGTH ITE1"S
10 TAPE SENTINELS
VARIABLE PARTS Of ITEtlS
11 MULTI REEL TAPE LOGIC
POSITION TAPES BY RCD OR FILE
12 PRINT ON-LINECHANGE COLLATING SECUENCE
13 DECIMAL SHIFTING
\oICRD BLOCK AND FIELD MOVES
14 SEQUENCE WORDS
BCD AND BIN CONVERSIONS
15 TABLE LOOKUP
DRUI-l USE OPTIONAL 16 FAVORABLE RUN TIME
CORRI 925

IBM

tBM

0104

0704

PROGRAM

848ARNXNl

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

FN II SIMULTANEOUS LINEAR EQUATION SOLUTION SUBROUTINE
SOLVES N • N SYSTEM OF SI~ULTANEOUS LINEAR EQUATtO~S BY
PROCESS OF DIAGONALIl,ATION. USES 244 WORDS OF STORAGE

0104

648ARPLNl

AVAILABLE PRIOR TO JANUARY 1962

FN 11 NTH DEGREE LEAST SQU COEF COMPUTATION SUBROUTINE
COMPUTES COEFFICIENTS OF NTH DEGREE POLYNOMIAL BY LEAST
SCUARES METHOD. MINIMIZING SUM OF SQUARES OF DEVIATIONS FROM
AVERAGE. USES 330 WORDS OF STORAGE.

D704

848ARR/ll

AVAILABLE PRIOR TO JANUARY 1962

FORTRAN II IRTNJ AND lLEVI WITH FLOATING TRAP TEST
THE STANDARD FORTRAN II IRTNI AND ILEVI ROUTINES HAVE BEEN
REARRANGED TO RESTORE INDEX; REGISTERS AND RESET FLOATING
POINT TRAP LF IT WAS ON. REQUIRES 9B WORDS PLUS SUBROUTINES

0104

848ARSYMI

AVAILABLE PRIOR TO JANUARY 1962

MULTI-DIMENSION SYMBOLIC FORTRAN II INPUT SUBROUTINE
DATA FROM CARD OR! TAPE PER SENSE SWnCH OR L [TE .. STORES
FLOATING OR FIXED POINT AND INTEGERS PER SYMBOL GIVEN IN
CALL'STATEMENT .. WILL GENERATE TABLES OF flOATING POINT OR
INTEGER NUMBERS. WILL SET A VECTOR TO A GIVEN FLOATING POINT
OR INTEGER VALUE .. WILL LOAD ALL VALUES ROW-WISE FOR MULTISUBSCRIPT REFERENCES ON INPUT RECORDS. WIll READ A 72- COLUMN
HEADING LlNE AND STORE IT IN AR HEO 1 FOR LATER OUTPUT TITLE
REQUIRE AR HED 1 FOR HEADING OUTPUT AND AR R/L I FOR CONSOLE
PRESERVAlT10N .. REQUIRES 171 WORDS EXClUDING SUBROUTINES

D704

848ARTORI

AVAILABLE PRIOR TO JANUARY 1962

FN II FACTORIAL COMPUTATION SUBROUTINE
COMPUTES IN FACTORIALI, GIVEN N AS A FORTRAN INTEGER.
REQUIRED BY AR CSI 1. USES SO WORDS OF STORAGE

0704

0704

PROGRAM

85BGSS41Z

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

CONTINUED FRACTIONS CURVE FITTING AND INTERPOLATION
FROM A SET OF GIVEN POINTS DN A CURVE,THIS PROGRAM CALCULATES
TWO ec:UATIONS PASSING EXACTLY THROUGH THE POINTS .. ONE EQUATION
BY THE CONTINUED FRACTION METHOD, AND ONE EQUATION BY THE
nlVIDED DIFFERENCE METHOD .. ALSO, THE PROGRAM INTERPOLATES lOR
EXTRAPOLATESI TkO SETS OF Y VAlUES lONE FOR EACH OF THE TWO
ECUATIONS CALCULATEDI FOR A GIVEN SET OF X VALUES.

0104

859GS1l65

AVAILABLE PRIOR TO JANUARY 1962

LEAST SQUARES RATIONAL FUNCTION CURVE FITTING
FROM A SET OF POINTS ON A CURVE, THIS PROGRAM MAKES A SEARCH
FOR THE FUNCTIONS WHICH FIT THE CURVE CLOSELY, USING A LEAST
SQUARES METHOD. THE RATIONAL FUNCTIONS AND POLYNOMIALS IWHEN
THE DENOMINATOR-I .. DI FITTED TO THE CURVE ARE OF THE FOLLOWING
FORtI.-Y-1 AICA2.X&A).X •• 2r.A4.Xu3r. ..... 1 I 11.0£.Bl·Xr.BZ·X··Z ••• 1

01D4

861ERTSDA

AVAILABLE PRIOR TO JANUARY 1962

TIME SERIES OECOMPOSITION AND ADJUSTMENT
FORTRAN PROGRAM TO ADJUST SEASONAL AND IRREGULAR TIME SERIES
TO A FORM Tt1AT SHOWS PRIMARILY THE TREND-CYCLICAL MOVEMENTS.
SEASONAL FACTORS, IRREGULAR FLUCTUATIONS AND MANY SUMMARY
MEASURES USEFUL IN TIME SERIES ANAllYSIS ARE COMPUTED IN THE
PROCESS.
BASICALLY ADAPTATION OF TENNESSEE VALLEY AUTHORiTY
PROGRAM lTV TSDAI TO 8K 704..
PROGRAM ALSO EXTENDED TO PERMIT
III ADJUSTING FOR DELIVERY DAYS AND 121 FITTING LEAST SQUARES
TREND liNE AS FORECASTING AID.

0704

863RSMOOI

AVA I LABLE pR 1 OR TO J ANUAR Y 1962

FORTRAN MATHEMATICAL PROGRAMMING SYSTEM ONE
A SYSTEM OF. .JtOUTINfS FOR LINEAR PROGRAMMING WRITTEN ALMOST
ENTIRELY IN THE FORTRAN LANGUAGEC THE REVISED TIMPLEX
METHOD WITH EXPLICIT INVERSE IS USED, WITH SINGLE-OR DOUBLE
PRECISION OPTION.
THE PREOENT OBJECT PROGRAM WAS COMPILED
FOR 12K AND HANDLES PROBLEMS HAVING UP TO 97 EQUATIONS,
299 VARIABLES, AND Z499 NON-ZERO MATRIX ENTRIES..
SPECIAL
FEATURES INCLUDE OUTPUT flEXIBILITY, REINVERSION, INTERRUPT
ABILITY, USE OF SOSTEM TAPET AND BATCr. RUNNING4
SMPHASIS
WAS PLACED ON EASE .'N BINARY
CAIWS • WILL NCT LOAD ROW RINARY CARDS. PROGRAM COIlRECTIONS
NlVj PROGRAM. BREAKPOINT DEFINlTIO,'JS AND CO"l/"'ON STORAGE
'{EASSIGNMENTS CAN BE MAnE BY RELOCATAnu; OR ABSOLUTE OCTAL
CORR[lTOR CARrs. USES 2 /tO LOCATIONS.

0701;

91JNCKRFP

AVAILABLE PIlIOH TO JANUAP,Y 1962

KwiC R[PORT FOR PRINTING CR PUNCHING
fH:ADS SORTED KWIC OUTPUT FROM NC KSP2 AND WRIT[S A TAPE
TO PUNCH OR PRINT. THE TAPE IS IN THE SAME FOR~AT AS THE
ORIGIr-.AL KWLC OUTPUT.

AVAILABLE PRIOR TO JANUARY 1962

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

ExTENDED FORTRAN 2 BSS LOADER
AN ExTENDED BINARY SYMBOLIC SUBROUTINE LOADER WHICH,
IN ADDITION TO THE FEATURES OF THE FORTRAN 2 BSS
LOAGER, PROVIDES OPTIONS FOR THE FOllOWING
/A/\ A 3 ChRO ....,ODIFICi\fION TO ,",.[GPLl, THE GENERAL
P(\(lC;~A~. LC"\Dfft,
TO FACILITATE ~E:NI:RATION UF SFLF-LOAOING
PRUGRA .... TAPES ..
USE:.S 21 DCThl lOCATIO~~S DHtECTLY l3EHIND

0704

AVAILABLE PRIOR TO JMWARY 1962

TO WRITE 2 OI~ENSIONAl ARRAY BINARY INFO
TO r;RITE TwO-DIMENSIONAL ARRAY OF BINARY
ThPE.PRECEDED BY TWO INTEGERS GIVING THE
AND COLUMNS AND FOLLOWED BY A CHECK SWI ..
PftOGRAM NU RTB REAOS THE BINARV TAPE ANU

0704

0704

909MPMAPM

B - 704

AASTRACT

AVAILABLE PRIOR TO JANUARY 1962

FClnRAN TAPE WRITE PROGRAtJ.
FOTh \
DECIMAL·ONTO TAPE FOR TAPE-CONTROllED PRINTER. pROVISION IS
MADE fOR RESTORATION OF CaREt SELECTION OF OUTPUT TAPE,
IOENTIFICATI.ON OF OUTPUT, AND STACKINGIJ: SK9PS l5RO BLOCKS ..
FULL TAPE SPEED .. BINARY DECK INPUT AND CONSOLE CONTROL.

0704

937ERCONV

AVAILABLE PRIOR TO JANUAR¥ 1962

LP/90 TO SCROL 704 INPUT' CONVERTER
PROGRAM CONVERTS SHARE: STANDARD LINEAR PROGRAMMING
INPUT DATA FROM lP/90 FORMAT TO SCROL 704 FORMAT.
lP/90 FORMAT PERMITS THE USE OF 6 CHARACTER ROW
MNEMONICS AND eliMINATES THE NECESSITY OF SPECIFYING
SLACK VECTORS IN THE INITIAL BASIS AND IN THE MATRIX.

0704

9581o'IHS

AVAILABLE PRIOR TO JANUARY 1952

704 MACRO-SAP ASSEMBLER ..
A FASTER VERSION OF UASAP3-7 THAT PROVIOES A
FASTER AND MORE FLEXIBLE ASSEMBLER. INCLUDES OF
MACRO INSTRUCTION FACILITIES, CONDITIONAL
COMPILATION, AND SyMBOL REDEFINITION ..

AVAfLABLE PRIOR TO JANUARY 1962

DOUBLE PRECISION SIN-COS ROUTINE
CO",pUTES A DOURLE PRECISION flOATING POINT SINE OR COSINE
OF A DOUBLE PRECISION FLOATING POINT ARGUMENT .. THE ARGUMENT
MUST BE IN RhOIANS. 291 STORAGE CEllS t. 26 COM~lON ..

0704

IBM

..... * ••••••••••••• * ............ * •• " •••••••••••••••••••••••••••••••

LIBRARY

0704

959MI.CNO

AVAILABLE PRIOR TO JANUARY 1962

A CONDENSER ROUTINE FOR SYMBOLIC INFORMATION ..
A CONDENSED SAP LIBRARY TAPE IS PREPARED FOR USE
WITH MJMS .. SyMBOLIC INSTRUCTIONS ARE COMPRESSED,
REMARKS REMOVED, AND PACKED INTO A FIXED LENGTH
OUTPUT BLOCK. THE ROUTINES ON THE CONDENSED
lIBRARY TAPE .ARE STORED AT ABOUT 20 TIMES THE
PRESENT DENSITY ..

0704

960MlEDS 1

AVAILABLE PRIOR TO JANUARY 1962

AN EDnOR FOR SAP SYMBOlIC DECKS.
A SYMBOLIC MASTER DECK IS EDITED BY
AN!) OElEl'lONS TO PRODUCE AN UPDATED
DECK.

INSERTIOt~S
SY~BOllC

ABSTRACT

• • 11 • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • •

0704

931PKCBR2

AVAILABLE PRIOR TO JANUARY 1962

IBM

0704

PROGRAM

LIBRARY

ABSl'RACT

CURE ROOT' SUBROUT INE
EVALUATES THE CUBE ROOT OF A NORMAlIlED flOATING POINT NUMBl:.R
TIMING, 2.5BO MILLISECONDS.
OBSOLETES pK CBRT~
0704
0704

931PKCOMP

AVAILABLE PRIOR TO JANUARY 1962

MEMORY COMPARISON DUMP
COMPARES PROGRAM ON CARDS OR TAPE WlTH SAME PROGRAM IN CORE.
CORE CONTfNTS lAND OPTIONALLY CARD OR TAPE CONTENTSI OF UNUKE jojORDS DUMPED WITH CORE LOCATIONS .. NON COMPARISON DUMPS
ALSO t-'ADE. DUMPS IN MNENIONIC OCTAL OR FLOATING DECIMAL ON
UNE OR ON 120 OR 12 CHARACTE~ TAPE. lOSES CELLS 0 TO 13.
PANEL AND CORE MAY BE RESTORED. PROGRAM MAY BE CALLED FROM
DRUM.

070/,

931PKEXPD

AVAILABLE PRIOR TO JANUARY 1962

[JOUBl( PRECI.SION FLOATING POlNT EXPONENTIAL ROUTINE.
GI VEN A DOUBLE PRECISION FlOATING POINT ARGUMENT IN THE AC-MQ
.PKEXpD COMPUTES THE EXPONENTIAL OF THE ARGUMENT, AND LEAVES
THE RESUlT IN THE AC-MQ .. ANSWER HAS AT LEAST 53 GOOD BITS.
ARGUMENT r-'UST BE LESS THAN 88 IN MAGNITUDE .. TIME-8 MS, SPACE
256 CELLS t. 13 COMMON.

0704

931PKMTlR

AVAILABLE PRIOR TO JANUARY 1962

N-STRIP TRAPEZOIDAL RULE INTEGRATIONIECUAl INTERVALS/
A SHARE TYPE SUBROUTINE FOR THE EVALUATION OF F/X/ FOR· THE N
VALUES OF X LYING IN THE INTERVAL MUST BE PROVIDED. SUB-

962SQS IMQ

AVAILABLE PRIOR TO JANUARY 1962

S [MUL T ANEOUS EQUAT IONS SOLVER
THIS IS A SELF CONTAINED FORTRAN PROGRAM DESIGNED TO OBTAIN
A VECTOR SOLUTION OF N SIMULTANEOUS LINEAR EQUATIONS IN N
UfolKNOWNS. TAKES A CARD INPUT WlTH COEFFECIENTS OF VARIABLES
AND VECTORS PUNCHED IN BCD WITH VARIABLE FIElD ""10TH.

07011

963IB.3FES

AVAILABLE PRIOR TO JANUARy 1962

FORECASTING By ECONOMETRIC SYSTEMS
ESTIMATES THE COEFF[CIENTS OF A SYS. OF LINEAR STOCHASTIC
EQUATIONS BY lIMITED-INFORHATION,TWO-STAGE LEAST-SQUARES,
AND FUll-INFO. COVARIANCES OF ESTIMATES ARE COMPUTED.
ALSO REDUCED-FORM EQUATIONS FOR COMPlETE SYS. CAN HANDLE
UP TO 30 EQUATS .. IN ]0 DEPENDENT VARIABLES AND 35 INDEPENDENT VARIAfllES FOR 1000 OBSERVATIONS. CORR/ 1015,1106

0104

9631B4FES

AVAILABLE PRIOR TO JANUAR¥ 1962

FORECASTING By ECONOMETRIC SYSTEMS
ESTIMATES THE COEFFICIENTS OF A SYS. OF LINEAR STOCHASTIC
EQUA l'I ONS BY LI MITED-I NFORMAT ION, TWO-S1 AGE LEAST-SQUARES,
AND FUll-INFO. COVARIANCES OF ESTIMATES ARE COMPUTED.
ALSO REDUCED-FORM EQUAT IONS FOR COMPLETE SYS. CAN HANDLE
UP TO 70 EQUATS .. IN 70 DEPENDENT VARIABLES AND 70 INDEPENDENT VARIABLES FOR 5000 OBSERVATIONS. CORRI lC1S,1l06

~~~i ~~~ ~~~E B~o~O~~i~~E~~~ N~~~~R ~~~S ~~ ~~ ~R ~~P~~~~ ~U~~~P-

Y
W
I
S
I
ETC. REQUIRES 46 LOCATIONS IN FUll VERSION, 4Z· IN STRIPPED
VERSION. TIMING FOR FUll VERSION IS l.2%&I.336&S/*N M.. S .. ,
WHERE S IS THE AVERAGE TIME' REQUIRED TO EV~lUATE FIXI ONCE.

0704

931PKPSIN

AVAILABLE PRIOR TO JANUARY 1962

PSUEDO-INVERSE SUBROUTINE
OBTAINS THE PSUEOO-IN~RSE OF A SQUARE OR RETAN(;ULAR MATRIX.
P~UEOO-INVERSE HAS THE PROPERTY THAT IN ANY SYSTEM OF
l:.CUATIONS AX-B, PSUEDO-INVERSE TIMES THE B VECTOR REPRESENTS
BEST SOLUTION OF THE SYSTEM IN A LEAST SQUARES SENSE.
CORRI lOro

212

0704

96:9PKIPOl

AVAILABLE PRIOR TO JANUARY 1962

INTERGER PROGRAMMING 1.
INDEpENDANT FORTRAN ~ROGRAM FOR SOLVING INTERGER PROG.
PROBLEMS, I ... E. L/PROGRAMMING PROBLEMS WITH RESTRICTlON
THAT VARIABLES INVOLVED BE INTERGERS. REQUIRES 32K MEMORY
AND ACCEPTS PROB. WITH ONE OBJECTIVE FUNCTION, UP TO 100
VARIABLES, AND AS MANY AS 200-N CONSTRAINTS, WHERE N IS THE
NUMBER OF VARIABLES .. All COEFFICIENTS IN PROBLEM FORMULATION MUST' BE INJERGERS. METHOD USED IN DESCRIPTION IN R... E.
GOMORY, All-INTERGER PROGRAMMING ALGORITHM, IBM
RESEARCH REPORT RC-189 ..

IBM

0104

0104

PROGRAM

LIBRARV

'}09PKIPal

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

INTEGER PROGRA"'MING 1
AN SK MEMORY VERSION OF PK IPOl. HANDLES PROBLEMS WITH ONE
OBJECTIVE FUNCTION, UP TO 35 VARIABLES, AND AT MOST 15-N
CONSfI{AINTS, WHERE N IS THE NUMBER OF VARIABLES.

0104

910PK I POZ

IIlM

0704

970PKIP82

AVAILABLE PRIOR TO JANUARY 1962

INHG[R PROGRA",MING 2
AN SK MEMORY VERSION OF PK IP02, 'tiITH THE PROBLEM SIZE
RESTRICTIONS OF IPS1. THAT IS, PROijLEMS M.lIV HAVE AT MUST
35 V~RIABLES AND 75-N CONSTRAINTS. WHERE N IS THE NUMB. OF
V.lIRIABLES.
CORR. 1231

1004GNP/o.CB

0104

ABSTRACT

B - 704

AVAILABLE PR lOR TO JANUARY 1'962

I006RSIPL5

AVAILABLE PRIOR TO JANUARY 1962

INFORMATION PROCESSING LANGUAGE V INTERPRETIVE SYSTEM
INTERPRETS AND EXECUTES PROGRAMS WRITTEN IN IPL-V
LANGUAGE, AS DESCRIBED IN -INFORMATION PROCESSING
LANGUAGE:: V MANUAL. SECTIONS 1 AND I I

1008 I BC TR

AVAILABLE PRIOR TO JANUARY 1962

CHEBVSHEV TRUNCATION SYSTEM
CO~PUTES POLV~OI-'IAL, RATICNAL liND CONTINUEO FRACTION
APPROXIMATIONS TO ANALYTIC FUNCTIONS, OOUBLE PRECISION
ACCLRACY, INPUT~ •• POWERSERIES COEFFICIENTS, REQUIRED
ACCURACY OR NUMBER OF COEffICIENTS SPECIFIED IN
CALL. SEQU., RESULTS CAN BE TESTED AT UP TO 10& POINTS

0704

10120RCBL

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARV 1962

9,71PKIP03

INTEGER PROGRA",MING 3
INDEP[NDENT FORTRAN PROG. FOR SOLVING INTEGER PROGRAMMING
PROBS. GENERALLV I~ORE EFFECTIVE THAN IPOI OR IP02 EXCEPT
ON DEGENERATE PROBLEMS .. REQUIRES 32K MEMORY, 1 TAPE, TAPETO-PRINTER. NUIIB. OF VARIAI3LES, N, MAY NOT EXCEED 100, AND
TOTAL NUMBER OF OBJECTIVE fUNCTIONS ANO CONSTRAINTS HAS AN
APPROXIMATE LIMIT OF 190-N .. EMPLOY METHODS OF R.E .. GOMORYS
R[PORTS--PRLNCETON-IBM MATHEMATICS RESEARCH PROJECT TECHNICAl REP ORr NO.1 ANO IBM RESEARCH REPORT RC-1S9.

0704

LIBRARY

PUNCH ABSOLUTE COLU/>I,N B INARV.
PUNCHES ON- LINE ABSOLUTE COLUMN DINARV CARDS IN THE
STANDARD SHARE FORMAT SO THAT THE" HAY BE lOADED 8Y THE
FORTRAN II BSS LOADER. ALTHOUGH TH( CAROS PUNCHED ARE
II.RSCLUTE CARDS, THE LOADING ADDRESSES HAY BE THE SAME AS
OR DIFFERENT THAN THE LOCATIONS FROM WHICH THE DATA IS
[lUNG PUNCHEU

0704

070't

PROGRAM

.AVAILABLE PRIOR TO JANUARV 1962

INTEGER PROGRA~MING 2
INDEPENDENT FORTRAN PROG. FOR SOLVING INTEGER PROGRAMMING
PROBS. METHOD USED IS BASICALLV THE All-INTEGER ALGORITHM
E",PLOYEO IN PK IPOI, BUT CONTAINS MODIFICA.WHICH PERMIT
SOLUTION OF SOME PROBS. INTRACTABLE FOR IPOI. RUN TIME PER
DERATION IS INCREASED, BUT NUMBER OF ITERATIONS IS
GENERAllY REDUCED, WITH THE RESULT THAT ThE CODE IS FASTER
FOR DIFFICULT PROBLEMS, SLOWER ONLY ON SIMPLE PROtlLEMS.
"'''CHINE ANI) PROBLEM RESTRICTIONS ARE SAME FOR IPOl 1237

0704

0704

AVAILABLE PR[QR TO JANUARY 1962

913RSBPDl

ON-LINE LOADER FOR COL. BIN. ABS. AND TSF. CARDS
UPPER, LOWER VERSIONS OF I)S Cell I1ITH PROVISIO~S FOR 7/9 PCH.

10130RCTTS

0101,

AVAILABLE PRIOR TO JANUARY 1962

CARD TO TAPE SIMULATOR AND ROW TO COLUMN CONVERTER.
72184 AND 80184 SIMULATION OF HOLLERITH ANO COLUMN BINARY
714, ALSO RO," TO COLU~N CONVERSION. CORRI lC89

0704

1017ANDI07

AVAILABLE PRIOR TO JANUARY 1962

LINEAR PROGRAJ'lMING WUH UPPER BOUNDS ON VARIABLES
THIS LINEAR PROGRAMMING SOSC WILL SOLVE PROBLEMS THAT HAVE
UI'PER tlOUND RESTRICTIONS ON SOME OR All THE VARIABLES. THE
ALGORITHM IS A MODIFICATION 06 T 5 R5V9S54 2947357 METHOD
WITH THE INVERSE IN PRODUCT FORM. NO EQUATIONS ARE WRITTEN
FOR THE BOUNDS. THEY ARE HANDLE4 IS SPS391L 41T1/I ~AXIMUM
PROBLEM SIZE IS 256 E-UATC AND IlT232 VARIABLES. CODE DOES
A MINIMUM AMOUNT OF TAPE READING. JOB CAN BE INTERRUPTED.
RI:START PRDCEDUREST REINVI::RSION 06 OAS9ST IN4 PR9NTOUT OF
OIJ VALUES ARE SPECIAL FEATURES4

NUMERICAL INTEGRATION BY I-'lOP,OINT PROCEDUREWITH PREFERETIAL INTERVAL PLACEMENT.
FORTRAN 11 FUNCTION SUBPROGRAM EVALUATES THE INTEGRAL OF A
FUNCTION BETWEEN TWO LIMITS WITH MAXIMUM ERROR SUPPLIED BY
THE USER. PROG~AM PLAC.ES INTERVALS WHERE NEEDED BY ESTI~ATING
THE SECOND DERIVATIVE OF THE FUNCTION. ITERATIONS NOT USED.
INTEGRATION IS DONE IN ONE STEP. ONE DIMENSIONAL. PROGRAM
USES 286 LOCATIONS. NO CO,..MON STORAGE USEO.

l~~

IBM

0704

0104

PROGRAM

977ALElPT

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

ELLIPTIC INTEGRAL, COMPLETE ANO INCOMPLETE.
THIS SUBRCUTINE WILL EVALUATE THE INCOMPLETE ELLIPTIC
INHGRALS OF THE FIRST ANO SECOND KINO GIVEN PHI AND K.
IT ,"ILL ALSO EVALUATE THE COMPLETE ElLIPTIC INTEGRALS
OF THE FIRST AND SECONO KINO, GIVEN K4
THE~ETHOO USED IN THE EVAUATION GIVES IMPROVED ACCURACY
fOR K NEAR ONE.

0704,

0704

'J.79NUBES3

AVAILABLE PRIOR TO JANUARY 1962

BESSEL FUNCTION OF COMPLEX ARGUMENT AND ORDER.
TO CO~PUTE THE BESSel FUNCTIONS J AND Y FOR COMPLEX
.A-RGUMENT AND COMPLEX ORDER. 704 FORTRAN SOURCE
LANGUAGE AND USES
METHOD OF NU BESl

9BOIINZ013

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

1029f1NF203

AVAILABLE PRIOR TO JANUARY 1962

EIGENVALUlS AND EIGF.NVECTORS OF REAL SYMMETRIC MATRICES
" GENERAL PROGRAM BUILT AROUND SUBRoUTINE ANF202
DIST. 664 WHICH USES GIVENS M[lHOD. COMPiLED I.ITH
DIMENSION 98 AUT CAN BE REcor·1PILED WITH DIMENSION 16 TO
RUN ON 4K 704. OPTIONAL INPUT PRINT-OUT AND CH[CKS OF
VflLUES ANO VECTORS BV SUBSTITUTION INTO MATRIX EOUATION

0104
0704

1028GCOOOI

LIBRARY

EXPLICIT SOLUTION OF nu::: GENERAL CUBIC EQUATION
VIETA SUBSTI,TUTION IS MADE USING NORMALIZED POLYNOMIAL.
ROOTS ARE OBTAINEO BY METHOD OF DEL FERRO. 20') LOCATIONS PLUS
I~,) FeR REQUIRED SUBROUTINES.

0104
0104

PROGRAM

1030ANF403

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962
INVERSION AND LINEAR EQUATIONS
A GENERAL PROGRAM BUILT AHOUND SUBHOUTINE ANF402
OIS1. 664 WHICH USES GAUSS-JOROAN ELIMINATION.
CC~PILEO WITH DIMENSION 20 BUT CAN DE RECOMPILEO WITH
DIMENSION 19 TO RUN ON A 4K 104. OPTIONAL INPUT
PRINT-OUT ANO CHECKS OF INVEHSE AND SOLUTION VECTORS.
~ATRIX

VARIABLE METR Ie; MINIMllAT ION
TI-'IS FOR:TRAN ROUTINE OETERMINES LOCAL MINIMA OF
DIFFERENTIABLE FUNCTIONS OF N VARIABLES.TI1E PROGRAM
EMPLOYS THE VARIABLE METRIC METHOD FOR MINIMllATION.IN
THE PROCESS OF LOCATING EACH MINIMUM ,A MATRIX H WHICH
C~ARACTERIIES THE REHAVtOR OF THE FUNCTION ABOUT THE
MINIMUM IS DETERMINEO .. FOR A REGION IN WHICH THE
FUNCTION DEPENDS C.UAORATICALLY ON THE VARIABLES,NO
MORE THAN N ITERATIONS ARE REC:UIRED.ROUTINE REQUIRES
6,137 STORAGES. VOWED BY IO ANFlOl3 SOA 1117

0704

l035SCLAGR

AVAILABLE PRIOR TO JANUARY 1962

LAGRAfl.:GE INTERPOLATION
USeS 1 POINTS. THREE PRECEEDING ANO THREE AFTER VALUE -LIMIT
OF 25C POINTS IN TABU
0704

988

NU OUT

AVAILABLE PRIOR TO JANUARV 1962

GENERALIZED CUT PUT SUAROUTINE
TI-11S PROGRA~ IS A ROUTINE TO OUTPUT A TWO-DIMENSIONAL
I\RRAY
IN
A FAIRLY GENERAL FORMAT.

0704

l003GNBSPF

AVAILABLE PRIOR TO JANUARY 1962

0704 1040 JPASLF

AVAILABLE PRIOR TO JANUARY 1962

ASSOCIATED LEGENDRE FUNCTIONS
THIS PROGRAM C01-1PUTES THE ASSOCIATED LEGENDRE FUNCTIONS
PIM,NI WHERE N IS LESS THAN OR EQUAL TO M. THE PROGRAM
RE-QUIRES THAT UNlTEO AIRCRAFT UA SQH4 BE ASSEMBLED WITH IT.
HEQUIRES 162 WORDS OF CORE STORAGE.

BACKSPACE FILE,FORWARD SPliCE FILE.
TO MOVE A BINARY
DR CECIMAL TAPE FORWARD OR BACKWARD A SPECIFIED NUMBER OF
FILES.
AT THE CO~PLETION OF THIS SUBROUTHIE. THE TAP!.': WILL
BE POSITIONED READY TO REAO OR WRITE THE FIRST RECORO OF
THE FILE REQUESTEO

213

tBM

0704

PROGRAM

lIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

1Il704 1041 JPZOMI

[ERO, MINIMUM SOLVER
SCLVE:S THE CLIISS OF PROBLEMS WHICH CAN fiE STATED AS
FI/XI .... XNf-ZERO I MINIMUM I-l ..... N
WHERE ANY COMBINATION OF ZEROS AND/OR MINIMUMS ARE POSSIOLE
TO SOLVE SIMULTANEOUSLY.

AVAILABLE PRIOR TO JANUARY 1962

0704 10'.2 JPBICO

flJNOMIAL COEFFICIENTS
1
COMPUTES IN,M/-/NI/N-l/ .... I I/MI/M-1/ ..... IIIr-t-MIIN-M-1I .... 11
BY USING STIRLINGS APPROXIMATIONC LII SB160 AND GE LN MUST
BE ASSEMBLED WITH Bicec
130 STORAGE LOCATIONS ARE USED ..

070'.

1043JPSRCH

AVAILABLE PRIOR TO JANUARY 1962

SIMULTANEOUS PARTIAL DIFFEReNTIAL EQUATIONS SOLVER
SOLVES HE PROBLE~ -I:, T&E E.-R~
AASF/FIfXI ..... XN/-YI IWANTEOII lESS OR EQUAL EIII-l ..... Nf
WHERE FI IS NON-LIfljEAR.
STANDARD NEWTON-RAPHSON WHERE THE
PARTIALLING IS DONE NUMERICALLY BY PERTURBIN1 T85 XI.
STORAGE REQUIREO IS 484 WCRDS r. 8 WORDS OF COMMON.

0704

104BJPGIN

AVAILABLE PRIOR TO JANUARY 1962

GAUSS APPROXIP.ANT GENERATOR
THIS SUBROUTINE IS CAPABLE OF GENERATING THE GAUSS
APPROXIMANT FOR ANY TYPE OF INTEGRAL EXPRESSION, WHETHER IT
B[ AN ITERATED INTEGRAL, VECTOR VALUED INTEGRAL OF A VECTOR
VALUED FUNCTION. OR THE INTEGRAL OF A FUNCTION OF OTHER
INTEGRALS, OR ANY COMBINATION OF THESE.
USES 227 LOCATIONS.

0704

l050RSQP 1

AVAILABLe PRIOR TO JANUARY 1962

QUADRATIC PROGRAMI-'ING CODE
THE CODE wIll SOLVE T~E QUADRATIC PROGRAMMING PR08LEM OF
MINIMIZING A CUADRATIC FUr-CTION OF NONNEGATIVE VARIABUS
SUBJECT TO LINEAR CONSTRAINTS. THE NUMBER OF CONSTRAINTS
PLUS VARIABLES r-:UST BE LESS THAN 253. THE PROGRAM WILL
OPERATE ON A 70'. ~tTH A MINIMUM OF 8K, 4 DRUMS, AND 6
TAPES. THE CODE, I.,-JTH THE ACOITION OF fI.j() CARDS, C"'N RUN
ON A 7090 WITH COMPATIBILITY.

10M

070/f

PROGRA/',

LIBRARY

MlSTRACT

IBM

0704

0704

PROGRAM

l[BRARY

1061PKPSTP

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

PI-STAR PROGRAM
THE PI-STAR PROGRAM INCLUDES A DATA LOADER AND A TAPE PRINT
ROUTINE-IN ADDITION TO THE PI-STAR SUBROUTINE .. THE PROG~AM
READS IN THE INJECTIVE WORD AND THE PRIMITIVE FUNCTIONS GENERATES THE FUNCTION INFORMATION LIST AND THE CALLING SEQUENCE
PARAMETf:RS, ANI) TRANSFERS TO THE PI-STAR SUBROUTINE. UPON
RETURN FROM THE SUBROUTINE,. TRANSFER IS MADE TO THE TAPE
PRINT ROUTINE TO PRINT THE OUTPUT- ORDER LIST IN BINARY AND
THE ANSWER ARRAYS IN 1-0-X NOTATION.

0704

1062PKPST

AVAILABLE PRIOR TO JANUARY 1962

PI-STAR SUBROUTINE
SUBROUTINE TO TRANSFORM AN IRt909 98 64
A BOOLEAN FUNCTION OR FUNCTIONS INTO A NORMAL FORM EXPRESSION
OR EXPRESSIONS .. OTHERWISE EXPRESSED, IT GIVES THE FUNCTION OR
FUNCTIONS DESCRIBED flY A BOOLEAN TREE OR GRAPH ..

0704

1070RMELFK

AVAILABLE PRIOR TO JAr<.jUARY 1962

COMPLETE ELLIPTIC INTEGRALS OF THE FIRST KINO
THIS SUBROUTIN[ EVALUATES THE COMPLETE ELLIPTIC INTEGRALS
OF THE FIRST KINO FOR DIFFERENT VALUES OF THE MOOULUS K.
USES NATURAL LOG SUBROUTINE LAsa2a OR THE EQUIVALENT
THAT L;SES COI-IMON THROU~H COMMON &. 2.
RECUIRES 55 STORAGE CEllS E. 7 COMMON

0704

1071NUEFMT

AVAILABLE PRIOR TO JANUARY 1962

FLOATING POINT TRAP ROUTINE
704 FORTRAN SAP COOED.
THIS SUBROUTINE PROVI.OES ENTRY TO THE flOATING-POINT TRAP
MODE ANI) SETS UP THE NECESSARY PROCEDURE FOR DETERMINING
WHETHER A flOATING POINT OVERFLOW OR UNDERFLOW TOOK PLACE
ANI) THE ACTION TO Bf: TAKEN. THE ROUTINE ALSO PROVIDES FOR
AN EXIT FROM THE FLOATING POINT TRAP MODE

0704

1012NUSC~R

AVAILABLE PRIOR TO JANUARY 1962

SOLUTION OF RADIAL SCHROCINGER EQUATION
THIS IS A FORTRAN PROGRAM TO CALCULATE THE EIGENVALUES
A'IIO EIGENFUNCTIONS OF THE RADIAL SCHROOINGER EQUATION.

IB~

0704

PROGRAM

LIBRARY

ARSTRACT

to tIC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

070(j

1054BSSEAC

AVAILABL( PRIOR TO JANUARY 1962

GFNERAL LOGICAL CORE SORT SUBROUTINE FOR 32K704
SORTS INTO lOGICflL SECUFrKE A BLOCK or- N CONSECUTIVE ITE"IS
OF ~ 1.0ROS EACH,
USING AS THE SORT KEY K CONSECUTIVE ens
OR CHARACTERS STARTING AT ."NY OIT OR CHARACTER IN THE ITEM
KFEPING ITEMS WITH IDENTICAL KEYS. CORR/1l53

0704

l056TVME21

0704

0704

1057TVM(PK

0704

1077GC0003

AVAILA8LE PRIOR TO JANUARY 1962

107<)NOTIA

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

A/Ii. ... LYll"'JG SYSTE~ FAILURE CAT/\
THIS 10'+ PROGRAM '"AS W:!,jTT["l TO IMPLE~ENT THE STATISTICAL
A:'\j,\LYSIS OF THE FAILURE: PROPERTIES OF COMPUTER SYSTEMS WHICH
IS GIVEN IN -THE THEORY E. MEASURE,~ENT OF COMPUTER SYSTEM
REllAIHl[ TY- I IN PRESS/.

214

AVAILABLE PRIOR TO JANUARY 1962

FITTLNG TO SELECTED TERMS OF A GENERAL POLYNOMIAL
fI METHOD OF OBTAINING THE BEST COEFFICIENTS III,! THE LEAST
SQUARES SENSE TO ARBITRARILY SElECTEO TERMS OF A MULTIVARIATE
POLYNOI-1IAL. REQUIRES 197 LOCATIONS PLUS 40 FOR EXP 12, AND
ft26 FOR XS I MEC.

070f.
1059~LFJ\lL

1076ANE20B

AVAILABLE PRIOR TO JANUARY 1962

'''t;LTI-PURrOSE ESTIMATION FOR RELIABILITY STUDIE'S
TillS PROGR/I,"1 IS US EO IN RELIABILITY STUDIES MID HAS OEEN
',mITTEN TO IMPLEMf~T SEVERAL STATISTICAL ANAlYSES OF
CCI-'POll;ENT FAILURE FROM DATA CONSISTING OF INDEPENDENT OBSERVATIONS ON A SINGLE RAII.IOOM VAlUABLE.

0704

AVAILABLE PRIOR TO JANUARY 1962

A GENeRAL LEAST SQUARf:.S FITTING PROCEDURE
FORTRAN GENERAL PROGRAM USES NEIHO.\l-RAPHSON ITERATION
TO FIT AR!HTRMY FUNCTION OF H PARAMETERS TO A GIVEN
SET OF N OBSERVED VALUES WITH ASSOCIATED ERRORS.

0704
I058WLREl I

l075ANFl04

A GEN[RAL PROGRAM FOR COMPLEX MATRIX INVERSION
FORTRAN OECI~AL INPUT-OUTPUT STRUCTURE BUILT AROUNrJ
SL:flPROGRAM ANFI03 FOR THE INVERSION OF COMPLEX MATRICES
OF ORDER 20 OR LESS ..

AVAILABLE PRIOR TO JANUARY 1962

F'IJ I I BCD TAPE OUTPUT FOR FORMAT 12F6.0,4I2
THIS IS A FORTHA"! II SUBROUTI"lE TO WRITE A BCO TAPE WITH
fTHE TEXT OF THIS lINE HAS BEEN LOSTI
IOENTIFICATI.ON PER RECORD USING THE FORMAT 12F6 .. 0.4I2.
L[ADING ZEROES ARE: SUPPRESSED fiND OECIMAL POINTS ARE NOT
PRINTEO.
BECAUSE DECIMAL POINTS ARE NOT PRINTED, SIX
DIGITS OF INFOR~ATION PER FIELD MAY fiE WRITTEN.

070 f ,

AVA I LABLE PR lOR TO J ANUAR Y 1962

SECOND ORDER DIFFERENTIAL EQUATION SUBROUTINE
THIS SUBROUTINE WILL COMPUTE. STEP-BY-STEP, A FOURTH ORDER
APPROXIMATION TO THE SOLUTION OF A SYSTEM OF SECOND ORDER
DIFFERENTIAL EQUATIONS WITHOUT EXPLICIT FIRST O[RIVATlV[S.
ROUTINE USES 41210CTALI OR 266/0ECIMAlI LOCATIONS PLUS 10
LOCATIONS IN ERRASIBlE COMMON.

AVAILABLE PRIOR TO JANUARY 1962

RCD Te OI,NARY INHGER CONVERSION
TO CONVERT A BCD INTESER OF 10 CHARACTERS OR LESS TO A
BINARY INTEGER.

0704

1013flCDIFF

*........... .

TRACE INSTRUCTION ALTERATION
THIS TRACING PROGRAM IS A POWERFUL TOOL FOR IDENTIFYING
SOURCE OF TRANSFER TO AN UNINTENDED LOCATION OR OF UNDESIR
ALTERATION OF ~EMORY. BY "'EANS OF IT THE MACHINE IS DIVERTED
TO A "'EMORY au"!p AT FIRST TRAPPED TRANSFER OCCURRI~G
IMMEDIATELY BEFOR[ TRANSFERRING TO A SPECIFIED EFFECTIVE
ADDRESS OR AFTER ONE OF SEVERAL DESIGNATED LOCATtO~S BECO;.o,ES
ALTERED FRO,," SPECIFIED CONTENTS.

111M

r'lTOI,

PROGRAM

1I ORARY

ABS TRAC T

• • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • ft

070'1

IWAILABLE PRIOR TO JA"IUARY 1%2

l081LROSRA

orEN SUllRCUTINE ADOITI0NS TO FORTRAN EDIT DECK
PIUI-'ARY USC IN COMPILING LIAR

0704

AVAILABLE PRIOR TO JMUARY 1962

108,)U~PLOT

G[NERAL PURfJOSE PLOTl'ING SUBROUTINE
Rr.Pi[) PLOTTING OF NUMERIC INFORMATION FOR FORTRAN. SAP. OR
MAO CALLING PROGRAMS.
A CORE REGION CONTAINS A SEGMENT OF OR
COMPLETE GRAPH IMAGEa
fHE ROUTINE PREPARES A FLEXrUL[ CARTESIAN GRID BUT ANY BCD CHARACTERS ITtTlES. SPECIAL GRIDS. AN
NUMBER OF PLOTTING CHARACTERS FOR ANY NUMBER OF UNSORTED DATA
POINTSI CAN BE PLACED.
GRID AND CHARACTER PLACING AND TAP
WRITING FOR A FULL PAGE 200 POINT PLOT REQUIRES laB SEC.
ANY
NUMtlER OF COPIES OF THE GRAPH CAN BE WRITTEN ON ANY DECIMAL
OUTPUT TAPE fOR PRINTING OR PUNCHING IN ABOUT la SEC .. EACH.

................................................................
IBM

AVAILABLE PRIOR TO JANUARV 1962

109.2RSMlAS

MATHEMATICAL PROGRAMMING SVSTEM I-ALL SOLUTIONS
THESE ROUTINES C.ONSTI.TUTE AN AUGMENTATION OF THE RSFM1
THEY PERMlT THE FINDING
ROUTtr,E FOR LINEAR PROGRAtJMING.
OF All OPTIMAL SOLUTIONS OF A LINEAR PROGRAMMING PRO[lLEM OR
OF All VERTICES OF A POLYHEDRON GIVEN BV INEQUALITIES.
AN
EFFICIENT NON-EXHAUSTIVE ALGORITHM IS USED.

070',

1096TVSMPL

AVAILABLE PRIOR TO JANUARV 1962

SYSTE~ I",MEDIATELY MAKING PROGRAMMING LANGUAGE EASV
SIMPLE IS A 704 AUTOMATIC COOING SYSTEM WHICH PRODUCES OBJECT
PROGRAMS FOR THE IBM tt+01 DATA PROCESSING SVSTEM. THE
SIMPLE COMPILER IS WRITTEN IN FORTRAN WIT ... SOME EXTENSIONS
ISEE APPENDIX A OF SltJPLE MANUALI, AND IS COMPILED ON THE 704
THE LANGUAGE PROVIDES FOR ANY OR All OF THE FOLLOWING 11IHLGH-LOW-ECUAL COMPftRE/2ICOLUMN BINARY, /31 PUNCH FEED
READ,/41 MUL TIPL Y-DI V IDE ISUBROUT INES ARE PROVtDEO- FOR THE SE
IF NOT BUILT-IN 1401 HARDWARE/. AND IS! MOVE RECORD. A
SUB-ROUTINE IS PROVIDED TO HANDLE TAPE ERRORS. CaRR 1140

0704

AVAILABLE PRIOR TO JANUARV 1962

1l0lUMMAD

MAO TRANSLATOR AND ASSOC IAfED SUBROUTINES
TRANSLATOR FOR THE MAO I~ICHIGAN ALGORITHM DECODER I
LANGUAGE.
STATEMENTS INCLUDE BOOLEAN EXPRESSIONS.
SIMPLE ftND COMPOUND CONDITIONALS, GENERAL lTERATION
STATEMENTS, AND SYMBOL MANIPULATION FACILITIES. VERV RAPID
TRA!l.SL4TIONa:
SUBROUTINES. SUCH AS INPUT-OUTPUT. WHICH ARE
CAllED BV OBJECT PROGRAI"S. ARE INCLUDED. BINARV CARDS
PROOUCED BY TRANSLATOR ARE IN STANDARD RELOCATABLE FORMa
TRANSLATOR IS IN THE FORM OF A SUBROUTINE AND CAN BE
1r-'t3ECDED IN ANY SYSTE~ USING BSS LOADER ..
IBM

0104

0704

P.ROGRAI'-1

1l03PKSEQ

LIBRARV

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

SEQUENTIAL CIRCUIT PROBLEI" SOLVING
THE PURPOSE OF THE SUIlROUTINE IS FOURFOlD.NA~.SLYGENERATES A MOORE OR MEALV STATE DIAGRAM- COMPUTES A SH OF
(CUATIONS AND THE -OONT CARE CONDITIONS- FROM EITHER A MOORE
OR r-'.EALV STATE DIAGRAM- REDUCES 4 SEQUENTIAL MACHINE
REPRESENTED BY EITHER A MOORE STATE OIAGRAM,A SERIES OF INPUT
-OUTPUT SEQUENCES. OR A HUFFMAN FLOW TABLE- GENERATES A MOORE
STATE DIAGRAM FROM A SET OF ECUATIONS AND THE -DONT CARE
CONDITIONS- AND REDUCE THE STATE DIAGRAM.

0104

1104PKMIN4

AVAILABLE PRIOR TO JANUARV 1962

OF A MIN 2 LEVEL &/OR SWITCHING CIRCUlT
G[;NERATES A MINIMUM TWO-LEVEL SwITCHING CIRCUIT W85R5 ONE
LEVEL IS ALL ANOS AND THE OTHER LEVEL IS ALL ORSa -OONT-CARECONDITIONS AND MULTIPLE OUTPUT PROBLEMS ARE PERMITTED. C4N
ALSO BE DIRECTlY APPLIED TO THE MINIMIZATION OF A BOOLEAN
FUNCTlON IN NORMAL FORM ... PROGRAM MAY BE RUN ON A MACHINE WITH
2 OR 4 737S OR A 138 MEMORY FRAME. IN AODITION. IT RECUIRES
FIVE TAPES.
CO~PUTAT10N

0704

1109NUfPll

0704

1110NUGENI

AVAILABLE PRIOR TO JANUARV 1962

B - 704

AVAILABLE PRIOR TO JANUARY 1962

1134ELFIOP

AVAIL4BLE PRIOR TO JANUARY 1962

1143IB4PRM

AVAILABLE PRIOR TO JANUARY 1962

AUTOPROMT
AUTOMATIC TOOL PATH GENERATION FOR NUMERICAL CONTROL OF
MACHINE TOOLS..
SElf-CONTAINED SYSTEM ACCEPTS SVMBOLIC
OESCRIPfiON OF THRF;f-DIMENSIONAl SHAPES IN AUTOPROMT
LANGUAGE.
COMPILES TOOL CENTERS REQUIRED FOR MACHINING.
OUTPUT ON MAGNETIC TAPE. CORR/1l55o

0104

AVAILABLE PRIOR TO JANUARY 1962

1144NC 138

MCOIFIED PK KWIC PROGRAl-I ISOA BB41
INCLUDES WRAP-AROUND FEATURE
THIS IS ONE OF A SET OF 9 PROGRAMS CURRENTLV
USEO BV CHEMICAL ABSTRACT'S SERVICE TO
PROOUCE CHEMICAL TITLES .. THE COMPLETE SET
INCLUDES NC 1)9, NC 140. NC 141, NC 142,
NC 143, NC 144, NC 145, AND NC 146.

0704

1144NC 139

AVAILABLE PRIOR TO JANUARV 1962

PROGRAM TO SORT THE KEY WORDS FROM NC 138

IBM

0704

070fl

PROGRAM

1144NC 140

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARV 1962

READS THE FINAL SORTED TAPE FROM NC 139
AND WRITES A TAPE TO PRINT WHICH GIVES THE FREQUEtlC( OF
EAC~ KEY wORD.

0104

1144NC 141

AVAILABLE PRIOR TO JANUARY 1962

READS THE SORTED KEV WORDS FROM NC 139 AND
WRITES A TAPE TO PRINT IN A SPECIAL FORMAT

0104

1144NC 142

AVAILABLE PRIOR TO JANUARY 1962

SORTS THE BIBLIOGRAPHY TAPE FROM NC 138

0104

1144NC ltl)

AVAILABLE PRIOR TO JANUARY 1962

READS THE SORTED BIBLIOGRAPHV TAPE FROM NC 142
AND ~RITES A TAPE TO PRINT IN A SPECIAL FORMAT

1144NC 144

'AVAILABLE PRIOR TO JANUARY 1962

READS THE FINAL SORTEO BIBLIOGRAPHV TAPE FROM
"Ie 142 wRITES ANOTHER TAPE AND SORTS IT

0704

1144NC 14')

AVAILABLE PRIOR TO JANUARY 1962

READS THE SORTED AUTHOR CROSS IND~X TAPE
AND WRITES ANOTHER TO PRINT IN A SPECIAL FORMAT

0104
1119ERNLR

ABSTRACT.

FORTRAN INPUT/OUTPUT PACKAGE
PROVIDES GREATER INPUT AND OUTPUT FLEXIBILITY WITH 104
FORTRAN ll .. IT AllOWS VARIABLE LENGTH TAPE RECORDS UP TO 1500
WORDS. BINARY OR Bcn. ERRCR. (NO OF FILE, AND PHYSICAL END OF
TAPE INDICATIONS MAY OE USED FOR BRANCHING. MUL TtPLE FORMAT
STATEt'ENTS ARE USED IN DESCRIBING TAPE RECORDSa REQUIRES 1500
WORDS OF UPPER STORAGE FOR lID BUffER

0104

GENERATE MATRICES TO BE SOLVED BV NU· TPLl
TO GENERATE ANO WRITE THE MATRICES NECESSARY
TO SOLVE< THE EQUATION QC-G BY USING NU TPll

0704

1129AQALLl

AVAILABLE PRIOR TO JANUARY 1962

QUASI-TRiDiAGONAL MATRIX ROUTINE
THIS PROGRAM SOLVF.S THE MATRIX EQUATION QV-G
WHERE Q IS A QUASI-TRIDIAGONAL MATRIX

LIBRARV

SINGLt OR DOUBLE INTERPOLATION SUBROUTINE
GIVEN SOME FUNCTION WITH ONE OR TrW INDEPENO(rH VARIABLES.
X AND l. THIS ROUTINE PERFORMS KXTH AND Lxn, ItHERPOLATION
TO CALCULATE TH( DEPENDENT VARIABLE Y. THE DEGREE OF
INTERPOLATION IS VARIABLE IN BOTH DIRECTIONS FROM 1 TO 7.
LAGRANGE INTERPOLATION IS USED THROUGt-.NEL A CARD READER

07.04

AVAILABLE PRIOR TO JANUARY 1962

INTEGER PROGRAMMING I, 7D90
CONVERSION OF PKFIpOI FOR 7090 WHICH DOES NOT REQUIRE FORTRAN
MONITOR SYSTEM.

0704

1183GOCORI

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

PSEUOC-RANOOM NUMBER GENERATOR
GIVEN A NORMALIZED FLOATING POINT NUMBER Z-SUBN BETwEEN -I
MW (,1. THE Nu~nER l-SUB/Nt-l/ IS PROOUCED, WHERE Z-SUBI IS
A SEQUENCE OF UNIFORMLY DlSTRIBUTED PSFUOO-RANOOM NUMBERS ON
THE INTERVAL /-1,1/.

0704

1192PK I PMI

LIBRARY

AVAILABLE PRIOR TO JANUARY 1962

PRIl\CIPAL COMPONENTS PREDICTION ECUATION.
Fr-J 22 PROGRA~ TO EVALUATE AN EQUATION BY FITTING DATA USING
~ULTIVi\RJATE TECHNIQUE OF COMPONENT ANALYSIS ..
METHOD DIFFERS
FRail IIULTIPLE ~EGRESSION IN THAT COEFFICIENTS WHICH ARE
DERIVED REPRESENT ORTHOGONAL CONTRIBUTIONS OF RESPECTIVE
TFRf'.'S OF EO •• THUS SUPPRESSING EFFECTS OF CORRELATIONS AMONG
I'IIOEPENDENT VARIAP.LES..
AN EIGENVALUE-EIGENVECTOR ANALYSIS OF
CI-IARACTERISTIC Ee. OF MATRIX OF CORRElATIONS EXPRESSES
RElATIONSHIP RETWEEN INDEPENDENT VARIABLES AND ORTHOGONAl
CO~PCr..[NTS.ADAPTION OF CA 0054 USED AS SUBROUTINE. CORR.1207

0704

PROGRAM

INTEGER PROGRA"'MING 1. 7090
CONVERSION OF PKFIPOI FOR 7090 USING FORTRAN MONITOR SYSTEM •

0704
070it

0704

1220NSABC

AVAILABlE PRIOR TO JANUARY 1962

AUTOMATIC CODER, COMPATIBLE WITH SAP
AUTOMATIC CODING SYSTEM WHOSE SOURCE LANGUAGE INCLUDES SAP
COOING AS WEll AS STATEMENTS IN MATHEMATICAL LANGUAGE AND
ENGLISH. TRANSLATES AUTOMATIC CODE TO SAp CODE. WHICH IS THEN
ASSEMBLED, US ING UA SAP.' INCLUDES 82 SUBROUTINES ON SYSTHl
LIBRARY rAPE. AUTOMATIC CODE LANGUATE lIKE FORTRAN, WITH
RESTRICTION TO SINGLE SUBSCRIPTS. HANDLES MIXED ARITHMETIC.
CONTAINS OATA PROCESSING PACKAGE. HAS MORE GENERAL SUBROUTINE
lOGIC. OBJEC.T PROGRAM ON BINARY CARDS WITH SAP LISTING.

0704

1224UCSCUL

AVAILABLE PRIOR TO JANUARY 1962

SHARE CATALOG UPOATER, LISTER .. 1401 PROGRAM.
I+-L-E. AND 2 TAPES
REQUIRES 4K 14{';I WITH AOV .. PROG .. ,
PROGRAM CAN PERFORM FOUR FUNCT IONS.
1, UPDATE THE CATALOG F I,LE ON TAPE WITH INPUT CATALOG CARDS ..
2, SEQUENCE CHECK THB INPUT CATALOG CARDS BEFORE UPDATING ..
3, LIST THE CATALOG BY THE CLASSIFICATION CODE.
4, LIST THE CATALOG rTEMS FORM ANY INSTAllATION.
IF DESIRED, JUST THE TITLES MAY BE ltSTFO.

I BH

0104

0104

PROGRAM

1211TVTPPR

L toRARY

ABSTRACT

B - 704

AVAILABLE PRIOR TO JANUARY 1962

104 PROGRAM TO GENERATE 1401 T/P PROG .. ON OUTPUT Tf\PES ..
TO I-'INIHIlE OPERATOR ATTENTION IN 1401 PRiNT OPERATION FROM
10 /• OUTPUT TAPE THROUGH PROGRAMMED 1401 INSTRUCTIONS
WR1TT(N ON THE TAPE AT THE TIME OF 104 COMPUTATION.
THE 1401
TAPE-TO-PRINT INSTRUCTIONS PRECEDE ANY OUTPUT INFORMATION,
AND THE PRINT OPERATION REQUIRES ONLY THE MOUNTING OF THE
TAPE AND PRESSING THE LOAD TAPE BUTTON.

0104

12121'1AICE4

AVAILABLE PRIOR TO JANUARY 1962

INTEGRATION WITH CONTROLLED ERROR
AAICE/j IS DESIGNED TO BE USED [N CONJUNCTION WITH AN
INTEGRATION SUBROUTINE/AA INTl IF DESIRED/ TO PROVIDE A
NW'ERICAl SOLUTION OF AN NTH ORDER SYSTEM OF LINEAR AND lOR
NON-liNEAlt DIFFERENTlAL EeUATIONS EXPRESSED AS A SYSTEM OF N
FIRST ORDER ECUAT IONS. THE LOCAL ERROR GENERATED DY tHE
NUr-'ERICAL PROCESS IS CONTROllEr! BY ADJUSTING THE INT[GRATlON
STEP SIZE fiAS[O ON THE RElATIVE ERROR AS ESTIMATED BY
EXTRAPOLATION TO lERO STEP SllE ..

0104

1231hA INTl

AVAILABLE PRtoR TO JANUARY 1962

SECOND, THIRD. AND FOURTH ORDER RUNGE-KUTTA INTEGRATIOU
AI\. tNT! I.S I\. FORTRAN II SUBROUTINE DESIGNED TO BE USED IN
CONJUI\CTION WITH All. l.CE4 TO PROVIDE A SECOND,THIRD,OR FOURTH
ORDER RUNGE-KUTTA SOLUTION OF AN NTH ORDER SYSTEM OF LINEAR
ANDIOR NON-LINEAR OtFF[RENTlAL EQUATIONS EXPRESSED AS A
SYSTEM OF N FIRST ORDER EQUATIONS.

0704

1214AAWfG2

AVAILABLE PRIOR TO JANUARY 1962

WEGSlElN lTERATION
GI .... EN AN IMPLICIT EQUATION OF THE FORM X-FIX/.AA WEG2 WILL
FINO A .... ALUE FOR X WHICH WILL PRQlJlDE A SPECIFIED ACCURACY
IN EITHER A RELATIVE OR ABSOLUTE SENSE ..

0104

1244ANCOOI

AVAILABLE PRIOR TO JANUARY 1962

A GENERAL PROGRAM FOR SYSTEMS EVALUATION
GIVEN A DESCRIPTION OF THE BLOCK DIAGRAM OF A SYSTEM AND THE
TRANSFER FUNCTIONS OF EACH COMPONENT OF THE SYSTEM, THIS
COMPLETE PROGRAM COMPUTES THE TRANSFER FUNCTION OF THE SYSTEM
AND CALCULAtES THE ATTENUATION ANO PHASE ANGLE FOR GIVEN
VALUES OF -FREQUENCY .. SIMPLE FEEDBACK LOOPS ARE PERMITTED IN
THE SYSTEM. THE PROGRAM AS SUBMITTED IS DESIGNED FOR A 32K
MEMORY.

217

ABRAC

-

AR T

01

-

04

704 Nuclear Code

704 Nuclear Code

(1)

Code Originated by:
Westinghouse - Bettis PLant

(1)

Code Originated by:
Westinghouse - Bettis

(2)

Computer:

(2)

Computer:

~

~
(3)

Description of Code;
ABRAC - 01 is a three-dimensional few-groups neutron diffusion
program which treats the effects of water moderator density
changes (resulting from flow variations and boiling) on neutron
flux distributions and depletion. Thermal and hydraulic calculations performed within the code limit its applicability to
water-cooled and moderated cores having one upilow coolant pass.
ABRAC - 0 I is essentially the DRACO - I program with a thermal
and hydraulic calculation added imnwdiately after the power and
flux normalization routine and just prior to the depletion routine.

(4)

Restrictions or Limitations:
MaXlmum number of mesh parallelepiped is 2685 or 4750 for
machines of 16K or 32K words of core storage, respectively.
Ten tape units are required.

(5)

Approximate Performance:
For a core represented by a 16x16x26 mesh (two group), the
running time might be from 1.5 to 2.0 hr. per it~ration. Three
to four iterations may be required.

(6)

References:
1. W. M. Jacobi, T. J. Lav.1:on, S. H. Meanor, J. R. Parrett'",
ABRAC - An IBM-704 Three Dimensional Nuclear Thermal Depletion Program with Distributed Void Effects'
\,lAPD-TM-203, March, 1960.
2. J. Redfield, Computer Code AbstJ";'L t :"u. 13,
Nuclear Science and Engineering:..!E., 205-l06 (1961).

APCOI

704 Nuclear Code

(I)

Code Originated by:
Westinghouse-Bettis PLant

(2)

Computer:
~

(3)

Description of Code:
The APCOI code processes the flux tapes from a PDQ02 problem
and its adjoint. The integrals

are obtained in an x-y geometry for all compositions supplied
and for all possible combinations of groups i and j.
(4)

(5)

Restrictions or Limitations;
A 32K memory is required. The flux and adjoint flux calculations
must correspond as far as geometry, mesh structure, groups, and
number of compositions.
Approximate Performance:
Running time to process the flux tapes from a two-group, 30 x 30
PDQ02 problem and its adjoint is approximately 1. 2 minutes with
no pointwise product edits, and approximately 4. B minutes when
all pointwise product edits are included.

(6)

References:
~elbard, CPM-M-135 (1958).

(~'">

Material Available:
1. CPM-M_I35.
2. Binary deck.

Note:

218

Plant

The information given above was abstracted from CPM-M-135.

(3)

Description of Code:
Replaces ATBAC - See Page II.3 for details

(6)

References;
Letter, 7-31-58.

~

704 Nuclear Code

(1)

Code Originated by;
Westinghouse - Bettis Plant

(2)

Computer:
~

(3)

Description of Code:
Obtains detailed information concerning thermal conditions within a
reactor core during transient operations. The method used applies
particularly to plate type pressurized water reactors. The model
used is that of a hot channel in a parallel .flow path with the normal
channels. A single normal channel is analyzed for heat transfer
with pressure drop. with flow characteristics in the channel being
determined a priori by the loop containing the reactor. heat
exchangers, and pumps. The pressure drop across the normal
channel then determines the flow conditions in the hot channel, in
conjunction with the hot channel heat transfer. In this way it is
possible to simulate such varied transients as complete and
staggered loss of flow 1 cold water aCCident, and rod pumpaccident.

(4)

Restrictions or Limitations:
In normal usage the code is lilTIited to a two-pass core with a
maximum of 2.5 pOints per pass. Great caution must be used
in selecting a value of 6 t so that no instability is introduced
into either the heat transfer or kinetics equations. The IBM
equipment includes an 8K core, two tape units, and one drull'l
unit.

(5)

Approximate Perforll'lance:
A typical 30-point, 3-second transient with no scram will run
about 15-20 minutes.

(6)

References:
~nderson, T. J. Lawton, E. V. Somers, J. M.Weavcr,
"ATBAC - An IBM - 704 Code for Reactor Thermal Transients",
WAPD-TM-ZO, June, 1957.
2. E. V. SomerS, Westinghouse Scientific Paper IOO-FFI037-PL,1956.

704 Nuclear Code

(1)

Code Originated by:
Westinghouse - Bettis Plant

(2)

Computer:
~

(3)

Description of Code:
Calculates steady state temperatures in a one- or two-pass
cylindrical reactor core. It requires as input the radial and
axial power distributions and rules for combining them into
three-dimensional power distribUtions, local peaking factors,
hot-channel factors, and geometric data.

(5)

Approximate Performance:
5 minutes.

(6)

References:
1. Internuclear Co., Ca.lyton 5, Mo., "Calculation of
TelTIperatures in a Two Pass Cylindrical Core using an
IBM-704 Computer'-', INTERNUC 8.
2. R. R. Schiff, Westinghouse Electric Corp., Phg.,
"Steady-State Thermal Analysis Code", WAPD-S5W -NA-145.
3. IBM 701/704/709 Bulletin No.5, Jan. 1958, p. 5.
4. NCG Newsletter No.5, p. 4.

B - 704 Nuclear
704 Nuclear Code

(1) Code Originated by:

704 Nuclear Code

(I)

Code Originated by:
Combustion Engineering, Inc.

(2.) Computer:
~

(2.)

Computer:
~

(3) Description of Code:

(3)

Description of Code:
The COGENT Code solves the one-dimensional neutron diffusion
equation for 30 coupled energy groups with an external neutron
SOurce. The code will handle slab, cylindrical or spherical
geometry. COGENT provides for a maximum of ten isotopes
and six scattering matrices. The external source rna y be speCified
region-wise constant, group-wise constant, region-wise by group,
or point-wise by group. As output, in addition to the point-wise
fluxes the code provides flux weighted macroscopic constants.

(4)

Restrictions or Limitations;
Problems arc limited to a maximum of 101 spatial mesh points
and 4 material regions. 16K 704, 5 tape units, 1 drum unit.

(5)

Approximate Performance:
Average problem requires approximaLely 40 minutes.

(6)

References:
~-18.

Westinghouse - Bettis Plant

One space dimension and time few-group depletion code for rectangular,
cylindrical, and spherical geometry. Fast group constants are
computed from effective one-velocity microscopic cross sections.
Thermal microscopic cross sections and self-shielding factors are supplied as input data. The WANDA calculation is used to determine the
corresponding eigenvalues and nux shape. Criticality may be
maintained by varying the transverse buckling, a homogeneous pOison,
or the location of a boundary between a poisoned and unpoisoned region.
The nux is normaliz.ed to a specified power and assumed to be constant
for a specified length of tilTle. The isotopic densitio!s are recolTlputed
at the end of this time using the normaliz.ed nux. A maximum xenon
calculation is optional at each time step.
(4) Restrictions or Limitations;

Max of 2.5 regions and 2.50 mesh intervals with either two or four groups.
At most 2.5 time steps can be done automatically. Only the uranium,
plutonium, and fission product chains along with two burnable pOisons
are considered time dependent with a maximum of 30 clements in all.
Code requires 8K core, four tape units, and one drum unit.
(5) Approximate Performance:
. From 15 min. to 4 hrs. Average of 30 min.

704 Nuclear Code

(6) References:
1. L. Culpepper, E. Gelbard, G. Hoffman, O. Marlowe, D. McCarty,
P. Ombrellaro, D. Saalbach, "CANDLE - A One-Dimensional
Few·Group Depletion Code:: for IBM 704". WAPD-T M-53 (Add.l),
WAPD-TM -53 (Add. 2.), May 1957.
2.. IBM 701/704/709 Bulletin No.5, Jan. 1958, p. 9.

704 Nuclear Code

11)

Code Originated by:
Combustion Engineering, Inc.

(3)

Description of Code:
This program. is de signed to solve the one -dimensional,
mono-energetic P3 approximation to the transport equation in
cylindrical geometry. The cylinder is assumed to be infinitely
long and symmetric with respect to rotations about the Z axis.
The external boundary condition may be specified as reflecting
or vacuum or as a special type of cell condition. Anymaterial
region of the problem may be specified as having all zero cross
sections. that is, an interval void. An external isotropic source
may be specified by region or point wise. The code utilizes the
first four spherical harmonics of the scattering cross section.

(4)

(1) Code Originated by:
GE Knolls Atomic Power Lab.
(2.) Computer:
704
(3) Description of Code:
Solves age-diffusion equations for neutron nux distribution in a reactor
for r-z, re, or x-y geometry. Multiplication of the reactor is
computed. Includes calculation of averaged three-group macroscopic
cross-sections from physical compositions according to prescriptions
of R. W. Deutsch. Irregular boundaries, variable mesh spacing, a..."1.d
deletion of points are permitted in the spatial mesh. Several versions
are available from KAPL which differ in speed, use of machine. si7.c oi
problem, and input.
(4) Restrictions or Limitations:
The code permits at most 40 compositions and allows about 700 sp ...ce
pOinLs for an 8K memo~y.
(5) Approximate Performance;
3 min./source iteration for 700 pts., 3 groups.
(6) Rci(:re::nc·es;
1. E. L. Wachsprcss, "CURE: A Generalized Two-Space Dimension
Multigroup Coding .of the 704", KAPL-172.4, May 1957.
2.. IBM 701/704/709 Bulletin No. ~, January 1958.

Restrictions or Limitations:
Problems are liIllited to a maximum of 150 spatial mesh points
and. 10 material regions. Code performance is most satisfactory
for problems with radii of 5 or fewer mean free paths.

704 Nuclear Code

(5)

Approximate Perforlnance:
MaJdmum problem runs in approximately 1.5 minutes.

(I) Code Originated by:
Westinghouse - Bettis Plant

(6)

References:
CEND MPC -2.0.

(2.) Computer:
704

704 Nuclear Code

(3) Description of Code:
Depletion ver sion of TKO
(6) References:
Letter. July 31, 1958.

(l) Code Originated by:

Westinghouse - Bettis Plant

EURIPUS - 3 and DAEDALUS

704 Nuclear Code

(2.) Computer:
~
(31 Description of Code:
Fits by least squares the curve y ::. A cos B (x-C) to from 4 to 500
points of observed data. computing the parameters A, B, C, and
the standard devisions of the estimates of A, B, C •.• ,SA' SB' Se.
It is also possible to investigate the error in a region about the
final values of A, B, C. by computing the sums of the squares of
the residuals at a series of points in the neighborhood.
(5) Approxiznate Performance:
500 point problem _ 8 min.
(6) References:
~derson, T. J. Lawton, "CO FIT - A Least Squares Cosine
Fitting Program for the IBM - 704", WAPD-TM-2.6, October, 19S6.

(1)

Code Originated by:
Westinghouse - Bettis Plant

(2.)

Computer:
~

(3)

Description of Code:
EURIPUS - 3 calculates the one-dimensional spatial density of
neutrons slowing-down past a given energy in an infinite
homogeneous medium consisting of hydrogen and one other
isotope with arbitrary mass and energy-dependent differentialelastic and absorption cross-sections. DAEDALUS determines
the corresponding spatial distribution of angular integrals of an

(Continued on next page)

219

arbitrary function times the vector flux density. Spatial moments
of all density functions are furnished directly. The neutron source
may be monoenergetic with eithcl' isot:t'opic or monodirectional
angular distributions, or else the source ITlay be that from
deuterons bombarding de'.lterons.

(6)

References:

~letcher, J. P. Jewett, E. D. Reilly, Jr., "FLEER:
A Two-DiITlensional Mesh Diffusion Program for the
IBM 704", KAPL-20B6 (1960).

Material Available:
1. KAPL-20B6.
2. Binary deck.

(7)

Restrictions or Limitations:
A 3ZK core memory is required, and S'tape units are required.

(4)

References:

(6)

~ster, H. G. Kuehn, J. Spanier, "EURIPUS - 3 and

Note:

The infol"IIlation above was abstracted from KAPL-2086.

DAEDALUS -- Monte Carlo Density Codes for the IBM-704",
WAPD-TM-Z05, February, P:l60.
704 Nuclear Code

704 Nuclear Code

(1)

Code Originated by:
Westinghouse .- Bettis Plant

(1) Code Originated by:
Westinghouse - Bettis Plant

(2)

Computer:
~

(2) Computer:

{3}

Description of Code:
P3, P5, P7, double PI, double P2, double P3 approximation,
slab geoITletry, one energy. group.

(6)

References;
1. Letter 7/31/5B.
2. Paper OIC-1161 UN 639 (Supp.), E. H. Barciss.

704
(3) Description of Code:

Fits a set of observed data, Yi' to a curve of the form y ;:; AeBx
where each Yi value may be v.eighted by some Yi. It is possible to
compute the parameters A and B and the estimate of the error in
each parameter. The maximum allowable number of points in 500.
(4) Restrictions or Limitations:
Requires a 4096 word core. No drums or tapes are used. No
account is taken of "wild" points and their inclusion may result in
a poor fit.

(1)

Code Originated by:
GE Knolls Atomic Power Lab.

'(2)

Computer:
704 (FORTRAN)

(3)

Description of Code:
FLT was developed specifically for the calculation of flow transients
occurring in a multi-loop flow system closed by a common flow
path. The program is based on a multi-loop model of up to three
inertially symITletric flow loops with one canned rotor, variable
frequency, induction motor driven pUInp per loop having a separate
motor power supply.

(4)

Restrictions or Limitations:
An BK memory is required.

(5)

ApproxiITlate Performance:
The probleITl should run between. 06 hrs and. 1 hrs for any accident
with final tiITle of 6.0 seconds and just transient output.

(6)

Referel1ces:
rG.H.Borrmann, R. D. Burgess, B. L. Strain. R. B. Taylor,
"FLT, An IBM-704 Digital Computer PrograITl for the Calculation of Multi-Loop Flow Transients", KM-DIG-TD-14
(1961).
Material Available:
1. KM-DIG-TD_14 (This document contains a listing of the FORTRAN
source prograITl).

(5) Approximate Performance:
2 minutes for 30-40 paint problem.
(6) References:

~nderson, T. J. Lawton, "COFIT - A Least Squares Cosine
2.

Fitting Program for the IBM-704", WAPD-TM-26, October, 1956.
B. L. Anderson, T. J. Lawton, "ESFIT", CPM-M-67, June, 1957.

704 Nuclear Code

FLT

704 Nuclear Code

(I)

Code Originated by:
Los Alamos Scientific Labratory

(2)

COITlputer:
~

(3)

Description of Code:
NUITlerical solution of diffusion equation for slab, cylinder or
spherical geometry; with Hydrogen, inelastic scattering,
continuous slowing down.

(5)

ApproxiITlate PerforITlance:
1-l/2 minutes

(7)

(6)

References;
I. LA-Z161
2. Summary, September 1958.

~:

The information above was abstracted frOITl KM-DIG-TD-14.

704 Nuclear Code
704 Nuclear Code

(1)

(2)

Code Originated by:
GE Knolls Atom;.c Power Lab.

Descr:'ptior. of Code:
FLEER will solve the three-group, two-dimensional neutron
d~f£usion equation in a triangular coordinate system.
Up to
14.000 mes!-J. pO:I~ts are allowed. The outer boundary of the
point mesh must be a parallelogram. A special 120 degree
peri.odic bou,..dary condition is allowed on two of the sides.
Available boundary conditions are flux zero, current zero, and
a logarithmic boundarj €ondition. Few-group cross sections
are calculated within the code. Flux iteration is accoITlplished
by a "bent" lir..e relaxation teChnique.

(4)

Restricti.ons or Limitatior.s:
A 3lK ITlemory ~s required, as well as 7 tapes and 4 drums.

(5)

Approximate Perfo"l'mance:
Approximate running time for a problem is about 40 minutes
per 1000 points.
(Continued on next column)

220

Code Originated by:
Westinghouse - Bettis Plant

(2)

Computer:
~TRAN

(3)

Description of Code:
F0020 is a therDlal analysis code developed to reduce transient
test data for a single, vertical, rectangular coolant channel.
Modes of heat transfer for water at 2000 psia covered by this
code include: (1) forced convection (turbulent flow), (2)
nucleate bOiling, (3) departure frOITl nucleate boiling, (4) partial
filITl boiling, and (5) filDl boiling. The code is written in
FORTRAN.

(4)

Restrictions or LiITlitations:
The code will accomITlodate a plate mesh, and associated heat
generation weighting factors, of a ITlaxiITluITl of 50 axial and 10
radical mode s.

Computer:
704

(3)

(1)

In order to insure numerical stability, a limitation is imposed
upon the length of the tiIlle step.
••
This code requires a 32K core ITlemory and two tape units.
(Continued on next page)

B - 704 Nuclear

(:')

Approximate Performance:
For a sample problem, the 704 running time was 3.3 rninutes
for the calculation and normal point-out of the 3.3 minutes of
running time, approximately 1.5 rninutcs were used in writing
the output on tape.

(6)

Hekrcnccs:

~al1aghan, J. S. Williams, Jr.

j "F0020 - An
IBM-704 Thermal Transient Analysis Code", WAPD-TM-145,
January, 1959.

704 Nuclear Code

(1)

Code Originated by:
Aerojet-General Nucleonics

(2)

Computer:
70.

(3)

704 Nuclear Code

(1) Code Originated by:
Westinghouse - Bettis Plant

(4)

Lirnitations or Restrictions:
An 8K memory is required.

(5)

Approximate Performance:
A full_size run requires approximately 15 rninutes.

(6)

References:
~Rcynolds, D. W. Thompson, C. R. Fisher, "HECTIC,
An IBM 704 Cornputer Program for Heat Transfer Analysis of
Gas-Cooled Reactors", AGN-TM-381 (1961).

(7)

Material Available:
1. AGN-TM-381.
2.

(2) Computer:
-70-'-(3) Description of Code;
Fits, by an iterative l.east squares technique, the function Ae Bx plus
C to a set of observed, weighted data. The three parameters c..nd an
estimate of the standard deviations on the parameters are calculated.
(6) References:

~nderson. T. J. Lawton, "COFIT - A Least Squares Cosine
Fitting Program for the IBM-704", WAPD-TM-Z6, October, 19S6.

Description of Code:
HECTIC 1s a computer program for calculating heat transfer rates
and temperatures in the fuel elements of typical gas-cooled nuclear
reactors. Effects of turbulent interChange betwecn flow passages
',are considered. The computation procedure amounts to a "nodal"
. or "lumped pararneter" type calculation.

Note:

The information given abovc was abstracted frorn AGN-TM-381.

704 Nuclear Code

Nuclear Codes

1.

Name of Code:

2.

Computer:
IBM 704
Programming System:
FORTRAN II

HAFEVER

3.

ABSTRACT:
Nature of problem solved; Caluculation of the energy exchange
inelastic scattering cross section (integrated over angle) according
to the Hauser- Feshbach theory as modified by D. Goldman. This
modification includes the effect of spin-orbit coupling on the
transmission coefficients.

HERD

(1)

(2)

-

I,

704 Nuclear Code

Z and 3

Code Originated by:
Westinghouse - Bettis Plant
Computer:

~
704 Nuclear Code

(1)

Code Originated by:
Westinghouse - Bettis

(Z)

Computer:
~

(3)

Description of Code:
HEAT is a code which finds a one-dimensional solution to the
general heat transfer equation. Specifically written £01' application in reactor fuel rod design. _the code require s cylindrical
geornetry conditions and input parameters of surface temperature
and power density. The conductivity may be assumed to be a
fUnction of temperature.

(3)

Description of Code;
The HERD codes furnish a numerical approximation to the solution
of the one-dimensional, one-velocity neutron transport equation
(scattering and sources assumed to be isotropic) in slab geometry
using the method of discrete ordinates. Let' F(x. p) represent the
vector flux withj-\:cos
and let x'" A be the boundaries. The
HERD codes differ in the boundary conditions imposed;

e,

Plant

HERD 1 F(o.,....)" F (0,4)-,) and A is an axis of symmetry.
HERD Z F(o ,fA) is specified for o..(p. <. 1 and A is an axis
symmetry.
HERD 3 F(o,,u) is specified for 0<'11<1 and F(a'Jl) ·0
for-l:!:
The SET codes (SET 02. and SET 03) obtain a numerical solution
to the problem of stresses in a pressure vessel with an
ellipsoidal head. The codes are based on a finite-difference
approximation to the Love-Weissner equations which are the
basis of the bending theory of thin shells. The SET 02 code
uses a direct method to solve the system of difference equations
while the SET 03 code uses an iterative method.

(4)

Restrictions or Limitations:
A typical problem is run on the SET 02 code much faster than on
the SET 03 code. On the other hand, the SET OZ is subject to
round off errors when the mesh is sufficiently refined, while the
method used in the SET 03 code is inherently "stable". A 3ZK
core memory is requl-:'ed 1 as well as 2. tapes. No drum.s are
required.
Restrictions:
1. Number of intervals in ellipse: 5 ~ n!S' 500
2. Number of regions in ellipse:
::s;. 10
3. NUlTIber of regions in cylinder: S 10

(6)

References:
~ilodena. J. B. Callaghan, H. Kraus, "The SET CodesIBM 704 Codes for the Calculation of the Stresses in a Pressure
Vessel with an Ellipsoidal Head", WAPD-TM-174, June, 1959.

(2) Computer:
704
(3) Description of Gode:
This program is used to calcuLate resonance escape
probabilities using the procedUre described by Adler, Hinman
and Nordheim. The code allows three types of reactor compositions; homogeneous - metal fuel and heterogeneous - oxide fuel.
The code wilt also calculate the effective resonance integral
for each resonance using either the narrow resonance (NR), or
the narrow resonance, infinite mass approximation (NRIA).
(4) Restrictions or Limitations:
16K 704, 2 tape units.
(5) Approximate Performance:
Average problem takes approximately. 25 minutes per resolved

(6) References:

~r, G. W. Hinman, L. W. Norheimj "The Quantitative
Evaluation of Resonance Integrals", GA-350, SEND MPS-19.

704 Nuclear Code

223

704 Nuclear Code

SOFa CAT E

(1)

Code Originated by:
Westinghouse - Bettis Plant

(1)

(Z)

Computer:
~

(2)

Description of Code:
Detennines 1-, Z-, 3-, or 4-group fluxes due to source in
multiplying medium. Solves inhomogeneous P3 or double PI
one-group problem with proper choice of parameters.

(3)

(3)

(4)

Restrictions or Limitations:
I to 4 groups, 25 regions, Z50 mesh intervals.

(5)

Approxima te Performance:
1 minute.

(6)

References:
L. M. Culpepper, E. M. Gclbard, J. Davis. J. Pearson,
"The IBM 704 SrMPL Codes", WAPD-TM-I07, January 1958.

704 Nuclear Code

Code Originated by:
Westinghouse - Bettis Plant
Computer:

-70-'--Description of Code:
By solving the Wigner-Wilkins differential equation, the code

detcrlnines the neutron spectrulTl in a hOlTlogeneous mixture
where the absorption cross sections of the constituents :may
vary arbitrarily with energy. The code will always compute the
macroscopic absorption cross section,vE-r • the f1~x a\'craged
diffusion constant and microscopic fission cross sectlOns. In addition, any de·sired function may be averaged over the rL·sultaut
flux even though it may not be present in the mixture.
(4)

Restrictions or Limitations:
Energy limit is 2.0 ev; only two choices of mesh.

(5)

Approximate Performance:
30 seconds.

(6)

References:
~er, R. Suarez, the Calculation of Thermal Constants

SIMPL

(1)

(2)

-

2

Averaged over a Wigner-Wilkin::. Flux Spectrum: D"sc:--:ptlO!j of
the SOFOCATE Code, WAPD-TM-39, January 1957.
2. IBM·701/704/709 Bulletin No.5, January 1958, page 2.5.

704 Nuclear Code

Code Originated by;
Westinghouse - Bettis Plant

SPAN -

Z

704 Nuclear Code

Computer:

-70-4---

(1)

Description of Code:
Determines scalar flux for one group P3 or double PI problem
with proper choice of parameters.

Code Originated by:
Westinghouse - Bettis Plant

(2)

Computer:
~

(4)

Restrictions or Limitations:
A m ..Xlmum of 50 regions and 500 mesh intervals are permitted.

(3)

(5)

Approximate Performance:
I minute.

(6)

References:
L. M. Culpepper, E. Gelbard, J. DaviS, J. Pearson,
"The IBM 704 SIMPL Codes", WAPD-TM-I07, January 1958.

Description of Code:
The SPAN - 2. code calculates the uncollided gam.ma flux at a
point outside a right circular cylinder which is surrounded by
cylindrical shell shields and above which are plane slab shields.
The cylinder is assum.ed to contain a source of garnrna radiatior:.
which varies in the radial and axial directions only. Field pOint:
may be located in a plane through the axis of the cylinder. The
method of integration used is three-dimensional Gaussian
quadrature.

(3)

The code's primary applications are expected to be in radiation
heating probleITls and in calculating galnma dose rates.
(4)

Restnctions or Limitations:
A 32K core memory is required.
Restrictions:
a. The num.ber of mesh intervals may not. exceed 78 in the r dire("li.):
or lLJ in the z direction. The total number of mesh intervals
may not exceed 6500.
b. The nUlnber of energy levels cannot exceed 30.
c. The number of side shields cannot exceed 30.
d. The number of top shields cannot exceed 30.
e. There may be I, 2, or 3 regions inside the core. The sum of
thicknesses of these regions must be equal to the core radius.
f. The number of lTlaterials in any region cannot exceed 9.

(5)

Approximate Performance:
Typical computing and editing time for a 20 field pOlont problem,
which then: are 10 side and 10 top shields, is four minutes per
en«rgy level.

704 Nuclear Code

(1)

Code Originated by:
Los Alamos Scientific Labratory

(Z)

Computer:
~

(3)

Description of Code:
The program is a neutron diffusion code which solves the neutron
transport equations in the stationary case, using the Sn method
(LA-1891), and assuming isotropic scattering and one-dimensional geometry. The present version of the code has been
modified to reduce the number of iterations required in a glven
problem by better than a factor of two. The code is readily applicable to any Sn approximation of reasonable order (constants for
n = 2, 4, 6, and 8 supplied), to anyone-dimensional geometry
(plane, spherical or infinite cylindrical in sYlTlmetry), and to the
three eigen-values: reactivity. outer dimenSion, or exponential
rate. The program was written using the Los AlalTlos FlowCode
System (FLOGO).

(6)

.:~

References:
T:'P.A.Gillis, T. J. Lawton, K. W. Brand, "SPAX - 2 - An
IBM 704 Code to Calculate Uncollided Flux Outside .. Circular
Cylinder". WAPD-TM-176, August, 1959.

704 Nuclear Code
(6)

224

References:
1. The report is a revision of T-1-119 issued NovelTlber 24,1956,
describing a code for solving the neutron transport equation in
the stationary case using the Sn method (LA-1891), and aSSUlTling isotropic scattering and one-dimensional geometry.
2. IBM 701/704/709 Bulletin No.5, January 1958, p. 23.
3. NCG Newsletter No.3, 3/1/57. page 2Z.
4. NCG Newsletter No.5, 9/1/57, page 4.

(1)

Code Originated by:
Westinghouse - Bettis Plant

(2)

Computer:
~

(Continued on next page

B - 704 Nuclear

(3)

(4)

(5)

(6)

Description of Code:
The SPJC - 1 code calculates the fast~neutron dose rate or the
thermal neutron flux at a point outside a right circular cylindrical
source which is surrounded by cylindrical shell shields and is
capped by plane slab shields. The fast neutron attenuation kernel
is empirical and is in the form of a linear combination of single
exponentials which has been fitted to the experimental fast-nelltron
dos.) rate distriblltion in pure water. Empiri.:al neutron removal
cross-sections are used to represen\ the attenuation by shells of
non-hydrogenous materials located in the water.
Restrictions or Limitations:
A 3ZK core mcmory is required.
SPAN - Z code.

TEMP

_ Z

704 Nuclear Code

(1)

Code Originated by:
Westinghouse - Bettis Plant

(Z)

Computer:

(3)

Description of Code:
The TEMP - Z program solves the difference form of the
one -dimensional transient heat-conduction for a body with an
arbitrary initial temperature distribution and either the
temperature, its normal gradient, or a combination of the two
specified on the boundaries. An implicit difference scheme is
used. The thermal stresses resulting from the temperature
distribution arc then obtained by a regionwise application of the
analytical stress expressions of Reference 6 (Z) below.

(4)

Restrictions or Limitations:
The size of the core memory required is not given in Reference
6 (I), but it is believed to be 3ZK. The program provides for
minimum of 7 and a maximum of Z5l mesh points which may be
distributed over a minimum of 3 and a maximum of 25 regions.

(5)

Approxilnate Performance:
The solution of a 41-point problem requires about 5 seconds of
computer time per time step.

(6)

References:
~ulpepper, D. lortner, "TEMP - Z, a One-Dimensional Thermal Stress Program for the IBM 704",
WAPD-TM-ZI4, April, 1960.
Z. S. Timoshenko and 1. N. Goodiea, Theory of Elasticity,
2nd. EditlOn, McGraw-Hill, New York, 1951, p. 399.

704

Other limitations arc those of the

Approximate Performance;
Typical computing and editing time for a ZO -field-paint-problem,
in which there arc 10 side and 10 top shields, is 6.5 minutes.
References;

~, "SPIC - 1 - An IBM - 704 Code to Calculate the
Neutron Distribution Outside a Right-Circular Cylindrical
Source", WAPD-TM-196, November, 1959.

STDY-3

704 Nuclear Code

(1)

Code Originated by:
Westinghouse-Bettis Plant

(Z)

Computer:
704 (FORTRAN)

(3)

Description of Code:
STDY _3 is a computer program designed for the thermal analysis
of a pressurized water nuclear reactor during steady-state
operation. It performs a complete steady_state. parallel channel
thermal analysis of a rectangular water channel core with a
plate-type fuel element.

(4)

Restrictions or Limitations:
A 16K memory is required, as well as three tape units and a
logical drum.

(5)

Approximate Performance:
Typical computing time for a. two-pass core containing a hot
channel in each pass is O. 7Z minutes.

704 Nuclear Code

(I) Code Originated by:
Westinghouse - Bettis Piant
(2) Computer:

-70-4--

(6)

References:
~yle, "STDY-3", Computer Code Abstract No.5,
Nuclear Science and Engineering, 2" p. 102, 1961.
Z. WAPD-TM-Z13.

~:

(3) Description of Code:

Three -dimensional, few group diffusion code.
(6) References;

~l-58.

The information given above was abstracted from Reference 1.

704 Nuclear Code

SWAP MU and NU

704 Nuclear Code

(l)

(Z)
(1)

Code Originated by:
Wc:>tinghousc - Bettis Plant

(Z)

Computer:

Description of Code:
The code is designed to compute the uncollided particle flux as
a function of the distance from a homogeneous cylinder containing
a uniform isotropic source distribution. assurrdng that the attenuation of the particles is exponential, both within the cylinder as well
as in the attenuating shells or slabs.

(5)

Approximate Performance:
About (Z6N plus 150) /6 seconds, where N is number of cases.

(6)

References:
N. L. Barnett, "Swap Mu and Nu", WAPD-P-707, Oct., 1956.

Computer:

-70-4--

(3)

Description of Code:
The TRIP - 1 pragraITl is designed to solve the P3 equations in
X-Y geometry. Only one-group cell problems are treated. The
cell is assumed to be rectangular. with regionwise constant
cross-sections. The source is isotropic and regionwise flat.
Anisotropic scattering is dealt with rigorous~y (within the limits
of a P3 approximation). Simultaneous line over-relaxation is
used to solve the difference equations.

(4)

Restrictions or Limitations:
A 3ZK core memory is required. Nine tape units are required.
No more than Z500 interior mesh points are allowed.

(6)

Refc renee s:
I. E. Gelbard, J. Davis, 1. Dorsey, H. Mitchell. 1. Mandel,
"TRIP - I, A Two-Dimensional P-3 Program in X-Y
Geometry for the IBM - 704", WAPD-TM 2.17, July. 1960.

~
(3)

Code Originated by:
Westinghouse - Bettis Plant

225

704 Nuclear Code

704 Nuclear Code

(1) Code Originated by:
Westinghouse - Bettis Plant

(1) Code Originated by:
G. E. Knolls Atomic Power Lab.

(2) Computer:

(2) Computer:

~

~

(3) Description of Code:
Two space dimensions and t.illle version of CANDLE for x-y (TURBO 1
and 3), and r-z (TURBO 2 and 4) geometry. Otherwise same as
CANDLE except that the PDQ spatial calculation is used. Maximum
xenon calculation is TURBO-3 for x-y or TURBO-4 for r-z.

(3) Description of Code:
Three-dimensional few group neutron diffusion code in x-y-z
geometry. Variable mesh spacings along all three directions with
zero flux or specified current boundary conditions for any of the six
boundary planes are permitted.

(4) Restrictions or Limitations:

Mesh planes per direction (I, J, or K)
Mesh paints per plane
Material compositions
Point types (0)
Groups
I.J.K
70

Max of 35 compositions. Number of mesh points limited by size of
core according to the number pairs BK-2500, 16K-3750, 32K-6500;
with a minimum of B192 words of core storage. Automatically calculates one time step with provision for continuing later. No automatic criticality search is provided. Also requires ten tape units
and one drum unit.
(5) Approximate Performance:
Approximately 1.5 hours per time step.,
(6) References:
~ount, "TURBO", CPM-M-80, 9-3-57 (Preliminary

description) •
2. E. Gelbard, M. Culpepper. n. McCarty, C. King, T. Lawton,
J. Fairey. O. Marlowe. J. Callaghan, "TURBO - A Two Dimensional Few-Group Depletion Code for the IBM 704", ,WAPD-TM-95.

+

>

3

~ 4000
~ 512
~ 1900
::i 5
~ 30,200

(5) Approximate Performance:
Thirty-five (35) minutes pre-iteration calculations plus 15 minutes
per source iteration (1st two iterations) or 12 minutes per source
iteration (beyond second) plus 15 minutes for edits. Times are for
a 12,000 - point mesh. 3-group problem.
(6) References:
KAPL - 1999.

WANDA 2.

3
704 Nudea.r Code

704 Nuclear Code

(Z)

Computer:
-70-4---

(3)

Description of Code:
Transi~nt temperatures and stresses in axially symmetric solid
or hollow bodie s.

(6)

References:
1. Letter 7-31-58.
2. ADD-:'7-B and ADD-58-1Z describing the program are
available with the program from IBM.

TUT

T5

704 Nuclear Code

(1)

Code Originated by:
Westinghouse - Bettis Plant

(2)

Computer:
-70-4--

(3)

Description of Code:
The TUT - T5 code provides, for a one_energy model, a means
of calculating a regionwise distribution of capture probabilities
in a two-dimensional quarter-cell. The method used is the
Monte Carlo method, in which neutron histories are simulated
by the code and then used to provide estimates for the integrals
which define the capture probabilities.

(4)

(5)

(6)

226

-

(1)

Code Originated by:
Westinghouse - Bettis Plant

(2)

Computer:
~

(3)

Description of Code:
Sohles the few-group diffusion equation in one space dimension for
rectangular·, cylindrical, or spherical geometry by setting either
the flux or its derivative to zero on the boundaries. The parameters
must be continuous within a region, but may have a finite discontinuity
at the interfaces between regions. The mesh width must be constant
within a region. An initial source guess is required to start the
iteration process. Convergence may be defined either by a percentage deviation in the ,eigen value or by a percentage deviation between successive source vectors .•

(4)

Restrictions or Limitations:
Requires an BK core merrlOry, 1 drum unit, and 1 tape unit.

i5)

Approxitnate Performance:
1_15 minutes, average 3 minutes.

(6)

References:
~arlowe, C. P. Saalbach, L. M. Culpepper,

D. S. McCarty, ·'WANDA -- A One-Dimensional Few Group
Diffusion Equation Code for the IBM-704", WAPD-TM 28,
November, 1956.
2. O. J. Marlowe. E. M. Gelbard, WAPD-TM-28 (Addendum).
September, 1957.

WANDA

-4

(1)

Code Originated by:
Westinghouse - Bettis Plant

704 Nuclear Code

(2)
Restrictions or Limitations:
A 32K core memory is required. As many as 32 regions can
be treated, all of different material content; however, the
content of each region must be uniform. The number of neutron
histories must be less than or equal to 1000.

Computer:
~

(3)

Description of Code:
An improved version of WANDA - 3 which eliminates use of the
drum unit and provides an automatic extrapolation procedure to
accelerate convergence of the iteration process.

Approximate Performance:
Running times may be from one to two hours. A method of
estirnating the time required is given in the reference cited below.

(4)

Restrictions or Limitations:
An BK core memory is required as well as one to four tape units.

References:
'I. J. Spanier, H. Kuehn, W. Guilinger, "TUT -T5-A
Two-Dimensional Monte Carlo C lculation of Capture Probabilities
for the IBM - 704", WAPD-TM-125, November, 1959.

(6)

References:

~arlowe. "WANDA -- A One-Dimensional Few-Group
Diffusion Equation Code for the IBM-704", WAPD-TM-28
(Addendum 2), July, 1959.

B - 704 Nuclear

WBTSG-L

(1)

(2.)

704 Nuclear Code

Code Originated by:
Westinghouse - Bcttis PLant

Matl'rial k:ailablc:
l. Binary Editor Deck (7090).
2. FLOCO 11 F Binar}' Deck (7090).
3. 2DXY Deck (7090).
4. Sample Problem Inp\:"t Dl'ck (090),
5. AGN TM- 392.

~:

Computer:

~
(3)

(7)

Description of Code:
Computes in one -dimensional form the tangential, axial, and
radial thermal stresses for cylinders with internal heat genera-

1.
2.

The abo\·C' ir>iormation was taken from Reference 3.
This code was cont.ributed through !.he Argor,De Code Center.
The binary edit.or program refet!.'ed to above is essentially a
compatibiHty package for the 7090.

tion.
(5)

Approximate Performance:
20 m i n u t e s . - - - - -

(6)

References:
1. D. M. Davis, B. H. Mount,tlThe Calculation of Thermal
Stress in Cylinders with Internal Heat Generation",
Description of WB-TSG-l Code. WAPD-TM-59, May,1957.
2. G. Sonneman, D. M. Davis, "Stress in Long Thick-Walled
Cylinders Caused by Pressure and Temperature Gradients",
WAPD-TM-570.
3. NeG Newsletter No.5, p. 5.
4. IBM 701(704/709 Bulletin No.5. Jan., 1958, p. 31.

704 Nuclear Code

(1)

Code Originated by:
University of California, Radiation Lab.

(2)

Computer:
~

(3)

Description of Code:
Solves the one-dimensional multigroup neutron diffusion equation
for slabs, cylinders or spheres. A maxirn.urn. of 10 rn.aterials,
30 regions (or zones) rn.ay be used. A higher order differencing
is used for the Laplacian and a general transfer matrix is
permitted.
.

(5)

Approximate Perforrn.ance:
Wrn.inu~---

(6)

References:
UCRL 5293-T-Preliminary (UCRL 5293 available in about 1 month),
September 1958.

2DXY

704 Nuclear Code

(1)

Code Originated by:
Aerojet-General N.lcl".onl,cs

(2)

Computer:
704,
(FLOCO.·U-m

(3)

Description of Code:
The 2DXY program sC'bes the. homC'geneol;s or inhomogeneous multigr('l.'p ttilflSport. cqllaticl'. in xy ¥~<)mctrv. Vacuum, surface source, 01
refl€.ctil.g bo,:ndary ccr.dit!.o!"_s are aV3ilabie as options. In the homogeneo'J.S case the user may re:ql;€&t Ihe ccmp'-l.taHon of reactivity,
period, critical cor.centrationa of some compos£tion or the critical
thickness of a zone. The Sr.. approximation is used,

(4)

Restrictions or Limitations:
ScattE'ring must be isotrop~C".

(5)

~oximate:

(6)

References:
1. J. Bengst.or" S, T. Perkins, T. W. Sheheen, and D. W. Thompson,
"2DXY . A Two-Diml!ns:i.onal Cartt'.siar, Goordir.ate Sn Transport
Calculat.ion", AGN··TM-329, 1961.
2. B. Carlson, C. Let:', and J. Wodto:c., "Tht. DSN aT.d TDC Neutron
Transport Codes'" LAMS-2346. 1961.
3. S. T. Perkins, T. W. She,'lecl:I, D. W. Thompson. "2DXY",
Computer Code Ahstra(t Nt.. 18, Nc.dea~ Scienc(" and Engineering,
.!....Q.. p. 408, 1961.

Performance:
One and one-half hours for 6 grOli.p, 1000 mEsh points on the 7090
(using the binary editor}.

(Continued on next column)

227

B - 705

of tape input and output. The sub-routines are designed primarily to process
tapes using the UQ USAF tape identification system but tapes lacking headers
and trailers may be processed. The major parts of the package are:

GUIDE
PROGRAM WRITE-UP ABSTRACT

a. Input/output macros to read a tape, write a tape, read-whiLe_write a tape,
read and deblock blocked records, and block-up and write blocked records,

INDICATIVE CODE

PROGRAM NAME

AF-001_1

b. A sub-routine (lDENT) that provides for TRA operations, output tape
labelling and input tape label verification.

CHANGE-CARD-LOAD

PURPOSE: To load program cards into memory in the same manner as the standard
lower load program. Also, to allow special patch cards to be loaded as if they
were normal instruction cards.
MACHINE· 702 _ _ _ __

705_~X,"-_ Model~Oth"_-;:----:::-:--_

(Specify)
'Tapes _ _ _ _ 'prlnter _ _ _ TRC _ _ _ _ Drum _ _ _ _ __
7(fJ _ _ _ _ _ Other _ _ _ _ _ _ _ _ _ __

Cord Reodcr _ _
X_
PROGRAM LANGUAGE:

Autocoder ~ Symbolic _ _ _ Actual _ _ _ __

~he'------~(~SP-,~d~~')---------

c. A sU:b-routine (IDWCP) that in addition to the IDENT functions includes a check
point routine. Check points arc taken automatically at EOF but may be taken
at any other time desired. Provision is made fOr program interrupt.
d. A restart program for use with IDWCP,

This is a separate program that
enables you to restart to any check point taken by IDWCP. The routine
checks tape labels, today's data, repositions tapes, and restores memory
and ASU's 01-13. Since the restart begins with memory cleared it is useful
in situations where long runs are interrupted,
MACHINE· 702 _ _ _ __
Model~Other _ _ _ __
705
X
(Specify)
'Topes _ _ _ _ 'Printer _ _ _ TRC _ _ _ _ Drum _ _ _ __
Cord Reader _ _ _ 760 _ _ _ _ _ Other _ _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

PROGRAM TYPE: Complete Program _--'X"-_ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instruction _ _ _ _ _ _ label _ _ _ _ _ _ _ __
Subroutine _ _ _ _ _ _ __

Autocoder _ _
X _ Symbolic _ _ _ Actual _ _ _ __
Other

------~(~Sp-,~,;-;-fy')- - - - -

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __

label _ _ _ _ _ _ _ __
Macro-Instruction _ _ _ _ _ _ Label _ _ _ _ _ _ _ __

CONTRIBUTED BY,
Headquarters, USAF
AFASC-3E
Washington 25, DC

Subroutine

_~X,,-

_ _ _ __

Label

IDWCP

CONTRIBUTED BY:
Headquarters, USAF
Any questions should be addressed to:
George Widding, AFASC-3E-l
Data Processing Division
Headquarters, USAF, Washington 25, D,C.

April 1958, Bulletin 57 - 45

Distribution No.4

GUIDE
GUIDE

PROGRAM WRITE-UP ABSTRACT

PROGRAM WRITE-UP ABSTRACT
INDICATIVE CODE

PROGRAM NAME

AF-003-0

INDICATIVE CODE

MEMORY prJNCH OUT

PURPOSE: To punch out program decks incorporating change cards to cut down the
size of program decks and serial number cards in the deck. This removes the

705 _ _-"X_ _

Mod'I---L-~h"_--;;:-'::7"

MACHINE· 702 _ _ _ __

__

(SP'c\~)
'Tapes _ _ _ _ 'prlnter _ _ _ TRC _ _ _ _ Drum _ _
_ _ __

Cord Reader _ _X_ 7(fJ _ _ _ _ Other Option. punch or tape unit
PROGRAM LANGUAGE:

TAPE PRlNT OUT

PURPOSE: To accomplish a transformation of data from tape to tape in a manner
facilitating a more efficient visual interpretation of the data, when listed.

danger of change cards getting out of sequence. It has an advantage over IBM's
Punch Memory 51 utility program in that control cards need not be made to
deSignate memory to be punched. It will also punch out a greater portion of
memory than Punch Memory 51.

MACHINE· 702 _ _ _ __

PROGRAM NAME

AF-Oll-O

705_---"X_ _ _ Model~Other _ _:_:___,,.,._(Specify)
'Tape5 _ _ _ _ IPrtnter _ _ _ TRC _ _ _ _ Drum _ _ _ _ __

Card Reader_X
_ _ 7(fJ _ _ _ _ _
PROGRAM LANGUAGE:

Autocoder _ _ _ Symboltc _ _ _ Actual ---'X"-_ __

~her

_ _ _ _ _ _ _ _ _ _ __

Autocoder ~ Symbolic _ _ _ Actual _ _ _ __
~her ____________~~~~----------------

(Specify)

~her------------~(S~p-"~;~~)~----------------

PROGRAM TYPE: Complete Program

PROGRAM TYPE: Complete Program _dX'-_ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instruction

Lobel _ _ _ _ _ _ _ __

Subroutine _ _ _ _ _ _ _ _ Label _ _ _ _ _ _ _ __

_-"X~

_ _ _ _ _ _ _ _ _ _ _ _ __

Macro-Instruction _ _ _ _ __

lab,1 _ _ _ _ _ _ _ __

Subroutine _ _ _ _ _ _ __

Label _ _ _ _ _ _ _ __

CONTRIBUTED BY,
George Pike
Headquarters, USAF
Any questions should be addressed to:
George Widding, AF ASC-3E
Data Processing Division
Headquarters, USAF, WaShington 25, DC

CONTRIBUTED BY,
George Widding
Headquarters USAF

AFASC 3E
Washington 25, D. C.

April 1958, Bulletin 57 - 41

(August 1957, Bulletin f£J - 105)

GUIDE
GUIDE

PROGRAM WRITE-UP ABSTRACT

PROGRAM WRITE-UP "ABSTRACT

INDICATIVE CODE
INDICATIVE CODE

PROGRAM NAME
HO USAF Tape Input-Output Package.
AF-003-1
Includes EOF-TRA Sub-routines, Checkpoint
"Option, Input-Output Macro_Instructions and
PURPOSE:
Restart Program
This set of sub-routines and macro-instructions provides for complete handling
(Continued on next column)

AF-012-0

PROGRAM NAME
CARD TO TAPE LOAD

PURPOSE: To create, from card input, blocked or unblocked records of any length
on tape.
(Continued on next page)

229

MACHINE·1D2 _ _ _ __

705_~X,,-_ Model--L2!:.1L..Othe,_-,:--..",.,.--_

ITopes

(Specify)
Iprlntet _ _ _ TRC _ _ _ _ Drum _ _ _ _ __

X

Card Reader _ _X
_

GUIDE
PROGRAM WRITE-UP ABSTRACT

7/IJ _ _ _ _ _ Other _ _ _ _ _ _ _ _ _ __
INDICATIVE CODE

PROGRAM LANGUAGE:

PROGRAM NAME

Autoeoder _ _
X_ Symbolic _ _ _ Actual _ _ _ __
AO-DOJ-D

Othe'---------;c(S;-p-.e""'lfy'"'),--------PROGRAM TYPE; Complete Program
Macr~-Instructlon

_~X"--

_ _ _ _ _ _ _ _ _ _ _ _ __

_ _ _ _ _ _ Label _ _ _ _ _ _ _ __

Subroutine _ _ _ _ _ _ __

PURPOSE: To function as a debugging aid in cases where debugging by m8mory print
fails, The routine lists each PRINT I step executed, along with numerical values
of tho operands and results, if any.
MACHINE·702 _ _ _ _

label _ _ _ _ _ _ _ __

CONTRIBUTED BY,

A. Lett

PRmT I TRACING ROUTINE

~Jone

I --Other--(-Sp-e-d-ry-)-Model_
TRC _ _ _ _ Drum _ _ _ _ __

IPrlnter~

Card

760 _ _ _ _ _ Other _ _ _ _ _ _ _ _ _ __

Reader~

PROGRAM LANGUAGE:

Headquarters, USAF
Any questions should be addressed to:
George Widding, AFASC-3E

705

One
'Tapes (or none)

Autocoder _ _ _ Symbollc _ _ _ Actuol _ _ _ __

PRINT

Other

Data Processing Division
Headquarters, USAF, Washington 25, DC

April 1958, BulleUn 57 - 43

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __

GUIDE
PROGRAM WRITE-UP ABSTRACT

Macro-Instruction _ _ _ _ __

Label _ _ _ _ _ _ _ __

SubroutIne _-AX_ _ _ _ __

label

(NONE)

CONTRIBUTED BY:

W. R. Brittenham,
INDICATIVE CODE

PROGRAM NAME

A. O. Srn.!.th Corporation

Square Table Look-up
Square Table Look-up with Function
Table Look-up

AF-013-0
PURPOSE:

(August 1957, Bulletin EO - 117)

Table Look-up with Function

A set of four macro-instructions is provided to be used for table look-up
operations. Two macros are merely for argument verification and the
other two are for both argument verification and function extr-_ _ Model~Other'--(-Spe-C-I-Fy)--

'Tapes,_--,L-- 'Prlnter-1.=1l1.-- TRC _ _ _ _ Dnlm _ _ _ _ __

PROGRAM TYPE: Complete Program _X"-_ _ _ _ _ _ _ _ _ _ _ _ _ __

Card Reader--Z-- 7f:JJ _ _ _ _ _ Other _ _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

PROGRAM NAME

AQ_OIO_O

Aut.. ode, --X-- Symbolic _ _ _ Actual - - - - ~.r------------~(~Sp-e~ci~Fy7)-----------------

PROGRAM TYPE: Complete Program

_~XlL

Macro-Instruction _ _ _ _ __

Label _ _ _ _ _ _ _ __

Subroutine _ _ _ _ _ _ __

Label _ _ _ _ _ _ _ _ __

CONTRIBUTED BY,

w. R. Brittenham and G. W. Kuss
A. O. Smith Corporation

_ _ _ _ _ _ _ _ _ _ _ _ _ __

Macro-InstructIon _ _ _ _ __
Subroutine _ _ _ _ _ _ __

Label _ _ _ _ _ _ _ __
Label _ _ _ _ _ _ _ __

Distribution No. 5

(Continued on next column)

231

GUIDE

GUIDE

PROGRAM WRITE- UP ABSTRACT

PROGRAM WRITE-UP ABSTRACT
INDICATIVE CODE

INDICATIVE CODE

PROGRAM NAME

AO-Oll_O

Search Master Program

T;'l~

PURPOSE:
To search a master program tape on 0201 for a specific PRINT program,
re-create any tapes containing portions of the program, h:i'ing the program
into memory, and transfer control to it.

MACHINE· 702 _ _ _ __
ITapes lor more

705_-,X,-_ _

Model~Other _ _ _ __
(Specify)
'Printer _ _ _ TRC _ _ _ _ Drum _ _ _ __

Card Reader-L- 760 _ _ _ _ Other _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

BW - 002 - 0

PROGRAM NAME
Miscellaneous General Purpose
Macro Instructions

PURPOSE,

MACRO NAME:

Move Data
Digit Selection
Fixed Memory Counter
Linkage to Subroutine
Option Halt
Sequence Check
Sign a Field
Strip Field
Variable Memory Counter

MOVE
DGSEL
FMCTR
LINK
OPHLT
SEQCK
SIGN
STRIP
VMCTR

Autocoder _ _ _ Symbolic _ _ _ Actual _ _ _ __
~

Other

-~P~RliIllN~T---"O:(S;-P-'c~;I;-y)c-----

PROGRAM TYPE: Complete Program _-'x'-_ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instruction _ _ _ _ __

Lobel _ _ _ _ _ _ _ __

Subroutine _ _ _ _ _ _ __

lobel _ _ _ _ _ _ _ __

CONTRIBUTED BY:
W. R. Brittenham and G. W. Kuss
A. O. Smith Corporation

702 _ _ _ _ _ _

705_~X_ _ _

ModelI1 and III

Other _ _ _ __

(Specify)
ITapes _ _ _ _ _ #Printer _ _ _ _ TRC _ _ _ _ Drum _ _ _ __
Card Reader _ _ _ 760 _ _ _ _ _ 0ther _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

Autocoder _ _X_ _ Symbolic _ _ _ _ Acrual _ _ _ __
Ofher--------(c;:sP-,-c·::-,fy-c)--------

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-instruction _ _ _"X_ _ _ _ Label _ _ _ _ _ _ _ __
Subroutine _ _ _ _ _ _ _ _ _ label _ _ _ _ _ _ _ __
Distribution No. 5

CONTRIBUTED BY:
Boeing Airplane Company
Wichita Division

GUIDE
PROGRAM WRITE- UP ABSTRACT

PROGRAM NAME

INDICATIVE CODE
BW _ 001

Distribution No" 8

Address Modification

_ I

PURPOSE:

GUIDE
To provide a COinmon set of address modification macro instructions for 705
Model II and SOK 705 Model III. This version- contains revisions to the macro
instruction MOVEA of contribution BW - 001 - O. The macro instructions included

PROGRAM WRITE-UP ABSTRACT

INDICATIVE CODe
Macro Name
Add Address and Move
Subtract Address and Mo\-"e
Increment Address
Decrement Address
Calculate Address
Initialize Address
Move Addre s s
Unconditional Transfer

Operation Code
ADDA
SUBA
INCRA
DECRA
CALCA
INITA
MOVEA
TO

X
Model~Other_,--:~_
(Specify)
flTopes _ _ _ _ _ lIprinter _ _ _ _ TRC _ _ _ _ Drum _ _ _ __

MACHINE,702 _ _ _ _ _ _ 705

Cord Reoder _ _ _ 760 _ _ _ _ _ 0ther _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

Autocoder_I_II_ _ Symbolic _ _ _ _ Actual _ _ _ __

PROGRAM NAME

CIl_OOI_l

Sort 57 _ Blocked Variahle

Corrections to above-ITlentioned ITlodification to Sort 57.
group mark before TRA to dump unreadable records,
Phase 2 @ 38554

9H5T5
17014

MACHINE· 702 _ _ _ __

To transmit a

Phase 3 @ 38555 9H7T5
IX474

705 _ _Xl>-_ _

Mcd.I-.ll..,.--Oth,,-~(S:-P-'c-:-:;fc:y)--

#Tcpes _ _ _ _ 'Prlnter _ _ _ TRC _ _X_ _ Drum _ _ _ _ __
Card Reader _ _ _ 760 _ _ _ _ Other _ _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

Autocoder _ _ _ Symbolic _ _ _ Actual

~x,,---_ __

Other _ _ _ _ _ _ _,-_.,.--,-_ _ _ _ _ _ __
(Specify)

Other -------;(';-.-'c-,;I:-y;-)- - - - - - - -

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instruction_--"x'-_ _ _ _ Lobel

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __

Address Modification

Macro-Instruction _ _ _ _ __

Label _ _ _ _ _ _ _ _ .

Subroutine _ _ _ _ _ _ __

Label _ _ _ _ _ _ __

Subroutine _ _ _ _ _ _ _ _ _ label _ _ _ _ _ _ __
CONTRIBUTED BY,

CONTRIBUTED BY,
The Curtis Publishing Company
Independence Square
Philadelphia 5, Pennsylvania

James O'Malley
Boeing A~rplane Company
Wichita t'Jivision

Written by:
Distribution No.8

232

William Anderson
IBM Corporation

Distribution No. 5

B - 70S

MACHINE SPECIFICATIONS;

GUIDE

40, 000 position 105 with 4 tape units

PROGRAM WRITE-UP ABSTRAC.
PROGRAM NAME

INDICATIVE CODE

Save Memory SRT 57 - Ph 3

To calculate seasonal adjustml!nt factors for seril!S of any length bl!tween
five and twelve years.
GENERAL DESCRIPTION:

PURPOSE,
To increase the amount of memory available to the prQgranun er who is
integrating a special purpose program into the third phase of tho 705
Generalized Sort Program SORT 57.
~702

__

'Topes

~

__

Srt 57

Model_I_I _ _ Other·_-,-_ __
X
(Specify)
'P,lnlef _ _ _ TRC _ _X_ _ Dlum _ _ _ __

705

Card Reoder _ _ _ 7/IJ _ _ _ _ Other _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

Autocoder_X_ _ Symbolic _ _ _ Actual - - - - -

~her------~(S~p-ec~lfy~)~---------PROGRAM TYPE: Complete Program

~P~a"'-!t£!ch'!!.'.'!._ _ _ _ _ _ _ _ _ _ _ _ __

Th.e program is an adaptation of "Census Method II" for calculating: seasonal
adjustment factors. The steps involved in this method are described in detail
in the Census release, "Seasonal Variations in the Labor Force, Employment,
and Unemployment" (Series P.~50, No. 82., April, 1958), and in Technical
Pa~er No: 1.2. "Seasonal Adjustments by Electronic Computer Methods" by
Juhus Shlskm and Harry Eisenpress. published by the National Bureau of
Economic Research.
REQUIREMENTS AND RESTRICTIONS:
This program is written for a 12.d.igit mantissa Print I system for 2 TRC's.
HoweVer, it may be used by any Model II system after it is pre -edited by that
particular 12-digit mantissa system.
CONTRIB UTED BY:
Charles B. Reeder. E. I. duPont de Nemours
Nancy K. Brewer. IBM. Wilmington, Delaware

Macro-Instruction _ _ _ _ _ _ label - - - - - - - - -

GUIDE

Subroutine _ _ _ _ _ _ _ _ Label - - - - - - - - -

PROGRAM WRITE-UP ABSTRACT

CONTRIBUTED BY,
The Curtis Publishing Co.
bth and Walnut Streets
Philadelphia 50, Penna

Program patches by
Macon A. Preston
IBM Corporatipn
James A. McAndrew

INDICATIVE CODE

PROGRAM NAME

El-001-Q

LINEAR PROGRAMMING

The Curtis Publishing Co.

PURPOSE: Solvinq LInear Programminq problems, and performinq associated
matrix multiplications; OOth order.

GUIDE
PROGRAM WRITE- UP ABSTRACT

ooz -

.b._ __

Card Reoder _ _
X_

Title. Halt and Switch Program

0

705 _ _",X_ _ Mod.I _ _
II_~h.r_--;-__-,-___

'ap..T
'Prlnter----'lIl..e.- TRC _ _ _ _ Dlum. _ _(Sp·xclfy)
---,,---

PROGRAM NAME

INDICATIVE CODE
DE -

MACHINE· 702 _ _ _ __

PROGRAM LANGUAGE:

7/IJ _ _ _ _ Other _ _ _ _ _ _ _ _ _ _ __

Autocoder _ _ _ Symbollc _ _
X_

Actual _ _ _ __

PURPOSE,

~ogram. using program listing tape from an autocoder assembl,Y ~s input.

~er ________~~~~--------------

produces cards which, after EAM processing, may be used to make hstmgs to
serve as index and halt logs for console operator's manual and a switch log for

~

(Specify)

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _~X"___ _ _ _ _ _ _ _ _ __

programmer's use.

Iv\odel......1..aL..llO ther _ _ _ __
(Specify)
ITapes_-"-_ _ _ 'Printer----TRC----- Drum - - - - -

702 _ _ _ _ _ _ 705

Card Reader _ _ _ 760 _ _ _ _ _ 0ther _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

Macro-Instruction _ _ _ _ _ _ _ labei _ _ _ _ _ _ _ _ __

X

Autocoder~"_ _ Symbolic----Actuol---O.he' _ _ _ _ _ _ _--",_-:-;-_ _ _ _ _ _ __

Subroutine _ _ _ _ _ _ _ _ _ label

CONTRIBUTED BY,
Davld H. Brown
Esso Standard OU Company
Baton Rouge, La,

(Specify)

January 1958, Bulletin 55 - 67
PROGRAM TYPE: Complete Progrom _ _ _- 1 ! X ; . . . - - - - - - - - - - - - 105 CUSTOMER CONTRIBUTION

Iv\ocro-Instruction _ _ _ _ _ _ _ lobel - - - - - - - - -

Program

Subroutlne. _ _ _ _ _ _ _ _ _ labe1 - - - - - - - -

CONTRIBUTED BY,
The Detroit Edison Company
ZOOO Second A .... enue
Detroit 2.6. Michigan

Write~up

Abstract

INDICATIVE CODE

PROGRAM NAME

EK 0001
EK 0002.

One card lower load
One card upper load

MACHINE SPECIFICATIONS:
Richard 1. Grady

705
Distribution No. fI

To provide a loading program in a single card entry to serve the
same function as LOD 51.

105 CUSTOMER CONTRIBUTION
Program Write~Up Abstract
INDICATIVE CODE
DP 0001

RESTRICTIONS:

PROGRAM NAME

Only 160 memory positions are required.

Calculation of Seasonal Adjustment
Factors

(ContinUed on next column)

GENERAL DESCRIPTION:
The program follows:

(Continued on next page,

233

Columns

1-5
6-10
11-15
16-20
21-25
26-30
31-35
36-40
41-45
46-50
51-55
56-60
61-65
66-70
71-75
76-80

EK 0001

EK 0002

20100
Y 0080
10074
B 0002
80094
N 0099
7 0039
B 0#00
B 0004
8 0092
7 0059
U 0000
9 0#95
1 0004

20100
Y 2880
12874
B 0002
8 2894
N 2899
7 2839
B 0#00
B 0004
8 289Z
7 2859
U 0000
9 2Y95
1 2804
J 9999
1 2804

J 9999
1 0004

2.

Tracing may be discontinued at any time during a run by turning off 916. This will cause the machine to stop-and the
typewriter will print two 5 digit nuznbers.
a.
b.

The address of the next instruction
The operation just perform.ed

If the operatIOn was a transfer the two numbers are the same.
To continue without Transfer Tracing make a manual transfer
from the console to the address of the next instruction as
shown on the typewriter.

3.

Tracing can be restarted at any point in the main program. by
the following:
Manually store 5 digit address of instruction at a position
in memory that is 500 _ higher than the starting point of
transfer tracing routine.

a.

CONTRIBUTED BY:
CONTRIBUTED BY:
W. L. Myers, Eastman Kodak
Rochester, New York

E. Althoff. Eastman Kodak
Rochester, New York

GUIDE

GUIDE

PROGRAM WRITE-UP ABSTRACT

PROGRAM WRITE-UP ABSTRACT

INDICATIVE CODE

PR OGRAM NAME

EK-D02-D

EKACTO - 10 DIGIT CONVERSION

PURPOSE: Enable programmer to write in actual as 10 digits (Ex: RAD 02 25519).
The routine processes cards punched in 10 digit form, checks instructions for
valIdity, giving listings and condensed cards as output.

INDICATIVE CODE

PROGRAM NAME

EQ-D01-0

CHECKING LOADING ROUTINE

PURPOSE: Program Card loading routine with check for machine errors and
proper sequence and identification on cards.
MACHINE· 702 _ _ _ __

MACHINE· 702 _ _ _ __

'Tapes 3 (Optional)

705 _ _X,,-_ _

Model~Oth.,_..".._-:-_

Card Reader(Optional)760 _ _ _ _ Other _ _~Pun"",,,,c!!.h-,,(O,,,p"'t,,,io,,,n,,,aJ!L)_ __
PROGRAM LANGUAGE:

705 _ _X",-__ Mod.'~Oth"-"'(s:-p-eCC":lf:-:Y)--

ITapes _ _ _ _ 'prlnter _ _ _ TRC _ _ _ _ Dwm _ _ _ _ __

(Specify)
Iprlnter (Optional) TRC _ _ _ _ Drum _ _ _ _ __

Card Reader _ _ _ 760 _ _ _ _ _ Other _ _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

X_
Autocoder _ _

Symbollc _ _ _ Actual _ _ _ __

Autocoder _ _ _ Symbolic _ _ _ Actual _-"X,-_ _
Qher _ _ _ _ _ _~~~---------(Spedfy)

Othe'--------~(S~p-ec..,ify~).------------PROGRAM TYPE: Complete Program _ _ _ _ _ _--'X'-_ _ _ _ _ _ _ __

PROGRAM TYPE: Complete Proaram _ _ _ _ _ _--"X'--_ _ _ _ _ _ _ __
Macro-Instruction _ _ _ _ __

Macro-InstructIon _ _ _ _ __

Label _ _ _ _ _ _ _ __

label _ _ _ _ _ _ _ __
Subroutine _ _ _ _ _ _ __

~bel

______________

Subroutine _ _ _ _ _ _ ___ label _ _ _ _ _ _ _ __
CONTRIBUTED BY,
Barry Gordon
Equitable Life Assurance Society of the U.S.
393 Seventh Avenue
New York 1, New York

CONTRIBUTED BY,
Earl Althoff
Eastman Kodak Company

January 1958, Bulletin 55 - 73

JanU!lil"Y 1958, Bulletin 55 - 71
GUIDE

705 CUSTOMER CONTRIBUTION

PROGRAM WRITE-UP ABSTRACT
Program Write-up Abstract
INDICA TIVE CODE

PROGRAM NAME

EK 0003

Eastman Kodak, Consolidated Edison
Transfer Tracing (EKCETT)

PROGRAM NAME

INDICATIVE CODE

SYMBOLIC TC AUTOCODER CONVERS[ON

EQ-D02-D

PURPOSE: To convert a 705 program written in the symbolic system to a 705
program written in Autocoder language.
To prmt a record of transfers of control within the main program,
ten transfers per prmter line. Its functIon is the same as Trac 51;
namely, to provide a nleans of following the actual path used during
the run of a program. during debugging. This program is relocable.

MACHINE· 702 _ _ _ __

705 _ _-"X_ _ Mod.,~Othe'-""(S""P-.C-lfy"")--

ITapes_--''--_ Iprlnter _ _
1 _ TRC _ _1_ _ Drum _ _ _ _ __
Card Reader _ _ _ 760 _ _ _ _ _ Other _ _ _ _ _ _ _ _ _ __

RESTRICTIONS:
The program occupies 643 memory positions. It m.ay be placed in
any convenient location in znem.ory, except the 1 st 240 digits. Only
224 positions of accumulator 00 are available to the main program..

PROGRAM LANGUAGE:

Autoccder _ _
X_ Symbollc _ _ _ Actual _ _ _ __

Othe'------------~(~SP-e~cl~fy')-----------------

GENERAL DESCRIPTION:

PROGRAM TYPE: Complete Proaram _ _ _ _ _ _ _X"-_ _ _ _ _ _ _ __
This program is a refinement of a program developed by Mr. Art
Brown, Consolidated Edison New York, City, customer contribution No. 10.

1.

234

EKCETT may be placed in any convenient location in memory_
except the 1st 240 digits. The program occupies 643 memory
positions.
(Continued on next column)

Macro-InstructIon _ _ _ _ _ _ label _ _ _ _ _ _ _ _ __
Subroutine _ _ _ _ _ _ __

label _ _ _ _ _ _ _ ___
(Continued on next page)

B - 705

CONTRIBUTED BY:

GUIDE

Lawrence Shaplro
Equitable Life Assurance Society of the U.S,
393 Seventh Avenue
New York 1, New York

PROGRAM WRITE-UP ABSTRACT
INDICATIVE CODE

January 1958, Bulletin 55 - 75

PROGRAM NAME

EQ-007_0

SEQUENCE CHECK

PURPOSE:
Sequence-chec;k a file of variable-length tap .... records and/or delete records
which exceed a given length.

GUIDE
MACHINE- 702 _ _ _ __

PROGRAM WRITE-UP ABSTRACT

705 _ _xx_ _ Modcl----1L-Other _ _ _ _ __

(Speclry)
ITcpes_---"_ _ IPrlnter _ _ _ TRC---L- Drum _ _ _ _ __
INDICATiVE CODE

PR OGRAM NAME

EQ-005-0

Card

Rccder~

760 _ _ _ _ _ Other _ _ _ _ _ _ _ _ _ __

ALTERED MEMORY PRINT
PROGRAM LANGUAGE:

PURPOSE: To print out, in indexed form, the contents of memory which have
been changed since the inltialloading of a given program.

Auloc;oder _ _X _ Symbolic _ _ _ Actual _ _ _ __
Other

------~~__c_~-------­
(Specify)

~702

_ _ _ __

705 _ _~X~_

Model~Othero _ _ _ _ __

PROGRAM TYPE: Complete Program

(Speclly)
ITapes _ _ _ _ IPrtnter _ _
1 _ _ TRC _ _ _ _ Drum _ _ _ _ __

_
Card Readcr _ _X
PROGRAM LANGUAGE:

760 _ _ _ _ Othero_ _ _ _ _ _ _ _ _ __

X_
Autocoder _ _

Symboltc _ _ _ Actual _ _ _ __

~her _ _ _ _ _ _~~~~-------(Specify)

_~X"--

_______________

Mac;ro-Instructlon _ _ _ _ __

Label _ _ _ _ _ _ _ __

Subroutine _ _ _ _ __

Label _ _ _ _ _ _ _ __

CONTRIBUTED BY,

B. Gordon
The Equitable Life Assurance Society of the United States
393 Seventh Avenue
New York 1, N. Y.

PROGRAM TYPE: . Complete Program _ _ _ _ _ _----=X~_ _ _ _ _ _ _ __
Mac;ro-ll"'I$tructlon _ _ _ _ __
SubroutIne _ _ _ _ _ _ __

~bcl

_ _ _ _ _ _ _ __

GUIDE
~bel

_ _ _ _ _ _ _ __
PROGRAM WRITE-UP ABSTRACT

CONTRlaUTED aY,

Arthur Rosenzweig
James M. Kappas
Equitable Life Assurance Society of the U.S.
393'Seventh Avenue
New York 1, New York
January 1958, Bulletin 55 - 81

INDICATIVE CODE

PROGRAM NAME

EO-009-0

Tic-Tac_Toe

PURPOSE:
Demonstration of logical ability and speed of the 705

MACHINE- 702 _ _ _ __

705 _ _XlL_ Model~Other _ _ _ __
(Specify)
'Tapes _ _ _ _ 'Prlnter' _ _ _ TRC _ _ _ _ Drum _ _ _ __

GUIDE

Card Reader---X...- 760 _ _ _ _ Other _ _ _ _ _ _ _ _ __

PROGRAM WRITE-UP ABSTRACT
PROGRAM LANGUAGE:
INDICATIVE CODE

PROGRAM NAME

EQ-006-0

Autocoder _ _ _ Symbolic _ _ _ Actual _ _XX_ _
Other

------~("Sp-,-cci::-Iy-;-)- - - - -

SELECTIVE TAPE PRINT
PROGRAM TYPE: Complete Program _2X_ _ _ _ _ _ _ _ _ _ _ _ _ __

PURPOSE. To print directly, or to write on a tape for subsequent printing, all
or selected records of specWed tapes.

MACHINE- 702 _ _ _ __
ITopes

Varies

705--NcC~"-n-e- Model~Othero--(-SP-C-Ci-Iy-)-'Printerim:....2n.gL TRC _ _
1 _ _ Drum _ _ _ __

Card Reader _ _
X_ 760 _ _ _ _ Qther _ _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

Autocoder _ _
X_ Symboltc _ _ _ Actual _ _ _ __

Macro-Instruction _ _ _ _ __

Lobel

Subroutine _ _ _ _ _ _ __

label _ _ _ _ _ _ _ __

CONTRIBUTED BY:
Milton P. Persily
The Equitable Life Assurance Society of the United States
393 Seventh Avenue
New York I, N, y,

Other _ _ _ _ _ _ _- - _ - - - - - - - (Spedly)

GUIDE

PROGRAM TYPE: Complete Program _ _ _ _ _ _---!.X'---_ _ _ _ _ _ _ __

PROGRAM WRITE- UP ABSTRACT

_ _ _ _ _ _ _ __

Macro-Instruction _ _ _ _ __

~bcl

Subroutine _ _ _ _ _ _ __

Label _ _ _ _ _ _ _ __

CONTRIBUTED BY,

Robert J. McKcnty
Milton P. Persily
Equitable Life Assurance Society of the U. S.
393 Seventh Avenue
New York 1. New York
January 1958, Bulletin 55 - 83

INDICATIVE CODE
E2-002-0

PROGRAM NAME
Time Series Routine

PURPOSE,
To calculate statistical indices of average, variance, and standard deviation on
time series data. A visual interpretation of the data is provided by plotting each
point sequentially a.s a plus or minus deviation from the average. A cell count
is shown to indicate the distribution profile.

(Continued on

(''::hL

page)

235

MACHINE,702 _ _ _ _ _ _ 705

X
~deJ~Other _ _;_:__::c_:_(Specify)
.+'Tcpes--",,-Z_ _ _ _ Hprinter_l_ _ _ TRC _ _ _ _ Drum ......
1_ _ _ _

Cord Reader _ _1_ _ 760 _ _ _ _ _ 0ther _ _ _ _ _ _ _ _ __
PROGRAM lANGUAGE;

Autocoder_ _ _ Symbolic _ _ _ _ Actual _ _ _ __

Other _ _~A"u"'t"'oc"o"'d"'c''--''A_,,-------c--:-_ _ _ _ _ _ __
(Specify)

PROGRAM TYPE: Complete

t-Aacro-Instruction, _ _ _ _ _ _ _ label _ _ _ _ _ _ _ __
Subroutine _ _ _ _ _ _ _ _ _ Lobel _ _ _ _ _ _ _ __
CONTRIBUTED BY,
F.R. Pfaff
Esso Standard Oil Company
Linden, N. J.
Distribution No. 6

Pro9rom'_---"'X~_ _ _ _ _ _ _ _ _ _ _ _ __

Nklcro-Instruction, _ _ _ _ _ _ _ lobel _ _ _ _ _ _ _ __

GUIDE

Subroutine, _ _ _ _ _ _ _ _ _ Label _ _ _ _ _ _ _ __

PROGRAM WRITE- UP ABSTRACT

CONTRIBUTED BY,
INDICATIVE CODE

Esso Standard Oil Company
P.O, Box 222
Linden, N. J.

PROGRAM NAME

E2-005-0

Product Inverse Linear Programl11ing

PURPOSE,
Distribution No.6

GUIDE

To calculate optimul11 solutions for problems involving up to 99 linear constraints
and 120 variables. The program contains a partitioning feature useful in solving
block-triangular (for instance, Multi-Grade Blending) problems. Multiple profit
functions and/or multiple l'equirel11ents vectorl;l can be handled.

PROGRAM WRITE- UP ABSTRACT
NACHINE: 702 _ _ _ _ _ _ 705
INDICATIVE CODE

PROGRAM NAME

EZ-003-0

Stepwise BegrefjBjpD

PURPOSE,

t-kdel_I_I --Other--(S-pe-c-if-y)-

X

NTapes,---"5_ _ _ _ 'Printer -L:.1...ll..- TRC _ _ _ _

Drum--'lX~_ __

Card Reader_X
_ _ 760, _ _ _ _ _ Other _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE;

To develop an equation expressing a dependent variable, Y, as a function of as
many as 50 independent variables, multiply regression analysis.

Autocoder_ _ _ Symboljc _ _ _ _ Actual _ _ _ __
Other _ _ _A"'u'!!t~oCS!o~do:er~A~(;-;S~pe::C;;ify-;)--------

I _ _ Other_-,--_,-,-_
Iv\ACHINE: 702 _ _ _ _ _ _ 705, _ _
X_ _ _ M.odel_I_
(Specify)

PROGRAM TYPE: Complete Progrom'_.2X'---_ _ _ _ _ _ _ _ _ _ _ _ __

#Topes'---"_ _ _ _ 'Printer -.l...:..1.lL.- TRC _ _ _ _ Drum'-'x'---_ __

Macro-lnstruction' _ _ _ _ _ _ _ label _ _ _ _ _ _ _ __

Card Reader_X_ _ 760' _ _ _ _ _ Other _ _ _ _ _ _ _ _ __

PROGRAM LANGUAGE:

Subroutine' _ _ _ _ _ _ _ _ _ Lobell _ _ _ _ _ _ _ __

Autocoder _ _ _ $ymbolic _ _ _ _ AchJol _ _ _ __
Other'--_"A"ut""O"'CO"'d"'C.o.'.;:A'-(7:5-pe-c7:ify-;)--------

PROGRAM TYPE: Complete

Pro9ram'_---"'X~

_ _ _ _ _ _ _ _ _ _ _ _ __

CONTRIBUTED BY,
H. E. Clayton
D.M. Sl11ith
Esso Standard Oil Company
Linden, New Jersey

Ivbcro-Instruction' _ _ _ _ _ _ _ label _ _ _ _ _ _ _ __

Distribution No.6

Subroutine' _ _ _ _ _ _ _ _ _ label _ _ _ _ _ _ _ __

GUIDE

CONTRIBUTED BY,

PROGRAM WRITE-UP ABSTRACT

W.G. Hyde
F. R. Pfaff
R. W. Schrage
n.M. Smith
W. E. Zieman

INDICATIVE CODE

PROGRAM NAME

GENERAL TRANSFER ANY ROUTINE

E 3_002_0
Distribution No. 6

(Also Generalized Edit Note Routine)
a single program.

PURPOSE: To avoid need for many specialized TRA. routines in

Esso Standard Oil Company
Linden, New Jersey

To reduce duplication of programming effort.
705_--"X~_ _ Model~Other _ _ _ __
(Specify)
ITapes _ _ _ _ 'Prlnter _ _ _ TRC _ _ _ _ Orum _ _ _ _ __

MACHINE· 702 _ _ _ __

GUIDE
PROGRAM WRITE- UP ABSTRACT

Card Reader _ _ _ 760 _ _ _ _ Other _ _ _ _ _ _ _ _ _ __
INDICATIVE CODE

PROGRAM NAME

E2-004-0

PROGRAM LANGUAGE:

Matrix Inversion

Aurocoder _ _ _ Symbollc-X- Actuol _ _ _ __

Qher------~(~Sp-.C~i~~~)---------

PURPOSE,
To invert a Matrix and/or to solve Sil11ultaneous Linear Equations.

MACH:NE,702 _ _ _ _ _ _ 705

X

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instruction _ _ _ _ _ _ label _ _ _ _ _ _ _ __

_;_:__::c_:_(Specify)
,fTapes'--=-Z_ _ _ _ #Prjnter~TRC _ _ _ _ Drum _ _ _ __
.v.adel_I _I _ _ Other _

Card Reader _ _
X_ _ 760, _ _ _ _ _ Other _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

Autocoder_ _ _ Symbolic _ _ _ _ Actual _ _ _ __
Other _ _---'A"'u"'t"'oc'-'o"'d"'er,--"'A-c-:-_c:-:_ _ _ _ _ _ __
(Specify)

PROGRAM TYPE: Complete

Pro9rom_~X~

_ _ _ _ _ _ _ _ _ _ _ _ __
(Continued on next column)

236

Subroutine _ _-'X=---_ _ __

lobel

_-,G'.!T,",RA~_ _ _ __

CONTRIBUTED BY,

Esso Standard Oil Company - M. H.
15 West 51 St., N. Y. C.

Gros~

International Business :Machines Corp. - B. P. Dongieux
New York City
(August 1957, Bulletin 50 - 129)

RESTRICTIONS:

GUIDE

The program can handle a total of 1700 transfers.

PROGRAM WRITE-UP ABSTRACT
INDICATIVE CODE

PROGRAM NAME

HB-DD1-D

PURPOSE:

Of these:
1. 800 may connect one location on a page to a higher location on the same
page (forward transfers).

I,QQPCODER
2.

240 may connect one location on a page to a lower location on the same
page (backward transfers).

3.

999 may connect one page to another (off page transfers).

To slmpHfy programming of 705 loop operations, The Loopcoder is a

precompiler that expands program loops from a simple form to a detailed form,
supplying the initialization, address modification, and-counter testing operations.
Output from the Loopcoder is in Autocoder input form.
70'_~X,,-_ _ Model~Olher_-:::----,-:-:-_

MACHINE· 702 _ _ _ __
ITcpes_~

(Sp"lfy)
_ _ 'Prlnter _ _ _ TRC _ _ _ _ Drum _ _ _ __

Card Recder---X.....- 760 _ _ _ _ Other _ _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

If the forward or backward transfer table becomes exhausted, transfers
of that type are ignored.
The program can handle a maximum of 99 pages of output listing. The
program is written to plot the output at eight lines per inch. Five arrows
may be plotted at onc time in the forward directIon and four in the backward
direction. Any location for which an arrow position cannot be found is
noted on the type""riter.

Autocoder -Z....- Symbolic _ _ _ Actual _ _ _ __
CONTRIBUTED BY:
~her

_ _ _ _ _ _~~~~--------(Sp.clfy)

A. E. Scott, Diagnostic Engineering,
IBM, Poughkeepsie, New York

PROGRAM TYPE: Complete Program _ _X"-_ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instruction _ _ _ _ __

705 CUSTOMER CONTRIBUTION

label _ _ _ _ _ _ _ _ ___

Program Write-up Abstract

Subroutine _ _ _ _ _ _ ___ Label _ _ _ _ _ _ _ __
INDICA TIVE CODE

PROGRAM NAME

IB 0005

Print I Program for Solution
of Simultaneous Equations and Matrix
Inversion

CONTRIBUTED BY,

W. M. Harp

Humble Oil and Refining Company
Baytown, Texas
Program written by J. S. Bonner

MACHINE SPECIFICA TIONS:

April 1958, Bulletin 57 - 51

20, 000 or 40, 000 Position 705

705 CUSTOMER CONTRIBUTION

Program Write-Up Abstract
PROGRAM NAME

INDICATIVE CODE

Card Image

IB 0002

To solve simultaneous equations and matrix inversion.
RESTRICTIONS:
The coding kernel given on page 56 on the PRINT I Intermediate Manual
is used with the restrictlOn that only one column vector is allowed.

MACHINE SPECIFICATIONS:

GENERAL DESCRIPTION

20, 000 or 40, 000 Memory Position 705
FUNCTION:

The program is written for PRINT I system and will handle up to thirty
equations with thirty unknowns in core storage. The program will operate
using the lO_dIgit mantissa system.

To establish a card image in memory which may be addressed as CARD,
or each column may he addressed as COLXX (1. e •• COL 1 or COL 23,
etc. ).

It is necessary to specify on a control card the number of decimal positions
in the data words, d(U~;S.12) and the nmnber of equations to be solved,
N (N~O).

GENERAL DESCRIPTION:
A card image is established in memory which may be addressed as CARD.
or each column may he addressed as COLXX (i. e., COL 1 or COL 23,
etc. ).

On line print_out of solutions is provided and optional print_out of inverse
matrix.
S;0NTRIBUTED BY:
D. Loposer, IBM, Birmingham.

RESTRICTIONS:
The subroutine uses 81 to 85 positions.
least once: INCL CARD.

The progralTllTler must write at

705 CUSTOMER CONTRIBUTION
Program Write-up Abstract

CONTRIBUTED BY:
W. M. Selden, Program Research
IBM, World Headquarters. New York
705 CUSTOMER CONTRIBUTION
Program Write-Up Abstract
INDICATIVE CODE

PROGRAM NAME

IB 0003

Flow Chart Listing From Assembly Program
Print Record Tape

INDICA TIVE CODE

PROGRAM NAME

IB 0007

Tape DUplication

MACHINE SPECIFICATIONS:
ZO, 000 or 40, 000 Position 705
754 Tape Control Unit

To provide exact duplication of one tape from another.

MACHINE SPECIFICATIONS:

RESTRICTIONS:

40, 000 Position 705

1.

Record length may not exceed 19,785 characters for a 20,000
position 705, nor may it exceed 39,785 char'acters for a 40, 000
position 705.

To produce automatically, a flow chart listing, utilizing the tape which is
the listing of the assembled program, as input data. This tape is produced
by ASSY 72.
(Continued on next column)

2.

Records to be duplicated must not contain the following sequence of
five char:tcters: E@N%D which is used in determining end of record
If this sequence appears in records, any desired five characters rnay
be substituted for it.
(Continued on next page)

237

GENERAL DESCRIPTION:

GENERAL DESCRIPTION:

The input tape for this program is mounted on tape unit 0200; output is
written on tape 0201. Records to be duplicated may be of fixed or
variable length, and may contain group marks. Files separated by tape
marks can be reproduced, and the records from several input tapes
can be written on the same output tape.

This program is designed to perform a matrix inversion on data presented
to it in a specified form. The routine is accomplished by using the PRINT I
Automatic Coding System. Successive matrices of different order may be
inverted; each matrix will have its own control card preceding the elements
indicating the order and the number of colurrm vectors. The inversion takes
place entirely witltin memory.

CONTRIBUTED BY:
CONTRIBUTED BY:

W. G. Winchester, IBM, Poughkeepsie

T. Glans and
F. Williams, IBM, WHQ
705 CUSTOMER CONTRIBUTION

Program

Write~up

Abstract

705 CUSTOMER CONTRIBUTION

INDICATIVE CODE

PROGRAM NAME

IB 0009

Calendar Demonstration

Program Write-up Abstract
INDICATIVE CODE

PROGRAM NAME

IB 00 I1

MUSIC

MACHINE SPECIFICATIONS:
20,000 or 40,000 Position 705

MACHINE SPECIFICATIONS:

To demonstrate the speed and versatility of a
machine.

high~speed

computing

20,000 or 40,000 Position 705
Card Reader
Power Amplifier connected to SPR (Store for Print) instruction.

GENERAL DESCRIPTION:

NOTE: See your Customer Engineer

The Calendar Demonstration Program will compute the day of tre week
of any given calendar date between March I, 0001 and December 31,
9999. This program will also compute the given date for the following
holidays, both fixed and vari'able.

This program. is designed to permit the 705, with an attached amplifer,
to play music.
GENERAL DESCRIPTION:

New Years Day
Lincoln's Birthday
St. Valentine's Day
Washington's Birthday
April Fools Day
Memorial Day
Independence Day
Columbus Day
Halloween
Veterans Day
Christmas Day

Mothers Day
Fathers Day
Labor Day
Election Day
Thanksgiving Day
Easter Sunday

The card deck furnished with this program, includes three tunes: "Seems
Like Old Times, " "Old Piano Roll Blues," and "Entry of the Gladiators."
By punching cards according to a specified procedure, other desired tunes
may be played on the 705.
CONTRIBUTED BY:
R. W. Berner, W. M. Selden and
A. S. Petroulakis, IBM, WHQ

GUIDE

The participant may, if he likes, try to fool the machine by giving a
non-existent date to whlch the machine will give an appropriate answer.

PROGRAM WRITE- UP ABSTRACT
The program will predict for dates that fall on February 12 or February 22,
preceding the year that Lincoln or Washington was born, in how many
years hence they will be born. For dates that precede the adoption of the
Gregorian Calendar in 1582, the computation proceeds as if it were in
effect, but an explanation is printed for the participant' s consideration.

INDICATIVE CODE

CONTRIBUTED BY;

PURPOSE,

PROGRAM NAME
SR Time - Sort 54
Sorting Time Calculation

IQ - 001 - 0

To calculate the time necessary to do a sort on a 705 II using the Sort 54 program.
The formulas outlined on pages 39 to 41 of the Sort 54 manual are evaluated. The
parameters are inputted by means of the Sort 54 control card and the results are
typed out.

Mr. Elliot Raiffa

705 CUSTOMER CONTR1BUTION

Program WriteRUp Abstract

/lMCHINE: 702 _ _ _ _ _ _ 705 _ _~X'____f_.Aodel _ _
Il _ _ 0ther _ _ _ __

(Specify)

INDICATIVE CODE

PROGRAM NAME

IE 0010

Generalized Matrix Inversion
(PRINT I)

#Tapes_ _ _ _ _ #Printer _ _ _ _ TRC _ _ _ _ Drum _ _ _ __
Card Reader _ _ _ 760 _ _ _ _ _ 0ther _ _ _ _ _ _ _ _ __

PROGRAM LANGUAGE:
MACHINE SPECIFIGATIONS:

Autocoder-----X......--Symbolic _ _ _ _ Actual _ _ _ __
Other _ _ _ _ _ _ _--:::_::-:-_ _ _ _ _ _ __

(Specify)

20, 000 or 40, 000 Position 705

PROGRAM TYPE; Complete Program _ _-"x'"--_ _ _ _ _ _ _ _ _ _ _ _ __
tv\acro-lnstruction _ _ _ _ _ _ _ Label _ _ _ _ _ _ _ __

To invert successive matrices printing input and inverse in a convenient
format.

Subroutine _ _ _ _ _ _ _ _ _ Lcbel _ _ _ _ _ _ _ __

RESTRICTIONS:

CONTRIBUTED BY,
The largest inversion possible will be found by the following relationship:
(ntl)

(ntb) ~ 1000

Imperial Oil Limited
Toronto, Canada

and

(ntb) S 99
where n=order of matrix
b=number of colutnn vectors.

238

Distribution No.8

B - 705

MACHINE,702 _ _ _ _ _ 705

GUIDE

x

N!odel~Othcr _ _~_ _

ITopes-"..3_ _ _ _ 'Printer _ _ _ _ TRC

PROGRAM WRITE-UP ABSTRACT

1 or 2

(Spc~ify)

Drum _ _ _ __

__ 760 _ _ _ _ _ 0ther _ _ _ _ _ _ _ _ __
Cord Reader _ _x
PROGRAM NAME

INDICATIVE CODE

End-of-File Search

LH-007-0

PROGRAM LANGUAGE:

Autocoder_ _
X _ _ Symbolic _ _ _ _ Actuol _ _ _ __
Other _ _ _ _ _ _ _ _--:-::_~-------(Specify)

MACHINE· 702 _ _ _ __

X~_ Model--L=..ll-Oth"-""C(::"Sp-e""Ccl""fy-O-)705 _ _...

PROGRAM TYPE: Complete Progrom __~X=_____ _ _ _ _ _ _ _ _ _ _ _ __
Macro-ln!truction _ _ _ _ _ _ _ _ Lobel _ _ _ _ _ _ _ _ _ __

ITapes _ _ _ _ IPrlnter _ _ _ TRC _ _ _ _ Drum _ _ _ __

Subroutine _ _ _ _ _ _ _ _ _ Lobel _ _ _ _ _ _ _ __

Card Reoder---X- 7l1J _ _ _ _ Other _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

Autocoder ---X- Symbolic _ _ _ Actual - - - - -

Oth"------~(S~p-ec~I~~)~--------

CONTRIBUTED BY,
Richard Bullis, IBM
Northwestern Mutual Life Insurance Company
720 East Wisconsin Avenue
Milwaukee 2, Wisconsin

PROGRAM TYPE: ·Complete Program _-..:XlL_ _ _ _ _ _ _ _ _ _ _ _ __

Macro-Instruction _ _ _ _ __
Subroullna _ _ _ _ _ _ __

Distribution No. 6

label _ _ _ _ _ _ _ __
705 CUSTOMER CONTRIBUTION

label _ _ _ _ _ _ _ __

Prograll'l Write_up Abstract

CONTRIBUTED BY:
Lockheed Aircraft Corporation
California Division
Burbank, California

GUIDE

Simulation of the IBM 650 on a
40K IBM 705

40K IBM 705 with card reader & card punch.
modifications permit tape input and output).

PROGRAM NAME

INDICATIVE CODE

(Simple additional

PURPOSE:

705 Address Listing

NW-OOI-O, A TRC Modification of AO-ODS-O

To ll'lodify the prograll'l for sill'lulating the IBM 650 on the IBM 705
(reference #1) so as to take advantage of the expanded mell'lory of the
40K version of the 705 and thus gain an increase in speed.

PURPOSE,
To produce an actual address listing following a 105 assembly of programs
written in either Autocoder, Print I, or Syntbolic language. The program
reads the listing tape produced by the assembly and prepares,a ~orted table
of addresfI-location references - which is written out on the hstlng tape
following the tape mark.

_ _ _ __

PROGRAM NA ME

PG 0001

MACHINE SPECIFICATIONS:

PROGRAM WRITE-UP ABSTRACT

~702

INDICATIVE CODE

705_---'X'-_ _ Model ~Other--,(SO-p-ec-::;fc:y)--

RESTRICTIONS:
Will handle any 650 prograll'l written for the basic card 650 with alpha
devise. The write_up and program deck for the original ahnulator
(reference #1) arc necessary since this write_up and card deck cover
only the ll'lodifications.

'Topes_-,,-_ _ 'Prlnter _ _ _ TRC _ _
X_ _ Drum _ _ _ _ __

GENERAL DESCRIPTION:

Card Reader _ _
X_

A program already exists (reference #1) which sill'lulatcs the IBM 650
on the 20K 705. Since the 650 Magnetic Drum storage contains 20K
digits, each 10-digit 650 word had to be converted to a packed 7-digit
705 word to allow space for the sill'lulation program itself. This modification was written to sill'lulate the 650 drum in the 2.0K upper mell'lory
of a 40K IBM 705. Elimination of the PAC & UNPAC routines forll'lerly
necessary has increased the speed of the simulation of the 650 run at speeds
approxill'lately the sam.e as for the 650 itself.

PROGRAM LANGUAGE:

760 _ _ _ _ _ Other _ _ _ _ _ _ _ _ _ __

Autocoder --1L- Symbolic _ _ _ Actual - - - - -

Other--------------,(S~p-ec~I~~)~---------------PROGRAM TYPE: Complete Program

_~XlL

_ _ _ _ _ _ _ _ _ _ _ _ _ __

Macro-Instruction _ _ _ _ __
Subroutine _ _ _ _ _ _ __

Lobel _ _ _ _ _ _ _ ___
~bel

__________________

CONTRIBUTED BY:
Procter & Gam.ble and the
IBM, Cincinnati Office

CONTRIBUTED BY,

GUIDE

The Northwetltern Mutual Life Insurance Company
72.0 East Wisconsin Avenue
Milwaukee 2., Wisconsin

PROGRAM WRITE-UP ABSTRACT

GUIDE
INDICATIVE CODE
PROGRAM WRITE- UP ABSTRACT

INDICATIVE CODE
NW-003-1

PROGRAM NAME

PG-001-O
PROGRAM NAME

Tape Compare (TPeMP)

PURPOSE,

GENERALIZED TRANSFER ANY ROUTINE

PURPOSE: To look for, diagnose, and correct wnere possible 0901, 0902, and 0903
errors. Handles end of file conditions in a specified manner as outlined in the
program description. Includes flip-flopping of tapes. Can be used with some or all
at the following on line: Any number of 754 tapes, drum, 717 printer, punch, ana
card reader. Takes care of RD, RD 01, WR, WR 01, WTM, and RWW, but not WRE.
MACHINE· 702 _ _ _ __

Compare any two (2.) tape files of fixed or variable length records not greater
than 1020 characters or less than 10 characters in length. Records which are
not identical are written out. Record comparison may also be aided through
preliminary control word com.parison at the option of the user. Using this option,
all records which are not identical or unm.atched are written out.

Card Reader ___X_
PROGRAM LANGUAGE,

The Tape Label and Label Routine used in this program is of the sall'le type that
is required by IBM's Utility Programs. This prograll'l is a revision of Contribution
NW-003-0 which contained a specialized Tape Label Routine.
(Continued on next column)

705 _ _.4X~_ Model--Lll!:.lLOther_..,-_ _ _ __

'Tapes Any Number 'PrInter _ _X_ _ TRC ______ Drum __(_Sp~"x",cl_~_)_ _
760 _ _ _ _ _ Other _ _ _ _ _ _ _ _ _ _ __

Autocoder _ _ _ Symbollc _ _X_ _ Actual _______
Other ____________~~~~---------------(Sped~)

(Continued on next page)

239

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-InstructIon _ _ _ _ __

lobel _ _ _ _ _ _ _ __

Subroutine _ _ _--"'X'--_ __

label _ _ _ _ _ _ _ __

GUIDE
PROGRAM WRITE-UP ABSTRACT
INDICATIVE CODE

C ONTRI BUTEO BY:

Edward B. Berninger and John B. Hughes - Procter and Gamble

PROGRAM NAME

PG-006-0

Transportation ProbleJl1

NOTE: If any GUIDE members wish to modify the routine or assemble it at pOints
other than 18525, the appropriate symbolic deck (323 cards) can be obtained from
PURPOSE.
Mr: E. B. Berninger, The Procter and Gamble Company, P.O. Box 599, CincL"lIlati 1, To soive the "Transportation Proble:m". a special case of linear progra:m:ming.
OhlO.
The progra:m can acco:m:modate :matrices with M + N :S 700, where "M" is
January 1958, Bulletin 55 _ 85
nu:mber of destinations and "N" is nUIIlber of sour,ces.
The progra:m was written originally by IBM for the 702, and converted by the:m
to 705 language. Procter & Ga:mble debugged the converted progra:m and added
additional features.

GUIDE
PROGRAM WRITE-UP ABSTRACT

INDICATIVE CODE

PROGRAM NAME

PG-004-O

The largest proble:m run has been 26 x 149, which took up 90 iterations and
50 :minutes.

CHECK TAPE SETTINGS
MACHINE-

PURPOSE: To check that one and only one tape unit is dialed to the lUlils position
of each designated input and output tape. Types "Check Tape Settings" and halts
in case of duplicate setting:::;j stops at I/O No Response if no tape is dialed to

~2

_ _ _ __

'Tapes

9

nt

PROGRAM LANGUAGE:

_ _ _ __

'Tapes

705 _ _,-,X_ _ Model --LQr..lLOther_--::-_~_ _
(Specify)

PROGRAM LANGUAGE:

Subroutine

X

Label _ _-'C"HK""T"'P"--_ __

CONTRIBUTED BY,

Edward B. Berninger
Procter & Gamble

Pllnch (optional)

_-,X,-_ _

_.2X~

_ _ _ _ _ _ _ _ _ _ _ _ __

Mocra-Instructlon _ _ _ _ _ _ Label _ _ _ _ _ _ _ __
Subroutine _ _ _ _ _ _ __

Qher------~(S~P-.C~lfy~)~--------

~~~a~I;:~tlon _ _-'X'-_ _ _ label _ _ _C"-HK=TPJ..<:_ _ __

TRC _ _ _ _ Drum _ _ _ __

Autocoder _ _ _ Symbolic _ _ _ Actual

PROGRAM TYPE: Complete Program

Autocoder _ _X_ Symbolic _ _ _ Actual _ _ _ __

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __

~el ~Other-"'(S:-p-ec"'lr:-:y)--

Other-----------~(:-SP-e~d:-fy,..)-----------------

'Prlnter _ _ _ TRC _ _ _ _ Drum _ _ _ _ __

1 to 10

Card Reader _ _ _ 711J _ _ _ _ Other _ _ _ _ _ _ _ _ _ __

O'i-F LINE

Card Reader---1- 760 _ _ _ _ Other

one of the designated tape addresses.
~702

705

'Printer~

10

CONTRIBUTED BY:
S. Hkkenlooper, D.
Procter & Ga.mble

W:

Label

Grace, E. B. Berninger

NOTE: PrograJl1 material includes a "squeeze" deck of approximately 645
cards, complete operating and card punching instructions, a general
description of the Jl1ethod used (the original IBM 702 write~up).
typical running ti:mes, and a one-pate block diagram of the overall
program system.
Symbolic instruction cards and listing are not available.
Distribution No.5

Januarv 1958, Bulletin 55 - 91

GUIDE

GUIDE

PROGRAM WRITE-UP ABSTRACT

PROGRAM WRITE-UP ABSTRACT

INDICATIVE CODE

PROGRAM NAME

PG-005-0
PURPOSE:

INDICATIVE CODE

IES (after Settlnq)

xx

To load an ASU or the accumUlator, previously set, compare to a memory

field, and make the necessary transfer (E, LO, H, EH, Z, NZ, NE, ELl based on
the comparison
MACHINE-~2

_ _ _ __

705_-"X_ _ _ Model ~Othe'-"C(::-Sp-e"Ccl::-ry:-)--

'Tapes Any Nllmber 'Prlnter _ _ _ TRC _ _ _ _ Drum _ _ _ __

PROGRAM NAME

PG-007_0

Binary Table Search

PURPOSE,
To search a table in memory, using the "binary search" :method. To eliminate
Jl1ultiply instructions and other calculation in the subroutine loop, all increJl1ents
~d d~cre.ments are calculated ~ for each BNSCH macro in a progra:m and stored
in an in~hne record area. Argu:ments can be up to 79 characters long and functions
up to 255, and can be located anywhere in a table ite:m. The number of items in
the table can vary during a program. Table size is H:mited only by memory
availability.

MACHINE-

~2

_ _ _ __

Card Reader _ _ _ 711J _ _ _ _ Other _ _ _ _ _ _ _ _ __
'Tapes
PROGRAM LANGUAGE:

Autocoder ----X...- Symbolic _ _ _ Actual _ _ _ __

Other

------~(~Sp-.,";:-fy,..)- - - - - - - -

ADJ' No

_~IF~SXX~~

________

~b.1

Subroutine _ _ _ _ _ _ __

label _ _ _ _ _ _ _ __

(Specify)
Iprlnter _ _ _ TRC _ _ _ _ Drum _ _ _ __

Card Reader _ _ _ 711J _ _ _ _ _ Other _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

Autocoder ---X-- Symbolic _ _ _ Actual _ _ _ __

Othe'------------~(S~P-.C~I:-fy,..)-----------------

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instruction _ _X"'-_ __

705 _ _-"X,-_Model~Oth.'_-::----:~_

~YPE:

Complete Progl"Clm _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-InstructIon _ _--'X~_ _ Label _ _-,-,B",N","",CJjH_ __

CONTRIBUTED BY,
Richard B. Thoman, Procter & Gamble

Subroutine _ _ _ _--'X~_ _ Label _ _ _-'B"'N"'S"CJjH_ __

CONTRIBUTED BY,

Andrew T. Fogarty, IBM, Cincinnati

Richard B. Thoman
Procter and Gamble

April 1958, Bulletin 57 _ 53

240

Note: Time for one "binary search loop" in the subroutine is 0.578+ .017 N
:milliseconds, where N is the number of characters in the argu:ment.

B - 705

./MQ!J!ili 702 _ _ _ __

GUIDE
PROGRAM

WRITE~UP

ABSTRACT

'Tapes

Any No

705 _ - - , X " , - _ Model J....o.L.IL...- Othcr--;(S:-p-.c""lfc":y)-'Prlnter _ _ _ TRC _ _ _ _ Drum _ _ _ __

Card Reader _ _ _ 760 _ _ _ _ _ Other _ _ _ _ _ _ _ _ _ __
INDICATIVE CODE

PROGRAM NAME
Group Records

PG_008_Q

PROGRAM LANGUAGE:

Autocoder _X_ _ Symbolic _ _ _ Actual _ _ _ __

Othcr-----------~(~Sp-e~d~~~)-----------------

~,

To group fixed-length records, using serial or high-speed transmission, and
transfer to a designated address after a specified number of records have been
grouped,

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instruction _ _ _X,,-_ _ Lobel _ _ _-'M"'O.LV'-'R"C~_ __

./MQ!J!ili 702 _ _ _ __
ITopes

705 _ _"X_ _ Model~Other--:-(S:-p-eC7.lf-:-Y)--

Carel Reader _ _ _ 760 _ _ _ _ Other _ _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

with linked

Subroutine _ _ _ _--'x'-_ _ label _ _ _-"M"'O"-V!UR"'C~_ _

'prlnter _ _ _ TRC _ _ _ _ Drum _ _ _ __

Any No

Autocoder ---X- Symbolic _ _ _ Actual _ _ _ __

CONTRIBUTED BY,
W illiaJ1l F. Reiland
Procter and Gamblc

~her------~(S~p-ec~I~:-)~---------

GUIDE

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instruction _ _-1IX_ __

Label

Subroutine _ _ _ _ _ _ __

label _ _ _ _ _ _ _ __

PROGRAM WRITE-UP ABSTRACT

GROUp

PROGRAM NAME

INDICATIVE CODE
PG_012_0

CONTRIBUTED BY,
Richard B. Thoman
Procter and Gam.ble

New Mucro I QQkpp (or 7Q5

Autocoder System
The J1lethod of searching for macros in Phase I of the 705 aut<)coder system
has been revised to reduce assembly time. A conservative estimate of 705
time saved is one J1linute per 90 macros asscJ1lbled. The change requires
only three patch cards which overlay part of the present routine.

GUIDE

tMQ!llif; 702 _ _ _ __

PROGRAM WRITE-UP ABSTRACT

705
X
Mod el ----1.l...-0ther_--cc_.,-,-_ _
(Specify)
'Tapes _ _ _ _ IPrlnter _ _ _ TRC _ _ _ _ Drum _ _ _ _ __

INDICATIVE CODE

PROGRAM NAME

PG-009-0

Card Reader _ _ _ 760 _ _ _ _ Other _ _ _ _ _ _ _ _ _ __

Sort Internally

PROGRAM lANGUAGE:
To sort fixed-length records which are set up for high-speed transmission on a
specified single control field. The sort takes place entirely within memory.
The control field can be located anywhere in the record and can be up to 255
characters. MaxirnUIn record length is 600 characters, but this can ea.:>ily be
changed to any size. The number of records to be sorted can vary within a
program.

MACHINE· 702 _ _ _ __

'Tapes Any No.

Model---1...2.LlLOther _ _ _ __
(Specify)
'prlnter _ _ _ TRC _ _ _ _ Drum _ _ _ __

705

PROGRAM LANGUAGE:

Qher ____________~~~~---------------(Specify)
PROGRAM TYPE:· Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __

x

Cord Reader _ _ _ 760 _ _ _ _ _ Other _ _ _ _ _ _ _ _ __

Autocoder _ _ _ Symbolic _ _ _ Actual _X"--_ __

Macro-Instruction _ _ _ _ __

Label _ _ _ _ _ _ _ ___

Subroutine _ _ _ _ _ _ __

Lobel _ _ _ _ _ _ _ __

CONTRIBUTED BY:
The Procter &. Gamble COJ1lpany

* patches for existing

program

Autocoder_X_ _ Symbollc _ _ _ Actual _ _ _ _ __

~h.r----------~(7Sp-e~d~~~)-----------------

Distribution No. 5

GUIDE

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __

PROGRAM WRITE-UP ABSTRACT

Ma~~~i;~kc:~on _--"X'-___ Lobel _-"S"O"'R:.:T--'l'-_ _ __
Subroutine _ _ _--'X'-_ __

Label

_----"S"O"'R"-T-'l~_ _ __

CONTRIBUTED BY,

INDICATIVE CODE

PROGRAM NAME

SB-OOI_O

William H. Graver
Procter and Gamble

SORT 58

PURPOSE,
To sort fixed or variable length records via TeU.
MACHINE· 702 _ _ _ __

705 _ _-"X~_ Model--I...2!..1LOther_-,---_ __
(Specify)
'Tapes_--''---_ IPrlnter _ _ _ TRC _ _ _ _ Drum _ _ _ _~-

GUIDE

Card Reader _ _
X_ 760 _ _ _' - _ Other_-'P'"ULllDC!;jhl.'e"'--_ _ _ _ __
* If labels per SBAMA conventions arc used
Autocoder - - . X . - Symbolic _ _ _ Actual _ _ _X,,--_

PROGRAM WRITE-UP ABSTRACT

PROGRAM LANGUAGE:
INDICATIVE CODE
pO_OIO_O

PROGRAM NAME
Move Variable, Grouped Fields

PURPOSE,
To J1love a group 'of fields which are set up for high_speed transmission. The
number of fields can vary frOJ1l group to group and the size of each field can be
variable. The method used is described on p. 3-4 of 702/705 Bulletin 20, Dec.
1956.

Other _ _ _ _ _ _--:-:-....".-,-_ _ _ _ _ _ __
(Specify)

PROGRAM TYPE: Complete Program _-AX_ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instruction _ _ _ _ __

label _ _ _ _ _ _ _ __

Subroutine _ _ _ _ _ _ __

Label _ _ _ _ _ _ _ ___

241

GUIDE

CONTRIBUTED BY,
Di.rectorate of Ballistic Missiles, EDP
Sc:m Bernardino Air Materiel Area
San Bernardino, California
John R. Smith
WRITTEN BY:

PROGRAM WRITE-UP ABSTRACT
INDICATIVE CODE

PROGRAM NAME

5 B _ 006_0

S/Sgt J. R. Clarke, USAF

Mem Print Analyzer

PURPOSE,
Rearranges instruction data extracted from the MEM PRINT 75 output tape
and produces a listing showing all instruction addresses cross referenced to
memory locations.

GUIDE
PROGRAM WRITE-UP ABSTRACT
INDICATIVE CODE

PROGRAM NAME

MACHINE· 702 _ _ _-,.._ 705_-'X~_ _ Model _ _
II_ _ Oth,, _ __,__--,..-Same as Mem
(Specify)
'Tapes Print 75
IPrlnter _ _ _ TRC _ _ _ _ Drum-'X'-_ _ __

Analyzer

Card Reader _ _ _ 760 _ _ _ _ _ Other _ _ _ _ _ _ _ _ _ __

PURPOSE:
To produce an edited listing in several optional sequences, cross referencing
the data available in an Autocoder Assembly Listing Tape,

PROGRAM LANGUAGE:

Autocoder _X
_ _ Symbolic _ _ _ Actual _ _ _ __
O.he. ----------;(;-Sp-ec--;;""fy;--)- - - - -

MACHINE· 702 _ _ _ __
'Tapes_....!..!ll~_

705_~X,,-_ _

Model _ _
II _ _ Other_.,.,----,_ _

(Specify)
Iprlnter _ _ _ TRC _ _2_ _ Drum _ _ _ __

PROGRAM TYPE: Complete Program _ _x"'---_ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instruction _ _ _ _ _ _ Label _ _ _ _ _ _ _ __

Card Reader _ _ _ 760 _ _ _ _ Other _ _ _ _ _ _ _ _ __
Subroutine _ _ _ _ _ _ __

PROGRAM LANGUAGE:

_ _ _ _ _ _ _ ___

~bel

Autocoder _ _
X _ Symbollc _ _ _ Actual _ _ _ __

Other -------:=---c:-:---------(Sp.clfy)

PROGRAM TYPE; Complete Program

_---""x~

CONTRIBUTED BY,
Directorate of Ballistic Missiles
San Bernardino Air Materiel Area
San Bernardino, California

_ _ _ _ _ _ _ _ _ _ _ _ __

Macro-Instruction _ _ _ _ __

Label _ _ _ _ _ _ _ __

Subroutine _ _ _ _ _ _ __

Label _ _ _ _ _ _ _ __

Written by: C. Kubik
Distribution No.4

GUIDE
CONTRIBUTED BY,

PROGRAM WRITE- UP ABSTRACT

Directorate of Ballistic Missiles
San Bernardino Air Materiel Area
San Bernardino, California

Written by:

INDICATIVE CODE

Faye Redus

PROGRAM NAME
SOCOTT Tape Test

51_001_0

System

Distribution No. 4

PURPOSE,

GUIDE

To reduce machine time required for testing, and produce test output shortly
after each testing session.

PROGRAM WRITE-UP ABSTRACT

MACHINE, 702 _ _ _ _ _ _ 705
.NDICATIVE CODE

X
Model~Other_-::--_:::-:-­
(Spedfy)
'Tapes_'-'lO'---_ _ 'Printer Optional TRC _ _ _ _ DNm _ _ _ __

PROGRAM NAME
Tape

Inpllt/Output
Card Reader _ _ _ 760 _ _ _ _ _ 0ther _ _ _ _ _ _ _ _ __

PURPOSE,
To present a complete set of operations for all functions involving on line
705 tape units controlled by TRC and TCU. Macro Instructions and subroutines are available for tape read, write, read-while-write. control
operations, housekeeping, "label treatment, blocking/deblocking of grouped
records, end of tape, checkpoint, and transfer - any analysis. A utility
routine provides for restart if the checkpoint options are used.

MACHINE· 702

PROGRAM LANGUAGE:

Other _ _ _ _ _ _ _-'-;:--.,::-:-_ _ _ _ _ _ __
(Specify)
PROGRAM TYPE: Complete Program _ _---"X'----_ _ _ _ _ _ _ _ _ _ _ __
N'r::Icro-lnstruction _ _ _ _ _ _ _ Label _ _ _ _ _ _ _ __

_===-;::

705 _ _X"--_ _ Model_'_'_ _ O.he._-:-:--c:-:-_
One TCU tape
x(Speclfy)
'Tapes
required 'prlnter _ _ _ TRC _ _
X_ _ Drum-!.'--_ __
Card Reader _ _ _ 760 _ _ _ _ Other _ _ _ _ _ _ _ _ _ __

PROGRAM LANGUAGE:

Autocoder_ _ _ Symbolic _ _ _ _ Actual_'-'X_ __

Autocoder _X
_ _ Symbolic _ _ _ Actual _ _ _ __

Subroutine _ _ _ _ _ _ _ _ _

~bel

_ _ _ _ _ _ _ __

CONTRIBUTED BY,
Standard Oil Company (Indiana)
Chicago. Illinois

Othe. -------;(S"'p-ec--;If;-y;--)- - - - Distribution No. 6
PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instruction

_-"X~_ __

Subroutine

X

label _ _ _ _ _ _ _ __

GUIDE

Label _ _ _ _ _ _ _ __

PROGRAM WRITE- UP ABSTRACT

Utility Routine _ _-'X'---_ _ __
INDICATIVE CODE

CONTRIBUTED BY,

SP-OOI-O

Directorate of Ballistic Missiles
San Bernifrdino Air Materiel Area
San Bernardino, California

PURPOSE,

~are

Written by: K. Lantz, L. Cohn. T. Carstens, C. Buss, O. Evans, D. Fisher
Distribution No. 4

Z4Z

PROGRAM NAME
Tape Characteristics

a listing of tape capacity; and passing speed in minutes, ~o~ va~i~uB
record lengths, and for 727,72.9-2. and 7Z9~4 tape drives, with both hig an ow
recording density for 729 units.
(Continued on next page)

B - 705

,\IIACHINE: 702 _ _ _ _ _ _ 705 _ _
x _ _ _ ~dcl~Other _

_:_:___,_:_:__(Specify)
II'Tapes---'I_ _ _ _ *Printer~ TRC _ _ _ _ Drum _ _ _ __

Card Reader _ _
X _ _ 760 _ _ _ _ _ 0thcr _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

Other --------cc-~c----­
(Specify)
PROGRAM TYPE: Completo Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __

Autocoder _ _
X _ _ Symbolic _ _ _ _ Acruol _ _ _ __

Macro-Instruction _ _ _ _ _ _ Lobel

Olher _ _ _ _ _ _ _-c:-_c-c_ _ _ _ _ _ __
(Specify)
PROGRAM TYPE: Complete

Program_-"X~

_ _ _ _ _ _ _ _ _ _ _ _ __

Iv\acro-lmtruction _ _ _ _ _ _ _ Lobel _ _ _ _ _ _ _ __
Subroutine' _ _ _ _ _ _ _ _ _ Label _ _ _ _ _ _ _ __

Autocoder _ _ _ Symbollc _ _X_ _ Actual _-"X_ __

PROGRAM LANGUAGE:

label _--,(N"-'O,,N,,-E,,-)'---_ _ __

Subroutine _ _"-,X~_ _ __
CONTRIBUTED BY:
Southern R:lilw::ty Sy.stem
Computer Center
125 Spring St. S. W.
AU:mta, Ga.

(August 1957, Bulletin 50 - 130)

CONTRIBUTED BY,
SPAN Data. ProceSSlng Center, Inc.

GUIDE

Ouestions may be addressed to;

PROGRAM WRITE-UP ABSTRACT

Ronald A. Grant
SPAN Data Processing Center, Inc.
99 Woodland Street
Hartford, Conn.

Distribution No. 6

INDICATIVE CODE

PROGRAM NAME
Generalized TRA RoutlOe Program
Tape Operation, Tape Label and Trailer Checking

SB_002_0
705 CUSTOMER CONTRIBUTION

PURPOSE:
Program Write-up Abstract
1.

To provide for the operation of programs from a program tape.

Z.

To provide for the detection and correction or disposition of errors
resulting from the use of the Tape Record Coordinators.

3.

To provide for proper tape usage through the use of tape labels and
trailers.

PROGRAM NAME

INDICATIVE CODE

650 Assembly of 705 programs
(20,000 and 40,000

SR 0001

MACHINE SPECIFICATIONS:
2000 work 650
Alphabetic device on the card reader, no other special devices required.

MACHINE· 702 _ _ _ __

705
X
Model_l_l _ _ Other_--,-,-_-,-_
(Specify)
'Tapes_"--_ _ 'Prlnter _ _ _ T'C _ _
Z _ _ Drum _ _ _ __

Card Rcader _ _ _ 760 _ _ _ _ Other _ _ _ _ _ _ _ _ __
The 705 program assembly as done on the 650 converts symbolic locations
and addresses to actual locations and addresses, and converts mnemonic
operation codes to actual operation codes.

PROGRAM LANGUAGE:

Autocoder _ _
X _ Symbolic _ _ _ Actual _--"X_ __
Other

RESTRICTIONS:
The maximum number of instructions which can be assembled is determined
as in Assembly 53 on the 705. Reference should be made to page 7 of
Program Brief # 12, "Assembly of Programs by 705" as a key to determining
the maximum program size. Generally speaking, if a large number of
consecutive symbolic locations and few inserts arc used, there should be
no difficulty in assembling any size program. Programs have been assembled
with 2974 and 3779 entries, all classes.

PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instruction _ _-'X'--_ __

H. E. Peabody, IBM, Atlanta, Geurgia
Assignerl. to Southern Railway

Lobel _--,S",e-=-e-"w"-,,,it,,,e-,;u",p_ __

Subroutine _ _ _ _'"-X'----_ _ Lobel _~S~C_RA'_'_P_'_S'--._LA-'CB_Tc.-R_
CONTRIBUTED BY:
Southern Railway Company
15th and K-Streets, N. W.
Washington, D. C.

CONTRIBUTED BY:

--------c(s,.-p-,,""';r,.-y):---------

F. P. Ludlow, Jr.
W. M. Wendt

The generalized routlnes use three tapes.
depend upon the running program.

All other ta.pe requirements

GUIDE
GUIDE
PROGRAM WRITE-UP ABSTRACT
PROGRAM WRITE- UP ABSTRACT

INDICATIVE CODE

PROGRAM NAME
TAPE LABEL, TRA, CHECKPOlNT

SR-001-0

PROGRAM NAME

INDICATIVE CODE

ROUTINE
PURPOSE: A
with TRA

routine to establish a rigid control on all inpul and outpul tapes
check point included.

Input tapes are checked for valid job identification, ur..it number, and reel order.
Output tapes are chEcked for valid destroy date with new bbels written on tape and
typewriter sheet.
Routine is sct up for program input on card reader but is easily modified for program
input on tape.

Available prior to January 1962

PURPOSE:

MACRO

SR~004-0

AGAIN

SR-005-0

IN ITA

SR-006-0

MODA

SR-007-0
SR-008-0

MOVEX
SPRSP

To perform a specified operation or operation
a given number of times; initiali.zing and modifying
as indicated.
To initialize the address of a macro or hand-coded
instruction. (used by AGAIN)
To modify the address of a macro- generated or
hand-coded instruction. (used by AGAIN)
To move a defined field to another defined field.
To provide a class "Bn subroutine for use with
Store-for Print routines of macros to permit
modifications of the Macro!s operands. (used
with MOVEX)

MACHINE· 702 _ _ _ __

Model _ _II_ _ Other _ _ _ __
705
X
(Specify)
ITapes_-"lO'--_ _ IPrlnter _ _ _ TRC _ _ _ _ Drum _ _ _ __

Card Reader _ _ _ 760 _ _ _ _ Other _ _ _ _ _ _ _ _ _ __
(Continued on next column)

MACHINE, 702 _ _ _ _ _ _

705_-"X~_ _

lv'odel_'_'_ _ Olhec_-:-:----c,-,-_

'Tope~ _ _ _ _ _ *Printer _ _ _ _ TRC _ _ _ _

(Specify)

Drum _ _ _ __

(Continued on nex-t page)

243

Macro-lnstruction _ _ _ _ _ _ _ Label _ _ _ _ _ _ _ __

Card Reader _ _ _ 760_ _ _ _ _ 'Other·_ _ _ _ _ _ _ _ __

Subrou.lne _ _ _ _ _ _ _ _ _ Label _ _ _ _ _ _ _ __
PRO~RAM

lANGUAGE,

Autocader_m
_ _ _ SymbaUc _ _ _ _ Actual _ _ _ __

PatcheL'_ _ _ _ _ _ _.:.X'----_ _ _ _ _ _ _ _ _ _ __

omer·_______~~~-------(Sp~lfy)

CONTRIBUTED BY,

PROGRAM TYPE,· Campi... Prcgram' _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __
Macro-Instructton _ _.:.x'----_ _ _ _ Label _ _ _ _ _ _ _ __
Subrau.I ..,_ _ _ _ _X"--_ _ _ _ Label _ _ _ _ _ _ _ __

T.Ragland
A. F. Rundquist
Department of the Army
TAGO, Data Processing Branch
Washington, D. C

CONTRIBUTED BY,
Southern Railway System
Office of the Comptoller
Washi.ngton 13. D. C.

R.obert G,. Btz:r.ell

GUIDE
PROGRAM WRITE- UP ABSTRACT
INDICATIVE CODE

PROGRAM NAME

XE - 001 - 0

Sort 54 Technique of Modification of
Phase III

PURPOSE,
This memorandum provides' the information needed to incorporate a tabulation program
in Phase III of Sort 54, writing no sort output and utilizing the sort's header and trailer
,routines for the report. Knowledge of the materials in the Modification Section of the
So:rt 54 Reference Manual. form CZ8-6031, is assumed.

IMCHINE,702 _ _ _ _ _ _ 705

X
Model_II_ _ Other_.,---,...,.--_
(Specify)
'Tapes,_-"IO'-_ _ _ ,'printer _ _ _ _ TRC _ _ _ _ Drum _ _ _ __

Card Reoder _ _ _ 760 _ _ _ _ _ 0ther _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

Autocoder_ _X_ _ Symbolic _ _ _ _ Actual _ _ _ __

Other-------"C('='Sp-e"C
c;"'
fy7 ) - - - - - - - PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __
Nocro-lnstruction _ _ _ _ _ _ _ Lobel _ _ _ _ _ _ _ __

Subrau.;ne' _ _ _ _ _ _ _ _ _ Label _ _ _ _ _ _ _ __
Description of Technique _ _ _..:X' -_ _ _ _ _ _ _ _ _ __

CONTRIBUTED BY,
A. F. Rundquist
Department of the Army
TAGO. Data Pracessing Branch
Washington. D. C.
Distribution No.8

GUIDE
PROGRAM WRITE- UP ABSTRACT
PROGRAM NAME

INDICATIVE CODE

SQrt 54 Modification to

XE_OOZ_O

!lAC

file size

PURPOS.E,
To change the assignment routine of Sort 54 to use the fUe size on a control card as
a factor in creating the faste st possible sort and to automatically set up over maximum

h\odel_I_I_ _ Other_.,---,,-,--_
X
(Specify)
'Tapes _ _ _ _ _ 'Printer _ _ _ _ TRC _ _ _ _ Drum _ _ _ __

IMCHINE,702 _ _ _ _ _ _ 705

Card Reader _ _ _ 760 _ _ _ _ _ 0ther _ _ _ _ _ _ _ _ __
PROGRAM LANGUAGE:

Autoc:oc:Ier_ _ _ Symbolic _ _ _ _ Actual_~X"__ _

O.h~--------------"C("'Sp-e"Cc;7fy7)--------------PROGRAM TYPE: Complete Program _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __
(Continued on next column)

244

Distribution No.8

.. ..............................................................

113M

0109

0709

L8M

0109

PROGRAM

LIBRARY

ABSTRACT

0709

PRCGRAM

LIBRARY

B - 709

ABSTRACT

~

3B8GS1lD9

AVAILABLE PRIOR TO JANUARY 1962

BASIC 10J) 110 CONVERSION SUBROUTINES.
A SET OF BASIC INPUT AND OUTPUT CONVERSION SUBROUTINES FOR
USE WITH THE 709. THE TWO GROUPS OF SUBROUTINES ARE INTERRElATED AMONG THEMSELVES AND USE A COMMON COMMUNICATION
REGION. THE ACTUAL CODING HAS NOT BEEN DISTRIBUTED. SPECIFLCATICNS ARE BY THE 109 SYSTEMS COMMITTEE.

0109
0709

482GASPOT

AVAILABLE PRIOR TO JANUARY 1962

557RL0209

104 TO 109 SY"'BOLIC TRANSLATOR
THE 7Q4 TO 709 TRANSLATOR IS DESIGNED TO READ A SAP 2
SYMBOLIC PROGRAM, EITHER CARD OR BCD TAPE INPUT, AND TO
PREPARE A SYMBOLIC 709 PROGRAM SU[TABLE FOR COMPILING
BY THE SCAT PROGRht~.

AVAILABLE PRIOR TO JANUARY 1962

S6)SE9BLC

AVAILABLE PRIOR TO JANUARY 1962

109 PROGRAM FOR CUECKING OPERATIONS NEEDING TRANSLATING
SPOTS THOSE INSTRUCTIONS IN A 104 ABSOLUTE DINARY DECK
WHICH MUST BE CHANGED BEFCRE THE DECK MAY BE RUN ON A 709 ..
LISTS THESE INS1RUCrtONS KITH THEIR LOCATIONS.

BINARY LOADER AND CHECKSUII CORRECTOR
LOADS ABSOLUTE BINARY CARDS AT OR ABOVE LOCATION 58 OCTAL
UNDER SENSE S"'ITC1-l CO~TRUL .. HICH CAUSES PUNCHING OF OUPLlChTE
CARDS WI TH CORRECT CHECKSUMS UPON ENCOUNTERING CHI:CKSUM
DISCREPANCIES OF ANY KIND OR PUNCHING OF A COMPLETE NEW DECK.

0709

0709

485MISRT3

AVAILABLE PRIOR TO JANUARY 1962

SCUARE ROOT, FLOATING POINT 709 ONLY
SUOSTANTLAllY THE SAME PROGRAM AS M[SRTI
IDISTRIBUTION 39<]1 MODIFIED TO CONFORM TO THE
ST/lr-.OARDS OF THE SCAT SYSTEM AND TO TAKE
ADVANTAGE OF NEW 709 INSTRUCTIONS..
FULL SINGLEPREC I S [ON ACCURACY /26 B ITS/..
TIM ING-l.272M. S ..
ERROR RETURN FOR NEGAT IVE, iliON-ZERO ARGUMENTS.
AC INDICATOR USUALLY TURNED ON.
SPACE REQUIRED.
-43 LOCATIONS E 2 CO,",MON ..

0709
0109

502Rl TC9

AVAILABLE PRIOR TO JA.'WARY 1962

TAPE COMPARE FOR THE 109

0709

S02RL T09

0109

A,

0709

0109

PROGRAM

50ZRL TS9

LIBRARY

ABSTRACT

AVAh.. ABLE PRIOR TO JANUARY 1962

TAPE DUPLICATCR FOR THE 7C9
READS Ab. WRITES B6 WILL SKIP FILt:S ON EITHER A6 OR 136
BINARY OR DECIMAL TAPES, BINARY CONTROL CARO KEEP~ BOTH TAPES
MCVING SIMULTANEOUSLY.
CORR .. /646

0709

507JBACS

AVAILABLE PRIOR TO JANUARY 1%2

S63SE9RBL

!ULOCATABLE BINARY LOADER
LOADS AND CHECKS STANDARD SHARE ABSOLUTE AND RElOCAIABLE
CARDS. WILL NOT ACCEPT SHARE CORRECTION OR SHARE CORRECTIO~­
TlUNSFER CARDS. SELF LOADS INTO 0 - 170 OCTAL LOCATIONS ..

AVAILABLE PRIOR TO JANUARY 1962

TAPE CUMP FOR THE 709/0CTAL PRINT!
PRINTS RECORDS CR FILES,
ON LINE OR WRITES TAPE
FOR OFF
LINE PRINT,
BINARY CONTROL CARD,
WILL READ MORE THAN ONE
CONTROL CARD,
wILL PRINT A SELECTED SEQUENCE OF 1oI0RDS FROM
EACH RECORD.

IRM

AVAILABLE PRIOR TO JANUARY 1962

S63SE9LRL

RELCCATING· BI~ARY LOAOER.LOWER
LOACS INTO CORE r-'(MORY INFORMATION fROM ABSOLUTE AND
RELOCATADLE BINARY DATA CAROS.CORRECTION-TRANSFER CARDS,
AND ORIGIN TABLE CARns. ONLY THE DATA CARDS ... ILL BE CHECKS~/l1<'EO .. CORRECTIONS MAY BE UP-DATtO AND UP-DATING WILL
CONTlf'oUE EVEN TttOUGH A PREVIOUS INSTRUCTION HAS BEEN IGNORED ..
SELF LOADS INTO 0 - 334 OCTAL LOCATIONS.

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRIOR TO JANUARY 1962

S6"3SE9URL

RElCCATING BINARY LOAOER.UPPER
LOADS [NTO CORE MeMORY INFORMATION FROM A8S0LUTE AND
RELCCAT ABLE fI I NARY OA TA I CARDS. CORREC T I ON-I RANSHR CARDS I
AND ORIGLN TABLE CARD'i 1' ONLY THE DATA CARDS WIll BE CHECKSL'~~EO. CORRECTIONS '"'AY BE UP-DATtO AND UP-DATING WILL
CONTINUE EVEN THOUGH A PREVIOUS INSTRUCTION foilS PoHN IGNORED.
SELF LOADS INTO LOCATIONS 77452'"71177 OCTAL PLUS 0.1,2 US~O
TO BCOT STRAP IN.

IBM

0109

0709

PROGRAI-'

S69SESlOU2

LIBRARY

ABSTRACT

AVAILABLE PRIOR TO JANUARY 1962

II GENERAL OUTPUT PROGRAM
TO SET UP AND [lRINT ONE LINE - 72 OR 120 COLUMNS - OR TO
OUTPUT A COMPLETE LINE TO II SPECIFIED TAPE. on OaTH. ANY
DESIRED FORMAT MAY fiE USEe AND CONVERSIONS fROM FLOATING
f\IN~RY TO FIXED DECIMAL, FlOATlNG BINARY TO FLOATING DECIMAL
OR FIXED BINARY TO FIXED DECIMAL ARE MADE AS INO!CI\Tf:D ..
OUTPUT IN HOLLERITH fiNO OCTAL CAN ALSO BE DONE. LOCATIONS TO
BE CUTPUT ~f,'f fiE INDEXED IF DESIRED .. THE SHARE 2 BOARD IS
USED FOR ON-LI~~ OUTPUT.

flOATING POINT ARCCOSINE SUBROUTINE
MUST Be FOLLOWED BY Ie ASN, TIMING 4.0 MS, 9 LOC.
CORR./S49., ADDENOUM./619
0709
0709

5071BLOG2

AVAILABLE PRIOR TO JANUARY 1962

FLOATING POINT NATURAL LOGARITHM
BASEO ON 104 PROGRAM LAS 820. TIMING ABOUT 2.0 MS ERROR
•••
AT "'OST 3XI0-8, ABSOLUTE FOR LOG SMAllER THAN 1, RELATIVE
OTHER""ISE.

0109

519CSCAPI

AVAtLAOLE PRIOR TO JANUARY 1962

COtJHNT ATTACt--ED PROGRAM. 1709 PROGRAM/.
PRINTS ONE TO HjIMES lOR, OPTIONALLY, I SUB
K TIMES l FOR K - O,I, .... ,N .. RECJUIRES PROGRAM 46B CelLS
CO"'to'ON 15 CelLS. TIMING IS APPROX .7L & 2 MS., WHERE
L - KOVER 2. 170901 CORR!1l61

248

AVAILABLE PRIOR TO JANUARY 1962

0709

999RlO:l90

AVAILABLE PRIOR TO JANUARY 1962

SelF-LOADING BINARY-OCTAL LOHER LOADER
LOADS ROW BINARY ABSOLUTE DECKS AND OCTAL CHANGE CARDS ..
QARDSO AND 2 OF THE OUTP:UT DECK CONTAIN IN 9R THE WORDS TO
BE PUNCHED MANUALLY I.NTO 9L OF CARDS 1 AND 3, AFTER
-REMOVtNG- THE CONTROL INFO FROM THE 9L OF CARDS 1 AND 3.
CARDS 0 AND 2 SHOULD THEN BE DISCARDED ..

AVAILABLE PRIOR TO JANUARY 1962

loWPC BUFFERED 110 PACKAGE FOR 709 FORTRAN.
!SEPTEr~B,ER 1960 FIELD-TEST VERSION!
A COMPLETE SET OF ROUT. TO REPLACE THE I/O RO'UTINES IN THE
709 FORT. LIBRARY .. THIS SET PROVIDES TAPE BUFFERING FOR ALL
FORTft'inr,
or combinations of these opurations.

Equipment Specifications: 4K, 1401 card system, with the advanced programming
package, and 1403 printer.

Method:

Additional Remarks: We have found that this program is helpful in debugging
seSSIons because it proves our summary output imnlediately.

Restrictions, Range:

IBM 1401 PROGRAM LIBRARY ABSTRACT

File Number

1.4.001

Source Language SPS.

Not given.

Storage Requirements:

Not given.

CORRECTION CARD LOADER

Equipment SpeCifications;
positions of core storage.

F. E. Johnston
IBM
Z500 Central Avenue, S. E.
Albuquerque, New Mexico

IBM 1401 PROGRAM LIBRARY ABSTRACT

FAST

Purpose: To alter a 1401 program after it is loaded. Corrections will be
punched with one instrwnent or up to 31 character a of data per card. The
instruction carda will contain the length of the instruction, location to be loaded
and the instruction. The location as well as the A and B address of the instruction may be actual machine language or 4 digit addreaaes.

Method:

Source Language SPS.

Restrictions, Range:
This program is located in positions 100 through 317.
This area is cleared upon reading an end card. The correction loader may be
used with condensed, condensed 'With checking feature or one instruction per
card such as SPS type cards.

Storage Requirements:

Not given.

~

(E,'0urteen 0 one

~utomated .,2ystem

CALL

(~rat ~sembled

!::ogical

File Number 1.4.

aoz

~oader)

1. 4. 004

of .!esting)

Method:
Through the use of simple control cards, the tape file generator,
storage print and tape print can be accomplished.

Storage Requirements:

Not given.

Minimum 4000 positions.

13Z position printer.

IBM 1401 PROGRAM LIBRARY ABSTRACT

File Number

1. 4. 005

TRICOMII
Dick Nichols
North Ame rican Aviation, Inc.
Dept. 92. Building 6
4300 East 5th Avenue
Columbus 16, Ohio

Robert W. Heald
IBM
340 Market Street
San Francisco 11, California

Purpose: The CALL program loads the CARAT (1.1.002) assembled programs
directly from tape into the 1401. Thus object program decks need not be punched
until the programs are completdy "debugged".

Method:

File Nutnber

Purpose: A testtng procedure which permits the preparation of magnetic
tape files immediately preceding the test of the program which will use
them and a storage prlnt and tape print following the test of the program.
It allows for the testing of programs on a continuous basis.

Equipment Specifications:
IBM 1401 PROGRAM LIBRARY ABSTRACT

1400

Margaret Pentaleri
IBM Eastern Region Datacenter
lZ71 Avenue of the Americas
New York ZO, New York

Restrictions, Range:

Equipment Specifications: Standard 1401 with 1400 positions of COre storage.
No special features needed.

Dasic 1401 - No special features needed.

Source Language 1401 Symbolic Programming Systelll.

Purpose: This prOgralll simulates peripheral equipment as tape-to-printer
and/or card-to-tape, or tape-to-card.
It allows for running tape-to-printer or card-to-tape or tape-to-card at
maximum speeds allowed by the hardware.
A synchronous operation is permitted when running tape-to-printer. Card-totape or tape-to- card can be run with tape-to-printer but they cannot be run at
the same time (reading and punching cards).
Through use of external sense switches, program recognizes which tape
operation is to be executed and also the input~output mode.

Restrictions. Range:
a) When used with CARAT, as much as 75% of the machine time
reqUired to assemble and test a program can be saved.

Method;
Tape-to-Printer Simulator - Program scans records for record
marks and prints each record defined by an ending record mark or phySical
end record as a separate line. An indefinte number of records may occur
in a block.

b) The CALL program provides for patching.

Storage Requirements:

Not given.

Equiptnent Specifications:
and six sense switches.

4K Model C 1401 with High - Low - Equal Compare

IBM 1401 PROGRAM LIBRARY ABSTRACT

File Number 1. 4. 003

CARD REPRODUCING AND/OR LISTING PROGRAM FOR THE IBM 1401

(Continued on next column)

Card-to-Tape Simulator - With Sense Switch D. and G UP all cards
are assumed to be BCD and a validity check occurs if an illegal BCD
character is loaded. An 80 column image is written on tape. With Sense
Switch D UP and G IX)WN, all cards are read in the binary mode. Column 1
is interrogated and if both a "9" punch and a "7" punch are found, a 168
character binary record is written on tape. If not, the BCD image of 84
columns is written on tape with even redundancy; although the validity of BCD
characters on the card is not checked by the reader whf'n reading in the binary
mode, the 1401 ..:hecks its 0'WIl reading as completely as it does in the BCD mode.
Tape-to-Punch ~ TRICOM II will accept either binary and/or BCD records in any mixture and punch corresponding binary or BCD images.
(Continued on next page)

255

Special Techniques ~ By using redundant instructions we can arrive
at the address of a record's terminating location, e.g., "Page 4, lines 070 and
170 MCM 0742", etc.

IBM 1401 PROGRAM LIBRARY ABSTRACT

1.4.008

File Number

BINARY TAPE DUMP
Restrictions, Ranges:

Not given.

Storage Requirements:

Memory 4K. Written in SPS

F. J. X. Berckrnan
Westinghouse Electric Corporation
Steam Division, B. Plant, Room 410
Lester, Pennsylvania

TRICOM II

Equipment Specifications:
Equipment: Model C3 with two tape units, advanced programming package, print storage RPQ read 8-5, 6, 7 characters
(or can he loaded from console), high~low equal compare, space supressi.on,
optional column bina.ry. Tape unIts I, 2,.2..i. card reader; card punch; printer.

Purpose: This program provides the ability to dump a binary tape in octal
equivalent. The printed result is in 'M:) I'd blocks with eight blocks to a line.

Method:

Does not apply.

Restrictions, Range:
IBM 1401 PROGRAM LIBRARY ABSTRACT

Filc Number

1. 4. Oi)6

1401 TCS (!ape £ontrol £ystem)

a) Variable length records acceptable. Maximum length decoded is
2200 characters or 366 words.
bl Single or double spacing available (SSB).
c) Record count and character count per record message is available
with each record (SSC).

Catherine Selleck
IBM
3424 Wilshire Blvd.
Los Angeles, California

Storage Requirements:

Purpose: To eliminate the necessity for coding of tape reading, writing. error,
end of file and label instructions.

Equipment Specifications: 1401 Standard Model G3, Two Tapes, column binary,
advanced programming package, High-Low-Equal Compare. Sense Switche5
(optional).

Method:

Does not apply.

Not given.

IBM 1401 PROGRAM LlI3RARY ABSTRACT

Restrictions. Range;
TCS-l provides header and trailer labels which are
compatible with 7070 and 1410 IOCS. Multiple reel file operations and tape
drive alternation are included.
TCS-2 Same as TCS-l except that no header or trailer
label routines are included.

File Number

1. 4. 009

ZIP (Instant Printing)
Keith Swan

Direct Inquiries to:

The program is distributed in SPS fonn to be assembled with the user's program.
Any desired combination of tape drives may be used for input or output.

Keith Swan
Southern Permanente Services
143 South Alvarado Street
Los Angeles 57, California

Purpose/Description: A utility load and go program for listing cards at a rate
of 600 lines per m.inute.
Storage Requirements:

TCS-l
TCS-Z

1848 memory positions
no memory positions

Equipment Specifications: 1401 Model C, D. E, F 13-16, or F Z3-Z6 Advanced
Programming Package
High-Low-Equal Compare.

~

Source language SPS

Restrictions/Range: 10 fields of any size can be listed. Field 10 can be accumulated up to 12 positions and edited. Without control cards. an 80-80 list is
obtained. Card count, limited page headings. and page numbering are included.
Storage Requirem.ents:

IBM 1401 PROGRAM LIBRARY ABSTRACT

File Number 1. 4. 007

N/A

Equipment Specifications: Read release and print buffer required for any ZK or
larger 140}'
IBM 1401 PROGRAM LIBRARY ABSTRACT

FACTOR 1 ,!:ourteen -O-One ~utomatically

~ontrolled

File Number

1. 4. 010

!est s?ptimizing .!!-outine
ESCAPE (Effortless System of Calculating and Printing Everything)
W. J. Teagarden
-

Mr. T. E. Robertson
IBM Corporation
525 South Flower Street
Los Angeles 17, California

Mr. R. N. Barnes
IBM Western Region
3424 Wilshire Boulevard
Los Angeles, 5, California

Purpose:
FACTOR 1 is a program testing routine, which makes possible
continuous testing of any number of assembled card system 1401 Object Programs.

Method:
AU test output is identified by test program title on the printer and in the
punch stackers. Stacker identification cards also indicate the number of the stacker
selected (NP, 4, 8/2). At the end of each program test an automatic storage
print out with word marks, in 100 position increments is provided.

Restrictions, Range:
positions.

Card programs only, with total memory not exceeding 3700

Storage Requirements: Factor is stored in the upper 300 positions of 4K 1401.

Equipment Specifications:

256

1401 4K, 1402, 1403

Direct Inquiries to:

W. J. Teagarden
Southern Permanente Services
143 South Alvarado Street
Los Angeles 57, California

Purpose/Description: A utility progralTI which provides rapid conversion of
604, 602. and 528 jobs to the 1401. This load and go program also may be used
to J:cproduce eards as well as gang punching, selective reproducing. sequence
numbering, listing or combinations of these operations. Combines the functions
of the previously published Card Reproducing and/or Listing Program (1.4.003)
and BANG I and II (1 0.2.002) without thc restJ:ictions of BANG I and II.
~

Source

languag,~

SPS

Restrictions/Range; Three separate routines (or two card routines and end-offile routine) may be developed. The effective working storage of the object program is comprised of 20 counters and 20 storage units of ten positions each.
Multiplication and diviSion can be executed only from counters.
Storage RequirclTIcnts: Approximately 1800 positions of core are available to
build the three routines of I, 000 positions, SOD positions and 300 positions.
Equipment Specifications: 4K 1401. Punch feed read, multiply-divide and
High-low-equal compare features are required if program is completely used

B - 1401

IBM 1401 PROGRAM LlDRARY ABSTRACT

File Number 1.1.011

FITS t!"ourtecn-O-one .!.nput-output rape-control Jbrstem)
R. J, Macartney

Direct Inquiries to;

Restrictions /RanSe:

5.

Feed Read requires patching.
Writing is in the Move Mode only.
Header and trailer labels arc alway", written on the output file:::;,
Input fdes arc acceptable with or withou.t header labels.
The FITS subroutines provide th(: followin!;:
A.

1. Input File: Checks file ID name and reel number.

B.

Output File: Checks creation date and retention cycle.
Writes Output header label.

L_ E. Ohman &.. L. K. Pounds
1011 San Jacinto Street
Austin I, Texas

Purpose/Description: STRIDE provides a method for converting 90-col. cards
to 80 - col. cards or may be \If;ed as a sub-routine so that the 1401 can use 90~col.
cards as input for a report writing pro!;ram.

Restrictions /Range:

N! A

N /A

Storage Requirements:

'lK

Equipment Specifications: 4K 1401 with column binary feature.

No format rearran!;ement is attemptt:d but provision is made for the user to
insert his own format control.

1772 locations arc available for [onnat control.
Speed is approximately 200 cpm input, dependent on output and alphabetic content.

Put:
Moves coach reco~d sequenthlIy from a work area to a blocking area,
auto~at1cal1y wnting to tap", when the blocking area is full. All error
routlnes arc taken care of by the subroutine. A trailer label is written,
a status card is punched, and a new reel is opened when an end of reel
condition occurs.

D.

1. 4. 013

90 col. cards are read directly into the 1401 if the 45 col. brush block is available;
otherwise 90 col. cards arc first reproduced into 80 col. cards,

Get
Places the next record in a work area for usc by the program. All
t<'>pe reading, deblo,;king, errCH routines and cnd of reel conditions
are takcn ca:re "f by the subroutine.

C.

Number

Additional Remarks: STRIDE presently puts first 80 of 90 col. input into first
card and last 10 into second card.

Open:

l.
3.

Direct Inquiries to:

Mathematical Method:

1. Since the header labels are proccssed in the punch arc')', the use of Punch

4.

r~ile

STRIDE - Subroutine fuppHes Open, Close, Get, and Put closed
subroutines to users awaitmg the full IOCS package for 1401 Autocoder. In
addition, it supplies the advantages of an IOCS compatable package to Uf;crs who
arc unable to assemble Autocoder due to their system's configuration (less than
4 tape drives).

3.

1::quipment ::'peciflcations:
1401 with 4, 000 positions of stora!;e and Column
Binary DeVICl!. SCOOP II requires the Advanced Programming Package.

IBM 1401 PROGRAM LIBRARY ABSTRACT

File Number

1. 4. 014

AUTOPIC 1401 - Automatic Personal Identification Code for the IBM 1401
Ja:::k Melnick

Close:
Processes the end of file trailer label and removes the tape fran.
use::.

Storage Requirements:

Direct Inquiries to:

Approxitnately 1370 positions.

Equipment Spf:cifications: 1401 Model C, D, E. F 13~16. or F 23-2.6.
Adva.nced Programming Packa!;e
High~Low-Equal Compare

IBM 1401 PROGRAM LIBRARY ABSTRACT

Mr. Jack Melnick
IBM Corporation
lIS West State Street
Trenton 8, New Jersey

Purpose/Description: The program will code alphabetic names of individuals
and assign unique Identifying data to each individual in order to simplify Alphaoetic sorting, provide alphabetic characteristics to a numeric code, and identify
an individual in an alphabetic list by specific individual characteristics.

File Number 1. 4. 012
Method: SPS II Language

scooP I and II
Robert E. Engelson &. Louis P. Poulin

Re5trictions/Range: The running time is 98 to 148 cards per :minute depending
on sequence of input cards.
Storage Requirements: BK Core

Direct Inquiries to:

Mr, Robert E. Engelson
IBM Corporation
IllS - 15th Street
Sacramento, California

Mr. Louis P. Poulin
California-Western States
Life Insurance Company
2.020 L Street
Sacramento 4, California

Purpose/Description: To provide a si1Tlple method of converting 90 column (or
other) cards in descending sequence to 80 colu1Tln cards (or magnetic tape) in
ascending sequence.
Method:
The user of SCOOP specifics in Column Control Cards
each column to be translated FROM and TO. A Translation Table control card
per1Tlits complete control over character translation. The user must program
his own output routine and assemble it wlth SCOOP, Program Exit and Entry
points have been provided for this purpose.
Restrictions/Range: Field tests and actual customer conversion usa!;e have proven
that unvcnficd 90 column round hole cards can be accurately read in a 140Z read
feed when It 15 properly adjusted for normal 80 colulTl.ll card reading. Verified 90
column cards have an elongated hole. To prove accuracy of conversion, control
totals should be taken prior to translation and a control total routine should be
included as part of the output routine.
Storage Requirements:

4,000 positions of storage
(Continued on next column)

Equipment Specifications:

IBM 1401, 8K Core, Z Tapes, Hi-Low-Equal Compare

Additional Remarks: Compatible with previously announced AUTOPIC 650 for
the IBM 650. General information Manual, "Unique Compatible Name Code for
Alphabetic Account Numbering," form number F20-8052 and 650 Library Pro!;ram
1. 6. 041 contain details of program. Expected alphabetic sequence of 85 ~ 950/0
perfect; no duplicates encountered thus far.
IBM 1401 PROGRAM LIBRARY ABSTRACT

1401 TAPE EXECUTIVE PROGRAM
H. Lee

Direct Inquiries to:

File Number

1. 4. 015

Bak~r

Mr, H. Lee Baker
The Detroit Edison Company
2000 Second Avenue
Detroit 2.6. Michigan

Purpose/Description: To place 1401 programs on an Executive System Tape.
To select and load these programs, based on sense switch settings, to update the
Executive System Tape.
(Continued on next page)

257

~

Restrictions/Range: Noise records are not tested.
re-writing and re.reading.

Symbolic language

Restrictions/Range:

The only alternatives are

See writeup
Storage Requirements:

Storage Requirements:

276 positions

4000 memory positions hi-Io-eq compare
Equipment Specifications:

Equipment Specifications: 1401 Model C-3, Two 729 Model II or IV Tape Units,
1402 Read/Punch, 1403 Printer

IBM 1401 PROGRAM LIBRARY ABSTRACT

1. 4. 016

File Number

1401 Tape System with Advanced Programming.

IBM 1401 PROGRAM l.IBRARY ABSTRACT

File NUlTlb",r

1. 4. 018

TRAP (Tape Record Analyzer Print)
W. J. Wilson & C. L. Craig

DC TPOP, TAPE TO PRINTER OR PUNCH
Paul Tani
Direct Inquiries to:
Direct Inquiries to:

Paul Tani
Union Carbide Corporation
270 Park Avenue
New York, No>w York
To obtain printed or punched output from a file of tape

Purpose/Description:
records.
~N/A

Restrictions/Range:
Requires Advanced Programming, Column Binary, (if
column binary cards are to be punched), High-Low-Equal-Compare. and Space
Suppress (if this feature is to be used).
Storage Requirements:

8000 character memory

Equipment Specifications:

1401 _ 8000 character me:mory - Autocoder

IBM 1401 PROGRAM LIBRARY ABSTRACT

File Numb",r

1. Ii. 017

W. J. Wilson & C. L. Craig
Computation Division
Huntsville Computer Center
Marshall Space Flight Center
Huntsville, Alabama

Purpose/Description: To automatically analyze and print at 600 lp:m in optimu:m
readable for:m the contents of a magnetic tape written in BCD mode.
Method:
This program reads, analyzes and prints tape records
maIntalning vertical aligruncnt of equivalent flelds from record to record and
block to block WhlCh avoids the staggered print pattern associated with :most tape
print programs. This program handlcs both variable and constant length, single
and blocked recordf> which may be int 2 and 3 are used by the l;ubroutinCB. This should not concern the
pnlgr.1.rnmcr because th,'y ,ln' r(:~t,.).t.'d to th(' ",ntry conditions at exit tinle. On(,
proviso is made however, namdy - that word marks are not left in their tens and
nnits positions at entry time.

ASC SYSTEM (Aeronutronic Simplified Codmg System)
S. SchleSinger & L. Sashkin

Direct Inquiries to:

Purpose:
Scion providc5 the programmer with closed floating point subroutines.
The subroutines include the normal ari.thmetic operations in addition to modeconversion type opcratLons. The programmer is also afforded the option of
utiliz.ing: onc of three sizes of noati~g point mantlssa - namely, 4, 8, and 12
digits. This gives what normally would be termed 6, 10, and 14 digit floattng
point. The subroutines are mapped so that modular utilization is possible tn
those cases where some additional memory space is needed.

1401 TAPE LIBRARY CONTROL SYSTEM
Robert W. Heald

Direct Inquiries to:

1401

Equipment SpecifLcations:
IBM 1401 B. C. D. or E with the following special
features:
I) Multiply-Divide
2) Advanced Programming Package
3} Hi-Lo-Equal Compare.

S. Schlesinger & L. Sashkin
Aeronutronic, A Division of Ford Motor Company
Ford Road
Newport Beach, Cahfornia

Purpose/Description: To eliminate the requlrement for hand computation using
a desk calculator and sets of tables by a method which is more reliable and less
costly.

IBM 1401 PROGRAM LIBRARY ABSTRACT

File Nllmbrr

:1. O. 003

SQUARE ROOT SUBROUTINE
Kenneth Johnson

Method:

Does not apply

Restrictions/Range:

Does not apply

Storage Requi.rements: 4000 positions of storage. Model C3 or E3 eqmpped with
multiply and divide. Advanced ProgramlTIing Feature, and two lTIagnetic tape units.
Equipm.ent Specifi.cations:

Direct Inquiries to:

Kenneth Johnson
Bureau of Public Roads
Department of COlnmerce
Washington 25, D. C.

Model C3 or E3

Additional Remarks: If a program is less than 350 ASC instructions and no
instruction blocks are stored on lTIagnetic tape, then only Ont: tape unit is needed.
IBM 1401 PROGRAM LIBRARY ABSTRACT

File Number

3. O. 001

Purpose /Description: Computes the Square Root of a single-precision fixed
point 10 digit number.
Mathematical Method: Accuracy -

!:

1 in units postition

Restrictions JRange: .999999999 to 999999999.
Storage Requirements: 314 positwns of core storage

9 x 9 TEN MILLISECOND MULTIPLY SUBROUTINE

Equipment Specifications: Mimmum 1401 with automatic multiply-divide and
high, low, equal compare features.

Mr. Richard B. Feaster & Mr. William H. Post
IBM
340 Market Street
San Francisco 11, Californi.a

Additional Remarks: This routine was converted directly from a modification
of the routine in the original 650 manual. It can be incorporated with other
programs without modification.

Purpose:
This program will multiply two nine position fields together. with
sign control, in significantly less time than previous programs.

~

IBM 1401 PROGRAM LIBRARY ABSTRACT

Timing 10 ms. per multiplication.
Hubert P. Nucci
U. S. Department of Commerce
Bureau of Public Roads
Washington 25, D. C.

Direct Inquiries to:
Storage Requirements:

3. O. 004

1401 FLOATING POINT SUBROUTINES (Normalized)
H. P. Nucci

Source Language SPS.

Restrictions, Range:

File Number

334 Positions.

Equipment Specifications:

1401 - any model, no special features required,

IBM 1401 PROGRAM LIBRARY ABSTRACT

File Number

Purpose/Description:
Computes floating point add, add absolute, subtract,
subtract absolute, multiply, and divide.

3, O. 002

,_.

SCION (Scientific 1401 Programming with Floating Point)

Mathematical Method:
Restrictions/Range:

Storage Requirements:
lohn Discola
IBM
9250 Wilshire Blvd.
Beverly Hills, California

(Continued on next column)

NIA

0000000000 to 99 99 99 99 99
806 cores of memory

Equipment Specifications: Any size 1401 with index registers, multiply-divide,
High-Law-Equal Compare
(Continued on next page)

259

Additional Remarks: This package can be assembled anywhere in memory inde~
pendently or as part of a progra:m. The contents of index register nutnbcr I are
stored teInporarily, and restored after operation is cOJJlpleted. Coding is in
symbolic and can be assembled by SPS or Autocoder.
IBM 1401 PROGRAM LIBRARY ABSTRACT

1401

SIN~COS

File NUInber

3. O. 005

will accommodate a matrix, subject to the following restrictions:
ZBtB(WL}t(A+l) (B'-2) W~22.50, where
B is the number of rows in the matrix,
A is the number of columns in the matrix, and
WL is the number of digits in the elements.

Storage Requirements:

SUBROUTINE

Not given.

Kenneth Johnson
Equipment Specifications:
positions.
Direct Inquiries to:

Kenneth Johnson
U. S. Department of COInInerce
Bureau of Public Roads
Washington 2.5, D. C.

IBM 1401 PROGRAM LIBRARY ABSTRACT

Purpose)Description: Computes SIN and/or COS converting degrees to radians
producing a nine decimal place result.

717/720 SIMULATION ON 1401

~ Hastings Approx.: Result in location KOSIN with sign in units position.

W. Stokes
IBM
425 Park Avenue
New York, New York

Restrictions/Range:

000.1 to 359.9 degrees

Storage Requirements:

File Number

10.2.001

Approximately 700 positions of core storage.

Equipment Specifications: Minimum 1401 with automatic multiply-divide and
high, low, equal compare features.

Purpose: To achieve maximum 1403 print speed while printing tapes originally
prepared for "off line" use on IBM Tape 717 and 720 printers.

Additional Remarks: This routine was converted di:r'ectly f:r'ozn a modification of
the routine in IBM Technical Newsletter No.9 by G. R. Trimble. It can be inco:r'~
po rated in other programs with only modification of sample exit instructions.

Method:

IBM 1401 PROGRAM LIBRARY ABSTRACT

File Number 9.4. 001

DIVERSITY STUDY
Henry L. Schmitz, Jr.

Direct Inquiries to:

Maximum demand for each customer
Maximum Coincident Demand for I, 2, 3, --- N custom~
ers where N is the number of customers in the sample.
Coincidence Factors for 1. 2, 3, --- N customers

3.
Mathematical Method:
Restrictions/Range:

Not pertinent

4.) Files may be:
unlabeled.
labeled fOllowed by tape records.
labeled followed by T/M followed by tape records.
5.) Multifile reels may be printed.

Storage Requi.rements:
available for patching.

4000 pOSitions of storage

Equipment Specifications:

1.) Accepts single fixed or variable length records with or without a
record mark in terminal position.

6.) No control cards required.

N/A

Storage Requirements:

Restrictions, Range:
Tape records must be 1000 characters or less in length.
Blocked data records must be separated by a record mark. (Last data record may
or may not end in a record mark).

3.) Number ot data records per block is unlimited, however total length
may not exceed 1000 characters.

Analysis of customer demand to determine the following:
1.
Z.

Not given.

2.) Accepts blocked fixed or variable length records, each data record must
be separated by a record mark, however last data record mayor may not have a
record mark in terminal position.

Mr. Henry L. Sclunitz, Jr.
Systems Engineer-Scientific
IBM Corporation
2.73 State Street
Springfield, Massachusetts

Purpose/Description:

I.
2..
3.
4.
5.
6.

IBM 1401 PROGRAM LIBRARY ABSTRACT

4000 positions of memory - approximately 700 p.ositions

717/7Z0 SIMULATION ON 1401

3 tapes
Advanced programming
Multiply-Divide
High-Low-Equal Compare
Card input-output
Expanded print storage

Additional Remarks: Program handles 3 digit demand for up to 39 customers.
Coincident Demand cannot exceed 4 digits.
File Num.ber 10.1.001

1401 LINEAR PROGRAM

Harm K. Schreur
IBM
2911 Cedar Springs Road
Dallas 19, Texas

Purpose: This program attempts to obtain a maxim.um. functional of A unknowns
in B equ.ations.

Equipment Specifications:
IBM 1401 Model C3 or D3
IBM 1402 (required only for program loading, can be tape loaded on D3)
IBM 1403 Printer Model 2
IBM 729 Tape Drive
Advanced Programming Feature #27
Print Storag(' (required to achieve maximum print spC'ed) Feature #M7.
IBM 1401 PROGRAM LIBRARY ABSTRACT

File Number 10.2.002

BANG 4 : Basic Arithmetic Notation Generator
Revision #4 with optional nond.1mensional Multiplication
and Division subroutines.
Mr. L. Wagoner
Bendix CorporatiOn
South Bend, Indiana
~

The Simplex :method, such as described by Charnes, Cooper and
(Wiley and Sons _ An Introduction to Linear Programming) is used
to o,btaiil the Maximal.

1. ) Multiplication and/or Division - For 1401 Data Processing
Systems not equipped with fue Multiply - Divide optional
feature, subroutines will be incorporated in the subject program
by BANG to enable fue user to perform multiplication and/or
division.

Restrictions, Range:
A 14l:!l:Model B3 or C3 systeIn with 4000 core storage
positions. Direct multiply, .Cfivide and the high-low-equal compare features
(Continued on next column)

2. ) Problem Oriented Specifications: To broaden the scope of BANG
wifuout devisating from the concept of simple problem oriented

Method:"

~on

260

A 1401 Model B3 or C3 system with 4000 core storage

(Continued on next page)

B - 1401

specification!:: for solution of unit card olgcbraic cquations.
The object program generated by BANG requires no manual
insertions, modificatiOM or patching. This new package
includes oll the fWlctiOns of BANG 1,2,3 plus the subroutine
option.

IBM 1401 PROGRAM LIBRARY ABSTRACT

File Numbt'r 11.0.001

Solution of an Equation with Newton-Raphson's Method on the IBM 1401
Hans Johans son

~j

An optional. code has beef!. added to the specifications cards of
BANG. This code is the means of requesting BANG to include, within
the generated object program, closed multiplication and division subroutines
with all required entry and return linkage. If the users 1401 is equipped
with the Multiply - Divide feature, he can so s~cify and BANG will not
generate the subroutines.
Restrictions. Range: The subroutines incorporated by BANG in the object
program are nondimensional in iliat there is no limit to the size of the product
or quitient d.evelloped. Each subroutine is completely self-initializing
based on the parameters of the :factors involved. At the completion of
multiplication and/or division, the B-field contains the product, or quotient
and remainder positioned with assocated signs exacUy as though the
Multiply-Divide feature had been used.
Storage ReqUirements: 4, 000 positions of core are required to generate
object program with BANG. The generated and then assembled program
will require core capacity direcUy related to the complexity of the problem.

Direct Inquiries to:

Hans Johilnsson
IBM Sweden
Fack
Stockholm 3D, Sweden

Purpose/Description:
equation. 6i . . :;1.,
point arithmetic.

A demonstration program which solves the non-linear
(~+ ~/)=O with regard to X by use of floating

17

Mathematical Method: The Newton-Raphson's iterative method is used. All
arithmetic calculations are executed in floating point aritJunetic with six significant digits, The logarithm function is approximated with a iormula taken from
Hastings "Approximiltions for Digital Computers."
Restrictions/Range: N/A
Storage Requirements:

Equipment Specifications: Card 1401 with 4K corej Hi-La\'!- Equal compare;
read/punch feed: are required for BANG operations.
IBM 1401 PROGRAM LIBRARY ABSTRACT

Fi.le Number 10.3.001

1401 LESS  in addition to epacos
(7) U number to be printed is too largo or
too small the exponent of ten 18 IIpecified
CLEAR = CLE (000.)
Notce p.) Thls atatement reatores normal Fortran
format
(2) Any float point number in parenthesl.
will achieve 8ame reault.
IBM J620 PROGRAM LIBRARY ABSTRACT

File Number

1. 6.018

GOHOT (Generator Of Hermaphroditic Object Tapes) (Tape)
- Dick Conn~r
-

File Number 2.0.001

INTERPRETIVE PROGRAMMING SYSTEM (IPS) (Tape)

Lawrence C. Brown
Midwestern Regional Office
IBM Corporation
618 South Mtchigan Avenue
Chicago 5, Illinois

Purpose: IPS is an interpretive programming system for the 162,0. The oneaddress interpretive language includes the commands of the Intercom System ~­
widely used on 'the Bendix G-15.
Restrictions, Range:
The only subroutines supplied are aine-cosine, logarithm.
exponential, square root, arctangent, and fraction selection.
The single precision
system carries five significant digit floating point numbers. The double precision
system carries tv:..elve significant figures.
Method: Floating arithmetic is rounded, the trancendental subroutines are
Single precision subroutines are calculated by Hastings Approximations,
except for square root which is done by the "odd-number subtraction" method. The
double precision subroutines are done by Taylors series after suitable argument
reQuction. The double precision square root is done by "odd-numbered subtraction!!.

truncat~d.

Direct Inquiries to:

Frank Mozina
IBM Corporation
421 Seventh Avenue
Pittsburgh 19, Penneylvania

Storage_Requirements:
Source Language:

Purpose/Deecription: Gohot punches a program in self-loading, sel~-reproducing
form. This tape, and any of its descendants, loads itself or reproduces itself.
depending on the initial instruction entered at the typewriter. The program tape
produced by Gohot is 20-400/~ shorter and 20-400/0 faster than the same program in
SPS output form.
~N/A

Restrictions/Range: The program to be processed by Gohot mllat lie entirely
within cells 00401-19999 and rn.ust use decimal arithmetic. Record marks throughout the program do not constitute an obstacle to Gohot.

20.000 digit storage.

Written in 1620 absolute, revised version created in SPS language.

Remarks:
This is an independent system, which includes relocatable subroutines
bl.1.t, the program is non-relocatable.
Equipment Specifications: 16Z0 with 20R storage, paper tape I/O. Hardware divide
required for the double precision system, optional for single precision. No use is
made of indirect addressing, but it will not cause any conflict if installed.
IBM 16zo PROQRAM LIBRARY ABSTRACT

FUe Number 2. O. 002

lNTERPRETIVE PROGRAMMING SYSTEM (IPS) (Card)
Storage Requirements:

00000-00299 (tables are reatored at end)

Equipment Specificationa: Memory 20K. 40K, 60K, and no other special features
required.
Additional Remarks: Gohot waa written in actual and is not relocatable. Running
time depends on the length of the program to be processed. Programming hours
.25
IBM 1620 PROGRAM LIBRARY ABSTRACT

FUe Nwnbcr 1.6.019

FORTRAN Il DIAGNOSTICIAN ~CARD)
James Snec;Uker. Charles Snyder. &: Jack Burgeson

Direct Inquiries to:

Abstract data for this program is identical to data for program number 2.. O. 005
except that this program i8 for the IBM 162.0 card aystem.
IBM 1620 PROGRAM LIBRARY ABSTRACT

File Number

2, O. 003

An Interpretive System for Performing Operations with Complex Numbera (Tape)
W. D. Glauz and J. O. Hancock
School of Aeronautical & Engineering Sciences
Purdue University

Jack Burgeson
IBM Akron
(Continued on next column)

270

Lawrence C. Brown
Midwestern Regional Office
IBM Corporation
618 South Michigan Avenue
Chicago 5, Dlinoie

(Continued on next page)

B - 1620

Direct Inquiries to: W. D. Glauz
School of Aeronautical & Engineering Sciences
Purdue University
Lafayette, Indiana
92.-61435

Equipment SpecificationD: 1620 tape system
Additional Remarks: The Simulator program if! written in SPS, and occupieu
lower memory to location 09021.

Purpose /Description: The program performs various operations with complsx
numbero. It is written as an interpretive sYBtem which interpreto OP codea
80':99 and performa the indicated operation with floating point numbera,

IBM 1(,20 PROGRAM LIBRARY ADSTRACT

Mathematical Method: N/A
Reatrictiooll, Range:
point subroutines.

Those impoaed by accuracies of SPS two paBa floating

Storage Requirements! 402-4113 or 402-11262 including SPS Subroutinos.
description page lB.
Equipment Specifications:

Internal execution speed of aimulation ia approximately 3 l/l times alower than
a very well optimized 650 program. Simulator was debugged uaing the 650
C. E. Diagnoatic Program.

2. O. OOG

INTERPRETIVE ROUTINE FOR THE IBM 1620 (Tape)
Patricia Lussow

See

Tape 1620; 20K; no other opedal features required.

Additional Remarks: Program is w~itten to be compiled with SPS two paso
compiler and subroutineB. It useD floating point arithmetic and nwnbertl must
be entered in standard £0 t- floating paint notation. SYBtem uBed successfully
on approximately 10 programo to date. (7/25/61)'

IBM 1620 PROGRAM LIBRARY ABSTRACT

File Number

File Number 2. D. 004:

LME
Advanced Electronics Center
Ithaca, New York
Purpose/Description: The Floating Point Interpretive Routine has been designed
so that the IBM _ 1620 can'be operated without exhaustive knowledge of computer
programming and a minimwn of preparation. Routine include a arithmetic, logical
input_output instructiona, looping, built-in trace and a control routine for operatol
machine interaction.
Method:

IBM 650 Simulator Program (Card)
F. C. TOBcano

Patricia Lussow

Direct Inquiries to:

N/A

Restrictions/Range:

Nt A

Storage Requirements:

Entire 20,000 positiona of core

Equipment Specifications: Tape aYlltem, memory 20K and automatic divide,
other special features required.

Direct inquiries to: F. C. Toscano
IBM Corporation
525 South Flower Street
Los Angdes 17, California

No

Additional Remarke: Operating Procedures and Programming Instructions arc
designated in G. E. Technical Information series DF61ELCII and DF61ELC7Z.

PurpmlC/Dellcription: Simulation of the IBM 650 on the IBM 16l0. It allows
execution of 650 language programs in a 1620 without reprogramming.
~N/A

IBM 1620 PROGRAM LIDRARY ABSTRACT

File Number 3. O. 001

VARIABLE FIELD SQUARE ROOT SUBROUTINE (Card)
W. H. Jefferys

Restrictions/Range: The Simulator asswnes an 80180 numeric card input/output, with eight· la-digit words per card. The uaer can modify the Simulator to
include simple control panel functions and alphabetic, if desired.
Storage Requirements:

Direct Inquideu to: W. H. Jefferys
Van Vleck Observatory
Wesleyan University
Middletown, Conn.

N/A

Equipment Specifications:
To Simulate:

Requires:

:WOO word basic 650
4000 wore basic 650
1000 word basic 650

40, 000 digit 1620 with divide
60, 000 digit 1620 .with divide
20, oao digit 1610 wi.th divide

Purpose/Description: To take the square root of any number, given an arbitrary
number of digits. The resulting square root haB a6 many digits as the nwnber
input to the subroutine.
Mathematical Method:

Odd-Number Subtraction Method.

The Simulator assumes a card I/O 1620 and a card I/O 650. SiTnple modinca~
tiona are given in the writeup to simulate 650 card I/O by meana of the 1620
paper tape and/or typewriter I/O.

Restrictions, Range: X. the number wholle aquare root is to be taken, must be
gresc!'l.

Card 1620.

Equipment Specifications:
Direct Inquiries to: Burr Preston
IBM Corporation
520 N. Dearborn Street
Chicago 10, Illinoill
WHitehall 4-1364

20K.

The Jordan method of elitnination is used.

Storage Requirements: The entire core for 26 equa.tions.
Equipment Specifications: Memory 20K, Card Input-Output and no other spedal
features required.
Additional Remarks: The program is written in Fortran. All computation is done
in standard Fortran single precision floating point arithmetic. Read and compute
time for three equations is five seconds. Typing of the answer takes an additional
seven seconds. Read and compute time for eight equations is 25 seconds with
typing the answer requiring an additional 19 seconds. A test for zero divisor is
included. A typewriter message indicates when a pivotal element is smaller in
absolute value than a vlaue selected by the operator. At this point the solution may
be continued or the next problem read in.

File Number

(Card)

Direct lnquiriell to: D. N. Leellon
425 Park Avenue
New York City, New York
PL 1-6060
Purpose/Description: This program performs a complete linear or non linear
regression analysifl for the card 1620 system. A plotback program io alBo included, Output of all phases ifl on cards for flubsequent listing. A typewritten
output is alBa available.
Mathematical Method: Gaussian Least Square Technique
Restrictions /Range: No more than 23 variablefl total may be proceBsed.
linearity case y ax+b may not bc performed.

The

Storage Requirements: 20K for maximum program.
Equipment Speci'fications:

Memory 20K.

No other special feature II required.

Additional Remarks: Language _ SPS for all parts.
Nonrelocatablc.
IBM 16Z0 PROGRAM LIBRARY ABSTRACT

Floating point arithmetic.

File Number

6. O. 004

6. O. 001
(Stepwise Regression Analysis Program) (Tape)
L. S. Holmes & A. R. Colville

REGRESSION ANALYSIS PROGRAM (tape)

Direct Inquiries to:

D. N. Leeson
IBM
Eastern Regional Office
425 Park Avenue
New York, New York

Purpose:
This program per£ormfl a compiete regression analYflLs on a maximum
of 24 variables.
Restrictions, Range:

File Number 6. O. 003

SCRAP (Sixteen-twenty Card Regresflion Analyflia Program)
D. N. Leeson
-

Refltrictions/Range: A maximwn of 26 equa.tions in 26 unknowns may bc solved.
A maximum of eight significant digita per matrix element is allowed.

IBM I(,20 PROGRAM LIBRARY ABSTRACT

Core-Dlvide not required.

lDM 1620 PROGRAM LIBRARY ABSTRACT

Purpose/Description: This program solves Iiet!) of nonhomogeneous SUnultaneaus
linear equations and provides either printed or pllnched output with heading. It
is deuigned for case of U.!le. Operating inlitructiona and error nu:\sBagtHI arc automatically typed. Data value a are entered in free form not~\tion au a group of diGita
with a decitnal point. An optional power of ten may be added to each value.
Method:

0

L. S. Holmes
A. R. Colville
IBM Corporation
Beaumont, Texal.l

Purpose/Description: STRAP is a mUltiple stepwise regression analyais program containing provisionfl for transforming input variables. It is useful in
determining the relationships betwel!n the independent and dependent variables
of a sct of observations by an equation of the form:

All arithmetic is done in 10 digit excess 50 floating poInt.

Method: All mathematical models are linearized, uaing a IiIpedal technique.
The Gaussian lea at squares technique is appHed.
Storage Requirementfl: The program with a maximum number of varLables (24)
occupiea all of core for a 20, 000 position 1620. Speed cannot be determined due
to the many configurations of the problems. The program is not relocatable.
Remarks: This program will fit nonllnear functlons and surfaces. Data may be
pretranflformed by anyone of 21 available transformatlons. The syfltem is in 2
paflses. Pass 1 prepares data as Input to Pass 2.
Equipment Specifications:

Tape 16zo.

20K Core-Divide not required.

IBM 1620 PROGRAM LIBRARY ABSTRACT

File Number

Where Y is the depl!ndent va.riable, Xi are the independent variables, and ai
are the coefficients to be dete rmined.
Mathematical Method:

Storage Rl!qTirements:

N fA

20,000 positions

Equipment Specifications: Basic 1620, paper tape input & output.
Additional Rl!marks; Floating Decimal manipulationfl, Problem size 39
independent variables, "any 1 of 10 dependent variablefl.

6. O. 002
IBM 1620 PROGH.AM LWH.ARY ABSTRACT

File Numher

6. o. 005

FREQUALIZER (Tape)

REGRESSION ANALYSIS PROGRAM (card)

Rob!.lrt Axelrod
D. N. Leeson
IBM
Eastern Regional OHice
425 Park Avenue
New York, New York

Direct Inquiries to:

(Continued on next column)

Paul Sanders
Statistical Service:;
Abbott Laboratori",:;
North Chicago, Illinois
(Continued

Oil

next page)

273

Purpose/Detlcription: This program analyzes the frequencies preacnt in a time
series by means of power ,f;pectra.

IBM 1620 PRUGRAM LIBRARY ABSTRACT

Method:

COMPLEX

Fourier transforln of auto-covariance function.

Restrictions/Range:

FORT~AN

Maximum of 200 lags, any number of data points.

File Number

6. O. 008

FOR THE 1620 (Tape)
Frank H. Maskiell

Storage Requirements: 20. 000 digits
Equipment Specifications:
Additional Remark~:

Memory 20K, and no other special features required.

Running time:

(MN

10M 2 ) /2000 minutes

N da ta points
M lags in auto-covariance function

Purpose/Description: Th", Fortran processor and subroutine tapes have been
revised to utiliz;e certain variables as cornplex nurnbera. This permits the
addition, subtraction,multiplication or division of two or more complex variablea
by the simple instruction D. A op (B op C) ---.

Language: Fortran (Tape)

IBM 1620 PROGRAM LIBRARY ABSTRACT

Direct Inquiries to: Frank H. Maskiell
The Pennsylvania Transformer Division
McGraw-Edison Company
Box 330
Canonsburg, Pennsylvania

File Number

6. O. 006

STEPWISE MULTIPLE LINEAR REGRESSION (Tape)
R. Bukacek & W. Galle

Method: The complex nWllbers are treated in rectangular component forIn and the
~tic Operations accornplished by means of Fortran class A subroutines.
Restrictions /Range:
nwnber.

The cOITlplex variable is accepted only as a floating point

Storage Requirernents: 8600 positions are required for the subroutine package
at the time of object running.
Direct Inquiries to;

W. J. Galle
Armour & Company
Operations Research
401 N. Wabash
Chi.cago, Illinois

Purpose/Description: Accepts sets of observations and forIns linear regressions
in a stepwise fashion subject to atatistical criterion (F-Test).
~

Stepwise linear regression

Restrictions/Range; Maximum number of independent variables" 18, l::!:Nind
..... 18: Maxirnunl uurnber of dependent variable Ii on input tape .. 25 _ Nind, IS NOep
~25 - Nind. Maximum number of independent variable~ which can be Apriori
Suppressed from consideration in stepwise process = 15
o!S ~:='15
Storage Requirements:

20K

Equipment Specifications:
required.

Tape 1620, memory lOK.

Equipment Specifications:

Memory lOK, and paper tape.

No other special features

Additional Remarks: Restrictions above apply to 20K basic tape machine.
attached writeup for complete description and notes.

IBM 1620 PROGRAM LIBRARY ABSTRACT

File Number

See

6.0.007

IBM 1620 PROGRAM LIBRARY ABSTRACT

CORRELATING PROGRAM - UP TO 30 VARIABLES (Card)
Jack BUrgeson

Direct Inquiries to: Jack BUrgeson
IBM Corporation
340 S. Broadway
Akron 8, Ohio
Purpose/Description: Given M observations on N variables, the simple correlation coefficients of each variable with every other variable are found and printed.
Method:

N/A

Restrictions/Range: M unlimited.
contain record marks in cc7l.
Storage Requiretnents:

Stepwise Multiple Linear Regression Analysis for the IBM 1620 (Card)
D. G. Wyman

File Numher 6. O. 009

N less than or equal to 30.

Uses all storage

Equlprnent Specifications: Basic card 1620
Additional Remarks: The language is Fortran variant - has
put and special point format.

Direct Inquiries to:

BOIne

alphabetic out-

D. G. Wyman
Compiled on tape 1620 and converted through 047 to card 16.20. A one rJigit change
made in the Fortran input subroutine to read from cards instead of tape, henoe.
requirement for record Inark in c072 ·of data cards.

IBM Corporation
401 Grand Avenue
Oakland, California
Purpose /Description: The 1620 Stepwise Regression AnalysiB Program. has been
coded in SPS as a series of independent subroutines. Each can be assembled 10,dependently as long as the data areaa are consistent. This should allow easy modification. With efficient utiliz;ation of storage, a problern of 35 variables can be
run on a basic 1620. Analysis of variance is combined with Multiple RegreSSion
Analysis to control the selection of terrna for an equation.

IBM 1620 PROGRAM LIBRARY ABSTHACT

ANALYSIS OF VARIANCE

Restrictions/Range: Single preciaion floating point has been used thJ;"'oughout.
42 variables ia maximum for Phase I, 1. e., simple correlation matrix. 35 variables can be run in Phase II. the Stepwise solutlon. Any of 13 transformations can
be used up to 70 per observation. Data input format must be defined by a header
card.
Storage Requirements:

20, 000 positions

Equipment Specifications: Memory 20K.

No other special features required.

Additional Remarks: The program has been coded in SPS using SPS floating point
subroutines for all of the rnathematics. Programs are compiled independently and
run by loading and executing the routines in sequence. OperaUon is continuoua.
About 1050 instructions are uaed with an addltlonal 340 for a report generator not
including SPS (]ubroutines. Two of the eight routines use rnost of 20K memory.

Direct Inquirics to:

6. O. 010

(C.:I.ro)

Louis J. Grc.natu
IBM Corporal ion
631 Cooper Sh·ed
Carndcn, N. J.

Purpose/DeBcription: Reduce tilt· total variation in a set of data to cOITlponents
associatcd with possible sourcer. of variability whose relative irnportance we
wi8h to assess.
Mathematical Method: Sums of Squares
Restrictions, Rangc:
(8)levels per fa<:!or.
Storage Requin:rnents:

The program is being used consistently by two card 1620 installationa in the Oakland area. Cards or paper tape may be used as input/output.

File Nllm\)('1

Louis J. Granato

Method: By M. A. Efroynlsen, Mathematical Methods for Digital Cornputers,
Chapt. 17, ed. A. Ralston and H. Wilf

274

Data cards must

MdXllllUlJUI of eight (8) factors, with not lTlorc than eight
Total data (".annot exceed 12,935 digits.

N/A

Equipment Speci1ications:

Baoie lolO with card I/O

B - 1620

liJM J(,20 PROGRAM LIBRARY AUSTItACT

POLYNOMIAL CURVE FITTING

File NumlH"1'

7. O. 001

Equipment Specifications: Minimum lillO, 20K, no opecial features.
Addition31 Remarkll: Language SPSj Totally relocatable. This program alao
containD a Ilmall 13 inntructton teat program at the UBerD discretion.

(Tape)

ll3M 1620 PROGRAM Lll3RARY Aj3STRACT

W. R. Graves
IRM
2640 Canal Street
New Orleans 19, Louisiana

File Number

7. O. 004

POLYNOMIAL CURVE FIT (Tape)
Dale Anderson

Purpose:
Thi.s program generates an approximating polynorrlial by the least
squares technique. The equation so derived contains as many terms as necessary
to bring the standard error of the dependent variable within a range specified by
the user, or to fit a 15th order polynomial.
Printing of intermediate coefficlents and the printing of a tabulation of observed
vs calculated values of the dependent variable arc under the control of program
switches as is the inclusion of weighting factorB.

Direct Inquiries to:

Dale Anderson
IBM Corporation
340 S. Broadway
Akron 8, Ohio

The calculations utilize floating arithmetic with an 8 digit mantissa.

Purpo!le/Descdption: This program fits an nth degree polynomial to m aets of
weighted or unwcighted data points (x, V). Provieion is made for processing the
same set of (x, y) points through polynomials of increasing degree n. A complete
cvaluation i~ made of each fit and etatisticB indicating "goodncus of !itl! typed out.

Restrictions, Range:

Method:

Not given.

Method:
A modified Gaussian elimination technique is used to solve the resulting
sel of simultaneous equations. Experimental data are recorded in standard 1620
FORTRAN format.

Least squares solution of simultaneous

Storage Requirementu:
Storage Requirements:
Hemilrks:

equations.

Restrictions/Range: n lells than or equal to the aroaller of (13. M-ll.
than or equal to I QQ.

:rn le86

N/A

Not given.
Equipment Specifications: Basic paper tape 1620. Becautlc of the coding language
uscd, it can eaHily be converted to card 16zo _ with I/O modifications to any hardware accepting Fortran coding.

This program uses FORTRAN language.

Equipment Specifications:
IBM 1620, lOK core, paper tape reader, paper tape
punch. Will run on any 1620 for which FORTRAN is written.

IBM 1620 PROGRAM LIBRARY ABSTRACT

POLYNOMIAL CURVE FITTING

File Number 7.0.002.

(Card)
W. R. Graves

Additional Remarks:

The language is Fortran (approximately 140 atatementu).

IBM 1620 PROGRAM LIBRARY ABSTRACT

File Number 9. l. 001

1620 SUBDIVISION PROGRAM(Tapel

H. W. Van Ness
C. E. Berry
K. J. Love

Direct Inquiries to: W. R. Graves
IBM
2640 Canal Street
New Orleans 19, Louisiana

IBM
1212 S. W. 6th Avenue
Portland 4, Oregon

Purp08e/Description: This program generates an approximating polynomial by
the least squareB technique. The equation so derived contains a8 many termll no
necessary to bring the standard error of the dependent ... ariable within a range
specified by the user, or to fit a 15th· order polynomial.
Printing of intermediate coefficientfl and the printing of a tabulation of observed
V8 calculated values of the dependent variable are under the control of program
switches as is the inclusion of weighting factors.
The calculations utilize floating arithmetic with an 8 digit mantiBsa.

Purpose:
Compute necessary data for the subdivision of land into smaller
parcels. The program starts with a closed boundry tra",:erse and proceeds
to compute all necessary curves and tangents. The design engineer then
!lI.lbmits data for lot computations and receives complete information for staking
and plotting the subdivision. Lot characteristics are checked against zoning
requirements. Output includes co-ordinates of points; length and bearing of
line:;; length and radius of arCSj and area, depth, and width of lots.
Restrictions, Range:
tiITle.

Up to 250 points and 25 curves may be processed at one

Mathematical Method: A modified Gaussian eUm.ination technique is used to
solve the resulting set of siITlultaneous equations. Experimental data are recorded
in standard 1620 FORTRAN format.

Method:

Restrictions IRange:

Storage RequireITlents: Four program passes are required -- utilizing all of
the 20, 000 positions except in Pass I and the co-ordinate type out.

Not given

Storage Requirements: Not given

Docs not apply.

Equipment Specifications: Minimum 1620.
tape input-output.

EqUipment Specifications: IBM 1620, 20K core, 1622 card read-punch.
on any 1620 for which FORTRAN itl written.

20, 000 positions of core and paper-

Will run
IBM ](,20 PROGRAM LIBRARY ABSTRACT

Additional Remarks:

File Number

9.2. 002

This program uses FORTRAN language.
CUT AND FILL (Tape)

IBM 1620 PROGRAM LIBRARY ABSTRACT

File Number 7. O. 003
Ben A. Shaw
IBM
690 N. Robert Street
St. Paull, Minnesota

1620 Fix Point Square Root (Card)
W. S. Sekscienski

Purpose: Compute grades, apply typical sections, compute slope interests,
Direct Inquiries to:

W. S. Seksdenski, Project Engineer
UniverBity of Maryland
College Park, Maryland

Purpose/Deacription; To extract the square root of a 9 digit fixed point nwnber.
Mathematical Method: N/A
Restri.ctions/Range:

~nd volumes when given P. V.l. Stations, Elevations, and Lengths of

Vertical Curves, Typical Sections and where they are to be used, Shrinkage
Factors, and Preliminary Terrain Cross Sections.
Restrictions, Range: This
transitions. It is limited to
Sections, and ten P. V. l's.
elevations are to tenths of a

program does not COITlpute horizontal curve
30 Terrain Points/ Cross Section, Ten Typical
The horizontal distances are to even feet, and the
foot.

Argument mUHt be 9 digits in length.
Method:

Does not apply.

Storage Req11irements: N/A
(Continued on next column)

(Continued on next page)

275

Storage Requirements:
Sourc e Language:
~

ZO,OOO digits.

IBM 16Z0 PROGRAM LIBRARY ABSTRACT

File Number 9. Z. 006

Machine language.

Speed: 13 to 30 seconds/craBs section, depending on output.

Equipment Specifications:

16Z0 TRAVERSE ANALYSIS

PROGRA~

("t:ard)
D. T. Mitchell

16Z0/16ZI.

IBM 1620 PROGRAM LIBRARY ABSTRACT

File Number 9.2.003

CUT AND FILL (Card)
ltay Peck

Direct Inquiries to: D. T. Mitchell
IBM Corporation
Midwestern Regional Ofiice
618 South Michigan
Chicago 5, illinois
Purpose/Description: This program will solve traverso problems requiring
balancing of misclosure or solution for unknown azimuths and/or distances. No
provision is made to handle othor than straight-line courses. Areas of traverses
can be calculated (u80r's option). All possible 80lutiona for problems are presented in the output.

Ray Peck
IBM~San Francisco
'340 Market Street
San Franciscoll, California

~

Abstract data for thia program is identical to data for program number 9. Z. 002
except that this program iB for the IBM 162.0 card system.

Standard methods ouUined in writeup. All output is via the typewriter.

Restrictions/Range: All sines and cosines are calculated within ZxlO-8 insuring
3~decimal place accuracy in latitudes and departures.
Storage Requirements:

IBM 1620 PROGRAM LIBRARY ABSTRACT

FUe Number

20K Core is required.

9. Z. 004
Equipment SpecU'ications: Basic 16z0 without any features;
Additional Remarks:

WATERWAY COMPUTATIONS (TAPE)
C. E; Carlson and J. F. Feeney

The 80urce languago is zn.achine.

IBM 1620 PROGRAM LIBRARY ABSTRACT
Direct Inquiries to:

Charles E. Carlson
Bridge Section
Wis. Highway Commission
Madison, Wisconsin
ALpine 6-4411, Ext. 471

Mathematical Method:

Maiming's formula.

RestrIctions, Range:

A maximum of 25 water elevations.
See sheet.

Equipment Specificatlons: 1620 Tape System; Memory lOKi No Special Features
Required.
Additional Remarks:

Direct [pquiries to: D. I". Mitch.:!l
IBM Corporathm
Midwestern Regional Office
618 South Michigan
Chicago 5, lUin!)is
Purpose/Description: This program will solve traverse problems requiring
balancing of misclosure or solution for unknown azimuths and/or distances. No
provision is made to handle other than straight~line courses. Areas of traversoa
can be calculated (user's opUon). All possible solutions for problems are prosented in the output.
~

EasIly converted to Card System.

Standard methods (lutlined in writeup.

All output is via the typewriter.

Restrictions/Range: All IiU• .;S and cUliiu~s are calculated within
3~decimal place accuracy in latitudes and departureJi.
IBM 16zo PROGRAM LIBRARY ABSTRACT

9. Z. 007

1610 TRAVERSE ANALYSIS PROGRAM (Tape)
D. T. Mitchdl

Purpose/Description: The purpose of this program is to compute the velocity,.
area, and flow for an individual channel in a flow system and the average velocity,
area, and flow for the enUre network.

Storage Requirements:

File Number

File NUl11ber 9. Z. 005

Storage Requirements:

ZxlO~8

in8uring

lOK Core is required.

Equipment Specifications: Basic 1620 without any featuresj paper tape reader.
SKEWED BRIDGE ELEVATIONS (TAPE)
J. F. Gibbons and C. E. Carlson

Additional Remarks:

The source language is l118.chlne.

IBM 1620 PROGRAM LIBRARY ABSTRACT
Direct Inquiries to:

C. E. Carlson
Bridge Sectlon
Wis. Highway Commission
Madison, WIsconsLn
ALpine 6~4411. Ext. 471

Purpose/Description: The progral11 computes slab elevations and geometry
{or bridge superstl'llctures with skewed substrllcture units on a vertical curve wlth
straight horizontal allgnment. Horizontal and vertical geometry is found at the
intersection of a chosen series of offset lines with a skewed line. These skewed
linea may be at specU[c stations, at quarter paints of spans, or at constantly
incremented stations.
Mathematical Method:

Not applicable.

Restrlctlons, Range:

A maximum of {[fty beams or offsets.

Storage Requirements:

lOR

Equipznent Specifications: 16zo Tape System; Memory lOK; No Other Special
Features Required.

File NUl11ber

9.3.001

GAS NETWORK ANALYSIS (Tape)

R. E. Edsall
IBM
5930 Hohman Avenue
Hammond, Indiana

Purpose: The analysis of a ga8 distribution network is necesiJary when a gas
utility is considering the moditicatlon and/or expansion of a gas system or when
an increased load on the system 1s contemplated. With the use of tbh program,
such an analysis can be made for as many as 750 pipes 1n a low and/or mediul11
pressure system.
Restricttons, Range: The program will handle a gas network of approximately
750.pipe sectlons and 250 loops. The program requires an assumed flow rate
and frictlon factor 'for each plpe sectlon as input, The flow and friction can be in
any units provided the units chosen remain constant for a given network. Rather
than frictIon, a user may specify a diameter and length of pipe section. The
accuracy de.pends upon the tolerance factor within the program which may be cha.nged
by the user.

Additlonal Remarks: Input to the computer may be eLther paper tape or typewrlter.
Geometry for flared bridges may be" obtained by the. manipulation of Input data.
ProvisioD""... are made for up to 50 offsets divided into 1 to 5 groups.
~: .3 sec/loop/Ueratlon exclusive of input and output.
Program language - FORTRAN
Run successfully about 100 times to date - August ZZ, 1961.
~ Modified Hardy Cross Method.
The program is easily converted to a Card System.

(Continued on next page)

276

B - 1620
16~O

PROGRAM LIBRARY ABSTRACT

Storage Requirements: The maximum network requires 20,000 positions of
storage. Smaller networks leave upper core avaUable.

IBM

Remarks:
This program 1s an independent and is relocatable by changing "DORGII
otatements of SPS.

M .. 100 MOMENT OF IN~RTIA AND CENTROID CALCULATIONS
G. J. Reed

Equipment SpecificaUons: BasIc paper tape system with 20,000 posltlons of core.
Two versions of program are avaUable~-one for divide hardware and one using the
divide subroutine.
Source Language:

SPS.

IBM 1620 PROGRAM LIBRARY ABSTRACT

File Number

9.3. 00l.

MULTICOMPONENT DISTILLATION TOWER
DESIGN CALCULATIONS (Tape)

Direct Inquiries to: ROo C. Wenrick
AFC Indulltries Inc.
p. O. Box 1666
Albuquerque, New Mexico
Purpooc/Dcscription: This program is ulled to compute the Momenta of Inertia,
area, and Centroid of a complicated two dimensional body. The system is divided
into a grid lIystem with grid spacing and formula nwnber for each rectangle entered
all input.

Restrictions/Range:

The code will handle up to a maximUIIl of 65x and 65y spaceD.

Storage Requirementa:

19,534 core locations.

Equipment Specifications: Memory ZOK, and no other special features required.

Purpose:
To estimate the diotlllation tower requirements for a given separation, feed r ...te and thermal condition; and set of relative volatliltiea.

Method:

(Tape)

~ N/A

Ray N. Sauer
IBM
2601 South Main Street
Houston 2, Texas

Restrictions, Range:

File Nwnber- 9.3. 005

Additional Remarks: Language- is SPS. The running time is dependent on the
number of grid spac.es required to define the body. The time may be approximated
by T (.19) NBC 38 seconds. NBC is the number of divillions in the grid system.

=

IBM 16zo PROGRAM LIBRARY ABSTRACT

30 components.

File Number

9.4.001

Short cut methoda of Feuske, Underwood, and Gililiand.

Storage Requirements:

FORTRAN program with SPS patcher that fitH within 20K.

Equirment Speci£lcatlons:

1620 wlth paper tape and 2.0K memory.

IBM 1620 PROGRAM LIBRARY ABSTRACT

File Number 9. 3. 003

ELECTRIC LOAD FLOW PROGRAM

(Tape)

Frank Mozina
Systems Engineer
IBM Corp.
421 7th Avenue
Pittsburgh 19, Pa.

GAS NETWORK ANALYSIS (Card)

Purpose: The program is designed to calculate voltages and power £lows in a
system of a maximum si.ze of (50 buses and 240 lines, and allow changes to be
made to the base system and be rerun.

Direct Inquiries to: IBM Public Utility Department
Midwestern Region
618 South Michigan Avenue
Chica.go 5, illinois

Restrictions, Ra~ All calculations arc donc in a fixed paint.
a) Net load or generation at any bus must be less than 10,000 Megawatts
and Megavars.
b)

Purpose/Description: With the use of thia program. an analysis can be made for
as many all 750 pipell in a lpw and/or mediwn pressure system with consideration
given to modification fUld/or expansion.

c) The sum of 6quarCl> of G and n cOlllponents of self admittance of any
bus rrlUat be less than I, ODD, 000. 000 per unit.
d) The accuracy of the results may be predetermined by the operator
by specifyin~ tir;htcr tolerance in the i.terative solution.

RtHJtr:\'otions/Range: See purpose
Storage Requiremento:

ZO, 000 core locatioIlIl

Equipment SpecUicationll:

Speed:

Average time per iteration:
Time in mille seconds :: 600.7 x No. (Jf buses -!-112. B x No. of lines
-I- 511.. 2. x No. of Generator Buses

16zz with Autodivide

Method:
IBM J6Z0 PROGRAM LIBRARY ABSTRACT

The self impedance of any bus must have both R andX components of
less than 1. 00000 per unit.

File Numher 9.3.004

M-IOO MOMENT OF INERTIA AND CENTROID CALCULATIONS
G. J. Reed

Solution is obtained by the Gauss-S"\,ld iteration method,

Storage Requirements:
down into 5 pasHes,

Full lOI< memory is H'q!lired, with the program broken

(Card)
Source Langtlag": SPS 2 PASS.
Remarks: Thi,; is an Independent Prograrn and
but is not relocatable unless reassembled.

Direct Inquiries to:

R~'

C_ Wcnr.i.ck
AFC Industries Inc.
p. O. Dox 1666
Albuquerque, New Mexico

Purpolle/Oescription: This program is used to comput~ the Moments of Inertia,
area, and Centroid of a complicated two dimensional body. The system is divided
into a grid system with grid IIpacing and formula number for each rectangle ent'ered
as input.
~

N/A

Restrictions/Range:
Storage Requirements:

The code will handle up to a maximum of 65x and 65y spaces.

Equipment Specifications:

it!

assembled into fixed iocations

Basic 162.0, 20K p'lJwr tape system.

IBM 1620 PROGRAM LIBRARY ABSTRACT

File Number

9.4.00Z

LOCATION OF SHUNT CAPACITORS ON RADIAI~ LINES (Tape)

L. S. Ranki.ne, R. F. Steinhart
IBM
4Z5 Park Avenue
New York, New York

19,534 core locations.

Equipment Specifications: Mcmory ZOK, and no other special feature Ii required.
Additional Remarks: Language is SPS. The running time is dependent on the
number of grid spaces requircd to define the body. The time may be approximated
by T =(.19) NBC 38 secondJ>. NBC is the number of divisions in the grid system.

Purpose: This program may be used by electric utlllties engineers to compute
optimum locations for shunt capacitor banks [n r.ldlal distribution systems 90
as to minimize loaaes and to improve voltage. Il ma.y also be used to demonstrate
one of the many ways in which digital computer" Illay be used by utilities engineers.
(Continued on next page)

277

Method: This program is based upon the methods presented in the following
Electrical World Articles, by L. J. Rankine.
Date
Title
""'O"ctOber 3, 1955
Place Shunt Capacitors to Save Line Losses
December 2, 1957
Two-thirds Rule Used for Capacitors KVAR
September 26, 1960
Method of Locating Shunt Capacitors Suitable
for Computer SaluHons.

Restrictions, Range:

12,000 locations arc used.

Equipment Specifications:

File Number

SHORT CIRCUIT ANALYSIS (Card)
George S. Haralampu

Basic 1620 - Tape input/output.

IBM 1620 PROGRAM LIBRARY ABSTRACT
ELECTRIC LOAD FLOW PROGRAM

File Number 9.4.003

(Card)

Purpose/Description: This program is to be ueed for the determination of
current distribution conatants, hus voltages, and xII' ratios under faulted conditione. This program is a one pa88 program, and complex network impedances
are used.
Mathematical Method: Gauss-Seidel iterative method

33 buses and 58 lines

Restrictions, Range:
Frank Mozina
Systems Engineer
IBM Corporation
421 7th Avenue
Pittsburgh 19, Pennllylvania

Storage Requirements:

ZO, 000 digits

Equipment Specifications: Computer, IBM 16Z0, ZO K core, 16Z0 Card Reader
and Punch.

Abstract data for this progra,m is identical to data for program number 9.4.001
except that this program is for the IBM 16z0 card system.

Additional Remarks: . The speed is approximately 1.5 seconds per bua per
iteration. Negative impedances, such as those obtained in mutual equivalents.
should be avoided.
IBM 1620 PROGRAM LIBRARY ABSTRACT

Short Circuit Calculations (Card)
G. S. Harachusetts

R. C. Wenrick
ACF Industries
p. O. Dox 1666
Albuquerque, New Mexico
C1I7-0J61, Ext. 511

Purpose/Description: To reduce data as recorded for rectangular otrain gage
r06ettcs by the Gilmore, Band K or liimBar recorders.
Method:

Direct Inquiries to:

File Numbcr9.6.00Z

N/A

Restrictions/Range:
the system.
Stora~e

100 Channels of data may be reduccd with one pauB through

Rcquirements:

About IB, 000

Purpose/Description: This program IS designed to find the best fitting average
life within each generalized empirical curve tried for a plant account (cl. Method,
of Estimating Utility Plant Life, Ediuon Electric Institute, 195Z).

Equipment Specificatiolls: Memory ZOK, Automatic Divide, and no other special
fcaturc:;l required.

The best of all fitll derived for a sedell of curves (ouch as the Iowa curveu) is
selected by visually examining the output data for the least SUIll of squared differenccs between the book balance/) and the balance!! simulated fo~ the beat ilt livell.

Additional Remarks: The language is SPS. Although Indirect addreaoing and
autornatic diviuc fcaturel) arc used, very few corrections are required to enable
a basic machine to prOCess the data. The program bas been used for reduction
of more than 10,000 rosettes. The input has been prepared to a. Rreat extent by
the tape punching facilities of the Gilmore.

Method:

A. Formula Terms:
LU .. longer life as:;lumed
LL :: shorter life assumed
LC • best fit life as calculated
BO = book balances
BU = balanccs silnulated for LU
BL " balances simulated for LL
BC = balance II lIimulated for LC

Note:

IBM 1620 PROGRAM LIBRARY ABSTRACT

Distribution of Water Flow in a Pipe Network
C. Bartholet

Result accepted only when

Direct Inquiries to:

(Tape)

C. Bartholet
IBM Corporation
Boston, Massachusetts

Purpose/ Description:
This program balances the flow of water in a pipe network starting with assumed flows and produces the corrected system flows.

Restrictions/Range: N/A
StoraHtJ Hequircments:

File Number 9.7.001

9.950 - program and fixed point divide routine.
Mathematical Method:

Equipment Specifications: IBM 16z0 COlllputer with a 2.0K memory card and a
162.2 Card Reader-Punch
Additional Remarks: The 6pet>d dependtl 011 accuracy of starting assumption given
progrilZn. The best fit for onc curve il> nOllcthclc1l6 produced within a few second!!
at 11101lt.

IBM 1620 PROGRAM LIBRARY ABSTRACT

File Number 9.6.001

Restrictions, Range:

Hardy Cross
Maximum of 150 pipes and 67 loops

Storage Requirements:

Entire 20K memory

Equipment Specifications; As submitted to the program library, the basic paper
tape 16zo is required. The FOR TRAN source program in the docwnentation may be
compiled for any configuration.
Additional Remarks: Program based on IBM 650 Program 9.7. OOZ entitled
"Hydraulic Network Analysis," The speed is approximately one second per pipe
per iteration.

STRAIN GAGE DATA REDUCTION ON THE IBM 16Z0 (Card)
R. C. Wenrick

IBM 1620 PROGRAM LIBRARY ABSTRACT
Direct Inquiries to: R. C. Wenrick
ACF Industries
P. O. Box 1666
Albuquerque, New Mexico
CH 7-0361, Ext. 511
Purpose/Description: To :reduce data as recorded for rectangular strain gage
rosettes by the Gilmore, Band K or similar recorders.
Method: N/A
Restrictions/Range:
the system.
Storage Requirements:

100 Channels of data may be reduced with one pass through

File Number 9.7. OOZ

GENERALIZED PLOTTER II (Cards)
Jack Burgeson

Direct Inquiries to: Jack Burgeson _ IBM
340 S. Broadway
Akron 8, Ohio
Purpose/Description: Given up to 180 ~ of Y values equally spaced along the
X axis, this program scales them to the range 0-50 and plots them on the 16z0
typewriter. Baseline indication is plotted also.

About 18,000
~

Equipment Specifications: Memory ZOK, Automatic Divide, and no other special
features required.
Additional Remarks: The language is SPS. Although Indirect addres sing and
automatic divide features are used, very few corrections are required to enable
a basic machine to process the data. The program has been used for reduction
of more than 10, 000 rosettes. The input has been prepared to a. great extent by
the tape punching facilities of the Gilmore.

Not applicable

Restrictions/Range: Up to 180 ~of Y values
Storage Requirements:

All of storage is used

Equipment Specifications:
Additional Remarks:

Basic card 16zo

The language ia Gotran

279

IBM 1620 PROGRAM LIBRARY ABSTRACT

File Number 9.7.003

GENERALIZED PLOTTER (Cards)
Jack BUrgeson

Not applicable

Purpose: A generalized code for the solution of llnear programming problema.
Allows variable format input; output gives complete detans of results. Optional
routines allow previously solved problems to' accept changed cost and/or requIrement
coeffk:ients with subsequent re-solution.
Restrictions, Range:
The basic 16Z0 with paper-tape reader is required. Program
runs on any available core size, with the matrix size being limited according to the
expression.

Up to 400 points

(M'1- 2) (N" 3}.E(Mem o

Storage Requirements: Uses al1 storage
Where

Equipment Specifications: Uses basic card 1620
Additional R S,. .. 18 the routine will branch to the C::"I'or exit.

On number of decimal places required in accs. 1, 2.
The subroutine will cater for positive or negative numbers of
decimal places, therefore any mod1i1ed characteristic can be
converted.
Floating point number is avallable at C<1IVI at the completion of
the routine.

One reel of magneti.c
tape required for 7070
Program deck and HsUng.

Fli/n,.
2.4.003
Avallable prior to January 1~62

IBM 7,0,70 L!hrary Program Ab.tract.
7070 - Subroutine for IBM 7070
Roll$ Royce, Ltd.
P. O. Box 31
Derby, England

Purpose: To convert fixed point numbers to floating point numbers.

Usage:
Capabllities and Llmi.tations: There are certain requi.rements that must
be considered in processing networks with the ZPA System. First. the
programs were designed to process 'activity oriented' networks. Although
'event oriented' networks can be processed. some confusion could result
in the interpretation of the program outputs. Second, the programs
have been written to analyze networks'wlth a maximum of 1.500 activities.
Thlrd, random numbering of network activities Is not permissible.
Events must be numbered sequentially in ascending order. The successor
event number of an activity must be higher than Its predecessor.
Consideration of the se requirements Is important when preparing the
basic network drawings.

68 - Modified eharacterisUc - number of decimal places required
:

The four programs In the ZPA System are as

The 1401 computer is used primarily as an input and output device. The
7070 Is used to calc:u1ate network data. to merge activity descrlptlons with
calculated data, "and to sort the critical path and negative slack activiti.es.
Input to the system is on cards and the output is a series of_printed
reports. Any number of networks may be processed during the same
computer run and each program of the system will process all. networks
without interruptions. Each network is separated by segment marks on
tape. The existence of Input errors In a network will not restrict the
successful processing of other valid networks.
d.

Normalize floating point number In ace. 1
Numbers of decimal places required In aces. I, 2, In X52 (2,5)

Fixed point number in acc. 1
The number of decimal places of fixed point number In X52 (2, 5)
a

BLX '51, R415S

a+l

Normal Return

On exit lloat1ng point number WUl be in ace. 1
Hardware: 9 locaUons
Index accs. 61, 52, 53, all (2,6)
Aces. 1, 2.

iBM 7070 Library Program Ab.tra.t.

Pi/,,.. Z.4 .. 001
Available pri.or to January 196Z

Method:

60 - number of leading zeros - number of decimal places

=. modified characteristic
On number of decimal places. These can be positive or negative
therefore, any number of decimal places can be catered for.

650 to 7070'Tape Record Convorsion (XXAl5)

R. T. jMUler. Jr.
Texas Instruments Incorporated
August 18, 1960
a.

PurpollleJ To convert 650 tape records, written either alpha or numeric.
to 7070 tape records.

b. Machine Requirements: One (1) 7500 card reader. two (Z) 7Z9 II or 72.9 IV
tape drives. 10K words of core storage
Co

Ganeral Description: The pa.rameters of this routine arc established from contral
card information. The information in these· cards defines the 65.0 record.
the lonnat of tho desired 7070 record, output blocking. individual record
length (input and output). alpha/numeric words. field changes. and other
ir.formation necosaary to create a required 7070 file from an existing

650 tile.
d.

288

Capabilities and Limitations; The routine is c~pable of converting any
650 record of from 1 to 6Q:worda in length to a 7070 record; these are
certain limitations as to o~tput records and field changes Whicq ar~
covered in detail Wlder the section headed "Complete Description".
The routine utilizes the IBM Input-Output Control System (IOCS).

IBM 70,70 Library Program Abstra.ts

FiltM. 2'.4.004
Available prior to Janua.ry lfl62

7070 - Simplified Priority Card to Tape Routine
Russell Ranshaw
CottlPutaUon and Data Processing Center
Unlversity of Pittsburgh
Pittsburgh 13, Pennsylvania

a.

Furpose: This routine will prodqce a tape file containing exact card

w~~e~~~~~ic~~~Fc~~ ~~f=n~dBa~\~!ill'g~l~~mA~~~~ei~ly

blank card will product a Segment mark on the output tape. A ta.pe'
mark is automatically written and the tape rewound when the card
reader is empty. The output tape and output density are specified
on a control card. Card read errors may be corrected while the main
program is being executed.

b. Machine Requirements: This routine utilizes

machine

f~:tl:s)bt~r~ ~n8f~i~a~~~~~\~y g~~~hl~~tta:.ri~~~~~f=ch

Switch 4 is interroqated if a card read error occurs. The standard
7500 uUlity panelia .used. All priority is unmasked. (Continued on Next page)

B -

~.

Genernl Description: With tho Program in storage, 0. priority branch
to 0104 will occur when channel A is switched on. The routine read,s
the control card, sets up the tape operation, alters 0104 to enter the
second phase of the routine, and returns control to the main Program.
Succeeding interrupts read a aats: card using a 16 word RDW and interrogate tho sign of the first word; if not, the output RDW is sct to 8 word.s
and a tape record writter.; if the sign' is alphabetic, the card is checked
for 16 blanksj if any non-blanh: is encountered, a tape record is written;
~;~~l~~~ i~c~~~e;etb~~~~:y~r~:ftt\~~tten. In all cases, a prior-

dol Capabilities smd Limitations: Does not apply.

1~:?1 7-070 Library Program AbntractD

Fd,M. 2.·4.005
Available prior to January 1962

7070

Off-line
Equipment - that equipment ncccssn.ry to prepar8 n. tape
suitable as input to the Condensed Card Lead
ProrJram (8 word numeric records) and the
Modification Routine (16 wUl'd alpha record~).
c. GE;ne;r;li Deocrintion: After being lo.:tded into core storage, the Modification Routine reads an entry. The entry is first examinnd to see if it is an FJXecute entry.
li so, a branch to the first instruction on that entry is effected. 11 it is not an
execute entry, a short edit is performed to insure that the formal i:; correct (any
deviation from the prescribed format will cause the entry to be di::.'regarded). If
tho entry is fOlmd to be a 7070 instruction, its proper Operation Calif' is extracted
from a table and the DN, CL and address portions indicated in the cn:...ry are combined and tho new instruction is movod into memory us dlrected. If the entry i~;
found to be a constant, tho information contained in the Operand field is moved
into memory as directed.
d. Capabilities and Limitations: Any acceptable 7070 instruction, along with the
operation DJ;tDW and constants may be processed.

7070 - Load Subroutine

R. Haertle

AC Spark Plug Div GMC
Milwaukee, Wisconsin

Frl'n~.

IBM. 7070 Library Progrnm Abnlrncln

3.l.001

Available prior to January 1962

a. Purpose: To load data at object time into specified locations.
This may be fixed, floating, or alphabetic data.

7070 DUAL PROGRAM PROCESSING SYSTEM

b. Machine Reauirements: Floating hardware, standard control panel,
165 storage words
c.

Gener;:~l

Description: Input data of the following form will be converted:

1.
2.

Supervisory Program
Associated Control &. C.1.rd.
tape I/O Macroes

Cl)lltrlbutC'd By

+12.345, -123.45E+7, +1, 0, +1234,

Author:

to the following internal form

Maurice K. Morin

Organtzation:

Natlonal Aeronalltlcs and Space Adminlfltration

+5212345000
- 60 12345000

Langley Research Center
Langley Field. Va.

~0000000001

+0000000000
+0000001234
Purpose:

d. Capabilities and Limitations; Input format must conform to detailed

operational descripllon.

IBM 7070 Llhrnry Program Abstract.

Hllnd,Z. 9. 001
Available prior to January 1962
b.

To allow any two programs written within the framework
of the system to operate simultaneously. The two programfl
are operationally Independent. Either can start or end without
affecting the operation of the remaining program in th..- comput('r.
Completely controls and simpUfies card and tape I/O.

Machine Requirements:
(Include machine components, special features,
stQrage requirements, control panels-atandard or flpecial)

7070 Modulus 11 Self-Checking Digit Calculator
Contributed by:

System written for 5K 7070, 2 readers. 2 punches,
2. tape channels with up to 6 tapea on each channel.

Alex 5crbinoIf

IBM Data.cent(~r
19Z5 Euclid Avenue

The system can be easily adapted to a 10K 7070.

Cleveland 15, Ohio
General Description:
appropriate)

To affix Modulus 11 self-checking digits to numbers
over a predetermined range or series of ranges.
h.

(Mathematical method, accuracy, speed, if

NA

Machine Requirements:

d.

Capabilities and Limitations:

5 K four tape 7010 with program to be brought tn
from additional tape, card reader, or console card
reader.

More efficient utilization of 110 interlock time, tape search
and reswccp time. Each program has only 1 reader, I punch and
I tape channel av;'Uable.

General Description:
The program is designed. to compile check digits
for nUlubers of from one to' nine digits. A count
and hash tolal of valid numbers is included for
control purposes. The program calculates check
digits at" rate of 900 pel' aec.ond.

Fileno. 3.1.001

iBM 7070 Library Program AbntrnctD

Available prior to Janu2.ry 1%2

IBM 70.70 Library Program Abotrncts

Fill no. 3.4.001
Available prior to January 1962

7070 - Tape Copy Routine
Russell Ranshaw
Computation and Data Processing Center
University of Pittsburgh
Pittsburgh 13, Pennsylvania
a. Purpose:

This routine will read input tape records nny reasonable
size, in either high or low density, and write on outpu.L tape records
of the same size, in either high, low, or the same density. Input
or output tapes may be rewound or backspaced before copying.

7070 - IBM 7070 Program Modification Routine

R. B. Buttner and G. F. Crane
182 Purchase Street
Rye, New York
a. Purpose: The IBM 7070 Program Modification Routine is a subrout.ine wh!ch processes program modifications, prepared as outlined in the General Descnption,
in such a manner that a program about to be lested is changed while it is being
loaded into core storage. It offers the unique advantage of easy.reas~emblt of
the corrected program at any stage in its development.

b.

~~;~~:. RT%~~~~tiri~sis ~~~:~!~nt ~OI&:~~57o~m;~/~u~b~~a1~tP!~e

cbannels may be used, according to the copying pattern to be followed.

c. General Descrl~ion: Psuedo-instructions, punched up to 8 pe~ .card,
are lnterrogate. 'rhe llinstruciion U provides information as 101lows:
1.
2.
3.
4.

Input tape
output tape
output density
Input backspacinq
5. output backspacing
6. input rewind - yes or n~ Before copy
output rewind-yes or no

b. Machine Requirements: The Modification Routine utilizes all available memory
below word 0495.- All memory assignments, with the exception of the tape error
routine, may be changed through reassembly of the program. Overlap with tho
subject program is possible and often desirable.

Z:

For card input the following devices are required:
7500 Card Reader with Utility Control Pariel
7603 Unit Record Synchronizel'
For tape input the following devices are required:
Tape Units - one or two charmels with associated tape
units as required to load the subject program.
(Continued on next column)

9.
The

rou~ine

~!t~~[;~~~d: ~:~ ~; ~o

After Copy

is tape-limited in operating speed.

d. Capabilities and Limitations: The routine will copy up to 8989 word
records, any density, any combination of segment marlcs, tape na rks ,

~:~r!~:-~ 'U:'in~~t~~:~~~ ~~:~:;~;;ta;1 ~~~~~~~i'O~.uncorrectable

289

Pi/'IlII. 3.4.002
Available prior to January 1962

IBM 7070 Librllry Program Abstract.

General Description: This subroutine will perform the reading
or writing of a definite tape record, and make the necessary checks
to ensure that the operation has been properly executed. If a transIl1ission error takes place. several atteIl1pts to repeat the operation
are Il1ade. If an error in the stated record length should occur, or if
a transmission error cannot be rectified by repetition. a message will
be type'd out by the console typewriter, and the znachine will stop.
Processing with or without overlapping is optional. Average execution
time: 1. 6 Il1illiseconds.

7070 SIMPLE lOCS

Contributed By:

A.

Rohert Judson
The n. F. Goodrich Company
Akron 18, Ohio

Purpose:

To provide a simple method for handling tapes
which \ISCS priority routines to handle possible
('rrors hut not to save time. For small inputoutput scientific problema.

Object Routine Machine Requirements:

Object Routine Produced: Routi.nes to handle all priority possible tape
command~. Operations which have no priority
m.ode do not need and do not usc this package.

E.

IBM 7070. Library Program Abalracl.

Tape Units

Contributed By:

Source Language Entry:
(I) XL
TCX;f' 3
P (Tape Command) Any channel-unit. and RDW
(if applicable)
B
Capabilities and Limitations: In case of an uncorrectable error,
priority will be released to the B
OK operations release priority to the following instruction.
This procedure facilitates debugging as priority
is released without otherwise affecting machine
status.

Author:

Central Techni.cal Group

Organization:

Mutual Life Insurance Company of New York
1740 Broadway, New York City

Purpose:
To Generate data files from card i.nput for use in testing
7070 programs.

*.

b.

Fi/,fI/J. 3.4. 003
Available prior to January 1962

7070 MATES (MAster ,!ape

Machine Reguirements: (Include machine components, special features.
storage requirements, control panels - standard or special).
1.
2.

Gore zero should be done to clear all final status
words. 4 instructions go into 0150-0153 and 131
locations any other place are used. These can be
reduced by standardizing input-output channels
and reducing the error messages. All accUInulators are used by the package.

IBM 70.70. Library Progrom Abotr.cl.

Filtfl~. 4.3.001
Avai.1able prior to January 1962

Bi.g File Generator (BFG)

B.

C.

D.

Capabilities a,£l.d Limitations: Only the tape operations (P)T~
{P)TR.R, (P)TW, (P)TWR, (P)TWZ and (P)TWC will be performed.

d.

3.

10,000 words of IIlemory.
Card-to- Tape equipment to create an input tape to the BFa.
One 727 n. IV or 729 II, IV Tape drIve (in addItion to
drives for fi.1es being created).

The BFG program can be patched for use wi.th certain other machine
configurations. See BFG wrtteup for detai.1s.
General Description: (Mathematical method, accuracr. speed, i.f
appropriate).
d.

~xecutary Program.~)

Capabilities and Limitations:
1.

The BFG is an extension of the IBM TFG program; records of
the TFG type can ge generated by the BFG.

2:.

The BFG is preferable to the regular 1'FG when many larger
records are to be created and only a few fields will be
changed from record to record.

3.

The BFG program can only be used,with the PILOT program
Tape SysteIll.

Author: Vincent J. Battaglia
Organization: INTERNATIONAL BUSINESS

MAc:m~ES

Chicago Downtown
618 S. Michigan Avenue
Chicago, Illinois
The Librarian generates and maintains a master tape. It acceptB
programs in squeeze deck format and produces a single tape
record plus an identification record for each program (or phase
of a program). The Locator obtains programs from a Library
tape Wlder operator or program control.
b. Machine Requirements:

STORAGE

LOCATOR:
LIBRARIAN:

TAPES

IBM 7070 Library Program Abstracts
7070 PAT COMPILER

READER

140 words

7500 or 7501

236 words

7500 or 7501

Contributed By:

Capabilities and Limitations: The card image input to the Librarian
must be in numeric eight word load format on tape. Tape density on
input and output of the Librarian is at the discretion of the user.

Flit l1li.

IBM 70.70. Library Program Ab.lract.

3.4.004
1>.

H. Hyman, Applied Science
IBM Svenska AB

GENERAL DESCRIPTION: The Pat Compiler program will create a
7070 Pat System Tape of program packets from either the card reade'l'
or a tape created off line In alpha card image form. As the Pat tape
is being created each program packet number will be typed. The tape
channel and unit will also be typed from each TFG control card encountered. Messages may also be typed to identify each Utility Program included on the PAT tape. This typed list will be in the saTTle
sequenc"e as the programs on tape and serve as a reference sheet
during use. The PAT Compiler Call card defines the beginnIng of
a packet and contains the necessary information for compiling of the
packet.

G~vlegatan 20
Stockhohn 6, SWEDEN
Purpo-i.e: A subroutine for checking properly execution of tape
reading and writing operations.
b.

290

Machine RequireIl1ents: 1 electronic switch. 3 index words,
locations # 97, # 99, # 100 and # ISO, 80 ordinary storage locations,
the priority mask register a-nd initial and final status words (as
required by tape units used).
(Continued on next column)

MACHINE REQUffiEMENTS:
5 K memory
1 Output Tape unit
1 Input Tape unit or 7500 c.ard reader
Standard IBM UtUity panel SWIS 1 &: 2 on A

TAPECHECK SUBROUTINE
Contributed By:

Organization:

W. J, Walker
IBM Corpuration
N. Y. Financial
Z Broadway
New York 4, N. Y.

PURPOSE: The Pat Comptler Program compiles a PAT (Proc~dlLl'e
for Automatic Testing) System tape supplying the desired utllity programs used in testing.

Available prior to January 196~

Author:

Pi/ene. 4.4.001
Avatlable prior to January 1962

d,

CAPABILITIES AND LIMITATIONS: Utillty Programs can be compiled
only in the normal logical sequelll:e as specified by the control card.

B - 7070
Fil'M.

4.4.00l.

-------------------------IBM 7070 Library Program Abstracts

Available

prior to January

196Z

7070 PAT COMPILER SYSTEM

A.

1401 PAT Compiler (or 7070

Author:

William Ludwig

Organl?atlon:

IBM PhUadelphta Datacenter
1730 Pennsylvania Boulevard
Phlladelphla J, Pennsylvania

Purpose: This system, consLsting of several programs, is designed
to assist the debugging of multiple object programs by faciUtating the
the prcparatLon and usc of a PAT system tape. This PAT Compiler
System allows multiple programs and data to be incorporated into individual test packets on a single PAT tape, with the insertion of all
utlHty routines needed by the PAT Compiler program.

Purpose:
To compile the 7070 te:x:t tape on the 1401
To edit test packets for 7070 testing on the 1401.
b.

B.

4.4.00S

Available prior to January 1962.

Contributed By

Joseph C. Capps, Jr.
IBM Corporation
Loa Angeles Datacenter
34Z4 WIlshire Blvd.
Los Angeles 5, California

ContrIbuted By:

Filtn~.

IBM 7070 Library Program AbstracllJ

Machine Requirements: The PAT Compiler System requires, as a
minimum, a SK core, four-tape IBM 7070 with etthcr a 7S00 or a
7S01 Card Reader. The PAT Compiler program is available in two
versions, one using the IBM 7070 lacs systetn and requiring a 10K
core 7070; the other not using IOCS and not requiring the lLlK core
7070. Either PAT Compiler may be modified to run on any given
input/output configuration by the insertion of a Configuration Control
card. containing the desired machine configuration.

Machine Requirements; (Include machine components,
features, storage requirements, control panels ~- standard
or speclal)

4K, 1401 with:
1.
2.

2 tape drives
Advanced programming features.

General Description:
if approprlate)

(Mathematical method, accuracy, apeed,

The object programs being tcsted must make usc of the standard IBM
SIcard Load Program. During testing, the PAT Compiler System
places-no restriction on the use of the computer by the object program.

Not applicable
d.

C.

Capabilittes and Limitations:

General Descr~ For each program to be debugged. one control
card must be punched. Its purpose is to separate the programs and to
supply to the PAT Compiler pertinent infonnation. Multiple sets, consisting of a control card. test data, and object program, may then be
processed by the PAT Compller program to produce a self loading PAT
tape.
The resulting PAT tape :may then be utled as many times as desired to test the programs.

Designed to be used for a tape oriented 7070 system with
a 7501 Console Card Reader.
It can be adapted for use with a 7S00 Card Reader with
very simple modifications.

Flltno. 4.9.002

IBM 7070 Library Program Abatracls

Available prior to January 1962.

Procedures are avallable withi.n the PAT Co:mpiler to add new programs
or to delete old programs.
7070 SCAN
Each PAT Compiler program. condensed deck conliists of two.parts: the
PAT Compller program. itself. and the utility programs to be incorporated
onto the PAT tape by the PAT Compiler program.

Contributed by:
Ronald J. Repking
IBM Corporation
Charleston. West Virginia

~ll the utility programs used by the PAT CompilcT Sy::;tem are modi~
f,cd vl!r::;ionll of the standard ut.ility programll.

Filt~o.

IBM 7070 Library Program Abatracta
7070 LORELI2
Author:

B.

Machine Requirements: Basic 7070.
from a card reader or a tape unit.

C.

,General Description: This program will find :many common errors in
Fortran programs. Over fifty errors arc caught by this routine.
For example:

Zurich Insurance

Direct Inquiries To:

Vincent J. Battaglia
INTERNATIONAL BUSINESS MACHINES
Chicago Downtown
618 S. Michigan Ave.
Chicago. Illinios

Purpose: LORELI2. is a program used in conjunction wlth a modiHed Sort
90 program, designed to create a croaa~reference listing of
programs assembled by Autocoder 74.
h.

Purpose:

(~cation ~ference ~sting)

Mike Clark

Organization:

A.

STORAGE

Mal:hinc Requirements:
LORELI2:

sooo

SORT 90:

5000 words

General Description:

i.

2.
3.
4.
S.

6.
D.

TAPES

words

4, 6, or 8

Program is set up to accept in{ormation

Mixed arithmetic mode
Dimensioned variable written without subscripts
Intersecting D 0 loops
Misplaced commas in control statements
Unfulfilled branches and DO's
Names that are used but never defined

Capabilities and Limitations: This routine was written to be inserted into a
Fortran compill.!r system that will tnakc batch assemblies using five tape
drives without :iny card equipment, but it can be run separately. The tables
have been set I1p to Basic Fortran specificattons, i. e. 27 DO's 150
variables, etc. Subscripts arc not checked.

IBM 7070 Library Program Abstracts

Flt/M.
S.I.OOl
Available prior to January 1962

The cross-reference of the object program 13 into
these major areas:
7070 I).
2.).
3).
41.

d.

To edit basic Fortran programs prior to doing a Fortran assembly.

4.4.003

Available prior to January 1962

Listing
Listing
Listing
Listing

by
by
by
by

address
Index word usage
Electronic switch usage
Accumulator usage

The listing mayor may not croBs-re[er~
cncc thc following baaed an Alteration
llwitches.
I}. Listing by Accumulator usage.
2). Comment!!- statements ( *in column 6)
3). Steps generated by IOCS or other tnacros or
subroutine Ii em the A74 assembly tape.

6S0 PANEL SIMULATOR

C. W. Kastner & J. W. Lake
Texas Instrum.ents Incorporated
Purpose: This program is designed for use in conjunction with th(' IBM 7070
Program ,which simulates the IBM 650. This program simulates th(" ~,\ \'
panel, thus eliminating the need for wiring 7070 read and punch panel!; 10
replace the 533 panels used by the 650 programs.

Capabilities and Limitations:

b.

Machine Requirements: Index words 70 through 81, electronic switches
22 througq 29, and 1500 instructions and locations that m.ay be aSllembled
anywhere ~utside oC the area required by the IBM 7070 Simulation Program.
(Continued on next page)

29i

The IBM 7070 Simulation Program with the Panel Simulator included can
usually be run on a 5K core machine by removing unused portions of ~be
program. 'If the entire system is required, you must have a 10K core.
machine.. Some of the sections which can be easily removed are: ram
segment, (~) OP codes, floating point. index registers. or any of the other
routines which your particular installation does not use.
General Description: For each 650 program a set of read~and/or punchformat cards must be prepared. From these format cards. Ihe program
will set up the card image in memory just as the Type 533 panel would
have read the card in, or will punch the card image just as the Type 533
panel would have punched it.
d.

Capabilities and Limitations: The running time is increased only slightly
above that of the usual procedure of using a board for each program,.

12M 7070 Library Program Abstracts

Filt nD.

FiltM.5.1.004

IBM 7070 Library Program Abstracts

7070 SIMULA TING THE CARD 650 ON A TAPE ORIENTED 7070
Contributed By:

Purpose ~ ~ This program is designed to simulate card 650 progrruna
at speeds ranging from 2 to 3 times faster than the present IBM 650 Simulator for the 7070.

b.

Machine Requirem.ents - _ A 5K 7070 with one tape channel and two 729
tape drives. No control panels and no special features are required.
General Description - - This program. is designed to handle multiple
650 program.s on one or more tapes. A segment mark is to be placed
just prior to each 650 program and the first record Inust give the console setting and program number. The 7070 can be halted just prior
to each 650 program if desired (alt. SW). If a 650 program cannot bt"
completed. it can be by-passed and the 7070 will start the next 650
program on the input tape.

5.1.002

d.

R. A. Cooper (Richard King and Jim Lake)
P. O. Box 1249,
Houston 1, Texas

1. Read Bound
2. Punch Bound
3. Compute Bound

b. Machine Requirements: (Include machine components, special features,
storage requirements, control panels - standard or special)

(,50 Storage

Speed

500 Words
1800 Words
1900 Words

9.0 to I
6.4 to 1
3.8 to I

650

r/o

Speed

200 cpm. input
100 cpm. output
44 c pm. input

This program. uses five cards per tape record and the tapes are con~
trolled by the IBM 7070 Input/Output Control System. It will not sim_
ulate any of the m.inus operation code instructions and it is restricted
to one type 533.

5K - 7070
7500 Card Reader
7550 Card Punch
80-80 Alpha panels for reader and plll1ch

c. General Description:

Capabilities and Lim.itations ~ ~ Three types of 650 programs have been
tested and timed on both the 650 and 7070 with the following results:
Limiter

a. Purpose: To simulate a basic 650 program on a basic 7070. The 650
control panel is also simulated.

1.
2.
3.
4.

John D. Fehd
IBM Corporation
Oakland, California

a.

Available prior to January 1962

7070 - Simulation of Basic 650 on Basic 7070

Available prior to January 1962

Each 650 program. that is to be sim.ulated will require 1401 programs
for input and output.

(Mathematical method, acclll"acy, speea,1t appropriate)

Most 650 programs run 2-1./2 to 3 times as fast on the 7070.
An optlrators manual and technical description will be supplied with
the program.

d. Caoabilities and Limitations:' The simulation routine will handle any minimum
600 program (650 Model n with one 533).

Filt "11. 5. 1. 005

IBM 7070 Library Program Abstracts

Available prior to January 1962

SIMULA TION OF CARD OR TAPE 650 ON THE 7070

FiftM.

I::lM 7070 Library Program Abstracts

5.1.003

Available prior to January 1962

Contributed By: L. J. Berg, R. NUnn, H. Monroe
Organization:

Curtiss-Wright Corporation, Wood~Ridge. New Jersey

7070 - GRaN!{ - a 7070 Simulator for the 650
Russell Ranshaw
Computation and Data Processing Center
University of Pittsburgh
Pittsburgh 13, .Pennsylvania

To simulate a card or tape 650 on a tape oriented 1401-7070 system.
b.

a. Purpose:. GRONK is a program for tbe IBM 650 to simulate an IBM 7070.
b.

c.

d.

Minimtnn of 729 II or 729 IVtape drives for simulating unit record input
and output. Additional tape drives as required for tape input and output.
This system. is designed for a 10K m.achine but can be reduced to a 5K
machine,

:r'~2.chine

Requirements:
1) IBM 650 (2000 words)
2) One input-Qutput device
3) Index registers
4) Core Storage (9000-9059)
5) If used by program being simulated:
a) Automatic float
1:1) Tape W1itS - max. of two for each
of two channels.
Tbe output devices are flexible, and may be established by the user.

General Description:
This operating tecbnique com.bines the use of a portion of the PAT system.
(Procedure for Automatic Testing developed by IBM's New York Data
Center), IBM's 650 Sim.ulator Program.. modifications to the Simulator
Program and a 1401 Program developed at the Wright Aeronautical Division.

9e;~~rpl

Description: GRONK's primary function is to P:',-:"'ViC.A potential
'/0'10 users who currently have a 650 with a means of testing small 7070
programs and subroutines without the expense of 7070 time elsewhere.

~/06b~~~~:e~d~~~~~of~~~t~R~o~i:n~:ep~i~;ff;;a;~c~~:~~~ the
fi~~~onI\c:~it;gt~S ho~e~~~x s~~~~:{e ~et%ll~~~~~-lOOk-UPS,

and

1) Edit commands (ENA, EAN, etc.)
2) Double preCision floating commands
3) Some tape commands:
a) TSEL

b) TSK

0) TEl"
d) TSLD
e) TSHD

Machine Requirements:

d.

Capabilities:
A card deck containing the PAT System, the Simulator Program. and
the 650 Program is developed for each 650 Program to be simulated.
A series of these decks can be written on a reel of tape using a Type
1401C System. The card decks are m.ade up so that:

1. The inform.a.tion whicb the Simulator Program. normally calls for
2.
3.
4.

f)TRA

4)
5)
6)
7)

Diagncstic interrogate (l09)
Alphabetic signs
Disks'
Stacking latch commands

GRONK simulates the first 650 words of 7070 storagej if no taves are
used, an additonal 200 words":become available.

292

5.
6.
7

through the use of control cards is built into the package.
Instructions for initializing the succeeding package are included.
A routine to write a tape mark on the tape unit which simulates the
card output is included.
Multiple data files may be processed using the samc 650 Program
without the need to prepare a sepa.rate input tape for each input
file.
A dump (both core and tape) may be taken on any channel and tape
drive.
650 load cards are recognized by an alpha sign in word 10 rather
than by a plus sign.
The output tape simulating card output may be written in either
compress~d or normal mode.

B - 7070
FiltM. 5.2.001

IBM 7070 Library Program Abstracts

b.

Machine Requirements:
Basic 7070 with 10K memory, two tape channels,
two tape units per channel, on-line card l'~1 "7 i.O
Normal exit

Arcsin x in accumulator 2 to 9 decimal places.
9991 set to t 0 _ _ O.

Space:

48 locations, including R311A .. R311A+ 10,
excluding CI2fM. C¢M 1- I,

Ixl 410

I. W. '. 51, 52

9991

~

Mothod:

(x)

a O :;:

a3

=

al a l

1L_ ~
2

(x)

x+azx~ ••••••••••••••

-1.570796305

= - o. Z14

a1
aZ :

mulUplied bY<'e1!

a 7x

a/,

_0. 030891881

598 802

as:.

-0. 017 088 12.6

.. 0.088 978 987

a 6 ::::

-0. 006 670 090

= .. 0.

050174 305

a7

=- ..

0. 001262 491

/xl '

(-ff)

0.9999999941

that the compare indicators ma.y be reaet by this routine.

arcsin x.:

l/I

I. W. 's 51, 52 (51 (2, 5), 52 (0, 9) )

9») ,

Hastings; p. 163.

set to - 0 -- 0

Hastings, p. 140, with the coefficients CC I

•

{51 (2, 5), 5Z (0.

S.W. 21
SORT 1

X in accumulator 2 to 9 decimal places

g~LrOC~UfS' Including R30SA - R30SA - 10, excluding C(Z)M,

C7:

Note that the routine uses the variable as a ~eBult of
whicb the coefficients used differ in ~ign from those in H,?-stings.

-0.00 019B 0740

iContinued on next column)

294

xf;;t-

H~ 1.0,

reM 7070

Cl

.. f!;

Range:

Entry,

_+2

(ELX 51, R30BSl
a
(ELX 51, R30BS2
aU
only exit
Sin/cos x in accumulator 2 to 9 decimal places

Method:

r

Subroutine for IBM 7070

File 110), 8.1.004
Available prior to January 1962

Rolls Royce Ltd.
P. O. Box 31
Derby, England

E.!!!!lli>:
.ful!u:

~

Filtn(J,
8.1.00b
Avallable prior to January 1962

l3M 7D7D Library Program Abatracta

_~1

Subroutine for

C;bM+ 1

Reduce x to lie in the range-:!£. ~ x & :zL. and hence use the
seriell for x cot x mentioned
J. AEl60C~ Comp. Machinery,
Vol. 6, No. I, p. 114.
a
::.
4
x cot x" ;o..,..a l y+a 2 y .,. a 3 y + a 4y

8. l. 003

ARCSINE N

d.

8.1. oes

Available prior to Janua.ry 196Z

Subroutine for IBM 7070

Method:
Fil,IIO,

IBM 7070 Library Program Abstracts

0.0000020019

Max. error is lin 8th decimal place.

IBM 7070 Library Program Abstracts

A.

D.

C9 -

O. 00 B333 0252

Error:

Max. error is 4 in 8th decimal place.

B - 7070
Fd.r.~. 8.1.007
Availab12 prior to J:mu3.ry 1962

13:-: 7:7Q !.tbrary Prc[lrn1'1 Abatrncto

reM 7070

S:I!-n'()utinc for

-"""-

8.1.010

.T~uary 1%?"

-

""

"""-

a. Purpooe: To find arctan of argument x where X :: y/x
b. Machine Requirements: Floating hardware, 77 words storage

X in accumulators 1, 2 to 9 decimal places.

c. General Description: Evaluation of the following continued fractiOn:

BLX 61, R312S
a.·H only exit.
a

arctan x = x

Arctan x in accumulator 2 to 9 decimal places.

If

t

B2 - A3

Ixl.> 1, ta..1.;:e reciprocal.
=

o. OGG 120

=

0_ 055 909 888

O. 999 999 333

C

C3

O. 333 298 501

CU

C5

O. 199 465 360

C 13 = O. 021 861

O. 139 085 335

C15

~

Fil(r.c.

m>r 7070 Library Procrc.m Abotrc.cta

-1:..

.

J

A2.

;:;Z->B3

At most ten signlficant digits of x are used.
C
x 21 -1-1
arctanx -1::0
2t-t_l

C7

Bl -

d. Capll.bilities and Limitations: Input must be in normalized floating
point notation. Answer may be in either degrees or radians. Signs
of y/x will determine the quadrant of the answer.

I. W. 's 51, 62 {51 (2, 5), 52 (0, S)}

Hastingsl p. 137.

.

t

x'/.

62 locations, including R312A - R312A - 11,
excluding C~M, C0M - 1

Cl

lBO t ~d

.fa - - o.

9991 set to

k2!:

_._-

AC Spark Plug Div GMC
Milwaukee, Wisconsin

2

~:

Available prioJ": to

M. Roberts

IXlqOI2; -.; <. arctan x< J!:

~:

Abct,,::c~[J

7070 - Arctangent Subroutine

Rolls Royce Ltd.
? O. Box 31
Deroy J England
Range:

filtr:c.

IBM 7070 Librc.ry Prcrrrcr.\

O'~'l

8.1.011

Available prior to J3.Uuary 1B62

7070 - Sine-Cosine Subroutine

M. Roberts

= o.

2.~9

004054058

Max. error Is 4 in 8th decimal place.

~~~i~~:'l~fA~i~n~i~C
a. Purpose: To find sine of an argument x
b. Machine Reollirements: Floating hardware, 73 storage words plus one
word CC~M, 1 electronic switch

c. General Description: Evaluation of following series
Fil,,,,.

Sine x •

8.1.008

Available prior .to January 1962

Degrees To Radians COllvor.ioll
M. Roberta
AC Spark PWg Oiv CiMC

,,-.x~/31+ x5/51 -

x7/71

+ x9/91 - x 11 /11 I

d. Capabilities and Limitations: Input must be normalized floating p.?int
number. Main routine must save CCQM. x is stored as sine x 1I tX
.0015 radians. Entry is permitted1ln either radions or degree umts'·
for x.

IBM 7070 Library Program Abstracts

Fil(nc. 8.1. OIl
Available prior to January 1962

MUwa.ukee, Wisconaip.
ARCTANGENT SUBROUTINE
&.

Purpoaa:: To c9nvert an anglo of tho foUowiOl'::: form:

Contributed By:

u.

'''''~

"L-,l1econds
minutes

egree.

Author;

H. Hynlan, Applied Science

Organizati.on:

IBM Svenska AB
G~v1egatan lO
Stockholm 6. SWEDEN

to radians in nonnalized !lollting point form.
h.

~.:achina Requirements:
General Description:

d.

Floating point hardware, 45 coro oto;".::.se worda

The routino will cO:OVOl't one or

Il

Purpose: A full preciesion, fixed poi.nt subroutine to con1pute the
inverse tangent function, expressed in radians.

table of values

Capabilities and Limitations: Accumulatoro a.nd indica.tore arc not saved.

b.

General Description: The arctangent is approximated by a
polynomial of the fourth degree. The constants of the polynomial
arc stored in a 50 word table. Accuracy: The magnitude of the
maximum error is O. 000 000 003. Average execution time: 5.4 milli·
seconds.

B. 1. 009
Available prior to January 1962
F;"!tr.o.

!BN 7070 Library Program Ab:ltracto
7070 - Radians to Degrees Conversion

Machine Requirements: All accumulators, the compare indicators.
1 electronic switch, l index words and 90 ordinary storage locations.

d.

CapabiHties and Limitations:

M. Roberts
AC Spark Plug Div GMC

The argument X must satisfy:

- 1. ~X:::;1.

Milwaukee, Wisconsin

a. Pur nose : To convert radians in floating pOint"notation to degrees.
~, and seconds:

~LO fl\ T;::secondS
Lrrunutes
degrees

b. Machine Requirements: Floating point hardware, 49 core storage
words

c. General Description: Tho" subroutine will convert one or a table
of values.
d.

"~3.oabilities

and Limitations; Angles to be converted must not exceed
17.4532 radious.

FlltM.

IBM 7070 Library Program Abstracts

8.1.013

Available prior to January 1962

HYPERBOLIC TANGENT SUBROUTINE
Contributed By:
Author:

Ol'gJ.nlzation:

H. Hyman, Applied Science

IBM Svenska AB
Gavlegatan 20
Stockholm 6, SWEDEN

(Continued on nex-t page)

295

Purpose: A full precision. fixed poInt subroutine to compute the
hyperboli.c tangent.
b.

Machine Requirements: All accumulators. the compare indIcators.
1 electronic switch, 3 index words and 109 ordlnary storage locations.
General Description: The tanh function Is approximated ustng
a tanh expansion formula and a polynomial of the thIrd degree. The
choice of constants m this polynomIal depends on the argument. and
the constants are taken from a 65 word table. Accuracy: The
magnitude of the error is always less than 0.000 000 008. Average
execution tlme: 11.0 mllllseconda.

d.

Gavlegatan ZD
Stockholm 6. SWEDEN
Purpose: A full precision, fixed poInt subroutine to compute the
tangent or contangent of an angle given 1n radians.
b.

General Description: The tangent or cotangent functton Is
approximated usIng tangent expansion formulas and an odd polynomial

~: ~~*:4.lft:e:zir;:; ::;.u:~~Yio::.e ::::~~~:;fc~~:n::~::~e error

CapabilIties and Limitations! The argument X must statisfy:
-10,
and can be used with all 7070 conhgurations. Senfie mode for sign change
and for field overflow must be preset.
General Dr,scription: X is separated into integral and decin,'~' ;,i\rtl> and
~.Li part is evaluated by means of the expression
I"
CiXj)2
i""O
Maximum error will not exceed 2'10- 8 . The average execute lirn{' is 11
milliseconds.

d.

Capabilities and Limitations: Input must be normaliz;cd !loating decimal'.
The program requires b5 locations and will alter Accumulator(; I, 2, and
3, Index Word 98 and the high-low-equal indicator.

HYPERBOLIC SINE, COSINE AND COTANGENT SUBROUTINE.
Contributed By:
Author:

G. J. Elliott, Applied Science

Organization:

IBM Svenska AB

FrI,nQ.

IBM 7070 Library Program Abstracts
LOG BASE 10 OR BASE e

G;vlegatan 20
Stockholm 6, SWEDEN
Purpose: A full precision. fixed point subroutine to compute the
hyperbolic sine, cosine or cotangent of a number.
b.

Machine Requirements: All accumulators, the compare indicators,
2 electronic switches, 2. index words and 101 ordinary storage
locations.

Applied Programming Department
IBM
Purpose: This program computes log (BASE 10 or BASE c) .... f X in floating
~form.
b.

General Description: This subroutine uses an Exponential Subroutine
by T. Rabe. Sinh X and cosh X are computed according to the definition
formula. Coth X are also computed in this way for X 0.1 but ~ther­
wise coth X are approximated by a polynoIllial. Accuracy: The maximum
error is 8 in the last digit. Average execution tim.e: 14.5 Illilliseconds.
d.

Capabilities and LiInitations:
be leaa than 1010.

The magnitude of the argwnent Illust

IBM 7070 Library Program Abatracto

8. it. 002

Available prior to January Pl112

Machine Requirements: The program uses only fixed point operations and
can be used with any 7070 configuration.
General Description: X is treated as the product o{ a set of numbers whose
logs are known and a number between 0 and 0.1 whose log is found by
evaluating a relaxed Taylor series. Average e:.:ecute time is 6.75 ms. for
log and 7.75 m. 8. [0"(' loge, Maximum error is 2 x 10- 8 •

d.

.....:J.p .... bilities and Limitations: The input must be normahz;ed iloa..ing
decimal of form MM. DDDDDDDD (MM:::o:exponent + SO). The program
requires 54 locations, the three Accumulators and Index Word 98,

FlIt ~~.
8, 1. 021
Available prlor to January 1962

SINE-COSINE SUBROUTINE

Ed,no.
8.2.C03
/wailable prior to January .1:Jt:i;;;

LJM 7070 Library Program Abntrnctn

Contributed By:
S. Nordin, Applied Science

Subroutine

Organization:

IBM Svenska AB

Rolls Royce Ltd.
P. O. Box 31
Derby, England

G~vlegatan 20
Stockholm 6, SWEDEN
Purpose: A full precision, fixed point subroutine to compute the
sine or cosine function.
h.

elf

Author:

Machine Requirementa: All accumulators, the compare indicators,
2 index words and 55 ordinary storage locations.

Method:

X~a1X + a3X3 + a SX 5 + a7X7 + a9X9

cos

~ao + a2X2 + a4X4 +

a6X6

+ asX8

Accuracy: The magnitude of the maximum error is 10 -9.
execution time: 6,4 milliseconds.
d.

Average

Capabilities and Limitations: The argwnent X muat be expressed
in radians and satisfy -10"" X "<;:10.

Reference: IBM Journal of Research and Development - April Hi.

~:

10 loge

~:

x to 8 decimal places in Accumulator 2.

a

General Description: By the use of well-known trigonometrical
identities, the problem may be reduced to that of calculating the
functions with argrunenta in the interval (0.17'!4). Then the functions
are approximated by the polynoIllials:
sin

for IBM 7070

.t::::::

1Q)~;;;9

loge 10.

- BLX 51, R30fS

aH

-

a~2

- Normal return

E.,qRoa -

1. e. out of :.:z.::<;;a

eX to 10 deciwcl places in Accu::::::J.ulo.~o::s 1 and 2.

~:

lin lOfu signliica.'1t figure.

Ti:-.~b:-:

Estimc.ted 10.6 m1l11-seconc.s.

LocG.tions 1.:'-cd:

90 Al\'D

SWitches Used:

NO;"":!:.

C{lIM

Index locations used: 51, 52, 53.

297

Fit",,,. 8. Z. 004
AvaLlable pri.or to .ranuary 196z

lEM 7070 L!bre.ry Program Abatrcc10

FiI,fI,.

IBM 7070 Library Program Abstra.ts

8.2.007

AvaIlable pdor to January 196Z

EXPONENTIAL SUBROUTINE

Subroutine L0lex for IBM 7070

Contributed By:.

Rolle Royce Ltd.
P.O. Box 31
Derby. England

Author:

T. Rabe. Applied Sclence

Organization:

mM Svenska AB

G~vlegatan 2,0
Stockholm 6, SWEDEN

This subroutine computu logal( for a eingle-preciaion fixed point argument.
Restrictions:

Logex ia computed lor ::c;;r O. Foe xlii 0 control is returned
to a'l' 1 in the calling sequence.

Usage;

Calling sequence.

Purpose: A full predsion. flxed point subroutine to compute the
exponentIal functIon.
h.

Machine Requirements: All accumulators, the compare lndicators,
the overfloW' indicator for accumulator Z. 2 index words and 102
ordinary storage locations.

x in accumulatora 1, Z to 10 decimal places

LOC
BLX 51. R307S
nt 1 Error return
a+ Z Normal return

General Description: The exponentlal funct~on 1s approximated by
a polynomial of the fourth degree. The maximum error ls.3 In the last
digit. Average execution tim.e is 8.4 mllliseconds.

On, exit logex is in. accumulator Z to 8 decimal places.
d.
Codin.g;

Capabllltites and Limitations: The magnitude of the argument must
be leas than 10 10 •

47 locations are used. Index accumulators used are:51 (0, 9)
5Z (Z, 5)
53 (Z. 5)
5. (0. 9)

Fi/tIII.

Timing;- approx.

IBM 1070 IJbrary Program Abstra"'s

8.Z.008

Available prior to .ranuary 196Z

Method:
Where n .. number of shifts to left justify x in accumulator 1.
n .. number of times doubling is neoded to bring shifted
x into the form 1 + Y to 10 decimal places.

a

LOGe (1+ y)=- ~ 1

NATURAL LOGARITHM SUBROUTINE
Contributed By:

i

Author:
Organization:

"l =+ •9999964Z39

Whe ••

~4~::mmm~

as =+ .16765407ll
a6 I: _.09532.93897
a 7 _ 1" .0360&84937
a8 : _ .006453544Z,
Max. error is 3 in the 8th decim.;.;' ..::.C>l.

Purpose: A full precision, fixed polnt subroutine to compute the
logarithm.
b.

Machine Requirements: All accumulators, the overflow Indicator
for accumulator 2, 3 index words and 115 ordlnary storage locations.

II'.

General Description: The logarlthm Is. approximated by a
polynomial of the third degree. The constants of this polynomial
depend on the argument and are stored In a 64 word table. Accuracy:
The magnitude of the maxImum error [s O. 000 000 03. Average
execution time: 7.1 milliseconds.

FiJ,
8. 2. OOt)
AvaUable prior to January l'J6Z

IBM 70.70 LIbrary Progrom Ab.trGc:.

7070 - LC ,/Ill, y .. x- v10/ x...nO
d. Ca.pal>!l!Ues a.nd Limitations:

Input must bel1Ol'mali'.cI floal!nq point no.

IBM 7070 Library Program Abstracts

FI/'M.
8.3.001
AvaHable prior to .ranuary 1962

SQUARE ROOT X
Applied Programming Dept.

IBM 7070 LIbrary Program Abatra.t.

FJ....
8.2.006
Available prior to January JW2

7070 - Exponentla.l Subroutine

IBM
Purpose: This program computes the square root of
decimal form.

b.

Machine Requirements: This program uses only fixed point operation codes,
and can be used on all 7070 configurations.

M. Roberts

~~~:~:'lW!~~n:;l;;C
&.

b. Machine Requirements: FloaUng hardware, 50 core locations
10" = (!-t &1

d.

298

X

Evaluation of following series:
~_.ll ..... +"7x)
72 0 "- x "+ "2x2 • DBA
- 1

~~~~ti.:.~ L~~~~~~~r~~~'W,1~·EIn!n~~~~~:~~ved.

0 in floating

General Description: The method consists of a linear approximation
followed by two iterations of Newfane formula (modified). Th.~ maximum
errol' is '-1 in the eighth place of the digitand. Average execute time is
10.3 milliseconds.

Purpose: 'To find exponential of arqument x (ex or 10")

c. General Description:

~ ~

a.

d.

Capabilities and Umitations: Input must be normalized floating decimal
numbers of the form MMDDDDDDDD (MM = exponent .... 50). An. attempt
to take the square root of a. negative number will produce an error halt:
The program requires 42 loca.tions lor instructions, constants, and ·temporary storage. It alao requires (and will alter during execution) Accumulators I, 2., and 3, and Index Word 98.

B-

Fain"

8,3.002.

.IB.M
__7.0.70__L.lh.rn.r.Y.P.r.og.r.n.m.A.b.s.tr.n.ct.o___________A.v.a.il.,b.'.C.p.".o.'.to__Ja.n.ua.'.y.196Z
Square Root, Toplcr Method

Fif,no,

7070

8~ 3. 004

.IB.M
__7.0.7.0_L.lb.,.nr~y.P.r.o~gr.n.m.A.b.o.w.n.ct.o____________~-=~___________
Subroutine for IBM 7070

Rollo Royce Ltd.
P.O. Box 31
Derby. England

Rollo Royce Ltd.
P.O. Box 31
Derby, England

PurpolJo:

This Bubroutine computoB square root x to'a controlled accuracy

Ra.ngo:

o~ x

Usage:

Input: x to 10 decimal plo.coD in 9992..

for a lIingle preciBien fixed point argu.tnent.
PurpoDC:

Thia aubroutina computcll aquare root x for a ain::;lc prccioion
fixed point argument.

Range:

o =x~ 1

£1.

tA) If maximum accuracy is required: ..
Calling Bequonce;
BLX
51, !"~ZO-: ~
a+ 1

error :::,otu=:1, :.:..!.

at' 2.
(B) Ii

<

Output:

BLX

t' 0 in 9991.

Calling sequence: a
a+ 1
a+ 2.

error return, x .:: 0

a+2.

norma.l :cturn.

BLX 51, R309S
error return,
normal return

50 locations including R39A - R39A +- 5.  to provide coefficients and significance tests. The routine
will perform each step in a 130 variable problem in about 14 seconds,
exclusi.ve of output. Output may be included or partially or completely
supressed, as desired, and will make the tinle highly variable between stepa.

d.

~abilitieB and Limitations; The program will handle up to 130 variables
{ilpproxirnatdy BS variables on a 5K luachine}. The op",rator may, by
manu;!! intervention, prohibit (:crtain incit:pendcnt variables from entering
into r(~gressiun, force inclusion or deletion of certain v,lriables, change the
dcpclldent v"niabr",. or change the f;ig"lficance levels fur inclusion or deletion
at any time.

M. Roberts
AC Spa'rk Plug Div GMC
Milwaukee, Wisconsin

a.

Purpose:

To find xl. x2, •••• !len of the foUowi,ng equation set:

all alZ •••• aln

xl

01

'Zl

xz

c2,

anl ••••••• ann

Xn

Cn

b.

Mach~D:e

d.

Capabilities and Liznitations: Input Inust be in normalized floating
[onn. Accumulators and indicators are not saved.

Requirements: Floating hardware. approximately ZOO words
plus the matrix area are the storage requirements
General Description: Crwt" s Reduction

302

IBM 7070 Library Program Abstracts

Fj/tn~.
11.3.002
Available prior to January 1962

7070 MULTIPLE LINEAR REGRESSION BY THE STEPWISE METHOD

CONTRIBUTED BY;

R. E. Boss
Systems Engineer, Los Angeles Wilshire
Decelllber, 1960

SPECIFICA TrONS:

This program. provides m.eans, standard deviations
and silllple correlation coefficients for up to 40 variables. This is the lim.iting nUlllber of this version,
however, it can be extended by modifying the FORTRAN dbnension statement and recom.piling.
(Continued on next page)

B -

The program also provide!:; the standard error of
the estimate of the dependent variable, and a multiple correlation coeHicient. Each linear regression
equation expressc!:; a single "dependent" variable as
a function of up to 39 "independent" variables. The
standard error of each regreSSion coefficient is computed.

b.

Variables may be transformed if so desired.

Log Xi

(Code 1)
(Code 2)

Square Root Xl

(Code 3)

Natural log Xi

(Code 4)

(X.- I)

(Code 5)

The transfer routine occurs once per run, and iH approxirrlately 1 liZ minutes
for 130 variables.
The printout occurs at maximum print speed, and prints Z3 columns of the
matrix at a tinle. The column vectors of means and standard deviati.ons is
al.so printed. All output is to 3 decimal places.
d.

,

T.'

(X.)p

J

Any weight C,lll be applied to any ObBervation if BO
desired. If no ~pc\.:ilic weight is given, the observation
is iHisulned to have unit weight.

IBM 7070 Library Program Abstracts
7070 Intercorre1ation Matrix,

F!I~no.

11.3.003

Capa.bilities and Limitations: The pr')gram will handle up to 130 variables
(approx. 85 variables on a 5K machine) with the restriction that the maximum
sum of squares (treating the data as whole numbers) must be less than 10 10 •
The matrix is Idt in storage for furth~r analysis. if desired.

IBM 7070 Library Program Abstracts

Available prior to January 1962

Author:

Gary Lotto
University of Pittsburgh
ConlputatiolJ and Data Processing Center
University of Pittsburgh
Pittsburgh 13, Pennsylvania

A. W. Bendig

Machine Reguirements: The program is written for a 10K machine with
Hoating point hardware and 1 tape unit. rt may easily be modified to use a
5K n1.J.<.:hini:, and/or no fluating point h,udw.}rt: (by subrountint: simUlation)
with a subst:qul'nt reduction in the maximurn nUll"lber of variables that may
bt· handh:d and with a pU>:lsibl", reduction in the .1pced of a part of the
program. The amount of storage used is a fllno.:tion (If the nun"lbcr of
v~~rial.Jle" included.
Input is on tape. Output is printed or punched.

Purpose: To compute the eigenvalues and eigenvectors of a square
symmetric matrIx of size V.
b.

The lran"I<;;"r c0utilH" occur s once per run, and is approximately 1 1/2
I!lillutel'; for 130 vari.
General Description: Cumulation of sums, sums of squareli, and sums
of crOBS products proceeds i.n fixed pOint arithmetic at a speed relative to
the number of variables "pecificd, .l.nd to the nUlllber of digits in the ilV~ rage
observation of input da.ta. For 4 digits, 13U vari MONITOR SYSTEM.
A MONITOR PROGRAM COMPOSED OF SIX !61 MAJOR PROGRAMS.
REQUIRES A TWO CHANNEl 32K MACHINE, 7090 OR 709 WITH DATA
CHA~NEl TRAPS. NORMAL OPERATION USES NINE TAPES.
SUBMITTAL IS CONTAINED ON FIV.E IS! TAPES, A HIGH DENSITY
BINARY SYSTEM TAPE, TWO SYMBOLIC TAPES, AND TWO LISTING TAPES
CORR 1152

7090

109SWHV ISL

AVAILABLE PRIOR TO JANUARY 1962

VISCOSITY Of LIQUID WATER
COMPUTES VISCOSITY OF LIQUID .. CORR .. 1225

7090

I09SWHVISV

AVAILABLE PRIOR TO JANUARY 1962

VISCOSITY OF STEAM
COMPUTES VISCOSITY OF STEAM AS FUNCTION OF PRES .. AND TEMP ..
7090

l09'sWHHCL

AVAILABLE PRIOR TO JANUARY 1962

ENTHALPY AND ENTROPY OF COMPRESSED LIQUID
COMPUTES ENTHAlPY AND ENTROPY OF Cm1PRESSED L IOUIO AS
FUNCl'lONS Of PRESSURE AND TEMPERATURE

7090

109;5WHHSL

7090

7090

1095WHHSS

109.5WHSBE

AVAILABLE PRIOR TO JANUARY 1962

MINIMUM ERROR ROUTINE FOR STEAM TABLE DISTRIBUTION
ERROR FA-CItHY FOR WH STE'AM TABLES

AVAILABLE PRIOR TO JANUARY 1962
7090

ENTHALPY ENrROPY SPECIFIC VOLUME OF SUPERHEATED STEAM
COMPUTES ENTHALPY, ENTROPY, AND SPECIFIC VOLUME OF
SUPERHEATED STEAM AS FUNCTIONS OF PRESSURE AND TEMP ..

7090

AVAILABLE PRIOR TO JANUARY 1962

AVAILABLE PRI.OR TO JANUARY 1962

ENTHAlPY OF SATURATED LIQUID
COMPUTES ENTHALPY OF SAT .. LIQ .. AS FUNCT(ON OF TEMPERATURE

7090

1095WHVSl

SPECIFIC VOLU~E OF SATURATED LIQUID
COMPUTES SPEC .. VOL .. OF SAT. LIQ. AS FUNCTION OF TEMPERATURE

ID9.5WHHSV

1095WHOOS8

AVAILABLE PRIOR TO JANUARY 1962

THERMODYNAMIC PROPERTIES OF WATER AND STEAM
A COLLECTION OF FORTRAN TOPE SUBROUTINES TO ALLOW THE
COMPUTATLON OF VARIOUS THERMODYNAMIC PROPERTIES !ENTROPY.
ENTHALPY, TEMPERATURET PRESSURET SPECIFIC VOLUME. QUALITY,
AND VISCOSITYI OF STEAM AND WATER ON THE 709 OR 7090 ..

AVAILABLE PRIOR TO JANUARY 1962

ENTHALPY ENTROPY SPECIFIC VOLUME OF SATURATED VAPOR
COMPUTES ENTHALPY, 8NTROPY, SPECIFIC VOLUME f AND TEMPERATURE
OF SATURATED VAPOR AS FUNCTIONS OF PRESSURE

7090

llnAPMTTR

AVAILABLE PRIOR TO JANUARY 1962

MUL TI PtE T APE rEST ROUT I NE
THIS SElF LOADING ROUTINE CAN TEST UP TO 20 BLANK TAPES
AT ONE TIME USING EITHER OR B.OTH CHANNEl A AND CHANNEl B.
7090

109.5WH ISO

AVAILABLE PRIOR TO JANUARY 1962

I SENTROP LC PRESSURE CHANGE SUB ROUT INE
DETERMINES THE REMAINING VARIABLES IQUALITIES, SPECIFIC
VOLUMES, ENTHALPIES, ENTROPY, AND TEMPERATURES! AT THE
EXTREMETIES OF AN ISE'NTROPIC PROCESS GIVEN THE INLET AND
EXIT PRESSURES AND EITHER INLET TEMPERATURE OR INLET
ENTHALPY .. OPERATES LN SUPERHEATEO AND WET STEAM REGIONS OR
IN THE COMPRESSED tlQUlD REGION.

tBM

7090

PROGRAM

LIBRARY

ABSTRACT

. . . . . . . . . . ional
Division of North American Aviation, Inc.

Restrictions or Limitations:
A linear perturbation theory is used for the calculations of the
relative change in :eff'

(2) Computer: (Language)

7090i'0iiTRAW(3) Description of Code: (lndicotion of status, if known)
One-spoce dimension, 18 group diffusion theory calculation After calculotion
at t:cO, number of groups moy be reduced to I to 6 groups. First version of code
was primarily intended for fast reactor calculations, but later versions have
appeared for thermal calculations. In production, available.

(4) References:

"FORTRAN Nuclear Codes"

(Continued on next column)

311

S4 CYLINDRICAL GEOMETRY CELL CODE

7090 Nuclear Code

7090 Nuclear Code

Nuclear Code

(1)

Code Originated by;
Atomics International

(2)

Computer:
7090 (FORTRAN)

1.

(3)

Desc::-iption of Code:
This code solves the one_dimensional monoenergetic Boltzmann
eqtla~ion in cyliildrical geometry, using the S4 approximation.
In
additi.or. to th~ flux distribution, cell-averaged parameters are
computed. An input gues to the flux may be used or a diffusion
calculation may be performed to provide an initial guess. In
addition, when running multiple cases, the converged flux frolTI
the previous case may be used.

(4)

Restrictions or Limitations:
The present restrictions are 100 regions and 400 intervals.
these dimensions, a 32K memory is required.

TWENTY GRAND: The Twenty Grand Program
for the Numerical SolUtion of Few-Group Neutron
Diffusion Equations In Two Dimensions.

2.

Computer:

IBM 7090

3.

ABSTRACT:

The Twenty Grand program for the IBM 7090 is capable of solving
neutron diffusion problems in cylindrical or slab geometry for one
to six groups. Up to 3000 mesh points may be used. Neutron
transfer from any group to any other group is permitted. Leakage
in the third dimension in X-Y geometry may be treated by a buckling
which can vary with region and group. Three types of symmetry
conditions may be handled automatically. The zero flux, zero
derivative, and logarithmic boundary conditions are available.

With

(5)

Approximate Performance:
About IS seconds for a 50 mesh point problelTI.

(6)

References:
~ern.ple, "54 CYLINDRICAL GEOMETRY CELL CODE",
AMTD-IC'4, 1961.

(7)

Material Available;
1. AMTD-I04.
2. FORTRAN source deck.

TEMPEST

Name of Code:

7090 Nuclear Code

Nuclear Code

7090 Nuclear Code

1.

Name of Code:

WHIRLAWAY - A Three - Dimensional, Two Group
Neutron Diffusion Code for the IBM 7090 Computer.

2.

Computer:

IBM 7090

3.

ABSTRACT:

By making certain changes in two of the chain links of the Whirlaway
code, it may be used to calculate the flux distribution with a fixed
source in one region. The eigenvalue is kept at unity. While regions
with flux-dependent sources are permitted, they must not be adjacent
to the one fixed-source region. Corrected values for the sample
problem given in ORNL-3150 are also included.

(1) Code Originated by:
Atomics International
Division of North American Aviation, Inc.
(2) ComplJter: (language)
769OTFCiRT~

7090 Nuclear Code

(3) Des.cription of Code: (Indicated statlJ;', if known)
Thermal cross-section, Wigner-Wilkins or Wigner eqlJotiom.
lJse,ovailable

111
(I)

Code Originated by:
Aerojet-General N..lclecnics

(2)

Compu~

(3)

Description of Corle:
The .!.DXY program spl',es the homogpnc01;s or inhomogeneous multigrC''..lp transport e-ll;at.:or. ;n xY !ft.omt,t::-y. Vacuum, surface source, or
reflr.ct::r.g bOl:ndary ccndW.o!".s are a':':":,labit, as options. In the homogenr.o·... s case the user may reql;est the comp.... tation of reactivity,
period, critical cor.centrations of S01ne composi.tion or the critical
thickness of a zone. The Sn approximation is used.

(4) R
Source Exif Data: 
File Type                       : PDF
File Type Extension             : pdf
MIME Type                       : application/pdf
PDF Version                     : 1.3
Linearized                      : No
XMP Toolkit                     : Adobe XMP Core 4.2.1-c043 52.372728, 2009/01/18-15:56:37
Producer                        : Adobe Acrobat 9.13 Paper Capture Plug-in
Modify Date                     : 2009:10:12 17:37:04-07:00
Create Date                     : 2009:10:12 17:37:04-07:00
Metadata Date                   : 2009:10:12 17:37:04-07:00
Format                          : application/pdf
Document ID                     : uuid:e0ed7034-12c8-423c-9e3b-a9c06756d2bd
Instance ID                     : uuid:40ad1d6d-6e68-400f-964c-d09c7a13e178
Page Layout                     : SinglePage
Page Mode                       : UseNone
Page Count                      : 319

EXIF Metadata provided by EXIF.tools