• Journal of applied mathematics & informatics
• /
• 제5권3호
• /
• pp.571-584
• /
• 1998

We look for methods and conditions to make use of cyclicity in come matrix problems not only for parallel computa-tion but also to reduce the problem size and accelerate convergence. It has been shown that some form of reducibility not necessarily cyclicity is enough for such purposes.

• Communications for Statistical Applications and Methods
• /
• 제10권2호
• /
• pp.387-397
• /
• 2003

Generally, most of researches that need a variable-clustering process use an exploratory factor analysis technique or a divisive hierarchical variable-clustering method based on a correlation matrix. And some researchers apply a object-clustering method to a distance matrix transformed from a correlation matrix, though this approach is known to be improper. On this paper an agglomerative hierarchical variable-clustering method based on a correlation matrix itself is suggested. It is derived from a geometric concept by using variate-spaces and a characterizing variate.

• 수산해양기술연구
• /
• 제27권2호
• /
• pp.125-131
• /
• 1991

Electrolyte matrix fabrication process can be classifed as hot pressing, tape casting, callendering, electrophoretic deposition. however, these have limits in practice. Hot pressing is cumbersome method, because of careful heating and cooling. Furthermore, the perfected tile is so fragile that it is difficult to fit in a cell. Therefore this method is not adequate for mass production of the electrolyte matrix. Using electrophoretic deposition method, a very thin matrix can be made, but many attempts of the electrolyte embeding were found to be failure. Tape casting and callendering methods are employed in most of the matrix fabrication for the present. But these methods require lots of water as a solvent, so that coating of the LiAlO sub(2) with electrolyte is difficult. Recently, hot roll milling method has been developed and the perfected matrix was proved to be free from crack. The method, however, needs a roller to make a matrix and a perfected matrix is carefully striped off from the cooled roller. Therefore, this method requires a long time due to the cooling process. The author proposes a cold rolling process. On this method, heated slurry of the LiAlO sub(2) mixed with binder, is rolled with a cold roller. The heated slurry dose not adhere to the roller, since contacted hot slurry is rapidly solidified. Therefore fabrication speed is increased, without getting rid of merits of the hot rolling process.

• Wind and Structures
• /
• 제39권2호
• /
• pp.125-140
• /
• 2024

The simulation of non-stationary wind velocity is particularly crucial for the wind resistant design of slender structures. Recently, some data-driven simulation methods have received much attention due to their straightforwardness. However, as the number of simulation points increases, it will face efficiency issues. Under such a background, in this paper, a time-varying coherence matrix decomposition method based on Diagonal Proper Orthogonal Decomposition (DPOD) interpolation is proposed for the data-driven simulation of non-stationary wind velocity based on S-transform (ST). Its core idea is to use coherence matrix decomposition instead of the decomposition of the measured time-frequency power spectrum matrix based on ST. The decomposition result of the time-varying coherence matrix is relatively smooth, so DPOD interpolation can be introduced to accelerate its decomposition, and the DPOD interpolation technology is extended to the simulation based on measured wind velocity. The numerical experiment has shown that the reconstruction results of coherence matrix interpolation are consistent with the target values, and the interpolation calculation efficiency is higher than that of the coherence matrix time-frequency interpolation method and the coherence matrix POD interpolation method. Compared to existing data-driven simulation methods, it addresses the efficiency issue in simulations where the number of Cholesky decompositions increases with the increase of simulation points, significantly enhancing the efficiency of simulating multivariate non-stationary wind velocities. Meanwhile, the simulation data preserved the time-frequency characteristics of the measured wind velocity well.

• Journal of applied mathematics & informatics
• /
• 제31권5_6호
• /
• pp.795-812
• /
• 2013

The merit function arises from the development of the solution methods for the complementarity problems defined over the cone of non negative real vectors and has been well extended to the complementarity problems defined over the symmetric cones. In this paper, we focus on the extension of the merit functions including the gap function, the regularized gap function, the implicit Lagrangian and others to the complementarity problems defined over the nonsymmetric matrix cone. These theoretical results of this paper suggest new solution methods based on unconstrained and/or simply constrained methods to solve the matrix cone complementarity problems (MCCP).

• 응용통계연구
• /
• 제25권3호
• /
• pp.531-541
• /
• 2012

In this study, we consider various methods to estimate the weights of a pairwise comparison matrix in the Analytic Hierarchy Process widely applied in various decision-making fields. This paper uses a data dependent simulation to evaluate the statistical accuracy, minimum violation and minimum norm of the obtaining weight methods from a reciprocal symmetric matrix. No method dominates others in all criteria. Least squares methods perform best in point of mean squared errors; however, the eigenvectors method has an advantage in the minimum norm.

• Journal of applied mathematics & informatics
• /
• 제32권3_4호
• /
• pp.389-403
• /
• 2014

In this paper, we first provide comparison results of preconditioned AOR methods with direct preconditioners $I+{\beta}L$, $I+{\beta}U$ and $I+{\beta}(L+U)$ for solving a linear system whose coefficient matrix is a large sparse irreducible L-matrix, where ${\beta}$ > 0. Next we propose how to find a near optimal parameter ${\beta}$ for which Krylov subspace method with these direct preconditioners performs nearly best. Lastly numerical experiments are provided to compare the performance of preconditioned iterative methods and to illustrate the theoretical results.

• 한국소음진동공학회논문집
• /
• 제19권10호
• /
• pp.1021-1027
• /
• 2009

Finite element models of dynamic systems can be updated in two stages. In the first stage, mass and stiffness matrices are updated neglecting damping. In the second stage, a damping matrix is estimated with the mass and stiffness matrices fixed. Methods to estimate a damping matrix for this purpose are proposed in this paper. For a system with proportional damping, a damping matrix is estimated using the modal parameters extracted from the measured responses and the modal matrix calculated from the mass and stiffness matrices from the first stage. For a system with non-proportional damping, a damping matrix is estimated from the impedance matrix which is the inverse of the FRF matrix. Only one low or one column of the FRF matrix is measured, and the remaining FRFs are synthesized to obtain a full FRF matrix. This procedure to obtain a full FRF matrix saves time and effort to measure FRFs.

• 경영과학
• /
• 제14권2호
• /
• pp.69-79
• /
• 1997

The computational speed of interior point method of linear programming depends on the speed of Cholesky factorization. If the coefficient matrix A has dense columns then the matrix A.THETA. $A^{T}$ becomes a dense matrix. This causes Cholesky factorization to be slow. We study an efficient implementation method of the dense column splitting among dense column resolving technique and analyze the relation between dense column splitting and order methods to improve the sparsity of Cholesky factoror.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1319-1330
• /
• 2009

In [2] A.Hadjidimos proposed the generalized accelerated over-relaxation (GAOR) methods which generalize the basic iterative method for the solution of linear systems. In this paper we consider the convergence of the two parallel accelerated generalized AOR iterative methods and obtain some convergence theorems for the case when the coefficient matrix A is a block diagonally dominant matrix or a generalized block diagonally dominant matrix.