On a Projection from One Co – Invariant Subspace onto Another in Character – Automorphic Hardy Space on a Multiply Connected Domain

In a case of a theory in a unit disk the solution of a problem on the invertibility of an orthogonal projection from one co–invariant subspace of the shift operator onto another turned out to be essential for the solution of the problem on the Riesz basis property of the reproducing kernels and in particular for the solution of the problem on the basis of exponentials in L₂ space on a segment. In the present paper we are dealing with the similar problems in harmonic analysis on a finitely connected domain. Namely we obtain necessary and sufficient conditions for the invertibility of an orthogonal projection from one co – invariant subspace of character – automorphic Hardy space in the domain onto another. The given condition has a form of a Muckenhoupt condition for a certain weight on the boundary of the domain, but essentially depends on a character. Namely, for two fixed character – automorphic inner functions, which define the co – invariant subspaces, the projection may be invertible for one character and not invertible for another.     

Invariant G2V algorithm for computing SAGBI-Gröbner bases

Faugère and Rahmany have presented the invariant F5 algorithm to compute SAGBI-Grbner bases of ideals of invariant rings. This algorithm has an incremental structure, and it is based on the matrix version of F5 algorithm to use F5 criterion to remove a part of useless reductions. Although this algorithm is more efficient than the Buchberger-like algorithm, however it does not use all the existing criteria (for an incremental structure) to detect superfluous reductions. In this paper, we consider a new algorithm, namely, invariant G2V algorithm, to compute SAGBI-Grbner bases of ideals of invariant rings using more criteria. This algorithm has a new structure and it is based on the G2V algorithm; a variant of the F5 algorithm to compute Grbner bases. We have implemented our new algorithm in Maple , and we give experimental comparison, via some examples, of performance of this algorithm with the invariant F5 algorithm.     

New models for locating a moving service facility

In this paper we analyze a new location problem which is a generalization of the well-known single facility location model. This extension consists of introducing a general objective function and replacing fixed locations by trajectories. We prove that the problem is well-stated and solvable. A Weiszfeld type algorithm is proposed to solve this generalized dynamic single facility location problem on L ^p spaces of functions, with p ∈(1,2]. We prove global convergence of our algorithm once we have assumed that the set of demand functions and the initial step function belong to a subspace of L ^p called Sobolev space. Finally, examples are included illustrating the application of the model to generalized regression analysis and the convergence of the proposed algorithm. The examples also show that the pointwise extension of the algorithm does not have to converge to an optimal solution of the considered problem while the proposed algorithm does.     

<Emphasis Type="Italic">K</Emphasis>th Roots of <Emphasis Type="Italic">p</Emphasis>-Hyponormal Operators are Subscalar Operators of Order 4<Emphasis Type="Italic">k</Emphasis>

In this paper, we consider the special case of the question raised by Halmos (see below). In particular, we show that if T^k is p-hyponormal, then T is a subscalar operator of order 4k. As a corollary, we obtain that if T^k is p-hyponormal and σ(T) has nonempty interior in the plane, then T has a nontrivial invariant subspace.     

An Iterative Technique for Construction of Invariant Subspaces

The restarted GMRES(m ) method for solving linear systems Ax = b is attractive when a good preconditioner is available. The determining of efficient preconditioners is often connected to a construction of an A –invariant subspace corresponding to eigenvalues closest to zero. One class of methods for determination of invariant subspaces is based on the construction of polynomial filters. We study the usage of Tchebychev polynomials for constructing suitable filters. Applying filters on the initial restart vectors amplifies the components of eigenvectors belonging to the small (wanted) eigenvalues and damp the remaining (unwanted) components. The presented convergence theorem describes the repeated application of filters for the construction of the wanted eigenspace of the matrix A . (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A linear system solver based on a modified Krylov subspace method for breakdown recovery

Despite its usefulness in solving eigenvalue problems and linear systems of equations, the nonsymmetric Lanczos method is known to suffer from a potential breakdown problem. Previous and recent approaches for handling the Lanczos exact and near-breakdowns include, for example, the look-ahead schemes by Parlett-Taylor-Liu [23], Freund-Gutknecht-Nachtigal [9], and Brezinski-Redivo Zaglia-Sadok [4]; the combined look-ahead and restart scheme by Joubert [18]; and the low-rank modified Lanczos scheme by Huckle [17]. In this paper, we present yet another scheme based on a modified Krylov subspace approach for the solution of nonsymmetric linear systems. When a breakdown occurs, our approach seeks a modified dual Krylov subspace, which is the sum of the original subspace and a new Krylov subspaceK _m (w _j ,A ^T ) wherew _j is a newstart vector (this approach has been studied by Ye [26] for eigenvalue computations). Based on this strategy, we have developed a practical algorithm for linear systems called the MLAN/QM algorithm, which also incorporates the residual quasi-minimization as proposed in [12]. We present a few convergence bounds for the method as well as numerical results to show its effectiveness.Research supported by Natural Sciences and Engineering Research Council of Canada.     

Invertible composition operators on Hp

The weakly closed algebras generated by certain sets of composition operators are shown to be reflexive. A structure theorem for invertible composition operators on H² is obtained and used to show that such operators are reflexive. The structure theorem shows that invertible hyperbolic composition operators are similar to cosubnormal operators built up from bilateral weighted shifts. Another consequence of the structure theorem is that the composition operators induced by hyperbolic disc automorphisms are universal. Thus the general invariant subspace problem for Hilbert space operators is contained in the problem of determining the invariant subspace lattices of these operators.     

A new algorithm of non-Gaussian component analysis with radial kernel functions

We consider high-dimensional data which contains a linear low-dimensional non-Gaussian structure contaminated with Gaussian noise, and discuss a method to identify this non-Gaussian subspace. For this problem, we provided in our previous work a very general semi-parametric framework called non-Gaussian component analysis (NGCA). NGCA has a uniform probabilistic bound on the error of finding the non-Gaussian components and within this framework, we presented an efficient NGCA algorithm called Multi-index Projection Pursuit. The algorithm is justified as an extension of the ordinary projection pursuit (PP) methods and is shown to outperform PP particularly when the data has complicated non-Gaussian structure. However, it turns out that multi-index PP is not optimal in the context of NGCA. In this article, we therefore develop an alternative algorithm called iterative metric adaptation for radial kernel functions (IMAK), which is theoretically better justifiable within the NGCA framework. We demonstrate that the new algorithm tends to outperform existing methods through numerical examples.     

Regularity of weak solutions of Maxwell's equations with mixed boundary‐conditions

In this paper global H^s‐ and L^p‐regularity results for the stationary and transient Maxwell equations with mixed boundary conditions in a bounded spatial domain are proved. First it is shown that certain elements belonging to the fractional‐order domain of the Maxwell operator belong to H^s(Ω) for sufficiently small s > 0. It follows from this regularity result that H^s(Ω) is an invariant subspace of the unitary group corresponding to the homogeneous Maxwell equations with mixed boundary conditions. In the case that a possibly non‐linear conductivity is present a L^p‐regularity theorem for the transient equations is proved. Copyright © 1999 John Wiley & Sons, Ltd.     

On translation and dilation invariant subspaces of L p (ℝn), 0 < p < 1

We prove that each translation and dilation invariant subspace X ⊂ L ^p (ℝⁿ), X ≠ L ^p (ℝⁿ), is contained in a maximal translation and dilation invariant subspace of L ^p (ℝⁿ). Moreover, we prove that the set of all maximal translation and dilation invariant subspaces of L ^p (ℝⁿ) has the power of continuum. Bibliography: 6 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 345, 2007, pp. 5–21.     

Inverse subspace problems with applications

Given a square matrix A, the inverse subspace problem is concerned with determining a closest matrix to A with a prescribed invariant subspace. When A is Hermitian, the closest matrix may be required to be Hermitian. We measure distance in the Frobenius norm and discuss applications to Krylov subspace methods for the solution of large‐scale linear systems of equations and eigenvalue problems as well as to the construction of blurring matrices. Extensions that allow the matrix A to be rectangular and applications to Lanczos bidiagonalization, as well as to the recently proposed subspace‐restricted SVD method for the solution of linear discrete ill‐posed problems, also are considered.Copyright © 2013 John Wiley & Sons, Ltd.     

Continuity properties of Markov semigroups and their restrictions to invariant <Emphasis Type="Italic">L</Emphasis><Superscript>1</Superscript>-spaces

We consider Markov semigroups on the cone of positive finite measures on a complete separable metric space. Such a semigroup extends to a semigroup of linear operators on the vector space of measures that typically fails to be strongly continuous for the total variation norm. First we characterise when the restriction of a Markov semigroup to an invariant L ¹-space is strongly continuous. Aided by this result we provide several characterisations of the subspace of strong continuity for the total variation norm. We prove that this subspace is a projection band in the Banach lattice of finite measures, and consequently obtain a direct sum decomposition.     

Asymptotically Efficient Estimation of the Derivative of the Invariant Density

The problem of estimation of the derivative of the invariant density is considered for a one-dimensional ergodic diffusion process. The lower minimax bound on the L ²-type risk of all estimators is proposed and an asymptotically efficient (up to the constant) in the sense of this bound kernel-type estimator is constructed.     

Riemannian Geometry of Grassmann Manifolds with a View on Algorithmic Computation

We give simple formulas for the canonical metric, gradient, Lie derivative, Riemannian connection, parallel translation, geodesics and distance on the Grassmann manifold of p-planes in R ⁿ . In these formulas, p-planes are represented as the column space of n×p matrices. The Newton method on abstract Riemannian manifolds proposed by Smith is made explicit on the Grassmann manifold. Two applications – computing an invariant subspace of a matrix and the mean of subspaces – are worked out.     

On the effect of friend feedbacks

Given ?? an (A,B)‐invariant subspace, we prove that the set of friend feedbacks is a linear variety, which can be considered as the direct sum of the feedbacks of the restriction to ?? and the co‐restriction to ??^⊥. In particular, when the natural controllability hypothesis hold, both pole assignments are simultaneously possible by means of a convenient friend feedback. Copyright © 2010 John Wiley & Sons, Ltd.     

Formes différentielles sur l'espace projectif réel sous l'action du groupe linéaire général

Résumé On montre que les seuls sous-espaces invariants par transformations projectives et fermés pour la topologie C^∞ de l'espace desp-formes sur l'espace projectif réel sont les suivants le sous-espace nul, celui des formes exactes, celui des formes fermées, et l'espace lui-même-avec les co?ncidences bien connues entres ces sous-espaces. On résoud, aussi le problème analogue sur la sphère.

---

Summary We show that the only subspaces of the space ofp-forms on the real projective space which are invariant under projective transforms and closed for the C^∞ topology are the following ones: the zero subspace, the subspace of exact forms, the subspace of closed forms, and the space itself-with the well known coincidences between these subspaces. We also solve the analogous problem of the sphere.

     

Verified error bounds for eigenvalues of geometric multiplicity <Emphasis Type="Italic">q</Emphasis> and corresponding invariant subspaces

In this paper, we generalize the algorithm described by Rump and Graillat to compute verified and narrow error bounds such that a slightly perturbed matrix is guaranteed to have an eigenvalue with geometric multiplicity q within computed error bounds. The corresponding invariant subspace can be directly obtained by our algorithm. Our verification method is based on border matrix technique. We demonstrate the performance of our algorithm for matrices of dimension up to hundreds with non-defective and defective eigenvalues.     

Efficient Algorithms for the Smallest Enclosing Ball Problem

Consider the problem of computing the smallest enclosing ball of a set of m balls in ⁿ. Existing algorithms are known to be inefficient when n > 30. In this paper we develop two algorithms that are particularly suitable for problems where n is large. The first algorithm is based on log-exponential aggregation of the maximum function and reduces the problem into an unconstrained convex program. The second algorithm is based on a second-order cone programming formulation, with special structures taken into consideration. Our computational experiments show that both methods are efficient for large problems, with the product mn on the order of 10⁷. Using the first algorithm, we are able to solve problems with n = 100 and m = 512,000 in about 1 hour.His work was supported by Australian Research Council.Research supported in part by the Singapore-MIT Alliance.     

Almost Invariant Half-spaces of Algebras of Operators

Given a Banach space X and a bounded linear operator T on X, a subspace Y of X is almost invariant under T if TY í Y+F{TY\subseteq Y+F} for some finite-dimensional “error” F. In this paper, we study subspaces that are almost invariant under every operator in an algebra \mathfrak A{\mathfrak A} of operators acting on X. We show that if \mathfrak A{\mathfrak A} is norm closed then the dimensions of “errors” corresponding to operators in \mathfrak A{\mathfrak A} must be uniformly bounded. Also, if \mathfrak A{\mathfrak A} is generated by a finite number of commuting operators and has an almost invariant half-space (that is, a subspace with both infinite dimension and infinite codimension) then \mathfrak A{\mathfrak A} has an invariant half-space.     

Regular Factorization of the Scalar Characteristic Function

It is known that regular factorizations of the characteristic function of an operator describe its invariant subspaces. The case of a scalar characteristic function is considered. Some examples are given. The factorizations describing all chains of invariant subspaces containing a given subspace L are constructed by the factorization describing L. A representation of the regular factorization of a function is obtained in terms of factorizations of its inner and outer parts. Bibliography: 9 titles.