Inicio Nosotros Búsquedas
Buscar en nuestra Base de Datos:     
Palabras claves o descriptores: ITERATIVE (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: Karátson, János ; Faragó, István
Título: Variable Preconditioning via Quasi-Newton Methods for Nonlinear Problems in Hilbert Space
Páginas/Colación: pp. 1242 - 1262
Url: Ir a http://epubs.siam.org/sam-bin/dbq/article/38427http://epubs.siam.org/sam-bin/dbq/article/38427
Siam Journal on Numerical Analysis Vol. 41, no. 4 Aug/Oct 2004
Información de existenciaInformación de existencia

Palabras Claves: Palabras: ITERATIVE \MT S IN \HSP ITERATIVE \MT S IN \HSP, Palabras: NONLINEAR ELLIPTIC PROBLEMS NONLINEAR ELLIPTIC PROBLEMS, Palabras: QUASI-NEWTON \MT S QUASI-NEWTON \MT S, Palabras: VARIABLE PRECONDITIONING VARIABLE PRECONDITIONING

Resumen
The aim of this paper is to develop stepwise variable preconditioning for the iterative solution of monotone operator equations in Hilbert space and apply it to nonlinear elliptic problems. The paper is built up to reflect the common character of preconditioned simple iterations and quasi-Newton methods. The main feature of the results is that the preconditioners are chosen via spectral equivalence. The latter can be executed in the corresponding Sobolev space in the case of elliptic problems, which helps both the construction and convergence analysis of preconditioners. This is illustrated by an example of a preconditioner using suitable domain decomposition.

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno

Generados por el servidor 'bibcyt.ucla.edu.ve' (18.117.81.240)
Adaptive Server Anywhere (07.00.0000)
ODBC
Sesión="" Sesión anterior=""
ejecutando Back-end Alejandría BE 7.0.7b0 ** * *
18.117.81.240 (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.117.81.240
Salida con Javascript


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