JPH08194685A - Node information retrieving device for finite element method - Google Patents

Abstract

PURPOSE: To shorten the time for retrieval to provide information accompanied with nodes consisting of an element from an element table and a node table. CONSTITUTION: An element table 221 stores the node numbers of nodes consisting of the elements equipped with element numbers corresponding to the element numbers. A node table 222 stores the coordinate values of nodes corresponding to the node numbers. A node number correspondence table preparing part 211 possesses the node number and the storage address of that node number from the node table 222 and stores it at the position corresponding to the node number in a node number correspondence table 223. A node number exchanging part 212 possesses the node numbers of nodes consisting of the element from the element table 221, possesses a storage address corresponding to those node numbers from the node number correspondence table 223 and stores that storage address in the position corresponding to the node numbers in the element table 221. A node information retrieving part 213 possesses the storage address of nodes consisting of the element of a retrieving object from the element table 221 after node number exchange and possesses the coordinate values of the nodes from the node table 222 while using the storage address.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a node information retrieval device for retrieving information associated with a node in the finite element method.

[0002]

2. Description of the Related Art In the finite element method, processing is performed by dividing an analysis target area into a plurality of elements. Each element is composed of a plurality of (for example, three) nodes.

FIG. 8 is a diagram showing an example in which the analysis target area is divided into five elements. In the example shown in FIG. 8, the analysis target area is divided into five triangular elements having element numbers 5, 7, 12, 26 and 31. Further, for example, the element having the element number 5 (hereinafter, simply element 5) is composed of the node having the node number 5 (hereinafter, simply node 5), the node 7, and the node 4, and the element 7 is composed of the nodes 9, 5, and 11. It is configured.

FIG. 9 is a diagram showing an element table 90 showing the relationship between the elements shown in FIG. 8 and the nodes forming the elements. The element table 90 includes an "element number" field and a "node number" field. The element number is stored in the “element number” field of the element table 90,
In the "node number" field, the node number of the node forming the element having the element number is stored corresponding to the element number. For example, the data stored in the storage address 1 of the table 90 indicates that the element 12 is composed of the nodes 5, 9, and 4.

Information associated with a node, such as the coordinate value of the node, is stored in the node table 100 as shown in FIG. 10 corresponding to the node number. For example, in the data stored in the storage address 1 of the table 100, the coordinate value of the node 11 is (x, y, z) = (11, 17,
4), and the data stored in the storage address 5 has a coordinate value of the node 5 of (12, 9,
4).

When performing the analysis processing in the finite element method, it may be necessary for each element to have information associated with the node forming the element, for example, the coordinate value of the node. In this case, in order to obtain the information, the element table 90 is first referred to for each element, and the node number forming the element is obtained. Then, the node table 100 is sequentially searched for the node number to obtain the coordinate value of the node of the node number.

[0007]

However, in the above-mentioned conventional method, in order to obtain the node information, the node table 10 is obtained for each node constituting each element.
There is a problem in that it is necessary to sequentially search for 0, and it takes time to search.

For example, when obtaining the coordinate values of the nodes forming the element 5 in FIG. 8, first, the element table 90 in FIG. 9 is searched to obtain the node numbers 7, 5 and 4 of the nodes forming the element 5. Then, the node table 100 of FIG. 10 is searched for each node thus obtained. Regarding the node 7, if the value of the "node number" field of the node table 100 matches 7, the storage address 1 of the node table 100
Search sequentially from. Then, in the sixth comparison judgment as to whether or not they match, the value of the “node number” field matches 7, and
The coordinate values (4, 5, 2) of the node 7 are obtained. That is,
In the case of the node 7, it is necessary to perform six coincidence comparison determinations to obtain the coordinate value. Similarly, in the case of the node 5, the coincidence comparison judgment is required five times, and in the case of the node 4, the coincidence comparison judgment is required three times. As described above, a lot of processing is required to obtain the node information, and the search time is long.

An object of the present invention is to provide a node information search device which can easily search for a node and shorten the search time for obtaining information associated with the node.

[0010]

According to the first aspect of the present invention,
As shown in FIG. 1, the following means are provided. The node information storage means 1 stores the node information associated with the node corresponding to the node number.

The node number correspondence information creation means 2 acquires the node number and the storage position information of the node number from the node information storage means 1, and stores the storage position information in the node number correspondence information storage means 3. Store in the position corresponding to.

The node number correspondence information storage means 3 stores the storage position information of the node number in the node information storage means 1 corresponding to the node number. The first element information storage unit 4 stores the node number of the node that constitutes the element having the element number, corresponding to the element number.

The node number reassigning means 5 acquires the node numbers of the nodes forming the element from the first element information storing means 4, and stores the storage position information corresponding to the node numbers in the node number corresponding information storing means 3 And stores the storage position information in the position corresponding to the node number of the second element information storage means 6.

The second element information storage means 6 stores the storage position information of the nodes forming the element having the element number corresponding to the element number. The node information search means 7 acquires the storage position information of the nodes forming the element to be searched from the second element information storage means 6, and uses the storage position information to store the node information from the node information storage means 1. To get.

The node number reassigning means 4 does not store the storage location information in the second element information storing means 6,
The contents of the first element information storage means may be rewritten.

[0016]

The second element information storage means 6 stores the storage position information in the node information storage means 1 as information corresponding to the nodes forming each element. Therefore, the node information search means 7 can obtain the storage position information of the node information to be searched in the node information storage means 1 by referring to the second element information storage means 6, and use the information. The node information corresponding to the target node can be immediately obtained from the node information storage unit 1.

[0017]

Embodiments of the present invention will now be described in detail with reference to the drawings. FIG. 2 is a system configuration diagram showing an embodiment of a node information retrieval device in the finite element method according to the present invention.

As shown in FIG. 2, this embodiment has a CPU.
(Control arithmetic unit) 20, a memory device 21, a magnetic storage device 22, an input / output device 23, and a printing device 24.

The CPU 20 controls the entire device by executing various programs loaded in the memory device 21. The magnetic storage device 22 has an element table 221.
Various files such as a node table 222 and a node number correspondence table 223 described later are stored. I / O device 23
Performs various data input, device operation instruction, output of processing results, and the like. Further, the printing device 24 outputs the processing result of the device to paper or the like.

The memory device 21 comprises a node number correspondence table creation unit 211, a node number reassignment unit 212, and a node information retrieval unit 213. The node number correspondence table creation unit 211 performs processing for creating the node number correspondence table 223 from the node table 222. The node number reassigning unit 212 uses the node number correspondence table 223 to
A process of reassigning the node number in the element table 221 to the internal node number is performed. The node information search unit 213 uses the element table 221 reassigned to the internal node number to search for information associated with the node.

The operation of the embodiment having the above-described structure will be described below with reference to FIGS.
Description will be made based on the flowchart of FIG. 6 and the specific examples shown in FIGS. In the following description of the flow charts, S1, S2, ... Denote processing procedure (step) numbers.

In the apparatus of this embodiment, first, the node table 1
On the basis of 00, the node number correspondence table 30 as shown in FIG. 3 is created. The node number correspondence table 30 is a table that stores the storage addresses of the node numbers in the node table 100 in correspondence with the node numbers. The storage address in the node table is called the internal node number of the corresponding node.

FIG. 4 is a flow chart for explaining the process of creating the node number correspondence table. The creation process is CP
This is performed by the U 20 executing the node number correspondence table creation unit 211 in the memory device 21.

When the process of creating the node number correspondence table is started, the CPU 20 first initializes the storage address i in the node table 222 to 1 (S1). Next, the node number n of the storage address i is obtained from the node table 222 (S2). In the specific example, first, the node number 11 stored at the storage address 1 is obtained from the node table 100 shown in FIG.

Next, the storage address i of the node table 222 is stored in the position corresponding to the node number n in the node number correspondence table 223 (S3). That is, in the specific example, the storage address 1 is stored in the position corresponding to the node number 11 in the node number correspondence table 30.

Next, the storage address i of the node table 222 is incremented by 1 (S4), and it is determined whether or not the storage address i exceeds the final storage address N of the node table 222 (S5). If the storage address i is equal to or less than the final storage address N as a result of the determination (S5, NO), the processes of steps S2 to S5 are repeated. That is, in the specific example, the above processing is performed on the storage addresses 2 to 6 of the node table 100.

If it is determined in step S5 that the storage address exceeds the final storage address N (S5, YES), it means that the processing has been completed for all the nodes, so the node number correspondence The table creation process ends.

Through the above processing, the node number correspondence table 30 as shown in FIG. 3 is created. As shown in FIG. 3, for example, at the position corresponding to the node number 9 in the node number correspondence table 30, the node 9 in the node table 100 is located.
The storage address of 2 is stored. Also, node 5,
Since the storage addresses of 11 in the node table 100 are 5 and 1, respectively, 5 and 1 are stored in the positions corresponding to the node numbers 5 and 11 in the node number correspondence table 30, respectively.

Next, the node number correspondence table 30 created as described above is used to perform a process of replacing the node number of the element table 90 with the internal node number. That is, the node number correspondence table 30 is referred to on the basis of the node numbers forming the respective elements, and the internal node numbers corresponding to the node numbers are obtained. Then, the obtained internal node number is stored in the element table 90 at the position where the node number is read.

FIG. 5 is a flow chart for explaining the internal node number reassigning process. The replacement processing is performed by the CPU
20 by executing the node number reassigning unit 212 in the memory device 21.

When the internal node number reassignment process is started,
The CPU 20 first initializes the storage address j of the element table 221 to 1 (S10). Next, the element node number d for selecting one of the plurality of nodes forming each element is initialized to 1 (S11). Then, the node number n specified by the storage address j and the element node number d is obtained from the element table 221 (S12). In the specific example, first, the node number 5 designated by the storage address 1 and the element node number 1 is obtained from the element table 90 shown in FIG.

Next, the internal node number m stored in the position corresponding to the node number n in the node number correspondence table 223 is obtained (S13). That is, in the specific example, the internal node number 5 stored in the position corresponding to the node number 5 is obtained from the node number correspondence table 30.

Next, the internal node number m is stored at the position designated by the storage address j and the element node number d of the element table 221 (S14). That is, in the specific example,
Storage address 1 of element table 90 and element node number 1
The internal node number 5 is stored in the position designated by.

Next, the element node number d is incremented by 1 (S1
5) It is determined whether or not the element node number d exceeds the total number D of nodes forming the element (S16). As a result of the discrimination, if the element node number d is less than or equal to the total number D of the nodes forming the element (S16, NO), the above steps S12 to S
Repeat 16 That is, in the specific example, the above processing is performed for the node 9 (element node number 2) and the node 4 (element node number 3) stored at the storage address 1 of the element table 90.

If it is determined in step S16 that the element node number d exceeds the total number of nodes D (S
16, YES), and the storage address j is incremented by 1 (S1
7) It is determined whether the storage address j exceeds the final storage address E of the element table 90 (S18).
As a result of the determination, when the storage address j is equal to or less than the final storage address E (S18, NO), the above step S11 is performed.
~ S18 is repeated. That is, in the specific example, the above processing is performed on the storage addresses 2 to 5 of the element table 90.

If it is determined in step S18 that the storage address j exceeds the final storage address E (S18, YES), it means that the processing for all the elements has been completed, so the internal node number reassignment is performed. The process ends.

By the above processing, as shown in FIG.
The element table 70 in which the node numbers are replaced with the internal node numbers is obtained. Next, a description will be given of a process of searching coordinate value information when each item requires information associated with a node forming the element, for example, coordinate values of the node. The search processing refers to the "node number" field of the element table 70 that has been reassigned to the internal node number,
After obtaining the internal node number, the coordinate value is obtained by referring to the node table 100 using the internal node number as a reference address.

FIG. 6 is a flow chart for explaining a node information search process. The search processing is performed by the CPU 20 executing the node information search unit 212 in the memory device 21.

When the node information retrieval process is started, the CPU
20 first initializes the storage address j of the element table 221 reassigned to the internal node number to 1 (S2).
0). Next, the element node number d for selecting one of the plurality of nodes forming each element is initialized to 1 (S21).
Then, the element table 2 reassigned to the internal node number
The internal node number n'specified by the storage address j and the element node number d is acquired from 21 (S22). In the specific example, first, from the element table 70 shown in FIG. 7, the internal node number 5 designated by the storage address 1 and the element node number 1 is set.
Get.

The internal node number n'obtained in this way is
Since it is the storage address of the node table 222, it can be used as a reference address when reading the node information from the node table 222. Therefore, the coordinate value of the node specified by the storage address j and the element node number d is obtained by referring to the node table 222 using the node number n'as the reference address of the node table 222 (S23). That is, in the specific example, since the internal node number is 5, by referring to the storage address 5 of the node table 100,
The coordinate value (12, 9, 4) is obtained.

Next, the element node number d is incremented by 1 (S2
4), the element node number d is the total number of nodes D that constitute the element
It is determined whether or not it exceeds (S25). As a result of the discrimination, when the element node number d is less than or equal to the total number of nodes D (S25, NO), the above steps S22 to S25 are repeated. That is, in the specific example, the above processing is performed on the node with the internal node number 2 (element node number 2) and the node with the internal node number 3 (element node number 3) stored in the storage address 1 of the element table 70. .

When it is determined in step S25 that the element node number d exceeds the total number of nodes D (S)
25, YES), and the storage address j is incremented by 1 (S2
6) It is determined whether the storage address j exceeds the final storage address E (S27). As a result of the determination, when the storage address j is equal to or less than the final storage address E (S
27, NO), and the above steps S21 to S27 are repeated. That is, in the specific example, the above processing is performed on the storage addresses 2 to 5 of the element table 70.

If it is determined in step S27 that the storage address j exceeds the final storage address E (S27, YES), it means that the processing for all the elements has ended, so the search processing ends. To do.

By the above processing, the coordinate values of the nodes forming each element can be obtained. In the present embodiment, by using the element table 70 rewritten with the internal node number, the coordinate values can be obtained without sequentially searching the node table 100, so that the search time can be shortened.

Although the original element table is rewritten in the above embodiment, another element table may be created for retrieval only without rewriting the original element table.

[0046]

As described above in detail, according to the present invention, it is possible to obtain the information added to the nodes constituting the element without sequentially searching the node table. Information retrieval processing time can be shortened.

[Brief description of drawings]

FIG. 1 is a diagram illustrating the principle of the present invention.

FIG. 2 is a diagram showing a system configuration of a node information search device of the present invention.

FIG. 3 is a configuration diagram of a node number correspondence table.

FIG. 4 is a flowchart illustrating a procedure for creating a node number correspondence table.

FIG. 5 is a flowchart illustrating a procedure for reassigning a node number.

FIG. 6 is a flowchart illustrating a node information search processing procedure.

FIG. 7 is a diagram showing an example of an element table reassigned to an internal node number.

FIG. 8 is a diagram showing an example of element division of an analysis target area.

FIG. 9 is a diagram showing an example of an element table.

FIG. 10 is a diagram showing an example of a node table.

[Explanation of symbols]

 1 Nodal Information Storage Means 2 Nodal Number Corresponding Information Creating Means 3 Nodal Number Corresponding Information Storage Means 4 First Element Information Storage Means 5 Nodal Number Reassigning Means 6 Second Element Information Storage Means 7 Nodal Information Retrieval Means

Claims (3)

[Claims] 1. A node information storage unit for storing node information corresponding to a node number, a node number and a storage position information of the node number are acquired from the node information storage unit, and the storage position information is stored as the node number. Node number correspondence information creating means for storing the correspondence number in a position corresponding to the node number in the correspondence information storing means, and first element information storing means for storing the node numbers of the nodes constituting the element corresponding to the element numbers, A node number is obtained from the first element information storage means, the storage position information corresponding to the node number is obtained from the node number correspondence information storage means, and the storage position information is obtained from the second element information storage means. Nodal number reassigning means for storing at a position corresponding to the nodal number, the storage position information is obtained from the second element information storage means, and the storage position information is used to obtain the nodal information from the nodal information storage means. A node information search device in the finite element method, comprising: a node information search means to be obtained. 2. The node information search device according to claim 1, wherein the first element information storage means and the second element information storage means are the same. 3. A node information storage means for storing node information corresponding to a node number, and a storage position information in the node information storage means for a node number of a node constituting an element corresponding to an element number. Element information storage means, acquiring the storage location information from the element information storage means,
A nodal information search device in the finite element method, comprising nodal information searching means for obtaining nodal information from the nodal information storing means using the storage position information.