AMMAR, Amine; CHINESTA, Francisco; FALCO, Antonio

doi:10.1007/s11831-010-9048-z

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

AMMAR, Amine
Laboratoire Angevin de Mécanique, Procédés et InnovAtion [LAMPA]

CHINESTA, Francisco
Institut de Recherche en Génie Civil et Mécanique [GeM]

FALCO, Antonio
Departamento de Ciencias, Físicas, Matemáticas y de la Computación

Langue

Article de revue

Ce document a été publié dans

Archives of Computational Methods in Engineering. 2010, vol. 17, n° 4, p. 473-486

Springer Verlag

Résumé en anglais

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.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

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

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche