We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued, pairwise orthogonal vectors. Such decompositions do not generally exist, but we show that some symmetric tensor decomposition problems can be converted to orthogonal problems following the whitening procedure proposed by Anandkumar et al. (2012). If an orthogonal decomposition of an $m$-way $n$-dimensional symmetric tensor exists, we propose a novel method to compute it that reduces to an $n \times n$ symmetric matrix eigenproblem. We provide numerical results demonstrating the effectiveness of the method.
The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and prove the lower semicontinuity of orthogonal rank. The lower semicontinuity guarantees the existence of low orthogonal rank approximation. To fit the orthogonal decomposition, we propose an algorithm based on the augmented Lagrangian method and guarantee the orthogonality by a novel orthogonalization procedure. Numerical experiments show that the proposed metho…
In this paper, we propose a computationally efficient iterative algorithm for proper orthogonal decomposition (POD) using random sampling based techniques. In this algorithm, additional rows and columns are sampled and a merging technique is used to update the dominant POD modes in each iteration. We derive bounds for the spectral norm of the error introduced by a series of merging operations. We use an existing theorem to get an approximate measure of the quality of subspaces obtained on convergence of the iteration. Results on various datasets indicate that the POD modes and/or the subspaces…
In this article, we propose a two-grid based adaptive proper orthogonal decomposition (POD) method to solve the time dependent partial differential equations. Based on the error obtained in the coarse grid, we propose an error indicator for the numerical solution obtained in the fine grid. Our new algorithm is cheap and easy to be implement. We apply our new method to the solution of time-dependent advection-diffusion equations with the Kolmogorov flow and the ABC flow. The numerical results show that our method is more efficient than the existing POD methods.
The error analysis of a proper orthogonal decomposition (POD) data assimilation (DA) scheme for the Navier-Stokes equations is carried out. A grad-div stabilization term is added to the formulation of the POD method. Error bounds with constants independent on inverse powers of the viscosity parameter are derived for the POD algorithm. No upper bounds in the nudging parameter of the data assimilation method are required. Numerical experiments show that, for large values of the nudging parameter, the proposed method rapidly converges to the real solution, and greatly improves the overall accurac…
Efficient implementation of the Localized Orthogonal Decomposition method
University of Münster（明斯特大学）；KTH Royal Institute of Technology（皇家理工学院）；Chalmers University of Technology（查尔姆斯理工大学）；University of Gothenburg（哥德堡大学）；University of Augsburg（奥格斯堡大学）
In this paper, we resolve several long standing issues dealing with optimal pointwise in time error bounds for proper orthogonal decomposition (POD) reduced order modeling of the heat equation. In particular, we study the role played by difference quotients (DQs) in obtaining reduced order model (ROM) error bounds that are optimal with respect to both the time discretization error and the ROM discretization error. When the DQs are not used, we prove that both the ROM projection error and the ROM error are suboptimal. When the DQs are used, we prove that both the ROM projection error and the RO…
A Localized Orthogonal Decomposition Method for Heterogeneous Mixed-Dimensional Problems
Institute for Applied and Numerical Mathematics, Karlsruhe Institute of Technology（卡尔斯鲁厄理工学院应用与数值数学研究所）；Department of Mathematical Sciences, Chalmers University of Technology and University of Gothenburg（查尔姆斯理工大学和哥德堡大学数学科学系）
We introduce a novel multi-resolution Localized Orthogonal Decomposition (LOD) for time-harmonic acoustic scattering problems that can be modeled by the Helmholtz equation. The method merges the concepts of LOD and operator-adapted wavelets (gamblets) and proves its applicability for a class of complex-valued, non-hermitian and indefinite problems. It computes hierarchical bases that block-diagonalize the Helmholtz operator and thereby decouples the discretization scales. Sparsity is preserved by a novel localization strategy that improves stability properties even in the elliptic case. We pre…
In our previous work [Singler, SIAM J. Numer. Anal. 52 (2014), no. 2, 852-876], we considered the proper orthogonal decomposition (POD) of time varying PDE solution data taking values in two different Hilbert spaces. We considered various POD projections of the data and obtained new results concerning POD projection errors and error bounds for POD reduced order models of PDEs. In this work, we improve on our earlier results concerning POD projections by extending to a more general framework that allows for non-orthogonal POD projections and seminorms. We obtain new exact error formulas and con…
This paper presents a method for the numerical treatment of reaction-convection-diffusion problems with parameter-dependent coefficients that are arbitrary rough and possibly varying at a very fine scale. The presented technique combines the reduced basis (RB) framework with the recently proposed super-localized orthogonal decomposition (SLOD). More specifically, the RB is used for accelerating the typically costly SLOD basis computation, while the SLOD is employed for an efficient compression of the problem's solution operator requiring coarse solves only. The combined advantages of both meth…
This paper presents a multi-scale method for convection-dominated diffusion problems in the regime of large Péclet numbers. The application of the solution operator to piecewise constant right-hand sides on some arbitrary coarse mesh defines a finite-dimensional coarse ansatz space with favorable approximation properties. For some relevant error measures, including the $L^2$-norm, the Galerkin projection onto this generalized finite element space even yields $\varepsilon$-independent error bounds, $\varepsilon$ being the singular perturbation parameter. By constructing an approximate local bas…
In a recent work [B. Koc et al., arXiv:2010.03750, SIAM J. Numer. Anal., to appear], the authors showed that including difference quotients (DQs) is necessary in order to prove optimal pointwise in time error bounds for proper orthogonal decomposition (POD) reduced order models of the heat equation. In this work, we introduce a new approach to including DQs in the POD procedure. Instead of computing the POD modes using all of the snapshot data and DQs, we only use the first snapshot along with all of the DQs and special POD weights. We show that this approach retains all of the numerical analy…
This work investigates the stability of (discrete) empirical interpolation for nonlinear model reduction and state field approximation from measurements. Empirical interpolation derives approximations from a few samples (measurements) via interpolation in low-dimensional spaces. It has been observed that empirical interpolation can become unstable if the samples are perturbed due to, e.g., noise, turbulence, and numerical inaccuracies. The main contribution of this work is a probabilistic analysis that shows that stable approximations are obtained if samples are randomized and if more samples …
We propose a novel rank-adaptive higher-order orthogonal iteration (HOOI) algorithm to compute the truncated Tucker decomposition of higher-order tensors with a given error tolerance, and prove that the method is locally optimal and monotonically convergent. A series of numerical experiments related to both synthetic and real-world tensors are carried out to show that the proposed rank-adaptive HOOI algorithm is advantageous in terms of both accuracy and efficiency. Some further analysis on the HOOI algorithm and the classical alternating least squares method are presented to further understan…
In this paper we study the problem of decomposing a given tensor into a tensor train such that the tensors at the vertices are orthogonally decomposable. When the tensor train has length two, and the orthogonally decomposable tensors at the two vertices are symmetric, we recover the decomposition by considering random linear combinations of slices. Furthermore, if the tensors at the vertices are symmetric and low-rank but not orthogonally decomposable, we show that a whitening procedure can transform the problem into the orthogonal case. When the tensor network has length three or more and the…
In this work, a numerical simulation of 1D Burgers' equation is developed using finite difference method and a reduced order model (ROM) of the simulation is developed using proper orthogonal decomposition (POD). The objective of this work is to provide an introduction of the POD method to researchers interested in computational fluid dynamics (CFD). This work discusses a physical interpretation of the POD method, its strengths and shortcomings and an implementation of the algorithm that may be extended to 2D, 3D Burgers' equation and other non-linear partial differential equations (PDE) of th…
To numerically approximate Borel probability measures by finite atomic measures, we study the spectral decomposition of discrepancy kernels when restricted to compact subsets of $\mathbb{R}^d$. For restrictions to the Euclidean ball in odd dimensions, to the rotation group $SO(3)$, and to the Grassmannian manifold $\mathcal{G}_{2,4}$, we compute the kernels' Fourier coefficients and determine their asymptotics. The $L_2$-discrepancy is then expressed in the Fourier domain that enables efficient numerical minimization based on the nonequispaced fast Fourier transform. For $SO(3)$, the nonequisp…
In this paper, a non-intrusive reduced-order model (ROM) for parametric reactor kinetics simulations is presented. Time-dependent ROMs are notoriously data intensive and difficult to implement when nonlinear multiphysics phenomena are considered. These challenges are exacerbated when parametric dependencies are included. The proper orthogonal decomposition mode coefficient interpolation (POD-MCI) ROM presented in this work can be constructed directly from lower-dimensional quantities of interest (QoIs) and is independent of the underlying model. This greatly alleviates the data requirement of …
