Inicio Nosotros Búsquedas
Buscar en nuestra Base de Datos:     
Palabras claves o descriptores: PARALLEL (Comienzo)
2 registros cumplieron la condición especificada en la base de información BIBCYT. ()
Registro 1 de 2, Base de información BIBCYT
Publicación seriada
Referencias AnalíticasReferencias Analíticas
Autor: Deng, Qingping
Título: An Optimal Parallel Nonoverlapping Domain Decomposition Iterative Procedure
Páginas/Colación: pp. 964 - 982
Url: Ir a http://epubs.siam.org/sam-bin/dbq/article/40128http://epubs.siam.org/sam-bin/dbq/article/40128
Siam Journal on Numerical Analysis Vol. 41, no. 3 May/July 2004
Información de existenciaInformación de existencia

Palabras Claves: Palabras: DOMAIN DECOMPOSITION DOMAIN DECOMPOSITION, Palabras: ITERATIVE ITERATIVE, Palabras: NONCONFORMING NONCONFORMING, Palabras: NONOVERLAPPING NONOVERLAPPING, Palabras: PARALLEL PARALLEL, Palabras: PENALTY COEFFICIENT PENALTY COEFFICIENT, Palabras: ROBIN BOUNDARY CONDITION ROBIN BOUNDARY CONDITION, Palabras: TRANSMISSION COEFFICIENT TRANSMISSION COEFFICIENT, Palabras: TRANSMISSION DATA TRANSMISSION DATA, Palabras: UPDATE UPDATE

Resumen
A nonoverlapping domain decomposition iterative procedure is developed and analyzed for second order elliptic problems in $\mathbb R^N$. Its convergence is proved. The method is based on a Robin-type consistency condition with two parameters, called a transmission coefficient and a penalty coefficient, as a transmission condition together with a derivative-free transmission data updating technique on the artificial interfaces. Then the method is applied to the nonconforming finite element problems. A nonoverlapping domain decomposition iterative procedure for solving the nonconforming finite element problems of second order partial differential equations is developed and analyzed, which is directly presented to the nonconforming finite element problems without introducing any Lagrange multipliers. Its convergence is demonstrated, and the convergence rate is derived. The convergence analyses imply that the convergence rate is independent of the finite element meshes size while choosing the right parameters. Furthermore, the conclusions are extended to the unstructured finite element meshes. For both continuous problems and discrete problems, the method of this paper can be applied to general multisubdomain decompositions and implemented on parallel machines with local communications naturally. The method also allows choosing subdomains very flexibly, even as small as an individual element for finite element problems.

Registro 2 de 2, Base de información BIBCYT
Publicación seriada
Referencias AnalíticasReferencias Analíticas
Autor: El Baz, Didier
Título: M-Functions and Parallel Asynchronous Algorithms
Páginas/Colación: pp. 136-140
Url: Ir a http://locus.siam.org/SINUM/volume-27/art_0727008.htmlhttp://locus.siam.org/SINUM/volume-27/art_0727008.html
Siam Journal on Numerical Analysis Vol. 27, no. 1 February 1990
Información de existenciaInformación de existencia

Palabras Claves: Palabras: ASYNCHRONOUS ITERATIONS ASYNCHRONOUS ITERATIONS, Palabras: M -FUNCTIONS M -FUNCTIONS, Palabras: NONLINEAR SYSTEMS OF EQUATIONS NONLINEAR SYSTEMS OF EQUATIONS, Palabras: PARALLEL COMPUTATION PARALLEL COMPUTATION

Resumen
SIAM Journal on Applied Mathematics publica artículos de investigación referidos a problemas científicos usando métodos que son de interés matemático

RESUMEN

The solution of nonlinear systems of equations Fx = z via parallel asynchronous algorithms is considered. It is shown that when F is continuous, off-diagonally antitone, and strictly diagonally isotone, then point asynchronous iterations converge monotonically to a solution of the problem from supersolutions and subsolutions. A global convergence result for asynchronous iterations, when F is a continuous, surjective M-function is also presented.

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno

Generados por el servidor 'bibcyt.ucla.edu.ve' (18.223.106.100)
Adaptive Server Anywhere (07.00.0000)
ODBC
Sesión="" Sesión anterior=""
ejecutando Back-end Alejandría BE 7.0.7b0 ** * *
18.223.106.100 (NTM) bajo el ambiente Apache/2.2.4 (Win32) PHP/5.2.2.
usando una conexión ODBC (RowCount) al manejador de bases de datos..
Versión de la base de información BIBCYT: 7.0.0 (con listas invertidas [2.0])

Cliente: 18.223.106.100
Salida con Javascript


** Back-end Alejandría BE 7.0.7b0 *