Skip to main content
SpringerLink
Log in

Regularization of Large Scale Total Least Squares Problems

  • Conference paper
Computer Information Systems – Analysis and Technologies

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 245))

  • 681 Accesses

Abstract

The total least squares (TLS) method is an appropriate approach for linear systems when not only the right-hand side but also the system matrix is contaminated by some noise. For ill-posed problems regularization is necessary to stabilize the computed solutions. In this presentation we discuss two approaches for regularizing large scale TLS problems. One which is based on adding a quadratic constraint and a Tikhonov type regularization concept.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bai, Z., Su, Y.: SOAR: A second order Arnoldi method for the solution of the quadratic eigenvalue problem. SIAM J. Matrix Anal. Appl. 26, 640–659 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Beck, A., Ben-Tal, A.: On the solution of the Tikhonov regularization of the total least squares problem. SIAM J. Optim. 17, 98–118 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Calvetti, D., Reichel, L., Shuibi, A.: Invertible smoothing preconditioners for linear discrete ill-posed problems. Appl. Numer. Math. 54, 135–149 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Eldén, L.: A weighted pseudoinverse, generalized singular values, and constrained least squares problems. BIT 22, 487–502 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gander, W., Golub, G., von Matt, U.: A constrained eigenvalue problem. Linear Algebra Appl. 114-115, 815–839 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  6. Golub, G., Hansen, P., O’Leary, D.: Tikhonov regularization and total least squares. SIAM J. Matrix Anal. Appl. 21, 185–194 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. Guo, H., Renaut, R.: A regularized total least squares algorithm. In: Van Huffel, S., Lemmerling, P. (eds.) Total Least Squares and Errors-in-Variable Modelling, pp. 57–66. Kluwer Academic Publisher, Dodrecht (2002)

    Chapter  Google Scholar 

  8. Hansen, P.: Regularization tools version 4.0 for Matlab 7.3. Numer. Alg. 46, 189–194 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lampe, J.: Solving regularized total least squares problems based on eigenproblems. Ph.D. thesis, Institute of Numerical Simulation, Hamburg University of Technology (2010)

    Google Scholar 

  10. Lampe, J., Voss, H.: On a quadratic eigenproblem occurring in regularized total least squares. Comput. Stat. Data Anal. 52/2, 1090–1102 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lampe, J., Voss, H.: A fast algorithm for solving regularized total least squares problems. Electr. Trans. Numer. Anal. 31, 12–24 (2008)

    MathSciNet  MATH  Google Scholar 

  12. Lampe, J., Voss, H.: Global convergence of RTLSQEP: a solver of regularized total least squares problems via quadratic eigenproblems. Math. Modelling Anal. 13, 55–66 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lampe, J., Voss, H.: Efficient determination of the hyperparameter in regularized total least squares problems. Tech. Rep. 133, Institute of Numerical Simulation, Hamburg University of Technology (2009); To appear in Appl. Numer. Math., doi10.1016/j.apnum.2010.06.005

    Google Scholar 

  14. Lampe, J., Voss, H.: Solving regularized total least squares problems based on eigenproblems. Taiwanese J. Math. 14, 885–909 (2010)

    MathSciNet  MATH  Google Scholar 

  15. Lampe, J., Voss, H.: Large-scale Tikhonov regularization of total least squares. Tech. Rep. 153, Institute of Numerical Simulation, Hamburg University of Technology (2011); Submitted to J. Comput. Appl. Math.

    Google Scholar 

  16. Lehoucq, R., Sorensen, D., Yang, C.: ARPACK Users’ Guide. Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. SIAM, Philadelphia (1998)

    Book  MATH  Google Scholar 

  17. Li, R.C., Ye, Q.: A Krylov subspace method for quadratic matrix polynomials with application to constrained least squares problems. SIAM J. Matrix Anal. Appl. 25, 405–428 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. Markovsky, I., Van Huffel, S.: Overview of total least squares methods. Signal Processing 87, 2283–2302 (2007)

    Article  MATH  Google Scholar 

  19. Renaut, R., Guo, H.: Efficient algorithms for solution of regularized total least squares. SIAM J. Matrix Anal. Appl. 26, 457–476 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  20. Sima, D., Van Huffel, S., Golub, G.: Regularized total least squares based on quadratic eigenvalue problem solvers. BIT Numerical Mathematics 44, 793–812 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  21. Voss, H.: An Arnoldi method for nonlinear eigenvalue problems. BIT Numerical Mathematics 44, 387–401 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Numerical Simulation, Hamburg University of Technology, D-21071, Hamburg, Germany

    Heinrich Voss

  2. Germanischer Lloyd SE, D-20457, Hamburg, Germany

    Jörg Lampe

Authors
  1. Heinrich Voss
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jörg Lampe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Calcutta, 92 APC Road, 700009, Kolkata, India

    Nabendu Chaki

  2. Università Ca’ Foscari di Venezia, via Torino 155, 30172, Mestre, Italy

    Agostino Cortesi

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Voss, H., Lampe, J. (2011). Regularization of Large Scale Total Least Squares Problems. In: Chaki, N., Cortesi, A. (eds) Computer Information Systems – Analysis and Technologies. Communications in Computer and Information Science, vol 245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27245-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27245-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27244-8

  • Online ISBN: 978-3-642-27245-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation