Hierarchical subspace identification of directed acyclic graphs

DOI10.1080/00207179.2014.942800zbMath1328.93079OpenAlexW2046440205MaRDI QIDQ5265893

Verhaegen, Michel, Jan-Willem van Wingerden, Patricio Torres

Publication date: 29 July 2015

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207179.2014.942800

zbMATH Keywords

directed acyclic graphsstructure detectionPO-MOESPsubspace-identificationRQ factorisation

Mathematics Subject Classification ID

Applications of graph theory (05C90) System identification (93B30)

Related Items (3)

A frequency domain approach for local module identification in dynamic networks ⋮ Learning linear modules in a dynamic network using regularized kernel-based methods ⋮ The geometric convexity on SE(3) and its application to the formation tracking in multi-vehicle systems

Cites Work

• Overview of total least-squares methods
• Modeling the topology of a dynamical network via Wiener filtering approach
• 4SID: Subspace algorithms for the identification of combined deterministic-stochastic systems
• Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
• A Bayesian approach to sparse dynamic network identification
• The role of vector autoregressive modeling in predictor-based subspace identification
• Rank-Sparsity Incoherence for Matrix Decomposition
• Subspace model identification Part 1. The output-error state-space model identification class of algorithms
• Tikhonov Regularization and Total Least Squares
• Topological Identification in Networks of Dynamical Systems
• Digraphs

This page was built for publication: Hierarchical subspace identification of directed acyclic graphs