Related papers: A Newton method for harmonic mappings in the plane
We study composite optimization problems in which the smooth part of the objective function is \( p \)-times continuously differentiable, where \( p \geq 1 \) is an integer. Higher-order methods are known to be effective for solving such…
We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matroid with limited violations of the other ones. On top of the…
For any twisted ideal polygon in $\mathbb{H}^3$, we construct a harmonic map from $\mathbb{C}$ to $\mathbb{H}^3$ with a polynomial Hopf differential, that is asymptotic to the given polygon, and is a bounded distance from a pleated plane.…
In this paper we study Newton's method for solving the generalized equation $F(x)+T(x)\ni 0$ in Hilbert spaces, where $F$ is a Fr\'echet differentiable function and $T$ is set-valued and maximal monotone. We show that this method is local…
We apply the topological quantization method to some gravitational fields which can be represented as generalized harmonic maps. This representation extends the well-known concept of harmonic maps and allows us to describe some solutions to…
We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
Newton's method for solving the matrix equation $F(X)\equiv AX-XX^TAX=0$ runs up against the fact that its zeros are not isolated. This is due to a symmetry of $F$ by the action of the orthogonal group. We show how differential-geometric…
An implementation and an application of the combination of the genetic algorithm and Newton's method for solving a system of nonlinear equations is presented. The method first uses the advantage of the robustness of the genetic algorithm…
We study a generalization of the concept of harmonic conjugation from projective geometry and full algebraic matroids to a larger class of matroids called \emph{harmonic matroids}. We use harmonic conjugation to construct a projective plane…
Given a C^1 path of systems of homogeneous polynomial equations f_t, t in [a,b] and an approximation x_a to a zero zeta_a of the initial system f_a, we show how to adaptively choose the step size for a Newton based homotopy method so that…
The Newton-Raphson (N-R) method is useful to find the roots of a polynomial of degree n. However, this method is limited since it diverges for the case in which polynomials only have complex roots if a real initial condition is taken. In…
We specify a small set, consisting of $O(d(\log\log d)^2)$ points, that intersects the basins under Newton's method of \emph{all} roots of \emph{all} (suitably normalized) complex polynomials of fixed degrees $d$, with arbitrarily high…
An inexact Newton type method for numerical minimization of convex piecewise quadratic functions is considered and its convergence is analyzed. Earlier, a similar method was successfully applied to optimizaton problems arising in numerical…
We give a new improvement over Newton's method for root-finding, when the function in question is doubly differentiable. It generally exhibits faster and more reliable convergence. It can be also be thought of as a correction to Halley's…
In this paper, the theory of harmonic maps is extended. The soliton or traveling wave solutions of Euler's equations of the extended harmonic maps are studied. In certain cases, the chaotic behaviors of these partial equations can be found…
We leverage the connections between nonexpansive maps, monotone Lipschitz operators, and proximal mappings to obtain near-optimal (i.e., optimal up to poly-log factors in terms of iteration complexity) and parameter-free methods for solving…
In this pedagogically structured article, we describe a generalized harmonic formulation of the Einstein equations in spherical symmetry which is regular at the origin. The generalized harmonic approach has attracted significant attention…
We consider an inverse elastic scattering problem of simultaneously reconstructing a rigid obstacle and the excitation sources using near-field measurements. A two-phase numerical method is proposed to achieve the co-inversion of multiple…
A numerical algorithm (implemented in Matlab) for computing the zeros of the parabolic cylinder function $U(a,z)$ in domains of the complex plane is presented. The algorithm uses accurate approximations to the first zero plus a highly…