Generalized Solutions of Nonlinear Parabolic Equations and Diffusion Processes

We reduce the construction of a weak solution of the Cauchy problem for a quasilinear parabolic equation to the construction of a solution to a stochastic problem. Namely, we construct a diffusion process that allows us to obtain a probabilistic representation of a weak (in distributional sense) solution to the Cauchy problem for a nonlinear PDE.      

Moufang sets and jordan division algebras

We give a simple criterion which determines when a permutation group U and one additional permutation give rise to a Moufang set. We apply this criterion to show that every Jordan division algebra gives rise in a very natural way to a Moufang set, to provide sufficient conditions for a Moufang set to arise from a Jordan division algebra and to give a characterization of the projective Moufang sets over a commutative field of characteristic different from 2. The first author is a Postdoctoral Fellow of the Research Foundation – Flanders (Belgium) (FWO-Vlaanderen).     

On the properties of orthorecursive expansions with respect to subspaces

In a Hilbert space, for orthorecursive expansions with respect to closed subspaces, we establish a criterion for expansions of elements of a certain finite-dimensional subspace with respect to a finite sequence of subspaces to coincide with the expanded elements. This implies a criterion for an element to be equal to its orthorecursive expansion with respect to a finite sequence of subspaces. We also obtain a number of results related to the best approximations of elements by partial sums of their orthorecursive expansions with respect to a sequence of finite-dimensional subspaces.     

Preservation of the existence of fixed and coincidence points under homotopy of mappings of ordered sets

In problems of topology and analysis, well-known theorem on the preservation by any continuous homotopy of the property of a mapping to have a fixed point and the property of a pair of mappings to have a coincidence point are extensively applied. Thus, for contraction mappings and some of their generalizations, Frigon’s results on the preservation of the property to have a fixed point by a homotopy of a special type are known. This paper presents theorems on the preservation by order homotopy of the property of a pair of mappings to have a coincidence point. As a corollary, conditions under which such a homotopy preserves the property of a mapping to have a fixed point are obtained.     

A comparison of two sourcing tactics for a new component

We compare two sourcing tactics for a manufacturer to purchase a new component to be used in a one-time production run of a new product with uncertain and price-elastic demand. One alternative is to issue a request-for-quote (RFQ), which is where the manufacturer requests a price-quantity schedule from suppliers. The manufacturer uses this information to determine a production quantity and the number of components to purchase from each supplier. The other alternative is to post a bid specifying how the manufacturer’s purchase quantity will depend on the supplier’s component price. The suppliers use this information to compete on quantity.We find that relative to RFQ, which is more challenging for the manufacturer to characterize the supplier response due to the possibility of supplier interaction, the benefit to the manufacturer from posting a bid increases with the number of suppliers due to increased intensity of competition. If the new component is from an emerging industry where there is little mutual awareness among candidate suppliers, then regardless of number of suppliers, expected manufacturer profit is higher under RFQ. Posting a bid is more likely to benefit the manufacturer when the new component is from a more established industry with a high degree of awareness among candidate suppliers.     

Subspaces and quotients of Banach spaces with shrinking unconditional bases

The main result is that a separable Banach space with the weak* unconditional tree property is isomorphic to a subspace as well as a quotient of a Banach space with a shrinking unconditional basis. A consequence of this is that a Banach space is isomorphic to a subspace of a space with a shrinking unconditional basis if and only if it is isomorphic to a quotient of a space with a shrinking unconditional basis, which solves a problem dating to the 1970s. The proof of the main result also yields that a uniformly convex space with the unconditional tree property is isomorphic to a subspace as well as a quotient of a uniformly convex space with an unconditional finite dimensional decomposition.     

On Euler's Formula exp (iθ) = cosθ + i sinθ

In approximating a function with a pole‐like singularity at a non‐rational point a* by a rational polynomial, the approximating package will be robust (i.e. undetectably erroneous to a user) if the rational polynomial includes a factor which cancels out the pole to the full accuracy of the machine in use. Naturally in order to be portable, the approximation a to a* must be to the full machine accuracy of the receiving machine.     

Limit Functions for Convergence Groups and Uniformly Quasiregular Maps

We investigate the limit functions of iterates of a functionbelonging to a convergence group or of a uniformly quasiregularmapping. We show that it is not possible for a subsequence ofiterates to tend to a non-constant limit function, and for anothersubsequence of iterates to tend to a constant limit function.It follows that the closure of the stabiliser of a Siegel domainfor a uniformly quasiregular mapping is a compact abelian Liegroup, which we further conjecture to be infinite. This resultconcerning possible limits of convergent subsequences of iteratesfor holomorphic rational functions on the Riemann sphere isknown, and the only known method of proof involves universalcovering surfaces and Möbius groups. Hence, our methodyields a new and perhaps more elementary proof also in thatcase.     

A hybrid and integrated approach to evaluate and prevent disasters

Disasters are, by their nature, very complex phenomena. Their modelling using a systematic and logical methodology can help us identify their root causes and may facilitate in allocating appropriate resources to prevent such situations. Although techniques exist to model such phenomena, a single off-the-shelf model is insufficient to provide an effective and realistic analysis to prevent disasters due to its inherent assumptions. In order to overcome these limitations of single methods, this article proposes a hybrid model of four methods to optimise a safety investment. First, a hierarchy is constructed with a problem structuring approach. Second, a new graphical representation, the Crisis Tree Analysis, is introduced to visualise how a combination of basic events may lead to a disaster. Third, the criticality of each event is assessed using the Analytic Hierarchy Process. Finally, a mathematical programming model is proposed to calculate the optimal allocation of available funds in order to avoid the disaster. A case study of the Bhopal disaster is used to illustrate the proposed four-step method.     

A New Definition of A Priori Knowledge: In Search of a Modal Basis

In this paper I will offer a novel understanding of a priori knowledge. My claim is that the sharp distinction that is usually made between a priori and a posteriori knowledge is groundless. It will be argued that a plausible understanding of a priori and a posteriori knowledge has to acknowledge that they are in a constant bootstrapping relationship. It is also crucial that we distinguish between a priori propositions that hold in the actual world and merely possible, non-actual a priori propositions, as we will see when considering cases like Euclidean geometry. Furthermore, contrary to what Kripke seems to suggest, a priori knowledge is intimately connected with metaphysical modality, indeed, grounded in it. The task of a priori reasoning, according to this account, is to delimit the space of metaphysically possible worlds in order for us to be able to determine what is actual.     

Kato Space for Dirichlet Forms

We study the space of Kato measures relative to a Dirichlet form and we prove that a local solution of a problem relative to a Kato measure is locally continuous. Moreover if the measure of an intrinsic ball is equivalent to a power of the radius we prove also that the density of the form relative to a local solution is locally a Kato measure.     

On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm

This paper is devoted to the eigenvalue complementarity problem (EiCP) with symmetric real matrices. This problem is equivalent to finding a stationary point of a differentiable optimization program involving the Rayleigh quotient on a simplex (Queiroz et al., Math. Comput. 73, 1849–1863, 2004). We discuss a logarithmic function and a quadratic programming formulation to find a complementarity eigenvalue by computing a stationary point of an appropriate merit function on a special convex set. A variant of the spectral projected gradient algorithm with a specially designed line search is introduced to solve the EiCP. Computational experience shows that the application of this algorithm to the logarithmic function formulation is a quite efficient way to find a solution to the symmetric EiCP.     

A penalty approximation for a unilateral contact problem in non-linear elasticity

Using Ball's approach to non-linear elasticity, and in particular his concept of polyconvexity, we treat a unilateral three-dimensional contact problem for a hyperelastic body under volume and surface forces. Here the unilateral constraint is described by a sublinear function which can model the contact with a rigid convex cone. We obtain a solution to this generally non-convex, semicoercive Signorinin problem as a limit of solutions of related energy minimization problems involving friction normal to the contact surface where the friction coefficient goes to infinity. Thus we extend an approximation result of Duvaut and Lions for linear-elastic unilateral contact problems to finite deformations and to a class of non-linear elastic materials including the material models of Ogden and of Mooney-Rivlin for rubberlike materials. Moreover, the underlying penalty method is shown to be exact, that is a sufficiently large friction coefficient in the auxiliary energy minimization problems suffices to produce a solution of the original unilateral problem, provided a Lagrange multiplier to the unilateral constraint exists.     

An ergodic measure on a locally convex topological vector space

The aim of this paper is to give a way to construct a probability measure with nice ergodic properties on a locally convex topological vector space. We have two motivations; one is to give a generalization of a Gaussian measure and the other is to give an example of a probability measure with a rich kernel space.     

Modelling ship operational reliability over a mission under regular inspections

A ship is required to operate for a fixed mission period. Should a critical item of equipment fail at sea, the ship is subject to a costly event with potentially high risk to ship and crew. Given warning of a pending defect, the ship can try to return to port under its own power and thus attempt to avoid an at sea failure. Defects which lead to a failure are detected by inspection, and the task is to select the appropriate frequency of inspection to balance the number of occasions that a ship fails at sea and the number of preventive inspection based returns to port during a mission to correct a defect. The modelling entails using the delay time concept. Expressions are established for the expected number of preventive and failure returns over a mission, and an example given of a cost based balance to select an optimal inspection period. Although addressing ship reliability, the model has relevance to the mission reliability of any repairable equipment with remote main repair facilities.     

A consensus model of political decision-making

In this paper, a model of political consensus is introduced. Parties try to reach consensus in forming a government. A government is defined as a pair consisting of a winning coalition and a policy supported by this coalition, where a policy consists of policies on given issues. A party evaluates all governments the party belongs to with respect to some criteria. We allow the criteria to be of unequal importance to a party. These criteria concern winning coalitions and policy issues. Parties may be advised to adjust their preferences, i.e., to change their evaluation concerning some government(s) or/and the importance of the criteria, in order to obtain a better political consensus.     

On a Mathematical Comparison between Hierarchy and Network with a Classification of Coordination Structures

This paper proposes a mathematical model to compare a network organization with a hierarchical organization. In order to formulate the model, we define a three-dimensional framework of the coordination structure of a network and of other typical coordination structures. In the framework, we can define a network structure by contrasting it with a hierarchy, in terms of the distribution of decision making, which is one of the main features of information processing. Based on this definition, we have developed a mathematical model for evaluating coordination structures. Using this model, we can derive two boundary conditions among the coordination structures with respect to the optimal coordination structure. The boundary conditions help us to understand why an organization changes its coordination structure from a hierarchy to a network and what factors cause this change. They enable us, for example, to find points of structural change where the optimal coordination structure shifts from a hierarchy to a hierarchy with delegation or from a hierarchy with delegation to a network, when the nature of the task changes from routine to non-routine. In conclusion, our framework and model may provide a basis for discussing the processes that occur when coordination structures change between a hierarchy and a network.     

APPROXIMATE COMMON DIVISORS OF POLYNOMIALS AND DEGREE REDUCTION FOR RATIONAL CURVES

This paper deals with how to perturb a given set of polynomials so as to include a common linear factor. An algorithm is derived for determining such a set of perturbation polyrlomials which are subject to certain constrains at the endpoints of a prescribed parametric interval and minimized in a certain sense. This result can be combined with subdivision technique to obtain a continuous piecewise approximation to a rational curve.     

A second-order globally convergent direct-search method and its worst-case complexity

Direct-search algorithms form one of the main classes of algorithms for smooth unconstrained derivative-free optimization, due to their simplicity and their well-established convergence results. They proceed by iteratively looking for improvement along some vectors or directions. In the presence of smoothness, first-order global convergence comes from the ability of the vectors to approximate the steepest descent direction, which can be quantified by a first-order criticality (cosine) measure. The use of a set of vectors with a positive cosine measure together with the imposition of a sufficient decrease condition to accept new iterates leads to a convergence result as well as a worst-case complexity bound. In this paper, we present a second-order study of a general class of direct-search methods. We start by proving a weak second-order convergence result related to a criticality measure defined along the directions used throughout the iterations. Extensions of this result to obtain a true second-order optimality one are discussed, one possibility being a method using approximate Hessian eigenvectors as directions (which is proved to be truly second-order globally convergent). Numerically guaranteeing such a convergence can be rather expensive to ensure, as it is indicated by the worst-case complexity analysis provided in this paper, but turns out to be appropriate for some pathological examples.     

Gaussian Curvature and Gyroscopes

We relate Gaussian curvature to the gyroscopic force, thus giving a mechanical interpretation of the former and a geometrical interpretation of the latter. We do so by considering the motion of a spinning disk constrained to be tangent to a curved surface. It is shown that the spin gives rise to a force on the disk that is equal to the magnetic force on a point charge moving in a magnetic field normal to the surface, of magnitude equal to the Gaussian curvature, and of charge equal to the disk's axial spin. In a special case, this demonstrates that the precession of Lagrange's top is due to the curvature of a sphere determined by the parameters of the top. © 2017 Wiley Periodicals, Inc.