• Title/Summary/Keyword: $L^{2}$ norm error

Search Result 47, Processing Time 0.031 seconds

Well-Conditioned Observer Design via LMI (LMI를 이용한 Well-Conditioned 관측기 설계)

  • 허건수;정종철
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2003.04a
    • /
    • pp.21-26
    • /
    • 2003
  • The well-conditioned observer in a stochastic system is designed so that the observer is less sensitive to the ill-conditioning factors in transient and steady-state observer performance. These factors include not only deterministic issues such as unknown initial estimation error, round-off error, modeling error and sensing bias, but also stochastic issues such as disturbance and sensor noise. In deterministic perspectives, a small value in the L$_2$ norm condition number of the observer eigenvector matrix guarantees robust estimation performance to the deterministic issues and its upper bound can be minimized by reducing the observer gain and increasing the decay rate. Both deterministic and stochastic issues are considered as a weighted sum with a LMI (Linear Matrix Inequality) formulation. The gain in the well-conditioned observer is optimally chosen by the optimization technique. Simulation examples are given to evaluate the estimation performance of the proposed observer.

  • PDF

L2-NORM ERROR ANALYSIS OF THE HP-VERSION WITH NUMERICAL INTEGRATION

  • Kim, Ik-Sung
    • Bulletin of the Korean Mathematical Society
    • /
    • v.39 no.1
    • /
    • pp.9-22
    • /
    • 2002
  • We consider the hp-version to solve non-constant coefficient elliptic equations with Dirichlet boundary conditions on a bounded, convex polygonal domain $\Omega$ in $R^{2}.$ To compute the integrals in the variational formulation of the discrete problem we need the numerical quadrature rule scheme. In this paler we consider a family $G_{p}= {I_{m}}$ of numerical quadrature rules satisfying certain properties. When the numerical quadrature rules $I_{m}{\in}G_{p}$ are used for calculating the integrals in the stiffness matrix of the variational form we will give its variational fore and derive an error estimate of ${\parallel}u-\tilde{u}^h_p{\parallel}_0,{\Omega}'$.

NUMERICAL SOLUTIONS FOR SPACE FRACTIONAL DISPERSION EQUATIONS WITH NONLINEAR SOURCE TERMS

  • Choi, Hong-Won;Chung, Sang-Kwon;Lee, Yoon-Ju
    • Bulletin of the Korean Mathematical Society
    • /
    • v.47 no.6
    • /
    • pp.1225-1234
    • /
    • 2010
  • Numerical solutions for the fractional differential dispersion equations with nonlinear forcing terms are considered. The backward Euler finite difference scheme is applied in order to obtain numerical solutions for the equation. Existence and stability of the approximate solutions are carried out by using the right shifted Grunwald formula for the fractional derivative term in the spatial direction. Error estimate of order $O({\Delta}x+{\Delta}t)$ is obtained in the discrete $L_2$ norm. The method is applied to a linear fractional dispersion equations in order to see the theoretical order of convergence. Numerical results for a nonlinear problem show that the numerical solution approach the solution of classical diffusion equation as fractional order approaches 2.

Adaptive Hyperspectral Image Classification Method Based on Spectral Scale Optimization

  • Zhou, Bing;Bingxuan, Li;He, Xuan;Liu, Hexiong
    • Current Optics and Photonics
    • /
    • v.5 no.3
    • /
    • pp.270-277
    • /
    • 2021
  • The adaptive sparse representation (ASR) can effectively combine the structure information of a sample dictionary and the sparsity of coding coefficients. This algorithm can effectively consider the correlation between training samples and convert between sparse representation-based classifier (SRC) and collaborative representation classification (CRC) under different training samples. Unlike SRC and CRC which use fixed norm constraints, ASR can adaptively adjust the constraints based on the correlation between different training samples, seeking a balance between l1 and l2 norm, greatly strengthening the robustness and adaptability of the classification algorithm. The correlation coefficients (CC) can better identify the pixels with strong correlation. Therefore, this article proposes a hyperspectral image classification method called correlation coefficients and adaptive sparse representation (CCASR), based on ASR and CC. This method is divided into three steps. In the first step, we determine the pixel to be measured and calculate the CC value between the pixel to be tested and various training samples. Then we represent the pixel using ASR and calculate the reconstruction error corresponding to each category. Finally, the target pixels are classified according to the reconstruction error and the CC value. In this article, a new hyperspectral image classification method is proposed by fusing CC and ASR. The method in this paper is verified through two sets of experimental data. In the hyperspectral image (Indian Pines), the overall accuracy of CCASR has reached 0.9596. In the hyperspectral images taken by HIS-300, the classification results show that the classification accuracy of the proposed method achieves 0.9354, which is better than other commonly used methods.

NUMERICAL COUPLING OF TWO SCALAR CONSERVATION LAWS BY A RKDG METHOD

  • OKHOVATI, NASRIN;IZADI, MOHAMMAD
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.23 no.3
    • /
    • pp.211-236
    • /
    • 2019
  • This paper is devoted to the study and investigation of the Runge-Kutta discontinuous Galerkin method for a system of differential equations consisting of two hyperbolic conservation laws. The numerical coupling flux which is used at a given interface (x = 0) is the upwind flux. Moreover, in the linear case, we derive optimal convergence rates in the $L_2$-norm, showing an error estimate of order ${\mathcal{O}}(h^{k+1})$ in domains where the exact solution is smooth; here h is the mesh width and k is the degree of the (orthogonal Legendre) polynomial functions spanning the finite element subspace. The underlying temporal discretization scheme in time is the third-order total variation diminishing Runge-Kutta scheme. We justify the advantages of the Runge-Kutta discontinuous Galerkin method in a series of numerical examples.

Robust $H_{\infty}$ filtering for discrete-time polytopic uncertain systems (이산시간 폴리토프형 불확실성 시스템의 견실 $H_{\infty}$ 필터링)

  • Kim, Jong-Hae;Oh, Do-Chang;Lee, Kap-Rai
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.39 no.5
    • /
    • pp.26-33
    • /
    • 2002
  • The design method of robust $H_{\infty}$ filtering for discrete-time uncertain linear systems is investigated in this paper. The uncertain parameters are assumed to be unknown but belonging to known convex compact set of polytope type. The objective is to design a stable robust $H_{\infty}$ filter guaranteeing the asymptotic stability of filtering error dynamics and present an $L_2$ induced norm bound analytically for the modified $H_{\infty}$ performance measure. The sufficient condition for the existence of robust $H_{\infty}$ filter and the filter design method are established by LMI(linear matrix inequality) approach, which can be solved efficiently by convex optimization. The proposed algorithm is checked through an example.

Design of the Well-Conditioned Observer - A Linear Matrix Inequality Approach - (Well-Conditioned 관측기 설계 - A Linear Matrix Inequality Approach -)

  • Jung, Jong-Chul;Huh, Kun-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.28 no.5
    • /
    • pp.503-510
    • /
    • 2004
  • In this paper, the well-conditioned observer for a stochastic system is designed so that the observer is less sensitive to the ill-conditioning factors in transient and steady-state observer performance. These factors include not only deterministic uncertainties such as unknown initial estimation error, round-off error, modeling error and sensing bias, but also stochastic uncertainties such as disturbance and sensor noise. In deterministic perspectives, a small value in the L$_{2}$ norm condition number of the observer eigenvector matrix guarantees robust estimation performance to the deterministic uncertainties. In stochastic viewpoints, the estimation variance represents the robustness to the stochastic uncertainties and its upper bound can be minimized by reducing the observer gain and increasing the decay rate. Both deterministic and stochastic issues are considered as a weighted sum with a LMI (Linear Matrix Inequality) formulation. The gain in the well-conditioned observer is optimally chosen by the optimization technique. Simulation examples are given to evaluate the estimation performance of the proposed observer.

ANALYSIS OF VELOCITY-FLUX FIRST-ORDER SYSTEM LEAST-SQUARES PRINCIPLES FOR THE OPTIMAL CONTROL PROBLEMS FOR THE NAVIER-STOKES EQUATIONS

  • Choi, Young-Mi;Lee, Hyung-Chun
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.14 no.2
    • /
    • pp.125-140
    • /
    • 2010
  • This paper develops a least-squares approach to the solution of the optimal control problem for the Navier-Stokes equations. We recast the optimality system as a first-order system by introducing velocity-flux variables and associated curl and trace equations. We show that a least-squares principle based on $L^2$ norms applied to this system yields optimal discretization error estimates in the $H^1$ norm in each variable.

MULTI-DEGREE REDUCTION OF BÉZIER CURVES WITH CONSTRAINTS OF ENDPOINTS USING LAGRANGE MULTIPLIERS

  • Sunwoo, Hasik
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.29 no.2
    • /
    • pp.267-281
    • /
    • 2016
  • In this paper, we consider multi-degree reduction of $B{\acute{e}}zier$ curves with continuity of any (r, s) order with respect to $L_2$ norm. With help of matrix theory about generalized inverses we can use Lagrange multipliers to obtain the degree reduction matrix in a very simple form as well as the degree reduced control points. Also error analysis comparing with the least squares degree reduction without constraints is given. The advantage of our method is that the relationship between the optimal multi-degree reductions with and without constraints of continuity can be derived explicitly.

Input-Output Gains of Linear Periodic Time-Varying Systems with Applications to Multirate Signal Processing (다중비 신호처리에 적용한 선형 주기적 시변 시스템의 입출력 이득)

  • 이상철;박계원
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.5
    • /
    • pp.963-969
    • /
    • 2000
  • In this paper, we define two input-output gains of linear periodic time-varying systems. One is the ratio of output with worst-case l2-norm over all inputs with unit 12-norm. It denotes G($\iota_2,\iota_2$.The other is the ratio of output with worst-case RMS value over all inputs with unit RMS value. It denotes G(RMS, RMS) .It is fact that these two gains are equivalent for linear time-invariant system. In this paper, we prove these two gains are also equivalent for linear periodic time-varying system. In addition, the relationship between two method of obtaining the generalized frequency responses for linear periodic time-varying system is derived. Finally, we apply the defined input-output gains to M-channel filter-bank which is multi-rate signal Processing system, used to speech coding. In the filter-bank, generally, aliasing distortion, magnitude distortion, and phase distortion are present. It is shown that these are kept small if the filter-bank is designed by a method that optimizes the gain G($\iota_2,\iota_2$ of an error system.

  • PDF