This paper is an introduction to formal orthogonal polynomials and their application to Padé approximation, Krylov subspace methods for the solution of systems of linear equations, and convergence acceleration methods. Some more general formal orthogonal polynomials, and the concept of biorthogonality and its applications are also discussed.
The paper concerns estimation of the rose of directions of a stationary fibre process in from the intersection counts of the process with test planes. A new approach is suggested based on Bayesian statistical techniques. The method is derived from the special case of a Poisson line process however the estimator is shown to be consistent generally. Markov chain Monte Carlo (MCMC) algorithms are used for the approximation of the posterior distribution. Uniform ergodicity of the algorithms used is...
A new algorithm which generalizes the E-algorithm is presented. It is called the -algorithm. Some results on convergence acceleration for the -algorithm are proved. Some applications are given.