Shifter implemented circulant permutation matrix operations
US-2024386072-A1 · Nov 21, 2024 · US
US2023342417A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2023342417-A1 |
| Application number | US-202318216926-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jun 30, 2023 |
| Priority date | Jun 30, 2016 |
| Publication date | Oct 26, 2023 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A batched Cholesky decomposition method, system, and non-transitory computer readable medium for a Graphics Processing Unit (GPU), include mirroring matrices to form paired matrices solving the paired matrices simultaneously.
Opening claim text (preview).
What is claimed is: 1 . A non-transitory computer-readable recording medium recording a program for a Graphics Processing Unit (GPU), the program causing a computer to perform: utilizing a combined matrix to accelerate batched dense Cholesky decomposition on the GPU, the combined matrix including: a global memory; a shared first memory for a first problem of the combined matrix which has regular intervals; and a shared second memory for a second problem of the combined matrix which is continuous. 2 . A batched Cholesky decomposition method for a Graphics Processing Unit (GPU), the method comprising: utilizing a combined matrix to accelerate batched dense Cholesky decomposition on the GPU, the combined matrix including: a global memory; a shared first memory for a first problem of the combined matrix which has regular intervals; and a shared second memory for a second problem of the combined matrix which is continuous. 3 . A batched Cholesky decomposition system on a Graphics Processing Unit (GPU), said system comprising: a processor; and a memory, the memory storing instructions to cause the processor to: utilizing a combined matrix to accelerate batched dense Cholesky decomposition on the GPU, the combined matrix including: a global memory; a shared first memory for a first problem of the combined matrix which has regular intervals; and a shared second memory for a second problem of the combined matrix which is continuous.
Matrix or vector computation {, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization (matrix transposition G06F7/78)} · CPC title
having at least two separately controlled shifting levels, e.g. using shifting matrices (G06F5/012 takes precedence) · CPC title
Simultaneous equations {, e.g. systems of linear equations} · CPC title
Processor architectures; Processor configuration, e.g. pipelining · CPC title
Memory management · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.