An extended method for dense linear systems
β Scribed by Hiroshi Niki; Toshiyuki Kohno; Kuniyoshi Abe
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 621 KB
- Volume
- 231
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
Davey and Rosindale [K. Davey, I. Rosindale, An iterative solution scheme for systems of boundary element equations, Internat. J. Numer. Methods Engrg. 37 (1994Engrg. 37 ( ) 1399Engrg. 37 ( -1411] ] derived the GSOR method, which uses an upper triangular matrix β¦ in order to solve dense linear systems. By applying functional analysis, the authors presented an expression for the optimum β¦. Moreover, Davey and Bounds [K. Davey, S. Bounds, A generalized SOR method for dense linear systems of boundary element equations, SIAM J. Comput. 19 (1998) 953-967] also introduced further interesting results. In this note, we employ a matrix analysis approach to investigate these schemes, and derive theorems that compare these schemes with existing preconditioners for dense linear systems. We show that the convergence rate of the Gauss-Seidel method with preconditioner P G is superior to that of the GSOR method. Moreover, we define some splittings associated with the iterative schemes. Some numerical examples are reported to confirm the theoretical analysis. We show that the EGS method with preconditioner P G (Ξ³ opt ) produces an extremely small spectral radius in comparison with the other schemes considered.
π SIMILAR VOLUMES
Accurate estimation of the inductive coupling between interconnect segments of a VLSI circuit is critical to the design of high-end microprocessors. This paper presents a class of parallel iterative methods for solving the linear systems of equations that arise in the inductance extraction process.
projections pour les systèmes linéaires et non linéaires, Habilitation thesis, University of Lille1, Lille, France, 1994; H. Sadok, CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm, Numer. Algorithms 20 (1999) 303-321] is an algorithm for solving
For an arbitrary n x n matrix A and an n Γ 1 column vector b, we present a systolic algorithm to solve the dense linear equations Ax = b. An important consideration is that the pivot row can be changed during the execution of our systolic algorithm. The computational model consists of n linear systo
## Abstract We consider symmetric preconditioning strategies for the iterative solution of dense complex symmetric nonβHermitian systems arising in computational electromagnetics. In particular, we report on the numerical behaviour of the classical incomplete Cholesky factorization as well as some