• Title/Summary/Keyword: Cholesky

Search Result 84, Processing Time 0.033 seconds

The Cholesky rank-one update/downdate algorithm for static reanalysis with modifications of support constraints

  • Liu, Haifeng;Zhu, Jihua;Li, Mingming
    • Structural Engineering and Mechanics
    • /
    • v.62 no.3
    • /
    • pp.297-302
    • /
    • 2017
  • Structural reanalysis is frequently utilized to reduce the computational cost so that the process of design or optimization can be accelerated. The supports can be regarded as the design variables and may be modified in various types of structural optimization problems. The location, number, and type of supports can make a great impact on the performance of the structure. This paper presents a unified method for structural static reanalysis with imposition or relaxation of some support constraints. The information from the initial analysis has been fully utilized and the computational time can be significantly reduced. Numerical examples are used to validate the effectiveness of the proposed method.

A Study on handling dense columns in interior point methods for linear programming (An efficient implementation of Schur complement method) (내부점 방법에서 밀집열 처리에 관한 연구 (Schur 상보법의 효율적인 구현))

  • 설동렬;도승용;박순달
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.67-70
    • /
    • 1998
  • The computational speed of interior point method of linear programming depends on the speed of Cholesky factorization to solve AΘA$^{T}$ $\Delta$y=b. If the coefficient matrix A has dense columns then the matrix AΘA$^{T}$ becomes a dense matrix. This causes Cholesky factorization to be slow. The Schur complement method is applied to treat dense columns in many implementations but suffers from its numerical unstability. We study efficient implementation of Schur complement method. We achieve improvements in computational speed and numerical stability.rical stability.

  • PDF

Karmarkar법의 속도 제고에 관한 연구

  • 우병오;박순달
    • Korean Management Science Review
    • /
    • v.8 no.1
    • /
    • pp.127-133
    • /
    • 1991
  • 본 연구에서는 Karmarkar법의 변형인 Todd&Burrell 알고리즘을 분석하고 이 알고리즘의 수행속도를 증가시키기 위한 몇가지 방안을 제시하였다. 또한, 몇가지 실험을 통하여 제안된 방안들을 비교 분석하였다. 사영행렬의 계산에 QR 분해법과 Cholesky 분해법을 도입함으로써 계산 시간을 줄일 수 있었고, 구내최적화를 위한 개선폭의 결정에 비율검정법과 선형탐색법을 사용함으로써 수행횟수 및 총 수행시간을 줄일 수 있었다. 수행실험을 통하여 알고리즘을 분석한 결과, 수행시간의 대부분을 사영행렬의 계산이 차지하는 것으로 나타나 이론적으로 계산복잡도를 분석한 결과와 일치하였다. 또한, 사영행렬과 개선폭의 결정에 사용된 각 방법들을 실험을 통해 비교 분석한 바로는 사영행렬의 계산에 있어서 Cholesky 분해법이 Gauss소거법이나 QR 분해법을 쓰는 경우보다 우수했으며, 개선폭을 결정하는 데 있어서는 비율검정법이 속도면에서 가장 우수했다.

  • 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.

Comparison of Preconditioned Conjugate Gradient Methods for Adaptive Finite Element Analysis (유한요소 적응분할해석을 위한 선조정 공액구배법들의 비교연구)

  • 주관정
    • Computational Structural Engineering
    • /
    • v.1 no.2
    • /
    • pp.121-130
    • /
    • 1988
  • Adaptive reinements yield a large sparse system of equations. In order to solve such a system, the core storage requirement is an important consideration. Accordingly, an iterative method which minimizes the core storage and provides a high rate of convergence is called for. In this paper the conjugate gradient algorithms with various preconditionings including the incomplete Cholesky decomposition are examined.

  • PDF

Autoregressive Cholesky Factor Modeling for Marginalized Random Effects Models

  • Lee, Keunbaik;Sung, Sunah
    • Communications for Statistical Applications and Methods
    • /
    • v.21 no.2
    • /
    • pp.169-181
    • /
    • 2014
  • Marginalized random effects models (MREM) are commonly used to analyze longitudinal categorical data when the population-averaged effects is of interest. In these models, random effects are used to explain both subject and time variations. The estimation of the random effects covariance matrix is not simple in MREM because of the high dimension and the positive definiteness. A relatively simple structure for the correlation is assumed such as a homogeneous AR(1) structure; however, it is too strong of an assumption. In consequence, the estimates of the fixed effects can be biased. To avoid this problem, we introduce one approach to explain a heterogenous random effects covariance matrix using a modified Cholesky decomposition. The approach results in parameters that can be easily modeled without concern that the resulting estimator will not be positive definite. The interpretation of the parameters is sensible. We analyze metabolic syndrome data from a Korean Genomic Epidemiology Study using this method.

Poisson linear mixed models with ARMA random effects covariance matrix

  • Choi, Jiin;Lee, Keunbaik
    • Journal of the Korean Data and Information Science Society
    • /
    • v.28 no.4
    • /
    • pp.927-936
    • /
    • 2017
  • To analyze longitudinal count data, Poisson linear mixed models are commonly used. In the models the random effects covariance matrix explains both within-subject variation and serial correlation of repeated count outcomes. When the random effects covariance matrix is assumed to be misspecified, the estimates of covariates effects can be biased. Therefore, we propose reasonable and flexible structures of the covariance matrix using autoregressive and moving average Cholesky decomposition (ARMACD). The ARMACD factors the covariance matrix into generalized autoregressive parameters (GARPs), generalized moving average parameters (GMAPs) and innovation variances (IVs). Positive IVs guarantee the positive-definiteness of the covariance matrix. In this paper, we use the ARMACD to model the random effects covariance matrix in Poisson loglinear mixed models. We analyze epileptic seizure data using our proposed model.

Dynamic linear mixed models with ARMA covariance matrix

  • Han, Eun-Jeong;Lee, Keunbaik
    • Communications for Statistical Applications and Methods
    • /
    • v.23 no.6
    • /
    • pp.575-585
    • /
    • 2016
  • Longitudinal studies repeatedly measure outcomes over time. Therefore, repeated measurements are serially correlated from same subject (within-subject variation) and there is also variation between subjects (between-subject variation). The serial correlation and the between-subject variation must be taken into account to make proper inference on covariate effects (Diggle et al., 2002). However, estimation of the covariance matrix is challenging because of many parameters and positive definiteness of the matrix. To overcome these limitations, we propose autoregressive moving average Cholesky decomposition (ARMACD) for the linear mixed models. The ARMACD allows a class of flexible, nonstationary, and heteroscedastic models that exploits the structure allowed by combining the AR and MA modeling of the random effects covariance matrix. We analyze a real dataset to illustrate our proposed methods.

Negative binomial loglinear mixed models with general random effects covariance matrix

  • Sung, Youkyung;Lee, Keunbaik
    • Communications for Statistical Applications and Methods
    • /
    • v.25 no.1
    • /
    • pp.61-70
    • /
    • 2018
  • Modeling of the random effects covariance matrix in generalized linear mixed models (GLMMs) is an issue in analysis of longitudinal categorical data because the covariance matrix can be high-dimensional and its estimate must satisfy positive-definiteness. To satisfy these constraints, we consider the autoregressive and moving average Cholesky decomposition (ARMACD) to model the covariance matrix. The ARMACD creates a more flexible decomposition of the covariance matrix that provides generalized autoregressive parameters, generalized moving average parameters, and innovation variances. In this paper, we analyze longitudinal count data with overdispersion using GLMMs. We propose negative binomial loglinear mixed models to analyze longitudinal count data and we also present modeling of the random effects covariance matrix using the ARMACD. Epilepsy data are analyzed using our proposed model.

Bayesian baseline-category logit random effects models for longitudinal nominal data

  • Kim, Jiyeong;Lee, Keunbaik
    • Communications for Statistical Applications and Methods
    • /
    • v.27 no.2
    • /
    • pp.201-210
    • /
    • 2020
  • Baseline-category logit random effects models have been used to analyze longitudinal nominal data. The models account for subject-specific variations using random effects. However, the random effects covariance matrix in the models needs to explain subject-specific variations as well as serial correlations for nominal outcomes. In order to satisfy them, the covariance matrix must be heterogeneous and high-dimensional. However, it is difficult to estimate the random effects covariance matrix due to its high dimensionality and positive-definiteness. In this paper, we exploit the modified Cholesky decomposition to estimate the high-dimensional heterogeneous random effects covariance matrix. Bayesian methodology is proposed to estimate parameters of interest. The proposed methods are illustrated with real data from the McKinney Homeless Research Project.