16 research outputs found

    Nuclear rocket shielding methods, modification, updating, and input data preparation. Volume 5 - Two-dimensional, discrete ordinates transport technique Final progress report

    Get PDF
    Two dimensional, discrete ordinates transport technique for use with nuclear rocket shielding methods, modification, updating, and data input preparation - Vol.

    Nuclear rocket shielding methods, modification, updating, and input data preparation. Volume 1 - Synopsis of methods and results of analysis Final progress report

    Get PDF
    Analysis of data systems and computer programs for nuclear rocket shielding methods, modification, updating, and data input preparation - Vol.

    JOFIT--A LEAST SQUARES BESSEL Jsub0sub 0 FITTING PROGRAM FOR THE IBM-704 COMPUTER

    No full text
    The JOFIT code fits, by a least squares technique, the curve y = A J/sub o/STAB(x-C)! from 4 to 500 points of observed data, computing the parameters A, B, C and the standard deviation of the final values of A, B, C, i.e., S/sub A/, S/ sub B/, S/sub C/. 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 this neighborhood. Typical computing and editing time for a 50 point problem is 2 minutes. Any size IBM-704 computer is adequate, and drums and tapes are not used. (auth

    DARED-1--AN IBM-704 PROGRAM FOR REDUCING DATA FROM FOIL IRRADIATION AND FITTING BY LEAST SQUARES TO BESSEL Jsub0sub 0 OR COSINE FUNCTION

    No full text
    A description is given of a code for the IBM-704 computer which reduces and fits by least squares the measurements of radioactivity of a sequence of foils. Corrections for background, counter deadtime, foil weight, and radioactive decay are applied, and readings outside a specified range are rejected. Errors due to statistical fluctuations are computed and off-center ordinates are calculated. Reduced data are then fitted by least squares to the best value of the arguments of Bessel J/sub o/ or cosine functions. Up to 100 foils in a sequence can be handled, and decay times up to 999 min can be accommodated. An IBM-704 computer having 8192 words of core storage is required. No drums or tapes are needed. Running time for a typical 50 point problem involving data reduction alone is 2 min. With least squares fitting, the same problem would require 4 min. (auth

    Annual report for contract year 1969. Supporting research and technology, Project 493

    No full text
    corecore