Discrete Newton methods and iterated defect corrections

Summary In this paper we present a general theory for discrete Newton methods, iterated defect corrections via neighbouring problems and deferred corrections based on asymptotic expansions of the discretization error.Dedicated to Professor Dr. J. Weisinger on the occasion of his sixty-fifth birthday     

Computations in choice groupoids

Defining achoice as a mapping of the subsets of a setX into their respective subsets, a one-to-one (and naturally) corresponding binary operation,sequential choice, is identified under which the power set ofX is closed as achoice groupoid. A complete logical diagram is given, exhibiting all the implications between conjunctions of the seven conditions: (1) idempotence, (2) consistency, (3) absorbence, and (4) homomorphism of a choice, and (5) commutativity, (6) associativity, and (7) path-independence of the corresponding sequential choice.     

Microstructure evolution model in micromagnetics

The proposed model combines tendency for minimization of Gibbs magnetic energy with the rate-independent maximum-dissipation mechanism that reflects the macroscopical quantity of energy required to change one pole of a magnet to another. The microstructure is described on a mesoscopical level in terms of Young measures. Such mesoscopical, distributed-parameter model is formulated (and, after a suitable regularization), analyzed, discretized, implemented, and eventually tested computationally on a uni-axial magnet. The desired hysteresis macroscopical response is demonstrated together with the influence of material properties.     

A Niche Width Model of Optimal Specialization

Niche width theory, a part of organizational ecology, predicts whether specialist or generalist forms of organizations have higher fitness, in a continually changing environment. To this end, niche width theory uses a mathematical model borrowed from biology. In this paper, we first loosen the specialist-generalist dichotomy, so that we can predict the optimal degree of specialization. Second, we generalize the model to a larger class of environmental conditions, on the basis of the model's underlying assumptions. Third, we criticize the way the biological model is treated in sociological theory. Two of the model's dimensions seem to be confused, i.e., that of trait and environment; the predicted optimal specialization is a property of individual organizations, not of populations; and, the distinction between fine and coarse grained environments is superfluous.     

Staircase kernels for orthogonald-polytopes

LetS be a finite union of boxes inR ^d . Forx inS, defineA _x ={yx is clearly visible fromy via staircase paths inS}, and let KerS denote the staircase kernel ofS. Then KerS={A _x x is a point of local nonconvexity ofS}. A similar result holds with clearly visible replaced by visible and points of local nonconvexity ofS replaced by boundary points ofS.Supported in part by NSF grant DMS-9207019.     

Bergman-Vekua theory in differential form

We develop Bergman-Vekua integral operator theory on the basis of a new kind of series suggested by polynomial operators (classP _j operators); in a sense, this is an analog of the Weierstrass approach as opposed to the Cauchy-Riemann approach in classical complex analysis, which also has advantages over the original form in boundary value problems and other applications.Dedicated to the memory of my friend, Peter Henrici     

On generalized Stackelberg strategies

The concept of Stackelberg strategy for a nonzero-sum two-person game is extended to allow for a nonunique rational response of the follower. This leads to the notion of a generalized Stackelberg strategy for the leader, which guarantees him a cost value that cannot be exceeded, no matter what the rational response of the follower. Then, a generalized Stackelberg strategy pair is defined. A simple example is given. The idea of a generalized Stackelberg strategy and strategy pair is then applied to the situation of one leader and many rational followers.This paper is based on research supported by the National Science Foundation.     

Maximum monoreflections

It is shown that, in a category with a specified class of monics and under some mild hypothesis,there is a monoreflection maximum among those whose reflection maps lie in . Thus, for example, any variety, and most SP-classes in a variety, have both amaximum monoreflection and amaximum essential reflection (which might be the same, but frequently aren't, and which might be the identity functor, but frequently aren't). And, for example, under some mild hypotheses, beneath each completion lies a maximum monoreflection, so that, for example, any category of rings has amaximum functorial ring of quotients.     

On the continuity of midpoint hull convex set-valued functions

Summary The concept of hull convexity (midpoint hull convexity) for set-valued functions in vector spaces is examined. This concept, introduced by A. V. Fiacco and J. Kyparisis (Journal of Optimization Theory and Applications,43 (1986), 95–126), is weaker than one of convexity (midpoint convexity).The main result is a sufficient condition for a midpoint hull convex set-valued function to be continuous. This theorem improves a result obtained by K. Nikodem (Bulletin of the Polish Academy of Sciences, Mathematics,34 (1986), 393–399).     

On a pair of functional equations of combinatorial interest

The equations of the title appear in the author's paper Chromatic Sums for Rooted Planar Triangulations, V: Special Equations. (Canadian Journal of Mathematics, 26 (1974), 893–907). They appear in that paper as Equations (24) and (25). They are simultaneous equations for two unknown functionsl andy ₂ of two variablesy ₁ andz. A parameter is involved. The main result is that for = 2 cos (2/n), wheren is a positive integer >1, the two equations can be reduced to a single equation (numbered (49)). Solutions of this are known forn <7. From such solutions we can expect to get information about the averaged chromatic polynomials of planar triangulations with a given number of triangles.The present work is basically an expository paper on the theory given in Chromatic Sums, V, but it includes some new results and many simplifications.     

Characterization of regular singular linear systems of difference equations

This paper deals with linear systems of difference equations whose coefficients admit generalized factorial series representations atz=. We are concerned with the behavior of solutions near the pointz= (the only fixed singularity for difference equations). It is important to know whether a system of linear difference equations has a regular singularity or an irregular singularity. To a given system () we can assign a number , called the Moser's invariant of (), so that the system is regular singular if and only if 1. We shall develop an algorithm, implementable in a computer algebra system, which reduces in a finite number of steps the system of difference equations to an irreducible form. The computation ot the number can be done explicitly from this irreducible form.     

Design of manufacturing systems using queueing models

Design issues in various types of manufacturing systems such as flow lines, automatic transfer lines, job shops, flexible machining systems, flexible assembly systems and multiple cell systems are addressed in this paper. Approaches to resolving these design issues of these systems using queueing models are reviewed. In particular, we show how the structural properties that are recently derived for single and multiple stage queueing systems can be used effectively in the solution of certain design optimization problems.Supported in part by the Natural Sciences and Engineering Research Council of Canada via Operating and Strategic Grants on Modeling and Analyses of Production Systems and Modeling and Implementation of Just-in-Time Cells.Supported in part by the NSF Grants ECS-8811234 and DDM-9113008 and by Sloan Foundation Grants for the Consortium for Competitiveness and Cooperation and for the study on Competitive Semiconductor Manufacturing.     

Partly convex programming and zermelo's navigation problems

Mathematical programs, that become convex programs after freezing some variables, are termed partly convex. For such programs we give saddle-point conditions that are both necessary and sufficient that a feasible point be globally optimal. The conditions require cooperation of the feasible point tested for optimality, an assumption implied by lower semicontinuity of the feasible set mapping. The characterizations are simplified if certain point-to-set mappings satisfy a sandwich condition.The tools of parametric optimization and basic point-to-set topology are used in formulating both optimality conditions and numerical methods. In particular, we solve a large class of Zermelo's navigation problems and establish global optimality of the numerical solutions.Research partly supported by NSERC of Canada.     

A characteristic property of elliptic Plücker transformations

We discuss elliptic Plücker transformations of three-dimensional elliptic spaces. These are permutations on the set of lines such that any two related (orthogonally intersecting or identical) lines go over to related lines in both directions. It will be shown that for classical elliptic 3-spaces a bijection of its lines is already a Plücker transformation, if related lines go over to related lines. Moreover, if the ground field admits only surjective monomorphisms, then bijection can be replaced by injection.Dedicated to Walter Benz on the occasion of his 65th birthday     

Weyl's theorem for operator matrices

Weyl's theorem holds for an operator when the complement in the spectrum of the Weyl spectrum coincides with the isolated points of the spectrum which are eigenvalues of finite multiplicity. By comparison Browder's theorem holds for an operator when the complement in the spectrum of the Weyl spectrum coincides with Riesz points. Weyl's theorem and Browder's theorem are liable to fail for 2×2 operator matrices. In this paper we explore how Weyl's theorem and Browder's theorem survive for 2×2 operator matrices on the Hilbert space.Supported in part by BSRI-97-1420 and KOSEF 94-0701-02-01-3.     

Bounds of mixed semi-invariants of random processes

The paper deals with questions of bounds on mixed semi-invariants of a random process x_t which satisfies a mixing condition either according to Rosenblatt or according to Ibragimov.Translated from Matematicheskie Zametki, Vol. 13, No. 4, pp. 581–586, April, 1973.     

Parameters of the periodic response of a system with friction-affected constraints and harmonic excitation

Summary The periodic response of a single-freedom multi-body system with friction-affected constraints acted upon by a harmonic excitation is determined by numerical simulation. The contribution of the constraints to the generalized friction force, the influence of gravity and zero-gravity environment, and the consequences, when several constraints are considered without friction, are investigated. The effects of a small artificial damping on the response, and the possibilities of an equivalent damping for the friction-affected constraints are also examined.

---

Zusammenfassung Die periodische Bewegung eines Mehrkörpersystems mit einem Freiheitsgrad und reibungsbehafteten Bindungen bei harmonischer Erregung wird durch numerische Simulation bestimmt. Untersucht werden der Beitrag der Bindungen zur verallgemeinerten Reibungskraft, der Einfluß des Schwerefeldes und der Schwerelosigkeit und die Folgen, wenn einige Bindungen als reibungsfrei angenommen werden. Die Auswirkungen einer kleinen künstlichen Dämpfung auf die Bewegung, und die Möglichkeiten einer äquivalenten Dämpfung an Stelle der reibungsbehafteten Bindungen wird auch untersucht.

     

Chapter 1 Introduction: Extensions and new developments in DEA

The extensions, new developments and new interpretations for DEA covered in this paper include: (1) new measures of efficiency, (2) new models and (3) new ways of implementing established models with new results and interpretations presented that include treatments of congestion, returns-to-scale and mix and technical inefficiencies and measures of efficiency that can be used to reflect all pertinent properties. Previously used models, such as those used to identify allocative inefficiencies, are extended by means of assurance region approaches which are less demanding in their information requirements and underlying assumptions. New opportunities for research are identified in each section of this chapter. Sources of further developments and possible sources for further help are also suggested with references supplied to other papers that appear in this volume and which are summarily described in this introductory chapter.     

Simplifying assumptions for the order of partitioned multivalue methods

In solving a system of ordinary differential equations by multivalue methods, the concept of partitioning such a method into two parts corresponding to internal and external computations has recently been introduced by Burrage and Butcher [3]. In this paper the order conditions for such methods will be given and simplifying assumptions for them derived. Various examples are presented and, in particular, a new class of methods is introduced and its order properties are studied.     

A Measure of Simultaneous Approximation for Quasi-Modular Functions

We improve on a recent result of Saradha giving a transcendence measure for the quotient of a period of an elliptic curve defined over by its associated quasi-period. In an (almost successful) attempt to include in a single measure both this result and that obtained by Reyssat in 1980, we blend into the modular method ideas related to modular but also hypergeometric functions, as appearing e.g. in André's work, as well as some Galois considerations.