Search

In this paper, we consider the mixed ratcheting-periodic dividend strategies for spectrally negative L��vy risk model, in which dividend payments can both be made continuously without falling and discretely at the jump times of an independent Poisson process. The expected net present value(NPV) of dividends paid up to ruin and the Laplace transform of the ruin time are obtained by using L��vy fluctuation theory. All the results are expressed in terms of scale functions. Finally, numerical results for Brownian motion with drift are given., 25 pages, 5 figures

Power spectrum estimation is to use the limited length of data to estimate the power spectrum of the signal. In this paper, we study the recently proposed tunable high-resolution estimator (THREE), which is based on the best approximation to a given spectrum, with respect to different notions of distance between power spectral densities. We propose and demonstrate a different distance for the optimization part to estimate the multivariate spectrum. Its effectiveness is tested through Matlab simulation. Simulation shows that our approach constitutes a valid estimation procedure. And we also demonstrate the superiority of the method, which is more reliable and effective compared with the standard multivariate identification techniques.

Thresholding based iterative algorithms have the trade-off between effectiveness and optimality. Some are effective but involving sub-matrix inversions in every step of iterations. For systems of large sizes, such algorithms can be computationally expensive and/or prohibitive. The null space tuning algorithm with hard thresholding and feedbacks (NST+HT+FB) has a mean to expedite its procedure by a suboptimal feedback, in which sub-matrix inversion is replaced by an eigenvalue-based approximation. The resulting suboptimal feedback scheme becomes exceedingly effective for large system recovery problems. An adaptive algorithm based on thresholding, suboptimal feedback and null space tuning (AdptNST+HT+subOptFB) without a prior knowledge of the sparsity level is also proposed and analyzed. Convergence analysis is the focus of this article. Numerical simulations are also carried out to demonstrate the superior efficiency of the algorithm compared with state-of-the-art iterative thresholding algorithms at the same level of recovery accuracy, particularly for large systems.

Iterative algorithms based on thresholding, feedback and null space tuning (NST+HT+FB) for sparse signal recovery are exceedingly effective and fast, particularly for large scale problems. The core algorithm is shown to converge in finitely many steps under a (preconditioned) restricted isometry condition. In this paper, we present a new perspective to analyze the algorithm, which turns out that the efficiency of the algorithm can be further elaborated by an estimate of the number of iterations for the guaranteed convergence. The convergence condition of NST+HT+FB is also improved. Moreover, an adaptive scheme (AdptNST+HT+FB) without the knowledge of the sparsity level is proposed with its convergence guarantee. The number of iterations for the finite step of convergence of the AdptNST+HT+FB scheme is also derived. It is further shown that the number of iterations can be significantly reduced by exploiting the structure of the specific sparse signal or the random measurement matrix.

We establish Stechkin-Marchaud-type inequalities for some Feller operators by using some modified Ditzian-Totik modulus of smoothness. Then we derive some inverse results for this family of operators. Moreover combing the inverse results with the direct estimate we obtain a equivalent theorem.