Methods and systems for using bi-directional level sets to partition an undirected graph representing a matrix to be used in CAE
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Nov 29, 2016
Grant Date -
Nov 20, 2014
app pub date -
Aug 20, 2013
filing date -
May 14, 2013
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
An N×N matrix is generated from computerized model representing a physical domain, comprises coefficients of N simultaneous linear equations with N unknown physical quantities associated with N degrees-of-freedom of the physical domain, and is represented by an undirected graph having N vertices connected by a plurality of edges. A best suitable partition scheme for dividing the N vertices into a separator group and, first and second mutually independent groups as follows: distance vectors of source vertices selected from the N vertices are calculated; for each distinct pair of the source vertices, the difference of respective distance vectors is used for finding a coarse graph whose adjacency coarse matrix is pentadiagonal; a trial partition scheme is determined using the coarse graph initially; the separator group is then iteratively improved by trimming vertices contained therein and merging them into one of the mutually independent groups until the separator group becomes minimal.
First Claim
Other Claims data not available
Family
International Classification(s)
- 2013 Application Filing Year
- G06T Class
- 5669 Applications Filed
- 4399 Patents Issued To-Date
- 77.60 % Issued To-Date
Cited Art Landscape
Patent Citation Ranking
- 0 Citation Count
- G06T Class
- 0 % this patent is cited more than
- 9 Age
Maintenance Fees
| Fee | Large entity fee | small entity fee | micro entity fee | due date |
|---|---|---|---|---|
| 11.5 Year Payment | $7400.00 | $3700.00 | $1850.00 | May 29, 2028 |
