Displaying 241 – 260 of 502

Showing per page

Multivariate Sturm-Habicht sequences: real root counting on n-rectangles and triangles.

Laureano González-Vega, Guadalupe Trujillo (1997)

Revista Matemática de la Universidad Complutense de Madrid

The main purpose of this note is to show how Sturm-Habicht Sequence can be generalized to the multivariate case and used to compute the number of real solutions of a polynomial system of equations with a finite number of complex solutions. Using the same techniques, some formulae counting the number of real solutions of such polynomial systems of equations inside n-dimensional rectangles or triangles in the plane are presented.

New Einstein metrics on Sp ( n ) which are non-naturally reductive

Shaoxiang Zhang, Huibin Chen (2022)

Czechoslovak Mathematical Journal

We prove that there are at least two new non-naturally reductive Ad ( Sp ( l ) × Sp ( k ) × Sp ( k ) × Sp ( k ) ) invariant Einstein metrics on Sp ( l + 3 k ) ( k < l ) . It implies that every compact simple Lie group Sp ( n ) ...

New modification of Maheshwari’s method with optimal eighth order convergence for solving nonlinear equations

Somayeh Sharifi, Massimiliano Ferrara, Mehdi Salimi, Stefan Siegmund (2016)

Open Mathematics

In this paper, we present a family of three-point with eight-order convergence methods for finding the simple roots of nonlinear equations by suitable approximations and weight function based on Maheshwari’s method. Per iteration this method requires three evaluations of the function and one evaluation of its first derivative. These class of methods have the efficiency index equal to [...] 814≈1.682 8 1 4 1 . 682 . We describe the analysis of the proposed methods along with numerical experiments including comparison...

New quasi-Newton method for solving systems of nonlinear equations

Ladislav Lukšan, Jan Vlček (2017)

Applications of Mathematics

We propose a new Broyden method for solving systems of nonlinear equations, which uses the first derivatives, but is more efficient than the Newton method (measured by the computational time) for larger dense systems. The new method updates QR or LU decompositions of nonsymmetric approximations of the Jacobian matrix, so it requires O ( n 2 ) arithmetic operations per iteration in contrast with the Newton method, which requires O ( n 3 ) operations per iteration. Computational experiments confirm the high efficiency...

New sufficient convergence conditions for the secant method

Ioannis K. Argyros (2005)

Czechoslovak Mathematical Journal

We provide new sufficient conditions for the convergence of the secant method to a locally unique solution of a nonlinear equation in a Banach space. Our new idea uses “Lipschitz-type” and center-“Lipschitz-type” instead of just “Lipschitz-type” conditions on the divided difference of the operator involved. It turns out that this way our error bounds are more precise than the earlier ones and under our convergence hypotheses we can cover cases where the earlier conditions are violated.

Currently displaying 241 – 260 of 502