Numerical performance of matrix inversion with block pivoting
Loading...
Authors
Brown, Gerald G.
Subjects
Large Scale Mathematical Programming
Page Processing
Large Scale Linear Programming
Virtual Memory Systems
Factorization Methods in Optimization
Matrix Storage Allocation
Paged Memory Arithmetic
Numerical Algorithm Performance
Page Processing
Large Scale Linear Programming
Virtual Memory Systems
Factorization Methods in Optimization
Matrix Storage Allocation
Paged Memory Arithmetic
Numerical Algorithm Performance
Advisors
Date of Issue
1975-08
Date
1975-08
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
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
Type
Technical Report
Description
Series/Report No
Department
Identifiers
NPS Report Number
NPS55Zr75081
Sponsors
sponsored by a grant from the Research
Foundation, Naval Postgraduate School
Funder
N0001475WR50001
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.