• Title/Summary/Keyword: positive definite matrix

Search Result 105, Processing Time 0.031 seconds

Applications of Graph Theory for the Pipe Network Analysis (상수관망해석을 위한 도학의 적용)

  • Park, Jae-Hong;Han, Geon-Yeon
    • Journal of Korea Water Resources Association
    • /
    • v.31 no.4
    • /
    • pp.439-448
    • /
    • 1998
  • There are many methods to calculate steady-state flowrate in a large water distribution system. Linear method which analyzes continuity equations and energy equations simultaneously is most widely used. Though it is theoretically simple, when it is applied to a practical water distribution system, it produces a very sparse coefficient matrix and most of its diagonal elements are to be zero. This sparsity characteristic of coefficient matrix makes it difficult to analyze pipe flow using the linear method. In this study, a graph theory is introduced to water distribution system analysis in order to prevent from producing ill-conditioned coefficient matrix and the technique is developed to produce positive-definite matrix. To test applicability of developed method, this method is applied to 22 pipes and 142 pipes system located nearby Taegu city. The results obtained from these applications show that the method can calculate flowrate effectively without failure in converage. Thus it is expected that the method can analyze steady state flowrate and pressure in pipe network systems efficiently. Keywords : pipe flow analysis, graph theory, linear method.

  • PDF

A Robust Pole Placement for Uncertain Linear Systems via Linear Matrix Inequalities (선형행렬부등식에 의한 불확실한 선형시스템의 견실한 극점배치)

  • 류석환
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.11a
    • /
    • pp.476-479
    • /
    • 2000
  • This paper deals with a robust pole placement method for uncertain linear systems. For all admissible uncertain parameters, a static output feedback controller is designed such that all the poles of the closed loop system are located within the prespecfied disk. It is shown that the existence of a positive definite matrix belonging to a convex set such that its inverse belongs to another convex set guarantees the existence of the output feedback gain matrix for our control problem. By a sequence of convex optimization the aforementioned matrix is obtained. A numerical example is solved in order to illustrate efficacy of our design method.

  • PDF

Comparison study of modeling covariance matrix for multivariate longitudinal data (다변량 경시적 자료 분석을 위한 공분산 행렬의 모형화 비교 연구)

  • Kwak, Na Young;Lee, Keunbaik
    • The Korean Journal of Applied Statistics
    • /
    • v.33 no.3
    • /
    • pp.281-296
    • /
    • 2020
  • Repeated outcomes from the same subjects are referred to as longitudinal data. Analysis of the data requires different methods unlike cross-sectional data analysis. It is important to model the covariance matrix because the correlation between the repeated outcomes must be considered when estimating the effects of covariates on the mean response. However, the modeling of the covariance matrix is tricky because there are many parameters to be estimated, and the estimated covariance matrix should be positive definite. In this paper, we consider analysis of multivariate longitudinal data via two modeling methodologies for the covariance matrix for multivariate longitudinal data. Both methods describe serial correlations of multivariate longitudinal outcomes using a modified Cholesky decomposition. However, the two methods consider different decompositions to explain the correlation between simultaneous responses. The first method uses enhanced linear covariance models so that the covariance matrix satisfies a positive definiteness condition; in addition, and principal component analysis and maximization-minimization algorithm (MM algorithm) were used to estimate model parameters. The second method considers variance-correlation decomposition and hypersphere decomposition to model covariance matrix. Simulations are used to compare the performance of the two methodologies.

An Analysis Algorithm to Overcome the Singularity of Time Integrations for Dynamics Problems (동역학 문제의 시간적분 특이성을 극복하기 위한 해석 알고리듬)

  • 엄기상;윤성호
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2004.04a
    • /
    • pp.1-8
    • /
    • 2004
  • For the linearized differential algebraic equation of the nonlinear constrained system, exact initial values of the acceleration are needed to solve itself. It may be very troublesome to perform the inverse operation for obtaining the incremental quantities since the mass matrix contains the zero element in the diagonal. This fact makes the mass matrix impossible to be positive definite. To overcome this singularity phenomenon the mass matrix needs to be modified to allow the feasible application of predictor and corrector in the iterative computation. In this paper the proposed numerical algorithm based on the modified mass matrix combines the conventional implicit algorithm, Newton-Raphson method and Newmark method. The numerical example presents reliabilities for the proposed algorithm via comparisons of the 4th order Runge-kutta method. The proposed algorithm seems to be satisfactory even though the acceleration, Lagrange multiplier, and energy show unstable behaviour. Correspondingly, it provides one important clue to another algorithm for the enhancement of the numerical results.

  • PDF

A primal-dual log barrier algorithm of interior point methods for linear programming (선형계획을 위한 내부점법의 원문제-쌍대문제 로그장벽법)

  • 정호원
    • Korean Management Science Review
    • /
    • v.11 no.3
    • /
    • pp.1-11
    • /
    • 1994
  • Recent advances in linear programming solution methodology have focused on interior point methods. This powerful new class of methods achieves significant reductions in computer time for large linear programs and solves problems significantly larger than previously possible. These methods can be examined from points of Fiacco and McCormick's barrier method, Lagrangian duality, Newton's method, and others. This study presents a primal-dual log barrier algorithm of interior point methods for linear programming. The primal-dual log barrier method is currently the most efficient and successful variant of interior point methods. This paper also addresses a Cholesky factorization method of symmetric positive definite matrices arising in interior point methods. A special structure of the matrices, called supernode, is exploited to use computational techniques such as direct addressing and loop-unrolling. Two dense matrix handling techniques are also presented to handle dense columns of the original matrix A. The two techniques may minimize storage requirement for factor matrix L and a smaller number of arithmetic operations in the matrix L computation.

  • PDF

Modeling of random effects covariance matrix in marginalized random effects models

  • Lee, Keunbaik;Kim, Seolhwa
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.3
    • /
    • pp.815-825
    • /
    • 2016
  • Marginalized random effects models (MREMs) are often used to analyze longitudinal categorical data. The models permit direct estimation of marginal mean parameters and specify the serial correlation of longitudinal categorical data via the random effects. However, it is not easy to estimate the random effects covariance matrix in the MREMs because the matrix is high-dimensional and must be positive-definite. To solve these restrictions, we introduce two modeling approaches of the random effects covariance matrix: partial autocorrelation and the modified Cholesky decomposition. These proposed methods are illustrated with the real data from Korean genomic epidemiology study.

Robust Optimal Control of Robot Manipulators with a Weighting Matrix Determination Algorithm

  • Kim, Mi-Kyung;Kang, Hee-Jun
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.5 no.3
    • /
    • pp.77-84
    • /
    • 2004
  • A robust optimal control design is proposed in this study for rigid robotic systems under the unknown loads and the other uncertainties. The uncertainties are reflected in the performance index, where the uncertainties are bounded for the quadratic square of the states with a positive definite weighting matrix. An iterative algorithm is presented for the determination of the weighting matrix required for necessary robustness. Computer simulations have been done for a weight-lifting operation of a two-link manipulator and the simulation results shows that the proposed algorithm is very effective for a robust control of robotic systems.

SPECTRAL ANALYSIS OF THE MGSS PRECONDITIONER FOR SINGULAR SADDLE POINT PROBLEMS

  • RAHIMIAN, MARYAM;SALKUYEH, DAVOD KHOJASTEH
    • Journal of applied mathematics & informatics
    • /
    • v.38 no.1_2
    • /
    • pp.175-187
    • /
    • 2020
  • Recently Salkuyeh and Rahimian in (Comput. Math. Appl. 74 (2017) 2940-2949) proposed a modification of the generalized shift-splitting (MGSS) method for solving singular saddle point problems. In this paper, we present the spectral analysis of the MGSS preconditioner when it is applied to precondition the singular saddle point problems with the (1, 1) block being symmetric. Some eigenvalue bounds for the spectrum of the preconditioned matrix are given. We show that all the real eigenvalues of the preconditioned matrix are in a positive interval and all nonzero eigenvalues having nonzero imaginary part are contained in an intersection of two circles.

Receding Horizon $H_{\infty}$ Predictive Control for Linear State-delay Systems

  • Lee, Young-Sam
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2081-2086
    • /
    • 2005
  • This paper proposes the receding horizon $H_{\infty}$ predictive control (RHHPC) for systems with a state-delay. We first proposes a new cost function for a finite horizon dynamic game problem. The proposed cost function includes two terminal weighting terns, each of which is parameterized by a positive definite matrix, called a terminal weighting matrix. Secondly, we derive the RHHPC from the solution to the finite dynamic game problem. Thirdly, we propose an LMI condition under which the saddle point value satisfies the well-known nonincreasing monotonicity. Finally, we shows the asymptotic stability and $H_{\infty}$-norm boundedness of the closed-loop system controlled by the proposed RHHPC. Through a numerical example, we show that the proposed RHHC is stabilizing and satisfies the infinite horizon $H_{\infty}$-norm bound.

  • PDF

NEWTON SCHULZ METHOD FOR SOLVING NONLINEAR MATRIX EQUATION Xp + AXA = Q

  • Kim, Hyun-Min;Kim, Young-jin;Meng, Jie
    • Journal of the Korean Mathematical Society
    • /
    • v.55 no.6
    • /
    • pp.1529-1540
    • /
    • 2018
  • The matrix equation $X^p+A^*XA=Q$ has been studied to find the positive definite solution in several researches. In this paper, we consider fixed-point iteration and Newton's method for finding the matrix p-th root. From these two considerations, we will use the Newton-Schulz algorithm (N.S.A). We will show the residual relation and the local convergence of the fixed-point iteration. The local convergence guarantees the convergence of N.S.A. We also show numerical experiments and easily check that the N.S. algorithm reduce the CPU-time significantly.