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...

A deflated and restarted Lanczos algorithm to solve hermitian linear systems, and at the same time compute eigenvalues and eigenvectors for application to multiple right-hand sides, is described. For the first right-hand side, eigenvectors with small eigenvalues are computed while simultaneously solving the linear system. Two versions of this algorithm are given. The first is called Lan-DR and ...

1 Department of Computer and Information S ien e, Linköpings universitet, SE-581 83 Linköping, Sweden 2 É ole polyte hnique, Laboratoire d'informatique (LIX), 91128 Palaiseau Cedex, Fran e Abstra t. We study minimisation of integer linear programs with positive right-hand sides. We show that su h programs an be approximated within the maximum absolute row sum of the onstraint matrix A whenever ...

We introduce the bilevel knapsack problem with stochastic right-hand sides, and provide necessary and sufficient conditions for the existence of an optimal solution. When the leader’s decisions can take only integer values, we present an equivalent two-stage stochastic programming reformulation with binary recourse. We develop a branch-and-cut algorithm for solving this reformulation, and a bra...

1 Institute of Mathematics and Computer Science Academy of Sciences of Moldova Academiei 5, Chişinău, MD-2028, Moldova [email protected] 2 Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation, Huazhong University of Science and Technology Wuhan 430074, China 3 Faculty of Informatics, TU Wien Favoritenstraße 9–11, 1040 Vienna, Au...

Recently, we gave a theoretical explanation for superlinear convergence behavior observed while solving large symmetric systems of equations using the Conjugate Gradient method. Roughly speaking, one may observe superlinear convergence while solving a sequence of (symmetric positive definite) linear systems if the asymptotic eigenvalue distribution of the sequence of the corresponding matrices ...

We present a new variant of the Earley parsing algorithm capable of efficiently supporting context-free grammars with regular right hand-sides. We present the core state-machine driven algorithm, the translation of grammars into state machines, and the reconstruction algorithm. We also include a theoretical framework for presenting the algorithm and for evaluating optimizations. Finally, we eva...