Ongoing verification of a multiphysics community code: FLASH

When developing a complex, multi‐authored code, daily testing on multiple platforms and under a variety of conditions is essential. It is therefore necessary to have a regression test suite that is easily administered and configured, as well as a way to easily view and interpret the test suite results. We describe the methodology for verification of FLASH, a highly capable multiphysics scientific application code with a wide user base. The methodology uses a combination of unit and regression tests and an in‐house testing software that is optimized for operation under limited resources. Although our practical implementations do not always comply with theoretical regression‐testing research, our methodology provides a comprehensive verification of a large scientific code under resource constraints.Copyright © 2013 John Wiley & Sons, Ltd.     

VISIM: Sequential simulation for linear inverse problems

Linear inverse Gaussian problems are traditionally solved using least squares-based inversion. The center of the posterior Gaussian probability distribution is often chosen as the solution to such problems, while the solution is in fact the posterior Gaussian probability distribution itself. We present an algorithm, based on direct sequential simulation, which can be used to efficiently draw samples of the posterior probability distribution for linear inverse problems. There is no Gaussian restriction on the distribution in the model parameter space, as inherent in traditional least squares-based algorithms.As data for linear inverse problems can be seen as weighed linear averages over some volume, block kriging can be used to perform both estimation (i.e. finding the center of the posterior Gaussian pdf) and simulation (drawing samples of the posterior Gaussian pdf). We present the kriging system which we use to implement a flexible GSLIB-based algorithm for solving linear inverse problems.We show how we implement such a simulation program conditioned to linear average data. The program is called VISIM as an acronym for Volume average Integration SIMulation. An effort has been made to make the program efficient, even for larger scale problems, and the computational efficiency and accuracy of the code is investigated.Using a synthetic cross-borehole tomography case study, we show how the program can be used to generate realizations of the a posteriori distributions (i.e. solutions) from a linear tomography problem. Both Gaussian and non-Gaussian a priori model parameter distributions are considered.     

Grouping Techniques for Scheduling Problems: Simpler and Faster

In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two different scheduling problems: scheduling on unrelated parallel machines with costs and the job shop scheduling problem. The time complexity of the resulting approximation schemes is always linear in the number n of jobs, and the multiplicative constant hidden in the O(n) running time is reasonably small and independent of the error ε. Supported by Swiss National Science Foundation project 200020-109854, “Approximation Algorithms for Machine scheduling Through Theory and Experiments II”. A preliminary version of this paper appeared in the Proceedings of ESA’01.     

Directed model checking with distance-preserving abstractions

In directed model checking, the traversal of the state space is guided by an estimate of the distance from the current state to the nearest error state. This paper presents a distance-preserving abstraction for concurrent systems that allows one to compute an interesting estimate of the error distance without hitting the state explosion problem. Our experiments show a dramatic reduction both in the number of states explored by the model checker and in the total runtime.     

Computing presentations for subgroups of polycyclic groups and of context-free groups

Algorithms for solving uniform decision problems for algebraic structures crucially depend on the chosen finite presentations for the structures under consideration. Rewriting techniques have been used very successfully to solve uniform decision problems, when the presentations considered involve finite, noetherian, and ()-confluent rewriting systems. Whenever the class of algebraic structures considered is closed under the operation of taking finitely generated substructures, then the algorithms for solving the uniform decision problems can be applied to the substructures as well. However, since these algorithms depend on the form of the presentations, this involves the task of constructing a presentation of a certain form for a substructure given a presentation of this form for the structure itself and a finite set of generating elements for the substructure.This problem, which has received a lot of attention in algebra, is here investigated from an algorithmic point of view. The structures considered are the following two classes of groups, which have been studied extensively before: the polycyclic groups and the context-free groups.Finitely generated context-free groups can be presented by finite, monadic, and -confluent string-rewriting systems. Due to their nice algorithmic properties these systems provide a way to effectively solve many decision problems for context-free groups. Since finitely generated subgroups of context-free groups are again contextfree, they can be presented in the same way. Here we describe a process that, from a finite, monadic, and -confluent string-rewriting system presenting a context-free groupG and a finite subsetU ofG, determines a presentation of this form for the subgroup U ofG that is generated byU. For finitely presented polycyclic groups we obtain an analogous result, when we use finite confluent PCP2-presentations to describe these groups.This work was performed while this author was visiting at the Fachbereich Informatik, Universität Kaiserslautern, during his sabbatical 1991/92     

Probabilistic calibration of discrete element simulations using the sequential quasi-Monte Carlo filter

The calibration of discrete element method (DEM) simulations is typically accomplished in a trial-and-error manner. It generally lacks objectivity and is filled with uncertainties. To deal with these issues, the sequential quasi-Monte Carlo (SQMC) filter is employed as a novel approach to calibrating the DEM models of granular materials. Within the sequential Bayesian framework, the posterior probability density functions (PDFs) of micromechanical parameters, conditioned to the experimentally obtained stress–strain behavior of granular soils, are approximated by independent model trajectories. In this work, two different contact laws are employed in DEM simulations and a granular soil specimen is modeled as polydisperse packing using various numbers of spherical grains. Knowing the evolution of physical states of the material, the proposed probabilistic calibration method can recursively update the posterior PDFs in a five-dimensional parameter space based on the Bayes’ rule. Both the identified parameters and posterior PDFs are analyzed to understand the effect of grain configuration and loading conditions. Numerical predictions using parameter sets with the highest posterior probabilities agree well with the experimental results. The advantage of the SQMC filter lies in the estimation of posterior PDFs, from which the robustness of the selected contact laws, the uncertainties of the micromechanical parameters and their interactions are all analyzed. The micro–macro correlations, which are byproducts of the probabilistic calibration, are extracted to provide insights into the multiscale mechanics of dense granular materials.     

Discrete modeling of sand–tire mixture considering grain-scale deformability

Mixing sand or soil with small pieces of tire is common practice in civil engineering applications. Although the properties of the soil are changed, it is environmentally friendly and sometimes economical. Nevertheless, the mechanical behavior of such mixtures is still not fully understood and more numerical investigations are required. This paper presents a novel approach for the modeling of sand–tire mixtures based on the discrete element method. The sand grains are represented by rigid agglomerates whereas the tire grains are represented by deformable agglomerates. The approach considers both grain shape and deformability. The micromechanical parameters of the contact law are calibrated based on experimental results from the literature. The effects of tire content and confining pressure on the stress–strain response are investigated in detail by performing numerical triaxial compression tests. The main results indicate that both strength and stiffness of the samples decrease with increasing tire content. A tire contact of 40% is identified as the boundary between rubber-like and sand-like behavior.