activity
20132019
most citedFamily Constraining of Iterative Algorithms

5 citations · 10 across the 7 of their papers we have counts for

collaborators

8 papers

math.NA2019

On numerical solution of full rank linear systems

A. Dumitrasc, Ph. Leleux, C. Popa +2

Matrices can be augmented by adding additional columns such that a partitioning of the matrix in blocks of rows defines mutually orthogonal subspaces. This augmented system can the…

math.NA2018★ 1 cited

The augmented Block Cimmino algorithm revisited

A. Dumitraşc, Ph. Leleux, C. Popa +2

In this paper we replay the definitions, constructions and results from [SIAM J. Sci. Comp., 37(3)(2015), A1248-A1269] by completing and developing some of them to inconsistent lea…

math.NA2017★ 1 cited

Parallel solution of large sparse linear least squares problems

Andrei Dumitraşc, Constantin Popa

In the recent paper [Duff I. et al, SIAM J. Sci. Comp., 37(3) (2015), A1248-A1269] the authors proposed an interesting procedure for the parallel solution of large, sparse consiste…

math.NA2017

On Remotest set and Random controls in Kaczmarz algorithm

Constantin Popa

In this paper we analyse the Kaczmarz projection algorithm with Remotest set and Random control of projection indices and provide a sufficient condition such that each projection i…

math.NA2017★ 1 cited

A note on Kaczmarz algorithm with remotest set control sequence

Constantin Popa

In this paper we analyse the Kaczmarz projection algorithm with remotest set control of projection indices. According to this procedure, in each iteration the projection index is o…

math.NA2017★ 2 cited

Convergence rates for Kaczmarz-type algorithms

Constantin Popa

In this paper we make a theoretical analysis of the convergence rates of Kaczmarz and Extended Kaczmarz projection algorithms for some of the most practically used control sequence…