Matrices whose hermitian part is positive definite

We are concerned with the class ∏_n of nxn complex matrices A for which the Hermitian part H(A) = A+A*/2 is positive definite.

Various connections are established with other classes such as the stable, D-stable and dominant diagonal matrices. For instance it is proved that if there exist positive diagonal matrices D, E such that DAE is either row dominant or column dominant and has positive diagonal entries, then there is a positive diagonal F such that FA ϵ ∏_n.

Powers are investigated and it is found that the only matrices A for which A^m ϵ ∏_n for all integers m are the Hermitian elements of ∏_n. Products and sums are considered and criteria are developed for AB to be in ∏_n.

Since ∏_n n is closed under inversion, relations between H(A)^-1 and H(A^-1) are studied and a dichotomy observed between the real and complex cases. In the real case more can be said and the initial result is that for A ϵ ∏_n, the difference H(adjA) - adjH(A) ≥ 0 always and is ˃ 0 if and only if S(A) = A-A*/2 has more than one pair of conjugate non-zero characteristic roots. This is refined to characterize real c for which cH(A^-1) - H(A)^-1 is positive definite.

The cramped (characteristic roots on an arc of less than 180°) unitary matrices are linked to ∏_n and characterized in several ways via products of the form A ^-1A*.

Classical inequalities for Hermitian positive definite matrices are studied in ∏_n and for Hadamard's inequality two types of generalizations are given. In the first a large subclass of ∏_n in which the precise statement of Hadamardis inequality holds is isolated while in another large subclass its reverse is shown to hold. In the second Hadamard's inequality is weakened in such a way that it holds throughout ∏_n. Both approaches contain the original Hadamard inequality as a special case.

I. Studies on alkaline phosphatase activity in developing sea urchin embryos. II. Studies on the activation of protein biosynthesis in sea urchin eggs at fertilization

I. Alkaline phosphatase activity in the developing sea urchin Lytechinus pictus has been investigated with respect to intensity at various stages, ionic requirements and intracellular localization. The activity per embryo remains the same in the unfertilized egg, fertilized egg and cleavage stages. At a time just prior to gastrulation (about 10 hours after fertilization) the activity per embryo begins to rise and increases after 300 times over the activity in the cleavage stages during the next 60 hours.

The optimum ionic strength for enzymatic activity shows a wide peak at 0.6 to 1.0. Calcium and magnesium show an additional optimum at a concentration in the range of 0.02 to 0.07 molar. EDTA at concentrations of 0.0001 molar and higher shows a definite inhibition of activity.

The intracellular localization of alkaline phosphatase in homogenates of 72-hour embryos has been studied employing the differential centrifugation method. The major portion of the total activity in these homogenates was found in mitochondrial and microsomal fractions with less than 5% in the nuclear fraction and less than 2% in the final supernatant. The activity could be released from all fractions by treatment with sodium deoxycholate.

II. The activation of protein biosynthesis at fertilization in eggs of the sea urchins Lytechinus pictus and Strongylocentrotus purpuratus has been studied in both intact eggs and cell-free homogenates. It is shown that homogenates from both unfertilized and fertilized eggs are dependent on potassium and magnesium ions for optimum amino acid incorporation activity and in the case of the latter the concentration range is quite narrow. Though the optimum magnesium concentrations appear to differ slightly in homogenates of unfertilized and fertilized eggs, in no case was it observed that unfertilized egg homogenates were stimulated to incorporate at a level comparable to that of the fertilized eggs.

An activation of amino acid incorporation into protein has also been shown to occur in parthenogenetically activated non-nucleate sea urchin egg fragments or homogenates thereof. This activation resembles that in the fertilized whole egg or fragment both in amount and pattern of activation. Furthermore, it is shown that polyribosomes form in these non-nucleate fragments upon artificial activation. These findings are discussed along with possible mechanisms for activation of the system at fertilization.

Time-dependent monoenergetic neutron transport in two adjacent semi-infinite media

An exact solution to the monoenergetic Boltzmann equation is obtained for the case of a plane isotropic burst of neutrons introduced at the interface separating two adjacent, dissimilar, semi-infinite media. The method of solution used is to remove the time dependence by a Laplace transformation, solve the transformed equation by the normal mode expansion method, and then invert to recover the time dependence.

The general result is expressed as a sum of definite, multiple integrals, one of which contains the uncollided wave of neutrons originating at the source plane. It is possible to obtain a simplified form for the solution at the interface, and certain numerical calculations are made there.

The interface flux in two adjacent moderators is calculated and plotted as a function of time for several moderator materials. For each case it is found that the flux decay curve has an asymptotic slope given accurately by diffusion theory. Furthermore, the interface current is observed to change directions when the scattering and absorption cross sections of the two moderator materials are related in a certain manner. More specifically, the reflection process in two adjacent moderators appears to depend initially on the scattering properties and for long times on the absorption properties of the media.

This analysis contains both the single infinite and semi-infinite medium problems as special cases. The results in these two special cases provide a check on the accuracy of the general solution since they agree with solutions of these problems obtained by separate analyses.

Nuclear structure effects in internal conversion

Experimental studies of nuclear effects in internal conversion in Ta¹⁸¹ and Lu¹⁷⁵ have been performed. Nuclear structure effects (“penetration” effects), in internal conversion are described in general. Calculation of theoretical conversion coefficients are outlined. Comparisons with the theoretical conversion coefficient tables of Rose and Sliv and Band are made. Discrepancies between our results and those of Rose and Sliv are noted. The theoretical conversion coefficients of Sliv and Band are in substantially better agreement with our results than are those of Rose. The ratio of the M1 penetration matrix element to the M1 gamma-ray matrix element, called λ, is equal to + 175 ± 25 for the 482 keV transition in Ta¹⁸¹ . The results for the 343 keV transition in Lu¹⁷⁵ indicate that λ may be as large as – 8 ± 5. These transitions are discussed in terms of the unified collective model. Precision L subshell measurements in Tm¹⁶⁹ (130keV), W¹⁸² (100 keV), and Ta¹⁸¹ (133 keV) show definite systematic deviations from the theoretical conversion coefficients. The possibility of explaining these deviations by penetration effects is investigated and is shown to be excluded. Other explanations of these anomalies are discussed.

Metallogenic Provinces of the Southwestern United States and Northern Mexico

Some of the metallogenic provinces of the southwestern United States and northern Mexico are defined by the geographic distribution of trace elements in the primary sulfide minerals chalcopyrite and sphalerite. The elements investigated include antimony, arsenic, bismuth, cadmium, cobalt, gallium, germanium, indium, manganese, molybdenum, nickel, silver, tellurium, thallium, and tin. Of these elements, cobalt, gallium, germanium, indium, nickel, silver, and tin exhibit the best defined geographic distribution.

The data indicate that chalcopyrite is the preferred host for tin and perhaps molybdenum; sphalerite is the preferred host for cadmium, gallium, germanium, indium, and manganese; galena is the preferred host for antimony, bismuth, silver, tellurium, and thallium; and pyrite is the preferred host for cobalt, nickel, and perhaps arsenic. With respect to the two minerals chalcopyrite and sphalerite, antimony, arsenic, molybdenum, nickel, silver, and tin prefer chalcopyrite; and bismuth, cadmium, cobalt, gallium, germanium, indium, manganese, and thallium prefer sphalerite. This distribution probably is the result of the interaction of several factors, among which are these: the various radii of the elements, the association due to chemical similarities of the major and trace elements, and the degree of ionic versus covalent and metallic character of the metal-sulfur bonds in chalcopyrite and sphalerite. The type of deposit, according to a temperature classification, appears to be of minor importance in determining the trace element content of chalcopyrite and sphalerite.

A preliminary investigation of large single crystals of sphalerite and chalcopyrite indicates that the distribution within a single crystal of some elements such as cadmium in sphalerite and indium and silver in chalcopyrite is relatively uniform, whereas the distribution of some other elements such as cobalt and manganese in sphalerite is somewhat less uniform and the distribution of tin in sphalerite is extremely erratic. The variations in trace element content probably are due largely to variations in the composition of the fluids during the growth of the crystals, but the erratic behavior of tin in sphalerite perhaps is related to the presence of numerous cavities and inclusions in the crystal studied.

Maps of the geographic distribution of trace elements in chalcopyrite and sphalerite exhibit three main belts of greater than average trace element content, which are called the Eastern, Central, and Western belts. These belts are consistent in trend and position with a beltlike distribution of copper, gold, lead, zinc, silver, and tungsten deposits and with most of the major tectonic features. However, there appear to be no definite time relationships, for as many as four metallogenic epochs, from Precambrian to late Tertiary, are represented by ore deposits within the Central belt.

The evidence suggests that the beltlike features have a deep seated origin, perhaps in the sub-crust or outer parts of the mantle, and that the deposits within each belt might be genetically related through a beltlike compositional heterogeneity in the source regions of the ores. Hence, the belts are regarded as metallogenic provinces.

Distributed Control and Optimization for Communication and Power Systems

We are at the cusp of a historic transformation of both communication system and electricity system. This creates challenges as well as opportunities for the study of networked systems. Problems of these systems typically involve a huge number of end points that require intelligent coordination in a distributed manner. In this thesis, we develop models, theories, and scalable distributed optimization and control algorithms to overcome these challenges.

This thesis focuses on two specific areas: multi-path TCP (Transmission Control Protocol) and electricity distribution system operation and control. Multi-path TCP (MP-TCP) is a TCP extension that allows a single data stream to be split across multiple paths. MP-TCP has the potential to greatly improve reliability as well as efficiency of communication devices. We propose a fluid model for a large class of MP-TCP algorithms and identify design criteria that guarantee the existence, uniqueness, and stability of system equilibrium. We clarify how algorithm parameters impact TCP-friendliness, responsiveness, and window oscillation and demonstrate an inevitable tradeoff among these properties. We discuss the implications of these properties on the behavior of existing algorithms and motivate a new algorithm Balia (balanced linked adaptation) which generalizes existing algorithms and strikes a good balance among TCP-friendliness, responsiveness, and window oscillation. We have implemented Balia in the Linux kernel. We use our prototype to compare the new proposed algorithm Balia with existing MP-TCP algorithms.

Our second focus is on designing computationally efficient algorithms for electricity distribution system operation and control. First, we develop efficient algorithms for feeder reconfiguration in distribution networks. The feeder reconfiguration problem chooses the on/off status of the switches in a distribution network in order to minimize a certain cost such as power loss. It is a mixed integer nonlinear program and hence hard to solve. We propose a heuristic algorithm that is based on the recently developed convex relaxation of the optimal power flow problem. The algorithm is efficient and can successfully computes an optimal configuration on all networks that we have tested. Moreover we prove that the algorithm solves the feeder reconfiguration problem optimally under certain conditions. We also propose a more efficient algorithm and it incurs a loss in optimality of less than 3% on the test networks.

Second, we develop efficient distributed algorithms that solve the optimal power flow (OPF) problem on distribution networks. The OPF problem determines a network operating point that minimizes a certain objective such as generation cost or power loss. Traditionally OPF is solved in a centralized manner. With increasing penetration of volatile renewable energy resources in distribution systems, we need faster and distributed solutions for real-time feedback control. This is difficult because power flow equations are nonlinear and kirchhoff's law is global. We propose solutions for both balanced and unbalanced radial distribution networks. They exploit recent results that suggest solving for a globally optimal solution of OPF over a radial network through a second-order cone program (SOCP) or semi-definite program (SDP) relaxation. Our distributed algorithms are based on the alternating direction method of multiplier (ADMM), but unlike standard ADMM-based distributed OPF algorithms that require solving optimization subproblems using iterative methods, the proposed solutions exploit the problem structure that greatly reduce the computation time. Specifically, for balanced networks, our decomposition allows us to derive closed form solutions for these subproblems and it speeds up the convergence by 1000x times in simulations. For unbalanced networks, the subproblems reduce to either closed form solutions or eigenvalue problems whose size remains constant as the network scales up and computation time is reduced by 100x compared with iterative methods.

On the Lyapunov transformation for stable matrices

The matrices studied here are positive stable (or briefly stable). These are matrices, real or complex, whose eigenvalues have positive real parts. A theorem of Lyapunov states that A is stable if and only if there exists H ˃ 0 such that AH + HA* = I. Let A be a stable matrix. Three aspects of the Lyapunov transformation L_A :H → AH + HA* are discussed.

1. Let C₁ (A) = {AH + HA* :H ≥ 0} and C₂ (A) = {H: AH+HA* ≥ 0}. The problems of determining the cones C₁(A) and C₂(A) are still unsolved. Using solvability theory for linear equations over cones it is proved that C₁(A) is the polar of C₂(A*), and it is also shown that C₁ (A) = C₁(A^-1). The inertia assumed by matrices in C₁(A) is characterized.

2. The index of dissipation of A was defined to be the maximum number of equal eigenvalues of H, where H runs through all matrices in the interior of C₂(A). Upper and lower bounds, as well as some properties of this index, are given.

3. We consider the minimal eigenvalue of the Lyapunov transform AH+HA*, where H varies over the set of all positive semi-definite matrices whose largest eigenvalue is less than or equal to one. Denote it by ψ(A). It is proved that if A is Hermitian and has eigenvalues μ₁ ≥ μ₂…≥ μ_n ˃ 0, then ψ(A) = -(μ₁-μ_n)²/(4(μ₁ + μ_n)). The value of ψ(A) is also determined in case A is a normal, stable matrix. Then ψ(A) can be expressed in terms of at most three of the eigenvalues of A. If A is an arbitrary stable matrix, then upper and lower bounds for ψ(A) are obtained.