Numerical performance of matrix inversion with block pivoting
By: by Gerald G. Brown
Contributors: Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1975
Place of publication: Monterey, California
Language: eng
Number of pages: 21
Subjects: Linear programming; Programming (Mathematics)
Description: An experiment with matrix inversion using block pivots is presented. Large scale matrix computations can often be performed more efficiently by use of partitioning. Such matrix manipulation lends itself to paged or cache memory systems since computation is staged to be completely performed in local blocks of controllable size. On other systems retrieval overhead can be balanced with computation for 'in-memory/out-of-memory' applications. Parallelism in such schema leads to efficient utilization of some multiple processor environments. Timing results indicate, however, that choice of block size should not necessarily be dictated by hardware page size for most efficient operation and that classical methods of estimating computation times are not always adequate.
Notes: Title from cover.

"Prepared for: Naval Postgraduate School"--Cover.

"August 1975"--Cover.

"NPS-55ZR75081"--Cover.

DTIC Identifiers: Matrix inversion, computer storage management, paging.

Author(s) key words: Large scale mathematical programming, large scale linear programming, factorization methods in optimization, paged memory arithmetic, page processing, virtual memory systems, matrix storage allocation, numerical algorithm performance.

Includes bibliographical references (p. 15-17).

"Approved for public release; distribution unlimited"--Cover.

Technical report; 1975.

kmc/kmc 9/30/09.