• Title/Summary/Keyword: computational algebra

Search Result 140, Processing Time 0.022 seconds

SELF-ADJOINT INTERPOLATION ON Ax = y IN CSL-ALGEBRA ALGL

  • Kang, Joo-Ho;Jo, Young-Soo
    • Journal of applied mathematics & informatics
    • /
    • v.15 no.1_2
    • /
    • pp.503-510
    • /
    • 2004
  • Given vectors x and y in a Hilbert space, an interpolating operator is a bounded operator T such that Tx = y. An interpolating operator for n vectors satisfies the equation $Tx_i\;=\;y_i,\;for\;i\;=\;1,\;2,\;\cdots,\;n$. In this paper the following is proved: Let H be a Hilbert space and L be a commutative subspace lattice on H. Let H and y be vectors in H. Let $M_x\;=\;\{{\sum{n}{i=1}}\;{\alpha}_iE_ix\;:\;n\;{\in}\;N,\;{\alpha}_i\;{\in}\;{\mathbb{C}}\;and\;E_i\;{\in}\;L\}\;and\;M_y\;=\;\{{\sum{n}{i=1}}\;{\alpha}_iE_iy\;:\;n\;{\in}\;N,\;{\alpha}_i\;{\in}\;{\mathbb{C}}\;and\;E_i\;{\in}\;L\}. Then the following are equivalent. (1) There exists an operator A in AlgL such that Ax = y, Af = 0 for all f in ${\overline{M_x}}^{\bot}$, AE = EA for all $E\;{\in}\;L\;and\;A^{*}\;=\;A$. (2) $sup\;\{\frac{{\parallel}{{\Sigma}_{i=1}}^{n}\;{\alpha}_iE_iy{\parallel}}{{\parallel}{{\Sigma}_{i=1}}^{n}\;{\alpha}_iE_iy{\parallel}}\;:\;n\;{\in}\;N,\;{\alpha}_i\;{\in}\;{\mathbb{C}}\;and\;E_i\;{\in}\;L\}\;<\;{\infty},\;{\overline{M_u}}\;{\subset}{\overline{M_x}}$ and < Ex, y >=< Ey, x > for all E in L.

Blocking Probability in an M/D/1/K Queue (M/D/1/K 대기행렬에서의 차단확률)

  • Seo, Dong-Won
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.4
    • /
    • pp.241-247
    • /
    • 2008
  • In this study we consider an M/D/1 queue with a finite buffer. Due to the finiteness of the buffer capacity arriving customers can not join the system and turn away without service when the buffer is full. Even though a computational method for blocking probabilities in an M/D/1/K queue is already known, it is very complex to use. The aim of this study is to propose a new way to compute blocking probability by using (max,+)-algebra. Our approach provide a totally different and easier way to compute blocking probabilities and it is, moreover, immediately applicable to more generous queueing systems.

  • PDF

UNITARY INTERPOLATION FOR VECTORS IN TRIDIAGONAL ALGEBRAS

  • Jo, Young-Soo
    • Journal of applied mathematics & informatics
    • /
    • v.11 no.1_2
    • /
    • pp.431-436
    • /
    • 2003
  • Given vectors x and y in a Hilbert space, an interpolating operator is a bounded operator T such that Tx = y. An interpolating operator for n vectors satisfies the equation $Tx_i\;:\;y_i,\;for\;i\;=\;1,\;2,\;{\cdots},\;n$. In this article, we obtained the following : $Let\;x\;=\;\{x_i\}\;and\;y=\{y_\}$ be two vectors in a separable complex Hilbert space H such that $x_i\;\neq\;0$ for all $i\;=\;1,\;2;\cdots$. Let L be a commutative subspace lattice on H. Then the following statements are equivalent. (1) $sup\;\{\frac{\$\mid${\sum_{k=1}}^l\;\alpha_{\kappa}E_{\kappa}y\$\mid$}{\$\mid${\sum_{k=1}}^l\;\alpha_{\kappa}E_{\kappa}x\$\mid$}\;:\;l\;\in\;\mathbb{N},\;\alpha_{\kappa}\;\in\;\mathbb{C}\;and\;E_{\kappa}\;\in\;L\}\;<\;\infty\;and\;$\mid$y_n\$\mid$x_n$\mid$^{-1}\;=\;1\;for\;all\;n\;=\;1,\;2,\;\cdots$. (2) There exists an operator A in AlgL such that Ax = y, A is a unitary operator and every E in L reduces, A, where AlgL is a tridiagonal algebra.

LEONARD PAIRS GENERATED FROM Uq(sl2)

  • ALQDERAT, AMANI;ALNAJJAR, HASAN
    • Journal of applied mathematics & informatics
    • /
    • v.40 no.5_6
    • /
    • pp.1137-1150
    • /
    • 2022
  • Consider the quantum algebra Uq(sl2) over field 𝓕 (char(𝓕) = 0) with equitable generators x±1, y and z, where q is fixed nonzero, not root of unity scalar in 𝓕. Let V denote a finite dimensional irreducible module for this algebra. Let Λ ∈ End(V), and let {A1, A2, A3} = {x, y, z}. First we show that if Λ, A1 is a Leonard pair, then this Leonard pair have four types, and we show that for each type there exists a Leonard pair Λ, A1 in which Λ is a linear combination of 1, A2, A3, A2A3. Moreover, we use Λ to construct 𝚼 ∈ Uq(sl2) such that 𝚼, A-11 is a Leonard pair, and show that 𝚼 = I + A1Φ + A1ΨA1 where Φ and Ψ are linear combination of 1, A2, A3.

A Study on Feature-Based Multi-Resolution Modelling - Part I: Effective Zones of Features (특징형상기반 다중해상도 모델링에 관한 연구 - Part I: 특징형상의 유효영역)

  • Lee K.Y.;Lee S.H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.10 no.6
    • /
    • pp.432-443
    • /
    • 2005
  • Recent three-dimensional feature-based CAD systems based on solid or non-manifold modelling functionality have been widely used for product design in manufacturing companies. When product models associated with features are used in various downstream applications such as analysis, however, simplified and abstracted models at various levels of detail (LODs) are frequently more desirable and useful than the full detailed model. To provide multi-resolution models, the features need to be rearranged according to a criterion that measures the significance of the feature. However, if the features are rearranged, the resulting shape is possibly different from the original because union and subtraction Boolean operations are not commutative. To solve this problem, in this paper, the new concept of the effective zone of a feature is defined and identified using Boolean algebra. By introducing the effective zone, an arbitrary rearrangement of features becomes possible and arbitrary LOD criteria may be selected to suit various applications. Besides, because the effective zone of a feature is independent of the data structure of the model, the multi-resolution modelling algorithm based on the effective zone can be implemented on any 3D CAD system based on conventional solid representations as well as non-manifold topological (NMT) representations.

Cubes with lattics-point vertices (수격자점을 꼭지점으로 갖는 정육면체의 개수 -지오보드의 활용-)

  • 이만근
    • Journal of Educational Research in Mathematics
    • /
    • v.8 no.1
    • /
    • pp.137-144
    • /
    • 1998
  • A common geoboard puzzel serves as the point of departure for an investigation that lends itself to whole-group discussion with a class of prospective secondary school teachers. Students are provided with opportunities to devise and carry out problem-solving strategies (called 'heuristics' by Polya); exploit inerrelationships among geometry, arithmetic and algebra; formulate generalizations and conjectures; plan and execute an computational project; construct mathematical arguments to establish theorems; and find counter-examples to dispose of a false conjecture. In recent tears, Eugene F. Krause wrote two papers having the same title except for the numeral In that papers he arrives at an theorem about the sizes of squares with lattice point vertices in the coordinate plane, In this paper we follow a different path genearlization to coordinate 3-space

  • PDF

ON SOME PROPERTIES OF SOFT α-IDEALS

  • TOUQEER, M.;ASLAM MALIK, M.
    • Journal of applied mathematics & informatics
    • /
    • v.33 no.5_6
    • /
    • pp.671-686
    • /
    • 2015
  • The notion of soft α-ideals and α-idealistic soft BCI-algebras is introduced and their basic properties are discussed. Relations between soft ideals and soft α-ideals of soft BCI-algebras are provided. Also idealistic soft BCI-algebras and α-idealistic soft BCI-algebras are being related. The restricted intersection, union, restricted union, restricted difference and "AND" operation of soft α-ideals and α-idealistic soft BCI-algebras are established. The characterizations of (fuzzy) α-ideals in BCI-algebras are given by using the concept of soft sets. Relations between fuzzy α-ideals and α-idealistic soft BCI-algebras are discussed.

DEGREE OF VERTICES IN VAGUE GRAPHS

  • BORZOOEI, R.A.;RASHMANLOU, HOSSEIN
    • Journal of applied mathematics & informatics
    • /
    • v.33 no.5_6
    • /
    • pp.545-557
    • /
    • 2015
  • A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, we define two new operation on vague graphs namely normal product and tensor product and study about the degree of a vertex in vague graphs which are obtained from two given vague graphs G1 and G2 using the operations cartesian product, composition, tensor product and normal product. These operations are highly utilized by computer science, geometry, algebra, number theory and operation research. In addition to the existing operations these properties will also be helpful to study large vague graph as a combination of small, vague graphs and to derive its properties from those of the smaller ones.

INT-SOFT MIGHTY FILTERS IN BE-ALGEBRAS

  • KIM, YOUNG HEE;PARK,
    • Journal of applied mathematics & informatics
    • /
    • v.34 no.5_6
    • /
    • pp.527-536
    • /
    • 2016
  • In this paper, we introduce the notions about int-soft mighty filters, int-soft n-fold mighty filters, and int-soft n-fold positive implicative filters of BE-algebras. We investigate their properties and provide conditions which have connecting relationship among int-soft filters, int-soft mighty filters, and int-soft positive implicative filters. Also, characterizations of int-soft n-fold mighty filters and int-soft n-fold positive implicative filters are provided in BE-algebras.

SOME IDEALS OF PSEUDO BCI-ALGEBRAS

  • Lee, Kyoung-Ja;Park, Chul-Hwan
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.217-231
    • /
    • 2009
  • The notion of *-medial pseudo BCI-algebras is introduced, and its characterization is discussed. The concepts of associative pseudo ideals (resp. pseudo p-ideals, pseudo q-ideals and pseudo a-ideals) are introduced, and related properties are investigated. Conditions for a pseudo ideal to be a pseudo p-ideal (resp. pseudo q-ideal) are provided. A characterization of an associative pseudo ideal is given. We finally show that every pseudo BCI-homomorphic image and preimage of an associative pseudo ideal (resp. a pseudo p-ideal, a pseudo q-ideal and a pseudo a-ideal) is also an associative pseudo ideal (resp. a pseudo p-ideal, a pseudo q-ideal and a pseudo a-ideal).

  • PDF