• Current Optics and Photonics
• /
• v.5 no.3
• /
• pp.322-328
• /
• 2021

In this paper, a pretreatment method for a matrix in convex optimization is proposed to optimize the spectral reconstruction process of a disordered dispersion spectrometer. Unlike the reconstruction process of traditional spectrometers using Fourier transforms, the reconstruction process of disordered dispersion spectrometers involves solving a large-scale matrix equation. However, since the matrices in the matrix equation are obtained through measurement, they contain uncertainties due to out of band signals, background noise, rounding errors, temperature variations and so on. It is difficult to solve such a matrix equation by using ordinary nonstationary iterative methods, owing to instability problems. Although the smoothing Tikhonov regularization approach has the ability to approximatively solve the matrix equation and reconstruct most simple spectral shapes, it still suffers the limitations of reconstructing complex and irregular spectral shapes that are commonly used to distinguish different elements of detected targets with mixed substances by characteristic spectral peaks. Therefore, we propose a special pretreatment method for a matrix in convex optimization, which has been proved to be useful for reducing the condition number of matrices in the equation. In comparison with the reconstructed spectra gotten by the previous ordinary iterative method, the spectra obtained by the pretreatment method show obvious accuracy.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.9
• /
• pp.14-20
• /
• 2008

In recent days, a wide angle for slim depth in CRT(Cathode ray tube) is required to meet other rapidly growing slim FPD such as LCD and PDP. However, in making the CRT with a wide angle screen, problems, such as a difficulty in forming black matrix, and excessive formation of black matrix, can be occurred. In this work, we designed a new exposure filter systm to avoid these problems for a wide angle CRT. We changed the design concept from a filter-to-Panel method to a Panel-to-fater control method, which can control the Black Matrix to easily satisfy the user's request. This study suggests new filter design method for a wide angle CRT which has good screen qualify.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2008.11a
• /
• pp.545-560
• /
• 2008

O Source import ㅁDirect import form Nastran, ANSYS ㅁDirect import of all the RPM from the files containing the structural results O Solver ㅁDirect computation of all RPM (multiple load case): one matrix resolution with multiple RHS ㅁEfficient solvers (MUMPS, SPARSE, Iterative) ㅁFrequency parallelisms available for very large problems O In practice ㅁSmall problems run on a desktop ㅁLarge problems can exceed 3kHz on a car engine O Easy to mesh ㅁ3D model created in a few minutes thanks to the unequal meshes. O And all Actran standard features

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.663-677
• /
• 2010

In this paper, the generalized SOR-like methods are presented for solving the saddle point problems. Based on the SOR-like methods, we introduce the uncertain parameters and the preconditioned matrixes in the splitting form of the coefficient matrix. The necessary and sufficient conditions for guaranteeing its convergence are derived by giving the restrictions imposed on the parameters. Finally, numerical experiments show that this methods are more effective by choosing the proper values of parameters.

• East Asian mathematical journal
• /
• v.40 no.1
• /
• pp.25-36
• /
• 2024

Full univariate moment problems have been studied using continued fractions, orthogonal polynomials, spectral measures, and so on. On the other hand, the truncated moment problem has been mainly studied through confirming the existence of the extension of the moment matrix. A few articles on the multivariate moment problem implicitly presented about some results of this note, but we would like to rearrange the important results for the existence of a representing measure of a moment sequence. In addition, new techniques with orthogonal polynomials will be introduced to expand the means of studying truncated moment problems.

• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.1
• /
• pp.31-39
• /
• 2000

We present a robust and reliable H$\infty$ state-feedback controller design for linear uncertain systems, which have norm-bounded time-varying uncertainty in the state matrix, and their prespecified sets of actuators are susceptible to failure. These controllers should guarantee robust stability of the systems and H$\infty$ norm bound against parameter uncertainty and/or actuator failures. Based on the linear matrix inequality (LMI) approach, two state-feedback controller design methods are constructed by formulating to a set of LMIs corresponding to all failure cases or a single LMI that covers all failure cases, with an additional costraint. Effectiveness and geometrical property of these controllers are validated via several numerical examples. Furthermore, the proposed LMI frameworks can be applied to multiobjective problems with additional constraints.

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

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.1
• /
• pp.60-71
• /
• 2015

In this paper, a matrix game is considered in which the elements are represented as Z-numbers. The objective is to formalize the human capability for solving decision-making problems in uncertain situations. A ranking method of Z-numbers is proposed and used to define pure and mixed strategies. These strategies are then applied to find the optimal solution to the game problem with an induced pay off matrix using a min max, max min algorithm and the multi-section technique. Numerical examples are given in support of the proposed method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.12
• /
• pp.2040-2047
• /
• 2001

In this paper, a singularity problem of the state transition matrix is investigated in the spatial propagation when the spatial matrix differential equation is constructed via time finite element analysis. A parametric study shows that the degree of singularity of the state transition matrix depends on the degree of flexibility of the structures. As an alternative to avoid the numerical problems due to the singularity, an analytic solution fur spatial propagation of the flexible structures is proposed. In the proposed method, the spatial properties of the structure are analytically expressed by a combination of transcendental functions. The analytic solution serves fast and accurate results by eliminating the possibility of the error accumulation caused by the boundary condition. Several numerical examples are shown to validate the effectiveness of the proposed methods.

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