{"title":"A massively parallel implementation of the spectral element method for impact problems in plate structures","authors":"Albert N. Danial , James F. Doyle","doi":"10.1016/0956-0521(94)90020-5","DOIUrl":"10.1016/0956-0521(94)90020-5","url":null,"abstract":"<div><p>The spectral element method is a frequency domain formulated matrix method for the dynamic analysis of structures. We show that an important attribute of the spectral formulation is its suitability for implementation on large multiprocessor computers. In this paper we summarize the development of the spectral element method for dynamic plate problems and outline the implementation of the algorithm on MasPar MP-1 and MP-2 computers with 16 384 processors each. The implementation exhibits near perfect scalability. A direct consequence of the ensuing high computational performance is the ability to solve inverse dynamic problems. Example solutions using experimentally measured acceleration response to find the impact site in plate structures are demonstrated.</p></div>","PeriodicalId":100325,"journal":{"name":"Computing Systems in Engineering","volume":"5 4","pages":"Pages 375-388"},"PeriodicalIF":0.0,"publicationDate":"1994-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0956-0521(94)90020-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73427619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design optimization of large structural systems with substructuring in a parallel computational environment","authors":"S.N. Patnaik , A.S. Gendy , D.A. Hopkins","doi":"10.1016/0956-0521(94)90024-8","DOIUrl":"10.1016/0956-0521(94)90024-8","url":null,"abstract":"<div><p>Design optimization of large structural systems can be attempted through a substructure strategy when difficulties are encountered with convergence of such problems. In this strategy the large structure is divided into several smaller substructures, and a subproblem is defined for each substructure. Solution of the large problem can be obtained iteratively through repeated solutions of the modest subproblems. Substructure strategies, in sequential as well as in parallel computational modes on a CRAY YMP multiprocessor computer, have been incorporated into the code CometBoards, which is an acronym for Comparative Evaluation Test Bed of Optimization and Analysis Routines for Design of Structures. Three issues, intensive computation, convergence of the iterative process, and analytically superior optimum, encountered during the implementation of substructure optimization into CometBoards have been solved. Coupling between subproblems as well as local and global constraints grouping are essential for convergence of the iterative process. The substructure strategy can produce an analytically superior optimum different from what can be obtained by regular optimization. For the problems solved, substructure optimization in a parallel computational mode made effective use of all assigned processors.</p></div>","PeriodicalId":100325,"journal":{"name":"Computing Systems in Engineering","volume":"5 4","pages":"Pages 425-440"},"PeriodicalIF":0.0,"publicationDate":"1994-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0956-0521(94)90024-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89756808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A generalized domain decomposition technique for mixed-iterative finite element formulation","authors":"Kyung H. Ahn , Dale A. Hopkins","doi":"10.1016/0956-0521(94)90017-5","DOIUrl":"10.1016/0956-0521(94)90017-5","url":null,"abstract":"<div><p>A concurrent formulation for a large scale finite element problem with direct matrix solver is presented through combined use of domain decomposition and parallel matrix factorization. The algorithm not only reduces high-speed memory requirements but also generates high speed-up in matrix factorization. The present work demonstrates the efficient domain decomposition technique that minimizes the inter-processor communication using the bandwidth optimization technique which has been commonly used for stiffness matrix solution. The direct method using <strong>LDL</strong><sup><em>T</em></sup> skyline factorization has been parallelized and used for each sub-region eliminating the need to form the global system for the entire domain.</p><p>Implementation of the communication algorithm due to domain decomposition into the existing matrix assembly, matrix solution stage along with minimum necessary communication requirements between the processors has been presented in detail. The current domain decomposition scheme provides flexible utilization of processors depending on the user's needs for a problem. The user can assign a different number of processors for domain decomposition and matrix factorization to control the memory requirement and to control the speed-up respectively. The results obtained from IBM RS-6000 clustered workstations will be presented.</p></div>","PeriodicalId":100325,"journal":{"name":"Computing Systems in Engineering","volume":"5 4","pages":"Pages 351-361"},"PeriodicalIF":0.0,"publicationDate":"1994-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0956-0521(94)90017-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76779943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Advance announcement and call for papers","authors":"","doi":"10.1016/0956-0521(94)90030-2","DOIUrl":"https://doi.org/10.1016/0956-0521(94)90030-2","url":null,"abstract":"","PeriodicalId":100325,"journal":{"name":"Computing Systems in Engineering","volume":"5 4","pages":"Page ii"},"PeriodicalIF":0.0,"publicationDate":"1994-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0956-0521(94)90030-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138204512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Postbuckling and large-deflection nonlinear analyses on distributed-memory computers","authors":"Brian C. Watson, Ahmed K. Noor","doi":"10.1016/0956-0521(94)90021-3","DOIUrl":"10.1016/0956-0521(94)90021-3","url":null,"abstract":"<div><p>A computational strategy is presented for postbuckling and nonlinear static analyses of large complex structures on distributed-memory parallel computers. The strategy is designed for message-passing parallel computer systems. The key elements of the proposed strategy are: (a) a multiple-parameter reduced basis technique, (b) a nested dissection (or multilevel substructuring) ordering scheme, (c) parallel assembly of global matrices, and (d) a parallel sparse equation solver. The effectiveness of the strategy is assessed by performing thermomechanical postbuckling analyses of stiffened composite panels with cutouts, and nonlinear large-deflection analyses of High Speed Civil Transport models on three distributed-memory computers. The numerical studies presented demonstrate the advantages of nested dissection-based solvers over traditional skyline-based solvers on distributed-memory machines.</p></div>","PeriodicalId":100325,"journal":{"name":"Computing Systems in Engineering","volume":"5 4","pages":"Pages 389-405"},"PeriodicalIF":0.0,"publicationDate":"1994-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0956-0521(94)90021-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77074388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Massively parallel structural design using stochastic optimization and mixed neuralnet/finite element analysis methods","authors":"Rong C. Shieh","doi":"10.1016/0956-0521(94)90026-4","DOIUrl":"10.1016/0956-0521(94)90026-4","url":null,"abstract":"<div><p>The title study is performed on the massively parallel processing (MPP) environment of Connection Machine (CM) computers using truss structural sizing design problems as example design problems. In this design optimization procedure, only the displacement solution is replaced by that based on neural net technology (under a given set of cross-sectional size parameters (e.g., areas) in the MPP finite element structural reanalysis). This structural reanalysis procedure, together with a vastly improved and parallelized version of the integral global optimization (IGO) stochastic algorithm, IIGO, forms the present MPP structural design methodology. In addition, a procedure to correct the final optimal design for constraint violation or too-conservatively satisfied constraint condition caused by inaccuracy of the NN (neural network) analysis model is also formulated. Evaluation of the numerical performance of the developed computational algorithm set, capability, and strategy is made, primarily on the Connection Machine CM-2 model computer by performing three neural-network-based truss structural reanalysis/minimum weight design problems.</p></div>","PeriodicalId":100325,"journal":{"name":"Computing Systems in Engineering","volume":"5 4","pages":"Pages 455-467"},"PeriodicalIF":0.0,"publicationDate":"1994-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0956-0521(94)90026-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75872101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Iterative real/complex eigen-solver and parallel processing for nonlinear panel flutter analysis","authors":"David Y. Xue , Kotien Wu , Chuh Mei","doi":"10.1016/0956-0521(94)90022-1","DOIUrl":"10.1016/0956-0521(94)90022-1","url":null,"abstract":"<div><p>In the frequency domain analysis of the limit cycle motion of a fluttering panel, the operation of a nonlinear eigen-solution is computationally costly. Nonlinear panel flutter analysis includes repeatedly using real and complex eigen-solutions in iterations and in the searching of the stable limit cycle motion. This study presents an efficient iterative real and complex nonlinear eigen-solver to greatly speed up the solution procedure. This new nonlinear eigen-solution adopted a power iteration-scheme and has the following features: (1) it avoids repeatedly using a costly eigen-solver, (2) it is not sensitive to the initial iteration vector, (3) it operates in the real region for a complex solution, and (4) it solves for the single nonlinear mode deflection directly. Those features are particularly suitable for nonlinear panel flutter analysis in which the limit cycle motion is a stable vibration, the eigenvalue and eigenvector are amplitude related and only the dominant eigenvector has a practical meaning.</p><p>The parallel computation is designed to speed up the searching of the stability of the limit cycle motion. The parallel computation was performed by using PVM (Parallel Virtual Machine) on IBM RS/6000 workstations.</p></div>","PeriodicalId":100325,"journal":{"name":"Computing Systems in Engineering","volume":"5 4","pages":"Pages 407-414"},"PeriodicalIF":0.0,"publicationDate":"1994-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0956-0521(94)90022-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89240167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards the ultimate iterative substructuring method: Combined numerical and parallel scalability, and multiple load cases","authors":"Charbel Farhat, Po-Shu Chen, Paul Stern","doi":"10.1016/0956-0521(94)90016-7","DOIUrl":"10.1016/0956-0521(94)90016-7","url":null,"abstract":"<div><p>First, we overview the FETI substructuring method and discuss its numerical scalability properties. Next, we present an extension to structural analysis with multiple load cases, and to the solution of systems with repeated right hand sides. Such systems arise, among others, in linear transient analysis and in the solution of eigenvalue problems. We show that this extension prompts the design of an efficient parallel coarse grid solver which transcends the numerical scalability of the FETI method into a massively parallel scalability. We illustrate these ultimately desirable properties and demonstrate their impact on computational performance with the static and transient analyses via the FETI method of two large-scale three-dimensional structural problems on a 128-processor iPSC-860 system.</p></div>","PeriodicalId":100325,"journal":{"name":"Computing Systems in Engineering","volume":"5 4","pages":"Pages 337-350"},"PeriodicalIF":0.0,"publicationDate":"1994-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0956-0521(94)90016-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86933433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hugues L. de Cougny, Mark S. Shephard, Can Ozturan
{"title":"Parallel three-dimensional mesh generation","authors":"Hugues L. de Cougny, Mark S. Shephard, Can Ozturan","doi":"10.1016/0956-0521(94)90014-0","DOIUrl":"10.1016/0956-0521(94)90014-0","url":null,"abstract":"<div><p>This paper discusses the development of an automatic mesh generation technique designed to effectively operate on multiple instruction, multiple data (MIMD) parallel computers. The paper first provides an overview of a new octree-based procedure designed for the parallel generation of meshes of large numbers of elements directly from solid model representations. The techniques required to implement such a procedure using message passing on MIMD computers are emphasized. Technical issues considered include the region meshing algorithm, multiple octant migration and incremental load balancing.</p></div>","PeriodicalId":100325,"journal":{"name":"Computing Systems in Engineering","volume":"5 4","pages":"Pages 311-323"},"PeriodicalIF":0.0,"publicationDate":"1994-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0956-0521(94)90014-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89046615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
W.F. Punch III , R.C. Averill , E.D. Goodman , S.-C. Lin , Y. Ding , Y.C. Yip
{"title":"Optimal design of laminated composite structures using coarse-grain parallel genetic algorithms","authors":"W.F. Punch III , R.C. Averill , E.D. Goodman , S.-C. Lin , Y. Ding , Y.C. Yip","doi":"10.1016/0956-0521(94)90023-X","DOIUrl":"10.1016/0956-0521(94)90023-X","url":null,"abstract":"<div><p>A new coarse-grain parallel architecture for genetic algorithms, called island injection genetic algorithms, is implemented for the optimal design of laminated composite structures. This approach represents the design at various levels of refinement in subpopulations on separate computational nodes, then seeks good designs at each level of resolution and injects these good solutions into a population (node) with higher resolution to “fine-tune” the design. Numerical results are presented for the optimal design of a laminated composite beam to maximize its capacity to absorb mechanical energy without fracture. It is shown that super linear speedup can be achieved by using the injection algorithm.</p></div>","PeriodicalId":100325,"journal":{"name":"Computing Systems in Engineering","volume":"5 4","pages":"Pages 415-423"},"PeriodicalIF":0.0,"publicationDate":"1994-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0956-0521(94)90023-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86061864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}