• 제목/요약/키워드: Linear spline

검색결과 167건 처리시간 0.025초

3차 B-spline 함수를 이용한 열전도 및 유체문제의 해석 (Analysis for computing heat conduction and fluid problems using cubic B-spline function)

  • 김은필
    • 한국전산유체공학회지
    • /
    • 제3권2호
    • /
    • pp.1-8
    • /
    • 1998
  • We make use of cubic B-spline interpolation function in two cases: heat conduction and fluid flow problems. Cubic B-spline test function is employed because it is superior to approximation of linear and non-linear problems. We investigated the accuracy of the numerical formulation and focused on the position of the breakpoints within the computational domain. When the domain is divided by partitions of equal space, the results show poor accuracy. For the case of a heat conduction problem this partition can not reflect the temperature gradient which is rapidly changed near the wall. To correct the problem, we have more grid points near the wall or the region which has a rapid change of variables. When we applied the unequally spaced breakpoints, the results show high accuracy. Based on the comparison of the linear problem, we extended to the highly non-linear fluid flow problems.

  • PDF

SPLINE HAZARD RATE ESTIMATION USING CENSORED DATA

  • Na, Myung Hwan
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제3권2호
    • /
    • pp.99-106
    • /
    • 1999
  • In this paper, the spline hazard rate model to the randomly censored data is introduced. The unknown hazard rate function is expressed as a linear combination of B-splines which is constrained to be linear(or constant) in tails. We determine the coefficients of the linear combination by maximizing the likelihood function. The number of knots are determined by Bayesian Information Criterion. Examples using simulated data are used to illustrate the performance of this method under presenting the random censoring.

  • PDF

The numerical solution of dynamic response of SDOF systems using cubic B-spline polynomial functions

  • Shojaee, S.;Rostami, S.;Moeinadini, A.
    • Structural Engineering and Mechanics
    • /
    • 제38권2호
    • /
    • pp.211-229
    • /
    • 2011
  • In this paper, we present a new explicit procedure using periodic cubic B-spline interpolation polynomials to solve linear and nonlinear dynamic equation of motion governing single degree of freedom (SDOF) systems. In the proposed approach, a straightforward formulation was derived from the approximation of displacement with B-spline basis in a fluent manner. In this way, there is no need to use a special pre-starting procedure to commence solving the problem. Actually, this method lies in the case of conditionally stable methods. A simple step-by-step algorithm is implemented and presented to calculate dynamic response of SDOF systems. The validity and effectiveness of the proposed method is demonstrated with four examples. The results were compared with those from the numerical methods such as Duhamel integration, Linear Acceleration and also Exact method. The comparison shows that the proposed method is a fast and simple procedure with trivial computational effort and acceptable accuracy exactly like the Linear Acceleration method. But its power point is that its time consumption is notably less than the Linear Acceleration method especially in the nonlinear analysis.

B-spline 곡선을 power 기저형태의 구간별 다항식으로 바꾸는 Direct Expansion 알고리듬 (A Direct Expansion Algorithm for Transforming B-spline Curve into a Piecewise Polynomial Curve in a Power Form.)

  • 김덕수;류중현;이현찬;신하용;장태범
    • 한국CDE학회논문집
    • /
    • 제5권3호
    • /
    • pp.276-284
    • /
    • 2000
  • Usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in a power form is done by either a knot refinement followed by basis conversions or applying a Taylor expansion on the B-spline curve for each knot span. Presented in this paper is a new algorithm, called a direct expansion algorithm, for the problem. The algorithm first locates the coefficients of all the linear terms that make up the basis functions in a knot span, and then the algorithm directly obtains the power form representation of basis functions by expanding the summation of products of appropriate linear terms. Then, a polynomial segment of a knot span can be easily obtained by the summation of products of the basis functions within the knot span with corresponding control points. Repeating this operation for each knot span, all of the polynomials of the B-spline curve can be transformed into a power form. The algorithm has been applied to both static and dynamic curves. It turns out that the proposed algorithm outperforms the existing algorithms for the conversion for both types of curves. Especially, the proposed algorithm shows significantly fast performance for the dynamic curves.

  • PDF

윤곽선들의 B-spline 곡면 보간을 위한 새로운 방식 (A new approach for B-spline surface interpolation to contours)

  • 박형준;정형배;김광수
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
    • /
    • pp.474-479
    • /
    • 2003
  • This paper addresses the problem of B-spline surface interpolation to serial contours, where the number of points varies from contour to contour. A traditional lofting approach creates a set of B-spline curves via B-spline curve interpolation to each contour, makes them compatible via degree elevation and knot insertion, and performs B-spline surface lofting to get a B-spline surface interpolating them. The approach tends to result in an astonishing number of control points in the resulting B-spline surface. This situation arises mainly from the inevitable process of progressively merging different knot vectors to make the B-spline curves compatible. This paper presents a new approach for avoiding this troublesome situation. The approach includes a novel process of getting a set of compatible B-spline curves from the given contours. The process is based on the universal parameterization [1,2] allowing the knots to be selected freely but leading to a more stable linear system for B-spline curve interpolation. Since the number of control points in each compatible B-spline curve is equal to the highest number of contour points, the proposed approach can realize efficient data reduction and provide a compact representation of a B-spline surface while keeping the desired surface shape. Some experimental results demonstrate its usefulness and quality.

  • PDF

Numerical solution of linear elasticity by preconditioning cubic spline collocation

  • Lee, Yong-Hun
    • 대한수학회논문집
    • /
    • 제11권3호
    • /
    • pp.867-880
    • /
    • 1996
  • Numerical approximations to the linear elasticity are traditionally based on the finite element method. In this paper we propose a new formulation based on the cubic spline collocation method for linear elastic problem on the unit square. We present several numerical results for the eigenvalues of the matrix represented by cubic collocation method and preconditioner matrix which is preconditioned by FEM and FDM. Finally we present the numerical solution for some example equation.

  • PDF

비선형 계획법을 이용한 B-스플라인 곡면의 순정 알고리듬 (A Global Fairing Algorithm for B-spline Surfaces Using Non-linear Programming)

  • 이현찬;홍충성;김덕수
    • 대한산업공학회지
    • /
    • 제27권1호
    • /
    • pp.1-10
    • /
    • 2001
  • In the reverse engineering, surfaces are modeled for new products by interpolating the digitized data points obtained by measuring the existing shapes. However, many measuring or deviation errors are happened during the measuring process. If these errors are ignored, designers could get undesirable results. Therefore, it is important to handle such errors and fairing procedure with the esthetics criteria is needed during surface modeling process. This paper presents algorithms for the fairing of B-spline surfaces. The algorithms are based on automatic repositioning of control points for B-spline surfaces. New positions of the control points are determined by solving a non-linear programming of which the objective functions are derived variously using derived surfaces and constraints are established by distance measures between the original and the modified control points. Changes in surface shapes are analyzed by illustrations of their shapes and continuous plotting of gaussian and mean curvatures.

  • PDF

스케치 입력과 선형 스플라인 곡선을 이용한 3D 항공경로 생성 방법 (3D Flight Path Creation using Sketch Input and Linear Spline Curves)

  • 최정일;박태진;손의성;전재웅;최윤철
    • 한국멀티미디어학회논문지
    • /
    • 제13권9호
    • /
    • pp.1373-1381
    • /
    • 2010
  • 현재 항공기 조종사들이 사용하고 있는 항공기동 도해도 방법은 2차원 공간 표현만을 사용하여, 3차원 정보 입력 시 한계가 있고 이를 직관적으로 이해하는 것이 어렵다. 이를 위해 도입된 항공기동 애니메이션 저작도구들은 사용법이 복잡하고 중간에 비행경로를 수정하거나 다수 비행객체들의 전투 상황을 실시간으로 인터렉티브하게 다룰 수 없다. 본 연구는 항공기동 교육을 위한 애니메이션 시스템 중 3차원 항공경로 생성방법에 관한 것이다. 본 연구에서는 2D 도해도에 스케치된 초기 입력과 실제 항공기 추력을 계산하여 실제 비행과 유사한 3차원 선형 스플라인 곡선을 생성해 낸다. 제안하는 선형 스플라인 곡선 생성 방법을 이용하여 항공기동 브리핑 및 디브리핑 시에 비행경로를 실시간으로 생성 및 수정하는 것이 가능하고 이를 애니메이션으로 즉시에 표현할 수 있다.

음성 특징의 효율성 (EFFICIENCY OF SPEECH FEATURES)

  • 황규웅
    • 한국음향학회:학술대회논문집
    • /
    • 한국음향학회 1995년도 제12회 음성통신 및 신호처리 워크샵 논문집 (SCAS 12권 1호)
    • /
    • pp.225-227
    • /
    • 1995
  • This paper compared waveform, cepstrum, and spline wavelet features with nonlinear discriminant analysis. This measure shows efficiency of speech parametrization better than old linear separability criteria and can be used to measure the efficiency of each layer of certain system. Spline wavelet transform has larger gap among classes and cepstrum is clustered better than the spline wavelet feature. Both features do not have good property for classification and we will compare Gabor wavelet transform, Mel cepstrum, delta cepstrum, etc.

  • PDF

Boundary Corrected Smoothing Splines

  • Kim, Jong-Tae
    • Journal of the Korean Data and Information Science Society
    • /
    • 제9권1호
    • /
    • pp.77-88
    • /
    • 1998
  • Smoothing spline estimators are modified to remove boundary bias effects using the technique proposed in Eubank and Speckman (1991). An O(n) algorithm is developed for the computation of the resulting estimator as well as associated generalized cross-validation criteria, etc. The asymptotic properties of the estimator are studied for the case of a linear smoothing spline and the upper bound for the average mean squared error of the estimator given in Eubank and Speckman (1991) is shown to be asymptotically sharp in this case.

  • PDF