A numerical study of large sparse matrix exponentials arising in Markov chains

Krylov subspace techniques have been shown to yield robust methods for the numerical computation of large sparse matrix exponentials and especially the transient solutions of Markov Chains. The attractiveness of these methods results from the fact that they allow us to compute the action of a matrix exponential operator on an operand vector without having to compute, explicitly, the matrix exponential in isolation. In this paper we compare a Krylov-based method with some of the current approaches used for computing transient solutions of Markov chains. After a brief synthesis of the features of the methods used, wide-ranging numerical comparisons are performed on a power challenge array supercomputer on three different models. (C) 1999 Elsevier Science B.V. All rights reserved.AMS Classification: 65F99; 65L05; 65U05.

Similitude applied to centrifugal scaling of unsaturated flow

Centrifuge experiments modeling single-phase flow in prototype porous media typically use the same porous medium and permeant. Then, well-known scaling laws are used to transfer the results to the prototype. More general scaling laws that relax these restrictions are presented. For permeants that are immiscible with an accompanying gas phase, model-prototype (i.e., centrifuge model experiment-target system) scaling is demonstrated. Scaling is shown to be feasible for Miller-similar (or geometrically similar) media. Scalings are presented for a more, general class, Lisle-similar media, based on the equivalence mapping of Richards' equation onto itself. Whereas model-prototype scaling of Miller-similar media can be realized easily for arbitrary boundary conditions, Lisle-similarity in a finite length medium generally, but not always, involves a mapping to a moving boundary problem. An exception occurs for redistribution in Lisle-similar porous media, which is shown to map to spatially fixed boundary conditions. Complete model-prototype scalings for this example are derived.

5th International Symposium on Applied Isotope Geochemistry - Preface

Selected Papers from the 5th International Symposium on Applied Isotope Geochemistry, Heron Island, Great Barrier Reef, Australia, 26–30 May 2003

Unitary R-matrices for topological quantum computing

The main problem with current approaches to quantum computing is the difficulty of establishing and maintaining entanglement. A Topological Quantum Computer (TQC) aims to overcome this by using different physical processes that are topological in nature and which are less susceptible to disturbance by the environment. In a (2+1)-dimensional system, pseudoparticles called anyons have statistics that fall somewhere between bosons and fermions. The exchange of two anyons, an effect called braiding from knot theory, can occur in two different ways. The quantum states corresponding to the two elementary braids constitute a two-state system allowing the definition of a computational basis. Quantum gates can be built up from patterns of braids and for quantum computing it is essential that the operator describing the braiding-the R-matrix-be described by a unitary operator. The physics of anyonic systems is governed by quantum groups, in particular the quasi-triangular Hopf algebras obtained from finite groups by the application of the Drinfeld quantum double construction. Their representation theory has been described in detail by Gould and Tsohantjis, and in this review article we relate the work of Gould to TQC schemes, particularly that of Kauffman.

Calculating current densities and fields produced by shielded magnetic resonance imaging probes

A method is presented for computing the fields produced by radio frequency probes of the type used in magnetic resonance imaging. The effects of surrounding the probe with a shielding coil, intended to eliminate stray fields produced outside the probe, are included. An essential feature of these devices is the fact that the conducting rungs of the probe are of finite width relative to the coil radius, and it is therefore necessary to find the distribution of current within the conductors as part of the solution process. This is done here using a numerical method based on the inverse finite Hilbert transform, applied iteratively to the entire structure including its shielding coils. It is observed that the fields are influenced substantially by the width of the conducting rungs of the probe, since induced eddy currents within the rungs become more pronounced as their width is increased. The shield is also shown to have a significant effect on both the primary current density and the resultant fields. Quality factors are computed for these probes and compared with values measured experimentally.

Magnesium in tropical and subtropical soils from north-eastern Australia .2. Response by glasshouse-grown maize to applied magnesium

A glasshouse trial, in which maize (Zea mays L. cv. Pioneer 3270) was grown in 35 north-eastern Australian soils of low magnesium (Mg) status, was undertaken to study the response to applied Mg. Of the soils studied, 20 were strongly acidic (pH(1:5 soil:water) <5.4), and in these soils the response to Mg was studied in both the presence and absence of lime. Magnesium application significantly (P < 0.05) increased dry matter yield in 10 soils, all of which were strongly acidic. However, significant Mg responses were recorded in 6 soils in the presence of lime, indicating that, in many situations, liming strategies may need to include consideration of Mg nutrition. Critical soil test values for 90% relative yield were 0.21 cmol(+)/kg of exchangeable Mg or 7% Mg saturation, whilst the critical (90% yield) plant tissue Mg concentration (whole shoots) was 0.15%.

Rapid computation of static fields produced by thick circular solenoids

A straightforward method is proposed for computing the magnetic field produced by a circular coil that contains a large number of turns wound onto a solenoid of rectangular cross section. The coil is thus approximated by a circular ring containing a continuous constant current density, which is very close to the real situation when sire of rectangular cross section is used. All that is required is to evaluate two functions, which are defined as integrals of periodic quantities; this is done accurately and efficiently using trapezoidal-rule quadrature. The solution can be obtained so rapidly that this procedure is ideally suited for use in stochastic optimization, An example is given, in which this approach is combined with a simulated annealing routine to optimize shielded profile coils for NMR.

Integer matrix diagonalization

We consider algorithms for computing the Smith normal form of integer matrices. A variety of different strategies have been proposed, primarily aimed at avoiding the major obstacle that occurs in such computations-explosive growth in size of intermediate entries. We present a new algorithm with excellent performance. We investigate the complexity of such computations, indicating relationships with NP-complete problems. We also describe new heuristics which perform well in practice. Wie present experimental evidence which shows our algorithm outperforming previous methods. (C) 1997 Academic Press Limited.

Asymmetric page split generalized index search trees for formal concept analysis

Formal Concept Analysis is an unsupervised machine learning technique that has successfully been applied to document organisation by considering documents as objects and keywords as attributes. The basic algorithms of Formal Concept Analysis then allow an intelligent information retrieval system to cluster documents according to keyword views. This paper investigates the scalability of this idea. In particular we present the results of applying spatial data structures to large datasets in formal concept analysis. Our experiments are motivated by the application of the Formal Concept Analysis idea of a virtual filesystem [11,17,15]. In particular the libferris [1] Semantic File System. This paper presents customizations to an RD-Tree Generalized Index Search Tree based index structure to better support the application of Formal Concept Analysis to large data sources.