Estimating yield curves of the U.S. Treasury securities: An interpolation approach

Following the approach of interpolation, this paper proposes the multiple exponential decay model to fit yield curves for both the U.S. TIPS market and the conventional Treasury security market. Several estimation methods, including the unconstrained/constrained nonlinear minimization, quadratic programming, and the iterative linear least squares, are applied to estimate the unknown parameters according to different curve‐fitting purposes. Comparisons between the proposed model and the alternatives show that the multiple exponential decay successfully (1) adapts to a variety of shapes associated with yield curves, (2) (partially) keeps in line with the economic interpretations of Nelson–Siegel summarized by Diebold and Li ( 2006 ), and (3) dominates the competing models in curve‐fitting performance measured by mean fitted‐price errors over the sample period. In addition, the exact specification of a nonparametric interpolation model is pinned down by applying three statistical tools, which enable us to jointly take into account validity, optimality, and parsimoniousness of the proposed model.     

Numerical issues in threshold autoregressive modeling of time series

This paper analyses the contribution of various numerical approaches to making the estimation of threshold autoregressive time series more efficient. It relies on the computational advantages of QR factorizations and proposes Givens transformations to update these factors for sequential LS problems. By showing that the residual sum of squares is a continuous rational function over threshold intervals it develops a new fitting method based on rational interpolation and the standard necessary optimality condition. Taking as benchmark a simple grid search, the paper illustrates via Monte Carlo simulations the efficiency gains of the proposed tools.     

Exact and approximate D-optimal designs in polynomial regression

If the sample sizen is large enough, then the exact polynomial regression designs obtained by rounding the weights of the approximate D-optimal design to integral multiples of 1/n are D-optimal. This was shown by alaevskiî (1966) and Gaffke (1987). In this note, an efficient algorithm to determine the minimum sample sizen _d for a polynomial model of degreed is derived from a condition given by Huang (1987). Under an additional assumption we show that the conditions of Gaffke and Huang are equivalent; we verify the additional assumption for polynomial degreed40.     

Convergence of numerical methods for valuing path-dependent options using interpolation

One method for valuing path-dependent options is the augmented state space approach described in Hull and White (1993) and Barraquand and Pudet (1996), among others. In certain cases, interpolation is required because the number of possible values of the additional state variable grows exponentially. We provide a detailed analysis of the convergence of these algorithms. We show that it is possible for the algorithm to be non-convergent, or to converge to an incorrect answer, if the interpolation scheme is selected in appropriately. We concentrate on Asian options, due to their popularity and because of some errors in the previous literature. This revised version was published online in June 2006 with corrections to the Cover Date.     

集值函数及向量值函数的两类线性算子逼近

本文得到了利用插值型线性算子列及积分型算子列逼近连续集值函数及连续向量值函数的收敛逼近阶。     

Interpolating the Lorenz Curve: Methods to Preserve Shape and Remain Consistent with the Concentration Curves for Components

C¹‐class interpolation methods that preserve monotonicity and convexity and are thus suitable for the estimation of the Lorenz curve from grouped data are not widely known. Instead, parametric models are usually applied for such estimation. Parametric models, however, have difficulty in accurately approximating every part of income/expenditure distributions. This paper proposes two types of C¹‐class shape‐preserving interpolation methods. One is a piecewise rational polynomial interpolation (proposed independently by Stineman and Delbourgo) that enables consistent interpolation of the concentration curves for income/expenditure components, attaining approximately the same accuracy as that of the existing methods when applied to decile‐grouped data or to more detailed aggregation. Another is a Hybrid interpolation that employs pieces of curves derived from parametric models on end intervals. Empirical comparisons show that the Hybrid interpolation (with the assistance of parametric models for class‐boundary estimation) outperforms the existing methods even when applied to quintile‐grouped data without class boundaries.     

基于BP神经网络的茶叶物流金融模式仿真优化

针对茶叶物流金融运作模式选择中的复杂性以及传统优化方法的局限性,将BP神经网络理论和仿真方法引入茶叶物流金融模式优化,考虑样本数量不足的实际问题,采用B样条函数插值方法扩充数据量,构建BP神经网络模型并加以训练。结果表明:BP神经网络具有精度较高的智能学习能力,适合于茶叶物流金融模式选择优化。     

5G系统中基于解调参考信号的信道估计方法

5G系统使用解调参考信号(Demodulation Reference Signal,DMRS)用于下行信道估计,工程中通常采用插值法得到数据位置信道响应,考虑实际信道中噪声的影响,频域采用线性最小均方误差(Linear Minimum Mean Squared Error,LMMSE)插值算法。针对LMMSE需要获取信道先验统计特性以及存在矩阵求逆运算量大问题,利用信号时域内能量集中特点估计出信道均方根时延、信噪比和信道自相关矩阵,对于DMRS信号在频域上间隔较大、DMRS信号所在子载波相关性不强的问题,通过引入导频加密方法提升DMRS信号所在子载波间的相关性以提升信道估计性能,并通过滑动窗口插值方法进一步降低LMMSE算法求逆运算复杂度。仿真结果表明,所提算法均方误差和误码率总体均优于线性插值和基于矩阵奇异值分解的LMMSE算法,并与传统LMMSE算法相比性能极为接近,而且复杂度降低了99.85〖WT《Times New Roman》〗%〖WTBZ〗,适合实际工程应用。     

一种通用数字中频正交扩频调制器的实现

提出了一种适应于宽带扩频通信系统的数字中频调制的实现方案,它基于正交调制、DDS、数字上变频和数字内插等技术,采用通用硬件平台,可以生成多种中频调制信号,可广泛用于数字化扩频通信电台、宽带CDMA、软件无线电、遥控遥测等通信系统中。     

融合反距离加权和矩阵填充的位置指纹库构建

为解决位置指纹定位在离线阶段构建位置指纹库时耗费的人力和时间成本较大,构建指纹库效率低和利用空间插值法构建的指纹库精度不高的问题,提出了一种融合反距离加权和矩阵填充的位置指纹库构建算法。该算法仅需人工采集定位区域内少量参考点的接收信号强度值用作信标点指纹信息,结合反距离加权算法特性计算出次信标点指纹信息,根据位置指纹库数据矩阵的低秩性,应用奇异值阈值矩阵填充算法构建出位置指纹数据库。仿真实验结果表明,所提算法有效降低了矩阵填充算法构建位置指纹库所需的人工和时间成本,构建出的位置指纹库定位性能优于反距离加权和克里金空间插值法,接近传统人工采集法,显著地提高了位置指纹库的构建效率。