Related papers: On Josephy-Halley method for generalized equations
We define iteration of functions that map n-dimensional vector spaces into m-dimensional vector spaces (m at most equal to n). It happens that usual iteration and Fibonacci iterative methods become special cases of this generalized…
When Newton's method, or Halley's method is used to approximate the $p${th} root of $1-z$, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case,…
The hierarchical interpolative factorization for elliptic partial differential equations is a fast algorithm for approximate sparse matrix inversion in linear or quasilinear time. Its accuracy can degrade, however, when applied to strongly…
In 2000, Darmon described a program to study the generalized Fermat equation using modularity of abelian varieties of $\mathrm{GL}_2$-type over totally real fields. The original approach was based on hard open conjectures, which have made…
Finding an $\epsilon$-stationary point of a nonconvex function with a Lipschitz continuous Hessian is a central problem in optimization. Regularized Newton methods are a classical tool and have been studied extensively, yet they still face…
The aim of this paper is to present an efficient numerical procedure to approximate the generalized Abel's integral equations of the first and second kinds. For this reason, the Taylor polynomials and the collocation method are applied.…
This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…
In this paper, to solve a broad class of complex symmetric linear systems, we recast the complex system in a real formulation and apply the generalized successive overrelaxation (GSOR) iterative method to the equivalent real system. We then…
The Fourier restriction norm method is used to show local wellposedness for the Cauchy Problem for the generalized KdV-equation of order three with data in the usual Sobolev space H^s, s > -1/6. For real valued data in L^2 global…
The paper studies the global convergence of the block Jacobi me\-thod for symmetric matrices. Given a symmetric matrix $A$ of order $n$, the method generates a sequence of matrices by the rule $A^{(k+1)}=U_k^TA^{(k)}U_k$, $k\geq0$, where…
Generalized Fourier series with orthogonal polynomial bases have useful applications in several fields, including differential equations, pattern recognition, and image and signal processing. However, computing the generalized Fourier…
This work develops user-friendly a posteriori error estimates of finite element methods, based on smoothers of linear iterative solvers. The proposed method employs simple smoothers, such as Jacobi or Gauss-Seidel iteration, on an auxiliary…
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…
We present methods for computing the generalized polar decomposition of a matrix based on the dynamically weighted Halley (DWH) iteration. This method is well established for computing the standard polar decomposition. A stable…
Although the Kadanoff-Baym equations are typically solved using time-stepping methods, iterative global-in-time solvers offer potential algorithmic advantages, particularly when combined with compressed representations of two-time objects.…
Iterative methods for solving large sparse systems of linear equations are widely used in many HPC applications. Extreme scaling of these methods can be difficult, however, since global communication to form dot products is typically…
We consider a class of "filtered" schemes for first order time dependent Hamilton-Jacobi equations and prove a general convergence result for this class of schemes. A typical filtered scheme is obtained mixing a high-order scheme and a…
In this paper, we investigate the generalized Hyers-Ulam stability of the following reciprocal functional equation \begin{equation*}f(2x+y)+f\left(\frac{x+y}{2}\right)…
Due to the rapid growth of data and computational resources, distributed optimization has become an active research area in recent years. While first-order methods seem to dominate the field, second-order methods are nevertheless attractive…
The generalized Gearhart-Koshy acceleration is a recent exact affine search technique designed for the method of cyclic projections onto hyperplanes, i.e., the Kaczmarz method. However, its convergence properties, particularly the linear…