AbstractIn this paper we construct and theoretically analyze a class of direct projection algorithms for the numerical solution of linear least squares problems. These algorithms are obtained by adding supplementary directions for projection, constructed as linear combinations of the initial system rows and columns, in Kaczmarz and Extended Kaczmarz iterative methods. The above ideas are extended to the block row and column versions of the previously mentioned methods. The developed algorithms are then compared with other direct projection-based methods by the application to problems arising in multibody elasticity
A general procedure is described for setting up monotonically convergent algorithms to solve some ge...
AbstractWe present a unifying framework for a wide class of iterative methods in numerical linear al...
This paper presents a new iterative solver for least-squares problems, which is developed based on t...
AbstractIn this paper we construct and theoretically analyze a class of direct projection algorithms...
ABSTRACT. The Kaczmarz method is an iterative method for solving overcomplete linear systems of equa...
The paper describes a numerically stable algorithm to solve constrained linear least-squares problem...
An oblique projection method is adapted to solve large, sparse, unstructured systems of linear equat...
AbstractAn algorithm previously introduced by the author for finding a feasible point of a system of...
AbstractThe solution of linear systems of equations using various projection algorithms is considere...
AbstractIn a recent paper, the authors applied Dykstra's alternating projection algorithm to solve c...
Starting from an extension of Kaczmarz's method, obtained by us in a previous paper, we introduce n...
Abstract. This paper develops least-squares methods for the solution of linear elastic prob-lems in ...
I present a new divide-and-conquer algorithm for solving continuous linear least-squares problems. T...
In this thesis, we present algorithms for local and global minimization of some Procrustes type prob...
Abstract. An inverse eigenvalue problem, where a matrix is to be constructed from some or all of its...
A general procedure is described for setting up monotonically convergent algorithms to solve some ge...
AbstractWe present a unifying framework for a wide class of iterative methods in numerical linear al...
This paper presents a new iterative solver for least-squares problems, which is developed based on t...
AbstractIn this paper we construct and theoretically analyze a class of direct projection algorithms...
ABSTRACT. The Kaczmarz method is an iterative method for solving overcomplete linear systems of equa...
The paper describes a numerically stable algorithm to solve constrained linear least-squares problem...
An oblique projection method is adapted to solve large, sparse, unstructured systems of linear equat...
AbstractAn algorithm previously introduced by the author for finding a feasible point of a system of...
AbstractThe solution of linear systems of equations using various projection algorithms is considere...
AbstractIn a recent paper, the authors applied Dykstra's alternating projection algorithm to solve c...
Starting from an extension of Kaczmarz's method, obtained by us in a previous paper, we introduce n...
Abstract. This paper develops least-squares methods for the solution of linear elastic prob-lems in ...
I present a new divide-and-conquer algorithm for solving continuous linear least-squares problems. T...
In this thesis, we present algorithms for local and global minimization of some Procrustes type prob...
Abstract. An inverse eigenvalue problem, where a matrix is to be constructed from some or all of its...
A general procedure is described for setting up monotonically convergent algorithms to solve some ge...
AbstractWe present a unifying framework for a wide class of iterative methods in numerical linear al...
This paper presents a new iterative solver for least-squares problems, which is developed based on t...