107 resultados para Quasi-Linear Singular Integro-Differential Equations
Resumo:
En este trabajo introducimos diversas clases de barreras del dividendo en la teoría modelo clásica de la ruina. Estudiamos la influencia de la estrategia de la barrera en probabilidad de la ruina. Un método basado en las ecuaciones de la renovación [Grandell (1991)], alternativa a la discusión diferenciada [Gerber (1975)], utilizado para conseguir las ecuaciones diferenciales parciales para resolver probabilidades de la supervivencia. Finalmente calculamos y comparamos las probabilidades de la supervivencia usando la barrera linear y parabólica del dividendo, con la ayuda de la simulación
Resumo:
In this note we prove an existence and uniqueness result for the solution of multidimensional stochastic delay differential equations with normal reflection. The equations are driven by a fractional Brownian motion with Hurst parameter H > 1/2. The stochastic integral with respect to the fractional Brownian motion is a pathwise Riemann¿Stieltjes integral.
Resumo:
We develop several results on hitting probabilities of random fields which highlight the role of the dimension of the parameter space. This yields upper and lower bounds in terms of Hausdorff measure and Bessel-Riesz capacity, respectively. We apply these results to a system of stochastic wave equations in spatial dimension k >- 1 driven by a d-dimensional spatially homogeneous additive Gaussian noise that is white in time and colored in space.
Resumo:
The RuskSkinner formalism was developed in order to give a geometrical unified formalism for describing mechanical systems. It incorporates all the characteristics of Lagrangian and Hamiltonian descriptions of these systems (including dynamical equations and solutions, constraints, Legendre map, evolution operators, equivalence, etc.). In this work we extend this unified framework to first-order classical field theories, and show how this description comprises the main features of the Lagrangian and Hamiltonian formalisms, both for the regular and singular cases. This formulation is a first step toward further applications in optimal control theory for partial differential equations. 2004 American Institute of Physics.
Resumo:
A Hamiltonian formalism is set up for nonlocal Lagrangian systems. The method is based on obtaining an equivalent singular first order Lagrangian, which is processed according to the standard Legendre transformation and then, the resulting Hamiltonian formalism is pulled back onto the phase space defined by the corresponding constraints. Finally, the standard results for local Lagrangians of any order are obtained as a particular case.
Resumo:
The classical Lojasiewicz inequality and its extensions for partial differential equation problems (Simon) and to o-minimal structures (Kurdyka) have a considerable impact on the analysis of gradient-like methods and related problems: minimization methods, complexity theory, asymptotic analysis of dissipative partial differential equations, tame geometry. This paper provides alternative characterizations of this type of inequalities for nonsmooth lower semicontinuous functions defined on a metric or a real Hilbert space. In a metric context, we show that a generalized form of the Lojasiewicz inequality (hereby called the Kurdyka- Lojasiewicz inequality) relates to metric regularity and to the Lipschitz continuity of the sublevel mapping, yielding applications to discrete methods (strong convergence of the proximal algorithm). In a Hilbert setting we further establish that asymptotic properties of the semiflow generated by -∂f are strongly linked to this inequality. This is done by introducing the notion of a piecewise subgradient curve: such curves have uniformly bounded lengths if and only if the Kurdyka- Lojasiewicz inequality is satisfied. Further characterizations in terms of talweg lines -a concept linked to the location of the less steepest points at the level sets of f- and integrability conditions are given. In the convex case these results are significantly reinforced, allowing in particular to establish the asymptotic equivalence of discrete gradient methods and continuous gradient curves. On the other hand, a counterexample of a convex C2 function in R2 is constructed to illustrate the fact that, contrary to our intuition, and unless a specific growth condition is satisfied, convex functions may fail to fulfill the Kurdyka- Lojasiewicz inequality.
Resumo:
This paper studies global webs on the projective plane with vanishing curvature. The study is based on an interplay of local and global arguments. The main local ingredient is a criterium for the regularity of the curvature at the neighborhood of a generic point of the discriminant. The main global ingredient, the Legendre transform, is an avatar of classical projective duality in the realm of differential equations. We show that the Legendre transform of what we call reduced convex foliations are webs with zero curvature, and we exhibit a countable infinity family of convex foliations which give rise to a family of webs with zero curvature not admitting non-trivial deformations with zero curvature.
Resumo:
In this paper a model is developed to describe the three dimensional contact melting process of a cuboid on a heated surface. The mathematical description involves two heat equations (one in the solid and one in the melt), the Navier-Stokes equations for the flow in the melt, a Stefan condition at the phase change interface and a force balance between the weight of the solid and the countering pressure in the melt. In the solid an optimised heat balance integral method is used to approximate the temperature. In the liquid the small aspect ratio allows the Navier-Stokes and heat equations to be simplified considerably so that the liquid pressure may be determined using an igenfunction expansion and finally the problem is reduced to solving three first order ordinary differential equations. Results are presented showing the evolution of the melting process. Further reductions to the system are made to provide simple guidelines concerning the process. Comparison of the solutions with experimental data on the melting of n-octadecane shows excellent agreement.
Resumo:
Quantitative or algorithmic trading is the automatization of investments decisions obeying a fixed or dynamic sets of rules to determine trading orders. It has increasingly made its way up to 70% of the trading volume of one of the biggest financial markets such as the New York Stock Exchange (NYSE). However, there is not a signi cant amount of academic literature devoted to it due to the private nature of investment banks and hedge funds. This projects aims to review the literature and discuss the models available in a subject that publications are scarce and infrequently. We review the basic and fundamental mathematical concepts needed for modeling financial markets such as: stochastic processes, stochastic integration and basic models for prices and spreads dynamics necessary for building quantitative strategies. We also contrast these models with real market data with minutely sampling frequency from the Dow Jones Industrial Average (DJIA). Quantitative strategies try to exploit two types of behavior: trend following or mean reversion. The former is grouped in the so-called technical models and the later in the so-called pairs trading. Technical models have been discarded by financial theoreticians but we show that they can be properly cast into a well defined scientific predictor if the signal generated by them pass the test of being a Markov time. That is, we can tell if the signal has occurred or not by examining the information up to the current time; or more technically, if the event is F_t-measurable. On the other hand the concept of pairs trading or market neutral strategy is fairly simple. However it can be cast in a variety of mathematical models ranging from a method based on a simple euclidean distance, in a co-integration framework or involving stochastic differential equations such as the well-known Ornstein-Uhlenbeck mean reversal ODE and its variations. A model for forecasting any economic or financial magnitude could be properly defined with scientific rigor but it could also lack of any economical value and be considered useless from a practical point of view. This is why this project could not be complete without a backtesting of the mentioned strategies. Conducting a useful and realistic backtesting is by no means a trivial exercise since the \laws" that govern financial markets are constantly evolving in time. This is the reason because we make emphasis in the calibration process of the strategies' parameters to adapt the given market conditions. We find out that the parameters from technical models are more volatile than their counterpart form market neutral strategies and calibration must be done in a high-frequency sampling manner to constantly track the currently market situation. As a whole, the goal of this project is to provide an overview of a quantitative approach to investment reviewing basic strategies and illustrating them by means of a back-testing with real financial market data. The sources of the data used in this project are Bloomberg for intraday time series and Yahoo! for daily prices. All numeric computations and graphics used and shown in this project were implemented in MATLAB^R scratch from scratch as a part of this thesis. No other mathematical or statistical software was used.
Resumo:
We present the derivation of the continuous-time equations governing the limit dynamics of discrete-time reaction-diffusion processes defined on heterogeneous metapopulations. We show that, when a rigorous time limit is performed, the lack of an epidemic threshold in the spread of infections is not limited to metapopulations with a scale-free architecture, as it has been predicted from dynamical equations in which reaction and diffusion occur sequentially in time
Resumo:
We present a continuum formalism for modeling growing random networks under addition and deletion of nodes based on a differential mass balance equation. As examples of its applicability, we obtain new results on the degree distribution for growing networks with a uniform attachment and deletion of nodes, and complete some recent results on growing networks with preferential attachment and uniform removal
Resumo:
The effect of initial conditions on the speed of propagating fronts in reaction-diffusion equations is examined in the framework of the Hamilton-Jacobi theory. We study the transition between quenched and nonquenched fronts both analytically and numerically for parabolic and hyperbolic reaction diffusion. Nonhomogeneous media are also analyzed and the effect of algebraic initial conditions is also discussed
Resumo:
The classical description of Si oxidation given by Deal and Grove has well-known limitations for thin oxides (below 200 Ã). Among the large number of alternative models published so far, the interfacial emission model has shown the greatest ability to fit the experimental oxidation curves. It relies on the assumption that during oxidation Si interstitials are emitted to the oxide to release strain and that the accumulation of these interstitials near the interface reduces the reaction rate there. The resulting set of differential equations makes it possible to model diverse oxidation experiments. In this paper, we have compared its predictions with two sets of experiments: (1) the pressure dependence for subatmospheric oxygen pressure and (2) the enhancement of the oxidation rate after annealing in inert atmosphere. The result is not satisfactory and raises serious doubts about the model’s correctness
Resumo:
The space and time discretization inherent to all FDTD schemesintroduce non-physical dispersion errors, i.e. deviations ofthe speed of sound from the theoretical value predicted bythe governing Euler differential equations. A generalmethodologyfor computing this dispersion error via straightforwardnumerical simulations of the FDTD schemes is presented.The method is shown to provide remarkable accuraciesof the order of 1/1000 in a wide variety of twodimensionalfinite difference schemes.