PATENT CLAIM ANALYSIS

Application Number: 15927452
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2018-09
Patent Classification: ["345", "174000"]

Abstract:
A computer system and method are proposed for solving physical problems governed by Poisson or Helmholtz equations. Values of at least one unknown physical quantity at points are determined using known values of at least one second physical quantity. The points are clustered into a hierarchical skeleton structure using a clustering algorithm based on distances between the points. Interactions between distant clusters are approximated, to give a system of equations which can be solved more efficiently.

Claim (Index 9):
A computer system for determining, for each of a plurality of discretization points in a space, at least one corresponding boundary element degree of freedom which is the unknown value of at least one respective first physical quantity at the discretization point, using the known values of at least one respective second physical quantity at the discretization point, the number of first physical quantities being no higher than the number of second physical quantities,\n the at least one second physical quantity at each discretization point being a linear function of the values of the at least one first physical quantity at the discretization points, the linear function being expressed via an interaction matrix A having elements which correspond to respective pairs of the discretization points, each element of the interaction matrix A encoding, for the corresponding pair of the discretization points, physical relations between the first and respective second physical quantities at that pair of discretization points, the physical relations being according to a Poisson or Helmholtz equation, the computer system comprising a processor and a data storage device storing program instructions operative by the processor to cause the processor to perform said determination by the steps of: (a) repeatedly applying a classification algorithm to classify the discretization points into a hierarchical tree structure having a plurality L+1 of levels, labelled by an integer index I=0, . . . , L, where level l=0 of the tree structure is the root of the tree and includes all the discretization points; level l=1 of the tree structure is composed of non-overlapping clusters of the discretization points; and for l=2, . . . , L, level l of the tree structure is composed of, for each cluster of the (l\u22121)-th level, a respective plurality of non-overlapping clusters of the discretization points of that cluster of the (l\u22121)-th level; (b) using the hierarchical tree structure to form a compressed interaction matrix which is expressed recursively according to the levels; and (c) determining the at least one first physical quantity from the known values of the respective at least one second physical quantity and the compressed interaction matrix.

Metadata:
- Claim Count in Document: 38.0
- Percentile: 90.0
- Lexical Diversity: 1.39655
- Patent Class: 345.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: True
- Related Applications: ['11731008', '10474508', '15002312', '14691044', '11393875']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5588811048514216
- 35 USC 102 Novelty (BERT): 0.4868399262934337
- Combined Prediction Score: 0.5516769869956228
- Mean Citation Score: 152.570298
- Max Citation Score: 156.30545
- Similarity Product: 105.620391964674

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

Dataset: test