Harm H. M. Weerts

According to our database, Harm H. M. Weerts authored at least 9 papers between 2016 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

Abstractions of linear dynamic networks for input selection in local module identification.

Harm H. M. Weerts, Jonas Linder, Martin Enqvist, Paul M. J. Van den Hof

Autom., 2020

2018

Identification in dynamic networks.

Paul M. J. Van den Hof, Arne G. Dankers, Harm H. M. Weerts

Comput. Chem. Eng., 2018

Prediction error identification of linear dynamic networks with rank-reduced noise.

Harm H. M. Weerts, Paul M. J. Van den Hof, Arne G. Dankers

Autom., 2018

Identifiability of linear dynamic networks.

Harm H. M. Weerts, Paul M. J. Van den Hof, Arne G. Dankers

Autom., 2018

Single Module Identifiability in Linear Dynamic Networks.

Harm H. M. Weerts, Paul M. J. Van den Hof, Arne G. Dankers

Proceedings of the 57th IEEE Conference on Decision and Control, 2018

2017

From closed-loop identification to dynamic networks: Generalization of the direct method.

Paul M. J. Van den Hof, Arne G. Dankers, Harm H. M. Weerts

Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017

Prediction error identification with rank-reduced output noise.

Paul M. J. Van den Hof, Harm H. M. Weerts, Arne G. Dankers

Proceedings of the 2017 American Control Conference, 2017

2016

Identifiability of dynamic networks with noisy and noise-free nodes.

Harm H. M. Weerts, Paul M. J. Van den Hof, Arne G. Dankers

CoRR, 2016

Identification of dynamic networks operating in the presence of algebraic loops.

Harm H. M. Weerts, Paul M. J. Van den Hof, Arne G. Dankers

Proceedings of the 55th IEEE Conference on Decision and Control, 2016