"Splitting the recursive least-squares algorithm."

Thomas Magesacher et al. (2001)

> Home

Details and statistics

DOI: 10.1109/ISSPA.2001.949842

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isspa/MagesacherHZONB01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isspa/MagesacherHZONB01
Thomas Magesacher, Sven Haar, Roland Zukunft, Per Ödling, Tomas Nordström, Per Ola Börjesson:
Splitting the recursive least-squares algorithm. ISSPA 2001: 319-322

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.