• Title/Summary/Keyword: Matrix transformations

Search Result 57, Processing Time 0.029 seconds

Some Paranormed Difference Sequence Spaces Derived by Using Generalized Means

  • MANNA, ATANU;MAJI, AMIT;SRIVASTAVA, PARMESHWARY DAYAL
    • Kyungpook Mathematical Journal
    • /
    • v.55 no.4
    • /
    • pp.909-931
    • /
    • 2015
  • This paper presents some new paranormed sequence spaces $X(r,s,t,p;{\Delta})$ where $X{\in}\{l_{\infty}(p),c(p),c_0(p),l(p)\}$ defined by using generalized means and difference operator. It is shown that these are complete linear metric spaces under suitable paranorms. Furthermore, the ${\alpha}$-, ${\beta}$-, ${\gamma}$-duals of these sequence spaces are computed and also obtained necessary and sufficient conditions for some matrix transformations from $X(r,s,t,p;{\Delta})$ to X. Finally, it is proved that the sequence space $l(r,s,t,p;{\Delta})$ is rotund when $p_n$ > 1 for all n and has the Kadec-Klee property.

Interest Point Detection Using Hough Transform and Invariant Patch Feature for Image Retrieval

  • Nishat, Ahmad;An, Young-Eun;Park, Jong-An
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.1
    • /
    • pp.127-135
    • /
    • 2009
  • This paper presents a new technique for corner shape based object retrieval from a database. The proposed feature matrix consists of values obtained through a neighborhood operation of detected corners. This results in a significant small size feature matrix compared to the algorithms using color features and thus is computationally very efficient. The corners have been extracted by finding the intersections of the detected lines found using Hough transform. As the affine transformations preserve the co-linearity of points on a line and their intersection properties, the resulting corner features for image retrieval are robust to affine transformations. Furthermore, the corner features are invariant to noise. It is considered that the proposed algorithm will produce good results in combination with other algorithms in a way of incremental verification for similarity.

  • PDF

사진렌즈 설계에서 SVD에 의한 감쇠최소자승법의 수렴성과 안정성

  • 김태희;김경찬
    • Korean Journal of Optics and Photonics
    • /
    • v.6 no.3
    • /
    • pp.178-187
    • /
    • 1995
  • The method that determines the appropriate damping factor is studied for a lens design. When suitable damping factor is applied to the additive damped least-squares (DLS) method, the convergence and the stability of the optimization process are examined in a triplet-type photographic lens design. We calculate eigenvalues of the product of the Jacobian matrix of error functions by using the singular value decomposition (SVD) method. We adopt the median of eigenvalues as an appropriate damping factor. The convergence and the stability of the optimization process are improved by choosing the adequate damping factor for the optimization of a photographic lens. It is known that the numerical inaccuracy in the calculation of normal equation is overcome by using the orthogonal transformations of the Jacobian matrix. Therefore, a combination of the method for setting a proper damping factor and the orthogonal transformations of the Jacobian matrix is good for application to the design of an aspheric lens with high-order terms. terms.

  • PDF

A MATRIX PENCIL APPROACH COMPUTING THE ELEMENTARY DIVISORS OF A MATRIX : NUMERICAL ASPECTS AND APPLICATIONS

  • Mitrouli, M.;Kalogeropoulos, G.
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.3
    • /
    • pp.717-734
    • /
    • 1998
  • In the present paper is presented a new matrix pencil-based numerical approach achieving the computation of the elemen-tary divisors of a given matrix $A \in C^{n\timesn}$ This computation is at-tained without performing similarity transformations and the whole procedure is based on the construction of the Piecewise Arithmetic Progression Sequence(PAPS) of the associated pencil $\lambda I_n$ -A of matrix A for all the appropriate values of $\lambda$ belonging to the set of eigenvalues of A. This technique produces a stable and accurate numerical algorithm working satisfactorily for matrices with a well defined eigenstructure. The whole technique can be applied for the computation of the first second and Jordan canonical form of a given matrix $A \in C^{n\timesn}$. The results are accurate for matrices possessing a well defined canonical form. In case of defective matrices indications of the most appropriately computed canonical form. In case of defective matrices indication of the most appropriately computed canonical form are given.

DOMAIN OF EULER-TOTIENT MATRIX OPERATOR IN THE SPACE 𝓛p

  • Demiriz, Serkan;Erdem, Sezer
    • Korean Journal of Mathematics
    • /
    • v.28 no.2
    • /
    • pp.361-378
    • /
    • 2020
  • The most apparent aspect of the present study is to introduce a new sequence space 𝚽(𝓛p) derived by double Euler-Totient matrix operator. We examine its topological and algebraic properties and give an inclusion relation. In addition to those, the α-, β(bp)- and γ-duals of the space 𝚽(𝓛p) are determined and finally, some 4-dimensional matrix mapping classes related to this space are characterized.

LINEAR PRESERVERS OF BOOLEAN RANK BETWEEN DIFFERENT MATRIX SPACES

  • Beasley, LeRoy B.;Kang, Kyung-Tae;Song, Seok-Zun
    • Journal of the Korean Mathematical Society
    • /
    • v.52 no.3
    • /
    • pp.625-636
    • /
    • 2015
  • The Boolean rank of a nonzero $m{\times}n$ Boolean matrix A is the least integer k such that there are an $m{\times}k$ Boolean matrix B and a $k{\times}n$ Boolean matrix C with A = BC. We investigate the structure of linear transformations T : $\mathbb{M}_{m,n}{\rightarrow}\mathbb{M}_{p,q}$ which preserve Boolean rank. We also show that if a linear transformation preserves the set of Boolean rank 1 matrices and the set of Boolean rank k matrices for any k, $2{\leq}k{\leq}$ min{m, n} (or if T strongly preserves the set of Boolean rank 1 matrices), then T preserves all Boolean ranks.

On the Fibonacci Almost Convergent Sequence Space and Fibonacci Core

  • DEMIRIZ, SERKAN;KARA, EMRAH EVREN;BASARIR, METIN
    • Kyungpook Mathematical Journal
    • /
    • v.55 no.2
    • /
    • pp.355-372
    • /
    • 2015
  • In the present paper, by using the Fibonacci difference matrix, we introduce the almost convergent sequence space $\hat{c}^f$. Also, we show that the spaces $\hat{c}^f$and $\hat{c}$ are linearly isomorphic. Further, we determine the ${\beta}$-dual of the space $\hat{c}^f$ and characterize some matrix classses on this space. Finally, Fibonacci core of a complex-valued sequence has been introduced, and we prove some inclusion theorems related to this new type of core.

Enhanced generalized modeling method for compliant mechanisms: Multi-Compliant-Body matrix method

  • Lim, Hyunho;Choi, Young-Man
    • Structural Engineering and Mechanics
    • /
    • v.82 no.4
    • /
    • pp.503-515
    • /
    • 2022
  • The multi-rigid-body matrix method (MRBMM) is a generalized modeling method for obtaining the displacements, forces, and dynamic characteristics of a compliant mechanism without performing inner-force analysis. The method discretizes a compliant mechanism of any type into flexure hinges and rigid bodies by implementing a multi-body mass-spring model using coordinate transformations in a matrix form. However, in this method, the deformations of bodies that are assumed to be rigid are inherently omitted. Consequently, it may yield erroneous results in certain mechanisms. In this paper, we present a multi-compliant-body matrix-method (MCBMM) that considers a rigid body as a compliant element, while retaining the generalized framework of the MRBMM. In the MCBMM, a rigid body in the MRBMM is segmented into a certain number of body nodes and flexure hinges. The proposed method was verified using two examples: the first (an XY positioning stage) demonstrated that the MCBMM outperforms the MRBMM in estimating the static deformation and dynamic mode. In the second example (a bridge-type displacement amplification mechanism), the MCBMM estimated the displacement amplification ratio more accurately than several previously proposed modeling methods.

A Study on 40Cr Alloy steel of Laser Surface Hardening (40Cr 강의 Laser Surface Hardening 에 관한 연구)

  • Ryu, Nung-Hee;Kang, Sung-Goon
    • Korean Journal of Materials Research
    • /
    • v.11 no.11
    • /
    • pp.1001-1005
    • /
    • 2001
  • In this study, the surface of 40Cr steel was hardened by $CO_2$Laser, and then the microstructural transformations and the hardness distributions of the laser surface hardened layer were observed. The experimental results showed the surface hardening layer was consisted of three parts, which is outmost surface layer of needle martensite, middle layer of martensite and remained pearlite, and transitory boundary layer. In hardness distributions, the surface hardeness of the surface hardening layer had Hv 800~1000, that was 2 to 4 times of matrix's hardness. The hardeness distribution of laser hardening layer that of surface layer hardened by general heat treatment.

  • PDF