Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=5592890

A note on the efficiency of domain decomposed incomplete factorizations

Author
CHAN, T. F; GOOVAERTS, D
Univ. California, dep. mathematics, Los Angeles CA 90024, United States
Source

SIAM journal on scientific and statistical computing. 1990, Vol 11, Num 4, pp 794-803 ; ref : 24 ref

CODEN
SIJCD4
ISSN
0196-5204
Scientific domain
Computer science; Mathematics
Publisher
Society for Industrial and Applied Mathematics, Philadelphia, PA
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Algorithme parallèle Convergence Décomposition Equation dérivée partielle Factorisation Méthode gradient conjugué Problème elliptique
Keyword (en)
Parallel algorithm Convergence Decomposition Partial differential equation Factorization Conjugate gradient method
Keyword (es)
Algoritmo paralelo Convergencia Descomposición Ecuación derivada parcial Factorización Método gradiente conjugado
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02C Artificial intelligence

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
5592890

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web