let $n$ be any positive integer, the friendship graph $f_n$ consists of $n$ edge-disjoint triangles that all of them meeting in one vertex. a graph $g$ is called cospectral with a graph $h$ if their adjacency matrices have the same eigenvalues. recently in href{http://arxiv.org/pdf/1310.6529v1.pdf}{http://arxiv.org/pdf/1310.6529v1.pdf} it is proved that if $g$ is any graph cospectral with $f_n$...

How accurately can deterministic modes be identified from a finite record of noisy data? In this paper we answer this question by computing the Cramer-Rao bound on the error covariance matrix of any unbiased estimator of mode parameters. The bound is computed for many of the standard parametric descriptions of a mode, including autoregressive and moving average parameters, poles and residues, a...

Deterministic population balance models including aggregation phenomena with more than two internal coordinates and without reduction to e.g. moments are to the best of the authors knowledge not published in literature so far. The problem of such models is the high computational demand and long simulation times which can easily reach the duration of weeks. Here the authors present a 3-dimension...

This paper describes the Parametrized Derivative-Free Model Predictive Control (pdf-mpc) package, a Matlab coder-based set of subroutines that enables a model predictive control problem to be defined and solved. the pdf-mpc is made available for free download and use through the website of the author.