Título: Nonstationary multisplittings with general weighting matrices
Autores: Migallón Gomis, Violeta
Penadés Martínez, José
Szyld, Daniel B.
Fecha: 2007-10-04
2007-10-04
2001
Publicador: RUA Docencia
Fuente:
Tipo: info:eu-repo/semantics/article
Tema: Iterative methods
Linear systems
Symmetric positive definite matrices
Block methods
Parallel algorithms
Multisplitting
Two-stage
Nonstationary
Ciencia de la Computación e Inteligencia Artificial
Descripción: In the convergence theory of multisplittings for symmetric positive definite (s.p.d.) matrices it is usually assumed that the weighting matrices are scalar matrices, i.e., multiples of the identity. In this paper, this restrictive condition is eliminated. In its place it is assumed that more than one (inner) iteration is performed in each processor (or block). The theory developed here is applied to nonstationary multisplittings for s.p.d. matrices, as well as to two-stage multisplittings for symmetric positive semidefinite matrices.
This research was supported by Spanish DGESIC grant PB98-0977 and by National Science Foundation grants INT-9521226 and DMS-9973219.
Idioma: Inglés

Artículos similares:

Choosing the correct paradigm for unknown words in rule-based machine translation systems por Sánchez Cartagena, Víctor Manuel,Esplà Gomis, Miquel,Sánchez Martínez, Felipe,Pérez Ortiz, Juan Antonio
Using external sources of bilingual information for on-the-fly word alignment por Esplà Gomis, Miquel,Sánchez Martínez, Felipe,Forcada Zubizarreta, Mikel L.
10