Investigation of a universal behavior between N\'eel temperature and staggered magnetization density for a three-dimensional quantum antiferromagnet

We simulate the three-dimensional quantum Heisenberg model with a spatially anisotropic ladder pattern using the first principles Monte Carlo method. Our motivation is to investigate quantitatively the newly established universal relation $T_N/\sqrt{c^3}$ $\propto$ ${\cal M}_s$ near the quantum critical point (QCP) associated with dimerization. Here $T_N$, $c$, and ${\cal M}_s$ are the N\'eel temperature, the spinwave velocity, and the staggered magnetization density, respectively. For all the physical quantities considered here, such as $T_N$ and ${\cal M}_s$, our Monte Carlo results agree nicely with the corresponding results determined by the series expansion method. In addition, we find it is likely that the effect of a logarithmic correction, which should be present in (3+1)-dimensions, to the relation $T_N/\sqrt{c^3}$ $\propto$ ${\cal M}_s$ near the investigated QCP only sets in significantly in the region with strong spatial anisotropy.Comment: 5 pages, 7 figures, 2 table

An interactive multi-block grid generation system

A grid generation procedure combining interactive and batch grid generation programs was put together to generate multi-block grids for complex aircraft configurations. The interactive section provides the tools for 3D geometry manipulation, surface grid extraction, boundary domain construction for 3D volume grid generation, and block-block relationships and boundary conditions for flow solvers. The procedure improves the flexibility and quality of grid generation to meet the design/analysis requirements

An optimum settling problem for time lag systems

Lagrange multiplier in Banach space for settling optimal control in time lag syste

A general multiblock Euler code for propulsion integration. Volume 1: Theory document

A general multiblock Euler solver was developed for the analysis of flow fields over geometrically complex configurations either in free air or in a wind tunnel. In this approach, the external space around a complex configuration was divided into a number of topologically simple blocks, so that surface-fitted grids and an efficient flow solution algorithm could be easily applied in each block. The computational grid in each block is generated using a combination of algebraic and elliptic methods. A grid generation/flow solver interface program was developed to facilitate the establishment of block-to-block relations and the boundary conditions for each block. The flow solver utilizes a finite volume formulation and an explicit time stepping scheme to solve the Euler equations. A multiblock version of the multigrid method was developed to accelerate the convergence of the calculations. The generality of the method was demonstrated through the analysis of two complex configurations at various flow conditions. Results were compared to available test data. Two accompanying volumes, user manuals for the preparation of multi-block grids (vol. 2) and for the Euler flow solver (vol. 3), provide information on input data format and program execution

A general multiblock Euler code for propulsion integration. Volume 3: User guide for the Euler code

This manual explains the procedures for using the general multiblock Euler (GMBE) code developed under NASA contract NAS1-18703. The code was developed for the aerodynamic analysis of geometrically complex configurations in either free air or wind tunnel environments (vol. 1). The complete flow field is divided into a number of topologically simple blocks within each of which surface fitted grids and efficient flow solution algorithms can easily be constructed. The multiblock field grid is generated with the BCON procedure described in volume 2. The GMBE utilizes a finite volume formulation with an explicit time stepping scheme to solve the Euler equations. A multiblock version of the multigrid method was developed to accelerate the convergence of the calculations. This user guide provides information on the GMBE code, including input data preparations with sample input files and a sample Unix script for program execution in the UNICOS environment

Parallel Exhaustive Search without Coordination

We analyze parallel algorithms in the context of exhaustive search over totally ordered sets. Imagine an infinite list of "boxes", with a "treasure" hidden in one of them, where the boxes' order reflects the importance of finding the treasure in a given box. At each time step, a search protocol executed by a searcher has the ability to peek into one box, and see whether the treasure is present or not. By equally dividing the workload between them, $k$ searchers can find the treasure $k$ times faster than one searcher. However, this straightforward strategy is very sensitive to failures (e.g., crashes of processors), and overcoming this issue seems to require a large amount of communication. We therefore address the question of designing parallel search algorithms maximizing their speed-up and maintaining high levels of robustness, while minimizing the amount of resources for coordination. Based on the observation that algorithms that avoid communication are inherently robust, we analyze the best running time performance of non-coordinating algorithms. Specifically, we devise non-coordinating algorithms that achieve a speed-up of $9/8$ for two searchers, a speed-up of $4/3$ for three searchers, and in general, a speed-up of $\frac{k}{4}(1+1/k)^2$ for any $k\geq 1$ searchers. Thus, asymptotically, the speed-up is only four times worse compared to the case of full-coordination, and our algorithms are surprisingly simple and hence applicable. Moreover, these bounds are tight in a strong sense as no non-coordinating search algorithm can achieve better speed-ups. Overall, we highlight that, in faulty contexts in which coordination between the searchers is technically difficult to implement, intrusive with respect to privacy, and/or costly in term of resources, it might well be worth giving up on coordination, and simply run our non-coordinating exhaustive search algorithms

Theory of non-Fermi liquid near a diagonal electronic nematic state on a square lattice

We study effects of Fermi surface fluctuations on a single-particle life time near the diagonal electronic nematic phase on a two-dimensional square lattice. It has been shown that there exists a quantum critical point (QCP) between the diagonal nematic and isotropic phases. We study the longitudinal fluctuations of the order parameter near the critical point, where the singular forward scattering leads to a non-Fermi liquid behavior over the whole Fermi surface except along the k_x- and k_y-directions. We will also discuss the temperature and chemical potential dependence of the single-particle decay rate.Comment: 4 pages, 3 figures, revtex