Reduced Order Models (ROMs) have been regarded as an efficient alternative to conventional high-fidelity Computational Fluid Dynamics (CFD) for accelerating the design and optimization processes in engineering applications. Many industrial geometries feature repeating subdomains or contain sub-regions governed by distinct physical phenomena, making them well-suited to Domain Decomposition (DD) techniques. The integration of ROM and DD is promising to further reduce computational costs by constructing local ROMs and assembling them into global solutions. Due to the complexity and necessity of coupling ROMs, many approaches have been proposed in recent years. This review provides a concise overview of existing methodologies combining ROM and DD. We categorize existing methods into intrusive (projection-based) and non-intrusive (data-driven) frameworks. Various strategies for generating local reduced bases and coupling them across subdomains are illustrated. Particular emphasis is placed on intrusive techniques, including equations, numerical algorithms, and practical implementations. The non-intrusive framework is also discussed, highlighting its general procedures, basic formulations, and underlying principles. Finally, we summarise the state of the literature, identify open challenges, and present perspectives on future implementation from an engineering viewpoint.
This note discusses an interesting matrix factorization called the CUR Decomposition. We illustrate various viewpoints of this method by comparing and contrasting them in different situations. Additionally, we offer a new characterization of CUR decompositions which synergizes these viewpoints and shows that they are indeed the same in the exact decomposition case.
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…
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 id…
The aim of this paper is to analyze from a mathematical perspective some existing schemes to partition a molecular density into several atomic contributions, with a specific focus on Iterative Stockholder Atom (ISA) methods. We provide a unified mathematical framework to describe the latter family of methods and propose a new scheme, named L-ISA (for linear approximation of ISA). We prove several important mathematical properties of the ISA and L-ISA minimization problems and show that the so-called ISA algorithms can be viewed as alternating minimization schemes, which in turn enables us to o…
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）
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,…
In this paper, we present recent efforts to develop reduced order modeling (ROM) capabilities for spectral element methods (SEM). Namely, we detail the implementation of ROM for both continuous Galerkin and discontinuous Galerkin methods in the spectral/hp element library Nektar++. The ROM approaches adopted are intrusive methods based on the proper orthogonal decomposition (POD). They admit an offline-online decomposition, such that fast evaluations for parameter studies and many-queries are possible. An affine parameter dependency is exploited such that the reduced order model can be evaluat…
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…
Low-Rank Tensor Networks for Dimensionality Reduction and Large-Scale Optimization Problems: Perspectives and Challenges PART 1
RIKEN Brain Science Institute（理化学研究所脑科学研究所）；SKOLTECH（斯科尔科沃科学技术学院）；Skolkovo Institute of Science and Technology（斯科尔科沃科学技术学院）；Institute of Numerical Mathematics of Russian Academy of Sciences（俄罗斯科学院计算数学研究所）；Imperial College（帝国理工学院）
In general, algorithms for order-3 CANDECOMP/-PARAFAC (CP), also coined canonical polyadic decomposition (CPD), are easily to implement and can be extended to higher order CPD. Unfortunately, the algorithms become computationally demanding, and they are often not applicable to higher order and relatively large scale tensors. In this paper, by exploiting the uniqueness of CPD and the relation of a tensor in Kruskal form and its unfolded tensor, we propose a fast approach to deal with this problem. Instead of directly factorizing the high order data tensor, the method decomposes an unfolded tens…
