Search

We introduce and analyze numerical companion matrix methods for the reconstruction of hypersurfaces with crossings from smooth interpolants given unordered or, without loss of generality, value-sorted data. The problem is motivated by the desire to machine learn potential energy surfaces arising in molecular excited state computational chemistry applications. We present simplified models which reproduce the analytically predicted convergence and stability behaviors as well as two application-oriented numerical experiments: the electronic excited states of Graphene featuring Dirac conical cusps and energy surfaces corresponding to a sulfur dioxide ($SO_2$) molecule in different configurations., Comment: 30 pages, 12 figures

In this paper, we present a new modified Newton method a use of Haar wavelet formula for solving non-linear equations. This new method do not require the use of the second-order derivative. It is shown that the new method has third-order of convergent. Furthermore, some numerical experiments are conducted which confirm our theoretical findings., Comment: 7 pages, 1 table

The purpose of this paper is to present three new methods for finding all simple zeros of polynomials simultaneously. First, we give a new method for finding simultaneously all simple zeros of polynomials constructed by applying the Weierstrass method to the zero in the trapezoidal Newton's method, and prove the convergence of the method. We also present two modified Newton's methods combined with the derivative-free method, which are constructed by applying the derivative-free method to the zero in the trapezoidal Newton's method and the midpoint Newton's method, respectively. Finally, we give a numerical comparison between various simultaneous methods for finding zeros of a polynomial., Comment: 12 pages

We generalize Ramanujan method of approximating the smallest root of an equation which is found in Ramanujan Note books, Part-I. We provide simple analytical proof to study convergence of this method. Moreover, we study iterative approach of this method on approximating a root with arbitrary order of convergence., Comment: Comments are invited