On the Convergence of a Greedy Rank-One Update Algorithm for a Class of Linear Systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Archives of Computational Methods in Engineering Année : 2010

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

Résumé

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.
Fichier principal
Vignette du fichier
ACF.pdf (511.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01007145 , version 1 (06-01-2017)

Licence

Paternité

Identifiants

Citer

Amine Ammar, Francisco Chinesta, Antonio Falco. On the Convergence of a Greedy Rank-One Update Algorithm for a Class of Linear Systems. Archives of Computational Methods in Engineering, 2010, 17 (4), pp.473-486. ⟨10.1007/s11831-010-9048-z⟩. ⟨hal-01007145⟩
208 Consultations
237 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More