• Title/Summary/Keyword: Conjugate Gradient Methods

Search Result 71, Processing Time 0.018 seconds

Efficient Implementation of CG and CR Methods for Linear Systems on a Single Processing Node of the HITACHI SR8000

  • Nishimura, S.;Takahashi, D.;Shigehara, T.;Mizoguchi, H.;Mishima, T.
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.298-301
    • /
    • 2000
  • We discuss the iterative methods for linear systems on a single processing node of the HITACHI SR8000. Each processing node of the SR8000 is a shared memory parallel computer which is composed of eight RISC processors with a pseudo-vector facility. We implement highly optimized codes for basic linear operations including a matrix-vector product and apply them to the conjugate gradient (CG) and the conjugate residual (CR) methods for linear systems. Our tuned codes for both method score nearly 50% of the theoretical peak performance, which is the best in the sense that it corresponds to an asymptotic performance of the inner product.

  • PDF

Modified gradient methods hybridized with Tikhonov regularization for damage identification of spatial structure

  • Naseralavi, S.S.;Shojaee, S.;Ahmadi, M.
    • Smart Structures and Systems
    • /
    • v.18 no.5
    • /
    • pp.839-864
    • /
    • 2016
  • This paper presents an efficient method for updating the structural finite element model. Model updating is performed through minimizing the difference between the recorded acceleration of a real damaged structure and a hypothetical damaged one. This is performed by updating physical parameters (module of elasticity in this study) in each step using iterative process of modified nonlinear conjugate gradient (M-NCG) and modified Broyden-Fletcher-Goldfarb-Shanno algorithm (M-BFGS) separately. These algorithms are based on sensitivity analysis and provide a solution for nonlinear damage detection problem. Three illustrative test examples are considered to assess the performance of the proposed method. Finally, it is demonstrated that the proposed method is satisfactory for detecting the location and ratio of structural damage in presence of noise.

Convenient Preparation of Tumor-specific Immunoliposomes Containing Doxorubicin

  • Nam, Sang-Min;Cho, Jang-Eun;Son, Byoung-Soo;Park, Yong-Serk
    • BMB Reports
    • /
    • v.31 no.1
    • /
    • pp.95-100
    • /
    • 1998
  • Two innovative methods to prepare target-sensitive immunoliposomes containing doxorubicin by coupling monoclonal antibodies (mAb DH2, SH1) specific to cancer cell surface antigens ($G_{M3}$, $Le^X$) have been developed and are described here. Firstly, liposomes containing N-glutaryl phosphatidylethanolamine (NGPE) were prepared, followed by the encapsulation of doxorubicin, DH2 or SH1 antibodies were conjugated to NGPE in the liposomes (direct coupling). Secondly, liposomes were prepared with NGPE/mAb conjugates by the detergent dialysis method (conjugate insertion), and then doxorubicin was encapsulated by proton gradient. The immunoliposomes prepared by both methods were able to specifically bind to the surface of the tumor cells - B16BL6 mouse melanoma cells. The efficiencies of doxorubicin-entrapping into liposomes prepared by direct coupling and conjugate insertion was about 98% and 25%, respectively. These types of liposomal formulation are sensitive to target cells, which can be useful for various clinical applications.

  • PDF

A domain decomposition method applied to queuing network problems

  • Park, Pil-Seong
    • Communications of the Korean Mathematical Society
    • /
    • v.10 no.3
    • /
    • pp.735-750
    • /
    • 1995
  • We present a domain decomposition algorithm for solving large sparse linear systems of equations arising from queuing networks. Such techniques are attractive since the problems in subdomains can be solved independently by parallel processors. Many of the methods proposed so far use some form of the preconditioned conjugate gradient method to deal with one large interface problem between subdomains. However, in this paper, we propose a "nested" domain decomposition method where the subsystems governing the interfaces are small enough so that they are easily solvable by direct methods on machines with many parallel processors. Convergence of the algorithms is also shown.lso shown.

  • PDF

Cost optimization of reinforced high strength concrete T-sections in flexure

  • Tiliouine, B.;Fedghouche, F.
    • Structural Engineering and Mechanics
    • /
    • v.49 no.1
    • /
    • pp.65-80
    • /
    • 2014
  • This paper reports on the development of a minimum cost design model and its application for obtaining economic designs for reinforced High Strength Concrete (HSC) T-sections in bending under ultimate limit state conditions. Cost objective functions, behavior constraint including material nonlinearities of steel and HSC, conditions on strain compatibility in steel and concrete and geometric design variable constraints are derived and implemented within the Conjugate Gradient optimization algorithm. Particular attention is paid to problem formulation, solution behavior and economic considerations. A typical example problem is considered to illustrate the applicability of the minimum cost design model and solution methodology. Results are confronted to design solutions derived from conventional design office methods to evaluate the performance of the cost model and its sensitivity to a wide range of unit cost ratios of construction materials and various classes of HSC described in Eurocode2. It is shown, among others that optimal solutions achieved using the present approach can lead to substantial savings in the amount of construction materials to be used. In addition, the proposed approach is practically simple, reliable and computationally effective compared to standard design procedures used in current engineering practice.

An Efficient Adaptive Wavelet-Collocation Method Using Lifted Interpolating Wavelets (수정된 보간 웨이블렛응 이용한 적응 웨이블렛-콜로케이션 기법)

  • Kim, Yun-Yeong;Kim, Jae-Eun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.8 s.179
    • /
    • pp.2100-2107
    • /
    • 2000
  • The wavelet theory is relatively a new development and now acquires popularity and much interest in many areas including mathematics and engineering. This work presents an adaptive wavelet method for a numerical solution of partial differential equations in a collocation sense. Due to the multi-resolution nature of wavelets, an adaptive strategy can be easily realized it is easy to add or delete the wavelet coefficients as resolution levels progress. Typical wavelet-collocation methods use interpolating wavelets having no vanishing moment, but we propose a new wavelet-collocation method on modified interpolating wavelets having 2 vanishing moments. The use of the modified interpolating wavelets obtained by the lifting scheme requires a smaller number of wavelet coefficients as well as a smaller condition number of system matrices. The latter property makes a preconditioned conjugate gradient solver more useful for efficient analysis.

Parallelized Topology Design Optimization of the Frame of Human Powered Vessel (인력선 프레임의 병렬화 위상 최적설계)

  • Kim, Hyun-Suk;Lee, Ki-Myung;Kim, Min-Geun;Cho, Seon-Ho
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.47 no.1
    • /
    • pp.58-66
    • /
    • 2010
  • Topology design optimization is a method to determine the optimal distribution of material that yields the minimal compliance of structures, satisfying the constraint of allowable material volume. The method is easy to implement and widely used so that it becomes a powerful design tool in various disciplines. In this paper, a large-scale topology design optimization method is developed using the efficient adjoint sensitivity and optimality criteria methods. Parallel computing technique is required for the efficient topology optimization as well as the precise analysis of large-scale problems. Parallelized finite element analysis consists of the domain decomposition and the boundary communication. The preconditioned conjugate gradient method is employed for the analysis of decomposed sub-domains. The developed parallel computing method in topology optimization is utilized to determine the optimal structural layout of human powered vessel.

Acoustic Control of Optional Space Using Optimum Location of Absorbing Material (흡음재 최적배치를 이용한 임의 공간의 음향제어에 관한 연구)

  • 김동영;홍도관;안찬우
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.14 no.10
    • /
    • pp.1048-1054
    • /
    • 2004
  • The Passive acoustic control is used in various fields, such as structures, automobiles, aircraft and so on. It is used in variety of acoustic field with the absorbing material, as one of the methods which can control the acoustic in optional space. In that case of passive control using this absorption material, it would be important to maximize the control performance of material property, numbers, geometry shape and the attached location of boundary area of the absorbing material. But realistically these variables, specially material Property, have no broad choice. Therefore, the position of absorbing material is the most important variable. In this study, we use the optimization method to minimize acoustic energy of optional space in the interest frequency attaching some absorbing materials to the boundary area. For analysis and optimization, this study uses the FEA and the conjugate gradient method. This optimization process is very efficient and useful in the passive acoustic control.

Implementation and Experiments of Sparse Matrix Data Structure for Heat Conduction Equations

  • Kim, Jae-Gu;Lee, Ju-Hee;Park, Geun-Duk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.12
    • /
    • pp.67-74
    • /
    • 2015
  • The heat conduction equation, a type of a Poisson equation which can be applied in various areas of engineering is calculating its value with the iteration method in general. The equation which had difference discretization of the heat conduction equation is the simultaneous equation, and each line has the characteristic of expressing in sparse matrix of the equivalent number of none-zero elements with neighboring grids. In this paper, we propose a data structure for sparse matrix that can calculate the value faster with less memory use calculate the heat conduction equation. To verify whether the proposed data structure efficiently calculates the value compared to the other sparse matrix representations, we apply the representative iteration method, CG (Conjugate Gradient), and presents experiment results of time consumed to get values, calculation time of each step and relevant time consumption ratio, and memory usage amount. The results of this experiment could be used to estimate main elements of calculating the value of the general heat conduction equation, such as time consumed, the memory usage amount.

Convergence of Nonlocal Integral Operator in Peridynamics (비국부 적분 연산기로 표현되는 페리다이나믹 방정식의 수렴성)

  • Jo, Gwanghyun;Ha, Youn Doh
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.34 no.3
    • /
    • pp.151-157
    • /
    • 2021
  • This paper is devoted to a convergence study of the nonlocal integral operator in peridynamics. The implicit formulation can be an efficient approach to obtain the static/quasi-static solution of crack propagation problems. Implicit methods require constly large-matrix operations. Therefore, convergence is important for improving computational efficiency. When the radial influence function is utilized in the nonlocal integral equation, the fractional Laplacian integral equation is obtained. It has been mathematically proved that the condition number of the system matrix is affected by the order of the radial influence function and nonlocal horizon size. We formulate the static crack problem with peridynamics and utilize Newton-Raphson methods with a preconditioned conjugate gradient scheme to solve this nonlinear stationary system. The convergence behavior and the computational time for solving the implicit algebraic system have been studied with respect to the order of the radial influence function and nonlocal horizon size.