Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (387)
  • 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… More >

  • Open Access

    ARTICLE

    A Systematic Review of Algorithms with Linear-time Behaviour to Generate Delaunay and Voronoi Tessellations

    S,erson L. Gonzaga de Oliveira1, Jéssica Renata Nogueira1, João Manuel R. S. Tavares2

    CMES-Computer Modeling in Engineering & Sciences, Vol.100, No.1, pp. 31-57, 2014, DOI:10.3970/cmes.2014.100.031

    Abstract Triangulations and tetrahedrizations are important geometrical discretization procedures applied to several areas, such as the reconstruction of surfaces and data visualization. Delaunay and Voronoi tessellations are discretization structures of domains with desirable geometrical properties. In this work, a systematic review of algorithms with linear-time behaviour to generate 2D/3D Delaunay and/or Voronoi tessellations is presented. More >

  • Open Access

    ARTICLE

    The Jordan Structure of Residual Dynamics Used to Solve Linear Inverse Problems

    Chein-Shan Liu1, Su-Ying Zhang2, Satya N. Atluri3

    CMES-Computer Modeling in Engineering & Sciences, Vol.88, No.1, pp. 29-48, 2012, DOI:10.3970/cmes.2012.088.029

    Abstract With a detailed investigation of n linear algebraic equations Bx=b, we find that the scaled residual dynamics for y∈Sn−1 is equipped with four structures: the Jordan dynamics, the rotation group SO(n), a generalized Hamiltonian formulation, as well as a metric bracket system. Therefore, it is the first time that we can compute the steplength used in the iterative method by a novel algorithm based on the Jordan structure. The algorithms preserving the length of y are developed as the structure preserving algorithms (SPAs), which can significantly accelerate the convergence speed and are robust enough against the noise More >

  • Open Access

    ARTICLE

    Identification of Cavities in a Three-Dimensional Layer by Minimization of an Optimal Cost Functional Expansion

    A.E. Martínez-Castro1, I.H. Faris1, R. Gallego1

    CMES-Computer Modeling in Engineering & Sciences, Vol.87, No.3, pp. 177-206, 2012, DOI:10.3970/cmes.2012.087.177

    Abstract In this paper, the identification of hidden defects inside a three-dimen -sional layer is set as an Identification Inverse Problem. This problem is solved by minimizing a cost functional which is linearized with respect to the volume defects, leading to a procedure that requires only computations at the host domain free of defects. The cost functional is stated as the misfit between experimental and computed displacements and spherical and/or ellipsoidal cavities are the defects to locate. The identification of these cavities is based on the measured displacements at a set of points due to time-harmonic… More >

  • Open Access

    ARTICLE

    An Application of Genetic Algorithms and the Method of Fundamental Solutions to Simulate Cathodic Protection Systems

    W.J. Santos1 , J.A.F. Santiago1, J.C.F Telles1

    CMES-Computer Modeling in Engineering & Sciences, Vol.87, No.1, pp. 23-40, 2012, DOI:10.3970/cmes.2012.087.023

    Abstract The aim of this paper is to present numerical simulations of Cathodic Protection (CP) Systems using a Genetic Algorithm (GA) and the Method of Fundamental Solutions (MFS). MFS is used to obtain the solution of the associated homogeneous equation with the non-homogeneous equation subject to nonlinear boundary conditions defined as polarization curves. The adopted GA minimizes a nonlinear error function, whose design variables are the coefficients of the linear superposition of fundamental solutions and the positions of the source points, located outside the problem domain. In this work, the anodes added to the CP system More >

  • Open Access

    ARTICLE

    Upper and Lower Bounds of the Solution for the Superelliptical Plates Problem Using Genetic Algorithms

    H.W. Tang1, Y.T. Yang1, C.K. Chen1

    CMES-Computer Modeling in Engineering & Sciences, Vol.85, No.3, pp. 193-206, 2012, DOI:10.3970/cmes.2012.085.193

    Abstract In this article, a new method combining the Mathematical Programming and the Method of Weighted Residual called MP-MWR is presented. Under the validation of maximum principle, and up on the collocation method, the differential equation can be transferred into a bilateral inequality problem. Applying the genetic algorithms helps to find optimal solutions of upper and lower bounds which satisfy the inequalities. Here, the method is verified by analyzing the deflection of superelliptical clamped plate problem. By using this method, the good approximate solution and its error bounds can be obtained effectively and accurately. More >

  • Open Access

    ARTICLE

    New Optimization Algorithms for Structural Reliability Analysis

    S.R. Santos1, L.C. Matioli2, A.T. Beck3

    CMES-Computer Modeling in Engineering & Sciences, Vol.83, No.1, pp. 23-56, 2012, DOI:10.3970/cmes.2012.083.023

    Abstract Solution of structural reliability problems by the First Order method require optimization algorithms to find the smallest distance between a limit state function and the origin of standard Gaussian space. The Hassofer-Lind-Rackwitz-Fiessler (HLRF) algorithm, developed specifically for this purpose, has been shown to be efficient but not robust, as it fails to converge for a significant number of problems. On the other hand, recent developments in general (augmented Lagrangian) optimization techniques have not been tested in aplication to structural reliability problems. In the present article, three new optimization algorithms for structural reliability analysis are presented.… More >

  • Open Access

    ARTICLE

    Numerical Design of Random Micro-Heterogeneous Materials with Functionally-Graded Effective Thermal Conductivities Using Genetic Algorithms and the Fast Boundary Element Method

    Marco Dondero1, Adrián P. Cisilino1,2, J. Pablo Tomba1

    CMES-Computer Modeling in Engineering & Sciences, Vol.78, No.3&4, pp. 225-246, 2011, DOI:10.3970/cmes.2011.078.225

    Abstract This paper introduces a numerical methodology for the design of random micro-heterogeneous materials with functionally graded effective thermal conductivities (ETC). The optimization is carried out using representative volume elements (RVEs), a parallel Genetic Algorithm (GA) as optimization method, and a Fast Multipole Boundary Element Method (FMBEM) for the evaluation of the cost function. The methodology is applied for the design of foam-like microstructures consisting of random distributions of circular insulated holes. The temperature field along a material sample is used as objective function, while the spatial distribution of the holes is the design variable. There More >

  • Open Access

    ARTICLE

    Finite Element Approximate Inverse Preconditioning for solving 3D Biharmonic Problems on Shared Memory Systems

    G.A. Gravvanis1, K.M. Giannoutakis2

    CMES-Computer Modeling in Engineering & Sciences, Vol.71, No.4, pp. 305-330, 2011, DOI:10.3970/cmes.2011.071.305

    Abstract In this paper we present parallel explicit approximate inverse matrix techniques for solving sparse linear systems on shared memory systems, which are derived using the finite element method for biharmonic equations in three space variables. Our approach for solving such equations is by considering the biharmonic equation as a coupled equation approach (pair of Poisson equation), using a FE approximation scheme, yielding an inner-outer iteration method. Additionally, parallel approximate inverse matrix algorithms are introduced for the efficient solution of sparse linear systems, based on an anti-diagonal computational approach that eliminates the data dependencies. Parallel explicit More >

  • Open Access

    ARTICLE

    Simple "Residual-Norm" Based Algorithms, for the Solution of a Large System of Non-Linear Algebraic Equations, which Converge Faster than the Newton’s Method

    Chein-Shan Liu1, Satya N. Atluri2

    CMES-Computer Modeling in Engineering & Sciences, Vol.71, No.3, pp. 279-304, 2011, DOI:10.3970/cmes.2011.071.279

    Abstract For solving a system of nonlinear algebraic equations (NAEs) of the type: F(x)=0, or Fi(xj) = 0, i,j = 1,...,n, a Newton-like algorithm has several drawbacks such as local convergence, being sensitive to the initial guess of solution, and the time-penalty involved in finding the inversion of the Jacobian matrix ∂Fi/∂xj. Based-on an invariant manifold defined in the space of (x,t) in terms of the residual-norm of the vector F(x), we can derive a gradient-flow system of nonlinear ordinary differential equations (ODEs) governing the evolution of x with a fictitious time-like variable t as an independent variable. More >

Displaying 351-360 on page 36 of 387. Per Page