• Title/Summary/Keyword: large solution

Search Result 2,869, Processing Time 0.022 seconds

Development of Parallel Eigenvalue Solution Algorithm with Substructuring Techniques (부구조기법을 이용한 병렬 고유치해석 알고리즘 개발)

  • 김재홍;성창원;박효선
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1999.10a
    • /
    • pp.411-420
    • /
    • 1999
  • The computational model and a new eigenvalue solution algorithm for large-scale structures is presented in the form of parallel computation. The computational loads and data storages required during the solution process are drastically reduced by evenly distributing computational loads to each processor. As the parallel computational model, multiple personal computers are connected by 10Mbits per second Ethernet card. In this study substructuring techniques and static condensation method are adopted for modeling a large-scale structure. To reduce the size of an eigenvalue problem the interface degrees of freedom and one lateral degree of freedom are selected as the master degrees of freedom in each substructure. The performance of the proposed parallel algorithm is demonstrated by applying the algorithm to dynamic analysis of two-dimensional structures.

  • PDF

Consolidation Analysis of Geotextile Tubes Filled with Highly Compressible Sludge Using Variable Coefficients of Consolidation

  • Kim, Hyeongjoo;Kim, Hyeongsoo
    • Journal of the Korean GEO-environmental Society
    • /
    • v.22 no.12
    • /
    • pp.25-32
    • /
    • 2021
  • Geotextile tube technology has been perceived as an economical solution for liquid sludge treatment, and analyzing its consolidation behavior is necessary to be able to evaluate the dewatering capabilities of large geotextile tubes filled with contaminated soil, tailings, sewage sludge, and so on. The objectives of this study are to present a method that can adequately convey the consolidation behavior of geotextile tubes filled with sewage sludge, and to investigate the effects of various geotextile tube consolidation parameters. In this study, variable coefficients of consolidation are utilized to analyze the consolidation process of geotextile tubes filled with sewage sludge. The consolidation solution was verified by comparing the measured and predicted data from a hanging bag test conducted in the literature. After verifying the proposed solution, the consolidation parameters of a geotextile tube composed of a woven polypropylene outer layer and a non-woven polypropylene layer filled sewage sludge were obtained. Using the obtained parameters, the consolidation behavior of a large-scale composite geotextiles tube was predicted.

A New Scheduling Algorithm for Semiconductor Manufacturing Process (반도체 제조공정을 위한 새로운 생산일정 알고리즘)

  • 복진광;이승권;문성득;박선원
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.6
    • /
    • pp.811-821
    • /
    • 1998
  • A new scheduling algorithm for large scale semiconductor processes is addressed. The difficulties of scheduling for semiconductor fabrication processes are mainly due from repeating production of wafers that experience reentrant flows. Sequence branch algorithm (SBA) is proposed for large real scheduling problems when all processing times are deterministic. The SBA is based on the reachability graph of Petri net of which the several defects such as memory consumption and system deadlock are complemented. Though the SBA shows the solution deviating a little from the optimal solution of mixed integer programming, it is adjustable for large size scheduling problems. Especially, it shows a potential that is capable of handling commercial size problems that are intractable with mathematical programming.

  • PDF

An Efficient Algorithm based on Self-Organizing Feature Maps for Large Scale Traveling Salesman Problems (대규모 TSP과제를 효과적으로 해결할 수 있는 SOFM알고리듬)

  • 김선종;최흥문
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.8
    • /
    • pp.64-70
    • /
    • 1993
  • This paper presents an efficient SOFM(self-organizing feature map) algorithm for the solution of the large scale TSPs(traveling salesman problems). Because no additional winner neuron for each city is created in the next competition, the proposed algorithm requires just only the N output neurons and 2N connections, which are fixed during the whole process, for N-city TSP, and it does not requires any extra algorithm of creation of deletion of the neurons. And due to direct exploitation of the output potential in adaptively controlling the neighborhood, the proposed algorithm can obtain higher convergence rate to the suboptimal solutions. Simulation results show about 30% faster convergence and better solution than the conventional algorithm for solving the 30-city TSP and even for the large scale of 1000-city TSPs.

  • PDF

The Diakoptics Solution of Eigenvalue Problems in Large Scale Network (분할법에 의한 대형회로망의 고유치 해석)

  • 김준현;박건수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.12 no.3
    • /
    • pp.254-266
    • /
    • 1987
  • The concept of diakoptics is to analyze a large scale network by partitioning it in to a number of smaller subnetworks. The theory has been developed from the concepts of open path and closed path through the conventional graph theoretic approach. In this paper, the formulation of characteristic equation of the eigenvalues of the network is represented by the aplication of diakoptics to the simulated netwrok model of any linear large scale network. Furtheromore, diakoptics coupled with appropriately proposed algorithm for the interative solution of the characteristic equation results in considerable computational efficiency as compare with nondiakoptical mothods.

  • PDF

Large deflection behavior of a flexible circular cantilever arc device subjected to inward or outward polar force

  • Al-Sadder, Samir Z.
    • Structural Engineering and Mechanics
    • /
    • v.22 no.4
    • /
    • pp.433-447
    • /
    • 2006
  • The problem of very large deflection of a circular cantilever arc device subjected to inward or outward polar force is studied. An exact elliptic integral solution is derived for the two cases and the results are checked using large displacement finite element analysis via the ANSYS package by performing a new novel modeling simulation technique for this problem. Excellent agreements have been obtained between the exact analytical solution and the numerical approach. From this study, a design chart for engineers is developed to predict the required value for the inward polar force for the device to switch on for a given angle forming the circular arc (${\theta}_o$). This study has several interesting applications in mechanical engineering, integrated circuit technology, nanotechnology and especially in microelectromechanical systems (MEMs) such as a MEM circular device switch subjected to attractive or repulsive magnetic forces due to the attachments of two magnetic poles at the fixed and at the free end of the circular cantilever arc switch device.

Development of Efficient Moving Memory Column Solver for Large Finite Element Analysis (대형 유한요소 해석을 위한 골조구조물의 최종강도해석에 관한 연구)

  • 이성우;이동근;송윤환
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1990.10a
    • /
    • pp.34-39
    • /
    • 1990
  • For the analysis of structures, specifically if it is large-scale, in which case it can not be solved within the core memory, the majority of computation time is consumed In the solution of simultaneous linear equation. In this study an efficient in- and out-of-core column solver for sparse symmetric matrix utilizing memory moving scheme is developed. Compare with existing blocking methods the algorithm is simple, therefore the coding and computational efficiencies are greatly enhanced. Upon available memory size, the solver automatically performs solution within the core or outside core. Analysis example shows that the proposed method efficiently solve the large structural problem on the small-memory microcomputer.

  • PDF

Anodic oxidation behavior of AZ31 Mg alloy in aqueous solution containing various NaF concentrations

  • Moon, Sungmo;Kwon, Duyoung
    • Journal of the Korean institute of surface engineering
    • /
    • v.55 no.4
    • /
    • pp.196-201
    • /
    • 2022
  • This paper deals with anodic oxidation behavior of AZ31 Mg alloy in aqueous solutions containing various NaF concentrations from 0.01 M to 1 M. Three different voltage-time curves and anodic oxide formation behaviors appeared with concentration of NaF in deionized water. When NaF concentration is lower than 0.02 M, the voltage of AZ31 Mg alloy increased linearly and then reached a steady-state value more than 200 V, and large size pits and thin oxide layer were formed. When NaF concentration is between 0.05 M and 0.1 M, the voltage of AZ31 Mg alloy showed large periodic fluctuations of about 30 ~ 50 V around more than 200 V and large number of small particles were observed. If NaF concentration is higher than 0.2 M, PEO films can be formed without visible arcs under solution pH 6.5 ~ 7.5 by F- ions without help of OH- ions.

An Asymptotic Solution and the Green's Function for the Transverse Vibration of Beams with Variable Properties

  • Kim, Yong-Chul
    • Journal of Ocean Engineering and Technology
    • /
    • v.24 no.1
    • /
    • pp.34-38
    • /
    • 2010
  • An analytical solution procedure for the dynamic response of beams with variable properties is developed by using an asymptotic solution and the Green's function. This asymptotic closed form solution is derived for the transverse vibration of beams under the assumption of slowly varying properties, such as mass, cross-section, tension etc., along the beam length. However, this solution is still found to be very accurate even in the case of large variation, such as step change in cross-section, mass, and tension. Therefore, this derived asymptotic closed form solution and the Green's function can be easily applied to find dynamic responses for various kind of beam vibration problems.

A finite element algorithm for contact problems with friction

  • Liu, C.H.;Hofstetter, G.;Mang, H.A.
    • Structural Engineering and Mechanics
    • /
    • v.3 no.3
    • /
    • pp.289-297
    • /
    • 1995
  • A finite element algorithm for consideration of contact constraints is presented. It is characterized by introducing the geometric constraints, resulting from contact conditions, directly into the algebraic system of equations for the incremental displacements of an incremental iterative solution procedure. The usefulness of the proposed algorithm for efficient solutions of contact problems involving large displacements and large strains is demonstrated in the numerical investigation.