A partial differential equation connected to option pricing with stochastic volatility: Regularity results and discretization

This paper completes a previous work on a Black and Scholes equation with stochastic volatility. This is a degenerate parabolic equation, which gives the price of a European option as a function of the time, of the price of the underlying asset, and of the volatility, when the volatility is a function of a mean reverting Orstein-Uhlenbeck process, possibly correlated with the underlying asset. The analysis involves weighted Sobolev spaces. We give a characterization of the domain of the operator, which permits us to use results from the theory of semigroups. We then study a related model elliptic problem and propose a finite element method with a regular mesh with respect to the intrinsic metric associated with the degenerate operator. For the error estimate, we need to prove an approximation result.

     

Sparse Linear Algebra and Geophysical Migration: A Review of Direct and Iterative Methods

The pre-stack depth migration of reflection seismic data can be expressed, in the framework of waveform inversion, as a linear least squares problem. Together with the precise definition of this operator, we detail additional main characteristics of the forward model, like its huge size, its sparsity and the composition with convolution. It ends up with a so-called discrete ill-posed problem, whose acceptable solutions have to undergo a regularization procedure. Both direct and iterative methods have been implemented with specific attention to the convolution, and then applied to a given data set: a synthetic 2-dimensional profile of revealing size with some added noise. The efficiency with regard to computational effort and storage requirements is evaluated. The needed regularization of the solution is thoroughly studied in both cases. From the point of the global inverse problem, the extra feature of providing a solution that can be differentiated with respect to a parameter such as background velocity is also discussed.     

Strong competition model with non-uniform dispersal in a heterogeneous environment

In this study, a strong competition model was considered between two species in a heterogeneous environment. For a system with two different constant diffusion rates for each competitor, the fast diffuser can be selected evolutionally under suitable assumptions if the competing interaction between the species is strong. We also claim that a strongly interacting competition leads to a more evolutionary selection than that with the same population dynamics if a species moves with a certain non-uniform dispersal. Furthermore, species with a certain non-uniform dispersal have a competitive advantage over linear random diffusers. In addition, a species with highly sensitive dispersal response to the environment may survive. These strongly competitive advantages were demonstrated by investigating the stability of semi-trivial solutions of the system with non-uniform dispersal and comparing it to the conditions of the model with constant diffusion.     

Four equivalent lot-sizing models

We study the following lot-sizing models that recently appeared in the literature: a lot-sizing model with a remanufacturing option, a lot-sizing model with production time windows, and a lot-sizing model with cumulative capacities. We show the equivalence of these models with a classical model: the lot-sizing model with inventory bounds.     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

Resource allocation in dynamic PERT networks with finite capacity

This article models the resource allocation problem in dynamic PERT networks with finite capacity of concurrent projects (COnstant Number of Projects In Process (CONPIP)), where activity durations are independent random variables with exponential distributions, and the new projects are generated according to a Poisson process. The system is represented as a queuing network with finite concurrent projects, where each activity of a project is performed at a devoted service station with one server located in a node of the network. For modeling dynamic PERT networks with CONPIP, we first convert the network of queues into a stochastic network. Then, by constructing a proper finite-state continuous-time Markov model, a system of differential equations is created to solve and find the completion time distribution for any particular project. Finally, we propose a multi-objective model with three conflict objectives to optimally control the resources allocated to the servers, and apply the goal attainment method to solve a discrete-time approximation of the original multi-objective problem.     

Spectrality of a class of self-affine measures with decomposable digit sets

The self-affine measure associated with an expanding matrix and a finite digit set is uniquely determined by the self-affine identity with equal weight.The spectral and non-spectral problems on the selfaffine measures have some surprising connections with a number of areas in mathematics,and have been received much attention in recent years.In the present paper,we shall determine the spectrality and non-spectrality of a class of self-affine measures with decomposable digit sets.We present a method to deal with such case,and clarify the spectrality and non-spectrality of a class of self-affine measures by applying this method.     

Spreading speeds and traveling waves for abstract monostable evolution systems

This paper is devoted to the development of the theory of spreading speeds and traveling waves for abstract monostable evolution systems with spatial structure. Under appropriate assumptions, we show that the spreading speeds coincide with the minimal wave speeds for monotone traveling waves in the positive and negative directions. Then we use this theory to study the spatial dynamics of a parabolic equation in a periodic cylinder with the Dirichlet boundary condition, a reaction-diffusion model with a quiescent stage, a porous medium equation in a tube, and a lattice system in a periodic habitat.     

The Buneman index via polyhedral split decomposition

The split decomposition of a metric using the so-called isolation index was established by Bandelt and Dress, and it is a theoretical foundation for certain phylogenetic network reconstruction methods. Recently, Hirai gave a geometric interpretation to the split decomposition, and provided an extension of the split decomposition for a distance, i.e., a symmetric nonnegative function with zero diagonal. By Herrmann and Moulton, such a geometric approach was further applied to polyhedral functions, called tight-spans in their style, defined on various vector configurations. This paper addresses the split decomposition with respect to a particular kind of vector configuration, which does not satisfy the assumption imposed by Hirai or Herrmann and Moulton. As a result, we obtain geometrically the Buneman index, which is also used to construct a phylogenetic tree. Moreover, this paper deals with the combinatorial aspect of the polyhedral split decomposition, and gives a combinatorial characterization of the split-decomposability with the aid of the matroid associated with the vector configuration.     

带两个服务等级的三台机最优在线算法

研究了带服务等级约束的三台平行机在线排序问题.每台机器和每个工件的服务等级为1或者2,工件只能在等级不高于它的机器上加工,即等级为1的工件只能在等级为1的机器上加工,等级为2的工件可在所有机器上加工.每个工件的加工时间为一个单位,目标是极小化所有工件的总完工时间.考虑两种情形:当一台机器等级为1,两台机器等级为2时,给出了竞争比为17/14的最优在线算法;当两台机器等级为1,一台机器等级为2时,给出了竞争比为43/36的最优在线算法.     

A one‐dimensional computational model for hyperelastic string structures with Coulomb friction

In this paper, we consider a new model for the simulation of textiles with frictional contact between fibers and no bending resistance. In the model, one‐dimensional hyperelasticity and the Capstan equation are combined, and its connection with conventional hyperelasticity and Coulomb friction models is shown. Then, the model is formulated as a problem with the rate‐independent dissipation, and we prove that the problem possesses proper convexity and continuity properties. The article concludes with a numerical algorithm and provides numerical experiments along with a comparison of the results with a real measurement. Copyright © 2016 John Wiley & Sons, Ltd.     

Search during decision making

Nearly four hundred non-routine organizational decisions were investigated to discover search approaches––determining the frequency of use and success of each search approach uncovered. A “search approach” is made up of a direction and a means to uncover solution ideas. Direction indicates desired results and it can be either implicit or explicit, with an explicit direction offering either a problem or a goal-like target. Solutions can be uncovered by opportunity, bargaining, and chance as well as by rational approaches. Defining a search approach as a direction coupled with a means of search, search approaches were linked with indicators of success, measured by the decision's adoption, value and timeliness, noting frequency. A rational, goal-directed, search approach was more apt to produce successful outcomes. Bargaining with stakeholders to uncover solutions was always combined some of the search approaches in this study, and this merger improved the prospects of success. Searches with an opportunistic or chance (emergent opportunity) features and rational searches with a problem target were more apt to produce unsuccessful outcomes. The means used to come up with a solution had less bearing on success than did the type of direction, with goal-directed searches leading to the best outcomes. Each search approach is discussed to reveal best practices and to offer suggestions to improve practice.     

Piecewise linear concave dynamical systems appearing in the microscopic traffic modeling

Motivated by microscopic traffic modeling, we analyze dynamical systems which have a piecewise linear concave dynamics not necessarily monotonic. We introduce a deterministic Petri net extension where edges may have negative weights. The dynamics of these Petri nets are uniquely defined and may be described by a generalized matrix with a submatrix in the standard algebra with possibly negative entries, and another submatrix in the minplus algebra. When the dynamics is additively homogeneous, a generalized additive eigenvalue is introduced, and the ergodic theory is used to define a growth rate. In the traffic example of two roads with one junction, we compute explicitly the eigenvalue and we show, by numerical simulations, that these two quantities (the additive eigenvalue and the average growth rate) are not equal, but are close to each other. With this result, we are able to extend the well-studied notion of fundamental traffic diagram (the average flow as a function of the car density on a road) to the case of roads with a junction and give a very simple analytic approximation of this diagram where four phases appear with clear traffic interpretations. Simulations show that the fundamental diagram shape obtained is also valid for systems with many junctions.     

Variable electrical and thermal conductivity in the theory of generalized thermoelastic diffusion

This paper deals with the problem of a thermoelastic half-space with a permeating substance in contact with the bounding plane in the context of the theory of generalized thermoelastic diffusion with one relaxation time and with variable electrical and thermal conductivity. The bounding surface of the half-space is taken to be traction free and subjected to a time dependent thermal shock. The solution is obtained in the Laplace transform domain by a direct approach. A numerical technique is employed to obtain the solution in the physical domain. It is found that there exist two coupled waves, one of which is elastic and the other is thermal, and a third wave affects diffusion mainly. A comparison is made with the results obtained in a thermoelastic medium with and without diffusion in the following cases : (a) the electrical and thermal conductivities have constant values, (b) the presence of magnetic field and (c) the generalized theory in thermoelasticity. Received: June 1, 2005     

Minimum Path Problems in Normed Spaces: Reflection and Refraction

The paper deals with the existence and characterization of minimum or extremum paths connecting two given points in a vector space, which is divided by a barrier (a curve C if the space is 2-dimensional) into two parts with different norms. The global problem of existence of polygonal paths of shortest length is dealt with in Section 2. An example shows that, for a curve with a point of inflection, such paths may not exist. However, the existence of such paths is proved for a more restricted class of curves (Theorem 2.3). The notion of permissible polygonal paths is introduced, and it is shown that, for a very general class of curves, such paths of shortest length do exist (Theorem 2.2).Sections 3 and 4 deal with the local conditions at the intersection of the extremal path with the curve C. Theorem 4.1 establishes a geometric characterization of the point of intersection, and Eqs. (13) and (15) are formulas for the angles that the segments of the extremal path make with a fixed axis or with the normal to C at the point of intersection. The case where the unit circles of the tax norms are Euclidean circles with different radii leads to the traditional Snell law. Section 6 deals with the law of reflection at the curve C, which in the case of the Euclidean norm asserts the equality of the angles of incidence and reflection. The n-dimensional case, where the curve C is replaced by a hypersurface, is considered briefly in Section 7.     

Fredholm’s boundary-value problems for differential systems with a single delay

Conditions are derived for the existence of solutions of linear Fredholm’s boundary-value problems for systems of ordinary differential equations with constant coefficients and a single delay. Utilizing a delayed matrix exponential and a method of pseudo-inverse by Moore-Penrose matrices led to an explicit and analytical form of a criterion for the existence of solutions in a relevant space and, moreover, to the construction of a family of linearly independent solutions of such problems in a general case with the number of boundary conditions (defined by a linear vector functional) not coinciding with the number of unknowns of a differential system with a single delay.     

On compact vector formats in the solution of the chemical master equation with backward differentiation

A stochastic chemical system with multiple types of molecules interacting through reaction channels can be modeled as a continuous‐time Markov chain with a countably infinite multidimensional state space. Starting from an initial probability distribution, the time evolution of the probability distribution associated with this continuous‐time Markov chain is described by a system of ordinary differential equations, known as the chemical master equation (CME). This paper shows how one can solve the CME using backward differentiation. In doing this, a novel approach to truncate the state space at each time step using a prediction vector is proposed. The infinitesimal generator matrix associated with the truncated state space is represented compactly, and exactly, using a sum of Kronecker products of matrices associated with molecules. This exact representation is already compact and does not require a low‐rank approximation in the hierarchical Tucker decomposition (HTD) format. During transient analysis, compact solution vectors in HTD format are employed with the exact, compact, and truncated generated matrices in Kronecker form, and the linear systems are solved with the Jacobi method using fixed or adaptive rank control strategies on the compact vectors. Results of simulation on benchmark models are compared with those of the proposed solver and another version, which works with compact vectors and highly accurate low‐rank approximations of the truncated generator matrices in quantized tensor train format and solves the linear systems with the density matrix renormalization group method. Results indicate that there is a reason to solve the CME numerically, and adaptive rank control strategies on compact vectors in HTD format improve time and memory requirements significantly.     

拉伸偏心椭圆孔板的应力集中系数表达式

先用半解析半经验的方法推导出拉伸中心椭圆孔有限宽板应力集中系数的显式表达式．将其计算结果和Durelli的光弹性实验结果、Isida公式以及有限元分析结果比较可知,新推导公式的精度较高,且适用范围更广．再用类似的方法推导出拉伸偏心椭圆孔板应力集中系数的显式表达式．经与Isida的公式和有限元分析结果比较可知,该公式适用范围更广、精度更高．当偏心距在一定范围内,误差小于8%．根据应力集中系数与应力强度因子的关系,由已得到的应力集中系数得出拉伸中心裂纹有限宽板和拉伸偏心裂纹板的应力强度因子．经与已有公式以及有限元分析结果比较可知,该应力强度因子表达式也有足够的精度．     

Frames with Transitive Structures

A classical result in the theory of uniform spaces is that any topological space with a base of clopen sets admits a uniformity with a transitive base and the uniform topology of such a space has a base of clopen sets. This paper presents a pointfree generalization of this, both to uniform and quasi-uniform frames, together with various properties concerning total boundedness, compactifications and completions.