• 제목/요약/키워드: solution acceleration technique

검색결과 31건 처리시간 0.03초

Acceleration of the Time-Dependent Radiative Transfer Calculations using Diffusion Approximation

  • Noh, Tae-Wan
    • 한국원자력학회:학술대회논문집
    • /
    • 한국원자력학회 2004년도 추계학술발표회 발표논문집
    • /
    • pp.151-152
    • /
    • 2004
  • An acceleration technique combined with the discrete ordinates method which has been widely used in the solution of neutron transport phenomena is applied to the solution of radiative transfer equation. The self-adjoint form of the second order radiation intensity equation is used to enhance the stability of the solution, and a new linearization method is developed to avoid the nonlinearity of the material temperature equation. This new acceleration method is applied to the well known Marshak wave problem, and the numerical result is compared with that of a non-accelerated calculation

  • PDF

반복 계산법 및 계산 가속기법에 의한 다물체 동역학 해법 (An Accelerated Iterative Method for the Dynamic Analysis of Multibody Systems)

  • 이기수;임철호
    • 대한기계학회논문집
    • /
    • 제16권5호
    • /
    • pp.899-909
    • /
    • 1992
  • 본 연구에서는 대수 미분 방정식을 풀기위한 새로운 방법을 소개한다. 본 작업에서는 Lagrange multiplier의 값이 사전에 주어졌다고 생각하여, 즉 대수 미분 방정식을 순수한 상미분 방정식으로 변환하여, 잘 알려진 시간 적분법을 적용한다. 또 정확한 Lagrange Multiplier값은 반복 계산법(iterative scheme)에 의하여 계산한 다. 시간 적분의 정확도와 제한 조건의 정확도는 모두 보장된다. 특히 제한 조건 의 경우, 위치, 속도 및 가속도의 제한 조건이 모두 만족된다. 또 정확한 Lagrange multiplier의 값을 계산 가속기법(acceleration technique)에 의하여 대단히 빨리 계 산한다. 독립 좌표를 구할 필요가 없으므로 거대한 행열을 decomposition하는 등의 복잡한 절차가 불필요하며 N-R 반복법 역시 불필요하다. 이러한 사항들 및 Jacobian 행열의 sparsity로 인하여 경제적인 계산이 가능하게 된다.

차륜 가속도 예측방법에 대한 연구 (A Study on the Estimation Method of the Wheel Acceleration)

  • 김중배;민중기
    • 한국자동차공학회논문집
    • /
    • 제5권2호
    • /
    • pp.120-126
    • /
    • 1997
  • In this study, an effective estimation method of wheel acceleration is presented. The wheel acceleration is mainly used in the ABS(anti-lick brake system) and the TCS(traction control system). The wheel acceleration is a derivative term of the wheel speed which is generally measured by the wheel speed sensors. The results of a simple differentiation of the signal and an observation of the signal by Kalman filter show that Kalman filter has better performance than the simple differentiation. The differentiated sine signal which is contaminated with random noise shows a rugged signal compared with the signal which is filtered by the Kalman filter. The covariance of the differentiated signal is higher than that of the Kalman-filtered signal, too. The presented Kalman filter technique shows an effective way of solution to get the estimated wheel acceleration value which is sufficient to be applied to ABS or TCS control algorithms.

  • PDF

ACCELERATION OF MACHINE LEARNING ALGORITHMS BY TCHEBYCHEV ITERATION TECHNIQUE

  • LEVIN, MIKHAIL P.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제22권1호
    • /
    • pp.15-28
    • /
    • 2018
  • Recently Machine Learning algorithms are widely used to process Big Data in various applications and a lot of these applications are executed in run time. Therefore the speed of Machine Learning algorithms is a critical issue in these applications. However the most of modern iteration Machine Learning algorithms use a successive iteration technique well-known in Numerical Linear Algebra. But this technique has a very low convergence, needs a lot of iterations to get solution of considering problems and therefore a lot of time for processing even on modern multi-core computers and clusters. Tchebychev iteration technique is well-known in Numerical Linear Algebra as an attractive candidate to decrease the number of iterations in Machine Learning iteration algorithms and also to decrease the running time of these algorithms those is very important especially in run time applications. In this paper we consider the usage of Tchebychev iterations for acceleration of well-known K-Means and SVM (Support Vector Machine) clustering algorithms in Machine Leaning. Some examples of usage of our approach on modern multi-core computers under Apache Spark framework will be considered and discussed.

Cooperative Contour Control of Two Robots under Speed and Joint Acceleration Constraints

  • Jayawardene, T.S.S.;Nakamura, Masatoshi;Goto, Satoru;Kyura, Nobuhiro
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.1387-1391
    • /
    • 2003
  • The fundamental aim of this paper is to present a solution algorithm to achieve cooperative contour controlling, under joint acceleration constraint with maximum cooperative speed. Usually, the specifications like maximum velocity of cooperative trajectory are determined by the application itself. In resolving the cooperative trajectory into two complementary trajectories, an optimum task resolving strategy is employed so that the task assignment for each robot is fair under the joint acceleration constraint. The proposed algorithm of being an off-line technique, this could be effectively and conveniently extended to the existing servo control systems irrespective of the computational power of the controller implemented. Further, neither a change in hardware setup nor considerable reconfiguration of the existing system is required in adopting this technique. A simulation study has been carried out to verify that the proposed method can be realized in the generation of complementary trajectories so that they could meet the stipulated constraints in simultaneous maneuvering.

  • PDF

유연한 보로 구성된 다물체 동역학의 효율적인 해법 (An Efficient Solution for Multibody Dynamics Composed of Flexible Beams)

  • 이기수;금영탁
    • 대한기계학회논문집
    • /
    • 제16권12호
    • /
    • pp.2298-2305
    • /
    • 1992
  • 본 연구에서는 보의 종방향 강성치를 실제보다 훨씬 작은 횡방향 강성치 수준 으로 낮추어 시간 적분을 수행하는 대신, 종방향에 작용하는 힘을 분산시켜서 계산시 종방향 상대 변형을 억제하는 기법을 사용하였다. 또 여러개의 물체가 조인트에서 서로 연결되어 이루어진 다물체 도역학의 해는 운동 방정식과 기구학적 제한조건을 모 두 만족시켜야 하며, 상미분 방정식 해법용 시간 적분을 바로 적용할 수는 없다. 본 논문에서는 참고문헌(13)과 (14)에 소개된 반복계산법 및 계산가속기법에 의하여 Lag- range multiplier를 운동 방정식에서 소거한 후 시간 적분을 수행하는 방법을 사용한 다.

인공 가속도 시간이력 작성을 위한 개선된 알고리즘 (An Enhanced Algorithm for the Generation of Artificial Acceleration Time History)

  • 김종수
    • 한국지진공학회:학술대회논문집
    • /
    • 한국지진공학회 1998년도 추계 학술발표회 논문집 Proceedings of EESK Conference-Spring 1998
    • /
    • pp.304-311
    • /
    • 1998
  • An algorithm to enhance spectra matching of acceleration time history used in the seismic analysis of nuclear power plants(NPP) is proposed. The new scheme provides the solution on the highly fluctuating and over conservatism problems that happened in order to satisfy design spectrum enveloping criteria in the traditional method. To obtain optimized spectrum for a time history, a spectrum matching procedure that adapts a system identification technique is also developed. The algorithm also introduces maximum displacement control, baseline correction, clipping and raising of maximum peak of time history, and power spectral density (PSD) control of time history. It is verified through numerical examples that this new scheme can definitely generate acceleration time history, closely matching the target spectra and satisfying other stipulated requirements.

  • PDF

간격 및 접촉에 의한 충격하중을 고려한 고속 회전 디스크의 유한요소 해석 (Finite Element Analysis of High-speed Rotating Disks Considering Impulsive Loading by the Clearance and Contact)

  • 이기수;김영술;소재욱
    • 한국소음진동공학회논문집
    • /
    • 제24권1호
    • /
    • pp.45-53
    • /
    • 2014
  • For the time integration solution of the impulsive dynamic contact problem of high-speed rotating disks formulated by the finite element technique, the velocity and acceleration contact constraints as well as the displacement contact constraint are imposed for the numerical stability without spurious oscillations. The solution of the present technique is checked by the numerical simulation using the concentric high-speed rotating disks with the clearance and impulsive loading. It is shown that the almost steady state solution agrees with the corresponding analytical solution of the elasticity and that the differentiated constraints are crucial for the numerical stability of such high-speed contact problems of the disks under impulsive loading.

A New Convergence Acceleration Technique for Scramjet Flowfields

  • Bernard Parent;Jeung, In-Seuck
    • 한국추진공학회:학술대회논문집
    • /
    • 한국추진공학회 2004년도 제22회 춘계학술대회논문집
    • /
    • pp.15-25
    • /
    • 2004
  • This paper outlines a new convergence acceleration de-signed to solve scramjet flowfields with zones of re-circulation. Named the “marching-window”, the algorithm consists of performing pseudo-time iterations on a minimal width subdomain composed of a sequence of cross-stream planes of nodes. The upstream boundary of the subdomain is positioned such that all nodes upstream exhibit a residual smaller than the user-specified convergence threshold. The advancement of the downstream boundary follows the advancement of the upstream boundary, except in zones of significant streamwise ellipticity where a streamwise ellipticity sensor ensures its continuous progress. Compared to the standard pseudo-time marching approach, the march-ing-window is here seen to decrease the work required for convergence by up to 24 times for supersonic flows with little streamwise ellipticity and by up to 8 times for supersonic flows with large streamwise separated regions. The memory requirements are observed to be reduced sixfold by not allocating memory to the nodes not included in the computational subdomain. The marching-window satisfies the same convergence criterion as the standard pseudo-time stepping methods, hence resulting in the same converged solution within the tolerance of the user-specified convergence threshold. The extension of the marching-window to the weakly-ionized Navier-Stokes equations is also discussed.

  • PDF

PERFORMANCE OF RICHARDSON EXTRAPOLATION ON SOME NUMERICAL METHODS FOR A SINGULARLY PERTURBED TURNING POINT PROBLEM WHOSE SOLUTION HAS BOUNDARY LAYERS

  • Munyakazi, Justin B.;Patidar, Kailash C.
    • 대한수학회지
    • /
    • 제51권4호
    • /
    • pp.679-702
    • /
    • 2014
  • Investigation of the numerical solution of singularly perturbed turning point problems dates back to late 1970s. However, due to the presence of layers, not many high order schemes could be developed to solve such problems. On the other hand, one could think of applying the convergence acceleration technique to improve the performance of existing numerical methods. However, that itself posed some challenges. To this end, we design and analyze a novel fitted operator finite difference method (FOFDM) to solve this type of problems. Then we develop a fitted mesh finite difference method (FMFDM). Our detailed convergence analysis shows that this FMFDM is robust with respect to the singular perturbation parameter. Then we investigate the effect of Richardson extrapolation on both of these methods. We observe that, the accuracy is improved in both cases whereas the rate of convergence depends on the particular scheme being used.