Fast intersection methods for the solution of some nonlinear systems of equations.
In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate...
A recent result of Bahouri shows that continuation from an open set fails in general for solutions of where and is a (nonelliptic) operator in satisfying Hörmander’s condition for hypoellipticity. In this paper we study the model case when is the subelliptic Laplacian on the Heisenberg group and is a zero order term which is allowed to be unbounded. We provide a sufficient condition, involving a first order differential inequality, for nontrivial solutions of to have a finite order...
In this paper a new method which is a generalization of the Ehrlich-Kjurkchiev method is developed. The method allows to find simultaneously all roots of the algebraic equation in the case when the roots are supposed to be multiple with known multiplicities. The offered generalization does not demand calculation of derivatives of order higher than first simultaneously keeping quaternary rate of convergence which makes this method suitable for application from practical point of view.
In this paper, we discuss the globalization of some kind of modified Levenberg-Marquardt methods for nonsmooth equations and their applications to nonlinear complementarity problems. In these modified Levenberg-Marquardt methods, only an approximate solution of a linear system at each iteration is required. Under some mild assumptions, the global convergence is shown. Finally, numerical results show that the present methods are promising.