Two Iterative Methods for Solving Linear Interval Systems
Conjugate gradient is an iterative method that solves a linear system Ax=b, where A is a positive definite matrix. We present this new iterative method for solving linear interval systems Ãx̃=b̃, where à is a diagonally dominant interval matrix, as defined in this paper. Our method is based on con...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2018-01-01
|
Series: | Applied Computational Intelligence and Soft Computing |
Online Access: | http://dx.doi.org/10.1155/2018/2797038 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832554286966374400 |
---|---|
author | Esmaeil Siahlooei Seyed Abolfazl Shahzadeh Fazeli |
author_facet | Esmaeil Siahlooei Seyed Abolfazl Shahzadeh Fazeli |
author_sort | Esmaeil Siahlooei |
collection | DOAJ |
description | Conjugate gradient is an iterative method that solves a linear system Ax=b, where A is a positive definite matrix. We present this new iterative method for solving linear interval systems Ãx̃=b̃, where à is a diagonally dominant interval matrix, as defined in this paper. Our method is based on conjugate gradient algorithm in the context view of interval numbers. Numerical experiments show that the new interval modified conjugate gradient method minimizes the norm of the difference of Ãx̃ and b̃ at every step while the norm is sufficiently small. In addition, we present another iterative method that solves Ãx̃=b̃, where à is a diagonally dominant interval matrix. This method, using the idea of steepest descent, finds exact solution x̃ for linear interval systems, where Ãx̃=b̃; we present a proof that indicates that this iterative method is convergent. Also, our numerical experiments illustrate the efficiency of the proposed methods. |
format | Article |
id | doaj-art-6555a0417a374f5b8a8541ebae10d0fb |
institution | Kabale University |
issn | 1687-9724 1687-9732 |
language | English |
publishDate | 2018-01-01 |
publisher | Wiley |
record_format | Article |
series | Applied Computational Intelligence and Soft Computing |
spelling | doaj-art-6555a0417a374f5b8a8541ebae10d0fb2025-02-03T05:51:50ZengWileyApplied Computational Intelligence and Soft Computing1687-97241687-97322018-01-01201810.1155/2018/27970382797038Two Iterative Methods for Solving Linear Interval SystemsEsmaeil Siahlooei0Seyed Abolfazl Shahzadeh Fazeli1Department of Computer Science, Yazd University, Yazd, IranDepartment of Computer Science, Yazd University, Yazd, IranConjugate gradient is an iterative method that solves a linear system Ax=b, where A is a positive definite matrix. We present this new iterative method for solving linear interval systems Ãx̃=b̃, where à is a diagonally dominant interval matrix, as defined in this paper. Our method is based on conjugate gradient algorithm in the context view of interval numbers. Numerical experiments show that the new interval modified conjugate gradient method minimizes the norm of the difference of Ãx̃ and b̃ at every step while the norm is sufficiently small. In addition, we present another iterative method that solves Ãx̃=b̃, where à is a diagonally dominant interval matrix. This method, using the idea of steepest descent, finds exact solution x̃ for linear interval systems, where Ãx̃=b̃; we present a proof that indicates that this iterative method is convergent. Also, our numerical experiments illustrate the efficiency of the proposed methods.http://dx.doi.org/10.1155/2018/2797038 |
spellingShingle | Esmaeil Siahlooei Seyed Abolfazl Shahzadeh Fazeli Two Iterative Methods for Solving Linear Interval Systems Applied Computational Intelligence and Soft Computing |
title | Two Iterative Methods for Solving Linear Interval Systems |
title_full | Two Iterative Methods for Solving Linear Interval Systems |
title_fullStr | Two Iterative Methods for Solving Linear Interval Systems |
title_full_unstemmed | Two Iterative Methods for Solving Linear Interval Systems |
title_short | Two Iterative Methods for Solving Linear Interval Systems |
title_sort | two iterative methods for solving linear interval systems |
url | http://dx.doi.org/10.1155/2018/2797038 |
work_keys_str_mv | AT esmaeilsiahlooei twoiterativemethodsforsolvinglinearintervalsystems AT seyedabolfazlshahzadehfazeli twoiterativemethodsforsolvinglinearintervalsystems |