Superimplicit iterative methods for solving systems of equations with block-tridiagonal materials

1985 ◽  
Vol 26 (1) ◽  
pp. 65-70
Author(s):  
V. P. Il'in
2019 ◽  
Vol 28 (1) ◽  
pp. 19-26
Author(s):  
IOANNIS K. ARGYROS ◽  
◽  
SANTHOSH GEORGE ◽  

We present the local as well as the semi-local convergence of some iterative methods free of derivatives for Banach space valued operators. These methods contain the secant and the Kurchatov method as special cases. The convergence is based on weak hypotheses specializing to Lipschitz continuous or Holder continuous hypotheses. The results are of theoretical and practical interest. In particular the method is compared favorably ¨ to other methods using concrete numerical examples to solve systems of equations containing a nondifferentiable term.


2021 ◽  
Vol 293 ◽  
pp. 02013
Author(s):  
Jinmei Wang ◽  
Lizi Yin ◽  
Ke Wang

Solving dense linear systems of equations is quite time consuming and requires an efficient parallel implementation on powerful supercomputers. Du, Zheng and Wang presented some new iterative methods for linear systems [Journal of Applied Analysis and Computation, 2011, 1(3): 351-360]. This paper shows that their methods are suitable for solving dense linear system of equations, compared with the classical Jacobi and Gauss-Seidel iterative methods.


2020 ◽  
Vol 2020 ◽  
pp. 1-8 ◽  
Author(s):  
K. Niazi Asil ◽  
M. Ghasemi Kamalvand

The indefinite inner product defined by J=diagj1,…,jn, jk∈−1,+1, arises frequently in some applications, such as the theory of relativity and the research of the polarized light. This indefinite scalar product is referred to as hyperbolic inner product. In this paper, we introduce three indefinite iterative methods: indefinite Arnoldi’s method, indefinite Lanczos method (ILM), and indefinite full orthogonalization method (IFOM). The indefinite Arnoldi’s method is introduced as a process that constructs a J-orthonormal basis for the nondegenerated Krylov subspace. The ILM method is introduced as a special case of the indefinite Arnoldi’s method for J-Hermitian matrices. IFOM is mentioned as a process for solving linear systems of equations with J-Hermitian coefficient matrices. Finally, by providing numerical examples, the FOM, IFOM, and ILM processes have been compared with each other in terms of the required time for solving linear systems and also from the point of the number of iterations.


Acta Numerica ◽  
2015 ◽  
Vol 24 ◽  
pp. 329-376 ◽  
Author(s):  
A. J. Wathen

The computational solution of problems can be restricted by the availability of solution methods for linear(ized) systems of equations. In conjunction with iterative methods, preconditioning is often the vital component in enabling the solution of such systems when the dimension is large. We attempt a broad review of preconditioning methods.


2014 ◽  
Vol 92 (9) ◽  
pp. 1921-1934 ◽  
Author(s):  
Taher Lotfi ◽  
Parisa Bakhtiari ◽  
Alicia Cordero ◽  
Katayoun Mahdiani ◽  
Juan R. Torregrosa

Sign in / Sign up

Export Citation Format

Share Document