|
|
|
|
|
Tsonyo M. Pavkov, Valentin G. Kabadzhov, Ivan K. Ivanov and Stoil I. Ivanov
In this paper, we provide a detailed local convergence analysis of a one-parameter family of iteration methods for the simultaneous approximation of polynomial zeros due to Ivanov (Numer. Algor. 75(4): 1193?1204, 2017). Thus, we obtain two local converge...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kamil Urbanowicz
An interesting series based on Bessel function roots (zeros) is discussed and numerically analyzed. The novel-derived simplified general solutions are based on Lommel polynomials. This kind of series can have a large practical use in many scientific area...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mohammad W. Alomari and Christophe Chesneau
In this work, some new inequalities for the numerical radius of block n-by-n matrices are presented. As an application, the bounding of zeros of polynomials using the Frobenius companion matrix partitioned by the Cartesian decomposition method is proved....
ver más
|
|
|
|
|
|
|
|
|
|
|
Elias Munapo
Pág. 6 - 13
The Hungarian method is a well-known method for solving the assignment problem. This method was developed and published in 1955. It was named the Hungarian method because two theorems from two Hungarian mathematicians were used. In 1957, it was noticed t...
ver más
|
|
|
|
|
|