• 제목/요약/키워드: linear space

검색결과 2,424건 처리시간 0.032초

A WEAK COMMON FIXED POINT THEOREM IN NORMED ALMOST LINEAR SPACES

  • Lee, Sang-Han
    • Journal of applied mathematics & informatics
    • /
    • 제4권2호
    • /
    • pp.573-581
    • /
    • 1997
  • In this paper we prove a weak common fixed point theo-rem in a normed almost linear space which is different from the result of S. P. Singh and B.A. Meade [9]. However for a Banach X our theorem is equal to the result of S. P. Singh and B. A. Meade.

A NOTE ON CHAIN TRANSITIVITY OF LINEAR DYNAMICAL SYSTEMS

  • Namjip Koo;Hyunhee Lee
    • 충청수학회지
    • /
    • 제36권2호
    • /
    • pp.99-105
    • /
    • 2023
  • In this paper we study some topological modes of recurrent sets of linear homeomorphisms of a finite-dimensional topological vector space. More precisely, we show that there are no chain transitive linear homeomorphisms of a finite-dimensional Banach space having the shadowing property. Then, we give examples to illustrate our results.

폴드공간의 인지생태론적 특성과 그 효과 (The Cognitive Ecological Characteristics in Folded Space and Their Effects)

  • 김주미
    • 한국실내디자인학회논문집
    • /
    • 제14권3호
    • /
    • pp.181-190
    • /
    • 2005
  • In accordance with the rapid growth of digital media in 1990s, the state of indetermination that is found in digital process has been emphasized in the field of natural science and philosophy. Digitalized space design has been dramatically developed and it raised heated debate and comment on 'folded space' The purpose of this thesis is to explore how the cognitive-ecological factors constitute fold structures in space design of the late 20th century. Syntax of space structure and geometric composition were analyzed to define what types of cognitive-ecological factors are contrived in the process of visual information. In particular, I put higher theoretical emphasis on what characteristics are ensued in the process of structuring spaces than any other subjects. Through theses analyses and discussions, I raised questions on what principles are operating to create new space design that counts on non-linear structure and its formational process. And I also observed what influences these structural principles of design could fundamentally bring to human beings. First, I proposed that we could overcome reductionist space design through cognitive-ecological approach. Some key concepts such as affordance, parallel processing, and redundancy were adopted as defining elements of non-linear structures. As a result of analyses, I found that the cognitive-ecological approach could substitute the reductionist space design of the past. What is also found is that the three variables are the ultimate ecological elements. In addition, as a methodological concept of fold structures, the form of 'topology' was highlighted because it could be a supporting idea to the cognitive-ecological factors. Second, I claimed that non-linear design is more experiential than rational linear design, and it is more efficiently correspondent to human being than any other forms. What is intended and implied in non-linear structure is also indicated.

A NOTE ON GREEDY ALGORITHM

  • Hahm, Nahm-Woo;Hong, Bum-Il
    • 대한수학회보
    • /
    • 제38권2호
    • /
    • pp.293-302
    • /
    • 2001
  • We improve the greedy algorithm which is one of the general convergence criterion for certain iterative sequence in a given space by building a constructive greedy algorithm on a normed linear space using an arithmetic average of elements. We also show the degree of approximation order is still $Ο(1\sqrt{\n}$) by a bounded linear functional defined on a bounded subset of a normed linear space which offers a good approximation method for neural networks.

  • PDF

A note on convexity on linear vector space

  • Hong, Suk-Kang
    • Journal of the Korean Statistical Society
    • /
    • 제1권1호
    • /
    • pp.18-24
    • /
    • 1973
  • Study on convexity has been improved in many statistical fields, such as linear programming, stochastic inverntory problems and decision theory. In proof of main theorem in Section 3, M. Loeve already proved this theorem with the $r$-th absolute moments on page 160 in [1]. Main consideration is given to prove this theorem using convex theorems with the generalized $t$-th mean when some convex properties hold on a real linear vector space $R_N$, which satisfies all properties of finite dimensional Hilbert space. Throughout this paper $\b{x}_j, \b{y}_j$ where $j = 1,2,......,k,.....,N$, denotes the vectors on $R_N$, and $C_N$ also denotes a subspace of $R_N$.

  • PDF

SOME CONVERGENCE THEOREM FOR AND RANDOM VARIABLES IN A HILBERT SPACE WITH APPLICATION

  • Han, Kwang-Hee
    • 호남수학학술지
    • /
    • 제36권3호
    • /
    • pp.679-688
    • /
    • 2014
  • The notion of asymptotically negative dependence for collection of random variables is generalized to a Hilbert space and the almost sure convergence for these H-valued random variables is obtained. The result is also applied to a linear process generated by H-valued asymptotically negatively dependent random variables.

A UNITARY LINEAR SYSTEM ON THE BIDISK

  • Yang, Meehyea;Hong, Bum-Il
    • 호남수학학술지
    • /
    • 제29권4호
    • /
    • pp.511-521
    • /
    • 2007
  • Let S($z_1$, $z_2$) be a power series with operator coefficients such that multiplication by 5($z_1$, $z_2$) is a contractive transformation in the Hilbert space $\mathbf{H}_2$($\mathbb{D}^2$, C). In this paper we show that there exists a Hilbert space D($\mathbb{D}$,$\bar{S}$) which is the state space of extended canonical linear system with a transfer fucntion $\bar{S}$(z).

New Design for Linear Complex Precoding over ABBA Quasi-Orthogonal Space-Time Block Codes

  • 란롱;양장훈;안찬호;김동구
    • 한국통신학회논문지
    • /
    • 제33권12C호
    • /
    • pp.1062-1067
    • /
    • 2008
  • ABBA codes, a class of quasi-orthognal space-time block codes (QoSTBC) proposed by Tirkkonen and others, allow full rate and a fast maximum likelihood (ML) decoding, but do not have full diversity. In this paper, a linear complex precoder is proposed for ABBA codes to achieve full rate and full diversity. Moreover, the same diversity produce as that of orthogonal space-time block code with linear complex precoder (OSTBC-LCP) is achieved. Meanwhile, the size of the linear complex precoder can be reduced by half without affecting performance, which means the same complexity of decoding as that of the conventional ABBA code is guaranteed.