An efficient approximate factorization implicit scheme for the equations of gasdynamics

An efficient implicit finite-difference algorithm for the gas dynamic equations utilizing matrix reduction techniques is presented. A significant reduction in arithmetic operations is achieved while maintaining the same favorable stability characteristics and generality found in the Beam and Warming approximate factorization algorithm. Steady-state solutions to the conservative Euler equations in generalized coordinates are obtained for transonic flows about a NACA 0012 airfoil. The theoretical extension of the matrix reduction technique to the full Navier-Stokes equations in Cartesian coordinates is presented in detail. Linear stability, using a Fourier stability analysis, is demonstrated and discussed for the one-dimensional Euler equations. It is shown that the method offers advantages over the conventional Beam and Warming scheme and can retrofit existing Beam and Warming codes with minimal effort

Inductive Algebras for Finite Heisenberg Groups

A characterization of the maximal abelian sub-algebras of matrix algebras that are normalized by the canonical representation of a finite Heisenberg group is given. Examples are constructed using a classification result for finite Heisenberg groups.Comment: 5 page

On computations of the integrated space shuttle flowfield using overset grids

Numerical simulations using the thin-layer Navier-Stokes equations and chimera (overset) grid approach were carried out for flows around the integrated space shuttle vehicle over a range of Mach numbers. Body-conforming grids were used for all the component grids. Testcases include a three-component overset grid - the external tank (ET), the solid rocket booster (SRB) and the orbiter (ORB), and a five-component overset grid - the ET, SRB, ORB, forward and aft attach hardware, configurations. The results were compared with the wind tunnel and flight data. In addition, a Poisson solution procedure (a special case of the vorticity-velocity formulation) using primitive variables was developed to solve three-dimensional, irrotational, inviscid flows for single as well as overset grids. The solutions were validated by comparisons with other analytical or numerical solution, and/or experimental results for various geometries. The Poisson solution was also used as an initial guess for the thin-layer Navier-Stokes solution procedure to improve the efficiency of the numerical flow simulations. It was found that this approach resulted in roughly a 30 percent CPU time savings as compared with the procedure solving the thin-layer Navier-Stokes equations from a uniform free stream flowfield

Inductive algebras and homogeneous shifts

Inductive algebras for the irreducible unitary representations of the universal cover of the group of unimodular two by two matrices are classified. The classification of homogeneous shift operators is obtained as a direct consequence. This gives a new approach to the results of Bagchi and Misra

Surgery of pulmonary aspergillomas in immunocompromised patients

Introduction: Pulmonary aspergillosis is a devastating complication in immunocompromised patients. Timing of surgery is controversial and depends on the patients' general condition

Simultaneous sub-second hyperpolarization of the nuclear and electron spins of phosphorus in silicon

We demonstrate a method which can hyperpolarize both the electron and nuclear spins of 31P donors in Si at low field, where both would be essentially unpolarized in equilibrium. It is based on the selective ionization of donors in a specific hyperfine state by optically pumping donor bound exciton hyperfine transitions, which can be spectrally resolved in 28Si. Electron and nuclear polarizations of 90% and 76%, respectively, are obtained in less than a second, providing an initialization mechanism for qubits based on these spins, and enabling further ESR and NMR studies on dilute 31P in 28Si.Comment: 4 pages, 3 figure

K 4-free subgraphs of random graphs revisited

In Combinatorica 17(2), 1997, Kohayakawa, Łuczak and Rödl state a conjecture which has several implications for random graphs. If the conjecture is true, then, for example, an application of a version of Szemerédi's regularity lemma for sparse graphs yields an estimation of the maximal number of edges in an H-free subgraph of a random graph G n, p . In fact, the conjecture may be seen as a probabilistic embedding lemma for partitions guaranteed by a version of Szemerédi's regularity lemma for sparse graphs. In this paper we verify the conjecture for H = K 4, thereby providing a conceptually simple proof for the main result in the paper cited abov

Surgery of pulmonary aspergillomas in immunocompromised patients

Introduction: Pulmonary aspergillosis is a devastating complication in immunocompromised patients. Timing of surgery is controversial and depends on the patients' general condition