The dynamic mode decomposition (DMD) is a data-driven method used for identifying the dynamics of complex nonlinear systems. It extracts important characteristics of the underlying dynamics using measured time-domain data produced either by means of experiments or by numerical simulations. In the original methodology, the measurements are assumed to be approximately related by a linear operator. Hence, a linear discrete-time system is fitted to the given data. However, often, nonlinear systems modeling physical phenomena have a particular known structure. In this contribution, we propose an identification and reduction method based on the classical DMD approach allowing to fit a structured nonlinear system to the measured data. We mainly focus on two types of nonlinearities: bilinear and quadratic-bilinear. By enforcing this additional structure, more insight into extracting the nonlinear behavior of the original process is gained. Finally, we demonstrate the proposed methodology for different examples, such as the Burgers' equation and the coupled van der Pol oscillators.
In this paper, we develop a structure-preserving formulation of the data-driven vector fitting algorithm for the case of modally damped mechanical systems. Using the structured pole-residue form of the transfer function of modally damped second-order systems, we propose two possible structured extensions of the barycentric formula of system transfer functions. Integrating these new forms within the classical vector fitting algorithm leads to the formulation of two new algorithms that allow the computation of modally damped mechanical systems from data in a least squares fashion. Thus, the lear…
We provide a computational framework for approximating a class of structured matrices; here, the term structure is very general, and may refer to a regular sparsity pattern (e.g., block-banded), or be more highly structured (e.g., symmetric block Toeplitz). The goal is to uncover {\it additional latent structure} that will in turn lead to computationally efficient algorithms when the new structured matrix approximations are employed in the place of the original operator. Our approach has three steps: map the structured matrix to tensors, use tensor compression algorithms, and map the compresse…
Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to interesting linear algebra questions. Previously, we gave block-structured algorithms for inverting the Bernstein mass matrix on simplicial cells, but did not study fast alorithms for the univariate case. Here, we give several approaches to inverting the univariate mass matrix based on exact formulae for the inverse; decompositions of the inverse in terms of Hankel,…
Structured low rank decomposition of multivariate Hankel matrices
UCA, Inria, Aromath（法国南方高等研究院，Inria，Aromath）；Laboratory of mathematics and its applications LaMa-Lebanon, Lebanese University（黎巴嫩大学，数学及其应用实验室LaMa-Lebanon）
We present an iterative algorithm, called the symmetric tensor eigen-rank-one iterative decomposition (STEROID), for decomposing a symmetric tensor into a real linear combination of symmetric rank-1 unit-norm outer factors using only eigendecompositions and least-squares fitting. Originally designed for a symmetric tensor with an order being a power of two, STEROID is shown to be applicable to any order through an innovative tensor embedding technique. Numerical examples demonstrate the high efficiency and accuracy of the proposed scheme even for large scale problems. Furthermore, we show how …
University of Illinois Urbana-Champaign（伊利诺伊大学厄巴纳-香槟分校）；Memorial University of Newfoundland（纽芬兰纪念大学）
Domain decomposition methods are widely used and effective in the approximation of solutions to partial differential equations. Yet the optimal construction of these methods requires tedious analysis and is often available only in simplified, structured-grid settings, limiting their use for more complex problems. In this work, we generalize optimized Schwarz domain decomposition methods to unstructured-grid problems, using Graph Convolutional Neural Networks (GCNNs) and unsupervised learning to learn optimal modifications at subdomain interfaces. A key ingredient in our approach is an improved…
