The aim of this study was to compare iterative and direct solvers for estimation of marker effects in genomic selection. One iterative and two direct methods were used: Gauss-Seidel with Residual Update, Cholesky Decomposition and Gentleman-Givens rotations. For resembling different scenarios with respect to number of markers and of genotyped animals, a simulated data set divided into 25 subset...

In this paper we extend the continuum model for interdigital dielectrometry sensors and propose a new, direct technique for estimating material electrical properties from measurements. Interdigital sensors consist of alternating pairs of long, thin electrodes on a plane. An ideal model assumes that the periodic structure extends to infinity and the electrodes have no thickness. We extend this i...

We consider bipartite matching algorithms for computing permutations of a sparse matrix so that the diagonal of the permuted matrix has entries of large absolute value. We discuss various strategies for this and consider their implementation as computer codes. We also consider scaling techniques to further increase the relative values of the diagonal entries. Numerical experiments show the eeec...

a constitutive model based on two–dimensional unstructured galerkin finite volume method (gfvm) is introduced and applied for analyzing nonlinear behavior of cracked concrete structures in equilibrium condition. the developed iterative solver treats concrete as an orthotropic nonlinear material and considers the softening and hardening behavior of concrete under compression and tension by using...

One of the limitations of using iterative reconstruction methods in tomography is the slow performance compared with the direct reconstruction methods, such as Filtered Backprojection. In this paper we demonstrate a very fast implementation of most types of iterative reconstruction methods. The key idea of our method is to generate the huge system matrix only once, and store it using sparse mat...

We describe the iterative solution of dense linear systems arising from a surface integral equation of electromagnetic scattering. The complex symmetric version of QMR has been used as an iterative solver together with a sparse approximate inverse preconditioner. The preconditioner is computed using the topological information from the computational mesh. The matrix-vector products are computed...

In this paper we consider solving a sequence of weighted linear least squares problems where the only changes from one problem to the next are the weights and the right hand side (or data). We alternate between iterative and direct methods to solve the normal equations for the least squares problems. The direct method is the Cholesky factorization. For the iterative method we discuss a class of...

In this paper we have developed algorithms to solve macroeconometric models with forward-looking variables based on Newton method for nonlinear systems of equations. The most difficult step for Newton methods represents the resolution of a large linear system for each iteration. Thus, we compare the performances resulted by solving this linear system using two iterative methods and the direct m...

begin{abstract} in this paper, we introduce an iterative method for amenable semigroup of non expansive mappings and infinite family of non expansive mappings in the frame work of hilbert spaces. we prove the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem. the results present...