67 resultados para stochastic differentia equations
em QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast
Resumo:
We propose a new approach for modeling nonlinear multivariate interest rate processes based on time-varying copulas and reducible stochastic differential equations (SDEs). In the modeling of the marginal processes, we consider a class of nonlinear SDEs that are reducible to Ornstein--Uhlenbeck (OU) process or Cox, Ingersoll, and Ross (1985) (CIR) process. The reducibility is achieved via a nonlinear transformation function. The main advantage of this approach is that these SDEs can account for nonlinear features, observed in short-term interest rate series, while at the same time leading to exact discretization and closed-form likelihood functions. Although a rich set of specifications may be entertained, our exposition focuses on a couple of nonlinear constant elasticity volatility (CEV) processes, denoted as OU-CEV and CIR-CEV, respectively. These two processes encompass a number of existing models that have closed-form likelihood functions. The transition density, the conditional distribution function, and the steady-state density function are derived in closed form as well as the conditional and unconditional moments for both processes. In order to obtain a more flexible functional form over time, we allow the transformation function to be time varying. Results from our study of U.S. and UK short-term interest rates suggest that the new models outperform existing parametric models with closed-form likelihood functions. We also find the time-varying effects in the transformation functions statistically significant. To examine the joint behavior of interest rate series, we propose flexible nonlinear multivariate models by joining univariate nonlinear processes via appropriate copulas. We study the conditional dependence structure of the two rates using Patton (2006a) time-varying symmetrized Joe--Clayton copula. We find evidence of asymmetric dependence between the two rates, and that the level of dependence is positively related to the level of the two rates. (JEL: C13, C32, G12) Copyright The Author 2010. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oxfordjournals.org, Oxford University Press.
Resumo:
Background. Kidney Disease Outcomes Quality Initiative (KDOQI) chronic kidney disease (CKD) guidelines have focused on the utility of using the modified four-variable MDRD equation (now traceable by isotope dilution mass spectrometry IDMS) in calculating estimated glomerular filtration rates (eGFRs). This study assesses the practical implications of eGFR correction equations on the range of creatinine assays currently used in the UK and further investigates the effect of these equations on the calculated prevalence of CKD in one UK region Methods. Using simulation, a range of creatinine data (30–300 µmol/l) was generated for male and female patients aged 20–100 years. The maximum differences between the IDMS and MDRD equations for all 14 UK laboratory techniques for serum creatinine measurement were explored with an average of individual eGFRs calculated according to MDRD and IDMS 30 ml/min/1.73 m2. Observed data for 93,870 patients yielded a first MDRD eGFR 3 months later of which 47 093 (71%) continued to have an eGFR
Resumo:
A nonperturbative nonlinear statistical approach is presented to describe turbulent magnetic systems embedded in a uniform mean magnetic field. A general formula in the form of an ordinary differential equation for magnetic field-line wandering (random walk) is derived. By considering the solution of this equation for different limits several new results are obtained. As an example, it is demonstrated that the stochastic wandering of magnetic field-lines in a two-component turbulence model leads to superdiffusive transport, contrary to an existing diffusive picture. The validity of quasilinear theory for field-line wandering is discussed, with respect to different turbulence geometry models, and previous diffusive results are shown to be deduced in appropriate limits.
Resumo:
We present results from three-dimensional protein folding simulations in the HP-model on ten benchmark problems. The simulations are executed by a simulated annealing-based algorithm with a time-dependent cooling schedule. The neighbourhood relation is determined by the pull-move set. The results provide experimental evidence that the maximum depth D of local minima of the underlying energy landscape can be upper bounded by D < n(2/3). The local search procedure employs the stopping criterion (In/delta)(D/gamma) where m is an estimation of the average number of neighbouring conformations, gamma relates to the mean of non-zero differences of the objective function for neighbouring conformations, and 1-delta is the confidence that a minimum conformation has been found. The bound complies with the results obtained for the ten benchmark problems. (c) 2008 Elsevier Ltd. All rights reserved.
Resumo:
We construct $x^0$ in ${\Bbb R}^{\Bbb N}$ and a row-finite matrix $T=\{T_{i,j}(t)\}_{i,j\in\N}$ of polynomials of one real variable $t$ such that the Cauchy problem $\dot x(t)=T_tx(t)$, $x(0)=x^0$ in the Fr\'echet space $\R^\N$ has no solutions. We also construct a row-finite matrix $A=\{A_{i,j}(t)\}_{i,j\in\N}$ of $C^\infty(\R)$ functions such that the Cauchy problem $\dot x(t)=A_tx(t)$, $x(0)=x^0$ in ${\Bbb R}^{\Bbb N}$ has no solutions for any $x^0\in{\Bbb R}^{\Bbb N}\setminus\{0\}$. We provide some sufficient condition of solvability and of unique solvability for linear ordinary differential equations $\dot x(t)=T_tx(t)$ with matrix elements $T_{i,j}(t)$ analytically dependent on $t$.
Resumo:
According to the Mickael's selection theorem any surjective continuous linear operator from one Fr\'echet space onto another has a continuous (not necessarily linear) right inverse. Using this theorem Herzog and Lemmert proved that if $E$ is a Fr\'echet space and $T:E\to E$ is a continuous linear operator such that the Cauchy problem $\dot x=Tx$, $x(0)=x_0$ is solvable in $[0,1]$ for any $x_0\in E$, then for any $f\in C([0,1],E)$, there exists a continuos map $S:[0,1]\times E\to E$, $(t,x)\mapsto S_tx$ such that for any $x_0\in E$, the function $x(t)=S_tx_0$ is a solution of the Cauchy problem $\dot x(t)=Tx(t)+f(t)$, $x(0)=x_0$ (they call $S$ a fundamental system of solutions of the equation $\dot x=Tx+f$). We prove the same theorem, replacing "continuous" by "sequentially continuous" for locally convex spaces from a class which contains strict inductive limits of Fr\'echet spaces and strong duals of Fr\'echet--Schwarz spaces and is closed with respect to finite products and sequentially closed subspaces. The key-point of the proof is an extension of the theorem on existence of a sequentially continuous right inverse of any surjective sequentially continuous linear operator to some class of non-metrizable locally convex spaces.
Resumo:
We construct a bounded function $H : l_2\times l_2 \to R$ with continuous Frechet derivative such that for any $q_0\in l_2$ the Cauchy problem $\dot p= - {\partial H\over\partial q}$, $\dot q={\partial H\over\partial p}$, $p(0) = 0$, q(0) = q_0$ has no solutions in any neighborhood of zero in R.
Resumo:
Let $\Gamma$ be the class of sequentially complete locally convex spaces such that an existence theorem holds for the linear Cauchy problem $\dot x = Ax$, $x(0) = x_0$ with respect to functions $x: R\to E$. It is proved that if $E\in \Gamma$, then $E\times R^A$ is-an-element-of $\Gamma$ for an arbitrary set $A$. It is also proved that a topological product of infinitely many infinite-dimensional Frechet spaces, each not isomorphic to $\omega$, does not belong to $\Gamma$.
Resumo:
A family of stochastic gradient algorithms and their behaviour in the data echo cancellation work platform are presented. The cost function adaptation algorithms use an error exponent update strategy based on an absolute error mapping, which is updated at every iteration. The quadratic and nonquadratic cost functions are special cases of the new family. Several possible realisations are introduced using these approaches. The noisy error problem is discussed and the digital recursive filter estimator is proposed. The simulation outcomes confirm the effectiveness of the proposed family of algorithms.