A new algorithm for solving large inhomogeneous linear system of algebraic equations
β Scribed by S. Ramasesha
- Publisher
- John Wiley and Sons
- Year
- 1990
- Tongue
- English
- Weight
- 314 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
An algorithm based on a small matrix approach to the solution of a system of inhomogeneous linear algebraic equations is developed and tested in this short communication. The solution is assumed to lie in an initial subspace and the dimension of the subspace is augmented iteratively by adding the component of the correction vector obtained from the Jacobi scheme on the coefficient matrix A (A^T^A, if the matrix A is nondefinite) that is orthogonal to the subspace. If the dimension of the subspace becomes inconveniently large, the iterative scheme can be restarted. The scheme is applicable to both symmetric and nonsymmetric matrices. The small matrix is symmetric (nonsymmetric), if the coefficient matrix is symmetric (nonsymmetric). The scheme has rapid convergence even for large nonsymmetric sparse systems.
π SIMILAR VOLUMES
## Abstract A linear scaling local correlation approach is proposed for approximately solving the coupled cluster doubles (CCD) equations of large systems in a basis of orthogonal localized molecular orbitals (LMOs). By restricting double excitations from spatially close occupied LMOs into their as
A linearized algorithm for solving inverse sensitivity equations of non-defective systems is presented. It is based on the orthonormal decomposition of the first order directional derivatives and directional continuity along s of the s Γ l base. The least-squares methods which minimize the trace of