Exchangeable graphs arise via a sampling procedure from the measurable functions known as graphons. A natural estimation problem is how well we can recover a graphon given a single graph sampled from it. One general framework for estimating a graphon uses stepfunctions obtained by partitioning the nodes of the graph according to some clustering algorithm. We propose an iterative step-function e...

Perspective camera calibration has been i n the last decades a research subject for a large group of researchers and as a result several camera calibration methodologies can be found i n the literature. However only a small number of those methods base their approaches o n the use of monoplane calibration points. This paper describes one of those methodologies that uses monoplane calibration po...

A new type ð2; 2Þ-step iterative method related to an optimal Chebyshev method is developed for solving real and nonsymmetric linear systems of the form Ax 1⁄4 b. It is an extension of the ð2; 2Þ-step iterative method introduced in [Numer. Linear Algebra Appl. 7 (2000) 169]. The superiority of the new type ð2; 2Þ-step iterative method over the optimal Chebyshev method is derived in the case whe...

Block (including s-step) iterative methods for (non)symmetric linear systems have been studied and implemented in the past. In this article we present a (combined) block s-step Krylov iterative method for nonsymmetric linear systems. We then consider the problem of applying any block iterative method to solve a linear system with one right-hand side using many linearly independent initial resid...

A new method for robotics camera calibration based on a linear computation and using a coplanar group of calibration points is presented in this paper. This new method suppresses the constraint presented by the RAC calibration model of having an incidence angle between the optical axis and the calibration plane of at least 30 degrees. The parameters are obtained based on a multi-step calculatio...

In this paper we make an overview of s-step Conjugate Gradient and develop a novel formulation for s-step BiConjugate Gradient Stabilized iterative method. Also, we show how to add preconditioning to both of these s-step schemes. We explain their relationship to the standard, block and communication-avoiding counterparts. Finally, we explore their advantages, such as the availability of matrix-...