A Heterogeneous Parallel Computing Method for Row Update of Sparse Matrix Lu Decomposition
A sparse matrix and parallel computing technology, applied in the field of sparse matrix LU decomposition, can solve problems such as low efficiency and low operating efficiency, and achieve the effect of improving overall efficiency, avoiding conflicts and dependencies, and increasing computational overhead.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0042] A heterogeneous parallel computing method for sparse matrix LU decomposition row update, including a master core part and a slave core part; such as figure 2 As shown, the specific implementation of the row update main core part is as follows:
[0043] A1) In the row update phase, obtain the row matrix block currently to be processed, analyze each column vector of the row matrix block, count the starting position of each vector in the memory and the size of the vector, and generate an index array; the vector is in The starting position in the memory corresponds to the storage location of the non-zero metadata of the column vector, and the size of the vector corresponds to the number of non-zero metadata of the column vector; the index number of the index array corresponds to the column vector of the row matrix block; A column vector, index number 2 corresponds to the second column vector, and so on;
[0044] The purpose of analyzing each column vector of the row matri...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com