Solving bilinear tensor least squares problems and application to Hammerstein identification
Numerical Linear Algebra with Applications · 2019-03 · 26 (2)
DOI: 10.1002/nla.2226 ↗Kurz gefasst
Fachartikel in der Zeitschrift Numerical Linear Algebra with Applications, online erschienen am 10.12.2018. Verfasst von Lars Eldén und 1 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 24 Literaturangaben.
Abstract (Originalsprache)
Bilinear tensor least squares problems occur in applications such as Hammerstein system identification and social network analysis. A linearly constrained problem of medium size is considered, and nonlinear least squares solvers of Gauss–Newton‐type are applied to numerically solve it. The problem is separable, and the variable projection method can be used. Perturbation theory is presented and used to motivate the choice of constraint. Numerical experiments with Hammerstein models and random tensors are performed, comparing the different methods and showing that a variable projection method performs best.
Zitieren
APA
Eldén, L., & Ahmadi‐Asl, S. (2019). Solving bilinear tensor least squares problems and application to Hammerstein identification. Numerical Linear Algebra with Applications, 26(2). https://doi.org/10.1002/nla.2226
Vancouver
Eldén L, Ahmadi‐Asl S. Solving bilinear tensor least squares problems and application to Hammerstein identification. Numerical Linear Algebra with Applications. 2019;26(2). doi:10.1002/nla.2226
BibTeX
@article{Eldn2019,
author = {Eldén, Lars and Ahmadi‐Asl, Salman},
title = {Solving bilinear tensor least squares problems and application to Hammerstein identification},
journal = {Numerical Linear Algebra with Applications},
year = {2019},
volume = {26},
number = {2},
doi = {10.1002/nla.2226}
}
EUVIMED