Organizing matrices and matrix operations for paged memory systems

DOI10.1145/362875.362879MaRDI QIDQ5563772zbMATH OpenOpenAlexFDO

Authors Archie C. McKellar, E. G. jun. Coffman

Publication date 1969

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/362875.362879

zbMATH Keywords

numerical analysis

Cited in

(11)

• Operating with potentials of discrete variables
• The input/output complexity of transitive closure
• Hypermatrix generalization of the Jacobi- and Eberlein-method for computing eigenvalues and eigenvectors of Hermitian or non-Hermitian matrices
• A blocked all-pairs shortest-paths algorithm
• The uniform memory hierarchy model of computation
• Zur Verbesserung der Lokalität im Zugriff auf Felder
• Solving large dense systems of linear equations on systems with virtual memory and with cache
• Hypermatrix solution of larg e sets of symmetric positive-definite linear equations
• Storing matrices on disk for efficient row and column retrieval
• QR-factorization of partitioned matrices. Solution of large systems of linear equations with non-definite coefficient matrices
• On the paging-complexity of periodic arrangements

This page was built for publication: Organizing matrices and matrix operations for paged memory systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5563772)