Website Search
Find information on spaces, staff, and services.
Find information on spaces, staff, and services.
This report discusses results obtained from a general purpose computer code for solving thin wire moments problems in which a banded matrix iterative solution technique has been substituted in the ...
This report discusses results obtained from a general purpose computer code for solving thin wire moments problems in which a banded matrix iterative solution technique has been substituted in the place of Gaussian elimination. Results are reported for comparison to previous reports and to solutions in the literature, including a disk, washer, sphere, hemisphere, and toroid. The effect of varied wire radius, sigment lengths, and mesh size are studied. The remaining economic barrier to solving large problems is the cost of computing matrix elements. A brief study of the use of approximate matrix elements is included. Two possibilities are discussed for automating the segment numbering to minimize the bandwidth in the solution algorithm. (Author).