Liviu Marin¹

CMES-Computer Modeling in Engineering & Sciences, Vol.48, No.2, pp. 121-154, 2009, DOI:10.3970/cmes.2009.048.121

Abstract We investigate the numerical implementation of the alternating iterative algorithm originally proposed by ` 12 ` 12 `$12 `&12 `#12 `^12 `_12 `%12 `~12 *Kozlov91 in the case of the Cauchy problem for the two-dimensional Laplace equation using a meshless method. The two mixed, well-posed and direct problems corresponding to every iteration of the numerical procedure are solved using the method of fundamental solutions (MFS), in conjunction with the Tikhonov regularization method. For each direct problem considered, the optimal value of the regularization parameter is chosen according to the generalized cross-validation (GCV) criterion. An efficient regularizing stopping criterion which ceases… More >

Chein-Shan Liu¹, Satya N. Atluri²

CMES-Computer Modeling in Engineering & Sciences, Vol.31, No.2, pp. 71-84, 2008, DOI:10.3970/cmes.2008.031.071

Abstract Iterative algorithms for solving a nonlinear system of algebraic equations of the type: F_i(x_j) = 0, i,j = 1,…,n date back to the seminal work of Issac Newton. Nowadays a Newton-like algorithm is still the most popular one due to its easy numerical implementation. However, this type of algorithm is sensitive to the initial guess of the solution and is expensive in the computations of the Jacobian matrix ∂ F_i/ ∂ x_j and its inverse at each iterative step. In a time-integration of a system of nonlinear Ordinary Differential Equations (ODEs) of the type B_ijx_j + F_i = 0 where… More >

Chein-Shan Liu¹

CMC-Computers, Materials & Continua, Vol.8, No.2, pp. 53-66, 2008, DOI:10.3970/cmc.2008.008.053

Abstract Proposed is a time-marching algorithm to solve a nonlinear system of complementarity equations: P_i(x_j) ≥ 0, Q_i(x_j) ≥ 0 , P_i(x_j)Q_i(x_j) = 0, i, j = 1,...,n, resulting from a discretization of nonlinear obstacle problem. We transform the above nonlinear complementarity problem (NCP) into a nonlinear algebraic equations (NAEs) system: F_i(x_j) = 0 with the aid of the Fischer-Burmeister NCP-function. Such NAEs are semi-smooth, highly nonlinear and usually implicit, being hard to handle by the Newton-like method. Instead of, a first-order system of ODEs is derived through a fictitious time equation. The time-stepping equations are obtained by applying a numerical… More >

Hong-Hua Dai^1,2, Jeom Kee Paik³, S. N. Atluri²

CMC-Computers, Materials & Continua, Vol.23, No.2, pp. 155-186, 2011, DOI:10.3970/cmc.2011.023.155

Abstract The application of the Galerkin method, using global trial functions which satisfy the boundary conditions, to nonlinear partial differential equations such as those in the von Karman nonlinear plate theory, is well-known. Such an approach using trial function expansions involving multiple basis functions, leads to a highly coupled system of nonlinear algebraic equations (NAEs). The derivation of such a system of NAEs and their direct solutions have hitherto been considered to be formidable tasks. Thus, research in the last 40 years has been focused mainly on the use of local trial functions and the Galerkin method, applied to the piecewise… More >

Chein-Shan Liu¹

CMC-Computers, Materials & Continua, Vol.18, No.1, pp. 1-20, 2010, DOI:10.3970/cmc.2010.018.001

Abstract We are concerned with the reconstruction of an unknown space-dependent rigidity coefficient in a wave equation. This problem is known as one of the inverse scattering problems. Based on a two-point Lie-group equation we develop a Lie-group adaptive method (LGAM) to solve this inverse scattering problem through iterations, which possesses a special character that by using onlytwo boundary conditions and two initial conditions, as those used in the direct problem, we can effectively reconstruct the unknown rigidity function by aself-adaption between the local in time differential governing equation and the global in time algebraic Lie-group equation. The accuracy and efficiency… More >

Liviu Marin¹

CMC-Computers, Materials & Continua, Vol.17, No.3, pp. 233-274, 2010, DOI:10.3970/cmc.2010.017.233

Abstract We investigate two algorithms involving the relaxation of either the given boundary temperatures (Dirichlet data) or the prescribed normal heat fluxes (Neumann data) on the over-specified boundary in the case of the iterative algorithm of Kozlov91 applied to Cauchy problems for two-dimensional steady-state anisotropic heat conduction (the Laplace-Beltrami equation). The two mixed, well-posed and direct problems corresponding to every iteration of the numerical procedure are solved using the method of fundamental solutions (MFS), in conjunction with the Tikhonov regularization method. For each direct problem considered, the optimal value of the regularization parameter is chosen according to the generalized cross-validation (GCV)… More >

LiviuMarin ¹

CMC-Computers, Materials & Continua, Vol.12, No.1, pp. 71-100, 2009, DOI:10.3970/cmc.2009.012.071

Abstract In this paper, the alternating iterative algorithm originally proposed by Kozlov, Maz'ya and Fomin (1991) is numerically implemented for the Cauchy problem in anisotropic heat conduction using a meshless method. Every iteration of the numerical procedure consists of two mixed, well-posed and direct problems which are solved using the method of fundamental solutions (MFS), in conjunction with the Tikhonov regularization method. For each direct problem considered, the optimal value of the regularization parameter is chosen according to the generalized cross-validation (GCV) criterion. An efficient regularizing stopping criterion which ceases the iterative procedure at the point where the accumulation of noise… More >