5 resultados para Return of results
em CaltechTHESIS
Resumo:
We have applied the Schwinger Multichannel Method(SMC) to the study of electronically inelastic, low energy electron-molecule collisions. The focus of these studies has been the assessment of the importance of multichannel coupling to the dynamics of these excitation processes. It has transpired that the promising quality of results realized in early SMC work on such inelastic scattering processes has been far more difficult to obtain in these more sophisticated studies.
We have attempted to understand the sources of instability of the SMC method which are evident in these multichannel studies. Particular instances of such instability have been considered in detail, which indicate that linear dependence, failure of the separable potential approximation, and difficulties in converging matrix elements involving recorrelation or Q-space terms all conspire to complicate application of the SMC method to these studies. A method involving singular value decomposition(SVD) has been developed to, if not resolve these problems, at least mitigate their deleterious effects on the computation of electronically inelastic cross sections.
In conjunction with this SVD procedure, the SMC method has been applied to the study of the H_2 , H_2O, and N_2 molecules. Rydberg excitations of the first two molecules were found to be most sensitive to multichannel coupling near threshold. The (3σ_g → 1π_g ) and (1π_u → 1π_g) valence excitations of the N_2 molecule were found to be strongly influenced by the choice of channel coupling scheme at all collision energies considered in these studies.
Resumo:
A study is made of the accuracy of electronic digital computer calculations of ground displacement and response spectra from strong-motion earthquake accelerograms. This involves an investigation of methods of the preparatory reduction of accelerograms into a form useful for the digital computation and of the accuracy of subsequent digital calculations. Various checks are made for both the ground displacement and response spectra results, and it is concluded that the main errors are those involved in digitizing the original record. Differences resulting from various investigators digitizing the same experimental record may become as large as 100% of the maximum computed ground displacements. The spread of the results of ground displacement calculations is greater than that of the response spectra calculations. Standardized methods of adjustment and calculation are recommended, to minimize such errors.
Studies are made of the spread of response spectral values about their mean. The distribution is investigated experimentally by Monte Carlo techniques using an electric analog system with white noise excitation, and histograms are presented indicating the dependence of the distribution on the damping and period of the structure. Approximate distributions are obtained analytically by confirming and extending existing results with accurate digital computer calculations. A comparison of the experimental and analytical approaches indicates good agreement for low damping values where the approximations are valid. A family of distribution curves to be used in conjunction with existing average spectra is presented. The combination of analog and digital computations used with Monte Carlo techniques is a promising approach to the statistical problems of earthquake engineering.
Methods of analysis of very small earthquake ground motion records obtained simultaneously at different sites are discussed. The advantages of Fourier spectrum analysis for certain types of studies and methods of calculation of Fourier spectra are presented. The digitizing and analysis of several earthquake records is described and checks are made of the dependence of results on digitizing procedure, earthquake duration and integration step length. Possible dangers of a direct ratio comparison of Fourier spectra curves are pointed out and the necessity for some type of smoothing procedure before comparison is established. A standard method of analysis for the study of comparative ground motion at different sites is recommended.
Resumo:
Let L be the algebra of all linear transformations on an n-dimensional vector space V over a field F and let A, B, ƐL. Let Ai+1 = AiB - BAi, i = 0, 1, 2,…, with A = Ao. Let fk (A, B; σ) = A2K+1 - σ1A2K-1 + σ2A2K-3 -… +(-1)KσKA1 where σ = (σ1, σ2,…, σK), σi belong to F and K = k(k-1)/2. Taussky and Wielandt [Proc. Amer. Math. Soc., 13(1962), 732-735] showed that fn(A, B; σ) = 0 if σi is the ith elementary symmetric function of (β4- βs)2, 1 ≤ r ˂ s ≤ n, i = 1, 2, …, N, with N = n(n-1)/2, where β4 are the characteristic roots of B. In this thesis we discuss relations involving fk(X, Y; σ) where X, Y Ɛ L and 1 ≤ k ˂ n. We show: 1. If F is infinite and if for each X Ɛ L there exists σ so that fk(A, X; σ) = 0 where 1 ≤ k ˂ n, then A is a scalar transformation. 2. If F is algebraically closed, a necessary and sufficient condition that there exists a basis of V with respect to which the matrices of A and B are both in block upper triangular form, where the blocks on the diagonals are either one- or two-dimensional, is that certain products X1, X2…Xr belong to the radical of the algebra generated by A and B over F, where Xi has the form f2(A, P(A,B); σ), for all polynomials P(x, y). We partially generalize this to the case where the blocks have dimensions ≤ k. 3. If A and B generate L, if the characteristic of F does not divide n and if there exists σ so that fk(A, B; σ) = 0, for some k with 1 ≤ k ˂ n, then the characteristic roots of B belong to the splitting field of gk(w; σ) = w2K+1 - σ1w2K-1 + σ2w2K-3 - …. +(-1)K σKw over F. We use this result to prove a theorem involving a generalized form of property L [cf. Motzkin and Taussky, Trans. Amer. Math. Soc., 73(1952), 108-114]. 4. Also we give mild generalizations of results of McCoy [Amer. Math. Soc. Bull., 42(1936), 592-600] and Drazin [Proc. London Math. Soc., 1(1951), 222-231].
Resumo:
My focus in this thesis is to contribute to a more thorough understanding of the mechanics of ice and deformable glacier beds. Glaciers flow under their own weight through a combination of deformation within the ice column and basal slip, which involves both sliding along and deformation within the bed. Deformable beds, which are made up of unfrozen sediment, are prevalent in nature and are often the primary contributors to ice flow wherever they are found. Their granular nature imbues them with unique mechanical properties that depend on the granular structure and hydrological properties of the bed. Despite their importance for understanding glacier flow and the response of glaciers to changing climate, the mechanics of deformable glacier beds are not well understood.
Our general approach to understanding the mechanics of bed deformation and their effect on glacier flow is to acquire synoptic observations of ice surface velocities and their changes over time and to use those observations to infer the mechanical properties of the bed. We focus on areas where changes in ice flow over time are due to known environmental forcings and where the processes of interest are largely isolated from other effects. To make this approach viable, we further develop observational methods that involve the use of mapping radar systems. Chapters 2 and 5 focus largely on the development of these methods and analysis of results from ice caps in central Iceland and an ice stream in West Antarctica. In Chapter 3, we use these observations to constrain numerical ice flow models in order to study the mechanics of the bed and the ice itself. We show that the bed in an Iceland ice cap deforms plastically and we derive an original mechanistic model of ice flow over plastically deforming beds that incorporates changes in bed strength caused by meltwater flux from the surface. Expanding on this work in Chapter 4, we develop a more detailed mechanistic model for till-covered beds that helps explain the mechanisms that cause some glaciers to surge quasi-periodically. In Antarctica, we observe and analyze the mechanisms that allow ocean tidal variations to modulate ice stream flow tens of kilometers inland. We find that the ice stream margins are significantly weakened immediately upstream of the area where ice begins to float and that this weakening likely allows changes in stress over the floating ice to propagate through the ice column.
Resumo:
The centralized paradigm of a single controller and a single plant upon which modern control theory is built is no longer applicable to modern cyber-physical systems of interest, such as the power-grid, software defined networks or automated highways systems, as these are all large-scale and spatially distributed. Both the scale and the distributed nature of these systems has motivated the decentralization of control schemes into local sub-controllers that measure, exchange and act on locally available subsets of the globally available system information. This decentralization of control logic leads to different decision makers acting on asymmetric information sets, introduces the need for coordination between them, and perhaps not surprisingly makes the resulting optimal control problem much harder to solve. In fact, shortly after such questions were posed, it was realized that seemingly simple decentralized optimal control problems are computationally intractable to solve, with the Wistenhausen counterexample being a famous instance of this phenomenon. Spurred on by this perhaps discouraging result, a concerted 40 year effort to identify tractable classes of distributed optimal control problems culminated in the notion of quadratic invariance, which loosely states that if sub-controllers can exchange information with each other at least as quickly as the effect of their control actions propagates through the plant, then the resulting distributed optimal control problem admits a convex formulation.
The identification of quadratic invariance as an appropriate means of "convexifying" distributed optimal control problems led to a renewed enthusiasm in the controller synthesis community, resulting in a rich set of results over the past decade. The contributions of this thesis can be seen as being a part of this broader family of results, with a particular focus on closing the gap between theory and practice by relaxing or removing assumptions made in the traditional distributed optimal control framework. Our contributions are to the foundational theory of distributed optimal control, and fall under three broad categories, namely controller synthesis, architecture design and system identification.
We begin by providing two novel controller synthesis algorithms. The first is a solution to the distributed H-infinity optimal control problem subject to delay constraints, and provides the only known exact characterization of delay-constrained distributed controllers satisfying an H-infinity norm bound. The second is an explicit dynamic programming solution to a two player LQR state-feedback problem with varying delays. Accommodating varying delays represents an important first step in combining distributed optimal control theory with the area of Networked Control Systems that considers lossy channels in the feedback loop. Our next set of results are concerned with controller architecture design. When designing controllers for large-scale systems, the architectural aspects of the controller such as the placement of actuators, sensors, and the communication links between them can no longer be taken as given -- indeed the task of designing this architecture is now as important as the design of the control laws themselves. To address this task, we formulate the Regularization for Design (RFD) framework, which is a unifying computationally tractable approach, based on the model matching framework and atomic norm regularization, for the simultaneous co-design of a structured optimal controller and the architecture needed to implement it. Our final result is a contribution to distributed system identification. Traditional system identification techniques such as subspace identification are not computationally scalable, and destroy rather than leverage any a priori information about the system's interconnection structure. We argue that in the context of system identification, an essential building block of any scalable algorithm is the ability to estimate local dynamics within a large interconnected system. To that end we propose a promising heuristic for identifying the dynamics of a subsystem that is still connected to a large system. We exploit the fact that the transfer function of the local dynamics is low-order, but full-rank, while the transfer function of the global dynamics is high-order, but low-rank, to formulate this separation task as a nuclear norm minimization problem. Finally, we conclude with a brief discussion of future research directions, with a particular emphasis on how to incorporate the results of this thesis, and those of optimal control theory in general, into a broader theory of dynamics, control and optimization in layered architectures.