Finite splitting algorithm for the j-symmetric generalized eigenvalue problem
β Scribed by M.S. Sagitov
- Publisher
- Elsevier Science
- Year
- 1990
- Weight
- 532 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The implicit QR algorithm is a serial iterative algorithm for determining all the eigenvalues of an \(n \times n\) symmetric tridiagonal matrix \(A\). About \(3 n\) iterations, each requiring the serial application of about \(n\) similarity planar transformations, are required to reduce \(A\) to dia
## Abstract The behaviour of the multigrid method is studied by solving some simple test problems. Optimum choices for some of the parameters are discussed, together with effective techniques for solving the coarse mesh correction equation. The effects of illβconditioning on the performance of the