Invention Grant
- Patent Title: Sparse and efficient block factorization for interaction data
- Patent Title (中): 交互数据的稀疏和有效的块分解
-
Application No.: US10619796Application Date: 2003-07-15
-
Publication No.: US07734448B2Publication Date: 2010-06-08
- Inventor: Francis X. Canning
- Applicant: Francis X. Canning
- Agency: Knobbe, Martens, Olson & Bear, LLP
- Main IPC: G06F17/10
- IPC: G06F17/10

Abstract:
A compression technique compresses interaction data. The interaction data can include a matrix of interaction data used in solving an integral equation. For example, such a matrix of interaction data occurs in the moment method for solving problems in electromagnetics. The interaction data describes the interaction between a source and a tester. In one embodiment, a fast method provides a direct solution to a matrix equation using the compressed matrix. A factored form of this matrix, similar to the LU factorization, is found by operating on blocks or sub-matrices of this compressed matrix. These operations can be performed by existing machine-specific routines, such as optimized BLAS routines, allowing a computer to execute a reduced number of operations at a high speed per operation. This provides a greatly increased throughput, with reduced memory requirements.
Public/Granted literature
- US20040078174A1 Sparse and efficient block factorization for interaction data Public/Granted day:2004-04-22
Information query