Zobrazeno 1 - 10
of 104
pro vyhledávání: '"Apostolos Hadjidimos"'
Autor:
M. Tzoumas, Apostolos Hadjidimos
Publikováno v:
Numerical Algorithms. 86:1391-1419
There have been a couple of papers for the solution of the nonsingular symmetric saddle-point problem using three-parameter iterative methods. In most of them, regions of convergence for the parameters are found, while in three of them, optimal param
Autor:
Li-Li Zhang, Apostolos Hadjidimos
Publikováno v:
Journal of Computational and Applied Mathematics. 336:175-191
There are three main classes of iterative methods for the solution of the linear complementarity problem (LCP). In order of appearance these classes are: the “projected iterative methods”, the “(block) modulus algorithms” and the “modulus-b
Autor:
Vassilios A. Dougalis, Michael N. Vrahatis, Georgios Akrivis, D. Noutsos, Ilias S. Kotsireas, Efstratios Gallopoulos, Y. G. Saridakis, Apostolos Hadjidimos
Publikováno v:
Applied Numerical Mathematics. 104:99-102
Autor:
Apostolos Hadjidimos
Publikováno v:
BIT Numerical Mathematics. 56:1281-1302
In the last two decades, the augmented linear systems and the saddle point problems have been solved by many researchers who have used the conjugate gradient method or the generalized SOR iterative method and variants of them. In the latter class of
Autor:
M. Tzoumas, Apostolos Hadjidimos
Publikováno v:
Numerical Algorithms. 73:665-684
The Linear Complementarity Problem (LCP), with an H+źmatrix coefficient, is solved by using the new "(Projected) Matrix Analogue of the AOR (MAAOR)" iterative method; this new method constitutes an extension of the "Generalized AOR (GAOR)" iterative
Autor:
Xue-Ping Guo, Apostolos Hadjidimos
Publikováno v:
Journal of Computational and Applied Mathematics. 370:112662
In a recent paper a new iterative method for the solution of the nonsingular symmetric saddle point problem was proposed (Njeru and Guo, 2016). The ASOR method belongs to the family of the SOR-like methods and uses two parameters α and ω . Converge
Autor:
Apostolos Hadjidimos
Publikováno v:
Journal of Computational and Applied Mathematics. 288:366-378
The Accelerated Overrelaxation (AOR) and the Generalized AOR (GAOR) iterative methods for the solution of linear systems of algebraic equations ( A x = b , A ? C n i? n , det ( A ) ? 0 , b ? C n ) have been around for about four decades and a plethor
Autor:
Zhong-Zhi Bai, Apostolos Hadjidimos
Publikováno v:
Linear Algebra and its Applications. 463:322-339
For the extrapolated Cayley transform, we give necessary and sufficient conditions for guaranteeing its convergence and contraction (in the Euclidean norm). We derive upper bounds for the convergence and the contraction factors, and compute the optim
Autor:
Apostolos Hadjidimos, M. Tzoumas
Publikováno v:
Journal of Optimization Theory and Applications. 165:545-562
In the present work, we determine intervals of convergence for the various parameters involved for what is known as the generalized accelerated overrelaxation iterative method for the solution of the linear complementarity problem. The convergence in
Autor:
Apostolos Hadjidimos, M. Tzoumas
Publikováno v:
Linear Algebra and its Applications. 449:175-193
For the localization of the spectrum of the eigenvalues of a complex square matrix, the classical Gersgorin Theorem was extended by Ostrowski who used the generalized geometric mean of the row and column sums of the matrix. Ostrowski, and Brauer, ext