Related papers: General convergence theorems for iterative process…
We generalize Lindemann-Weierstrass theorem and Gelfond -Schneider-Baker Theorem. We find new transcendental numbers in this work. There are several methods to find transcendental numbers in the work. Recently transcendental numbers are…
In this paper we investigate convergence for the Variational Iteration Method (VIM) which was introduced and described in \cite{He0},\cite{He1}, \cite{He2}, and \cite{He3}. We prove the convergence of the iteration scheme for a linear…
It is very fundamental to study irreducible plane curve singularities in algebraic geometry. The contents of the paper consist of three parts, called Part[A], Part[B] and Part[C] with Good Appendix. Our aim is to prove by Part[B] and…
We introduce the sequence of generalized Gon\v{c}arov polynomials, which is a basis for the solutions to the Gon\v{c}arov interpolation problem with respect to a delta operator. Explicitly, a generalized Gon\v{c}arov basis is a sequence…
The techniques for polynomial interpolation and Gaussian quadrature are generalized to matrix-valued functions. It is shown how the zeros and rootvectors of matrix orthonormal polynomials can be used to get a quadrature formula with the…
Inversion theorems of Wiener type are essential tools in analysis and number theory. We derive a weighted version of an inversion theorem of Wiener type for general Dirichlet series from that of Edwards from 1957, and we outline an…
We introduce the concept of piecewise interlacing zeros for studying the relation of root distribution of two polynomials. The concept is pregnant with an idea of confirming the real-rootedness of polynomials in a sequence. Roughly…
In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…
Generalized inverses of tensors play increasingly important roles in computational mathematics and numerical analysis. It is appropriate to develop the theory of generalized inverses of tensors within the algebraic structure of a ring. In…
We investigate Newton's method for complex polynomials of arbitrary degree $d$, normalized so that all their roots are in the unit disk. For each degree $d$, we give an explicit set $\mathcal{S}_d$ of $3.33d\log^2 d(1 + o(1))$ points with…
We give a new method to calculate the universal cohomology classes of coincident root loci. We show a polynomial behavior of them and apply this result to prove that generalized Pl\"ucker formulas are polynomials in the degree, just as the…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
In this article, we propose a general theory of integration of the Riemann and Lebesgue types with respect to arbitrary measures and functions, connected by a continuous bilinear product, with values in abstract vector spaces endowed with a…
We provide new theoretical results in the field of inverse regression methods for dimension reduction. Our approach is based on the study of some empirical processes that lie close to a certain dimension reduction subspace, called the…
Let $W$ be a random positive definite symmetric matrix distributed according to a real Wishart distribution and let $W^{-1}=(W^{ij})_{i,j}$ be its inverse matrix. We compute general moments $\mathbb{E} [W^{k_1 k_2} W^{k_3 k_4} ...…
A parameter-free method, namely the generalization of the Gauss-Seidel (GGS) method, is developed to solve generalized absolute value equations. Convergence of the proposed method is analyzed. Numerical results are given to demonstrate the…
Under the assumption of the existence of Stahl's $S$-compact set we give a short proof of the limit zeros distribution of Pad\'e polynomials and convergence in capacity of diagonal Pad\'e approximants for a generic class of algebraic…
Solutions to differential equations, which are used to model physical systems, are computed numerically by solving a set of discretized equations. This set of discretized equations is reduced to a large linear system, whose solution is…
In this paper, we introduce an iterative process which converges strongly to a common element of sets of solutions of finite family of generalized equilibrium problems, sets of fixed points of finite family of continuous relatively…
We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials,…