Related papers: Generalization of Ehrlich-Kjurkchiev method for mu…
In this paper we introduce a common problem in electronic measurements and electrical engineering: finding the first root from the left of an equation in the presence of some initial conditions. We present examples of electrotechnical…
Finding roots of univariate polynomials is one of the fundamental tasks of numerics, and there is still a wide gap between root finders that are well understood in theory and those that perform well in practice. We investigate the root…
In this paper we present a unified method for solving general polynomial equations of degree less than five.
In the article we develop Euler-Lagrange method and calculate all the roots of an arbitrary complex polynomial $P(z)$ on the base of calculation (similar to the Bernoulli-Aitken-Nikiporets methods) of the limits of ratios of Hadamard…
Multidimensional matrix inversions provide a powerful tool for studying multiple hypergeometric series. In order to extend this technique to elliptic hypergeometric series, we present three new multidimensional matrix inversions. As…
In this article we investigate the existence of a solution to a semilinear, elliptic, partial differential equation with distributional coefficients and data. The problem we consider is a generalization of the Lichnerowicz equation that one…
This work provides a method(an algorithm) for solving the solvable unary algebraic equation $f(x)=0$ ($f(x)\in\mathbb{Q}[x]$) of arbitrary degree and obtaining the exact radical roots. This method requires that we know the Galois group as…
We present a common framework to study varieties in great generality from a categorical point of view. The main application of this study is in the setting of algebraic categories, where we introduce Birkhoff varieties which are essentially…
Multiplicative relations between the roots of a polynomial in $\mathbb{Q}[x]$ have drawn much attention in the field of arithmetic and algebra, while the problem of computing these relations is interesting to researchers in many other…
We propose a novel way to study numerical methods for ordinary differential equations in one dimension via the notion of multi-indice. The main idea is to replace rooted trees in Butcher's B-series by multi-indices. The latter were…
For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then…
A new numerical method is presented to find full complex roots of a complex dispersion equation. For the application of the solution, the complex dispersion equation of a cylindrical metallic nanowire is investigated. By using this method,…
In this paper, we prove some general convergence theorems for the Picard iteration in cone metric spaces over a solid vector space. As an application, we provide a detailed convergence analysis of the Weierstrass iterative method for…
In this article, we present an iterative method to find simple roots of nonlinear equations, that is, to solving an equation of the form $f(x) = 0$. Different from Newton's method, the method we purpose do not require evaluation of…
We study whether a modified version of Tikhonov regularization can be used to identify several local sources from Dirichlet boundary data for a prototypical elliptic PDE. This paper extends the results presented in [5]. It turns out that…
In a recent work, we presented the reduced Jacobian method (RJM) as an extension of Wolfe's reduced gradient method to multicriteria (multiobjective) optimization problems dealing with linear constraints. This approach reveals that using a…
We develop a generalized hybrid iterative approach for computing solutions to large-scale Bayesian inverse problems. We consider a hybrid algorithm based on the generalized Golub-Kahan bidiagonalization for computing Tikhonov regularized…
This paper presents a comprehensive survey of methods which can be utilized to search for solutions to systems of nonlinear equations (SNEs). Our objectives with this survey are to synthesize pertinent literature in this field by presenting…
Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior and is only guaranteed to converge…
The Eberlein diagonalization method is an iterative Jacobi-type method for solving the eigenvalue problem of a general complex matrix. In this paper we develop the block version of the Eberlein method. We prove the global convergence of our…