• 제목/요약/키워드: Iterative technique

검색결과 569건 처리시간 0.027초

Optimum design of parabolic steel box arches

  • Azad, Abul K.;Mohdaly, Hani M.M.
    • Structural Engineering and Mechanics
    • /
    • 제9권2호
    • /
    • pp.169-180
    • /
    • 2000
  • An optimization procedure has been prescribed for the minimum weight design of symmetrical parabolic arches subjected to arbitrary loading. The cross section is assumed to be a symmetrical box section with variable depth and flange areas. The webs are unstiffened and have constant thickness. The proposed sequential, iterative search technique determines the optimum geometrical configuration of the parabolic arch which includes the optimum depth profile and the optimum lengths and areas of the required flange plates corresponding to the prescribed number of curtailments. The study shows that the optimum value of rise to span ratio (h/L) of a parabolic arch is maximum at 0.41 for uniformly distributed loading over the entire span. For any other loading, the optimum value of h/L is less than 0.41.

Free vibration analysis of continuous bridge under the vehicles

  • Tan, Guojin;Wang, Wensheng;Jiao, Yubo;Wei, Zhigang
    • Structural Engineering and Mechanics
    • /
    • 제61권3호
    • /
    • pp.335-345
    • /
    • 2017
  • Free vibration analysis for continuous bridge under any number of vehicles is conducted in this paper. Calculation strategy for natural frequency and mode shape is proposed based on Euler-Bernoulli beam theory and numerical assembly method. Firstly, a half-car planar model is adopted; equations of motion and displacement functions for bridge and vehicle are established, respectively. Secondly, the undermined coefficient matrices for wheels, vehicles, intermediate support, left-end support and right-end support are derived. Then, the numerical assembly technique for conventional finite element method is adopted to construct the overall matrix of coefficients for whole system. Finally, natural frequencies and corresponding mode shapes are determined based on iterative method and overall matrix solution. Numerical simulation is presented to verify the effectiveness of the proposed method. The results reveal that the solutions of present method are exact ones. Natural frequencies and associate modal shapes of continuous bridge under different conditions of vehicles are investigated. The influences of vehicle parameters on natural frequencies are also demonstrated.

3.3V 고속 CMOS 3차 시그마 델타 변조기 설계 (Design of a high speed 3rd order sigma-delta modulator)

  • 박준한;윤광섭
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1999년도 하계종합학술대회 논문집
    • /
    • pp.982-985
    • /
    • 1999
  • An efficient technique to trade off speed for resolution is the sigma-delta modulation (SDM). This paper proposes a new SDM architecture to improve conversion rates and SNR(Signal-to Noise Ratio) by using master clock and four divided clock. The charateristics of the proposed SDM are simulated in MATLAB environment. and optimizing the capacitor sizes is done by iterative processing. other analog characteristics are simulated using 0.65${\mu}{\textrm}{m}$ n-well CMOS process, double poly and single metal. The result of simulation shows that more increasing the effective bits of internal ADC/DAC, bigger the improvement of SNR.

  • PDF

저 해상도 변위 히스토그램을 이용한 고성능 변위정보 추출 알고리듬 (A high performance disparity extraction algorithm using low resolution disparity histogram)

  • 김남규;이광도;김형곤;차균현
    • 전자공학회논문지S
    • /
    • 제35S권3호
    • /
    • pp.131-143
    • /
    • 1998
  • This paper presents a high performance disparity extraction algorithm that generate a dense and accurate disparity map using low-resolution disparity histogram. Disparity distribution of background and object areas can besegmented from low-resolution disparity histogram. These information can be used to reduce the search area and search range of the high-resolution image resulting reliable disparity information in high speed. The computationally efficient matching pixel count(MPC) similarity measure technique is useed extensively toremove the redundancies inherent in the area-based matching method, and also results robust matching at the boundary region. Resulting maches are further improved using iterative support algorithm and post processing. We have obtained good results on randomdot stereogram and real images obtained in our carmera system.

  • PDF

프로펠러 가공 전용 CAD/CAM 시스템 개발 (Development of a CAD/CAM System for Marine Propeller)

  • 전용태;윤재웅;박세형
    • 한국정밀공학회지
    • /
    • 제17권9호
    • /
    • pp.53-61
    • /
    • 2000
  • The manufacture of a marine propeller typically requires long lead time to generate 5-axis tool path. Hence it may take several weeks to manufacture a satisfactory propeller with a general purpose CAD/CAM system. In this research a dedicated 5-axis CAD/CAM system for machining marine propellers has been developed, The system employs various methods to enhance the productivity : interference-free tool path generation employing check vectors and optimum cutter size determinants. In addition an iterative NURBS modeling technique is used to improve the accuracy of the modeled surface and effective cutting conditions are determined and recommended empirically to increase the productivity. The proposed CAD/CAM system has been implemented with C++ and OpenGL graphic library on the Windows system. The system validation and sample results are also given and discussed.

  • PDF

변형률 경화를 고려한 정상상태 소성가공 공정의 공정 최적설계 (Process Optimal Design in Steady-State Meta Forming considering Strain-Hardening)

  • 황숭무
    • 한국소성가공학회:학술대회논문집
    • /
    • 한국소성가공학회 2000년도 춘계학술대회논문집
    • /
    • pp.40-43
    • /
    • 2000
  • A process optimal design methodology applicable to steady-state forming with a strain-hardening material is presented. in this approach the optimal design problem is formulated on the basis of a rigid-viscoplastic finite element process model and a derivative based approach is adopted as an optimization technique The process model the schemes for the evaluation of the design sensitivity considering the effect of strain-hardening and an iterative procedure for design optimization are described. the validity of the proposed approach is demonstrated through application to die shape optimal design in extrusion.

  • PDF

DCOC를 이용한 RC 프레임의 최소경비설계 (Minimum Cost Design of Reinforced Concrete Frames Using DCOC)

  • 한상훈;구봉근;조홍동;오현수
    • 한국콘크리트학회:학술대회논문집
    • /
    • 한국콘크리트학회 2000년도 봄 학술발표회 논문집
    • /
    • pp.485-490
    • /
    • 2000
  • This paper describes the application of discretized continuum-type optimality criteria (DCOC) for minimum-cost design of the reinforced concrete frame structures consisting of beams and columns. The cost of construction as objective function which includes the costs of concrete, reinforced steel and formwork is minimized. The design constraints include limits on the maximum deflection at a prescribed node, bending and shear strengths in beams, uniaxial bending strength of columns according to design codes(CEB/FIP, 1990). In the first stage, only beams with uniform cross-sectional parameters per span are considered. But the steel ratio is allowed to vary freely. The cross-sectional parameters and steel ratio in each column are assumed to be uniform for practical reasons. Optimality criteria is given based on the well known Kuhn-Tucker necessary conditions, followed by an iterative procedure for designs when the design variables are the depth and the steel ratio. The versatility of the DCOC technique has been demonstrated by considering numerical examples which have one-bay four-storey frame.

  • PDF

GENERALIZED SET-VALUED MIXED NONLINEAR QUASI VARLIATIONAL INEQUALITIES

  • H, M-U
    • Journal of applied mathematics & informatics
    • /
    • 제5권1호
    • /
    • pp.73-90
    • /
    • 1998
  • In this paper we introduce and study a number of new classes of quasi variational inequalities. using essentially the projection technique and its variant forms we prove that the gen-eralized set-valued mixed quasivariational inequalities are equivalent to the fixed point problem and the Wiener-Hopf equations(normal maps). This equivalence enables us to suggest a number of iterative algorithms solving the generalized variational inequalities. As a special case of the generalized set-valued mixed quasi variational in-equalities we obtain a class of quasi variational inequalities studied by Siddiqi Husain and Kazmi [35] but there are several inaccuracies in their formulation of the problem the statement and the proofs of the problem the statement and the proofs of their results. We have removed these inaccuracies. The correct formulation of thir results can be obtained as special cases from our main results.

AN AFFINE SCALING INTERIOR ALGORITHM VIA CONJUGATE GRADIENT AND LANCZOS METHODS FOR BOUND-CONSTRAINED NONLINEAR OPTIMIZATION

  • Jia, Chunxia;Zhu, Detong
    • Journal of applied mathematics & informatics
    • /
    • 제29권1_2호
    • /
    • pp.173-190
    • /
    • 2011
  • In this paper, we construct a new approach of affine scaling interior algorithm using the affine scaling conjugate gradient and Lanczos methods for bound constrained nonlinear optimization. We get the iterative direction by solving quadratic model via affine scaling conjugate gradient and Lanczos methods. By using the line search backtracking technique, we will find an acceptable trial step length along this direction which makes the iterate point strictly feasible and the objective function nonmonotonically decreasing. Global convergence and local superlinear convergence rate of the proposed algorithm are established under some reasonable conditions. Finally, we present some numerical results to illustrate the effectiveness of the proposed algorithm.

A HYBRID METHOD FOR NCP WITH $P_0$ FUNCTIONS

  • Zhou, Qian;Ou, Yi-Gui
    • Journal of applied mathematics & informatics
    • /
    • 제29권3_4호
    • /
    • pp.653-668
    • /
    • 2011
  • This paper presents a new hybrid method for solving nonlinear complementarity problems with $P_0$-functions. It can be regarded as a combination of smoothing trust region method with ODE-based method and line search technique. A feature of the proposed method is that at each iteration, a linear system is only solved once to obtain a trial step, thus avoiding solving a trust region subproblem. Another is that when a trial step is not accepted, the method does not resolve the linear system but generates an iterative point whose step-length is defined by a line search. Under some conditions, the method is proven to be globally and superlinearly convergent. Preliminary numerical results indicate that the proposed method is promising.