Searcharxiv⌕ Search

arXiv subjects

John A. Nairn

Publications and source records attributed to John A. Nairn.

2 recordsLinked to original sources

Improved Implementation of Approximate Full Mass Matrix Inverse Methods into Material Point Method Simulations

Approximate full mass matrix methods for the material point method, known as FMPM(k) of order k, can improve the calculation of grid velocities from grid momentum. It can be implemented in any MPM code by inserting a new calculation task whenever grid velocities are needed. The implementation recommended in this paper only needs these calculations once per time step just before when updating particle positions and velocities. FMPM implementation issues arise, however, when its methods are mixed with other MPM feature that rely on lumped mass calculations. Some common lumped-mass MPM features are grid-based, velocity boundary condition, multimaterial contact calculations, crack contact calculations, and imperfect interfaces. This paper first derives a revised FMPM(k) implementation that both simplifies and clarifies the "FMPM Loop" that can be added to MPM codes. Next, that loop is modified to allow FMPM(k) to work well even in simulations that need other MPM features that previously caused conflicts. Two other FMPM(k) issues are apparent loss of stability at very higher order k and inherent computational cost. These issues are discussed in an analysis of temporal stability as a function of order k and in consideration of options to improve efficiency.

cs.CE↗

Exact Calculation of Expected Values for Splitting Pairs in Blackjack

Computer calculations for most exact expected values in blackjack have been available since the 1960's, but exact results for pair splitting and resplitting have previously been too computer intensive. This paper describes a new algorithm for exact pair-splitting. By using dealer probability caching methods and revising the method for recursively generating possible player hands, the estimated calculation time compared to standard methods was reduced by five orders of magnitude. The resulting algorithm was used to calculate the first exact and complete pair splitting results for a single deck game. The exact results were compared to prior approximate theories for resplitting. The prior theories are accurate for many calculations, but inaccurate for resplitting tens. A new approximation method was developed that is accurate for all resplitting calculations.

cs.OH↗