a recurrence relation for computing the -norms of an Hermitian matrix is derived and an expression giving approximately the number of eigenvalues which in absolute value are equal to the spectral radius is determined. Using the -norms for the approximation of the spectral radius of an Hermitian matrix an a priori and a posteriori bounds for the error are obtained. Some properties of the a posteriori bound are discussed.
We extend the analysis of the recently proposed nonlinear EIS scheme applied to the partial eigenvalue problem. We address the case where the Rayleigh quotient iteration is used as the smoother on the fine-level. Unlike in our previous theoretical results, where the smoother given by the linear inverse power method is assumed, we prove nonlinear speed-up when the approximation becomes close to the exact solution. The speed-up is cubic. Unlike existent convergence estimates for the Rayleigh quotient...
This paper is devoted to computational problems related to Markov chains (MC) on a finite state space. We present formulas and bounds for characteristics of MCs using directed forest expansions given by the Matrix Tree Theorem. These results are applied to analysis of direct methods for solving systems of linear equations, aggregation algorithms for nearly completely decomposable MCs and the Markov chain Monte Carlo procedures.
The present article is a continuation of previous papers by the same authors devoted to the efficiency of crop rotation experiments. We focus on plans distinguished by the cyclical pattern of the incidence matrix. For practical reasons, we slightly modify the efficiency coefficient. The relation between the resulting efficiency coefficients is examined. In addition, we provide a background material on crop rotation experiments.
For contractive interval functions we show that results from the iterative process after finitely many iterations if one uses the epsilon-inflated vector as input for instead of the original output vector . Applying Brouwer’s fixed point theorem, zeros of various mathematical problems can be verified in this way.