首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
考虑求解非光滑方程组的三次正则化方法及其收敛性分析.利用信赖域方法的技巧,保证该方法是全局收敛的.在子问题非精确求解和BD正则性条件成立的前提下,分析了非光滑三次正则化方法的局部收敛速度.最后,数值实验结果验证了该算法的有效性.  相似文献   

3.
A new eighth-order iterative method for solving nonlinear equations   总被引:1,自引:0,他引:1  
In this paper we present an improvement of the fourth-order Newton-type method for solving a nonlinear equation. The new Newton-type method is shown to converge of the order eight. Per iteration the new method requires three evaluations of the function and one evaluation of its first derivative and therefore the new method has the efficiency index of , which is better than the well known Newton-type methods of lower order. We shall examine the effectiveness of the new eighth-order Newton-type method by approximating the simple root of a given nonlinear equation. Numerical comparisons are made with several other existing methods to show the performance of the presented method.  相似文献   

4.
This paper presents some variants of the inexact Newton method for solving systems of nonlinear equations defined by locally Lipschitzian functions. These methods use variants of Newton's iteration in association with Krylov subspace methods for solving the Jacobian linear systems. Global convergence of the proposed algorithms is established under a nonmonotonic backtracking strategy. The local convergence based on the assumptions of semismoothness and BD‐regularity at the solution is characterized, and the way to choose an inexact forcing sequence that preserves the rapid convergence of the proposed methods is also indicated. Numerical examples are given to show the practical viability of these approaches. Copyright © 2009 John Wiley & Sons, Ltd.  相似文献   

5.
梁娜  杜守强 《运筹学学报》2017,21(3):95-102
提出一类对称张量绝对值方程问题,给出了求解此类问题的一类非光滑牛顿法,并且在一般的假设条件下,给出了算法的局部收敛性.最后给出相关的数值实验表明了算法的有效性.  相似文献   

6.
This paper presents an exponential matrix method for the solutions of systems of high‐order linear differential equations with variable coefficients. The problem is considered with the mixed conditions. On the basis of the method, the matrix forms of exponential functions and their derivatives are constructed, and then by substituting the collocation points into the matrix forms, the fundamental matrix equation is formed. This matrix equation corresponds to a system of linear algebraic equations. By solving this system, the unknown coefficients are determined and thus the approximate solutions are obtained. Also, an error estimation based on the residual functions is presented for the method. The approximate solutions are improved by using this error estimation. To demonstrate the efficiency of the method, some numerical examples are given and the comparisons are made with the results of other methods. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

7.
This paper presents a parameterized Newton method using generalized Jacobians and a Broyden-like method for solving nonsmooth equations. The former ensures that the method is well-defined even when the generalized Jacobian is singular. The latter is constructed by using an approximation function which can be formed for nonsmooth equations arising from partial differential equations and nonlinear complementarity problems. The approximation function method generalizes the splitting function method for nonsmooth equations. Locally superlinear convergence results are proved for the two methods. Numerical examples are given to compare the two methods with some other methods.This work is supported by the Australian Research Council.  相似文献   

8.
In this paper, a new smoothing Newton method is proposed for solving constrained nonlinear equations. We first transform the constrained nonlinear equations to a system of semismooth equations by using the so-called absolute value function of the slack variables, and then present a new smoothing Newton method for solving the semismooth equations by constructing a new smoothing approximation function. This new method is globally and quadratically convergent. It needs to solve only one system of unconstrained equations and to perform one line search at each iteration. Numerical results show that the new algorithm works quite well.  相似文献   

9.
A class of modified regula falsi iterative formulae for solving nonlinear equations is presented in this paper. This method is shown to be quadratically convergent for the sequence of diameters and the sequence of iterative points. The numerical experiments show that new method is effective and comparable to well-known methods.  相似文献   

10.
谢骊玲  关履泰  覃廉 《计算数学》2005,27(3):257-266
本文讨论一般的凸光顺问题minF(y):=∫a^b(|D^k y|)^2dt+∑(i=1)^N ωi|y(ti)-zi|^2.其中,忌芝3而且可在闭凸集凡K(∪→)L2^k[a,b].我们把该问题转化为半光滑方程组并给出一个求解该方程组的半光滑牛顿算法.最后证明算法的超线性收敛性并给出数值算例.  相似文献   

11.
The aim of the present paper is to introduce and investigate new ninth and seventh order convergent Newton-type iterative methods for solving nonlinear equations. The ninth order convergent Newton-type iterative method is made derivative free to obtain seventh-order convergent Newton-type iterative method. These new with and without derivative methods have efficiency indices 1.5518 and 1.6266, respectively. The error equations are used to establish the order of convergence of these proposed iterative methods. Finally, various numerical comparisons are implemented by MATLAB to demonstrate the performance of the developed methods.  相似文献   

12.
An iterative method for solving nonlinear functional equations, viz. nonlinear Volterra integral equations, algebraic equations and systems of ordinary differential equation, nonlinear algebraic equations and fractional differential equations has been discussed.  相似文献   

13.
《Optimization》2012,61(1):85-99
In this article, we propose a BFGS method for solving symmetric nonlinear equations. The presented method possesses some favourable properties: (a) the generated sequence of iterates is norm descent; (b) the generated sequence of the quasi-Newton matrix is positive definite and (c) this method possesses the global convergence and superlinear convergence. Numerical results show that the presented method is interesting.  相似文献   

14.
The purpose of the present paper is to introduce a new computational algebraic procedure that can easily be applied for solving non-linear partial differential equations (nPDE) especially the celebrated evolutions equations describing any time depended sequences.The crucial step needs an auxiliary variable satisfying special class of ordinary differential equations (ODE) of first order which are introduced new in this field for the first time.The validity and reliability of the method is tested by its application to some non-linear evolution equations leading to new class of solutions related with some new types of special functions.Otherwise, for practical use in science and engineering the algebraic construction of new class of solutions is of fundamental interest and moreover, the proposed approach convinced by its easiness and does not need tedious steps of evaluation and can be used without studying the whole theory.The possibility to write a symbolic software using any programming languages is given.Further, the algorithm works efficiently, is clear structured and can be used in any applications independently from the order and the non-linearity of the underlying nPDE.Therefore, the given novel algebraic method is suitable for a wider class of nPDE in order to augment the solution manifold by an alternative approach.  相似文献   

15.
In this study we are concerned with the problem of approximating a locally unique solution of an operator equation in Banach space using the Secant method. The differentiability of the operator involved is not assumed. Using a flexible point-based approximation, we provide a local as well as a semilocal convergence analysis for the Secant method. Our results are justified by numerical examples that cannot be handled with earlier works.  相似文献   

16.
An initial-value method of Bownds for solving Volterra integral equations is reexamined using a variable-step integrator to solve the differential equations. It is shown that such equations may be easily solved to an accuracy ofO(10–8), the error depending essentially on that incurred in truncating expansions of the kernel to a degenerate one.This work was sponsored by a University of Nevada at Las Vegas Research Grant.  相似文献   

17.
Motivated by the method of Martinez and Qi (Ref. 1), we propose in this paper a globally convergent inexact generalized Newton method to solve unconstrained optimization problems in which the objective functions have Lipschitz continuous gradient functions, but are not twice differentiable. This method is implementable, globally convergent, and produces monotonically decreasing function values. We prove that the method has locally superlinear convergence or even quadratic convergence rate under some mild conditions, which do not assume the convexity of the functions.  相似文献   

18.
In this paper, we propose a general smoothing Broyden-like quasi-Newton method for solving a class of nonsmooth equations. Under appropriate conditions, the proposed method converges to a solution of the equation globally and superlinearly. In particular, the proposed method provides the possibility of developing a quasi-Newton method that enjoys superlinear convergence even if strict complementarity fails to hold. We pay particular attention to semismooth equations arising from nonlinear complementarity problems, mixed complementarity problems and variational inequality problems. We show that under certain conditions, the related methods based on the perturbed Fischer–Burmeister function, Chen–Harker–Kanzow–Smale smoothing function and the Gabriel–Moré class of smoothing functions converge globally and superlinearly.  相似文献   

19.
通过引入广义梯度,将求解含n个未知量方程的方向牛顿法推广到非光滑的情形.证明了该方法在半光滑条件下的收敛性定理,给出了解的存在性以及先验误差界.  相似文献   

20.
A family of eighth-order iterative methods with four evaluations for the solution of nonlinear equations is presented. Kung and Traub conjectured that an iteration method without memory based on n evaluations could achieve optimal convergence order 2n-1. The new family of eighth-order methods agrees with the conjecture of Kung-Traub for the case n=4. Therefore this family of methods has efficiency index equal to 1.682. Numerical comparisons are made with several other existing methods to show the performance of the presented methods.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号