NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Search Publications

NIST Authors in Bold

Displaying 426 - 450 of 473

Algorithms and Codes for the Macdonald Function: Recent Progress and Comparisons

February 1, 2003
Author(s)
B R. Fabijonas, Daniel W. Lozier, J M. Rappoport
The modified Bessel function K iŅχ, also known as the Macdonald function, finds application in the Kontorovich-Lebedev integral transform when χ and Ņ are real and positive. In this paper, a comparison of three codes for computing this function is made

Dealing with Degeneracy in Triangulation

November 1, 2002
Author(s)
Francis Sullivan, Isabel M. Beichl
This is a tutorial article on a quick method for dealing with degeneracy in geometric computations with specific reference to triangulation. The type degeneracy targeted by this article that of four or more points on a circle and five or more points on a

Reconstructing Images of Bar Codes for Construction Site Object Recognition

September 1, 2002
Author(s)
David E. Gilsinn, Geraldine S. Cheok, Dianne M. O'Leary
This paper discusses a general approach to reconstructing ground truth intensity images of bar codes that have been distorted by LADARoptics. The first part of this paper describes the experimental data collection of several bar code images along with

The Relegation Algorithm

March 3, 2001
Author(s)
A Deprit, E Deprit, Jesuus Palacian
Given a perturbed Hamiltonian system, normalization yields a Lie transformation which converts the main part of the Hamiltonian into an integral of the transformed system. An extension of the normalization method--the relegation algorithm--does the same

Constructing Sibson Elements for a Rectangular Mesh

February 1, 2001
Author(s)
David E. Gilsinn
This paper documents the construction of a finite element, called the Sibson element. The shape function of this element is formed on rectangular grids by C 1 splines defined on a triangulation of each subrectangle by dividing it into four subtriangles

Analytic Continuation, Singular Value Expansions, and Kramers-Kronig Analysis

January 17, 2001
Author(s)
Andrew M. Dienstfrey, L Greengard
We describe a systematic approach to the recovery of a function analytic in the upper half plane, ${\bfC:^+$, from measurements over a finite interval on the real axis, $D\subset {\bfR}$. Analytic continuation problems of this type are well-known to ill

Direct Blind Deconvolution II. Substitute Images and the Beak Method

November 1, 2000
Author(s)
Alfred S. Carasso
The BEAK method is an FFT-based direct blind deconvolution technique previously introduced by the author, and applied to a limited but significant class of blurs that can be expressed as convolutions of 2-D symmetric L vy probability density functions

Attractors, Chain Transitive Sets and Invariant Measures

September 15, 2000
Author(s)
Fern Y. Hunt
This paper discusses an easy to implement procedure for approximating the long time behavior of iterates of maps. Applications include to finding the roots of a complex polynomial and approximating attractors. The method uses the theory of Markov chains.

Zoltan: Data-Management Services For Parallel Applications Developer's Guide

June 30, 2000
Author(s)
K Devine, B Hendrickson, E Boman, M St. John, C Vaughan, William F. Mitchell
The Zoltan Dynamic Load-Balancing Library provides critical capability to a number of parallel applications. Zoltan includes a suite of algorithms for dynamically computing partitions of problems over sets of processors; geometric, tree-based and graph

Zoltan: Data-Management Services For Parallel Applications; User's Guide

June 30, 2000
Author(s)
K Devine, B Hendrickson, E Boman, M St. John, C Vaughan, William F. Mitchell
The Zoltan Dynamic Load-Balancing Library provides critical capability to a number of parallel applications. Zoltan includes a suite of algorithms for dynamically computing partitions of problems over sets of processors; geometric, tree-based and graph

On the Bifurcation From Continuous to Segmented Chip Formation in Metal Cutting

February 6, 2000
Author(s)
Timothy J. Burns, Matthew A. Davies, Christopher J. Evans
We describe a new approach to modeling chip formation in orthogonal machining. Metal cutting is interpreted as a nonlinear dynamical process with thermomechanical feedback, which is similar in many ways to an open chemical reactor. As the cutting speed is

The DLMF Project: A New Initiative in Classical Special Functions

June 1, 1999
Author(s)
Daniel W. Lozier
NIST (formerly, National Bureau of Standards) has started an ambitious project that aims to produce a successor to Abramowitz and Stegun's {\em Handbook of Mathematical Functions}, published by the National Bureau of Standards in 1964 and reprinted by

Stable Quasicrystalline Sphere Packing

March 1, 1999
Author(s)
Eric J. Cockayne, M Mihalkovic
Wills (1990, J. Phys., Paris 51, 1061), found a method relating certain decagonal disk packings to decagonal sphere packings with high packing fractions. Applying this technique to the decagonal rectangle-triangle tiling generated by inflation, we obtain a
Displaying 426 - 450 of 473
Was this page helpful?