Modified Crout’s method for an LU decomposition of an interval matrix

Nirmala, T.; Ganesan, K.

doi:10.1088/1742-6596/1000/1/012134

Cited by 2 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The method presented in [13,15,25,26,30] could not solve this system where 0 belongs to their elements to the right-hand side vector, because their methods cannot resolve divide-by-zero issues.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Two Iterative Methods for Solving Linear Interval Systems

Siahlooei

Fazeli

2018

Applied Computational Intelligence and Soft Computing

View full text Add to dashboard Cite

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 Ãx̃=b̃, where Ã 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 Ãx̃ and b̃ at every step while the norm is sufficiently small. In addition, we present another iterative method that solves Ãx̃=b̃, where Ã is a diagonally dominant interval matrix. This method, using the idea of steepest descent, finds exact solution x̃ for linear interval systems, where Ã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.

show abstract

Section: Resultsmentioning

confidence: 99%

“…In [22,27] methods have been published to find tolerable solutions. Also, some methods have been developed to obtain controllable solutions [14,28] and exact solutions [12,14,[29][30][31] of interval linear systems.…”

Section: ×=mentioning

confidence: 99%