H_2 solved by the finite element method

We report on the solution of the Hartree-Fock equations for the ground state of the H_2 molecule using the finite element method. Both the Hartree-Fock and the Poisson equations are solved with this method to an accuracy of 10^-8 using only 26 x 11 grid points in two dimensions. A 41 x 16 grid gives a new Hartree-Fock benchmark to ten-figure accuracy.

CD-Systems of Restarting Automata

Die vorliegende Arbeit behandelt Restartautomaten und Erweiterungen von Restartautomaten. Restartautomaten sind ein Werkzeug zum Erkennen formaler Sprachen. Sie sind motiviert durch die linguistische Methode der Analyse durch Reduktion und wurden 1995 von Jancar, Mráz, Plátek und Vogel eingeführt. Restartautomaten bestehen aus einer endlichen Kontrolle, einem Lese/Schreibfenster fester Größe und einem flexiblen Band. Anfänglich enthält dieses sowohl die Eingabe als auch Bandbegrenzungssymbole. Die Berechnung eines Restartautomaten läuft in so genannten Zyklen ab. Diese beginnen am linken Rand im Startzustand, in ihnen wird eine lokale Ersetzung auf dem Band durchgeführt und sie enden mit einem Neustart, bei dem das Lese/Schreibfenster wieder an den linken Rand bewegt wird und der Startzustand wieder eingenommen wird. Die vorliegende Arbeit beschäftigt sich hauptsächlich mit zwei Erweiterungen der Restartautomaten: CD-Systeme von Restartautomaten und nichtvergessende Restartautomaten. Nichtvergessende Restartautomaten können einen Zyklus in einem beliebigen Zustand beenden und CD-Systeme von Restartautomaten bestehen aus einer Menge von Restartautomaten, die zusammen die Eingabe verarbeiten. Dabei wird ihre Zusammenarbeit durch einen Operationsmodus, ähnlich wie bei CD-Grammatik Systemen, geregelt. Für beide Erweiterungen zeigt sich, dass die deterministischen Modelle mächtiger sind als deterministische Standardrestartautomaten. Es wird gezeigt, dass CD-Systeme von Restartautomaten in vielen Fällen durch nichtvergessende Restartautomaten simuliert werden können und andererseits lassen sich auch nichtvergessende Restartautomaten durch CD-Systeme von Restartautomaten simulieren. Des Weiteren werden Restartautomaten und nichtvergessende Restartautomaten untersucht, die nichtdeterministisch sind, aber keine Fehler machen. Es zeigt sich, dass diese Automaten durch deterministische (nichtvergessende) Restartautomaten simuliert werden können, wenn sie direkt nach der Ersetzung einen neuen Zyklus beginnen, oder ihr Fenster nach links und rechts bewegen können. Außerdem gilt, dass alle (nichtvergessenden) Restartautomaten, die zwar Fehler machen dürfen, diese aber nach endlich vielen Zyklen erkennen, durch (nichtvergessende) Restartautomaten simuliert werden können, die keine Fehler machen. Ein weiteres wichtiges Resultat besagt, dass die deterministischen monotonen nichtvergessenden Restartautomaten mit Hilfssymbolen, die direkt nach dem Ersetzungsschritt den Zyklus beenden, genau die deterministischen kontextfreien Sprachen erkennen, wohingegen die deterministischen monotonen nichtvergessenden Restartautomaten mit Hilfssymbolen ohne diese Einschränkung echt mehr, nämlich die links-rechts regulären Sprachen, erkennen. Damit werden zum ersten Mal Restartautomaten mit Hilfssymbolen, die direkt nach dem Ersetzungsschritt ihren Zyklus beenden, von Restartautomaten desselben Typs ohne diese Einschränkung getrennt. Besonders erwähnenswert ist hierbei, dass beide Automatentypen wohlbekannte Sprachklassen beschreiben.

Lower Bounds for Nonforgetting Restarting Automata and CD-Systems of Restarting Automata

The nonforgetting restarting automaton is a generalization of the restarting automaton that, when executing a restart operation, changes its internal state based on the current state and the actual contents of its read/write window instead of resetting it to the initial state. Another generalization of the restarting automaton is the cooperating distributed system (CD-system) of restarting automata. Here a finite system of restarting automata works together in analyzing a given sentence, where they interact based on a given mode of operation. As it turned out, CD-systems of restarting automata of some type X working in mode =1 are just as expressive as nonforgetting restarting automata of the same type X. Further, various types of determinism have been introduced for CD-systems of restarting automata called strict determinism, global determinism, and local determinism, and it has been shown that globally deterministic CD-systems working in mode =1 correspond to deterministic nonforgetting restarting automata. Here we derive some lower bound results for some types of nonforgetting restarting automata and for some types of CD-systems of restarting automata. In this way we establish separations between the corresponding language classes, thus providing detailed technical proofs for some of the separation results announced in the literature.

Generic Finite Element Model for Mechanically Consistent Scaling of Composite Beam-to-column Joint with Welded Connection

To study the behaviour of beam-to-column composite connection more sophisticated finite element models is required, since component model has some severe limitations. In this research a generic finite element model for composite beam-to-column joint with welded connections is developed using current state of the art local modelling. Applying mechanically consistent scaling method, it can provide the constitutive relationship for a plane rectangular macro element with beam-type boundaries. Then, this defined macro element, which preserves local behaviour and allows for the transfer of five independent states between local and global models, can be implemented in high-accuracy frame analysis with the possibility of limit state checks. In order that macro element for scaling method can be used in practical manner, a generic geometry program as a new idea proposed in this study is also developed for this finite element model. With generic programming a set of global geometric variables can be input to generate a specific instance of the connection without much effort. The proposed finite element model generated by this generic programming is validated against testing results from University of Kaiserslautern. Finally, two illustrative examples for applying this macro element approach are presented. In the first example how to obtain the constitutive relationships of macro element is demonstrated. With certain assumptions for typical composite frame the constitutive relationships can be represented by bilinear laws for the macro bending and shear states that are then coupled by a two-dimensional surface law with yield and failure surfaces. In second example a scaling concept that combines sophisticated local models with a frame analysis using a macro element approach is presented as a practical application of this numerical model.

Linear response functions for a vibrational configuration interaction state

Linear response functions are implemented for a vibrational configuration interaction state allowing accurate analytical calculations of pure vibrational contributions to dynamical polarizabilities. Sample calculations are presented for the pure vibrational contributions to the polarizabilities of water and formaldehyde. We discuss the convergence of the results with respect to various details of the vibrational wave function description as well as the potential and property surfaces. We also analyze the frequency dependence of the linear response function and the effect of accounting phenomenologically for the finite lifetime of the excited vibrational states. Finally, we compare the analytical response approach to a sum-over-states approach

Scale-invariant moving finite elements for nonlinear partial differential equations in two dimensions

A scale-invariant moving finite element method is proposed for the adaptive solution of nonlinear partial differential equations. The mesh movement is based on a finite element discretisation of a scale-invariant conservation principle incorporating a monitor function, while the time discretisation of the resulting system of ordinary differential equations is carried out using a scale-invariant time-stepping which yields uniform local accuracy in time. The accuracy and reliability of the algorithm are successfully tested against exact self-similar solutions where available, and otherwise against a state-of-the-art h-refinement scheme for solutions of a two-dimensional porous medium equation problem with a moving boundary. The monitor functions used are the dependent variable and a monitor related to the surface area of the solution manifold. (c) 2005 IMACS. Published by Elsevier B.V. All rights reserved.

Interactions between shallow and deep convection under a finite departure from convective quasi–equilibrium

The present paper presents a simple theory for the transformation of non-precipitating, shallow convection into precipitating, deep convective clouds. In order to make the pertinent point a much idealized system is considered, consisting only of shallow and deep convection without large–scale forcing. The transformation is described by an explicit coupling between these two types of convection. Shallow convection moistens and cools the atmosphere, whereas deep convection dries and warms, leading to destabilization and stabilization respectively. Consequently, in their own stand–alone modes, shallow convection perpetually grows, whereas deep convection simply damps: the former never reaches equilibrium, and the latter is never spontaneously generated. Coupling the modes together is the only way to reconcile these undesirable separate tendencies so that the convective system as a whole can remain in a stable periodic state under this idealized setting. Such coupling is a key missing element in current global atmospheric models. The energy–cycle description as originally formulated by Arakawa and Schubert, and presented herein is suitable for direct implementation into models using a mass–flux parameterization, and would alleviate the current problems with the representation of these two types of convection in numerical models. The present theory also provides a pertinent framework for analyzing large–eddy simulations and cloud–resolving modelling.

Non-steady state heat conduction in composite walls

The problem of heat conduction in one-dimensional piecewise homogeneous composite materials is examined by providing an explicit solution of the one-dimensional heat equation in each domain. The location of the interfaces is known, but neither temperature nor heat flux are prescribed there. Instead, the physical assumptions of their continuity at the interfaces are the only conditions imposed. The problem of two semi-infinite domains and that of two finite-sized domains are examined in detail. We indicate also how to extend the solution method to the setting of one finite-sized domain surrounded on both sides by semi-infinite domains, and on that of three finite-sized domains.

Coherent state quantization of paragrassmann algebras

By using a coherent state quantization of paragrassmann variables, operators are constructed in finite Hilbert spaces. We thus obtain in a straightforward way a matrix representation of the paragrassmann algebra. This algebra of finite matrices realizes a deformed Weyl-Heisenberg algebra. The study of mean values in coherent states of some of these operators leads to interesting conclusions.

Number of particle creation and decoherence in the nonideal dynamical Casimir effect at finite temperature

In this work we investigate the dynamical Casimir effect in a nonideal cavity by deriving an effective Hamiltonian. We first compute a general expression for the average number of particle creation, applicable for any law of motion of the cavity boundary, under the only restriction of small velocities. We also compute a general expression for the linear entropy of an arbitrary state prepared in a selected mode, also applicable for any law of motion of a slow moving boundary. As an application of our results we have analyzed both the average number of particle creation and linear entropy within a particular oscillatory motion of the cavity boundary. On the basis of these expressions we develop a comprehensive analysis of the resonances in the number of particle creation in the nonideal dynamical Casimir effect. We also demonstrate the occurrence of resonances in the loss of purity of the initial state and estimate the decoherence times associated with these resonances. Since our results were obtained in the framework of the perturbation theory, they are restricted, under resonant conditions, to a short-time approximation. (C) 2009 Elsevier Inc. All rights reserved.

QUASISTATIONARY DISTRIBUTIONS AND FLEMING-VIOT PROCESSES IN FINITE SPACES

Consider a continuous-time Markov process with transition rates matrix Q in the state space Lambda boolean OR {0}. In In the associated Fleming-Viot process N particles evolve independently in A with transition rates matrix Q until one of them attempts to jump to state 0. At this moment the particle jumps to one of the positions of the other particles, chosen uniformly at random. When Lambda is finite, we show that the empirical distribution of the particles at a fixed time converges as N -> infinity to the distribution of a single particle at the same time conditioned on not touching {0}. Furthermore, the empirical profile of the unique invariant measure for the Fleming-Viot process with N particles converges as N -> infinity to the unique quasistationary distribution of the one-particle motion. A key element of the approach is to show that the two-particle correlations are of order 1/N.

A generalization of judds method of out-steady-state comparisons in perfect foresight models

We show that Judd (1982)’s method can be applied to any finite system, contrary to what he claimed in 1987. An example shows how to employ the technic to study monetary models in presence of capital accumulation.

Excitations and finite-size properties of an integrable supersymmetric electronic model

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

A Cellular Automaton Approach to Spatial Electric Load Forecasting

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Bosonic D-branes at finite temperature with an external field

Bosonic boundary states at finite temperature are constructed as solutions of boundary conditions at T not equal0 for bosonic open strings with a constant gauge field F-ab coupled to the boundary. The construction is done in the framework of ther-mo field dynamics where a thermal Bogoliubov transformation maps states and operators to finite temperature. Boundary states are given in terms of states from the direct product space between the Fock space of the closed string and another identical copy of it. By analogy with zero temperature, the boundary states have the interpretation of Dp-branes at finite temperature. The boundary conditions admit two different solutions. The entropy of the closed string in a Dp-brane state is computed and analyzed. It is interpreted as the entropy of the Dp-brane at finite temperature.