This paper focuses on total least squares (TLS) problems AX ≈ B with multiple right-hand sides. Existence and uniqueness of a TLS solution for such problems was analyzed in the paper [I. Hnětynková, M. Plešinger, D. M. Sima, Z. Strakoš, and S. Van Huffel (2011)]. For TLS problems with single right-hand sides the paper [C. C. Paige and Z. Strakoš (2006)] showed how necessary and sufficient infor...

Abstract. This paper focuses on total least squares (TLS) problems AX ≈ B with multiple right-hand sides. Existence and uniqueness of a TLS solution for such problems was analyzed in the paper [I. Hnětynková, M. Plešinger, D. M. Sima, Z. Strakoš, and S. Van Huffel (2011)]. For TLS problems with single right-hand sides the paper [C. C. Paige and Z. Strakoš (2006)] showed how a necessary and suff...

The large systems of complex linear equations that are generated in QCD problems often have multiple right-hand sides (for multiple sources) and multiple shifts (for multiple masses). Deflated GMRES methods have previously been developed for solving multiple right-hand sides. Eigenvectors are generated during solution of the first right-hand side and used to speed up convergence for the other r...

Many parameter estimation problems involve with a parameter-dependent PDEs with multiple right hand sides. The computational cost and memory requirements of such problems increases linearly with the number of right hand sides. For many applications this is the main bottleneck of the computation. In this paper we show that problems with multiple right hand sides can be reformulated as stochastic...

In this paper, we propose a new seed projection method for solving shifted systems with multiple right-hand sides. This seed projection method uses a seed selection strategy. Numerical experiments are presented to show the efficiency of the newly method. Keywords—shifted systems, multiple right-hand sides, seed projection.