Skip to main content

From Data to Models

  • Chapter
Book cover Low Rank Approximation

Part of the book series: Communications and Control Engineering ((CCE))

  • 2388 Accesses

Abstract

In Chap. 1, the equivalence between line fitting and rank-one matrix approximation was considered. This chapter extends the equivalence to general linear static and dynamic linear time-invariant data modeling problems. First, three linear static model representations—kernel, image, and input/output—are defined and the connections among them are shown. Then, representations of linear time-invariant dynamic models are defined. Finally, exact and approximate modeling problems are related to low rank approximation problems. In the general case of linear dynamic modeling, the problem is Hankel structured low rank approximation.

… whenever we have two different representations of the same thing we can learn a great deal by comparing representations and translating descriptions from one representation into the other. Shifting descriptions back and forth between representations can often lead to insights that are not inherent in either of the representations alone.

Abelson and diSessa (1986, p. 105)

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.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

References

  • Abelson H, diSessa A (1986) Turtle geometry. MIT Press, New York

    Google Scholar 

  • Antoulas A, Willems JC (1993) A behavioral approach to linear exact modeling. IEEE Trans Automat Control 38(12):1776–1802

    Article  MathSciNet  MATH  Google Scholar 

  • Beck A, Ben-Tal A (2006) A global solution for the structured total least squares problem with block circulant matrices. SIAM J Matrix Anal Appl 27(1):238–255

    Article  MathSciNet  Google Scholar 

  • De Moor B (1993) Structured total least squares and L 2 approximation problems. Linear Algebra Appl 188–189:163–207

    Article  Google Scholar 

  • Gabriel K, Zamir S (1979) Lower rank approximation of matrices by least squares with any choice of weights. Technometrics 21:489–498

    Article  MATH  Google Scholar 

  • Kuijper M (1997) An algorithm for constructing a minimal partial realization in the multivariable case. Control Lett 31(4):225–233

    Article  MathSciNet  MATH  Google Scholar 

  • Kuijper M, Willems JC (1997) On constructing a shortest linear recurrence relation. IEEE Trans Automat Control 42(11):1554–1558

    Article  MathSciNet  MATH  Google Scholar 

  • Kung S (1978) A new identification method and model reduction algorithm via singular value decomposition. In: Proc 12th asilomar conf circuits, systems, computers, Pacific Grove, pp 705–714

    Google Scholar 

  • Lemmerling P, De Moor B (2001) Misfit versus latency. Automatica 37:2057–2067

    Article  MATH  Google Scholar 

  • Manton J, Mahony R, Hua Y (2003) The geometry of weighted low-rank approximations. IEEE Trans Signal Process 51(2):500–514

    Article  MathSciNet  Google Scholar 

  • Markovsky I, Van Huffel S (2007) Left vs right representations for solving weighted low rank approximation problems. Linear Algebra Appl 422:540–552

    Article  MathSciNet  MATH  Google Scholar 

  • Markovsky I, Rastello ML, Premoli A, Kukush A, Van Huffel S (2005a) The element-wise weighted total least squares problem. Comput Stat Data Anal 50(1):181–209

    Article  Google Scholar 

  • Markovsky I, Willems JC, Van Huffel S, Moor BD, Pintelon R (2005b) Application of structured total least squares for system identification and model reduction. IEEE Trans Automat Control 50(10):1490–1500

    Article  MathSciNet  Google Scholar 

  • Roorda B (1995a) Algorithms for global total least squares modelling of finite multivariable time series. Automatica 31(3):391–404

    Article  MathSciNet  MATH  Google Scholar 

  • Roorda B (1995b) Global total least squares—a method for the construction of open approximate models from vector time series. PhD thesis, Tinbergen Institute

    Google Scholar 

  • Roorda B, Heij C (1995) Global total least squares modeling of multivariate time series. IEEE Trans Automat Control 40(1):50–63

    Article  MathSciNet  MATH  Google Scholar 

  • Srebro N (2004) Learning with matrix factorizations. PhD thesis, MIT

    Google Scholar 

  • Vanluyten B, Willems JC, De Moor B (2005) Model reduction of systems with symmetries. In: Proc 44th IEEE conf dec control, Seville, Spain, pp 826–831

    Chapter  Google Scholar 

  • Wentzell P, Andrews D, Hamilton D, Faber K, Kowalski B (1997) Maximum likelihood principal component analysis. J Chemom 11:339–366

    Article  Google Scholar 

  • Willems JC (1986) From time series to linear system—Part II. Exact modelling. Automatica 22(6):675–694

    Article  MathSciNet  MATH  Google Scholar 

  • Willems JC (1987) From time series to linear system—Part III. Approximate modelling. Automatica 23(1):87–115

    Article  MathSciNet  MATH  Google Scholar 

  • Willems JC (1997) On interconnections, control, and feedback. IEEE Trans Automat Control 42:326–339

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ivan Markovsky .

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag London Limited

About this chapter

Cite this chapter

Markovsky, I. (2012). From Data to Models. In: Low Rank Approximation. Communications and Control Engineering. Springer, London. https://doi.org/10.1007/978-1-4471-2227-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-2227-2_2

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-2226-5

  • Online ISBN: 978-1-4471-2227-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics