In this investigation the estimation method of the number of iterations for definite convergence condition by use of the Gauss-Seidel method applied for a set of linear equations which is obtained from the finite element analysis (or the finite difference analysis) of any rectangular area subdivided into N*M is proposed. Though the number of iterations can be obtained by using the eigenvalue of the governing equations, the proposed method does not require the eigenvalue but only the values of Nand M. Numerical experiments on this estimation method clarify that the estimated values are within the error bound of 10%
Problem statement: Development of mathematical models based on set of observed data plays a crucial ...
It is well known that as a famous type of iterative methods in numerical linear algebra, Gauss-Seide...
We present a module based criterion, i.e. a sufficient condition based on the absolute value of the ...
In this investigation the estimation method of the number of iterations for definite convergence con...
Analysis of real life problems often results in linear systems of equations for which solutions are ...
Physical systems are usually modeled by differential equations, but solving these differential equat...
The main problem considered is the effect due to changes in the shape of the region on the convergen...
Although large and sparse linear systems can be solved using iterative methods, its number of iterat...
The article discusses the Seidel method for solving a system of linear algebraic equations and an es...
AbstractA technique is developed whereby one can obtain asymptotic estimates of eigenvalues of first...
We present a module based criterion, i.e. a sufficient condition based on the absolute value of the ...
AbstractIn this paper, we obtain a practical sufficient condition for convergence of the Gauss-Seide...
AbstractWhen convergent Jacobi or Gauss-Seidel iterations can be applied to solve systems of linear ...
In this paper we introduce a process we have called "Gauss- Seidelization" for solving nonlinear equ...
AbstractIn 1991 A. D. Gunawardena et al. reported that the convergence rate of the Gauss-Seidel meth...
Problem statement: Development of mathematical models based on set of observed data plays a crucial ...
It is well known that as a famous type of iterative methods in numerical linear algebra, Gauss-Seide...
We present a module based criterion, i.e. a sufficient condition based on the absolute value of the ...
In this investigation the estimation method of the number of iterations for definite convergence con...
Analysis of real life problems often results in linear systems of equations for which solutions are ...
Physical systems are usually modeled by differential equations, but solving these differential equat...
The main problem considered is the effect due to changes in the shape of the region on the convergen...
Although large and sparse linear systems can be solved using iterative methods, its number of iterat...
The article discusses the Seidel method for solving a system of linear algebraic equations and an es...
AbstractA technique is developed whereby one can obtain asymptotic estimates of eigenvalues of first...
We present a module based criterion, i.e. a sufficient condition based on the absolute value of the ...
AbstractIn this paper, we obtain a practical sufficient condition for convergence of the Gauss-Seide...
AbstractWhen convergent Jacobi or Gauss-Seidel iterations can be applied to solve systems of linear ...
In this paper we introduce a process we have called "Gauss- Seidelization" for solving nonlinear equ...
AbstractIn 1991 A. D. Gunawardena et al. reported that the convergence rate of the Gauss-Seidel meth...
Problem statement: Development of mathematical models based on set of observed data plays a crucial ...
It is well known that as a famous type of iterative methods in numerical linear algebra, Gauss-Seide...
We present a module based criterion, i.e. a sufficient condition based on the absolute value of the ...