Invention Grant
US08938484B2 Maintaining dependencies among supernodes during repeated matrix factorizations
有权
在重复矩阵分解中维持超节点之间的依赖关系
- Patent Title: Maintaining dependencies among supernodes during repeated matrix factorizations
- Patent Title (中): 在重复矩阵分解中维持超节点之间的依赖关系
-
Application No.: US13487048Application Date: 2012-06-01
-
Publication No.: US08938484B2Publication Date: 2015-01-20
- Inventor: Philip M. Starhill
- Applicant: Philip M. Starhill
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Patterson & Sheridan, LLP
- Main IPC: G06F7/32
- IPC: G06F7/32

Abstract:
Advantageously, embodiments of the invention provide techniques for determining dependency relationships between matrix supernodes by storing a list of dependencies for each supernode in a data structure and augmenting this list as needed when a column is moved from one supernode to another while factorizing a series Ai of symmetric matrices. As iterating over all supernodes to determine which supernodes a given supernode depends on at the beginning of each factorization adds significant overhead to the computation, embodiments described above maintains a supernode dependency data structure used for each successive factorization, greatly reducing the overhead of the dependency determination.
Public/Granted literature
- US20130325917A1 MAINTAINING DEPENDENCIES AMONG SUPERNODES DURING REPEATED MATRIX FACTORIZATIONS Public/Granted day:2013-12-05
Information query