Bibliographic Details
| Title: |
A FAST MEMORY EFFICIENT CONSTRUCTION ALGORITHM FOR HIERARCHICALLY SEMI-SEPARABLE REPRESENTATIONS. |
| Authors: |
LESSEL, K.1 klessel@engineering.ucsb.edu, HARTMAN, M.1 mhartman@umail.ucsb.edu, CHANDRASEKARAN, S.1 shiv@ece.ucsb.edu |
| Source: |
SIAM Journal on Matrix Analysis & Applications. 2016, Vol. 37 Issue 1, p338-353. 16p. |
| Subjects: |
Semiseparable matrices, Peak load pricing (Public utilities), Computer memory management, Matrix exponential, Operator equations (Quantum mechanics), Mathematical models |
| Abstract: |
Existing hierarchically semi-separable construction algorithms for dense n × n matrices require as much as O(n2) peak workspace memory, at a cost of O(n2) flops. An algorithm is presented which requires O(n1.5) peak worskpace memory in the worst case, while still requiring only O(n2) flops. [ABSTRACT FROM AUTHOR] |
|
Copyright of SIAM Journal on Matrix Analysis & Applications is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
