Continuity of maps inverse to quadratic operator polynomials

Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 41, No. 11, pp. 1512–1521, November, 1989.     

Spectral analysis of operator polynomials and higher-order difference operators

The study of the spectral properties of operator polynomials is reduced to the study of the spectral properties of the operator specified by the operator matrix. The results obtained are applied to higher-order difference operators. Conditions for their invertibility and for them to be Fredholm, as well as the asymptotic representation for bounded solutions of homogeneous difference equations are obtained.     

Repeated eigenvectors and the numerical range of self-adjoint quadratic operator polynomials

LetL() be a self-adjoint quadratic operator polynomial on a Hilbert space with numerical rangeW(L). The main concern of this paper is with properties of eigenvalues on W(L). The investigation requires a careful discussion of repeated eigenvectors of more general operator polynomials. It is shown that, in the self-adjoint quadratic case, non-real eigenvalues on W(L) are semisimple and (in a sense to be defined) they are normal. Also, for any eigenvalue at a point on W(L) where an external cone property is satisfied, the partial multiplicities cannot exceed two.     

Modular forms arising from spherical polynomials and positive definite quadratic forms

The dimension over the complex numbers of the vector space of θ-series

$\text{Φ(τ;P,Q)=∑n?Z}{}^{\mathrm{r}}\text{P(n)e}{}^{\mathrm{2\pi iQ(n)\tau }}\text{,}$

where P(X) is a “spherical polynomial” with respect to the positive definite quadratic form Q(X) is computed for binary forms. A sufficient condition that θ(τ; P, Q) be identically zero is proved, and its necessity is also proved for binary forms.     

On the best approximation and polynomials of the least quadratic deviation

Analysis Mathematica - ПустьС 2π — пространс тво...     

Deflating quadratic matrix polynomials with structure preserving transformations

Given a pair of distinct eigenvalues (λ₁,λ₂) of an n×n quadratic matrix polynomial Q(λ) with nonsingular leading coefficient and their corresponding eigenvectors, we show how to transform Q(λ) into a quadratic of the form having the same eigenvalue s as Q(λ), with Q_d(λ) an (n-1)×(n-1) quadratic matrix polynomial and q(λ) a scalar quadratic polynomial with roots λ₁ and λ₂. This block diagonalization cannot be achieved by a similarity transformation applied directly to Q(λ) unless the eigenvectors corresponding to λ₁ and λ₂ are parallel. We identify conditions under which we can construct a family of 2n×2n elementary similarity transformations that (a) are rank-two modifications of the identity matrix, (b) act on linearizations of Q(λ), (c) preserve the block structure of a large class of block symmetric linearizations of Q(λ), thereby defining new quadratic matrix polynomials Q₁(λ) that have the same eigenvalue s as Q(λ), (d) yield quadratics Q₁(λ) with the property that their eigenvectors associated with λ₁ and λ₂ are parallel and hence can subsequently be deflated by a similarity applied directly to Q₁(λ). This is the first attempt at building elementary transformations that preserve the block structure of widely used linearizations and which have a specific action.     

A quadratic approximation for protein sequence to structure mapping

The existence and representations of some generalized inverses, includingA _{T, *} ⁽²⁾ ,A _{T, *} ^(1,2) ,A _{T, *} ^(2,3) ,A _*,S ⁽²⁾ ,A _*,S ^(1,2) andA _*,S ^(2,4) , are showed. As applications, the perturbation theory for the generalized inverseA _T,S ⁽²⁾ and the perturbation bound for unique solution of the general restricted systemAx=b (dim (AT)=dimT,b∈AT andx∈T) are studied. Moreover, a characterization and representation of the generalized inverseA _{T, *} ^Emphasis>(2) is obtained.     

Inexact restoration method for minimization problems arising in electronic structure calculations

An inexact restoration (IR) approach is presented to solve a matricial optimization problem arising in electronic structure calculations. The solution of the problem is the closed-shell density matrix and the constraints are represented by a Grassmann manifold. One of the mathematical and computational challenges in this area is to develop methods for solving the problem not using eigenvalue calculations and having the possibility of preserving sparsity of iterates and gradients. The inexact restoration approach enjoys local quadratic convergence and global convergence to stationary points and does not use spectral matrix decompositions, so that, in principle, large-scale implementations may preserve sparsity. Numerical experiments show that IR algorithms are competitive with current algorithms for solving closed-shell Hartree-Fock equations and similar mathematical problems, thus being a promising alternative for problems where eigenvalue calculations are a limiting factor.     

Multiplicative dependence of quadratic polynomials

We investigate the multiplicative dependence relations with the values of quadratic integer polynomials at integer points. In particular, we use some elementary identities and the Pell equation in showing that such a relation exists between four values of the polynomial. Partially supported by the Lithuanian State Science and Studies Foundation. Vilnius University, Naugarduko 24, 2006 Vilnius, Lithuania. Published in Lietuvos Matematikos Rinkinys, Vol. 38, No. 3, pp. 295–303, July–September, 1998.     

Admissibility of kneading sequences and structure of Hubbard trees for quadratic polynomials

Hubbard trees are invariant trees connecting the points of thecritical orbits of post-critically finite polynomials. Douadyand Hubbard showed in the Orsay Notes that they encode all combinatorialproperties of the Julia sets. For quadratic polynomials, onecan describe the dynamics as a subshift on two symbols, anditinerary of the critical value is called the kneading sequence.Whereas every (pre)periodic sequence is realized by an abstractHubbard tree (see the authors’ preprint from 2007), notevery such tree is realized by a quadratic polynomial. In thispaper, we give an Admissibility Condition that describes preciselywhich sequences correspond to quadratic polynomials. We identifythe occurrence of the so-called ‘evil branch points’as the sole obstruction to being realizable. We also show howto derive the properties of periodic (branch) points in thetree (their periods, relative positions, number of arms andwhether they are evil or not) from the kneading sequence.     

Universal sums of three quadratic polynomials

Let a,b,c,d,e and f be integers with a≥ c≥ e> 0,b>-a and b≡a(mod 2),d>-c and d≡c(mod 2),f>-e and f≡e(mod 2).Suppose that b≥d if a=c,and d≥f if c=e.When b(a-b),d(c-d) and f(e-f) are not all zero,we prove that if each n∈N={0,1,2,...} can be written as x(ax+b)/2+y(cy+d)/2+z(ez+f)/2 with x,y,z∈N then the tuple(a,b,c,d,e,f) must be on our list of 473 candidates,and show that 56 of them meet our purpose.When b∈[0,a),d∈[0,c) and f∈[0,e),we investigate the universal tuples(a,b,c,d,e,f) over Z for which any n∈N can be written as x(ax+b)/2+y(cy+d)/2+z(ez+f)/2 with x,y,z∈Z,and show that there are totally 12,082 such candidates some of which are proved to be universal tuples over Z.For example,we show that any n∈N can be written as x(x+1)/2+y(3y+1)/2+z(5z+1)/2 with x,y,z∈Z,and conjecture that each n∈N can be written as x(x+1)/2+y(3y+1)/2+z(5z+1)/2 with x,y,z∈N.     

Indefinite quadratic polynomials of small signature

LetF()=Q()+L() be a real quadratic polynomial with no constant term. Suppose that the quadratic partQ() is indefinite of type (r, n-r). For an integerk4 we show that if min (r, n-r) >-k there exists a functionf (n, k)=–1/2+3/(4k+2)+O _k (1/n) with the following property. For any >0 and all large enoughX there is an integer vector 0 such that || X and.     

Annihilating polynomials of excellent quadratic forms

If φ is an excellent form, then it is possible to use the dimensions of the higher complements of φ to obtain an annihilating polynomial of φ of low degree. The main result of this paper is the construction of such a polynomial with the help of methods from the theory of generic splitting of quadratic forms. Received: 23 April 2007     

On polynomials of best approximation

In the space of continuous functions defined on the ball from ?ⁿ, n ≥ 2, we study the set of algebraic polynomials of least deviation from zero. Its width and dimension are estimated.     

Incomplete polynomials of best approximation

The main theorem proved in this paper is as follows. There exist odd functionsf ɛC[−1,1] with the following property. LetP _n be the polynomial of best uniform approximation tof of degree≦n. Then for infinitely manyn,P _n has zero of orders(n)≧c logn atx=0. This research has been supported by Grant MPS 75-09833 of the National Science Foundation.     

Spectral approximation by L 2 discretization of the Laplace operator on manifolds of bounded geometry

The author considers a discretization of the p-form Laplacian on open complete Riemannian manifolds of bounded geometry. Following Dodziuk and Patodi [8], the eigenvalues below the essential spectrum together with their eigenforms are approximated by eigenvalues and eigencochains of a semicombinatorical Laplacian acting on L ₂-cochains. We obtain a similar result for a ray which is contained in the essential spectrum. An example of a manifold of bounded geometry which admits eigenvalues below the essential spectrum is constructed.