A hybrid preconditioner of banded matrix approximation and alternating direction implicit iteration for symmetric Sinc–Galerkin linear systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Modified alternating direction-implicit iteration method for linear systems from the incompressible Navier-Stokes equations

This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...

متن کامل

An Alternating Direction Implicit Method for Modeling of Fluid Flow

This research includes of the numerical modeling of fluids in two-dimensional cavity. The cavity flow is an important theoretical problem. In this research, modeling was carried out based on an alternating direction implicit via Vorticity-Stream function formulation. It evaluates different Reynolds numbers and grid sizes. Therefore, for the flow field analysis and prove of the ability of the sc...

متن کامل

Implicit Alternating Direction Methods

in general plane regions and with respect to linear boundary conditions, is a classical problem of numerical analysis. Many such boundary value problems have been solved successfully on high-speed computing machines, using the (iterative) Young-Frankel "successive overrelaxation" (SOR) method as defined in [l] and [2], and variants thereof ("line" and "block" overrelaxation). For this method, e...

متن کامل

Scalable Stable Solvers for Non-symmetric Narrow-Banded Linear Systems

Banded linear systems with large bandwidths can be solved by similar methods as full linear systems. In particular, parallel algorithms based on torus-wrap mapping and Gaussian elimination with partial pivoting have been used with success. These algorithms are not suitable, however , if the bandwidth is small, say, between 1 and 100. As the bandwidth limits the amount of parallelism available a...

متن کامل

Implicit iteration approximation for a‎ ‎finite family of asymptotically quasi-pseudocontractive type‎ ‎mappings

In this paper‎, ‎strong convergence theorems of Ishikawa type implicit iteration‎ ‎process with errors for a finite family of asymptotically‎ ‎nonexpansive in the intermediate sense and asymptotically‎ ‎quasi-pseudocontractive type mappings in normed linear spaces are‎ ‎established by using a new analytical method‎, ‎which essentially‎ ‎improve and extend some recent results obtained by Yang‎ ‎...

متن کامل

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


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

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2003

ISSN: 0024-3795

DOI: 10.1016/s0024-3795(02)00502-5