Learn More
In a recent paper [Rojas, Santos, Sorensen: ACM ToMS 34 (2008), Article 11] an efficient method for solving the Large-Scale Trust-Region Subproblem was suggested which is based on recasting it in terms of a parameter dependent eigenvalue problem and adjusting the parameter iteratively. The essential work at each iteration is the solution of an eigenvalue(More)
In a recent paper Sima, Van Huffel and Golub [Regularized total least squares based on quadratic eigenvalue problem solvers. BIT Numerical Mathematics 44, 793-812 (2004)] suggested a computational approach for solving regularized total least squares problems via a sequence of quadratic eigenvalue problems. Taking advantage of a variational characterization(More)
  • 1