5 resultados para edge-shared bioctahedra

em CaltechTHESIS


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the radially symmetric nonlinear von Kármán plate equations for circular or annular plates in the limit of small thickness. The loads on the plate consist of a radially symmetric pressure load and a uniform edge load. The dependence of the steady states on the edge load and thickness is studied using asymptotics as well as numerical calculations. The von Kármán plate equations are a singular perturbation of the Fӧppl membrane equation in the asymptotic limit of small thickness. We study the role of compressive membrane solutions in the small thickness asymptotic behavior of the plate solutions.

We give evidence for the existence of a singular compressive solution for the circular membrane and show by a singular perturbation expansion that the nonsingular compressive solution approach this singular solution as the radial stress at the center of the plate vanishes. In this limit, an infinite number of folds occur with respect to the edge load. Similar behavior is observed for the annular membrane with zero edge load at the inner radius in the limit as the circumferential stress vanishes.

We develop multiscale expansions, which are asymptotic to members of this family for plates with edges that are elastically supported against rotation. At some thicknesses this approximation breaks down and a boundary layer appears at the center of the plate. In the limit of small normal load, the points of breakdown approach the bifurcation points corresponding to buckling of the nondeflected state. A uniform asymptotic expansion for small thickness combining the boundary layer with a multiscale approximation of the outer solution is developed for this case. These approximations complement the well known boundary layer expansions based on tensile membrane solutions in describing the bending and stretching of thin plates. The approximation becomes inconsistent as the clamped state is approached by increasing the resistance against rotation at the edge. We prove that such an expansion for the clamped circular plate cannot exist unless the pressure load is self-equilibrating.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Some problems of edge waves and standing waves on beaches are examined.

The nonlinear interaction of a wave normally incident on a sloping beach with a subharmonic edge wave is studied. A two-timing expansion is used in the full nonlinear theory to obtain the modulation equations which describe the evolution of the waves. It is shown how large amplitude edge waves are produced; and the results of the theory are compared with some recent laboratory experiments.

Traveling edge waves are considered in two situations. First, the full linear theory is examined to find the finite depth effect on the edge waves produced by a moving pressure disturbance. In the second situation, a Stokes' expansion is used to discuss the nonlinear effects in shallow water edge waves traveling over a bottom of arbitrary shape. The results are compared with the ones of the full theory for a uniformly sloping bottom.

The finite amplitude effects for waves incident on a sloping beach, with perfect reflection, are considered. A Stokes' expansion is used in the full nonlinear theory to find the corrections to the dispersion relation for the cases of normal and oblique incidence.

Finally, an abstract formulation of the linear water waves problem is given in terms of a self adjoint but nonlocal operator. The appropriate spectral representations are developed for two particular cases.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The dissertation is concerned with the mathematical study of various network problems. First, three real-world networks are considered: (i) the human brain network (ii) communication networks, (iii) electric power networks. Although these networks perform very different tasks, they share similar mathematical foundations. The high-level goal is to analyze and/or synthesis each of these systems from a “control and optimization” point of view. After studying these three real-world networks, two abstract network problems are also explored, which are motivated by power systems. The first one is “flow optimization over a flow network” and the second one is “nonlinear optimization over a generalized weighted graph”. The results derived in this dissertation are summarized below.

Brain Networks: Neuroimaging data reveals the coordinated activity of spatially distinct brain regions, which may be represented mathematically as a network of nodes (brain regions) and links (interdependencies). To obtain the brain connectivity network, the graphs associated with the correlation matrix and the inverse covariance matrix—describing marginal and conditional dependencies between brain regions—have been proposed in the literature. A question arises as to whether any of these graphs provides useful information about the brain connectivity. Due to the electrical properties of the brain, this problem will be investigated in the context of electrical circuits. First, we consider an electric circuit model and show that the inverse covariance matrix of the node voltages reveals the topology of the circuit. Second, we study the problem of finding the topology of the circuit based on only measurement. In this case, by assuming that the circuit is hidden inside a black box and only the nodal signals are available for measurement, the aim is to find the topology of the circuit when a limited number of samples are available. For this purpose, we deploy the graphical lasso technique to estimate a sparse inverse covariance matrix. It is shown that the graphical lasso may find most of the circuit topology if the exact covariance matrix is well-conditioned. However, it may fail to work well when this matrix is ill-conditioned. To deal with ill-conditioned matrices, we propose a small modification to the graphical lasso algorithm and demonstrate its performance. Finally, the technique developed in this work will be applied to the resting-state fMRI data of a number of healthy subjects.

Communication Networks: Congestion control techniques aim to adjust the transmission rates of competing users in the Internet in such a way that the network resources are shared efficiently. Despite the progress in the analysis and synthesis of the Internet congestion control, almost all existing fluid models of congestion control assume that every link in the path of a flow observes the original source rate. To address this issue, a more accurate model is derived in this work for the behavior of the network under an arbitrary congestion controller, which takes into account of the effect of buffering (queueing) on data flows. Using this model, it is proved that the well-known Internet congestion control algorithms may no longer be stable for the common pricing schemes, unless a sufficient condition is satisfied. It is also shown that these algorithms are guaranteed to be stable if a new pricing mechanism is used.

Electrical Power Networks: Optimal power flow (OPF) has been one of the most studied problems for power systems since its introduction by Carpentier in 1962. This problem is concerned with finding an optimal operating point of a power network minimizing the total power generation cost subject to network and physical constraints. It is well known that OPF is computationally hard to solve due to the nonlinear interrelation among the optimization variables. The objective is to identify a large class of networks over which every OPF problem can be solved in polynomial time. To this end, a convex relaxation is proposed, which solves the OPF problem exactly for every radial network and every meshed network with a sufficient number of phase shifters, provided power over-delivery is allowed. The concept of “power over-delivery” is equivalent to relaxing the power balance equations to inequality constraints.

Flow Networks: In this part of the dissertation, the minimum-cost flow problem over an arbitrary flow network is considered. In this problem, each node is associated with some possibly unknown injection, each line has two unknown flows at its ends related to each other via a nonlinear function, and all injections and flows need to satisfy certain box constraints. This problem, named generalized network flow (GNF), is highly non-convex due to its nonlinear equality constraints. Under the assumption of monotonicity and convexity of the flow and cost functions, a convex relaxation is proposed, which always finds the optimal injections. A primary application of this work is in the OPF problem. The results of this work on GNF prove that the relaxation on power balance equations (i.e., load over-delivery) is not needed in practice under a very mild angle assumption.

Generalized Weighted Graphs: Motivated by power optimizations, this part aims to find a global optimization technique for a nonlinear optimization defined over a generalized weighted graph. Every edge of this type of graph is associated with a weight set corresponding to the known parameters of the optimization (e.g., the coefficients). The motivation behind this problem is to investigate how the (hidden) structure of a given real/complex valued optimization makes the problem easy to solve, and indeed the generalized weighted graph is introduced to capture the structure of an optimization. Various sufficient conditions are derived, which relate the polynomial-time solvability of different classes of optimization problems to weak properties of the generalized weighted graph such as its topology and the sign definiteness of its weight sets. As an application, it is proved that a broad class of real and complex optimizations over power networks are polynomial-time solvable due to the passivity of transmission lines and transformers.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Edge Function method formerly developed by Quinlan(25) is applied to solve the problem of thin elastic plates resting on spring supported foundations subjected to lateral loads the method can be applied to plates of any convex polygonal shapes, however, since most plates are rectangular in shape, this specific class is investigated in this thesis. The method discussed can also be applied easily to other kinds of foundation models (e.g. springs connected to each other by a membrane) as long as the resulting differential equation is linear. In chapter VII, solution of a specific problem is compared with a known solution from literature. In chapter VIII, further comparisons are given. The problems of concentrated load on an edge and later on a corner of a plate as long as they are far away from other boundaries are also given in the chapter and generalized to other loading intensities and/or plates springs constants for Poisson's ratio equal to 0.2

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The velocity of selectively-introduced edge dislocations in 99.999 percent pure copper crystals has been measured as a function of stress at temperatures from 66°K to 373°K by means of a torsion technique. The range of resolved shear stress was 0 to 15 megadynes/ cm^2 for seven temperatures (66°K, 74°K, 83°K, 123°K, 173°K, 296°K, 296°K, 373°K.

Dislocation mobility is characterized by two distinct features; (a) relatively high velocity at low stress (maximum velocities of about 9000 em/sec were realized at low temperatures), and (b) increasing velocity with decreasing temperature at constant stress.

The relation between dislocation velocity and resolved shear stress is:

v = v_o(τ_r/τ_o)^n

where v is the dislocation velocity at resolved shear stress τ_r, v_o is a constant velocity chosen equal to 2000 cm/ sec, τ_o is the resolved shear stress required to maintain velocity v_o, and n is the mobility coefficient. The experimental results indicate that τ_o decreases from 16.3 x 10^6 to 3.3 x 10^6 dynes/cm^2 and n increases from about 0.9 to 1.1 as the temperature is lowered from 296°K to 66°K.

The experimental dislocation behavior is consistent with an interpretation on the basis of phonon drag. However, the complete temperature dependence of dislocation mobility could not be closely approximated by the predictions of one or a combination of mechanisms.