<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

🏛️國立陽明交通大學機構典藏

Access type: Metadata onlyAuthor: search.filters.author.Lin, WW

Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item type:Item,
    A novel nonsymmetric K_-Lanczos algorithm for the generalized nonsymmetric K_-eigenvalue problems
    (1997-02-01)
    Ferng, WR
    ;
    Lin, KY
    ;
    Lin, WW
    ;
    應用數學系
    ;
    Department of Applied Mathematics
    In this article, we present a novel algorithm, named nonsymmetric K---Lanczos algorithm, for computing a few extreme eigenvalues of the generalized eigenvalue problem Mx = lambda Lx, where the matrices M and L have the so-called K-+/--structures. We demonstrate a K---tridiagonalization procedure preserves the K-+/--structures. An error bound for the extreme K---Ritz value obtained from this new algorithm is presented. When compared with the class nonsymmetric Lanczos approach, this method has the same order of computational complexity and can be viewed as a special 2 x 2-block nonsymmetric Lanczos algorithm. Numerical experiments with randomly generated K---matrices show that our algorithm converges faster and more accurate than the nonsymmetric Lanczos algorithm. (C) Elsevier Science Inc., 1997
  • Thumbnail Image
    Item type:Item,
    Cellular neural networks: Local patterns for general templates
    (2000-07-01)
    Hsu, CH
    ;
    Juang, J
    ;
    Lin, SS
    ;
    Lin, WW
    ;
    應用數學系
    This work investigates the mosaic local patterns for cellular neural networks with general templates. Our results demonstrate that the set of templates can be divided into many finite regions. In each region, the same family of local patterns can be generated. Conversely, our results further demonstrate that some templates can realize a family of local patterns which can be linearly separated by a hyperplane in the configuration space. This study also proposes algorithms for verifying the linear separability for a given family of local patterns and, when it is separable, for obtaining the associated template.
  • Thumbnail Image
    Item type:Item,
    The spatial entropy of two-dimensional subshifts of finite type
    (2000-12-01)
    Juang, JQ
    ;
    Lin, SS
    ;
    Shieh, SF
    ;
    Lin, WW
    ;
    應用數學系
    In this paper, two recursive formulas for computing the spatial entropy of two-dimensional subshifts of finite type are given. The exact entropy of a nontrivial example arising in cellular neural networks is obtained by using such formulas. We also establish some general theory concerning the spatial entropy of two-dimensional subshifts of finite type. In particular, we show that if either of the transition matrices is rank-one, then the associated exact entropy can be explicitly obtained. The generalization of our results to higher dimension can be similarly obtained. Furthermore, these formulas can be used numerically for estimating the spatial entropy.
  • Thumbnail Image
    Item type:Item,
    A structure-preserving Lanczos-type algorithm with application to control problems
    (1997)
    Ferng, WR
    ;
    Lin, WW
    ;
    Wang, CS
    ;
    應用數學系
    ;
    Department of Applied Mathematics
    A Hamiltonian structure-preserving Lanczos-type method, named the J-Lanczos algorithm, is introduced for solving large sparse Hamiltonian eigenvalue problem which arises in both continuous-time and discrete-time optimal control applications. Shift and invert techniques are incorporated to approximate all stable eigenvalues and the associated invariant subspace. Numerical results for solving high order continuous-time Riccati equation arising from position and velocity control for a string of high speed vechicles are presented.