In this paper, we consider a modification of the parallel projection method for solving overdetermined nonlinear systems of equations introduced recently by Diniz-Ehrhardt and Martínez [1]. This method is based on the classical Cimmino's algorithm for solving linear systems. The components of the function are divided into small blocks, as an attempt to correct the intrinsic ill-conditioning of the system, and the new iteration is a convex combination of the projections onto the linear manifolds defined by different blocks. The modification suggested here was motivated by the application of the method to the resolution of a nonlinear Fredholm first kind integral equation. We prove convergence results and we report numerical experiments. © 19...
AbstractAn iterative method for solving general systems of linear inequalities is considered. The me...
Abstract. We present a Projection onto Convex Sets (POCS) type algorithm for solving systems of line...
AbstractAn iterative method is proposed for solving convex feasibility problems. Each iteration is a...
AbstractIn this paper, we consider a modification of the parallel projection method for solving over...
AbstractIn this paper, we consider a modification of the parallel projection method for solving over...
We consider overdetermined nonlinear systems of equations F(x)=0, where F: ℝ n → ℝ m, m≥n. For this ...
summary:A direct projection method for solving systems of linear algebraic equations is described. T...
The Projected Aggregation Methods (PAM) for solving linear systems of equali- ties and/or inequaliti...
summary:A direct projection method for solving systems of linear algebraic equations is described. T...
We consider linear feasibility problems in the "standard" form Ax = b, 1 ≤ x ≤ u. The successive ort...
AbstractThe solution of linear systems of equations using various projection algorithms is considere...
In these notes we will present an overview of a number of related iterative methods for the solution...
In this paper we give the results found in solving consistent sparse systems of nonlinear equatio...
AbstractWe analyze the convergence of iterative process in Rn, of the type xk + 1 =Φ(xk, wk). Using ...
In this paper we give the results found in solving consistent sparse systems of nonlinear equatio...
AbstractAn iterative method for solving general systems of linear inequalities is considered. The me...
Abstract. We present a Projection onto Convex Sets (POCS) type algorithm for solving systems of line...
AbstractAn iterative method is proposed for solving convex feasibility problems. Each iteration is a...
AbstractIn this paper, we consider a modification of the parallel projection method for solving over...
AbstractIn this paper, we consider a modification of the parallel projection method for solving over...
We consider overdetermined nonlinear systems of equations F(x)=0, where F: ℝ n → ℝ m, m≥n. For this ...
summary:A direct projection method for solving systems of linear algebraic equations is described. T...
The Projected Aggregation Methods (PAM) for solving linear systems of equali- ties and/or inequaliti...
summary:A direct projection method for solving systems of linear algebraic equations is described. T...
We consider linear feasibility problems in the "standard" form Ax = b, 1 ≤ x ≤ u. The successive ort...
AbstractThe solution of linear systems of equations using various projection algorithms is considere...
In these notes we will present an overview of a number of related iterative methods for the solution...
In this paper we give the results found in solving consistent sparse systems of nonlinear equatio...
AbstractWe analyze the convergence of iterative process in Rn, of the type xk + 1 =Φ(xk, wk). Using ...
In this paper we give the results found in solving consistent sparse systems of nonlinear equatio...
AbstractAn iterative method for solving general systems of linear inequalities is considered. The me...
Abstract. We present a Projection onto Convex Sets (POCS) type algorithm for solving systems of line...
AbstractAn iterative method is proposed for solving convex feasibility problems. Each iteration is a...