Convergence of nonstationary multisplitting methods using ILU factorizations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Newton-Type Iterative Methods Based on ILU Factorizations

c © 2006 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...

متن کامل

Nonstationary Relaxed Multisplitting Methods for Solving Linear Complementarity Problems with H−matrices

In this paper we consider some non stationary relaxed synchronous and asynchronous multisplitting methods for solving the linear complementarity problems with their coefficient matrices being H−matrices. The convergence theorems of the methods are given,and the efficiency is shown by numerical tests.

متن کامل

Convergence of non-stationary parallel multisplitting methods for hermitian positive definite matrices

Non-stationary multisplitting algorithms for the solution of linear systems are studied. Convergence of these algorithms is analyzed when the coefficient matrix of the linear system is hermitian positive definite. Asynchronous versions of these algorithms are considered and their convergence investigated.

متن کامل

Non - Stationary Parallel Multisplitting Aor Methods ∗

Non-stationary parallel multisplitting iterative methods based on the AOR method are studied for the solution of nonsingular linear systems. Convergence of the synchronous and asyn-chronous versions of these methods is studied for H–matrices. Furthermore, computational results about these methods on both shared and distributed memory multiprocessors are discussed. The numerical examples present...

متن کامل

Convergence of nonstationary cascade algorithms

A nonstationary multiresolution of L 2 (R s) is generated by a sequence of scaling functions k 2 L 2 (R s); k 2 Z: We consider (k) that is the solution of the nonstationary reenement equations k = jMj P j h k+1 (j) k+1 (M ?j); k 2 Z; where h k is nitely supported for each k and M is a dilation matrix. We study various forms of convergence in L 2 (R s) of the corresponding nonstationary cascade ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2005

ISSN: 0377-0427

DOI: 10.1016/j.cam.2004.10.015