SciELO - Scientific Electronic Library Online

 
vol.50 número4On the frequency of auroras over GermanyA geophysical characterization of monogenetic volcanism índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

  • No hay artículos similaresSimilares en SciELO

Compartir


Geofísica internacional

versión On-line ISSN 2954-436Xversión impresa ISSN 0016-7169

Resumen

HERRERA, Ismael; CARRILLO-LEDESMA, Antonio  y  ROSAS-MEDINA, Alberto. A brief overview of non-overlapping domain decomposition methods. Geofís. Intl [online]. 2011, vol.50, n.4, pp.445-463. ISSN 2954-436X.

An overview of non-overlapping domain decomposition methods is presented. The most efficient methods that exist at present, BDDC and FETI-DP, are placed in a 'primal' framework (the 'derived-vectors space (DVS)') which permits a synthetic and effective presentation of both: primal and 'dual' formulations. The derived-vectors space is similar to the setting used in BDDC. A significant difference is that, in the DVS framework, the problem considered is transformed into one that is defined in a product vector space while in BDDC that is not done. This simplifies the algorithmic formulations, which are summarized in a set of matrix-formulas applicable to symmetric, non-symmetric and indefinite matrices generated when treating numerically partial differential equations or systems of such equations. They can directly be used for code development. Two preconditioned algorithms of the mentioned set had not been reported previously in the DDM literature, as far as we know, and are suitable for being researched.

Palabras llave : iterative substructuring; non-overlapping domain decomposition; BDD; BDDC; FETI; FETI-DP; preconditioned; product space; Lagrange multipliers.

        · resumen en Español     · texto en Inglés     · Inglés ( pdf )

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons