On solving composite power polynomial equations

It is well known that a system of power polynomial equations can be reduced to a single-variable polynomial equation by exploiting the so-called Newton's identities. In this work, by further exploring Newton's identities, we discover a binomial decomposition rule for composite elementary symmetric polynomials. Utilizing this decomposition rule, we solve three types of systems of composite power polynomial equations by converting each type to single-variable polynomial equations that can be solved easily. For each type of system, we discuss potential applications and characterize the number of nontrivial solutions (up to permutations) and the complexity of our proposed algorithmic solution.

     

Fractional powers of the algebraic sum of normal operators

The main concern in this paper is to give sufficient conditions such that if are unbounded normal operators on a (complex) Hilbert space , then for each , the domain equals . It is then verified that such a result can be applied to characterize the domains of fractional powers of a large class of the Hamiltonians with singular potentials arising in quantum mechanics through the study of the Schrödinger equation.

     

On modification of certain methods of the conjugate direction type for solving systems of linear algebraic equations

A modification of certain well-known methods of the conjugate direction type is proposed and examined. The modified methods are more stable with respect to the accumulation of round-off errors. Moreover, these methods are applicable for solving ill-conditioned systems of linear algebraic equations that, in particular, arise as approximations of ill-posed problems. Numerical results illustrating the advantages of the proposed modification are presented.     

On modification of certain methods of the conjugate direction type for solving rectangular systems of linear algebraic equations

The use of modifications of certain well-known methods of the conjugate direction type for solving systems of linear algebraic equations with rectangular matrices is examined. The modified methods are shown to be superior to the original versions with respect to the round-off accumulation; the advantage is especially large for ill-conditioned matrices. Examples are given of the efficient use of the modified methods for solving certain fairly large ill-conditioned problems.     

Conditions for partitioning a system of differential algebraic equations into weakly coupled subsystems

Systems of differential algebraic equations are examined. A method is proposed for transforming the rectangular matrix of algebraic equations to block diagonal form. This method ensures the prescribed accuracy of the solution with respect to the original system of equations.     

On solving general algebraic equations by integrals of elementary functions

We obtain an integral formula for a solution to a general algebraic equation. In this formula the integrand is an elementary function and integration is carried out over an interval. The advantage of this formula over the well-known Mellin formula is that the integral has a broader convergence domain. This circumstance makes it possible to describe the monodromy of a solution for trinomial equations.     

Numerical solution to systems of delay integrodifferential algebraic equations

The numerical solution of the initial value problem for a system of delay integrodifferential algebraic equations is examined in the framework of the parametric continuation method. Necessary and sufficient conditions are obtained for transforming this problem to the best argument, which is the arc length along the integral curve of the problem. The efficiency of the transformation is demonstrated using test examples.     

On solving relative norm equations in algebraic number fields

Let be algebraic number fields and a free -module. We prove a theorem which enables us to determine whether a given relative norm equation of the form has any solutions at all and, if so, to compute a complete set of nonassociate solutions. Finally we formulate an algorithm using this theorem, consider its algebraic complexity and give some examples.

     

An efficient multistep iteration scheme for systems of nonlinear algebraic equations associated with integral equations

The aim of this research is to present a new iterative procedure in approximating nonlinear system of algebraic equations with applications in integral equations as well as partial differential equations (PDEs). The presented scheme consists of several steps to reach a high rate of convergence and also an improved index of efficiency. The theoretical parts are furnished, and several computational tests mainly arising from practical problems are given to manifest its applicability.     

关于分圆多项式的Schinzel等式

对一无平方因子的奇数ｎ＞１，　分圆多项式φｎ（ｘ）　　满足Ｓｃｈｉｎｚｅｌ等式，　φｎ（ｘ）＝Ｐ２ｎ，ｍ（ｘ）－（－１／ｍ）ｍｘＱ２ｎ，ｍ（ｘ），　　这里Ｐｎ，ｍ（ｘ）和　Ｑｎ，ｍ（ｘ）是整系数多项式且　ｍ｜ｎ．本文给出两个简明的公式来计算　Ｐｎ，ｍ（ｘ）　和　Ｑｎ，ｍ（ｘ）　　．     

Fuzzy sets and type 2 under algebraic product and algebraic sum

The concept of fuzzy sets of type 2 has been proposed by L.A. Zadeh as an extension of ordinary fuzzy sets. A fuzzy set of type 2 can be defined by a fuzzy membership function, the grade (or fuzzy grade) of which is taken to be a fuzzy set in the unit interval [0, 1] rather than a point in [0, 1].This paper investigates the algebraic properties of fuzzy grades (that is, fuzzy sets of type 2) under the operations of algebraic product and algebraic sum which can be defined by using the concept of the extension principle and shows that fuzzy grades under these operations do not form such algebraic structures as a lattice and a semiring. Moreover, the properties of fuzzy grades are also discussed in the case where algebraic product and algebraic sum are combined with the well-known operations of join and meet for fuzzy grades and it is shown that normal convex fuzzy grades form a lattice ordered semigroup under join, meet and algebraic product.     

A globalization procedure for solving nonlinear systems of equations

A new globalization procedure for solving a nonlinear system of equationsF(x)=0 is proposed based on the idea of combining Newton step and the steepest descent step WITHIN each iteration. Starting with an arbitrary initial point, the procedure converges either to a solution of the system or to a local minimizer off(x)=1/2F(x) ^T F(x). Each iteration is chosen to be as close to a Newton step as possible and could be the Newton step itself. Asymptotically the Newton step will be taken in each iteration and thus the convergence is quadratic. Numerical experiments yield positive results. Further generalizations of this procedure are also discussed in this paper.     

代数微分方程的代数解

Using value distribution theory and techniques,the problem of the algebroid solutions of second order algebraic differential equation is investigated. Examples show that the results are sharp.     

Coexistence of algebraic and nonalgebraic limit cycles in Kukles systems

A class of Kukles differential systems of degree five having an invariant conic is examined. We show the coexistence of small amplitude limit cycles, large amplitude limit cycles, under perturbations of the coefficients of the systems. Financed partially by: USM Grant No. 12.06.28 and 12.06.27.     

Nonlinear differential algebraic equations

We consider a system of nonlinear ordinary differential equations that are not solved with respect to the derivative of the unknown vector function and degenerate identically in the domain of definition. We obtain conditions for the existence of an operator transforming the original system to the normal form and prove a general theorem on the solvability of the Cauchy problem.     

Multiquadric quasi‐interpolation methods for solving partial differential algebraic equations

In this article, we propose two meshless collocation approaches for solving time dependent partial differential algebraic equations (PDAEs) in terms of the multiquadric quasi‐interpolation schemes. In presenting the process of the solution, the error is estimated. Furthermore, the comparisons on condition numbers of the collocation matrices using different methods and the sensitivity of the shape parameter c are given. With the use of the appropriate collocation points, the method for PDAEs with index‐2 is improved. The results show that the methods have some advantages over some known methods, such as the smaller condition numbers or more accurate solutions for PDAEs which has an modal index‐2 or an impulse solution with index‐2. Copyright © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 95–119, 2014     

On the convergence of inexact Newton methods for discrete-time algebraic Riccati equations

In this paper, we present a convergence analysis of the inexact Newton method for solving Discrete-time algebraic Riccati equations (DAREs) for large and sparse systems. The inexact Newton method requires, at each iteration, the solution of a symmetric Stein matrix equation. These linear matrix equations are solved approximatively by the alternating directions implicit (ADI) or Smith?s methods. We give some new matrix identities that will allow us to derive new theoretical convergence results for the obtained inexact Newton sequences. We show that under some necessary conditions the approximate solutions satisfy some desired properties such as the d-stability. The theoretical results developed in this paper are an extension to the discrete case of the analysis performed by Feitzinger et al. (2009) [8] for the continuous-time algebraic Riccati equations. In the last section, we give some numerical experiments.     

Jacobi spectral solution for integral algebraic equations of index-2

This paper is concerned with obtaining the approximate solution of a class of semi-explicit Integral Algebraic Equations (IAEs) of index-2. A Jacobi collocation method including the matrix-vector multiplication representation is proposed for the IAEs of index-2. A rigorous analysis of error bound in weighted L² norm is also provided which theoretically justifies the spectral rate of convergence while the kernels and the source functions are sufficiently smooth. Results of several numerical experiments are presented which support the theoretical results.     

Some computational methods for systems of nonlinear equations and systems of polynomial equations

This paper gives a brief survey and assessment of computational methods for finding solutions to systems of nonlinear equations and systems of polynomial equations. Starting from methods which converge locally and which find one solution, we progress to methods which are globally convergent and find an a priori determinable number of solutions. We will concentrate on simplicial algorithms and homotopy methods. Enhancements of published methods are included and further developments are discussed.     

On random algebraic polynomials

This paper provides asymptotic estimates for the expected number of real zeros and -level crossings of a random algebraic polynomial of the form , where are independent standard normal random variables and is a constant independent of . It is shown that these asymptotic estimates are much greater than those for algebraic polynomials of the form .