On the Convergence of the Brent Method

1.IntroductionItiswellknownthattheBrentmethodforsolvingsystemsofnonlinearequati0nsistosolvethefo1lowingsystem:bymaldnguseoftheorthogonaltriangulaxfaCtoriz8tion.SupP0sethatwehaveanaPprokimationx(k)tox*,asoluti0nof(1.1).Thenthek-thiterativeprocedurecanbedescribedasfollows[1]:wherehk/Oisthedifferencestepcorrespondingtotheindexk(wewilldiscussthechoicesofhkinSecti0n4)-Constructanorthogonalmatrix(usuallybytheHouseholdtransf0rmation)Step4.Ifj相似文献   

On the accuracy of the projection computation of the collision integral

The accuracy of the projection method as applied to the computation of the collision integral is analyzed. It is shown that the method has an error of the second order of smallness with respect to the mesh size. An optimal method for choosing additional nodes that minimizes the computational error is found. The theoretical conclusions and the optimality of the method are confirmed in a series of numerical experiments.     

On the cubic convergence of the Paardekooper method

We show a simple way how asymptotic convergence results can be conveyed from a simple Jacobi method to a block Jacobi method. Our pilot methods are the well known symmetric Jacobi method and the Paardekooper method for reducing a skew-symmetric matrix to the real Schur form. We show resemblance in the quadratic and cubic convergence estimates, but also discrepances in the asymptotic assumptions. By numerical tests we confirm that our asymptotic assumptions for the Paardekooper method are most general.     

On the Convergence of the Cross-Entropy Method

The cross-entropy method is a relatively new method for combinatorial optimization. The idea of this method came from the simulation field and then was successfully applied to different combinatorial optimization problems. The method consists of an iterative stochastic procedure that makes use of the importance sampling technique. In this paper we prove the asymptotical convergence of some modifications of the cross-entropy method.     

Improving the accuracy of solutions of the linear second kind volterra integral equations system by using the taylor expansion method

This paper presents a new and an efficient method for determining solutions of the linear second kind Volterra integral equations system. In this method, the linear Volterra integral equations system using the Taylor series expansion of the unknown functions transformed to a linear system of ordinary differential equations. For determining boundary conditions we use a new method. This method is effective to approximate solutions of integral equations system with a smooth kernel, and a convolution kernel. An error analysis for the proposed method is provided. And illustrative examples are given to represent the efficiency and the accuracy of the proposed method.     

On the quadratic convergence of a generalization of the Jacobi Method to arbitrary matrices

A method of diagonalizing a general matrix is proved to be ultimately quadratically convergent for all normalizable matrices. The method is a slight modification of a method due to P. J. Eberlein, and it brings the general matrix into a normal one by a combination of unitary plane transformations and plane shears (non-unitary). The method is a generalization of the Jacobi Method: in the case of normal matrices it is equivalent to the method given by Goldstine and Horwitz.     

复合材料旋转壳非线性稳定性分析计算

利用前屈曲一致理论和能量变分法分析计算了复合材料旋转壳非线性稳定性.前屈曲应变-位移关系采用非线性的卡门方程,能量积分采用数值积分,用势能最小原理求解前屈曲位移和内力,提出了求解临界载荷的实用计算方法,用FORTRAN语言编制了相应的计算机程序,并给出了算例.     

On the regularizing properties of the GMRES method

Summary. The GMRES method is a popular iterative method for the solution of large linear systems of equations with a nonsymmetric nonsingular matrix. However, little is known about the behavior of this method when it is applied to the solution of nonsymmetric linear ill-posed problems with a right-hand side that is contaminated by errors. We show that when the associated error-free right-hand side lies in a finite-dimensional Krylov subspace, the GMRES method is a regularization method. The iterations are terminated by a stopping rule based on the discrepancy principle. Received November 10, 2000 / Revised version received April 11, 2001 / Published online October 17, 2001     

The estimation of the strength of the heat source in the heat conduction problems

A general method is proposed to determine the strength of the heat source in the Fourier and non-Fourier heat conduction problems. A finite difference method, the concept of the future time and a modified Newton–Raphson method are adopted in the problem. The undetermined heat source at each time step is formulated as an unknown variable in a set of equations from the measured temperature and the calculated temperature. Then, an iterative process is used to solve the set of equations. No selected function is needed to represent the undetermined function in advance. Three examples are used to demonstrate the characteristics of the proposed method. The validity of the proposed method is confirmed by the numerical results. The results show that the proposed method is an accurate and stable method to determine the strength of the heat source in the inverse hyperbolic heat conduction problems. Furthermore, the result shows that more future times are needed in the hyperbolic equation than that of parabolic equation. Moreover, the robustness and the accuracy of the estimated results in the non-Fourier problem are not as well as those of the Fourier problem.     

On the convergence of the sequences of Gerschgorin-like disks

Carstensen’s results from 1991, connected with Gerschgorin’s disks, are used to establish a theorem concerning the localization of polynomial zeros and to derive an a posteriori error bound method. The presented quasi-interval method possesses useful property of inclusion methods to produce disks containing all simple zeros of a polynomial. The centers of these disks behave as approximations generated by a cubic derivative free method where the use of quantities already calculated in the previous iterative step decreases the computational cost. We state initial convergence conditions that guarantee the convergence of error bound method and prove that the method has the order of convergence three. Initial conditions are computationally verifiable since they depend only on the polynomial coefficients, its degree and initial approximations. Some computational aspects and the possibility of implementation on parallel computers are considered, including two numerical examples.In honor of Professor Richard S. Varga.     

A Proof of the Polynomiality of the Iri-Imai Method

The polynomiality of the time complexity of the multiplicative penalty function method proposed by In and Imai is proved based on detailed analysis of properties possessed by the Newton vector the method generates. The proof technique is readily extended to a proof of the polynomiality of the same method for quadratic programming problems having an objective function with a nonnegative definite quadratic part.     

On the convergence of the UOBYQA method

We analyze the convergence properties of Powell's UOBYQA method. A distinguished feature of the method is its use of two trust region radii. We first study the convergence of the method when the objective function is quadratic. We then prove that it is globally convergent for general objective functions when the second trust region radius ρ converges to zero. This gives a justification for the use of ρ as a stopping criterion. Finally, we show that a variant of this method is superlinearly convergent when the objective function is strictly convex at the solution.     

On the solution of the finite moment problem

In this work we propose a method to obtain the normal solution of the finite moment problem both in the absence and in the presence of linear boundary constraints. The method gives the normal solution as a linear combination of Jacobi polynomials and furnishes its coefficients in terms of the moments. A number of examples are given to illustrate the strength of the method.     

A Sine-Collocation Method for the Computation of the Eigenvalues of the Radial Schr?dinger Equation

A collocation scheme using sine function basis elements is developedand used to approximate the eigenvalues of the radial Schr?dingerequation. The method is shown to apply to problems with singulareigensolutions and error bounds for the approximate eigenvaluesare given. The method is applied to a few test examples to indicateboth the accuracy and the implementation of the method.     

On a numerical solution of the Cauchy problem for the Laplace equation by the fundamental solutions method

We discuss a numerical method to solve a Cauchy problem for the Laplace equation in the two-dimensional annular domain. We consider the case that the Cauchy data is given on an arc. We develop an approximation method based of the fundamental solutions method using the least squares method with Tikhonov regularization. The effectiveness of our method is examined by a numerical experiment. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Numerical study of the transverse stability of the Peregrine solution

We generalize a previously published numerical approach for the one-dimensional (1D) nonlinear Schrödinger (NLS) equation based on a multidomain spectral method on the whole real line in two ways: first, a fully explicit fourth-order method for the time integration, based on a splitting scheme and an implicit Runge-Kutta method for the linear part, is presented. Second, the 1D code is combined with a Fourier spectral method in the transverse variable both for elliptic and hyperbolic NLS equations. As an example we study the transverse stability of the Peregrine solution, an exact solution to the 1D NLS equation and thus a y-independent solution to the 2D NLS. It is shown that the Peregine solution is unstable agains all standard perturbations, and that some perturbations can even lead to a blow-up for the elliptic NLS equation.     

On the convergence of the secant method under the gamma condition

We provide sufficient convergence conditions for the Secant method of approximating a locally unique solution of an operator equation in a Banach space. The main hypothesis is the gamma condition first introduced in [10] for the study of Newton’s method. Our sufficient convergence condition reduces to the one obtained in [10] for Newton’s method. A numerical example is also provided.      

Hand Vibrations of the Human Operator in the Working Space

The paper contains the identification and the taking into account the vibrations produced by the machines, the lathe with different number of rotation, and them action over the human bodies inside the working space. For the identification of vibrations is applied a new method, the Moiré projection method, that did not used until this moment regarding the vibrations action over the human body. Our research was to apply the Moiré projection method to the human hand. They were compared with the measured vibrations using a classic vibrometer with three-axial accelerometer. The results in the booth situation were in the same order of the unit scale, and the optical method named Moiré projection method can be considered a valid method for the human vibrations measurements without touch of the surface. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the solution of the Abel equation of the second kind by the shifted Chebyshev polynomials

This paper presents a new approximate method of Abel differential equation. By using the shifted Chebyshev expansion of the unknown function, Abel differential equation is approximately transformed to a system of nonlinear equations for the unknown coefficients. A desired solution can be determined by solving the resulting nonlinear system. This method gives a simple and closed form of approximate solution of Abel differential equation. The solution is calculated in the form of a series with easily computable components. The numerical results show the effectiveness of the method for this type of equation. Comparing the methodology with some known techniques shows that the present approach is relatively easy and highly accurate.     

On the Barzilai and Borwein choice of steplength for the gradient method

In a recent paper, Barzilai and Borwein presented a new choiceof steplength for the gradient method. Their choice does notguarantee descent in the objective function and greatly speedsup the convergence of the method. They presented a convergenceanalysis of their method only in the two-dimensional quadraticcase. We establish the convergence of the Barzilai and Borweingradient method when applied to the minimization of a strictlyconvex quadratic function of any number of variables.