A calculus of symbols and convolution semigroups on the Heisenberg group
A Class of Iterative Methods for Holomorphic Functions.
A class of pseudo differential operators with multiple non-involutive characteristics
A comparison of some efficient numerical methods for a nonlinear elliptic problem
The aim of this paper is to compare and realize three efficient iterative methods, which have mesh independent convergence, and to propose some improvements for them. We look for the numerical solution of a nonlinear model problem using FEM discretization with gradient and Newton type methods. Three numerical methods have been carried out, namely, the gradient, Newton and quasi-Newton methods. We have solved the model problem with these methods, we have investigated the differences between them...
A contribution to solving a system of two non-linear equations
A contribution to solving a system of two non-linear equations
A convergence analysis of Newton-like methods for singular equations using outer or generalized inverses
The Newton-Kantorovich approach and the majorant principle are used to provide new local and semilocal convergence results for Newton-like methods using outer or generalized inverses in a Banach space setting. Using the same conditions as before, we provide more precise information on the location of the solution and on the error bounds on the distances involved. Moreover since our Newton-Kantorovich-type hypothesis is weaker than before, we can cover cases where the original Newton-Kantorovich...
A Convergence Theorem for a Method for Simultaneous Determination of all Zeros of a Polynomial
A convergence theorem for a method for simultaneous determination of all zeros of a polynomial.
A Correction on a Theorem By Uspensky
A correction to “Cayley's problem”, AM 35 (1990) No. 2, 140-146
A Derivative-Free Transformation Preserving the Order of Convergence of Iteration Methods in Case of Multiple Zeros.
A dual-parameter double-step splitting iteration method for solving complex symmetric linear equations
We multiply both sides of the complex symmetric linear system by to obtain a new equivalent linear system, then a dual-parameter double-step splitting (DDSS) method is established for solving the new linear system. In addition, we present an upper bound for the spectral radius of iteration matrix of the DDSS method and obtain its quasi-optimal parameter. Theoretical analyses demonstrate that the new method is convergent when some conditions are satisfied. Some tested examples are given to illustrate...
A Family of Root Finding Methods.
A fast floating-point square-rooting routine for the 8080/8085 microprocessors
A finite element solution of the monlinear heat equation
A fixed point method to compute solvents of matrix polynomials
Matrix polynomials play an important role in the theory of matrix differential equations. We develop a fixed point method to compute solutions of matrix polynomials equations, where the matricial elements of the matrix polynomial are considered separately as complex polynomials. Numerical examples illustrate the method presented.
A frequency decomposition waveform relaxation algorithm for semilinear evolution equations.
A functional calculus for Rockland operators on nilpotent Lie groups
A global analysis of Newton iterations for determining turning points
The global convergence of a direct method for determining turning (limit) points of a parameter-dependent mapping is analysed. It is assumed that the relevant extended system has a singular root for a special parameter value. The singular root is clasified as a (i.e., as a turning point). Then, the Theorz for Imperfect Bifurcation offers a particular scenario for the split of the singular root into a finite number of regular roots (turning points) due to a given parameter imperfection. The relationship...