• Journal of Korean Association for Spatial Structures
• /
• v.2 no.1 s.3
• /
• pp.1-7
• /
• 2002

• 전기의세계
• /
• v.23 no.3
• /
• pp.43-52
• /
• 1974

The matrix inversion is very inefficient for computing direct solutions of the large spare systems of linear equations that arise in many network problems as a large electrical power system. Optimally ordered triangular factorization of sparse matrices is more efficient and offers the other important computational advantages in some applications with this method. The direct solutions are computed from sparse matrix factors instead of a full inverse matrix, thereby gaining a significant advantage is speed and computer memory requirements. In this paper, it is shown that the sparse matrix method is superior to the inverse matrix method to solve the linear equations of large sparse networks. In addition, it is shown that the sparse matrix method is superior to the inverse matrix method to solve the linear equations of large sparse networks. In addition, it is shown that the solutions may be applied directly to sove the load flow in an electrical power system. The result of this study should lead to many aplications including short circuit, transient stability, network reduction, reactive optimization and others.

• Nuclear Engineering and Technology
• /
• v.55 no.6
• /
• pp.2172-2194
• /
• 2023

A variational nodal method (VNM) with unstructured-mesh is presented for solving steady-state and dynamic neutron diffusion equations. Orthogonal polynomials are employed for spatial discretization, and the stiffness confinement method (SCM) is implemented for temporal discretization. Coordinate transformation relations are derived to map unstructured triangular nodes to a standard node. Methods for constructing triangular prism space trial functions and identifying unique nodes are elaborated. Additionally, the partitioned matrix (PM) and generalized partitioned matrix (GPM) methods are proposed to accelerate the within-group and power iterations. Neutron diffusion problems with different fuel assembly geometries validate the method. With less than 5 pcm eigenvalue (k_eff) error and 1% relative power error, the accuracy is comparable to reference methods. In addition, a test case based on the kilowatt heat pipe reactor, KRUSTY, is created, simulated, and evaluated to illustrate the method's precision and geometrical flexibility. The Dodds problem with a step transient perturbation proves that the SCM allows for sufficiently accurate power predictions even with a large time-step of approximately 0.1 s. In addition, combining the PM and GPM results in a speedup ratio of 2-3.

• Structural Engineering and Mechanics
• /
• v.65 no.1
• /
• pp.99-110
• /
• 2018

The focus of this paper is on the elements with stable open cracks. To analyze plane problems, two triangular elements with three and six nodes are formulated using force method. Flexibility matrices of the elements are derived by combining the non-cracked flexibility and the additional one due to crack, which is computed by utilizing the local flexibility method. In order to compute the flexibility matrix of the intact element, a basic coordinate system without rigid body motions is required. In this paper, the basic system origin is located at the crack center and one of its axis coincides with the crack surfaces. This selection makes it possible to formulate elements with inclined cracks. It is obvious that the ability of the suggested elements in calculating accurate natural frequencies for cracked structures, make them applicable for vibration-based crack detection.

• East Asian mathematical journal
• /
• v.36 no.3
• /
• pp.417-424
• /
• 2020

Huang et al. proved that the n by n upper triangular matrix ring over a domain is weakly reversible-over-center by using the property of regular matrices. In this article we provide a concrete proof which is able to be available in the related study of centers. Next we extend an example of weakly reversible-over-center, which was argued by Huang et al., to the general case.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.4
• /
• pp.759-767
• /
• 2011

An element of a ring is called strongly nil clean provided that it can be written as the sum of an idempotent and a nilpotent element that commute. A ring is strongly nil clean in case each of its elements is strongly nil clean. We investigate, in this article, the strongly nil cleanness of 2${\times}$2 matrices over local rings. For commutative local rings, we characterize strongly nil cleanness in terms of solvability of quadratic equations. The strongly nil cleanness of a single triangular matrix is studied as well.

• Communications of the Korean Mathematical Society
• /
• v.14 no.2
• /
• pp.311-318
• /
• 1999

Let A be an n$\times$n (0,1) matrix. Let f(A) denote the smallest nonnegative integer k such that per A[$\alpha$｜$\beta$]>0 and A($\alpha$｜$\beta$) is permutation equivalent to a lower triangular matrix for some $\alpha$, $\beta$$\in$Q\ulcorner,\ulcorner. In this case f(A) is called the feedback number of A. In this paper, feedback numbers of some maximal convertible (0,1) matrices are studied.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.4 no.3
• /
• pp.313-321
• /
• 2012

Vibration analysis of a thin-walled structure can be performed with a consistent mass matrix determined by the shape functions of all degrees of freedom (d.o.f.) used for construction of conventional stiffness matrix, or with a lumped mass matrix. In similar way stability of a structure can be analysed with consistent geometric stiffness matrix or geometric stiffness matrix with lumped buckling load, related only to the rotational d.o.f. Recently, the simplified mass matrix is constructed employing shape functions of in-plane displacements for plate deflection. In this paper the same approach is used for construction of simplified geometric stiffness matrix. Beam element, and triangular and rectangular plate element are considered. Application of the new geometric stiffness is illustrated in the case of simply supported beam and square plate. The same problems are solved with consistent and lumped geometric stiffness matrix, and the obtained results are compared with the analytical solution. Also, a combination of simplified and lumped geometric stiffness matrix is analysed in order to increase accuracy of stability analysis.

• Journal of applied mathematics & informatics
• /
• v.32 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.117-123
• /
• 2009

This paper is a study of some properties of a collection of bounded linear operators resulting from terraced matrices M acting through multiplication on ${\ell}^2$; the term terraced matrix refers to a lower triangular infinite matrix with constant row segments. Sufficient conditions are found for M to be posinormal, meaning that $MM^*=M^*PM$ for some positive operator P on ${\ell}^2$; these conditions lead to new sufficient conditions for the hyponormality of M. Sufficient conditions are also found for the adjoint $M^*$ to be posinormal, and it is observed that, unless M is essentially trivial, $M^*$ cannot be hyponormal. A few examples are considered that exhibit special behavior.