Chein-Shan Liu¹, Satya N. Atluri²

CMES-Computer Modeling in Engineering & Sciences, Vol.73, No.4, pp. 395-432, 2011, DOI:10.3970/cmes.2011.073.395

Abstract In this paper we solve a system of nonlinear algebraic equations (NAEs) of a vector-form: F(x) = 0. Based-on an invariant manifold defined in the space of (x,t) in terms of the residual-norm of the vector F(x), we derive a system of nonlinear ordinary differential equations (ODEs) with a fictitious time-like variable t as an independent variable: x^· = λ[αF + (1−α)B^TF], where λ and α are scalars and B_ij = ∂F_i/∂x_j. From this set of nonlinear ODEs, we derive a purely iterative algorithm for finding the solution vector x, without having to invert the Jacobian… More >

Chein-Shan Liu¹, Satya N. Atluri²

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 F_i(x_j) = 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 ∂F_i/∂x_j. 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 >

Ying-Hsiu Shen¹, Chein-Shan Liu^1,2

CMES-Computer Modeling in Engineering & Sciences, Vol.71, No.2, pp. 157-178, 2011, DOI:10.3970/cmes.2011.071.157

Abstract When the local differential quadrature (LDQ) has been successfully applied to solve two-dimensional problems, the global method of DQ still has a problem by requiring to solve the inversions of ill-posed matrices. Previously, when one uses (n-1)th order polynomial test functions to determine the weighting coefficients with n grid points, the resultant n ×n Vandermonde matrix is highly ill-conditioned and its inversion is hard to solve. Now we use (m-1)th order polynomial test functions by n grid points that the size of Vandermonde matrix is m×n, of which m is much less than n. We More >

S. Abbasbandy^1,2, V. Sladek³, A. Shirzadi¹, J. Sladek³

CMES-Computer Modeling in Engineering & Sciences, Vol.71, No.1, pp. 15-38, 2011, DOI:10.3970/cmes.2011.071.015

Abstract This paper deals with the development of a new method for solution of initial-boundary value problems governed by a couple of nonlinear diffusion equations occurring in the theory of self-organization in non-equilibrium systems. The time dependence is treated by linear interpolation using the finite difference method and the semi-discrete partial differential equations are considered in a weak sense by using the local integral equation method with approximating 2-d spatial variations of the field variables by the Moving Least Squares. The evaluation techniques are discussed and the applicability of the presented method is demonstrated on two More >

A. Grebennikov¹

The International Conference on Computational & Experimental Engineering and Sciences, Vol.15, No.3, pp. 85-90, 2010, DOI:10.3970/icces.2010.015.085

Abstract New General Ray (GR) method for solution of the Dirichlet boundary value problem for the class of elliptic Partial Differential Equations (PDE) is proposed. GR-method consists in application of the Radon transform directly to the PDE and in reduction PDE to assemblage of Ordinary Differential Equations (ODE). The class of the PDE includes the Laplace, Poisson and Helmgoltz equations. GR-method presents the solution of the Dirichlet boundary value problem for this type of equations by explicit analytical formulas that use the direct and inverse Radon transform. Proposed version of GR-method justified theoretically, realized by fast algorithms and More >

Hrvoje Gotovac¹, Vedrana Kozulić², Blaž Gotovac¹

CMC-Computers, Materials & Continua, Vol.15, No.3, pp. 173-198, 2010, DOI:10.3970/cmc.2010.015.173

Abstract The space-time Adaptive Fup Collocation Method (AFCM) for solving boundary-initial value problems is presented. To solve the one-dimensional initial boundary value problem, we convert the problem into a two-dimensional boundary value problem. This quasi-boundary value problem is then solved simultaneously in the space-time domain with a collocation technique and by using atomic Fup basis functions. The proposed method is a generally meshless methodology because it requires only the addition of collocation points and basis functions over the domain, instead of the classical domain discretization and numerical integration. The grid is adapted progressively by setting the More >

Dan Gordon¹, Rachel Gordon²

CMES-Computer Modeling in Engineering & Sciences, Vol.53, No.1, pp. 23-46, 2009, DOI:10.3970/cmes.2009.053.023

Abstract Linear systems with very large off-diagonal elements and discontinuous coefficients (LODC systems) arise in some modeling cases, such as those involving heterogeneous media. Such problems are usually solved by domain decomposition methods, but these can be difficult to implement on unstructured grids or when the boundaries between subdomains have a complicated geometry. Gordon and Gordon have shown that Björck and Elfving's (sequential) CGMN algorithm and their own block-parallel CARP-CG are very robust and efficient on strongly convection dominated cases (but without discontinuous coefficients). They have also shown that scaling the equations by dividing each equation… More >

R. Prosser¹

FDMP-Fluid Dynamics & Materials Processing, Vol.5, No.4, pp. 411-424, 2009, DOI:10.3970/fdmp.2009.005.411

Abstract A novel wavelet-based method for the simulation of reacting flows on adaptive meshes is presented. The method is based on a subtraction algorithm, wherein the wavelet coefficients are calculated from the low resolution up (as opposed to the standard top-down approach). The advantage of this new method is that it allows the calculation of wavelet coefficients on sparse grids, and thus lends itself more readily to adaptive computational meshes than does the traditional wavelet algorithm. The approach is used to simulate a one-dimensional laminar pre-mixed flame with different Lewis numbers. The computational grid is adapted More >

Arezoo Emdadi¹, Edward J. Kansa², Nicolas Ali Libre^1,3, Mohammad Rahimian¹, Mohammad Shekarchi¹

CMES-Computer Modeling in Engineering & Sciences, Vol.25, No.1, pp. 23-42, 2008, DOI:10.3970/cmes.2008.025.023

Abstract We present a new method based upon the paper of Volokh and Vilney (2000) that produces highly accurate and stable solutions to very ill-conditioned multiquadric (MQ) radial basis function (RBF) asymmetric collocation methods for partial differential equations (PDEs). We demonstrate that the modified Volokh-Vilney algorithm that we name the improved truncated singular value decomposition (IT-SVD) produces highly accurate and stable numerical solutions for large values of a constant MQ shape parameter, c, that exceeds the critical value of c based upon Gaussian elimination. More >

N. Mai-Duy¹, T. Tran-Cong¹

The International Conference on Computational & Experimental Engineering and Sciences, Vol.3, No.3, pp. 127-132, 2007, DOI:10.3970/icces.2007.003.127

Abstract This lecture presents an overview of the Integral Collocation formulation for numerically solving partial differential equations (PDEs). However, due to space limitation, the paper only describes the latest development, namely schemes based only on one-dimensional (1D) integrated interpolation even in multi-dimensional problems. The proposed technique is examined with Chebyshev polynomials and radial basis functions (RBFs). The latter can be used in both regular and irregular domains. For both basis functions, the accuracy and convergence rates of the new technique are better than those of the differential formulation. More >