Block relaxation strategies
It is desired to solve the linear system Ax = b, where the matrix A is n x n block tridiagonal with block size m. This system is to be solved by block line relaxation when the largest block problem with block size m that can be cheaply solved directly is l x l. Iteration steps, strategies, and results are summarized. It is concluded that the convergence rate of some block relaxation strategies is much faster than that of the strategies generally used. (RWR)
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 5241914
- Report Number(s):
- LA-UR-80-2342; CONF-800699-2
- Resource Relation:
- Conference: Elliptic problem solvers conference, Santa Fe, NM, USA, 30 Jun 1980
- Country of Publication:
- United States
- Language:
- English
Similar Records
Analysis of the recursive doubling algorithm
Algorithms for sparse matrix eigenvalue problems. [DBLKLN, block Lanczos algorithm with local reorthogonalization strategy]
Some strategies for enhancing the performance of the block Lanczos method
Technical Report
·
Wed Dec 01 00:00:00 EST 1976
·
OSTI ID:5241914
Algorithms for sparse matrix eigenvalue problems. [DBLKLN, block Lanczos algorithm with local reorthogonalization strategy]
Technical Report
·
Tue Mar 01 00:00:00 EST 1977
·
OSTI ID:5241914
Some strategies for enhancing the performance of the block Lanczos method
Conference
·
Fri Jan 01 00:00:00 EST 1988
·
OSTI ID:5241914
+1 more