Semi-convergence and relaxation parameters for a class of SIRT algorithms.
Markov chain usage models were successfully used to model systems and software. The most prominent approaches are the so-called failure state models Whittaker and Thomason (1994) and the arc-based Bayesian models Sayre and Poore (2000). In this paper we propose arc-based semi-Markov usage models to test systems. We extend previous studies that rely on the Markov chain assumption to the more general semi-Markovian setting. Among the obtained results we give a closed form representation of the first...
MSC 2010: 33C15, 33C05, 33C45, 65R10, 20C40The paper contains some new formulas involving the Whittaker functions and arising as the values of some double integrals, which are invariant with respect to the representation of the group SO(2; 1).
We consider the problem of calculating a closed form expression for the integral of a real-valued function f:ℝⁿ → ℝ on a set S. We specialize to the particular cases when S is a convex polyhedron or an ellipsoid, and the function f is either a generalized polynomial, an exponential of a linear form (including trigonometric polynomials) or an exponential of a quadratic form. Laplace transform techniques allow us to obtain either a closed form expression, or a series representation that can be handled...
The inverse Fast Fourier Transform is a common procedure to solve a convolution equation provided the transfer function has no zeros on the unit circle. In our paper we generalize this method to the case of a singular convolution equation and prove that if the transfer function is a trigonometric polynomial with simple zeros on the unit circle, then this method can be extended.