On the Convergence of a Greedy Rank-One Update Algorithm for a Class of Linear Systems

• Autores: Amine Ammar, Francisco Chinesta , Antonio Falcó Montesinos
• Localización: Archives of computational methods in engineering: state of the art reviews, ISSN 1134-3060, Vol. 17, Nº. 4, 2010, págs. 473-486
• Idioma: inglés
• DOI: 10.1007/s11831-010-9048-z
• Texto completo no disponible (Saber más ...)
• Resumen

  • In this paper we study the convergence of the well-known Greedy Rank-One Update Algorithm. It is used to construct the rank-one series solution for full-rank linear systems. The existence of the rank one approximations is also not new, but surprisingly the focus there has been more on the applications side more that in the convergence analysis. Our main contribution is to prove the convergence of the algorithm and also we study the required rank one approximation in each step. We also give some numerical examples and describe its relationship with the Finite Element Method for High-Dimensional Partial Differential Equations based on the tensorial product of one-dimensional bases. We illustrate this situation taking as a model problem the multidimensional Poisson equation with homogeneous Dirichlet boundary condition