A FAST MEMORY EFFICIENT CONSTRUCTION ALGORITHM FOR HIERARCHICALLY SEMI-SEPARABLE REPRESENTATIONS.
Saved in:
| 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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 114724973 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A FAST MEMORY EFFICIENT CONSTRUCTION ALGORITHM FOR HIERARCHICALLY SEMI-SEPARABLE REPRESENTATIONS. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22LESSEL%2C+K%2E%22">LESSEL, K.</searchLink><relatesTo>1</relatesTo><i> klessel@engineering.ucsb.edu</i><br /><searchLink fieldCode="AR" term="%22HARTMAN%2C+M%2E%22">HARTMAN, M.</searchLink><relatesTo>1</relatesTo><i> mhartman@umail.ucsb.edu</i><br /><searchLink fieldCode="AR" term="%22CHANDRASEKARAN%2C+S%2E%22">CHANDRASEKARAN, S.</searchLink><relatesTo>1</relatesTo><i> shiv@ece.ucsb.edu</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22SIAM+Journal+on+Matrix+Analysis+%26+Applications%22">SIAM Journal on Matrix Analysis & Applications</searchLink>. 2016, Vol. 37 Issue 1, p338-353. 16p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Semiseparable+matrices%22">Semiseparable matrices</searchLink><br /><searchLink fieldCode="DE" term="%22Peak+load+pricing+%28Public+utilities%29%22">Peak load pricing (Public utilities)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+memory+management%22">Computer memory management</searchLink><br /><searchLink fieldCode="DE" term="%22Matrix+exponential%22">Matrix exponential</searchLink><br /><searchLink fieldCode="DE" term="%22Operator+equations+%28Quantum+mechanics%29%22">Operator equations (Quantum mechanics)</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+models%22">Mathematical models</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=114724973 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1137/15M1028467 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 16 StartPage: 338 Subjects: – SubjectFull: Semiseparable matrices Type: general – SubjectFull: Peak load pricing (Public utilities) Type: general – SubjectFull: Computer memory management Type: general – SubjectFull: Matrix exponential Type: general – SubjectFull: Operator equations (Quantum mechanics) Type: general – SubjectFull: Mathematical models Type: general Titles: – TitleFull: A FAST MEMORY EFFICIENT CONSTRUCTION ALGORITHM FOR HIERARCHICALLY SEMI-SEPARABLE REPRESENTATIONS. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: LESSEL, K. – PersonEntity: Name: NameFull: HARTMAN, M. – PersonEntity: Name: NameFull: CHANDRASEKARAN, S. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: 2016 Type: published Y: 2016 Identifiers: – Type: issn-print Value: 08954798 Numbering: – Type: volume Value: 37 – Type: issue Value: 1 Titles: – TitleFull: SIAM Journal on Matrix Analysis & Applications Type: main |
| ResultId | 1 |
