A domain decomposition method based on the iterative operator splitting method

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

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

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

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

منابع مشابه

An Iterative Domain Decomposition Procedure for the Reduced Basis Method

Reduced basis methods allow efficient model reduction of parametrized partial differential equations. In the current paper, we consider a reduced basis scheme for homogeneous domain decomposition problems. The method is based on iterative Dirichlet-Neumann coupling. We prove convergence of the iterative reduced scheme, derive rigorous a-posteriori error bounds and provide a full offline/online ...

متن کامل

Comparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems

Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...

متن کامل

New Iterative Method Based on Laplace Decomposition Algorithm

Since 2001, Laplace decomposition algorithm (LDA) has been one of the reliable mathematical methods for obtaining exact or numerical approximation solutions for a wide range of nonlinear problems. The Laplace decomposition algorithm was developed by Khuri in [2] to solve a class of nonlinear differential equations. The basic idea in Laplace decomposition algorithm, which is a combined form of t...

متن کامل

On convergence rate of the Douglas-Rachford operator splitting method

This note provides a simple proof on a O(1/k) convergence rate for the DouglasRachford operator splitting method where k denotes the iteration counter.

متن کامل

Finding the polar decomposition of a matrix by an efficient iterative method

Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.

متن کامل

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


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

ژورنال

عنوان ژورنال: Applied Numerical Mathematics

سال: 2009

ISSN: 0168-9274

DOI: 10.1016/j.apnum.2008.03.007