Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (18)
  • Open Access

    ARTICLE

    Nonlinear Algebraic Equations Solved by an Optimal Splitting-Linearizing Iterative Method

    Chein-Shan Liu1, Essam R. El-Zahar2,3, Yung-Wei Chen4,*

    CMES-Computer Modeling in Engineering & Sciences, Vol.135, No.2, pp. 1111-1130, 2023, DOI:10.32604/cmes.2022.021655 - 27 October 2022

    Abstract How to accelerate the convergence speed and avoid computing the inversion of a Jacobian matrix is important in the solution of nonlinear algebraic equations (NAEs). This paper develops an approach with a splitting-linearizing technique based on the nonlinear term to reduce the effect of the nonlinear terms. We decompose the nonlinear terms in the NAEs through a splitting parameter and then linearize the NAEs around the values at the previous step to a linear system. Through the maximal orthogonal projection concept, to minimize a merit function within a selected interval of splitting parameters, the optimal More > Graphic Abstract

    Nonlinear Algebraic Equations Solved by an Optimal Splitting-Linearizing Iterative Method

  • Open Access

    ARTICLE

    A Double Iteration Process for Solving the Nonlinear Algebraic Equations, Especially for Ill-posed Nonlinear Algebraic Equations

    Weichung Yeih1,2, I-Yao Chan1, Cheng-Yu Ku1, Chia-Ming Fan1, Pai-Chen Guan3

    CMES-Computer Modeling in Engineering & Sciences, Vol.99, No.2, pp. 123-149, 2014, DOI:10.3970/cmes.2014.099.123

    Abstract In this paper, a novel double iteration process for solving the nonlinear algebraic equations is developed. In this process, the outer iteration controls the evolution path of the unknown vector x in the selected direction u which is determined from the inner iteration process. For the inner iteration, the direction of evolution u is determined by solving a linear algebraic equation: BTBu = BTF where B is the Jacobian matrix, F is the residual vector and the superscript ''T'' denotes the matrix transpose. For an ill-posed system, this linear algebraic equation is very difficult to solve since the resulting… More >

  • Open Access

    ARTICLE

    Solution of Post-Buckling & Limit Load Problems, Without Inverting the Tangent Stiffness Matrix & Without Using Arc-Length Methods

    T.A. Elgohary1, L. Dong2, J.L. Junkins3, S.N. Atluri4

    CMES-Computer Modeling in Engineering & Sciences, Vol.98, No.6, pp. 543-563, 2014, DOI:10.3970/cmes.2014.098.543

    Abstract In this study, the Scalar Homotopy Methods are applied to the solution of post-buckling and limit load problems of solids and structures, as exemplified by simple plane elastic frames, considering only geometrical nonlinearities. Explicitly derived tangent stiffness matrices and nodal forces of large-deformation planar beam elements, with two translational and one rotational degrees of freedom at each node, are adopted following the work of [Kondoh and Atluri (1986)]. By using the Scalar Homotopy Methods, the displacements of the equilibrium state are iteratively solved for, without inverting the Jacobian (tangent stiffness) matrix. It is well-known that,… More >

  • Open Access

    ARTICLE

    A Scalar Homotopy Method with Optimal Hybrid Search Directions for Solving Nonlinear Algebraic Equations

    Weichung Yeih1,2, Cheng-Yu Ku1,2,3, Chein-Shan Liu4, I-Yao Chan1,2

    CMES-Computer Modeling in Engineering & Sciences, Vol.90, No.4, pp. 255-282, 2013, DOI:10.3970/cmes.2013.090.255

    Abstract In this paper, a scalar homotopy method with optimal hybrid search directions for solving nonlinear algebraic equations is proposed. To conduct the proposed method, we first convert the vector residual function to a scalar function by taking the square norm of the vector function and then, introduce a fictitious time variable to form a scalar homotopy function. To improve the convergence and the accuracy of the proposed method, a vector with multiple search directions and an iterative algorithm are introduced into the evolution dynamics of the solutions. Further, for obtaining the optimal search direction, linear… More >

  • Open Access

    ARTICLE

    A New Optimal Iterative Algorithm for Solving Nonlinear Poisson Problems in Heat Diffusion

    Chih-Wen Chang1,2, Chein-Shan Liu3

    CMC-Computers, Materials & Continua, Vol.34, No.2, pp. 143-175, 2013, DOI:10.3970/cmc.2013.034.143

    Abstract The nonlinear Poisson problems in heat diffusion governed by elliptic type partial differential equations are solved by a modified globally optimal iterative algorithm (MGOIA). The MGOIA is a purely iterative method for searching the solution vector x without using the invert of the Jacobian matrix D. Moreover, we reveal the weighting parameter αc in the best descent vector w = αcE + DTE and derive the convergence rate and find a criterion of the parameter γ. When utilizing αc and γ, we can further accelerate the convergence speed several times. Several numerical experiments are carefully More >

  • Open Access

    ARTICLE

    Dynamical Newton-Like Methods with Adaptive Stepsize for Solving Nonlinear Algebraic Equations

    Cheng-Yu Ku1,2,3, Weichung Yeih1,2

    CMC-Computers, Materials & Continua, Vol.31, No.3, pp. 173-200, 2012, DOI:10.3970/cmc.2012.031.173

    Abstract In this paper, a dynamical Newton-like method with the adaptive stepsize based on the construction of a scalar homotopy function to transform a vector function of non-linear algebraic equations (NAEs) into a time-dependent scalar function by introducing a fictitious time-like variable is proposed. With the introduction of the fictitious time-like function, we derived the adaptive stepsize using the dynamics of the residual vector. Based on the proposed dynamical Newton-like method, we can also derive the dynamical Newton method (DNM) and the dynamical Jacobian-inverse free method (DJIFM) with the transformation matrix as the inverse of the… More >

  • Open Access

    ARTICLE

    A New Optimal Scheme for Solving Nonlinear Heat Conduction Problems

    Chih-Wen Chang1,2, Chein-Shan Liu3

    CMES-Computer Modeling in Engineering & Sciences, Vol.88, No.4, pp. 269-292, 2012, DOI:10.3970/cmes.2012.088.269

    Abstract In this article, we utilize an optimal vector driven algorithm (OVDA) to cope with the nonlinear heat conduction problems (HCPs). From this set of nonlinear ordinary differential equations, we propose a purely iterative scheme and the spatial-discretization of finite difference method for revealing the solution vector x, without having to invert the Jacobian matrix D. Furthermore, we introduce three new ideas of bifurcation, attracting set and optimal combination, which are restrained by two parameters g and a. Several numerical instances of nonlinear systems under noise are examined, finding that the OVDA has a fast convergence More >

  • Open Access

    ARTICLE

    A Globally Optimal Iterative Algorithm Using the Best Descent Vector x· = λ[αcF + BTF], with the Critical Value αc, for Solving a System of Nonlinear Algebraic Equations F(x) = 0

    Chein-Shan Liu1, Satya N. Atluri2

    CMES-Computer Modeling in Engineering & Sciences, Vol.84, No.6, pp. 575-602, 2012, DOI:10.3970/cmes.2012.084.575

    Abstract An iterative algorithm based on the concept of best descent vector u in x· = λu is proposed to solve a system of nonlinear algebraic equations (NAEs): F(x) = 0. In terms of the residual vector F and a monotonically increasing positive function Q(t) of a time-like variable t, we define a future cone in the Minkowski space, wherein the discrete dynamics of the proposed algorithm evolves. A new method to approximate the best descent vector is developed, and we find a critical value of the weighting parameter αc in the best descent vector u = αcF + BTF, where B = ∂F/∂x is the More >

  • Open Access

    ARTICLE

    Iterative Solution of a System of Nonlinear Algebraic Equations F(x) = 0, Using x· = λ[αR + βP] or x· = λ[αF + βP] R is a Normal to a Hyper-Surface Function of F, P Normal to R, and P* Normal to F

    Chein-Shan Liu1,2, Hong-Hua Dai1, Satya N. Atluri1

    CMES-Computer Modeling in Engineering & Sciences, Vol.81, No.3&4, pp. 335-363, 2011, DOI:10.3970/cmes.2011.081.335

    Abstract To solve an ill- (or well-) conditioned system of Nonlinear Algebraic Equations (NAEs): F(x) = 0, we define a scalar hyper-surface h(x,t) = 0 in terms of x, and a monotonically increasing scalar function Q(t) where t is a time-like variable. We define a vector R which is related to ∂h / ∂x, and a vector P which is normal to R. We define an Optimal Descent Vector (ODV): u = αR + βP where α and β are optimized for fastest convergence. Using this ODV [x· = λu], we derive an Optimal Iterative Algorithm (OIA) to solve F(x) = 0. We also More >

  • Open Access

    ARTICLE

    A Further Study on Using x· = λ[αR + βP] (P = F − R(F·R) / ||R||2) and x· = λ[αF + βP] (P = R − F(F·R) / ||F||2) in Iteratively Solving the Nonlinear System of Algebraic Equations F(x) = 0

    Chein-Shan Liu1,2, Hong-Hua Dai1, Satya N. Atluri1

    CMES-Computer Modeling in Engineering & Sciences, Vol.81, No.2, pp. 195-228, 2011, DOI:10.3970/cmes.2011.081.195

    Abstract In this continuation of a series of our earlier papers, we define a hyper-surface h(x,t) = 0 in terms of the unknown vector x, and a monotonically increasing function Q(t) of a time-like variable t, to solve a system of nonlinear algebraic equations F(x) = 0. If R is a vector related to ∂h / ∂x, , we consider the evolution equation x· = λ[αR + βP], where P = F − R(F·R) / ||R||2 such that P·R = 0; or x· = λ[αF + βP], where P = R − F(F·R) / ||F||2 such that P*·F = 0. From these evolution More >

Displaying 1-10 on page 1 of 18. Per Page