Home / Journals / CMES / Vol.97, No.2, 2014
Table of Content
  • Open Access

    ARTICLE

    Novel Iterative Algorithms Based on Regularization Total Least Squares for Solving the Numerical Solution of Discrete Fredholm Integral Equation

    Zichun Yang1,2,3, Lei Zhang1,4, Yueyun Cao1
    CMES-Computer Modeling in Engineering & Sciences, Vol.97, No.2, pp. 101-130, 2014, DOI:10.3970/cmes.2014.097.101
    Abstract Discretization of inverse problems often leads to systems of linear equations with a highly ill-conditioned coefficient matrix. To find meaningful solutions of such systems, one kind of prevailing and representative approaches is the so-called regularized total least squares (TLS) method when both the system matrix and the observation term are contaminated by some noises. We will survey two such regularization methods in the TLS setting. One is the iterative truncated TLS (TTLS) method which can solve a convergent sequence of projected linear systems generated by Lanczos bidiagonalization. The other one is to convert the Tikhonov regularization TLS problem to an… More >

  • Open Access

    ARTICLE

    Frequency Domain Based Solution for Certain Class of Wave Equations: An exhaustive study of Numerical Solutions

    Vinita Chellappan1, S. Gopalakrishnan1 and V. Mani1
    CMES-Computer Modeling in Engineering & Sciences, Vol.97, No.2, pp. 131-174, 2014, DOI:10.3970/cmes.2014.097.131
    Abstract The paper discusses the frequency domain based solution for a certain class of wave equations such as: a second order partial differential equation in one variable with constant and varying coefficients (Cantilever beam) and a coupled second order partial differential equation in two variables with constant and varying coefficients (Timoshenko beam). The exact solution of the Cantilever beam with uniform and varying cross-section and the Timoshenko beam with uniform cross-section is available. However, the exact solution for Timoshenko beam with varying cross-section is not available. Laplace spectral methods are used to solve these problems exactly in frequency domain. The numerical… More >

  • Open Access

    ARTICLE

    Enrichment Procedures for Soft Clusters: A Statistical Test and its Applications

    R.D. Phillips1, M.S. Hossain1, L.T. Watson1,2, R.H. Wynne3, Naren Ramakrishnan1
    CMES-Computer Modeling in Engineering & Sciences, Vol.97, No.2, pp. 175-197, 2014, DOI:10.3970/cmes.2014.097.175
    Abstract Clusters, typically mined by modeling locality of attribute spaces, are often evaluated for their ability to demonstrate ‘enrichment’ of categorical features. A cluster enrichment procedure evaluates the membership of a cluster for significant representation in predefined categories of interest. While classical enrichment procedures assume a hard clustering definition, this paper introduces a new statistical test that computes enrichments for soft clusters. Application of the new test to several scientific datasets is given. More >

Share Link

WeChat scan