• 제목/요약/키워드: Kronecker

검색결과 108건 처리시간 0.027초

PARALLEL PERFORMANCE OF THE Gℓ-PCG METHOD FOR IMAGE DEBLURRING PROBLEMS

  • YUN, JAE HEON
    • Journal of applied mathematics & informatics
    • /
    • 제36권3_4호
    • /
    • pp.317-330
    • /
    • 2018
  • We first provide how to apply the global preconditioned conjugate gradient ($G{\ell}-PCG$) method with Kronecker product preconditioners to image deblurring problems with nearly separable point spread functions. We next provide a coarse-grained parallel image deblurring algorithm using the $G{\ell}-PCG$. Lastly, we provide numerical experiments for image deblurring problems to evaluate the effectiveness of the $G{\ell}-PCG$ with Kronecker product preconditioner by comparing its performance with those of the $G{\ell}-CG$, CGLS and preconditioned CGLS (PCGLS) methods.

Buckling analysis of arbitrary point-supported plates using new hp-cloud shape functions

  • Jamshidi, Sajad;Fallah, N.
    • Structural Engineering and Mechanics
    • /
    • 제70권6호
    • /
    • pp.711-722
    • /
    • 2019
  • Considering stress singularities at point support locations, buckling solutions for plates with arbitrary number of point supports are hard to obtain. Thus, new Hp-Cloud shape functions with Kronecker delta property (HPCK) were developed in the present paper to examine elastic buckling of point-supported thin plates in various shapes. Having the Kronecker delta property, this specific Hp-Cloud shape functions were constructed through selecting particular quantities for influence radii of nodal points as well as proposing appropriate enrichment functions. Since the given quantities for influence radii of nodal points could bring about poor quality of interpolation for plates with sharp corners, the radii were increased and the method of Lagrange multiplier was used for the purpose of applying boundary conditions. To demonstrate the capability of the new Hp-Cloud shape functions in the domain of analyzing plates in different geometry shapes, various test cases were correspondingly investigated and the obtained findings were compared with those available in the related literature. Such results concerning these new Hp-Cloud shape functions revealed a significant consistency with those reported by other researchers.

Tucker Modeling based Kronecker Constrained Block Sparse Algorithm

  • Zhang, Tingping;Fan, Shangang;Li, Yunyi;Gui, Guan;Ji, Yimu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권2호
    • /
    • pp.657-667
    • /
    • 2019
  • This paper studies synthetic aperture radar (SAR) imaging problem which the scatterers are often distributed in block sparse pattern. To exploiting the sparse geometrical feature, a Kronecker constrained SAR imaging algorithm is proposed by combining the block sparse characteristics with the multiway sparse reconstruction framework with Tucker modeling. We validate the proposed algorithm via real data and it shows that the our algorithm can achieve better accuracy and convergence than the reference methods even in the demanding environment. Meanwhile, the complexity is smaller than that of the existing methods. The simulation experiments confirmed the effectiveness of the algorithm as well.

A TOPOLOGICAL MIRROR SYMMETRY ON NONCOMMUTATIVE COMPLEX TWO-TORI

  • Kim, Eun-Sang;Kim, Ho-Il
    • 대한수학회지
    • /
    • 제43권5호
    • /
    • pp.951-965
    • /
    • 2006
  • In this paper, we study a topological mirror symmetry on noncommutative complex tori. We show that deformation quantization of an elliptic curve is mirror symmetric to an irrational rotation algebra. From this, we conclude that a mirror reflection of a noncommutative complex torus is an elliptic curve equipped with a Kronecker foliation.

A SIMPLE METHOD FOR OBTAINING PROJECTION MATRIX USING ALGEBRAIC PROPERTIES

  • Hasik, Sun-Woo
    • Journal of applied mathematics & informatics
    • /
    • 제8권2호
    • /
    • pp.651-658
    • /
    • 2001
  • The projection matrix plays an important role in the linear model theory. In this paper we derive an algebraic relationship between the projection matrices of submatrices of the design matrix. Using this relationship we can easily obtain the projection matrices of any submatrices of the design matrix. Also we show that every projection matrix can be obtained as a linear combination of Kronecker products of identity matrices and matrices with all elements equal to 1.

단순한 메트릭스 계승접근에 의한 고속 아다마르 변환 (A Simple Matrix Factorization Approach to Fast Hadamard Transform)

  • Lee, Moon-Ho
    • 대한전자공학회논문지
    • /
    • 제24권1호
    • /
    • pp.173-176
    • /
    • 1987
  • This paper presents a simple factorization of the Hadamard matrix which is used to develop a fast algorithm for the Hadamard transform. This matrix decomposition is of the kronecker products of identity matrices and successively lower order Hadamard matrices. This following shows how the Kronecker product can be mathematically defined and efficiently implemented using a factorization matrix methods.

  • PDF

ON DICHOTOMY AND CONDITIONING FOR TWO-POINT BOUNDARY VALUE PROBLEMS ASSOCIATED WITH FIRST ORDER MATRIX LYAPUNOV SYSTEMS

  • Murty, M.S.N.;Kumar, G. Suresh
    • 대한수학회지
    • /
    • 제45권5호
    • /
    • pp.1361-1378
    • /
    • 2008
  • This paper deals with the study of dichotomy and conditioning for two-point boundary value problems associated with first order matrix Lyapunov systems, with the help of Kronecker product of matrices. Further, we obtain close relationship between the stability bounds of the problem on one hand, and the growth behaviour of the fundamental matrix solution on the other hand.

ARTIN SYMBOLS OVER IMAGINARY QUADRATIC FIELDS

  • Dong Sung Yoon
    • East Asian mathematical journal
    • /
    • 제40권1호
    • /
    • pp.95-107
    • /
    • 2024
  • Let K be an imaginary quadratic field with ring of integers 𝓞K and N be a positive integer. By K(N) we mean the ray class field of K modulo N𝓞K. In this paper, for each prime p of K relatively prime to N𝓞K we explicitly describe the action of the Artin symbol (${\frac{K_{(N)}/K}{p}}$) on special values of modular functions of level N. Furthermore, we extend the Kronecker congruence relation for the elliptic modular function j to some modular functions of higher level.

Perfect Shuffle에 의한 Reed-Muller 전개식에 관한 다치 논리회로의 설계 (Design of Multiple-Valued Logic Circuits on Reed-Muller Expansions Using Perfect Shuffle)

  • 성현경
    • 정보처리학회논문지A
    • /
    • 제9A권3호
    • /
    • pp.271-280
    • /
    • 2002
  • 본 논문에서는 Perfect Shuffle 기법과 Kronecker 곱에 의한 다치 신호처리회로의 입출력 상호연결에 대하여 논하였고, 다치 신호처리회로의 입출력 상호연결 방법을 이용하여 유한체 GF$(p^m)$상에서 다치 신호처리가 용이한 다치 Reed-Muller 전개식의 회로설계 방법을 제시하였다. 제시된 다치 신호처리회로의 입출력 상호연결 방법은 모듈구조를 기반으로 하여 행렬변환을 이용하면 회로의 가산게이트와 승산게이트를 줄이는데 매우 효과적임을 보인다. GF$(p^m)$상에서 다치 Reed-Muller 전개식에 대한 다치 신호처리회로의 설계는 GF(3)상의 기본 게이트들을 이용하여 다치 Reed-Muller 전개식의 변환행렬과 역변환행렬을 실행하는 기본 셀을 설계하였고, 다치 신호처리회로의 입출력 상호연결 방법을 이용하여 기본 셀들을 상호연결하여 실현하였다. 제안된 다치 신호처리회로는 회선경로 선택의 규칙성, 간단성, 배열의 모듈성과 병렬동작의 특징을 가지므로 VLSI 화에 적합하다

고속 월쉬 변환을 이용한 쌍일차계의 해석에 관한 연구 (A Study on the Analysis of Bilinear Systems via Fast Walsh Transform)

  • 김태훈;심재선
    • 조명전기설비학회논문지
    • /
    • 제16권1호
    • /
    • pp.85-91
    • /
    • 2002
  • 일반적으로 시스템의 해석에 직교 함수를 이용하는 경우에는 크로네커 곱(Kronecker product)에 의하여 고차 행렬에 대한 역변환이 필요하게 되며, 이로 인하여 많은 연산 시간이 필요하게 된다. 본 연구에서는 이 문제점을 해결하고자 고속 월쉬 변환을 이용하는 방법을 제시하였고, 이렇게 함으로써 크로네커 곱에 의한 다루기 힘든 고차 행렬이나 그에 따르는 행렬들의 계산을 필요없게 함으로써 연산의 부담을 줄일 수 있게 된다. 본 연구에서는 쌍일차계의 해석을 위한 직교 함수의 유한 급수 전개 방법과 고속 월쉬 변환 방법을 비교하여 봄으로써 본 연구에서 제안한 방법의 우수성을 표현하였으며, 시뮬레이션을 통하여 고속 월쉬 변환에 와한 쌍일차계 상태 해석 결과를 표시하였다.