Related papers: Pseudo-Newton method for nonlinear equations
The numerical solution of problems in nonlinear magnetostatics is typically based on a variational formulation in terms of magnetic potentials, the discretization by finite elements, and iterative solvers like the Newton method. The vector…
In a series of recent papers the author has introduced the notion of (regular) pseudo-bosons showing, in particular, that two number-like operators, whose spectra are ${\Bbb N}_0:={\Bbb N}\cup\{0\}$, can be naturally introduced. Here we…
We write down and apply the linearized fluid and gravitational equations consistent with pseudo-Newtonian simulations, whereby Newtonian hydrodynamics is used with a pseudo-Newtonian monopole and standard Newtonian gravity for higher…
In this paper, we propose a new method that combines the inexact Newton method with a procedure to obtain a feasible inexact projection for solving constrained smooth and nonsmooth equations. The local convergence theorems are established…
Dual quaternion matrices have various applications in robotic research and its spectral theory has been extensively studied in recent years. In this paper, we extend Jacobi method to compute all eigenpairs of dual quaternion Hermitian…
As second-order methods, Gauss--Newton-type methods can be more effective than first-order methods for the solution of nonsmooth optimization problems with expensive-to-evaluate smooth components. Such methods, however, often do not…
In this paper we apply the ideas of New Q-Newton's method directly to a system of equations, utilising the specialties of the cost function $f=||F||^2$, where $F=(f_1,\ldots ,f_m)$. The first algorithm proposed here is a modification of…
In this paper, a globally convergent Newton-type proximal gradient method is developed for composite multi-objective optimization problems where each objective function can be represented as the sum of a smooth function and a nonsmooth…
The goal of this paper is to study approaches to bridge the gap between first-order and second-order type methods for composite convex programs. Our key observations are: i) Many well-known operator splitting methods, such as…
In this paper, we present a generic framework to extend existing uniformly optimal convex programming algorithms to solve more general nonlinear, possibly nonconvex, optimization problems. The basic idea is to incorporate a local search…
In this paper, we study the underlying geometry in the classical Hamilton-Jacobi equation. The proposed formalism is also valid for nonholonomic systems. We first introduce the essential geometric ingredients: a vector bundle, a linear…
In this paper, we propose quasilinearization methods that convert nonlocal fully-nonlinear parabolic systems into the nonlocal quasilinear parabolic systems. The nonlocal parabolic systems serve as important mathematical tools for modelling…
Modelling real world systems frequently requires the solution of systems of nonlinear equations. A number of approaches have been suggested and developed for this computational problem. However, it is also possible to attempt solutions…
New method is presented to look for exact solutions of nonlinear differential equations. Two basic ideas are at the heart of our approach. One of them is to use the general solutions of the simplest nonlinear differential equations. Another…
An efficient approximate version of implicit Taylor methods for initial-value problems of systems of ordinary differential equations (ODEs) is introduced. The approach, based on an approximate formulation of Taylor methods, produces a…
In [1], the non-linear space-time Hasegawa-Mima plasma equation is formulated as a coupled system of two linear PDE's, a solution of which is a pair (u, w). The first equation is of hyperbolic type and the second of elliptic type.…
Optimization problems with composite functions consist of an objective function which is the sum of a smooth and a (convex) nonsmooth term. This particular structure is exploited by the class of proximal gradient methods and some of their…
This paper addresses the challenge of developing efficient algorithms for large-scale nonconvex multiobjective optimization problems (MOPs). While quasi-Newton methods are effective, their traditional application to MOPs is computationally…
We investigate mathematically a nonlinear approximation type approach recently introduced in [A. Ammar et al., J. Non-Newtonian Fluid Mech., 2006] to solve high dimensional partial differential equations. We show the link between the…
A new non-perturbative method of solution of the nonlinear Heisenberg equations in the finite-dimensional subspace is illustrated. The method, being a counterpart of the traditional Schrodinger picture method, is based on a finite operator…