A method of inexact steepest descent for systems of linear equations |
| |
Authors: | T. Altman |
| |
Affiliation: | Department of Computer Science, University of Kentucky, Lexington, KY 40506, U.S.A. |
| |
Abstract: | Our approach combines the method of inexact steepest descent with the method of contractor directions to obtain an algorithm for solving systems of linear equations. In order to enhance the scope of applicability, we consider an iterative method with variable step-size iterations. We prove the convergence and given an error estimate for our method. The algorithm is well-suited for parallel computation. In fact, for systems with m equations and n unknowns, each iteration may be computed in parallel time O(log m + log n), on an EREW PRAM with O(mn) processors. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|