The Nonlinear Lopsided HSS-Like Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems with Positive-Definite Matrices

In this paper,by means of constructing the linear complementarity problems into the corresponding absolute value equation,we raise an iteration method,called as the nonlinear lopsided HSS-like modulus-based matrix splitting iteration method,for solving the linear complementarity problems whose coefficient matrix in R^(n×n)is large sparse and positive definite.From the convergence analysis,it is appreciable to see that the proposed method will converge to its accurate solution under appropriate conditions.Numerical examples demonstrate that the presented method precede to other methods in practical implementation.

On the Convergence of Two-Step Modulus-Based Matrix Splitting Iteration Methods for a Restricted Class of Nonlinear Complementarity Problems with H_(+) -Matrices

We propose the two-step modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problems.The corresponding convergence the-ory is established when the system matrix is an H_(+)-matrix.Theoretical analysis gives the choice of parameter matrix involved based on the H-compatible splitting of the sys-tem matrix.Moreover,in actual implementation,the choices of iterative parameters for two-step modulus-based accelerated overrelaxation methods are studied.Numeri-cal experiments show that the method is efficient and further verify the convergence theorems.

Another SSOR Iteration Method

Kellogg gave a version of the Peaceman-Radford method. In this paper, we introduce a SSOR iteration method which uses Kellogg’s method. The new algorithm has some advantages over the traditional SSOR algorithm. A Cyclic Reduction algorithm is introduced via a decoupling in Kellogg’s method.

Analysis of Adiabatic Shearing Failure Mechanism for Aluminum Matrix Composites Based on Experimental and Numerical Simulation

Adiabatic shear behavior and the corresponding mechanism of TiB2/Al composites were researched by split Hopkinson pressure bar （SHPB）.Results show that the flow stresses of the TiB2/Al composites exhibit softening tendency with the increasing of strain rates. All the composites fail in splitting and cutting with a 45 degree, and the phase transformed bands of molten aluminum are found on the adiabatic shear layers. The deformation behavior and shear localization of the TiB2/Al composites specimens were simulated by finite element code MSC.Marc. The Johnson-Cook model was used to describe the thermo-viscoplastic response of the specimen material. There was unanimous between the numerical result and the experimental result on the location of the adiabatic shear band. From the numerical simulation and experiment, it was concluded that the instantaneous failure of the composite was ascribed due to the local low strength area where the formation of adiabatic shear band was, and the stress condition had significant effect on the initiation and propagation of adiabatic shear band （ASB）.

A SHIFT-SPLITTING PRECONDITIONER FOR NON-HERMITIAN POSITIVE DEFINITE MATRICES

A shift splitting concept is introduced and, correspondingly, a shift-splitting iteration scheme and a shift-splitting preconditioner are presented, for solving the large sparse system of linear equations of which the coefficient matrix is an ill-conditioned non-Hermitian positive definite matrix. The convergence property of the shift-splitting iteration method and the eigenvalue distribution of the shift-splitting preconditioned matrix are discussed in depth, and the best possible choice of the shift is investigated in detail. Numerical computations show that the shift-splitting preconditioner can induce accurate, robust and effective preconditioned Krylov subspace iteration methods for solving the large sparse non-Hermitian positive definite systems of linear equations.

A SPLITTING METHOD FOR QUADRATIC PROGRAMMING PROBLEM

A matrix splitting method is presented for minimizing a quadratic programming (QP) problem, and a general algorithm is designed to solve the QP problem and generates a sequence of iterative points. We prove that the sequence generated by the algorithm converges to the optimal solution and has an R-linear rate of convergence if the QP problem is strictly convex and nondegenerate, and that every accumulation point of the sequence generated by the general algorithm is a KKT point of the original problem under the hypothesis that the value of the objective function is bounded below on the constrained region, and that the sequence converges to a KKT point if the problem is nondegenerate and the constrained region is bounded.

Subspace Search Method for Quadratic Programming With BoxConstraints

A subspace search method for solving quadratic programming with box constraints is presented in this paper. The original problem is divided into many independent subproblem at an initial point, and a search direction is obtained by solving each of the subproblem, as well as a new iterative point is determined such that the value of objective function is decreasing. The convergence of the algorithm is proved under certain assumptions, and the numerical results are also given.

Convergence of a Class of Stationary Iterative Methods for Saddle Point Problems

A unified convergence theory is derived for a class of stationary iterative methods for solving linear equality constrained quadratic programs or saddle point problems.This class is constructed from essentially all possible splittings of the submatrix residing in the(1,1)-block of the augmented saddle point matrix that would produce non-expansive iterations.The classic augmented Lagrangian method and alternating direction method of multipliers are two special members of this class.

A fast compound direct iterative algorithm for solving transient line contact elastohydrodynamic lubrication problems

A fast compound direct iterative algorithm for solving transient line contact elastohydrodynamic lubrication （EHL） problems is presented. First, by introducing a special matrix splitting iteration method into the traditional compound direct iterative method, the full matrices for the linear systems of equations are transformed into sparse banded ones with any half-bandwidth; then, an extended Thomas method which can solve banded linear systems with any half-bandwidth is derived to accelerate the computing speed. Through the above two steps, the computational complexity of each iteration is reduced approximately from O（N^3/3） to O（β^2N）, where N is the total number of nodes, and β is the half-bandwidth. Two kinds of numerical results of transient EHL line contact problems under sinusoidal excitation or pure normal approach process are obtained. The results demonstrate that the new algorithm increases computing speed several times more than the traditional compound direct iterative method with the same numerical precision. Also the results show that the new algorithm can get the best computing speed and robustness when the ratio, half-bandwidth to total number of nodes, is about 7.5% 10.0% in moderate load cases.

A SPLIT-CHARACTERISTIC FINITE ELEMENT MODEL FOR 1-D UNSTEADY FLOWS

An efficient and accurate solution algorithm was proposed for 1-D unsteady flow problems widely existing in hydraulic engineering. Based on the split-characteristic finite element method, the numerical model with the Saint-Venant equations of 1-D unsteady flows was established. The assembled f＇mite element equations were solved with the tri-diagonal matrix algorithm. In the semi-implicit and explicit scheme, the critical time step of the method was dependent on the space step and flow velocity, not on the wave celerity. The method was used to eliminate the restriction due to the wave celerity for the computational analysis of unsteady open-channel flows. The model was verified by the experimental data and theoretical solution and also applied to the simulation of the flow in practical river networks. It shows that the numerical method has high efficiency and accuracy and can be used to simulate 1-D steady flows, and unsteady flows with shock waves or flood waves. Compared with other numerical methods, the algorithm of this method is simpler with higher accuracy, less dissipation, higher computation efficiency and less computer storage.