16 resultados para Quotient Singularities
em Cambridge University Engineering Department Publications Database
Resumo:
The classical Rayleigh quotient iteration (RQI) allows one to compute a one-dimensional invariant subspace of a symmetric matrix A. Here we propose a generalization of the RQI which computes a p-dimensional invariant subspace of A. Cubic convergence is preserved and the cost per iteration is low compared to other methods proposed in the literature.
Resumo:
The classical Rayleigh Quotient Iteration (RQI) computes a 1-dimensional invariant subspace of a symmetric matrix A with cubic convergence. We propose a generalization of the RQI which computes a p-dimensional invariant subspace of A. The geometry of the algorithm on the Grassmann manifold Gr(p,n) is developed to show cubic convergence and to draw connections with recently proposed Newton algorithms on Riemannian manifolds.
Resumo:
Cyclic loading of a plane strain mode I crack under small scale yielding is analyzed using discrete dislocation dynamics. The dislocations are all of edge character, and are modeled as line singularities in an elastic solid. At each stage of loading, superposition is used to represent the solution in terms of solutions for edge dislocations in a half-space and a non-singular complementary solution that enforces the boundary conditions, which is obtained from a linear elastic, finite element solution. The lattice resistance to dislocation motion, dislocation nucleation, dislocation interaction with obstacles and dislocation annihilation are incorporated into the formulation through a set of constitutive rules. An irreversible relation between the opening traction and the displacement jump across a cohesive surface ahead of the initial crack tip is also specified, which permits crack growth to emerge naturally. It is found that crack growth can occur under cyclic loading conditions even when the peak stress intensity factor is smaller than the stress intensity required for crack growth under monotonic loading conditions; however below a certain threshold value of ΔKI no crack growth was seen.
Resumo:
Small scale yielding around a mode I crack is analysed using polycrystalline discrete dislocation plasticity. Plane strain analyses are carried out with the dislocations all of edge character and modelled as line singularities in a linear elastic material. The lattice resistance to dislocation motion, nucleation, interaction with obstacles and annihilation are incorporated through a set of constitutive rules. Grain boundaries are modelled as impenetrable to dislocations. The polycrystalline material is taken to consist of two types of square grains, one of which has a bcc-like orientation and the other an fcc-like orientation. For both orientations there are three active slip systems. Alternating rows, alternating columns and a checker-board-like arrangement of the grains is used to construct the polycrystalline materials. Consistent with the increasing yield strength of the polycrystalline material with decreasing grain size, the calculations predict a decrease in both the plastic zone size and the crack-tip opening displacement for a given applied mode I stress intensity factor. Furthermore, slip-band and kink-band formation is inhibited by all grain arrangements and, with decreasing grain size, the stress and strain distributions more closely resemble the HRR fields with the crack-tip opening approximately inversely proportional to the yield strength of the polycrystalline materials. The calculations predict a reduction in fracture toughness with decreasing grain size associated with the grain boundaries acting as effective barriers to dislocation motion.
Resumo:
The effect of KI encapsulation in narrow (HiPCO) single-walled carbon nanotubes is studied via Raman spectroscopy and optical absorption. The analysis of the data explores the interplay between strain and structural modifications, bond-length changes, charge transfer, and electronic density of states. KI encapsulation appears to be consistent with both charge transfer and strain that shrink both the C-C bonds and the overall nanotube along the axial direction. The charge transfer in larger semiconducting nanotubes is low and comparable with some cases of electrochemical doping, while optical transitions between pairs of singularities of the density of states are quenched for narrow metallic nanotubes. Stronger changes in the density of states occur in some energy ranges and are attributed to polarization van der Waals interactions caused by the ionic encapsulate. Unlike doping with other species, such as atoms and small molecules, encapsulation of inorganic compounds via the molten-phase route provides stable effects due to maximal occupation of the nanotube inner space.
Resumo:
The paper is based on qualitative properties of the solution of the Navier-Stokes equations for incompressible fluid, and on properties of their finite element solution. In problems with corner-like singularities (e.g. on the well-known L-shaped domain) usually some adaptive strategy is used. In this paper we present an alternative approach. For flow problems on domains with corner singularities we use the a priori error estimates and asymptotic expansion of the solution to derive an algorithm for refining the mesh near the corner. It gives very precise solution in a cheap way. We present some numerical results.
Resumo:
We propose an algorithm for solving optimization problems defined on a subset of the cone of symmetric positive semidefinite matrices. This algorithm relies on the factorization X = Y Y T , where the number of columns of Y fixes an upper bound on the rank of the positive semidefinite matrix X. It is thus very effective for solving problems that have a low-rank solution. The factorization X = Y Y T leads to a reformulation of the original problem as an optimization on a particular quotient manifold. The present paper discusses the geometry of that manifold and derives a second-order optimization method with guaranteed quadratic convergence. It furthermore provides some conditions on the rank of the factorization to ensure equivalence with the original problem. In contrast to existing methods, the proposed algorithm converges monotonically to the sought solution. Its numerical efficiency is evaluated on two applications: the maximal cut of a graph and the problem of sparse principal component analysis. © 2010 Society for Industrial and Applied Mathematics.
Resumo:
This paper introduces a new metric and mean on the set of positive semidefinite matrices of fixed-rank. The proposed metric is derived from a well-chosen Riemannian quotient geometry that generalizes the reductive geometry of the positive cone and the associated natural metric. The resulting Riemannian space has strong geometrical properties: it is geodesically complete, and the metric is invariant with respect to all transformations that preserve angles (orthogonal transformations, scalings, and pseudoinversion). A meaningful approximation of the associated Riemannian distance is proposed, that can be efficiently numerically computed via a simple algorithm based on SVD. The induced mean preserves the rank, possesses the most desirable characteristics of a geometric mean, and is easy to compute. © 2009 Society for Industrial and Applied Mathematics.
Resumo:
The classes of continuous-time flows on Rn×p that induce the same flow on the set of p- dimensional subspaces of Rn×p are described. The power flow is briefly reviewed in this framework, and a subspace generalization of the Rayleigh quotient flow [Linear Algebra Appl. 368C, 2003, pp. 343-357] is proposed and analyzed. This new flow displays a property akin to deflation in finite time. © 2008 Yokohama Publishers.
Resumo:
The present paper considers the problem of autonomous synchronization of attitudes in a swarm of spacecraft. Building upon our recent results on consensus on manifolds, we model the spacecraft as particles on SO(3) and drive these particles to a common point in SO(3). Unlike the Euler angle or quaternion descriptions, this model suffers no singularities nor double-points. Our approach is fully cooperative and autonomous: we use no leader nor external reference. We present two types of control laws, in terms of applied control torques, that globally drive the swarm towards attitude synchronization: one that requires tree-like or all-to-all inter-satellite communication (most efficient) and one that works with nearly arbitrary communication (most robust).
Resumo:
Abstract A theoretical model is developed for the sound scattered when a sound wave is incident on a cambered aerofoil at non-zero angle of attack. The model is based on the linearization of the Euler equations about a steady subsonic flow, and is an adaptation of previous work which considered incident vortical disturbances. Only high-frequency sound waves are considered. The aerofoil thickness, camber and angle of attack are restricted such that the steady flow past the aerofoil is a small perturbation to a uniform flow. The singular perturbation analysis identifies asymptotic regions around the aerofoil; local 'inner' regions, which scale on the incident wavelength, at the leading and trailing edges of the aerofoil; Fresnel regions emanating from the leading and trailing edges of the aerofoil due to the coalescence of singularities and points of stationary phase; a wake transition region downstream of the aerofoil leading and trailing edge; and an outer region far from the aerofoil and wake. An acoustic boundary layer on the aerofoil surface and within the transition region accounts for the effects of curvature. The final result is a uniformly-valid solution for the far-field sound; the effects of angle of attack, camber and thickness are investigated. © 2013 Cambridge University Press.
Resumo:
The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is characterized by an efficient factorization that makes the trace norm differentiable in the search space and the computation of duality gap numerically tractable. The search space is nonlinear but is equipped with a Riemannian structure that leads to efficient computations. We present a second-order trust-region algorithm with a guaranteed quadratic rate of convergence. Overall, the proposed optimization scheme converges superlinearly to the global solution while maintaining complexity that is linear in the number of rows and columns of the matrix. To compute a set of solutions efficiently for a grid of regularization parameters we propose a predictor-corrector approach that outperforms the naive warm-restart approach on the fixed-rank quotient manifold. The performance of the proposed algorithm is illustrated on problems of low-rank matrix completion and multivariate linear regression. © 2013 Society for Industrial and Applied Mathematics.