Sparse matrix solving method based on FPGA parallel acceleration
A technology of sparse matrix and lower triangular matrix, which is applied in the field of data processing, can solve the problems of wasting computing resources, low processing efficiency, and inability to perform calculations, and achieve the effect of improving processing efficiency and saving computing resources
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0036] It should be noted that, in the case of no conflict, the embodiments in the present application and the features in the embodiments can be combined with each other. It should be noted that the terminology used in the present invention is only for describing specific embodiments, and is not intended to limit the exemplary embodiments according to the present application.
[0037] Such as figure 1 As shown, a method for solving a sparse matrix based on FPGA parallel acceleration provided in Embodiment 1 of the present invention includes several processing units, including:
[0038] S101: Perform LU decomposition on the sparse matrix A to obtain the upper triangular matrix U and the lower triangular matrix L, and the solution of the sparse linear equation system Ax=b is converted into the solution of the linear equation system Ux=y and Ly=b of the upper and lower triangular matrices;
[0039] S102: Take the reciprocal of the diagonal elements of the upper triangular 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