The management of de-cumulation risks in a defined contribution environment

The aim of the paper is to lay the theoretical foundations for the construction of a flexible tool that can be used by pensioners to find optimal investment and consumption choices in the distribution phase of a defined contribution pension scheme. The investment/consumption plan is adopted until the time of compulsory annuitization, taking into account the possibility of earlier death. The effect of the bequest motive and the desire to buy a higher annuity than the one purchasable at retirement are included in the objective function. The mathematical tools provided by dynamic programming techniques are applied to find closed form solutions: numer-ical examples are also presented. In the model, the trade-off between the different desires of the individual regarding consumption and final annuity can be dealt with by choosing appropriate weights for these factors in the setting of the problem. Conclusions are twofold. Firstly, we find that there is a natural time-varying target for the size of the fund, which acts as a sort of safety level for the needs of the pensioner. Secondly, the personal preferences of the pensioner can be translated into optimal choices, which in turn affect the distribution of the consumption path and of the final annuity

Automatic, computer aided geometric design of free-knot, regression splines

A new algorithm for Computer Aided Geometric Design of least squares (LS) splines with variable knots, named GeDS, is presented. It is based on interpreting functional spline regression as a parametric B-spline curve, and on using the shape preserving property of its control polygon. The GeDS algorithm includes two major stages. For the first stage, an automatic adaptive, knot location algorithm is developed. By adding knots, one at a time, it sequentially "breaks" a straight line segment into pieces in order to construct a linear LS B-spline fit, which captures the "shape" of the data. A stopping rule is applied which avoids both over and under fitting and selects the number of knots for the second stage of GeDS, in which smoother, higher order (quadratic, cubic, etc.) fits are generated. The knots appropriate for the second stage are determined, according to a new knot location method, called the averaging method. It approximately preserves the linear precision property of B-spline curves and allows the attachment of smooth higher order LS B-spline fits to a control polygon, so that the shape of the linear polygon of stage one is followed. The GeDS method produces simultaneously linear, quadratic, cubic (and possibly higher order) spline fits with one and the same number of B-spline regression functions. The GeDS algorithm is very fast, since no deterministic or stochastic knot insertion/deletion and relocation search strategies are involved, neither in the first nor the second stage. Extensive numerical examples are provided, illustrating the performance of GeDS and the quality of the resulting LS spline fits. The GeDS procedure is compared with other existing variable knot spline methods and smoothing techniques, such as SARS, HAS, MDL, AGS methods and is shown to produce models with fewer parameters but with similar goodness of fit characteristics, and visual quality

Automated Graduation using Bayesian Trans-dimensional Models

This paper presents a new method of graduation which uses parametric formulae together with Bayesian reversible jump Markov chain Monte Carlo methods. The aim is to provide a method which can be applied to a wide range of data, and which does not require a lot of adjustment or modification. The method also does not require one particular parametric formula to be selected: instead, the graduated values are a weighted average of the values from a range of formulae. In this way, the new method can be seen as an automatic graduation method which we believe that in many cases can be applied without any adjustments and provide satisfactory graduated values

Entropy, longevity and the cost of annuities

This paper presents an extension of the application of the concept of entropy to annuity costs. Keyfitz (1985) introduced the concept of entropy, and analysed this in the context of continuous changes in life expectancy. He showed that a higher level of entropy indicates that the life expectancy has a greater propensity to respond to a change in the force of mortality than a lower level of entropy. In other words, a high level of entropy means that further reductions in mortality rates would have an impact on measures like life expectancy. In this paper, we apply this to the cost of annuities and show how it allows the sensitivity of the cost of a life annuity contract to changes in longevity to be summarized in a single figure index

Geometrically designed, variable knot regression splines: variation diminish optimality of knots

A new method for Computer Aided Geometric Design of variable knot regression splines, named GeDS, has recently been introduced by Kaishev et al. (2006). The method utilizes the close geometric relationship between a spline regression function and its control polygon, with vertices whose y-coordinates are the regression coefficients and whose x-coordinates are certain averages of the knots, known as the Greville sites. The method involves two stages, A and B. In stage A, a linear LS spline fit to the data is constructed, and viewed as the initial position of the control polygon of a higher order (n > 2) smooth spline curve. In stage B, the optimal set of knots of this higher order spline curve is found, so that its control polygon is as close to the initial polygon of stage A as possible, and finally the LS estimates of the regression coefficients of this curve are found. In Kaishev et al. (2006) the implementation of stage A has been thoroughly addressed and the pointwise asymptotic properties of the GeD spline estimator have been explored and used to construct asymptotic confidence intervals. In this paper, the focus of the attention is at giving further insight into the optimality properties of the knots of the higher order spline curve, obtained in stage B so that it is nearly a variation diminishing (shape preserving) spline approximation to the linear fit of stage A. Error bounds for this approximation are derived. Extensive numerical examples are provided, illustrating the performance of GeDS and the quality of the resulting LS spline fits. The GeDS estimator is compared with other existing variable knot spline methods and smoothing techniques and is shown to perform very well, producing nearly optimal spline regression models. It is fast and numerically efficient, since no deterministic or stochastic knot insertion/deletion and relocation search strategies are involved

Geometrically designed, variable know regression splines: asymptotics and inference

A new method for Computer Aided Geometric Design of least squares (LS) splines with variable knots, named GeDS, is presented. It is based on the property that the spline regression function, viewed as a parametric curve, has a control polygon and, due to the shape preserving and convex hull properties, closely follows the shape of this control polygon. The latter has vertices, whose x-coordinates are certain knot averages, known as the Greville sites and whose y-coordinates are the regression coefficients. Thus, manipulation of the position of the control polygon and hence of the spline curve may be interpreted as estimation of its knots and coefficients. These geometric ideas are implemented in the two stages of the GeDS estimation method. In stage A, a linear LS spline fit to the data is constructed, and viewed as the initial position of the control polygon of a higher order (n > 2) smooth spline curve. In stage B, the optimal set of knots of this higher order spline curve is found, so that its control polygon is as close to the initial polygon of stage A as possible and finally, the LS estimates of the regression coefficients of this curve are found. To implement stage A, an automatic adaptive knot location scheme for generating linear spline fits is developed. At each step of stage A, a knot is placed where a certain bias dominated measure is maximal. This stage is equipped with a novel stopping rule which serves as a model selector. The optimal knots defined in stage B ensure that the higher order spline curve is nearly a variation diminishing (i.e., shape preserving) spline approximation to the linear fit of stage A. Error bounds for this approximation are derived in Kaishev et al. (2006). The GeDS method produces simultaneously linear, quadratic, cubic (and possibly higher order) spline fits with one and the same number of B-spline regression functions. Large sample properties of the GeDS estimator are also explored, and asymptotic normality is established. Asymptotic conditions on the rate of growth of the knots with the increase of the sample size, which ensure that the bias is of negligible magnitude compared to the variance of the GeD estimator, are given. Based on these results, pointwise asymptotic confidence intervals with GeDS are also constructed and shown to converge to the nominal coverage probability level for a reasonable number of knots and sample sizes

Geometrically designed, variable knot regression splines

A new method of Geometrically Designed least squares (LS) splines with variable knots, named GeDS, is proposed. It is based on the property that the spline regression function, viewed as a parametric curve, has a control polygon and, due to the shape preserving and convex hull properties, it closely follows the shape of this control polygon. The latter has vertices whose x-coordinates are certain knot averages and whose y-coordinates are the regression coefficients. Thus, manipulation of the position of the control polygon may be interpreted as estimation of the spline curve knots and coefficients. These geometric ideas are implemented in the two stages of the GeDS estimation method. In stage A, a linear LS spline fit to the data is constructed, and viewed as the initial position of the control polygon of a higher order (n > 2) smooth spline curve. In stage B, the optimal set of knots of this higher order spline curve is found, so that its control polygon is as close to the initial polygon of stage A as possible and finally, the LS estimates of the regression coefficients of this curve are found. The GeDS method produces simultaneously linear, quadratic, cubic (and possibly higher order) spline fits with one and the same number of B-spline coefficients. Numerical examples are provided and further supplemental materials are available online

Vector-soliton collision dynamics in nonlinear optical fibers

We consider the interactions of two identical, orthogonally polarized vector solitons in a nonlinear optical fiber with two polarization directions, described by a coupled pair of nonlinear Schroedinger equations. We study a low-dimensional model system of Hamiltonian ODE derived by Ueda and Kath and also studied by Tan and Yang. We derive a further simplified model which has similar dynamics but is more amenable to analysis. Sufficiently fast solitons move by each other without much interaction, but below a critical velocity the solitons may be captured. In certain bands of initial velocities the solitons are initially captured, but separate after passing each other twice, a phenomenon known as the two-bounce or two-pass resonance. We derive an analytic formula for the critical velocity. Using matched asymptotic expansions for separatrix crossing, we determine the location of these "resonance windows." Numerical simulations of the ODE models show they compare quite well with the asymptotic theory.Comment: 32 pages, submitted to Physical Review

Numerical simulation of industrial superplastic forming. Final report

Superplastic forming (SPF) is a metal forming process that allows a variety of components with very complex geometries to be produced at a fraction of the cost of conventional machining. The industrial superplastic forming process can be optimized with the application of the finite element method to predict the optimal pressure schedules, overall forming time, and the final thickness distribution. This paper discusses the verification and applications of NIKE3D in 4 optimizing the industrial superplastic forming process