{"responseHeader":{"status":0,"QTime":3,"params":{"q":"{!q.op=AND}id:\"103047\"","hl":"true","hl.simple.post":"","hl.fragsize":"5000","fq":"!embargo_tdt:[NOW TO *]","hl.fl":"ocr_t","hl.method":"unified","wt":"json","hl.simple.pre":""}},"response":{"numFound":1,"start":0,"docs":[{"file_name_t":"Yen-On_Representation.pdf","thumb_s":"/bf/22/bf225861c83b248521cb9b4a130e4e358bfacdd2.jpg","oldid_t":"compsci 11160","setname_s":"ir_computersa","restricted_i":0,"format_t":"application/pdf","modified_tdt":"2016-05-26T00:00:00Z","file_s":"/c6/d4/c6d452811d557314263be344cd28f4da56238ddd.pdf","title_t":"Page 86","ocr_t":"75 tact, the same problem specification is still valid. With similar arguments, this attribute modelling technique provides simple test runs before the user is perplexed by the daunting complexity so that the test runs may proceed from coarse mesh to finer mesh, from linear problem to nonlinear problem and from static analysis to dynamic analysis. ~r.vz::;tigated also is an algorithmic approach toward near-optimum mesh generation. It is a new algorithm which synthesizes the analysis result distribution with the domain geometry. This algorithm distinguishes itself from the traditional self-adaptive algorithms by the fact that it is not restricted to the previous mesh configuration and it does not require iteration of analyses. In [33], four iterations are required for the fourth refined mesh which could be obtained in only one synthesis process by this algorithm (Figure 39). The reason for iteration of analyses in [33] was that the results at those newly created nodal points were not available until the analysis was performed upon them. But for this algorithm, the results for those new nodal points are approximated by evaluating them on the result surface, which is valid for all the intermediate points. As shown in Figure 40, a mesh is generated for the pinched roller problem after four cycles of a self-adaptive procedure [33]. The subdivided element is refined and refined, but the refined elements are always constrained to the initial mesh (notice that the refined triangular elements are never pulled closer to the true boundary, the circular arc), and hence error may propagate along with the refinement process. However, using 8-spline subdivision method proposed here, under the same circumstance, the further an element is subdivided, the closer its mesh is pulled to the true geometry. This is because when the element geometry is subdivided, the true representation is preserved until the last moment, i.e., no precision loss occurs until the discretization process takes place. Its experimental implementation is a semiautomatic, self-adaptive mesh generator that links a geometric modeller to the finite element analysis code. The result is fed back to the geometric modeller for mesh improvement, and thus forms an engineering cycle. This algorithm is","id":103047,"created_tdt":"2016-05-26T00:00:00Z","parent_i":103066,"_version_":1679953856828538883}]},"highlighting":{"103047":{"ocr_t":[]}}}