• Title/Summary/Keyword: linear approximation

Search Result 748, Processing Time 0.034 seconds

A unified solution to optimal Hankel-Norm approximation problem (최적 한켈 놈 근사화 문제의 통합형 해)

  • Youn, Sang-Soon;Kwon, Oh-Kyu
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.2
    • /
    • pp.170-177
    • /
    • 1998
  • In this paper, a unified solution of Hankel norm approximation problem is proposed by $\delta$-operator. To derive the main result, all-pass property is derived from the inner and co-inner property in the $\delta$-domain. The solution of all-pass becomes an optimal Hankel norm approximation problem in .delta.-domain through LLFT(Low Linear Fractional Transformation) inserting feedback term $\phi(\gamma)$, which is a free design parameter, to hold the error bound desired against the variance between the original model and the solution of Hankel norm approximation problem. The proposed solution does not only cover continuous and discrete ones depending on sampling interval but also plays a key role in robust control and model reduction problem. The verification of the proposed solution is exemplified via simulation for the zero-order Hankel norm approximation problem and the model reduction problem applied to a 16th order MIMO system.

  • PDF

Design Optimization of Large Scale Structural Systems based on Multilevel Hybrid Approximation (다단계 혼성근사화에 기초한 대형구조계의 설계최적화)

  • 김경일;박종회;황진하
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2002.04a
    • /
    • pp.249-256
    • /
    • 2002
  • A new optimization procedure with approximate reanalysis module, using the staged hybrid methods with substructuring, is proposed in is study. In this procedure, displacements are calculated with two step mixed procedures. First step is to introduce the conservative approximation, which is a hybrid form of the linear and reciprocal approximation, as local approximation. In the next step, it is combined with the global approximation by reduced basis approach. The quality of reanalyzed quantities can be greatly improved through these staged hybrid approximations, specially for large changes in the design. Overall procedures are based on substructuring scheme. Several numerical examples illustrate the validity and effectiveness of the proposed methods.

  • PDF

Approximate Method in Estimating Sensitivity Responses to Variations in Delayed Neutron Energy Spectra

  • J. Yoo;H. S. Shin;T. Y. Song;Park, W. S.
    • Proceedings of the Korean Nuclear Society Conference
    • /
    • 1997.10a
    • /
    • pp.85-90
    • /
    • 1997
  • Previous our numerical results in computing point kinetics equations show a possibility in developing approximations to estimate sensitivity responses of nuclear reactor We recalculate sensitivity responses by maintaining the corrections with first order of sensitivity parameter. We present a method for computing sensitivity responses of nuclear reactor based on an approximation derived from point kinetics equations. Exploiting this approximation, we found that the first order approximation works to estimate variations in the time to reach peak power because of their linear dependence on a sensitivity parameter, and that there are errors in estimating the peak power in the first order approximation for larger sensitivity parameters. To confirm legitimacy of our approximation, these approximate results are compared with exact results obtained from our previous numerical study.

  • PDF

TWO-SIDED BEST SIMULTANEOUS APPROXIMATION

  • Rhee, Hyang Joo
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.23 no.4
    • /
    • pp.705-710
    • /
    • 2010
  • Let $C_1(X)$ be a normed linear space over ${\mathbb{R}}^m$, and S be an n-dimensional subspace of $C_1(X)$ with spaned by {$s_1,{\cdots},s_n$}. For each ${\ell}$- tuple vectors F in $C_1(X)$, the two-sided best simultaneous approximation problem is $$\min_{s{\in}S}\;\max\limits_{i=1}^\ell\{{\parallel}f_i-s{\parallel}_1\}$$. A $s{\in}S$ attaining the above minimum is called a two-sided best simultaneous approximation or a Chebyshev center for $F=\{f_1,{\cdots},f_{\ell}\}$ from S. This paper is concerned with algorithm for calculating two-sided best simultaneous approximation, in the case of continuous functions.

ANALYSIS OF ECG SIGNAL USING MICROCOMPUTER (마이크로 컴퓨터를 이용한 심전도 신호해석)

  • Kim, Y.S.;Jhon, S.C.;Lee, E.S.;Min, H.K.;Hong, S.H.
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1268-1270
    • /
    • 1987
  • This paper suggests several simple and efficient algorithms for detecting the ECG Signal by Microcomputer's software. The ECG signal detection was performed with the Linear Approximation and the feature extraction. The linear transformation approximates a given waveform by a piecewise-linear function with a preset upper bound on the absolute error between the functional values of the original function and the approximation. And the feature extraction from ECG signal, the features are different wave amplitudes, durations and interwave intervals, used the slope, the amplitude and time-Duration of ECG Sinal.

  • PDF

The System of Non-Linear Detector over Wireless Communication (무선통신에서의 Non-Linear Detector System 설계)

  • 공형윤
    • Proceedings of the IEEK Conference
    • /
    • 1998.06a
    • /
    • pp.106-109
    • /
    • 1998
  • Wireless communication systems, in particular, must operate in a crowded electro-magnetic environmnet where in-band undesired signals are treated as noise by the receiver. These interfering signals are often random but not Gaussian Due to nongaussian noise, the distribution of the observables cannot be specified by a finite set of parameters; instead r-dimensioal sample space (pure noise samples) is equiprobably partitioned into a finite number of disjointed regions using quantiles and a vector quantizer based on training samples. If we assume that the detected symbols are correct, then we can observe the pure noise samples during the training and transmitting mode. The algorithm proposed is based on a piecewise approximation to a regression function based on quantities and conditional partition moments which are estimated by a RMSA (Robbins-Monro Stochastic Approximation) algorithm. In this paper, we develop a diversity combiner with modified detector, called Non-Linear Detector, and the receiver has a differential phase detector in each diversity branch and at the combiner each detector output is proportional to the second power of the envelope of branches. Monte-Carlo simulations were used as means of generating the system performance.

  • PDF

A Time-Domain Finite Element Formulation for Transient Dynamic Linear Elasticity (과도 선형 동탄성 문제의 시간영역 유한요소해석)

  • Sim, U-Jin;Lee, Seong-Hui
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.4
    • /
    • pp.574-581
    • /
    • 2001
  • Transient linear elastodynamic problems are numerically analyzed in a time-domain by the Finite Element Method, for which the variational formulation based upon the equations of motion in convolution integral is newly derived. This formulation is implicit and does not include the time derivative terms so that the computation procedure is simple and less assumptions are required comparing to the conventional time-domain dynamic numerical algorithms, being able to get the improved numerical accuracy and stability. That formulation is expanded using the semi-discrete approximation to obtain the finite element equations. In the temporal approximation, the time axis is divided equally and constant and linear time variations are assumed in those intervals. It is found that unconditionally stable numerical results are obtained in case of the constant time variation. Some numerical examples are given to show the versatility of the presented formulation.

Piece-wise linear estimation of mechanical properties of materials with neural networks

  • Shin, Inho
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.181-186
    • /
    • 1992
  • Many real-world problems are concerned with estimation rather than classification. This paper presents an adaptive technique to estimate the mechanical properties of materials from acoustoultrasonic waveforms. This is done by adapting a piece-wise linear approximation technique to a multi-layered neural network architecture. The piece-wise linear approximation network (PWLAN) finds a set of connected hyperplanes that fit all input vectors as close as possible. A corresponding architecture requires only one hidden layer to estimate any curve as an output pattern. A learning rule for PWLAN is developed and applied to the acousto-ultrasonic data. The efficiency of the PWLAN is compared with that of classical backpropagation network which uses generalized delta rule as a learning algorithm.

  • PDF

Linear Stability of Plane Wall Jet (2차원 벽면제트의 선형안정성해석)

  • Cha, Jeong-Hun;Park, Seung-O;Kim, Mun-Eon
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.34 no.1
    • /
    • pp.1-7
    • /
    • 2006
  • Linear stability analysis of 2-dimensional wall jet is conducted by using parabolized stability equation (PSE). Wall jet is found to be modelled well by boundary layer approximation except for the neighborhood of the nozzle exit, and the introduction of local similarity variable makes the streamwise basic flow Reynolds number independent. Stability characteristics of the wall jet obtained

Application of Method of Moving Asymptotes for Non-Linear Structures (비선형 구조물에 대한 이동 점근법(MMA)의 적용)

  • 진경욱;한석영;최동훈
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1999.05a
    • /
    • pp.141-146
    • /
    • 1999
  • A new method, so called MMA(Method of Moving Asymptotes) was applied to the optimization problems of non-linear functions and non-linear structures. In each step of the iterative process, tile MMA generates a strictly convex approximation subproblems and solves them by using the dual problems. The generation of these subproblems is controlled by so called 'moving asymptotes', which may both make no oscillation and speed up tile convergence rate of optimization process. By contrast in generalized dual function, the generated function by MMA is always explicit type. Both the objective and behaviour constraints which were approximated are optimized by dual function. As the results of some examples, it was found that this method is very effective to obtain the global solution for problems with many local solutions. Also it was found that MMA is a very effective approximate method using the original function and its 1st derivatives.

  • PDF