On the Local Convergence and Dynamics of New Iterative Method with Sixth Order Convergence

In this paper,we construct a new sixth order iterative method for solving nonlinear equations.The local convergence and order of convergence of the new iterative method is demonstrated.In order to check the validity of the new iterative method,we employ several chemical engineering applications and academic test problems.Numerical results show the good numerical performance of the new iterative method.Moreover,the dynamical study of the new method also supports the theoretical results.

Almost Sure Convergence of Proximal Stochastic Accelerated Gradient Methods

Proximal gradient descent and its accelerated version are resultful methods for solving the sum of smooth and non-smooth problems. When the smooth function can be represented as a sum of multiple functions, the stochastic proximal gradient method performs well. However, research on its accelerated version remains unclear. This paper proposes a proximal stochastic accelerated gradient (PSAG) method to address problems involving a combination of smooth and non-smooth components, where the smooth part corresponds to the average of multiple block sums. Simultaneously, most of convergence analyses hold in expectation. To this end, under some mind conditions, we present an almost sure convergence of unbiased gradient estimation in the non-smooth setting. Moreover, we establish that the minimum of the squared gradient mapping norm arbitrarily converges to zero with probability one.

LOCAL CONVERGENCE OF INEXACT NEWTON-LIKE METHOD UNDER WEAK LIPSCHITZ CONDITIONS

The paper develops the local convergence of Inexact Newton-Like Method(INLM)for approximating solutions of nonlinear equations in Banach space setting.We employ weak Lipschitz and center-weak Lipschitz conditions to perform the error analysis.The obtained results compare favorably with earlier ones such as[7,13,14,18,19].A numerical example is also provided.

GLOBAL CONVERGENCE OF A CLASS OF OPTIMALLY CONDITIONED SSVM METHODS

This paper explores the convergence of a class of optimally conditioned self scaling variable metric (OCSSVM) methods for unconstrained optimization. We show that this class of methods with Wolfe line search are globally convergent for general convex functions.

A New Class of Nonlinear Conjugate Gradient Methods with Global Convergence Properties

非线性共轭梯度法由于其迭代简单和储存量小,且搜索方向不需要满足正割条件,在求解大规模无约束优化问题时占据及其重要的地位.提出了一类新的共轭梯度法,其搜索方向是目标函数的下降方向.若假设目标函数连续可微且梯度满足Lipschitz条件,线性搜索满足Wolfe原则,讨论了所设计算法的全局收敛性.

GENERALIZED MATRIX MULTISPLITTING RELAXATION METHODS AND THEIR CONVERGENCE

In this paper, we set up a general framework of parallel matrix mullisplitting relaxation methods for solving large scale system of linear equations. We investigate the convergence properties of this framework and give several sufficient conditions ensuring it to converge as well as diverge. At last, we conclude a necessary and sufficient condition for the convergence of this framework when the coefficient matrix is an L-matrix.

GLOBAL CONVERGENCE RESULTS OF A THREE TERM MEMORY GRADIENT METHOD WITH A NON-MONOTONE LINE SEARCH TECHNIQUE

In this paper, a new class of three term memory gradient method with non-monotone line search technique for unconstrained optimization is presented. Global convergence properties of the new methods are discussed. Combining the quasi-Newton method with the new method, the former is modified to have global convergence property. Numerical results show that the new algorithm is efficient.

ON THE MONOTONE CONVERGENCE OF THE PROJECTED ITERATION METHODS FOR LINEAR COMPLEMENTARITY PROBLEMS

Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate of this method is investigated.

WEAK ORLICZ SPACE AND ITS CONVERGENCE THEOREMS

In this article, a class of weak Orlicz function spaces is defined and their basic properties are discused. In particular, for the sequences in weak Orlicz space, we establish several basic convergence theorems including bounded convergence theorem, control convergence theorem and Vitali-type convergence theorem and so on. Moreover, the conditional compactness of its subsets is also discussed.

CONVERGENCE ANALYSIS OF RUNGE-KUTTA METHODS FOR A CLASS OF RETARDED DIFFERENTIAL ALGEBRAIC SYSTEMS

This article deals with a class of numerical methods for retarded differential algebraic systems with time-variable delay. The methods can be viewed as a combination of Runge-Kutta methods and Lagrange interpolation. A new convergence concept, called DA-convergence, is introduced. The DA-convergence result for the methods is derived. At the end, a numerical example is given to verify the computational effectiveness and the theoretical result.

Improving convergence of incremental harmonic balance method using homotopy analysis method

We have deduced incremental harmonic balance an iteration scheme in the （IHB） method using the harmonic balance plus the Newton-Raphson method. Since the convergence of the iteration is dependent upon the initial values in the iteration, the convergent region is greatly restricted for some cases. In this contribution, in order to enlarge the convergent region of the IHB method, we constructed the zeroth-order deformation equation using the homotopy analysis method, in which the IHB method is employed to solve the deformation equation with an embedding parameter as the active increment. Taking the Duffing and the van der Pol equations as examples, we obtained the highly accurate solutions. Importantly, the presented approach renders a convenient way to control and adjust the convergence.

Self-adaptive strategy for one-dimensional finite element method based on EEP method with optimal super-convergence order

Based on the newly-developed element energy projection （EEP） method with optimal super-convergence order for computation of super-convergent results, an improved self-adaptive strategy for one-dimensional finite element method （FEM） is proposed. In the strategy, a posteriori errors are estimated by comparing FEM solutions to EEP super-convergent solutions with optimal order of super-convergence, meshes are refined by using the error-averaging method. Quasi-FEM solutions are used to replace the true FEM solutions in the adaptive process. This strategy has been found to be simple, clear, efficient and reliable. For most problems, only one adaptive step is needed to produce the required FEM solutions which pointwise satisfy the user specified error tolerances in the max-norm. Taking the elliptical ordinary differential equation of the second order as the model problem, this paper describes the fundamental idea, implementation strategy and computational algorithm and representative numerical examples are given to show the effectiveness and reliability of the proposed approach.

Convergence of Online Gradient Method with Penalty for BP Neural Networks

Online gradient method has been widely used as a learning algorithm for training feedforward neural networks. Penalty is often introduced into the training procedure to improve the generalization performance and to decrease the magnitude of network weights. In this paper, some weight boundedness and deterministic con- vergence theorems are proved for the online gradient method with penalty for BP neural network with a hidden layer, assuming that the training samples are supplied with the network in a fixed order within each epoch. The monotonicity of the error function with penalty is also guaranteed in the training iteration. Simulation results for a 3-bits parity problem are presented to support our theoretical results.

WEAK CONVERGENCE THEOREMS FOR GENERAL EQUILIBRIUM PROBLEMS AND VARIATIONAL INEQUALITY PROBLEMS AND FIXED POINT PROBLEMS IN BANACH SPACES

In this paper, we introduce two new iterative algorithms for finding a common element of the set of solutions of a general equilibrium problem and the set of solutions of the variational inequality for an inverse-strongly monotone operator and the set of common fixed points of two infinite families of relatively nonexpansive mappings or the set of common fixed points of an infinite family of relatively quasi-nonexpansive mappings in Banach spaces. Then we study the weak convergence of the two iterative sequences. Our results improve and extend the results announced by many others.

Study on the critical stress threshold of weakly cemented sandstone damage based on the renormalization group method

During the microstructural analysis of weakly cemented sandstone,the granule components and ductile structural parts of the sandstone are typically generalized.Considering the contact between granules in the microstructure of weakly cemented sandstone,three basic units can be determined:regular tetrahedra,regular hexahedra,and regular octahedra.Renormalization group models with granule-and pore-centered weakly cemented sandstone were established,and,according to the renormalization group transformation rule,the critical stress threshold of damage was calculated.The results show that the renormalization model using regular octahedra as the basic units has the highest critical stress threshold.The threshold obtained by iterative calculations of the granule-centered model is smaller than that obtained by the pore-centered model.The granule-centered calculation provides the lower limit(18.12%),and the pore-centered model provides the upper limit(36.36%).Within this range,the weakly cemented sandstone is in a phase-like critical state.That is,the state of granule aggregation transforms from continuous to discrete.In the relative stress range of 18.12%-36.36%,the weakly cemented sandstone exhibits an increased proportion of high-frequency signals(by 83.3%)and a decreased proportion of low-frequency signals(by 23.6%).The renormalization calculation results for weakly cemented sandstone explain the high-low frequency conversion of acoustic emission signals during loading.The research reported in this paper has important significance for elucidating the damage mechanism of weakly cemented sandstone.

Initial support distance of a non-circular tunnel based on convergence constraint method and integral failure criteria of rock

For deep tunnel projects,selecting an appropriate initial support distance is critical to improving the self-supporting capacity of surrounding rock.In this work,an intuitive method for determining the tunnel’s initial support distance was proposed.First,based on the convergence-confinement method,a three-dimensional analytical model was constructed by combining an analytical solution of a non-circular tunnel with the Tecplot software.Then,according to the integral failure criteria of rock,the failure tendency coefficients of hard surrounding rock were computed and the spatial distribution plots of that were constructed.On this basis,the tunnel’s key failure positions were identified,and the relationship between the failure tendency coefficient at key failure positions and their distances from the working face was established.Finally,the distance from the working face that corresponds to the critical failure tendency coefficient was taken as the optimal support distance.A practical project was used as an example,and a reasonable initial support distance was successfully determined by applying the developed method.Moreover,it is found that the stability of hard surrounding rock decreases rapidly within the range of 1.0D(D is the tunnel diameter)from the working face,and tends to be stable outside the range of 1.0D.

THE DYNAMICAL BEHAVIOR OF FULLY DISCRETE SPECTRAL METHOD FOR NONLINEAR SCHRODINGER EQUATION WITH WEAKLY DAMPED

Nonlinear Schrodinger equation (NSE) arises in many physical problems. It is a very important equation. A lot of works studied the wellposed, the existence of solution of NSE etc. And there are many works studied the numerical methods for it. Recently, since the development of infinite dimensional dynamic system the dynamical behavior of NSE has been investigated. The paper [1] studied the long time wellposedness, the existence of universal attractor and the estimate of Lyapunov exponent for NSE with weakly damped. At the same time it was need to study the large time new computational methods and to discuss its convergence error estimate, the existence of approximate attractors etc. In this pape we study the NSE with weakly damped (1.1). We assume,where 0【λ【2 is a constant. If we wish to construct the higher accuracy computational scheme, it will be difficult that staigh from the equation (1.1). Therefore we start with (1. 4) and use fully discrete Fourier spectral method with time difference to

Forced propagation method for Monte Carlo fission source convergence acceleration in the RMC

In loosely coupled or large-scale problems with high dominance ratios,slow fission source convergence can take extremely long time,reducing Monte Carlo(MC)criticality calculation efficiency.Although various acceleration methods have been developed,some methods cannot reduce convergence times,whereas others have been limited to specific problem geometries.In this study,a new fission source convergence acceleration(FSCA)method,the forced propagation(FP)method,has been proposed,which forces the fission source to propagate and accelerate fission source convergence.Additionally,some stabilization techniques have been designed to render the method more practical.The resulting stabilized method was then successfully implemented in the MC transport code,and its feasibility and effectiveness were tested using the modified OECD/NEA,one-dimensional slab benchmark,and the Hoogenboom full-core problem.The comparison results showed that the FP method was able to achieve efficient FSCA.

THE CONVERGENCE OF APPROACH PENALTY FUNCTION METHOD FOR APPROXIMATE BILEVEL PROGRAMMING PROBLEM

In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem. the evaluation of the objective function is very difficult, so that only their approximate values can be obtained. This algorithm is obtained by combining penalty function method and approximation in bilevel programming. The presented algorithm is completely different from existing methods. That convergence for this algorithm is proved.

Weak Galerkin Finite Element Method for the Unsteady Stokes Equation

The Weak Galerkin (WG) finite element method for the unsteady Stokes equations in the primary velocity-pressure formulation is introduced in this paper. Optimal-order error estimates are established for the corresponding numerical approximation in an H1 norm for the velocity, and L2 norm for both the velocity and the pressure by use of the Stokes projection.