Using principles of the theory of smoothness spaces we give systematic constructions of scales of inverse-closed subalgebras of a given Banach algebra with the action of a d-parameter automorphism group. In particular we obtain the inverse-closedness of Besov algebras, Bessel potential algebras and approximation algebras of polynomial order in their defining algebra. By a proper choice of the g...

Nonlinear two-point boundary value problems arise in numerous areas of application. The existence and number of solutions for various cases has been studied from a theoretical standpoint. These results generally rely upon growth conditions of the nonlinearity. However, in general, one cannot forecast how many solutions a boundary value problem may possess or even determine the existence of a so...

We obtain formulas for the spectral zeta function of the Laplacian on symmetric finitely ramified fractals, such as the Sierpiński gasket, and a fractal Laplacian on the interval. These formulas contain a new type of zeta function associated with a polynomial (rational functions also can appear in this context). It is proved that this zeta function has a meromorphic continuation to a half plain...

The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...

AlmU'net--This paper considers the computation of all solutions to the inverse position problem for general six-revolute-joint manipulators. Instead of reducing the problem to one highly complicated input-output equation, we work with a system of I I very simple polynomial equations. Although the total degree of the system is large (1024), using the "method of the generic case" we show numerica...

This is a continuation of our paper \A Theory of Pfaaan Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating functions of T-joins and k-cuts of graphs. As a consequence, we show that the computational problem to nd the maximum weight of an edge-cut is polynomially solvable for the instances (G; w) where G is a graph embedded on an arbit...

We present a new technique, based on polynomial continuation, for solving systems of n polynomials in N complex variables. The method allows equations to be introduced one-by-one or in groups, obtaining at each stage a representation of the solution set that can be extended to the next stage until finally obtaining the solution set for the entire system. At any stage where positive dimensional ...

Matrix methods are increasingly popular for polynomial root-finding. The idea is to approximate the roots as the eigenvalues of the companion or generalized companion matrix associated with an input polynomial. The algorithms also solve secular equation. QR algorithm is the most customary method for eigen-solving, but we explore the inverse Rayleigh quotient iteration instead, which turns out t...

Abstract. By multidimensional matrix inversion, combined with an Ar extension of Jackson’s 8φ7 summation formula by Milne, a new multivariable 8φ7 summation is derived. By a polynomial argument this 8φ7 summation is transformed to another multivariable 8φ7 summation which, by taking a suitable limit, is reduced to a new multivariable extension of the nonterminating 6φ5 summation. The latter is ...