This paper examines and contrasts the feasibility of joint state and parameter estimation of noisedriven chaotic systems using the extended Kalman filter (EKF), ensemble Kalman filter (EnKF), and particle filter (PF). In particular, we consider the chaotic vibration of a noisy Duffing oscillator perturbed by combined harmonic and random inputs ensuing a transition probability density function (pdf) of motion which displays strongly non-Gaussian features. This system offers computational simplicity while exhibiting a kaleidoscope of dynamical behavior with a slight change of input and system parameters. An extensive numerical study is undertaken to contrast the performance of various nonlinear filtering algorithms with respect to sparsity of observational data and strength of model and measurement noise. In general, the performance of EnKF is better than PF for smaller ensemble size, while for larger ensembles PF outperforms EnKF. For moderate measurement noise and frequent measurement data, EKF is able to correctly track the dynamics of the system. However, EKF performance is unsatisfactory in the presence of sparse observational data or strong measurement noise.

A central issue in complex networks is tolerance of random failures and intentional attacks. Current literature emphasizes the dichotomy between networks with a power-law node connectivity distribution, which are robust to random failures but fragile to targeted attacks, versus networks with an exponentially decaying connectivity distribution, which are less tolerant to failures but more resilient to attacks. We prove analytically that the optimal network configuration under a classic measure of robustness is altogether different from both of the above: in all cases, failure and/or attack, there are no more than three distinct node connectivities in the optimal network.

No abstract

No abstract

No abstract

SUMMARYWe present a novel theoretical framework for the domain decomposition of uncertain systems defined by stochastic partial differential equations. The methodology involves a domain decomposition method in the geometric space and a functional decomposition in the probabilistic space. The probabilistic decomposition is based on a version of stochastic finite elements based on orthogonal decompositions and projections of stochastic processes. The spatial decomposition is achieved through a Schur-complementbased domain decomposition. The methodology aims to exploit the full potential of high-performance computing platforms by reducing discretization errors with high-resolution numerical model in conjunction to giving due regards to uncertainty in the system. The mathematical formulation is numerically validated with an example of waves in random media.

No abstract

No abstract