Global existence of real roots and random Newton flow algorithm for nonlinear system of equations To memorize Qin's method for 770 anniversaries

To solve nonlinear system of equation,F(x) = 0,a continuous Newton flow x_t(t) = V(x) =-(DF(x))^(-1)F(x),x(0) =x^0 and its mathematical properties,such as the central field,global existence and uniqueness of real roots and the structure of the singular surface,are studied.We concisely introduce random Newton flow algorithm(NFA) for finding all roots,based on discrete Newton flow x^(j+1)=x^j+hV{x^j) with random initial value x^0 and h∈(0,1],and three computable quantities,g_j,d_j and K_j.The numerical experiments with dimension n=300 are provided.

A Sufficient Statistical Test for Dynamic Stability

In the existing Statistics and Econometrics literature, there does not exist a statistical test which may test for all kinds of roots of the characteristic polynomial leading to an unstable dynamic response, i.e., positive and negative real unit roots, complex unit roots and the roots lying inside the unit circle. This paper develops a test which is sufficient to prove dynamic stability (in the context of roots of the characteristic polynomial) of a univariate as well as a multivariate time series without having a structural break. It covers all roots (positive and negative real unit roots, complex unit roots and the roots inside the unit circle whether single or multiple) which may lead to an unstable dynamic response. Furthermore, it also indicates the number of roots causing instability in the time series. The test is much simpler in its application as compared to the existing tests as the series is strictly stationary under the null (C01, C12).

T-Shaped Transmission Line Fault Location Based on Phase-Angle Jump Checking

In order to effectively solve the dead-zone and low-precision of T-shaped transmission line fault location,a new T-shaped transmission line fault location algorithm based on phase-angle jump checking is proposed in this paper.Firstly,the 3-terminal synchronous fundamental positive sequence voltage and current phasors are extracted and substituted into the fault branch distance function to realize the selection of fault branch when the fault occurs;Secondly,use the condition of the fundamental positive sequence voltage phasor at the fault point is equal to calculate all roots(including real root and virtual roots);Finally,the phase-angle jump check function is used for checking calculation,and then the only real root can be determined as the actual fault distance,thereby achieving the purpose of high-precision fault location.MATLAB simulation results show that the proposed new algorithm is feasible and effective with high fault location accuracy and good versatility.

Logcf: An Efficient Tool for Real Root Isolation

Computing upper bounds of the positive real roots of some polynomials is a key step of those real root isolation algorithms based on continued fraction expansion and Vincent's theorem.The authors give a new algorithm for computing an upper bound of positive roots in this paper.The complexity of the algorithm is O(n log(uH-l))additions and multiplications where u is the optimal upper bound satisfying Theorem 3.1 of this paper and n is the degree of the polynomial.The method together w辻h some tricks have been implemented as a software package logcf using C language.Experiments on many benchmarks show that logcf is competitive with Root Intervals of Mathematica and the function realroot of Maple averagely and it is much faster than existing open source real root solvers in many test cases.

REAL ROOT ISOLATION OF SPLINE FUNCTIONS

In this paper, we propose an algorithm for isolating real roots of a given univariate spline function, which is based on the use of Descartes＇ rule of signs and de Casteljau algorithm. Numerical examples illustrate the flexibility and effectiveness of the algorithm.

Finding roots of arbitrary high order polynomials based on neural network recursive partitioning method

This paper proposes a novel recursive partitioning method based on constrained learning neural networks to find an arbitrary number (less than the order of the polynomial) of (real or complex) roots of arbitrary polynomials. Moreover, this paper also gives a BP network constrained learning algorithm (CLA) used in root-finders based on the constrained relations between the roots and the coefficients of polynomials. At the same time, an adaptive selection method for the parameter d P with the CLA is also given. The experimental results demonstrate that this method can more rapidly and effectively obtain the roots of arbitrary high order polynomials with higher precision than traditional root-finding approaches.

Weyl and Lidskiǐ Inequalities for General Hyperbolic Polynomials

The roots of hyperbolic polynomials satisfy the linear inequalities that were previously established for the eigenvalues of Hermitian matrices,after a conjecture by A.Horn.Among them are the so-called Weyl and Lidskiǐ inequalities.An elementary proof of the latter for hyperbolic polynomials is given.This proof follows an idea from H.Weinberger and is free from representation theory and Schubert calculus arguments,as well as from hyperbolic partial differential equations theory.

Tubular algebras and affine Kac-Moody algebras

The purpose of this paper is to construct quotient algebras L(A) 1 ? /I(A) of complex degenerate composition Lie algebras L(A) 1 ? by some ideals, where L(A 1 ? is defined via Hall algebras of tubular algebras A, and to prove that the quotient algebras L(A) 1 ? /I(A) are isomorphic to the corresponding affine Kac-Moody algebras. Moreover, it is shown that the Lie algebra L re(A) 1 ? generated by A-modules with a real root coincides with the degenerate composition Lie algebra L(A) 1 ? generated by simple A-modules.

Polynomials Root-Finding Using a SLEFE-Based Clipping Method

For finding the real roots of a polynomial,we propose a clipping algorithmcalled SLEFEclipping and an isolation algorithmcalled SLEFEisolation algorithm.Ateach iterative step,the SLEFEclipping algorithm generates two broken lines boundingthe given polynomial.Then,a sequence of intervals can be obtained by computing theintersection of the sequence of broken lines with the abscissa axis.The sequence ofthese intervals converges to the root with a convergence rate of 2.Numerical examplesshow that SLEFE clipping requires fewer iterations and less computation time thancurrent algorithms,and the SLEFE isolation algorithm can compute all intervals thatcontain the roots rapidly and accurately.

Time to most recent common ancestor for stationary continuous state branching processes with immigration

Motivated by sample path decomposition of the stationary continuous state branching process with immigration, a general population model is considered using the idea of immortal individual. We compute the joint distribution of the random variables： the time to the most recent common ancestor （MRCA）, the size of the current population, and the size of the population just before MRCA. We obtain the bottleneck effect as well. The distribution of the number of the oldest families is also established. These generalize the results obtained by Y. T. Chen and J. F. Delmas.