A Young-Eidson's type algorithm for complex p-cyclic SOR spectra

Linear Algebra and Its Applications - Tập 286 - Trang 87-106 - 1999
S. Galanis1,2, A. Hadjidimos2, D. Noutsos1,2
1Department of Mathematics, University of Ioannina, GR-451 10 Ioannina, Greece
2Computer Science Department, Purdue University, West Lafayette, IN 47907, USA

Tài liệu tham khảo

Berman, 1994 Eiermann, 1990, Optimal successive overrelaxation iterative methods forp-cyclic matrices, Numer. Math., 57, 593, 10.1007/BF01386430 Galanis, 1992, Best cyclic repartitioning for optimal SOR convergence, SIAM J. Matrix Anal. Appl., 13, 102, 10.1137/0613010 Galanis, 1988, On the equivalence of the k-step iterative Euler methods and successive overrelaxation (SOR) methods for k-cyclic matrices, Math. Comput. Simulation, 30, 213, 10.1016/0378-4754(88)90001-8 Galanis, 1997, Optimalp-cyclic SOR for complex spectra, Linear Algebra Appl., 263, 233, 10.1016/S0024-3795(96)00538-1 Galanis, 1996, A Young-Eidson's Type Algorithm for Complexp-cyclic SOR Spectra Hadjidimos, 1990, The Young-Eidson algorithm: applications and extensions, SIAM J. Matrix Anal. Appl., 11, 620, 10.1137/0611045 Hadjidimos, 1993, Analysis ofp-cyclic iterations for Markov chains. Linear algebra. Markov chain and queueing models, vol. 48, 111 Hadjidimos, 1994, Optimalp-cyclic SOR, Numer. Math., 67, 475, 10.1007/s002110050039 Kontovasilis, 1991, Block cyclic SOR for Markov chains withp-cyclic infintesimal generator, Linear Algebra Appl., 154–156, 145, 10.1016/0024-3795(91)90377-9 Kjellberg, 1958, On the convergence of the successive over-relaxation applied to a class of linear systems of equations with complex eigenvalues, Ericsson Technics Stockholm, 2, 245 Kredell, 1962, On complex successive overrelaxation, BIT, 2, 143, 10.1007/BF01957329 Markham, 1985, Convergence of a direct-iterative method for large-scale least squares problems, Linear Algebra Appl., 69, 155, 10.1016/0024-3795(85)90073-4 Niethammer, 1964, Relaxation bei matrizen mit der eigenschaft “A”, Z. Angrew. Math. Mech., 44, T49 Niethammer, 1984, Convergence of block iterative methods applied to sparse least squares problems, Linear Algebra Appl., 58, 327, 10.1016/0024-3795(84)90218-0 Niethammer, 1983, The analysis of k-step iterative methods for linear systems from summability theory, Numer. Math., 41, 177, 10.1007/BF01390212 Noutsos, 1993, Optimal stretched parameters for the SOR iterative method, J. Comp. Appl. Maths, 48, 293, 10.1016/0377-0427(93)90026-8 Pierce, 1990, Optimality relationships forp-cyclic SOR, Numer. Math., 56, 635, 10.1007/BF01405193 Russell, 1963, On Obtaining Solutions to Navier-Stokes Equations with Automatic Digital Computers, Aeronautical Research Council Report R & M 3331 Engineering Laboratory Salmon, 1934 Varga, 1959, p-cyclic matrices a generalization of the Young-Frankel successive overrelaxation scheme, Pacific J. Math., 9, 617, 10.2140/pjm.1959.9.617 Varga, 1962 Wild, 1987, Over- and underrelaxation for linear systems with weakly cyclic Jacobi matrices of index p, Linear Algebra Appl., 91, 29, 10.1016/0024-3795(87)90058-9 Wrigley, 1963, On accelerating the Jacobi Method for solving simultaneous equations by Chebyshev extrapolation when the eigenvalues of the iteration matrix are complex, The Comp. J., 6, 169, 10.1093/comjnl/6.2.169 Young, 1954, Iterative methods for solving partial differential equations of elliptic type, Trans. Amer. Math. Soc., 76, 92, 10.1090/S0002-9947-1954-0059635-7 Young, 1971 Young, 1970, On the Determination of the Optimum Relaxation Factor for the SOR Method When the Eigenvalues of the Jacobi Matrix are Complex