A note on the efficient solution of matrix pencil systems

Algorithms for solving matrix pencil systems of linear equations, of the form (A+B)x=c+d, are developed and analysed. The techniques that are discussed are based on methods for the generalized eigenvalue problem and avoid refactoring a matrix when the scalar changes. Numerical results are presented which demonstrate the advantages of the new techniques.The work of the first author was supported by the National Research Council of Canada and that of the second author by the National Science Foundation under Grant # MCS 76-24433.     

The generating hypothesis in the derived category of a ring

We show that a strong form (the fully faithful version) of the generating hypothesis, introduced by Freyd in algebraic topology, holds in the derived category of a ring R if and only if R is von Neumann regular. This extends results of the second author (J. Pure Appl. Algebra 208(2), 2007). We also characterize rings for which the original form (the faithful version) of the generating hypothesis holds in the derived category of R. These must be close to von Neumann regular in a precise sense, and, given any of a number of finiteness hypotheses, must be von Neumann regular. However, we construct an example of such a ring that is not von Neumann regular and therefore does not satisfy the strong form of the generating hypothesis.     

Computation of total,differential and double-differential cross sections for compound nuclear reactions of the type (a,b γ) and (a,b γ−γ)

Zusammenfassung Zur vollautomatischen Berechnung von totalen, differentiellen und doppeldifferentiellen Wirkungsquerschnitten im Falle von Kernreaktionen des Typus (a, b, ) und (a, b –) wurden Programme in der ALGOL-64-Sprache aufgestellt, die für einen schnellen Computer, wie die CDC 1604-A, geeignet sind. Wie hier beschrieben, liefern sie entsprechende Winkelverteilungen und Winkelkorrelationen in absoluter und normierter Form für Reaktionen, bei denen Spin-1/2-Teilchena (z. B. Nukleonen) mit willkürlichem Bahndrehimpuls von einem Targetkern (dessen Spin im Grundzustand ganz- oder halbzahlig sein darf) aufgefangen werden, unter Bildung eines kurzlebigen Zwischenkernes, dessen Energieniveaus ein statistisches Quasi-Kontinuum bilden, und der unter Emission von Spin-1/2-Teilchenb mit beliebigem Bahndrehimpuls in einen angeregten Zustand eines Restkerns zerfällt. Die Programme ermöglichen es, weitere Ausgangskanäle des Zwischenzustandes sowie gemischte Multipolarität beim -Zerfall des Restkerns zu berücksichtigen; ferner können sie, durch Wahl geeigneter Transmissionskoeffizienten, den Einfluss einer Spin-Bahn-Wechselwirkung miteinschliessen. Sie dienen weiter zur Berechnung des Beitrages weiterer -Kaskaden durch die Behandlung von Fällen der Art (a, b ₁– ₁), bei denen der ₁ unbeobachtet bleibt, während ₂ beobachtet wird. Bei der Winkelverteilung von -übergangsstrahlung gemischter Multipolarität werden normierte, wie auch absolute Entwicklungskoeffizienten der Legendre-Polynomreihe für reine Multipolarität und für gemischte Multipolarität mit einem vorgegebenen Mischungsverhältnis berechnet. Ferner wird ein weiterer Satz von Mischungsverhältnissen behandelt, was zur Bestimmung unbekannter Verhältnisse oder Spin-Paritäts-Zuordnungen eines Kernzustands führen kann.Weitere Möglichkeiten im Falle von Teilchen- und/oder -Verteilungen (wenn die letzteren keinen unbeobachteten -Übergang einschliessen) wurden eingebaut, die automatisch eine systematische Änderung des Spins (mit positiverund negativer Parität) des durch die austretenden Teilchenb bevölkerten Niveaus für irgendeine anfängliche Spin-Sequenz durchführen. Weitere schnelle Computer-Programme, die mit den obigen verwandt sind, werden zusammenfassend diskutiert.     

Untersuchung der Reaktion Bi209 (n, λ) Bi210 mit einer Gamma-Gamma-Koinzidenzmethode

Summary For the reaction Bi²⁰⁹ (n, ) Bi²¹⁰, theQ-value as determined from a suitablereaaction chain exceeds that indicated by the -line of maximum energy as measured with a magnetic pair spectrometer. Coincidence investigations have therefore been undertaken to search for --cascades: transitions for 117, 165, 275, 396 and 507 keV have been detected in coincidence with the lines at 4 MeV. The intensities of the former lines have been elucidated and are discussed. The most probable value for the neutron binding energy is thereby indicated to be 4·56 MeV.     

An extension of the fenchel theorem

We give an extension of the Fenchel-Borsuk result by introducing the total absolute torsion-curvature KT() for regular curves whose tangent indicatrix is a piecewise regular curve (-closed curves). We prove that KT() is low bounded by 2 and we give a geometric characterization for the -closed curves whose KT() is minimal.     

Refinement monoids with weak comparability and applications to regular rings and -algebras

We prove a cancellation theorem for simple refinement monoids satisfying the weak comparability condition, first introduced by K.C. O'Meara in the context of von Neumann regular rings. This result is then applied to von Neumann regular rings and -algebras of real rank zero via the monoid of isomorphism classes of finitely generated projective modules.

     

Conorm and Essential Conorm in C*-Algebras

Let A be a unital C^*-algebra with non-zero socle (soc(A)). We introduce the essential conorm of an element a in A (denoted by γ _e (a)), as the conorm of the element π(a), where π denotes the canonical projection of A onto . It is established that for every von Neumann regular element , γ _e (a) = max . We characterize the continuity points of the conorm and essential conorm for extremally rich C^*-algebras. Some formulae for the distance from zero to the generalized spectrum and Atkinson spectrum are also obtained. Authors partially supported by I+D MEC projects no. MTM2005-02541 and MTM2007-65959, and Junta de Andalucía grants FQM0199 and FQM1215.     

On the choice of γ for singly-implicit RK or Rosenbrock methods

Following the slogan a picture is better than thousand data, for restricted Padé approximations with one realm-fold pole atz=1/ of orderm, we plot the error constants, the maximal error for negative realz as functions of, as well as the regions ofA- resp.A(0)-stability.     

The γ-borel conjecture

In this paper we prove that it is consistent that every -set is countable while not every strong measure zero set is countable. We also show that it is consistent that every strong -set is countable while not every -set is countable. On the other hand we show that every strong measure zero set is countable iff every set with the Rothberger property is countable.Thanks to Boise State University for support during the time this paper was written and to Alan Dow for some helpful discussions and to Boaz Tsaban for some suggestions to improve an earlier version.     

On theA 0-acceptability of rational approximations to the exponential function with only real poles

We consider rational approximations to the exponential function with real poles, ₁ ^–1 ,..., _m ^–1 , that correspond to implicit Runge-Kutta collocation methods. We show that if _i 1/2,i=1,...,m, the rational approximation isA ₀-acceptable.     

Remarks on restrained domination and total restrained domination in graphs

The restrained domination number ^r(G) and the total restrained domination number _t ^r (G) of a graph G were introduced recently by various authors as certain variants of the domination number (G) of (G). A well-known numerical invariant of a graph is the domatic number d(G) which is in a certain way related (and may be called dual) to (G). The paper tries to define analogous concepts also for the restrained domination and the total restrained domination and discusses the sense of such new definitions.This research was supported by Grant MSM 245100303 of the Ministry of Education, Youth and Sports of the Czech Republic.     

A property of nonlinear elliptic equations when the right-hand side is a measure

LetA(u)=–diva(x, u, Du) be a Leray-Lions operator defined onW ₀ ^1,p () and be a bounded Radon measure. For anyu SOLA (Solution Obtained as Limit of Approximations) ofA(u)= in ,u=0 on , we prove that the truncationsT _k(u) at heightk satisfyA(T _k(u)) A(u) in the weak * topology of measures whenk + .

---

Résumé SoitA(u)=–diva(x, u, Du) un opérateur de Leray-Lions défini surW ₀ ^1,p () et une mesure de Radon bornée. Pour toutu SOLA (Solution Obtenue comme Limite d'Approximations) deA(u)= dans ,u=0 sur , nous démontrons que les troncaturesT _k(u) à la hauteurk vérifientA(T _k(u)) A(u) dans la topologie faible * des mesures quandk + .

     

Almost Fredholm operators in von Neumann algebras

LetA be a von Neumann algebra,J be the ideal of compact operators relative toA and letF ₊ be the left-Fredholm class ofA. We call almost left-Fredholm the class = {A A: if P A is a projection and AP J then P J}. Then and the inclusion is proper unlessA is semifinite and has a non-large center. satisfies all of the algebraic properties ofF ₊ but it is generally not open. IfA is semifinite then A iff there are central projectionsG with G = I such that AG F₊(AG). Let :A A/J. Then the left almost essential spectrum ofA A, , coincides with the set of eigenvalues of (A)     

Min-max game theory and algebraic Riccati equations for boundary control problems with continuous input-solution map. Part II: The general case

We consider the abstract dynamical framework of [LT3, class (H.2)] which models a variety of mixed partial differential equation (PDE) problems in a smooth bounded domain ⁿ , arbitraryn, with boundaryL ₂-control functions. We then set and solve a min-max game theory problem in terms of an algebraic Riccati operator, to express the optimal quantities in pointwise feedback form. The theory obtained is sharp. It requires the usual Finite Cost Condition and Detectability Condition, the first for existence of the Riccati operator, the second for its uniqueness and for exponential decay of the optimal trajectory. It produces an intrinsically defined sharp value of the parameter, here called _c (critical), _c0, such that a complete theory is available for > _c, while the maximization problem does not have a finite solution if 0 < < _c. Mixed PDE problems, all on arbitrary dimensions, except where noted, where all the assumptions are satisfied, and to which, therefore, the theory is automatically applicable include: second-order hyperbolic equations with Dirichlet control, as well as with Neumann control, the latter in the one-dimensional case; Euler-Bernoulli and Kirchhoff equations under a variety of boundary controls involving boundary operators of order zero, one, and two; Schroedinger equations with Dirichlet control; first-order hyperbolic systems, etc., all on explicitly defined (optimal) spaces [LT3, Section 7]. Solution of the min-max problem implies solution of theH -robust stabilization problem with partial observation.The research of C. McMillan was partially supported by an IBM Graduate Student Fellowship and that of R. Triggiani was partially supported by the National Science Foundation under Grant NSF-DMS-8902811-01 and by the Air Force Office of Scientific Research under Grant AFOSR-87-0321.     

Hybrid misclassification minimization

Given two finite point setsA andB in then-dimensional real spaceR ⁿ , we consider the NP-complete problem of minimizing the number of misclassified points by a plane attempting to divideR ⁿ into two halfspaces such that each open halfspace contains points mostly ofA orB. This problem is equivalent to determining a plane {x | x ^T w=} that maximizes the number of pointsx A satisfying inx ^T w>, plus the number of pointsx B satisfyingx ^T w<. A simple but fast algorithm is proposed that alternates between (i) minimizing the number of misclassified points by translation of the separating plane, and (ii) a rotation of the plane so that it minimizes a weighted average sum of the distances of the misclassified points to the separating plane. Existence of a global solution to an underlying hybrid minimization problem is established. Computational comparison with a parametric approach to solve the NP-complete problem indicates that our approach is considerably faster and appears to generalize better as determined by tenfold cross-validation.This material is based on research supported by Air Force Office of Scientific Research Grant F49620-94-1-0036 and National Science Foundation Grant CCR-9322479.     

Symbolic dynamics and nonlinear semiflows

Summary For a transverse homoclinic orbit of a mapping (not necessarily invertible) on a Banach space, it is shown that the mapping restricted to orbits near is equivalent to the shift automorphism on doubly infinite sequences on finitely many symbols. Implications of this result for the Poincaré map of semiflows are given.This work was supported by the Air Force Office of Scientific Research under Grant #81-0198, by the National Science Foundation under Grant #MCS-8205355 and by the Army Research Office under Grant ù DAAG-29-83-K-0029.     

γ-Subdifferential and γ-convexity of functions on a normed space

In this paper, the -subdifferential is introduced for investigating the global behavior of real-valued functions on a normed spaceX. Iff: DX attains its global minimum onD atx ^*, then 0 f(x ^*). This necessary condition always holds, even iff is not continuous orx ^* is at the boundary of its domain. Nevertheless, it is useful because, by choosing a suitable ₊, many local minima cannot satisfy this necessary condition. For the sufficient conditions, the so-called -convex functions are defined. The class of these functions is rather large. For example, every periodic function on the real line is a -convex function. There are -convex functions which are not continuous everywhere. Every function of bounded variation can be represented as the difference of two -convex functions. For all that, -convex functions still have properties similar to those of convex functions. For instance, each -local minimizer off is at the same time a global one. Iff attains its global minimum onD, then it does so at least at one point of its -boundary.This research was supported by the Alexander von Humboldt Foundation. The author thanks Professors R. Bulirsch, K. H. Hoffmann, and H. G. Bock for inviting him to Munich and Augsburg where this research was done.     

A Generalization of Divided Domains and Its Connection to Weak Baer Going-Down Rings

Many results on going-down domains and divided domains are generalized to the context of rings with von Neumann regular total quotient rings. A (commutative unital) ring R is called regular divided if each P ∈ Spec(R)?(Max(R) ∩ Min(R)) is comparable with each principal regular ideal of R. Among rings having von Neumann regular total quotient rings, the regular divided rings are the pullbacks K× _K/P D where K is von Neumann regular, P ∈ Spec(K) and D is a divided domain. Any regular divided ring (for instance, regular comparable ring) with a von Neumann regular total quotient ring is a weak Baer going-down ring. If R is a weak Baer going-down ring and T is an extension ring with a von Neumann regular total quotient ring such that no regular element of R becomes a zero-divisor in T, then R ? T satisfies going-down. If R is a weak Baer ring and P ∈ Spec(R), then R + PR _(P) is a going-down ring if and only if R/P and R _P are going-down rings. The weak Baer going-down rings R such that Spec(R)?Min(R) has a unique maximal element are characterized in terms of the existence of suitable regular divided overrings.     

Der günstigste Bedienungskanal mit exponentiellem Zu- und Abgang bei ungeduldigen Kunden

Zusammenfassung Es wird ein System mit exponentiellem Zugang () und exponentieller Abfertigung () untersucht, bei dem sich die ungeduldigen Kunden nur dann der Warteschlange anschließen, wenn sie eine kurze Abfertigungszeit erwarten. Die (bekannte) Lösung des Problems führt auf eine unendliche PotenzreiheH(; ), die von zwei Parametern abhängt (=/; enthält ein Maß für die Ungeduld der Kunden). Für kleine Werte von und/oder genügen wenige Reihenglieder zur Berechnung vonH(; ). Für große Werte von und Werte von nahe bei 1 konvergiert die Reihe nur langsam. Für diesen Fall wird eine Integraldarstellung als Näherung hergeleitet, mit der man die kennzeichnenden Parameter des Systems (die mittlere LängeL der Schlange und ihre VarianzV) einfach findet. Schließlich werden die günstigsten Bedingungen (₀) so berechnet, daß der Gewinn aus dem Betrieb eines solchen Systems möglichst groß wird. Mit wachsendem AufwandverhältnisA/E (A = Kosten je mögliche Abfertigung,E = Einnahme je wirkliche Abfertigung) nimmt ₀ immer größere Werte an. Der je Zeiteinheit erzielbare größte GewinnG _max sinkt damit rasch ab.

---

Summary Impatient customers arriving exponentially at a single exponential service channel will join a queue only if they expect to be served within a short interval of time. The (known) solution to this problem involves an infinite power seriesH(;) depending on two parameters (=/; indirectly accounts for the degree of impatience of customers). For small values of and/or a few terms of the series suffice to computeH(; ). For large values of and values of near 1 the series converges only very slowly. It is shown that in this case the series can be approximated by an integral allowing the characteristic parameters of the system (mean lengthL and varianceV of the queue) to be easily determined. Finally, optimal conditions (₀) are derived which maximize the profit earned from running such a system. It turns out that ₀ is an increasing function of the ratioA/E (A = cost per potential service operation;E = revenue per actual service operation). At the same time the maximal profitG _max (per unit of time) falls off rapidly.

---

---

Vorgel v.:F. Ferschl