Serial/Series Title
Year
Month
6 Matching Results
Results open in a new window/tab.
Results:
1 - 6 of
6
LAPACK Working Note #5 : Provisional Contents
Report on the proposed computational routines in LAPACK, describing a naming scheme for the routines, enumerates the individual routines, and includes notes on the choice of algorithms and discusses aspects of software design.
Date:
September 1988
Creator:
Bischof, Chris; Demmel, James; Dongarra, Jack; Du Croz, Jeremy; Greenbaum, Anne; Hammarling, Sven et al.
System:
The UNT Digital Library
Users' Guide to Toolpack/1 Tools for Data Dependency Analysis and Program Transformation
A guide to the use of a collection of software tools for data dependency analysis and program transformation, written in Fortran and for a Unix environment.
Date:
September 1988
Creator:
Cowell, Wayne R.
System:
The UNT Digital Library
X-Ray Computed Tomography for Nondestructive Evaluation of Advanced Structural Ceramics
Report on the current status of X-ray computed tomography and the principal advantages of CT scanning.
Date:
September 1988
Creator:
Ellingson, William A. & Vannier, Michael W.
System:
The UNT Digital Library
Proceedings of the Focused Research Program on Spectral Theory and Boundary Value Problems, Vol. 2: Singular Differential Equations
Report on research and exchange of views among 24 mathematicians for investigations of the theory of singular Sturm-Liouville equations, the asymptotic analysis of the Titchmarsh-Weyl m(λ)-coefficient, and the qualitative theory of non-linear differential equations.
Date:
September 1988
Creator:
Kaper, H. G.; Kwong, Man Kam & Zettl, Anton
System:
The UNT Digital Library
Operational Health Physics Training
Report is an update to 1965 publication regarding on-the-job monitoring training for Health Physics technicians.
Date:
September 1988
Creator:
Moe, H. J. & Vallario, Edward J.
System:
The UNT Digital Library
Searching for Fixed Point Combinators by Using Automated Theorem Proving : a Preliminary Report
In this report, we establish that the use of an automated theorem- proving program to study deep questions from mathematics and logic is indeed an excellent move. Among such problems, we focus mainly on that concerning the construction of fixed point combinators--a problem considered by logicians to be significant and difficult to solve, and often computationally intensive and arduous. To be a fixed point combinator, THETA must satisfy the equation THETAx = x(THETAx) for all combinators x. The specific questions on which we focus most heavily ask, for each chosen set of combinators, whether a fixed point combinator can be constructed from the members of that set. For answering questions of this type, we present a new, sound, and efficient method, called the kernel method, which can be applied quite easily by hand and very easily by an automated theorem-proving program. For the application of the kernel method by a theorem-proving program, we illustrate the vital role that is played by both paramodulation and demodulation--two of the powerful features frequently offered by an automated theorem-proving program for treating equality as if it is ''understood.'' We also state a conjecture that, if proved, establishes the completeness of the kernel method. From …
Date:
September 1988
Creator:
Wos, Larry
System:
The UNT Digital Library