On the Convergence of a Greedy Rank-One Update Algorithm for a Class of Linear SystemsReport as inadecuate




On the Convergence of a Greedy Rank-One Update Algorithm for a Class of Linear Systems - Download this document for free, or read online. Document in PDF available to download.

1 LAMPA - Laboratoire Arts et Métiers ParisTech d-Angers 2 GeM - Institut de Recherche en Génie Civil et Mécanique 3 Departamento de Ciencias, Físicas, Matemáticas y de la Computación

Abstract : 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.





Author: Amine Ammar - Francisco Chinesta - Antonio Falco -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents