Contractors for flows

We answer a question raised by Lov\'asz and B. Szegedy [Contractors and connectors in graph algebras, J. Graph Theory 60:1 (2009)] asking for a contractor for the graph parameter counting the number of B-flows of a graph, where B is a subset of a finite Abelian group closed under inverses. We prove our main result using the duality between flows and tensions and finite Fourier analysis. We exhibit several examples of contractors for B-flows, which are of interest in relation to the family of B-flow conjectures formulated by Tutte, Fulkerson, Jaeger, and others.Comment: 22 pages, 1 figur

A length operator for canonical quantum gravity

We construct an operator that measures the length of a curve in four-dimensional Lorentzian vacuum quantum gravity. We work in a representation in which a $SU(2)$ connection is diagonal and it is therefore surprising that the operator obtained after regularization is densely defined, does not suffer from factor ordering singularities and does not require any renormalization. We show that the length operator admits self-adjoint extensions and compute part of its spectrum which like its companions, the volume and area operators already constructed in the literature, is purely discrete and roughly is quantized in units of the Planck length. The length operator contains full and direct information about all the components of the metric tensor which faciliates the construction of a new type of weave states which approximate a given classical 3-geometry.Comment: 23 pages, Late

Bunch-Kaufman factorization for real symmetric indefinite banded matrices

The Bunch-Kaufman algorithm for factoring symmetric indefinite matrices was rejected for banded matrices because it destroys the banded structure of the matrix. Herein, it is shown that for a subclass of real symmetric matrices which arise in solving the generalized eigenvalue problem using Lanczos's method, the Bunch-Kaufman algorithm does not result in major destruction of the bandwidth. Space time complexities of the algorithm are given and used to show that the Bunch-Kaufman algorithm is a significant improvement over LU factorization

M-step preconditioned conjugate gradient methods

Preconditioned conjugate gradient methods for solving sparse symmetric and positive finite systems of linear equations are described. Necessary and sufficient conditions are given for when these preconditioners can be used and an analysis of their effectiveness is given. Efficient computer implementations of these methods are discussed and results on the CYBER 203 and the Finite Element Machine under construction at NASA Langley Research Center are included

Inclusion of transverse shear deformation in the exact buckling and vibration analysis of composite plate assemblies

The problem considered is the development of the necessary plate stiffnesses for use in the general purpose program VICONOPT for buckling and vibration of composite plate assemblies. The required stiffnesses include the effects of transverse shear deformation and are for sinusoidal response along the plate length as required in VICONOPT. The method is based on the exact solution of the plate differential equations for a composite laminate having fully populated A, B, and D stiffness matrices which leads to an ordinary differential equation of tenth order

Multigrid method for stability problems

The problem of calculating the stability of steady state solutions of differential equations is treated. Leading eigenvalues (i.e., having maximal real part) of large matrices that arise from discretization are to be calculated. An efficient multigrid method for solving these problems is presented. The method begins by obtaining an initial approximation for the dominant subspace on a coarse level using a damped Jacobi relaxation. This proceeds until enough accuracy for the dominant subspace has been obtained. The resulting grid functions are then used as an initial approximation for appropriate eigenvalue problems. These problems are being solved first on coarse levels, followed by refinement until a desired accuracy for the eigenvalues has been achieved. The method employs local relaxation on all levels together with a global change on the coarsest level only, which is designed to separate the different eigenfunctions as well as to update their corresponding eigenvalues. Coarsening is done using the FAS formulation in a non-standard way in which the right hand side of the coarse grid equations involves unknown parameters to be solved for on the coarse grid. This in particular leads to a new multigrid method for calculating the eigenvalues of symmetric problems. Numerical experiments with a model problem demonstrate the effectiveness of the method proposed. Using an FMG algorithm a solution to the level of discretization errors is obtained in just a few work units (less than 10), where a work unit is the work involved in one Jacobi relization on the finest level

Loop Quantum Cosmology II: Volume Operators

Volume operators measuring the total volume of space in a loop quantum theory of cosmological models are constructed. In the case of models with rotational symmetry an investigation of the Higgs constraint imposed on the reduced connection variables is necessary, a complete solution of which is given for isotropic models; in this case the volume spectrum can be calculated explicitly. It is observed that the stronger the symmetry conditions are the smaller is the volume spectrum, which can be interpreted as level splitting due to broken symmetries. Some implications for quantum cosmology are presented.Comment: 21 page

An application of eigenspace methods to symmetric flutter suppression

An eigenspace assignment approach to the design of parameter insensitive control laws for linear multivariable systems is presented. The control design scheme utilizes flexibility in eigenvector assignments to reduce control system sensitivity to changes in system parameters. The methods involve use of the singular value decomposition to provide an exact description of allowable eigenvectors in terms of a minimum number of design parameters. In a design example, the methods are applied to the problem of symmetric flutter suppression in an aeroelastic vehicle. In this example the flutter mode is sensitive to changes in dynamic pressure and eigenspace methods are used to enhance the performance of a stabilizing minimum energy/linear quadratic regulator controller and associated observer. Results indicate that the methods provide feedback control laws that make stability of the nominal closed loop systems insensitive to changes in dynamic pressure

Time-stable boundary conditions for finite-difference schemes solving hyperbolic systems: Methodology and application to high-order compact schemes

We present a systematic method for constructing boundary conditions (numerical and physical) of the required accuracy, for compact (Pade-like) high-order finite-difference schemes for hyperbolic systems. First, a roper summation-by-parts formula is found for the approximate derivative. A 'simultaneous approximation term' (SAT) is then introduced to treat the boundary conditions. This procedure leads to time-stable schemes even in the system case. An explicit construction of the fourth-order compact case is given. Numerical studies are presented to verify the efficacy of the approach