Abstract: A computer-implemented method for simulating a flow of fluid around a solid object comprises: defining straight lines between gravity points of elements in a solid object region and gravity points of elements in a fluid region; defining intersecting points of the straight lines with a boundary surface between the two regions; calculating distances between the intersecting points and the gravity points in the fluid region; and obtaining the shearing stress at the boundary surface.

Abstract: A computerized method for simulating a high-viscosity fluid in a chamber is disclosed, wherein a model of the fluid is set in a model of the chamber and a flow calculation is performed. In the flow calculation, with respect to a contact surface of a wall of the chamber model with which the fluid model contacts, a slip velocity of the fluid model is defined by specific equations.

Abstract: A three-dimensional fluid simulation method is disclosed wherein: a first mesh of a flow domain non-uniformly split with respect to each of three degrees of freedom is defined; a second mesh uniformly sprit with respect to only one of the three degrees of freedom but non-uniformly with respect to other two degrees is defined; an object model is set in the first mesh and a motion equation is formed and calculated to obtain fluid velocity; based on the fluid velocity, flow imbalance is computed for each cell; based on the flow imbalance, fluid pressure correction equation is formed; the flow imbalance is mapped onto the second mesh and the fluid pressure correction is computed; the fluid pressure correction is mapped onto the first mesh; and until the flow imbalance and motion equations are converged the computation is repeated.

Abstract: A method for defining a fluid/solid boundary for computational fluid dynamics simulations making use of a coordinate system mesh and a solid object model, which includes the steps of defining straight lines on which all of the grid points of the coordinate system mesh are positioned; obtaining intersecting points of the straight lines with the surface of the solid object model; and a step in which, for each of the straight lines having the intersecting points, the grid points on the straight line are searched for the nearest point to each of the intersecting points, and based on the searched-out nearest points, the positioned grid points are determined as to whether the grid point is positioned inside the solid object model or in the fluid region.

Abstract: A simulation method utilizing a Cartesian grid comprises: a process in which a model of a two or three-dimensional space is defined as a Cartesian grid composed of cells; a process in which, based on a physical value and condition associated with the Cartesian grid, a Poisson equation is defined; and a process in which, the physical value is calculated by approximately solving the Poisson equation. The calculating process comprises: a step of calculating an error by using a Block-Cyclic Reduction Algorithm; a step of testing whether the calculated error is within a predetermined acceptable range or not; and a step of correcting a variable ? by the use of a correction parameter if the calculated error is outside the predetermined acceptable range. The calculating process repeats the error calculating step, testing step and error correcting step until the error becomes within the predetermined acceptable range.

Abstract: A method for estimating the vulcanization degree of a rubber compound is disclosed. The torque of the rubber compound during vulcanization is measured to obtain a vulcanization curve. Values of invariables K1, K2 and m of a specific expression (1) which values minimize the error between the measured vulcanization curve and a (estimated cure) curve defined by the expression (1), are obtained. Each of different real numbers is assigned to the invariable K1 of the expression (1), and the expression (1) is approximated to the measured vulcanization curve, and then from the approximated expression (1), a set of values of the invariables K1, K2 and m are obtained. Such plural sets of the values are assigned to the expression (1) to obtain a plurality of the estimated vulcanization curves from which an estimated vulcanization curve whose error from the measured vulcanization curve is smallest, is found out.

Abstract: A computer-implemented method for simulating a flow of fluid around a solid object comprises: defining straight lines between gravity points of elements in a solid object region and gravity points of elements in a fluid region; defining intersecting points of the straight lines with a boundary surface between the two regions; calculating distances between the intersecting points and the gravity points in the fluid region; and obtaining the shearing stress at the boundary surface.

Abstract: A computerized method for simulating a high-viscosity fluid in a chamber is disclosed, wherein a model of the fluid is set in a model of the chamber and a flow calculation is performed. In the flow calculation, with respect to a contact surface of a wall of the chamber model with which the fluid model contacts, a slip velocity of the fluid model is defined by specific equations.

Abstract: A three-dimensional fluid simulation method is disclosed wherein: a first mesh of a flow domain non-uniformly split with respect to each of three degrees of freedom is defined; a second mesh uniformly sprit with respect to only one of the three degrees of freedom but non-uniformly with respect to other two degrees is defined; an object model is set in the first mesh and a motion equation is formed and calculated to obtain fluid velocity; based on the fluid velocity, flow imbalance is computed for each cell; based on the flow imbalance, fluid pressure correction equation is formed; the flow imbalance is mapped onto the second mesh and the fluid pressure correction is computed; the fluid pressure correction is mapped onto the first mesh; and until the flow imbalance and motion equations are converged the computation is repeated.

Abstract: A method of searching real numbers for a nearest neighbor to a query point includes a construction phase in which a database of the real numbers is prepared; and a search phase in which the nearest neighbor is searched by the use of the database. The database includes a series of buckets that respectively correspond to small one-dimensional spaces defined by dividing a one-dimensional space between a minimum real number and a maximum real number at regular intervals. The buckets include data about real number(s) falling in one of the small one-dimensional spaces corresponding to the bucket concerned, and the number of the real number(s). The search phase includes locating one of the buckets in which the query point falls; checking the bucket size of the located bucket whether the bucket size thereof is zero; and searching the nearest neighbor by the use of the data in the bucket.

Abstract: A simulation method utilizing a Cartesian grid comprises: a process in which a model of a two or three-dimensional space is defined as a cartesian grid composed of cells; a process in which, based on a physical value and condition associated with the Cartesian grid, a Poisson equation is defined; and a process in which, the physical value is calculated by approximately solving the Poisson equation. The calculating process comprises: a step of calculating an error by using a Block-Cyclic Reduction Algorithm; a step of testing whether the calculated error is within a predetermined acceptable range or not; and a step of correcting a variable ? by the use of a correction parameter if the calculated error is outside the predetermined acceptable range. The calculating process repeats the error calculating step, testing step and error correcting step until the error becomes within the predetermined acceptable range.

Abstract: A method of searching real numbers x[1] to x[n] for a nearest neighbor to a query point comprises: a construction phase in which a database of the real numbers is prepared; and a search phase in which the nearest neighbor is searched by the use of the database. The database comprises a series of buckets. The buckets respectively correspond to small one-dimensional spaces defined by dividing a one-dimensional space between a minimum real number x[1] and a maximum real number x[n] at regular intervals. Each of the buckets comprises data about real number(s) falling in one of the small one-dimensional spaces corresponding to the bucket concerned, and the number of the real number(s). The bucket further comprises data about the bucket index of a last filled bucket, the last filled bucket defined as a bucket whose bucket size is not zero and whose bucket index is closest to that of the concerned bucket.