相关论文: Relationships between different types of initial c…
The aim of this paper is to introduce a new Newton-type iterative method and then to show that this process converges to the unique solution of the scalar nonlinear equation f(x)=0 under weaker conditions involving only f and f' by fixed…
We consider the convergence of iterative solvers for problems of nonlinear magnetostatics. Using the equivalence to an underlying minimization problem, we can establish global linear convergence of a large class of methods, including the…
Solutions to differential equations, which are used to model physical systems, are computed numerically by solving a set of discretized equations. This set of discretized equations is reduced to a large linear system, whose solution is…
Convergence results are stated for the variational iteration method applied to solve an initial value problem for a system of ordinary differential equations.
This paper studies the hierarchy of local minimums of a polynomial in the space. For this purpose, we first compute H-minimums, for which the first and second order optimality conditions are satisfied. To compute each H-minimum, we…
In this paper, we study local convergence of high-order Tensor Methods for solving convex optimization problems with composite objective. We justify local superlinear convergence under the assumption of uniform convexity of the smooth…
We obtain closed-form solutions of several inhomogeneous Lienard equations by the factorization method. The two factorization conditions involved in the method are turned into a system of first-order differential equations containing the…
In the present study, we propose necessary and sufficient assumptions on the coefficients in order to only get distinct real roots of polynomials.
We present a new algorithm for solving the real roots of a bivariate polynomial system $\Sigma=\{f(x,y),g(x,y)\}$ with a finite number of solutions by using a zero-matching method. The method is based on a lower bound for bivariate…
This paper is devoted to studying the global and finite convergence of the semi-smooth Newton method for solving a piecewise linear system that arises in cone-constrained quadratic programming problems and absolute value equations. We first…
The local convergence of alternating optimization methods with overrelaxation for low-rank matrix and tensor problems is established. The analysis is based on the linearization of the method which takes the form of an SOR iteration for a…
We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the sequence, is equal to K, as N tends to positive infinity.…
We use the abstract method of (local) martingale problems in order to give criteria for convergence of stochastic processes. Extending previous notions, the formulation we use is neither restricted to Markov processes (or semimartingales),…
Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…
We consider asynchronous versions of the first and second order Richardson methods for solving linear systems of equations. These methods depend on parameters whose values are chosen a priori. We explore the parameter values that can be…
In this paper we developed an integrating factor matrix method to derive conditions for the existence of first integrals. We use this novel method to obtain first integrals, along with the conditions for their existence, for two and three…
A new one-parameter family of iterative method for solving nonlinear equations is constructed and studied. Two variants, both with cubic convergence, are developed, one for finding simple zeros and other for multiple zeros of known…
Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…
Following a systematic analysis of existing results, we investigate when complete interlacing between the zeros of distinct polynomial sequences, $\{\mathcal{P}_n\}$ and $\{\mathcal{G}_n\}$ can be achieved by using a naturally arising extra…