NASA Scientific and Technical Aerospace Reports
NASA Scientific and Technical Aerospace Reports
NASA Scientific and Technical Aerospace Reports
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
heat transfer problems, the initial condition may have to be approximated. Also, if the parabolic problem is proposed on a<br />
multi-dimensional region, the parameter alpha, for most cases, would be difficult to compute exactly even in the case that the<br />
initial condition is known exactly. The second objective of this proposed research is to establish a method to estimate this<br />
parameter. This will be done by computing two discontinuous Galerkin approximate solutions at two different time steps<br />
starting from the initial time <strong>and</strong> use them to derive alpha. (3) The third objective is to consider the heat transfer problem over<br />
a two dimensional thin plate. The technique developed by Vogelius <strong>and</strong> Babuska will be used to establish a discontinuous<br />
Galerkin method in which the p-element will be used for through thickness approximation. This h-p finite element approach,<br />
that results in a dimensional reduction method, was used for elliptic problems, but the application appears new for the<br />
parabolic problem. The dimension reduction method will be discussed together with the time discretization method.<br />
Author (revised)<br />
Error Analysis; Galerkin Method; Parabolic Differential Equations<br />
20040073529 California Inst. of Tech., Pasadena, CA, USA<br />
Dynamical Chaos in the Wisdom-Holman Integrator: Origins <strong>and</strong> Solutions<br />
Rauch, Kevin P.; Holman, Matthew; The Astronomical Journal; 1999; Volume 117, pp. 1087-1102; In English<br />
Contract(s)/Grant(s): NAG5-10365; Copyright; Avail: Other Sources; Abstract Only<br />
We examine the nonlinear stability of the Wisdom-Holman (WH) symplectic mapping applied to the integration of<br />
perturbed, highly eccentric (e-0.9) two-body orbits. We find that the method is unstable <strong>and</strong> introduces artificial chaos into the<br />
computed trajectories for this class of problems, unless the step size chosen 1s small enough that PeriaPse is always resolved,<br />
in which case the method is generically stable. This ‘radial orbit instability’ persists even for weakly perturbed systems. Using<br />
the Stark problem as a fiducial test case, we investigate the dynamical origin of this instability <strong>and</strong> argue that the numerical<br />
chaos results from the overlap of step-size resonances; interestingly, for the Stark-problem many of these resonances appear<br />
to be absolutely stable. We similarly examine the robustness of several alternative integration methods: a time-regularized<br />
version of the WH mapping suggested by Mikkola; the potential-splitting (PS) method of Duncan, Levison, Lee; <strong>and</strong> two<br />
original methods incorporating approximations based on Stark motion instead of Keplerian motion. The two fixed point<br />
problem <strong>and</strong> a related, more general problem are used to conduct a comparative test of the various methods for several types<br />
of motion. Among the algorithms tested, the time-transformed WH mapping is clearly the most efficient <strong>and</strong> stable method<br />
of integrating eccentric, nearly Keplerian orbits in the absence of close encounters. For test particles subject to both high<br />
eccentricities <strong>and</strong> very close encounters, we find an enhanced version of the PS method-incorporating time regularization,<br />
force-center switching, <strong>and</strong> an improved kernel function-to be both economical <strong>and</strong> highly versatile. We conclude that<br />
Stark-based methods are of marginal utility in N-body type integrations. Additional implications for the symplectic integration<br />
of N-body systems are discussed.<br />
Author<br />
Eccentric Orbits; Chaos; Robustness (Mathematics); Many Body Problem; Kernel Functions<br />
20040073569 Naval Postgraduate School, Monterey, CA<br />
Sensitivity Analysis for an Assignment Incentive Pay in the U.S. Navy Enlisted Personnel Assignment Process in a<br />
Simulation Environment<br />
Logemann, Karsten; Mar. 2004; 90 pp.; In English; Original contains color illustrations<br />
Report No.(s): AD-A422386; No Copyright; Avail: CASI; A05, Hardcopy<br />
The enlisted personnel assignment process is a major part in the USA Navy’s Personnel Distribution system. It ensures<br />
warfighters <strong>and</strong> supporting activities receive the right sailor with the right training to the right billet at the right time (R4) <strong>and</strong><br />
is a critical element in meeting the challenges of Seapower 21 <strong>and</strong> Global CONOPS. In order to attain these optimal goals<br />
the ways-to-do-it need to be customer-centered <strong>and</strong> should optimize both, the Navy’s needs <strong>and</strong> the sailor’s interests. Recent<br />
studies <strong>and</strong> a detailing pilot in 2002 used a web-based marketplace with two- sided matching mechanisms to accomplish this<br />
vision. This research examines the introduction of an Assignment Incentive Pay (AlP) as part of the U,S, Navy’s enlisted<br />
personnel assignment process in a simulation environment. It uses a previously developed simulation tool, including the<br />
Deferred Acceptance (DA) <strong>and</strong> the Linear Programming (LP) matching algorithm to simulate the assignment process. The<br />
results of the sensitivity analysis suggested that the Navy should mainly emphasize sailor quality rather than saving AIP funds<br />
in order to maximize utility <strong>and</strong> the possible matches When adopting such an introduction policy also the percentage of<br />
unstable matches under the LP as the matching algorithm was reduced.<br />
DTIC<br />
Algorithms; Billets; Incentives; Navy; Personnel; Sensitivity Analysis; Simulation<br />
218