Reduced Rank Extrapolation (RRE) is a polynomial type method used to accelerate the convergence of sequences of vectors $\{\boldsymbol{x}_m\}$. It is applied successfully in different disciplines of science and engineering in the solution of large and sparse systems of linear and nonlinear equations of very large dimension. If $\boldsymbol{s}$ is the solution to the system of equations $\boldsymbol{x}=\boldsymbol{f}(\boldsymbol{x})$, first, a vector sequence $\{\boldsymbol{x}_m\}$ is generated via the fixed-point iterative scheme $\boldsymbol{x}_{m+1}=\boldsymbol{f}(\boldsymbol{x}_m)$, $m=0,1,\ldots,$ and next, RRE is applied to this sequence to accelerate its convergence. RRE produces approximations $\boldsymbol{s}_{n,k}$ to $\boldsymbol{s}$ that are of the form $\boldsymbol{s}_{n,k}=\sum^k_{i=0}γ_i\boldsymbol{x}_{n+i}$ for some scalars $γ_i$ depending (nonlinearly) on $\boldsymbol{x}_n, \boldsymbol{x}_{n+1},\ldots,\boldsymbol{x}_{n+k+1}$ and satisfying $\sum^k_{i=0}γ_i=1$. The convergence properties of RRE when applied in conjunction with linear $\boldsymbol{f}(\boldsymbol{x})$ have been analyzed in different publications. In this work, we discuss the convergence of the $\boldsymbol{s}_{n,k}$ obtained from RRE with nonlinear $\boldsymbol{f}(\boldsymbol{x})$ (i)\,when $n\to\infty$ with fixed $k$, and (ii)\,in two so-called {\em cycling} modes.
Reduced rank extrapolation for multi-term Sylvester equations
Max Planck Institute for Dynamics of Complex Technical Systems(马克斯·普朗克复杂技术系统动力学研究所);Eindhoven University of Technology(埃因霍温理工大学);Leipzig University of Applied Sciences(莱比锡应用科学大学)
Generalizing Reduced Rank Extrapolation to Low-Rank Matrix Sequences
Eindhoven University of Technology(埃因霍温理工大学);Leipzig University of Applied Sciences(莱比锡应用科技大学);Max Planck Institute for Dynamics of Complex Technical Systems(马克斯·普朗克复杂技术系统动力学研究所)
Reduced Higher Order SVD: ubiquitous rank-reduction method in tensor-based scientific computing
张量数值方法,基于秩结构的张量表示的$d$变量函数和运营商,旨在提供$O(dn)$复杂性的数值计算$n^{\otimes d }$网格相反的$O(n^d)$缩放传统的基于网格的方法。然而,多个张量操作可能导致目标数据的张量秩(秩的诅咒)的巨大增加,使得计算变得棘手。因此,在张量计算中最重要的步骤之一是鲁棒的和有效的降秩过程,在多维算子和函数演算中的各种张量变换的过程中,应该多次执行。在文献[33]中引入的基于降阶高阶奇异值分解(RHOSVD)的降秩方法在张量数值方法的发展中起了重要作用。在这里,我们简要地调查RHOSVD方法的要点,然后集中在一些新的理论和计算方面的RHOSVD证明,这种降秩技术构成的基本成分,在张量计算的现实生活中的问题。特别地,给出了RHOSVD的稳定性分析。我们介绍了张量的多重线性代数表示的范围分离(RS)张量格式。这使得RHOSVD降秩技术可以应用于具有许多奇异性的非规则函数数据,例如,生物分子建模中集体多粒子相互作用势的秩结构计算,以及复杂的复合径向函数。给出了RHOSVD在散乱数据建模中应用的新的理论和数值结果。RHOSVD被证明是一种有效的降秩技术,在许多应用中,从多粒子系统的数值处理到PDE约束控制问题的数值解。
Structure-Preserving Reduced-Order Modeling via Low-Rank Transport Signatures
Duke University(杜克大学);University of Washington(华盛顿大学);Rensselaer Polytechnic Institute(伦斯勒理工学院);University of Pennsylvania(宾夕法尼亚大学);Cornell University(康奈尔大学);Georgia Institute of Technology(佐治亚理工学院)
Proximal Gradient-based Low Rank Tensor Decomposition for State Dependent Riccati Equation
Institute of Mathematical Science, ShanghaiTech University(上海科技大学数学科学学院);Department of Mathematics, University of Alabama at Birmingham(阿拉巴马大学伯明翰分校数学系)