PATENT CLAIM ANALYSIS

Application Number: 15915148
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2018-07
Patent Classification: ["708", "209000"]

Abstract:
A batched Cholesky decomposition method, system, and non-transitory computer readable medium for a Graphics Processing Unit (GPU), include mirroring a second problem matrix of a second problem to a first problem matrix of a first problem as paired matrices and shifting the second problem by N+ 1 , combining the first problem matrix and the mirrored second problem matrix into one matrix of (N+ 1 )×N, and reading the fixed size data length of the one square matrix with a fixed data interval for both the first problem and the second problem.

Claim (Index 12):
The method of  claim 1 , wherein each step of the Cholesky decomposition of the one matrix has a same number of elements.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 90.0
- Lexical Diversity: 1.98039
- Patent Class: 708.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15199772', '13690333', '14384149', '12376444', '10808554']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4340664471913451
- 35 USC 102 Novelty (BERT): 0.5143439316401018
- Combined Prediction Score: 0.4420941956362207
- Mean Citation Score: 176.244528
- Max Citation Score: 306.14398
- Similarity Product: 273.0966400168359

Labels:
- Claim Label 101: 0
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 0
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test