Large‐scale eigenvalue calculations for stability analysis of steady flows on massively parallel computers

This paper presents an approach for determining the linear stability of steady states of partial differential equations (PDEs) on massively parallel computers. Linearizing the transient behavior around a steady state solution leads to an eigenvalue problem. The eigenvalues with the largest real part are calculated using Arnoldi's iteration driven by a novel implementation of the Cayley transformation. The Cayley transformation requires the solution of a linear system at each Arnoldi iteration. This is done iteratively so that the algorithm scales with problem size. A representative model problem of three‐dimensional incompressible flow and heat transfer in a rotating disk reactor is used to analyze the effect of algorithmic parameters on the performance of the eigenvalue algorithm. Successful calculations of leading eigenvalues for matrix systems of order up to 4 million were performed, identifying the critical Grashof number for a Hopf bifurcation. Copyright © 2001 John Wiley & Sons, Ltd.     

Ultrasonic detection of the pinning of dislocations by point defects in lead—II. Model for dislocation defect interaction

Experiments are presented to establish that irradiation produced defects in lead not only pin dislocations but also can be trapped at the ends of dislocation lines in agreement with the model proposed by Thompson, Buck, Huntington and Barnes. This model indicates that there is a temperature T^* at which there is a maximum pinning of dislocations. T^* is found to be near 140 K. The data of Part I are analyzed according to this model using reasonable values of the dislocation density and the binding energy of the defect in the trap. The resulting activation energy for the region A process in the reaction kinetics model is found to be 0.15 eV which is consistent with the value found from an eigenvalue expansion model.     

Implementation of the Jacobian-free Newton–Krylov method for solving the first-order ice sheet momentum balance

We have implemented the Jacobian-free Newton–Krylov (JFNK) method for solving the first-order ice sheet momentum equation in order to improve the numerical performance of the Glimmer-Community Ice Sheet Model (Glimmer-CISM), the land ice component of the Community Earth System Model (CESM). Our JFNK implementation is based on significant re-use of existing code. For example, our physics-based preconditioner uses the original Picard linear solver in Glimmer-CISM. For several test cases spanning a range of geometries and boundary conditions, our JFNK implementation is 1.8–3.6 times more efficient than the standard Picard solver in Glimmer-CISM. Importantly, this computational gain of JFNK over the Picard solver increases when refining the grid. Global convergence of the JFNK solver has been significantly improved by rescaling the equation for the basal boundary condition and through the use of an inexact Newton method. While a diverse set of test cases show that our JFNK implementation is usually robust, for some problems it may fail to converge with increasing resolution (as does the Picard solver). Globalization through parameter continuation did not remedy this problem and future work to improve robustness will explore a combination of Picard and JFNK and the use of homotopy methods.     

Bit-parallel -matching and suffix automata

(δ,γ)-matching is a string matching problem with applications to music retrieval. The goal is, given a pattern P_1…m and a text T_1…n on an alphabet of integers, find the occurrences P^′ of the pattern in the text such that (i) , and (ii) . The problem makes sense for δγδm. Several techniques for (δ,γ)-matching have been proposed, based on bit-parallelism or on skipping characters. We first present an O(mnlog(γ)/w) worst-case time and O(n) average-case time bit-parallel algorithm (being w the number of bits in the computer word). It improves the previous O(mnlog(δm)/w) worst-case time algorithm of the same type. Second, we combine our bit-parallel algorithm with suffix automata to obtain the first algorithm that skips characters using both δ and γ. This algorithm examines less characters than any previous approach, as the others do just δ-matching and check the γ-condition on the candidates. We implemented our algorithms and drew experimental results on real music, showing that our algorithms are superior to current alternatives with high values of δ.     

Energy dependence of multiplicity in proton-nucleus collisions and models of multiparticle production

This is a continuation of our earlier investigation (Gurtuet al 1974Phys. Lett. 50 B 391) on multiparticle production in proton-nucleus collisions based on an exposure of emulsion stack to 200 GeV/c beam at the NAL. It is found that the ratioR _em = 〈n _s〉/〈n _ch〉, where 〈n _ch〉 is the charged particle multiplicity in pp-collisions, increases slowly from about 1 at 10 GeV/c to 1·6 at 68 GeV/c and attains a constant value of 1·71 ± 0·04 in the region 200 to 8000 GeV/c. Furthermore,R _em = 1·71 implies an effectiveA-dependence ofR _A =A ^0.18,i.e., a very weak dependence. Predictions ofR _em on various models are discussed and compared with the emulsion data. Data seem to favour models of hadron-nucleon collisions in which production of particles takes place through adouble step mechanism,e.g., diffractive excitation, hydrodynamical and energy flux cascade as opposed to models which envisage instantaneous production.