• 제목/요약/키워드: singular approximation

검색결과 67건 처리시간 0.04초

균열 유한 요소법 (Finite 'crack' element method)

  • 조영삼;전석기;임세영
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2004년도 춘계학술대회
    • /
    • pp.551-556
    • /
    • 2004
  • We propose a 2D 'crack' element for the simulation of propagating crack with minimal remeshing. A regular finite element containing the crack tip is replaced with this novel crack element, while the elements which the crack has passed are split into two transition elements. Singular elements can easily be implemented into this crack element to represent the crack-tip singularity without enrichment. Both crack element and transition element proposed in our formulation are mapped from corresponding master elements which are commonly built using the moving least-square (MLS) approximation only in the natural coordinate. In numerical examples, the accuracy of stress intensity factor $K_I$ is demonstrated and the crack propagation in a plate is simulated.

  • PDF

낮은 계수 행렬의 Compressed Sensing 복원 기법 (Compressed Sensing of Low-Rank Matrices: A Brief Survey on Efficient Algorithms)

  • 이기륭;예종철
    • 대한전자공학회논문지SP
    • /
    • 제46권5호
    • /
    • pp.15-24
    • /
    • 2009
  • Compressed sensing은 소수의 선형 관측으로부터 sparse 신호를 복원하는 문제를 언급하고 있다. 최근 벡터 경우에서의 성공적인 연구 결과가 행렬의 경우로 확장되었다. Low-rank 행렬의 compressed sensing은 ill-posed inverse problem을 low-rank 정보를 이용하여 해결한다. 본 문제는 rank 최소화 혹은 low-rank 근사의 형태로 나타내질 수 있다. 본 논문에서는 최근 제안된 여러 가지 효율적인 알고리즘에 대한 survey를 제공한다.

Application to the design of reduced-order robust MPC and MIMO identification

  • Lee, Kwang-Soon;Kim, Sang-Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
    • /
    • pp.313-316
    • /
    • 1997
  • Two different issues, design of reduced-order robust model predictive control and input signal design for identification of a MIMO system, are addressed and design techniques based on singular value decomposition(SVD) of the pulse response circulant matrix(PRCM) are proposed. For this, we investigate the properties of the PRCM, which is a periodic approximation of a linear discrete-time system, and show its SVD represents the directional as well as the frequency decomposition of the system. Usefulness of the PRCM and effectiveness of the proposed design techniques are demonstrated through numerical examples.

  • PDF

APPROXIMATION OF DERIVATIVE TO A SINGULARLY PERTURBED REACTION-CONVECTION-DIFFUSION PROBLEM WITH TWO PARAMETERS.

  • Priyadharshini, R. Mythili;Ramanujam, N.
    • Journal of applied mathematics & informatics
    • /
    • 제27권3_4호
    • /
    • pp.517-529
    • /
    • 2009
  • In this paper, a singularly perturbed reaction-convection-diffusion problem with two parameters is considered. A parameter-uniform error bound for the numerical derivative is derived. The numerical method considered here is a standard finite difference scheme on piecewise-uniform Shishkin mesh, which is fitted to both boundary and initial layers. Numerical results are provided to illustrate the theoretical results.

  • PDF

Lyapunov 부등식을 이용한 주파수하중 차수축소 (Frequency weighted reduction using Lyapunov inequalities)

  • 오도창;정은태;이상경
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.12-12
    • /
    • 2000
  • This paper consider a new weighted model reduction using block diagonal solutions of Lyapunov inequalities. With the input and/or output weighting function, the stability of reduced order system is quaranteed and a priori error bound is proposed. to achieve this, after finding the solutions of two Lyapunov inequalities and balancing the full order system, we find the reduced order systems using the direct truncation and the singular perturbation approximation. The proposed method is compared with other existing methods using numerical example.

  • PDF

Deep compression of convolutional neural networks with low-rank approximation

  • Astrid, Marcella;Lee, Seung-Ik
    • ETRI Journal
    • /
    • 제40권4호
    • /
    • pp.421-434
    • /
    • 2018
  • The application of deep neural networks (DNNs) to connect the world with cyber physical systems (CPSs) has attracted much attention. However, DNNs require a large amount of memory and computational cost, which hinders their use in the relatively low-end smart devices that are widely used in CPSs. In this paper, we aim to determine whether DNNs can be efficiently deployed and operated in low-end smart devices. To do this, we develop a method to reduce the memory requirement of DNNs and increase the inference speed, while maintaining the performance (for example, accuracy) close to the original level. The parameters of DNNs are decomposed using a hybrid of canonical polyadic-singular value decomposition, approximated using a tensor power method, and fine-tuned by performing iterative one-shot hybrid fine-tuning to recover from a decreased accuracy. In this study, we evaluate our method on frequently used networks. We also present results from extensive experiments on the effects of several fine-tuning methods, the importance of iterative fine-tuning, and decomposition techniques. We demonstrate the effectiveness of the proposed method by deploying compressed networks in smartphones.

A NOTE ON A FINITE ELEMENT METHOD DEALING WITH CORNER SINGULARITIES

  • Kim, Seok-Chan;Woo, Gyung-Soo;Park, Tae-Hoon
    • Journal of applied mathematics & informatics
    • /
    • 제7권2호
    • /
    • pp.493-506
    • /
    • 2000
  • Recently the first author and his coworker report a new finite element method for the Poisson equations with homogeneous Dirichlet boundary conditions on a polygonal domain with one re-entrant angle [7], They use the well-known fact that the solution of such problem has a singular representation, deduced a well-posed new variational problem for a regular part of solution and an extraction formula for the so-called stress intensity factor using tow cut-off functions. They use Fredholm alternative an Garding's inequality to establish the well-posedness of the variational problem and finite element approximation, so there is a maximum bound for mesh h theoretically. although the numerical experiments shows the convergence for every reasonable h with reasonable size y imposing a restriction to the support of the extra cut-off function without using Garding's inequality. We also give error analysis with similar results.

균열 유한 요소의 개발 (Development of finite 'crack' element)

  • 조영삼;전석기;임세영
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2004년도 봄 학술발표회 논문집
    • /
    • pp.381-388
    • /
    • 2004
  • We propose a 2D 'crack' element for the simulation of propagating crack with minimal remeshing. A regular finite element containing the crack tip is replaced with this novel crack element, while the elements which the crack has passed are split into two transition elements. Singular elements can easily be implemented into this crack element to represent the crack-tip singularity without enrichment. Both crack element and transition element proposed in our formulation are mapped from corresponding master elements which are commonly built using the moving least-square (MLS) approximation only in the natural coordinate. In numerical examples, the accuracy of stress intensity factor K/sub I/ is demonstrated and the crack propagation in a plate is simulated.

  • PDF

SOME WEIGHTED APPROXIMATION PROPERTIES OF NONLINEAR DOUBLE INTEGRAL OPERATORS

  • Uysal, Gumrah;Mishra, Vishnu Narayan;Serenbay, Sevilay Kirci
    • Korean Journal of Mathematics
    • /
    • 제26권3호
    • /
    • pp.483-501
    • /
    • 2018
  • In this paper, we present some recent results on weighted pointwise convergence and the rate of pointwise convergence for the family of nonlinear double singular integral operators in the following form: $$T_{\eta}(f;x,y)={\int}{\int\limits_{{\mathbb{R}^2}}}K_{\eta}(t-x,\;s-y,\;f(t,s))dsdt,\;(x,y){\in}{\mathbb{R}^2},\;{\eta}{\in}{\Lambda}$$, where the function $f:{\mathbb{R}}^2{\rightarrow}{\mathbb{R}}$ is Lebesgue measurable on ${\mathbb{R}}^2$ and ${\Lambda}$ is a non-empty set of indices. Further, we provide an example to support these theoretical results.

APPROXIMATION BY INTERPOLATING POLYNOMIALS IN SMIRNOV-ORLICZ CLASS

  • Akgun Ramazan;Israfilov Daniyal M.
    • 대한수학회지
    • /
    • 제43권2호
    • /
    • pp.413-424
    • /
    • 2006
  • Let $\Gamma$ be a bounded rotation (BR) curve without cusps in the complex plane $\mathbb{C}$ and let G := int $\Gamma$. We prove that the rate of convergence of the interpolating polynomials based on the zeros of the Faber polynomials $F_n\;for\;\bar G$ to the function of the reflexive Smirnov-Orlicz class $E_M (G)$ is equivalent to the best approximating polynomial rate in $E_M (G)$.