THE GROWTH OF SOLUTIONS OF SYSTEMS OF COMPLEX NONLINEAR ALGEBRAIC DIFFERENTIAL EQUATIONS

We investigate the problem of growth order of solutions of a type of systems of non-linear algebraic differential equations, and extend some results of the growth order of solutions of algebraic differential equations to systems of algebraic differential equations.

The Continuous Analogy of Newton’s Method for Solving a System of Linear Algebraic Equations

We propose a continuous analogy of Newton’s method with inner iteration for solving a system of linear algebraic equations. Implementation of inner iterations is carried out in two ways. The former is to fix the number of inner iterations in advance. The latter is to use the inexact Newton method for solution of the linear system of equations that arises at each stage of outer iterations. We give some new choices of iteration parameter and of forcing term, that ensure the convergence of iterations. The performance and efficiency of the proposed iteration is illustrated by numerical examples that represent a wide range of typical systems.

SOLVERS FOR SYSTEMS OF LARGE SPARSE LINEAR AND NONLINEAR EQUATIONS BASED ON MULTI-GPUS

Numerical treatment of engineering application problems often eventually results in a solution of systems of linear or nonlinear equations.The solution process using digital computational devices usually takes tremendous time due to the extremely large size encountered in most real-world engineering applications.So,practical solvers for systems of linear and nonlinear equations based on multi graphic process units（GPUs）are proposed in order to accelerate the solving process.In the linear and nonlinear solvers,the preconditioned bi-conjugate gradient stable（PBi-CGstab）method and the Inexact Newton method are used to achieve the fast and stable convergence behavior.Multi-GPUs are utilized to obtain more data storage that large size problems need.

THE SOLUTION FOR THE GENERALIZED RICCATIALGEBRAIC EQUATIONS OF LINEAR EQUALITY CONSTRAINT SYSTEM

Based on the dynamic equation, the performance functional and the system constraint equation of time-invariant discrete LQ control problem, the generalized Riccati equations of linear equality constraint system are obtained according to the minimum principle, then a deep discussion about the above equations is given, and finally numerical example is shown in this paper.

THE STABILITY OF LINEAR MULTISTEP METHODS FOR SYSTEMS OF DELAY DIFFERENTIAL EQUATIONS

This paper deals with the numerical solution of initial value problems for systems of differential equations with a delay argument. The numerical stability of a linear multistep method is investigated by analysing the solution of the lest equation y’(t)=Ay(t) + By(1-t),where A,B denote constant complex N×N-matrices,and t】0.We investigate carefully the characterization of the stability region.

ASYNCHRONOUS RELAXED ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS OF EQUATIONS

In this paper, the asynchronous versions of classical iterative methods for solving linear systems of equations are considered. Sufficient conditions for convergence of asynchronous relaxed processes are given for H-matrix by which nor only the requirements of [3] on coefficient matrix are lowered, but also a larger region of convergence than that in [3] is obtained.

Geometric interpretation of several classical iterative methods for linear system of equations and diverse relaxation parameter of the SOR method

Two kinds of iterative methods are designed to solve the linear system of equations, we obtain a new interpretation in terms of a geometric concept. Therefore, we have a better insight into the essence of the iterative methods and provide a reference for further study and design. Finally, a new iterative method is designed named as the diverse relaxation parameter of the SOR method which, in particular, demonstrates the geometric characteristics. Many examples prove that the method is quite effective.

Novel method based on ant colony opti mization for solving ill-conditioned linear systems of equations

A novel method based on ant colony optimization （ACO）, algorithm for solving the ill-conditioned linear systems of equations is proposed. ACO is a parallelized bionic optimization algorithm which is inspired from the behavior of real ants. ACO algorithm is first introduced, a kind of positive feedback mechanism is adopted in ACO. Then, the solu- tion problem of linear systems of equations was reformulated as an unconstrained optimization problem for solution by an ACID algorithm. Finally, the ACID with other traditional methods is applied to solve a kind of multi-dimensional Hilbert ill-conditioned linear equations. The numerical results demonstrate that ACO is effective, robust and recommendable in solving ill-conditioned linear systems of equations.

Balancing Chemical Equations by Systems of Linear Equations

In this paper, a formal and systematic method for balancing chemical reaction equations was presented. The results satisfy the law of conservation of matter, and confirm that there is no contradiction to the existing way(s) of balancing chemical equations. A chemical reaction which possesses atoms with fractional oxidation numbers that have unique coefficients was studied. In this paper, the chemical equations were balanced by representing the chemical equation into systems of linear equations. Particularly, the Gauss elimination method was used to solve the mathematical problem with this method, it was possible to handle any chemical reaction with given reactants and products.

On the Order of the Solutions of Systems of Complex Algebraic Differential Equations

This paper is concerned with the order of the solutions of systems of high-order complex algebraic differential equations.By means of Zalcman Lemma,the systems of equations of[1]is extended to more general form.

SOlvaBILITY OF HIGHER INDEX TIME-VARYING LINEAR DIFFERENTIAL-ALGEBRAIC EQUATIONS

Linear differential-algebraic equations (DAEs) with time-varying coefficients A(t)x(1)(t) + B(t)x(t) = q(t), which are tractable with a higher index. are discussed. Their essential properties are investigated. Some equivalent system,,; are given. Using them the paper shows how to state properly initial and boundary conditions for these DAEs. The existence and uniqueness theory of the solution of the initial and boundary value problems for higher index DAEs are proposed.

ALGEBRAIC STRUCTURES AND POISSON INTEGRALS OF RELATIVISTIC DYNAMICAL EQUATIONS FOR ROTATIONALSYSTEMS

The algebraic structures of the dynamical equations for the rotational relativistic systems are studied. It is found that the dynamical equations of holonomic conservative rotational relativistic systems and the special nonholonomic rotational relativistic systems have Lie's algebraic structure, and the dynamical equations of the general holonomic rotational relativistic systems and the general nonholonomic rotational relativistic systems have Lie admitted algebraic structure. At last the Poisson integrals of the dynamical equations for the rotational relativistic systems are given.

A NEW ALGORITHM FOR SOLVING DIFFERENTIAL/ALGEBRAIC EQUATIONS OF MULTIBODY SYSTEM DYNAMICS

The second order Euler-Lagrange equations are transformed to a set of first order differential/algebraic equations, which are then transformed to state equations by using local parameterization. The corresponding discretization method is presented, and the results can be used to implementation of various numerical integration methods. A numerical example is presented finally.

A SYMBOLIC COMPUTATION METHOD TO DECIDE THE COMPLETENESS OF THE SOLUTIONS TO THE SYSTEM OF LINEAR PARTIAL DIFFERENTIAL EQUATIONS

A symbolic computation method to decide whether the solutions to the system Of linear partial differential equation is complete via using differential algebra and characteristic set is presented. This is a mechanization method, and it can be carried out on the computer in the Maple environment.

COMPUTER COMPUTATION OF THE METHOD OF MULTIPLE SCALES-DIRICHLET PROBLEM FOR A CLASS OF SYSTEM OF NONLINEAR DIFFERENTIAL EQUATIONS

The method of boundary layer with multiple scales and computer algebra were applied to study the asymptotic behavior of solution of boundary value problems for a class of system of nonlinear differential equations . The asymptotic expansions of solution were constructed. The remainders were estimated. And an example was analysed. It provides a new foreground for the application of the method of boundary layer with multiple scales .

Analytical Solutions of System of Non-Linear Differential Equations in the Single-Enzyme, Single-Substrate Reaction with Non-Mechanism-Based Enzyme Inactivation

A closed form of an analytical expression of concentration in the single-enzyme, single-substrate system for the full range of enzyme activities has been derived. The time dependent analytical solution for substrate, enzyme-substrate complex and product concentrations are presented by solving system of non-linear differential equation. We employ He’s Homotopy perturbation method to solve the coupled non-linear differential equations containing a non-linear term related to basic enzymatic reaction. The time dependent simple analytical expressions for substrate, enzyme-substrate and free enzyme concentrations have been derived in terms of dimensionless reaction diffusion parameters ε, λ1, λ2 and λ3 using perturbation method. The numerical solution of the problem is also reported using SCILAB software program. The analytical results are compared with our numerical results. An excellent agreement with simulation data is noted. The obtained results are valid for the whole solution domain.

The <i>LA = U</i>Decomposition Method for Solving Systems of Linear Equations

A method for solving systems of linear equations is presented based on direct decomposition of the coefficient matrix using the form LAX = LB = B’ . Elements of the reducing lower triangular matrix L can be determined using either row wise or column wise operations and are demonstrated to be sums of permutation products of the Gauss pivot row multipliers. These sums of permutation products can be constructed using a tree structure that can be easily memorized or alternatively computed using matrix products. The method requires only storage of the L matrix which is half in size compared to storage of the elements in the LU decomposition. Equivalence of the proposed method with both the Gauss elimination and LU decomposition is also shown in this paper.

Criteria for System of Three Second-Order Ordinary Differential Equations to Be Reduced to a Linear System via Restricted Class of Point Transformation

This paper is devoted to the study of the linearization problem of system of three second-order ordinary differential equations and . The necessary conditions for linearization by general point transformation and are found. The sufficient conditions for linearization by restricted class of point transformation and are obtained. Moreover, the procedure for obtaining the linearizing transformation is provided in explicit forms. Examples demonstrating the procedure of using the linearization theorems are presented.

On the Counting Functions of Meromorphic Solutions of Systems of Higher-order Algebraic Differential Equations

Using Nevanlinna theory and value distribution of meromorphic functions and the other techniques,we investigate the counting functions of meromorphic solutions of systems of higher-order algebraic differential equations and obtain some results.

A Mathod to Solve Systems of Fuzzy Linear Equations

Many systems of fuzzy linear equations do not have solutions when the solution concept is based on α cuts and interval arithmetic. In this paper,we establish the relations between the systems of fuzzy linear equations and the possibilistic linear programming problems and present an alternative method of solving the systems of fuzzy linear equations.