Characterizing the inf-sup condition on product spaces

In this paper we establish characterization results for the continuous and discrete inf-sup conditions on product spaces. The inf-sup condition for each component of the bilinear form involved and suitable decompositions of the pivot space in terms of the associated null spaces are the key ingredients of our theorems. We illustrate the theory through its application to bilinear forms arising from the variational formulations of several boundary value problems. Dedicated to Professor Ivo Babuska on the occasion of his 82nd birthday. This research was partially supported by Centro de Modelamiento Matemático (CMM) of the Universidad de Chile, by Centro de Investigación en Ingenierí a Matemática (CI²MA) of the Universidad de Concepción, by FEDER/MCYT Project MTM2007-63204, and by Gobierno de Aragón (Grupo Consolidado PDIE).     

A monotone iterative technique for stationary and time dependent problems in Banach spaces

An abstract monotone iterative method is developed for operators between partially ordered Banach spaces for the nonlinear problem Lu=Nu and the nonlinear time dependent problem u^′=(L+N)u. Under appropriate assumptions on L and N we obtain maximal and minimal solutions as limits of monotone sequences of solutions of linear problems. The results are illustrated by means of concrete examples.     

Adaptive polynomial preconditioning for hermitian indefinite linear systems

This paper explores the use of polynomial preconditioned CG methods for hermitian indefinite linear systems,Ax=b. Polynomial preconditioning is attractive for several reasons. First, it is well-suited to vector and/or parallel architectures. It is also easy to employ, requiring only matrix-vector multiplication and vector addition. To obtain an optimum polynomial preconditioner we solve a minimax approximation problem. The preconditioning polynomial,C(), is optimum in that it minimizes a bound on the condition number of the preconditioned matrix,C(A)A. We also characterize the behavior of this minimax polynomial, which makes possible a thorough understanding of the associated CG methods. This characterization is also essential to the development of an adaptive procedure for dynamically determining the optimum polynomial preconditioner. Finally, we demonstrate the effectiveness of polynomial preconditioning in a variety of numerical experiments on a Cray X-MP/48. Our results suggest that high degree (20–50) polynomials are usually best.This research was supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Dept. of Energy, by Lawrence Livermore National Laboratory under contract W-7405-ENG-48.This research was supported in part by the Dept. of Energy and the National Science Foundation under grant DMS 8704169.This research was supported in part by U.S. Dept. of Energy grant DEFG02-87ER25026 and by National Science Foundation grant DMS 8703226.     

On variable stepsize Runge-Kutta approximations of a Cauchy problem for the evolution equation

We consider a Cauchy problem for the sectorial evolution equation with generally variable operator in a Banach space. Variable stepsize discretizations of this problem by means of a strongly A(φ)-stable Runge-Kutta method are studied. The stability and error estimates of the discrete solutions are derived for wider families of nonuniform grids than quasiuniform ones (in particular, if the operator in question is constant or Lipschitz-continuous, for arbitrary grids).     

On the spectral radius of positive operators on Banach sequence spaces

Let K₁,…,K_n be (infinite) non-negative matrices that define operators on a Banach sequence space. Given a function f:[0,∞)×…×[0,∞)→[0,∞) of n variables, we define a non-negative matrix and consider the inequality

     

On the spectra of sums of orthogonal projections with applications to parallel computing

Many parallel iterative algorithms for solving symmetric, positive definite problems proceed by solving in each iteration, a number of independent systems on subspaces. The convergence of such methods is determined by the spectrum of the sums of orthogonal projections on those subspaces, while the convergence of a related sequential method is determined by the spectrum of the product of complementary projections. We study spectral properties of sums of orthogonal projections and in the case of two projections, characterize the spectrum of the sum completely in terms of the spectrum of the product.This work was supported in part by the Norwegian Research Council for Science and the Humanities under grant D.01.08.054 and by The Royal Norwegian Council for Scientific and Industrial Research under grant IT2.28.28484; also supported in part by the Air Force Office of Scientific Research under grant AFOSR-86-0126 and by the National Science Foundation under grant DMS-8704169.     

Fredholm theory and finite section method for band-dominated operators

The topics of this paper are Fredholm properties and the applicability of the finite section method for band operators onl ^p -spaces as well as for their norm limits which we call band-dominated operators. The derived criteria will be established in terms of the limit operators of the given band-dominated operator. After presenting the general theory, we present its specifications to concrete classes of band-dominated operators.To the memory of Professor Mark KreinSupported by the DFG grant 436 RUS/17/148/95Supported by a DFG Heisenberg grant     

Cyclicity of bicyclic operators and completeness of translates

We study cyclicity of operators on a separable Banach space which admit a bicyclic vector such that the norms of its images under the iterates of the operator satisfy certain growth conditions. A simple consequence of our main result is that a bicyclic unitary operator on a Banach space with separable dual is cyclic. Our results also imply that if is the shift operator acting on the weighted space of sequences , if the weight ω satisfies some regularity conditions and ω(n) = 1 for nonnegative n, then S is cyclic if . On the other hand one can see that S is not cyclic if the series diverges. We show that the question of Herrero whether either S or S* is cyclic on admits a positive answer when the series is convergent. We also prove completeness results for translates in certain Banach spaces of functions on .     

Connes' embedding conjecture and sums of hermitian squares

We show that Connes' embedding conjecture on von Neumann algebras is equivalent to the existence of certain algebraic certificates for a polynomial in noncommuting variables to satisfy the following nonnegativity condition: The trace is nonnegative whenever self-adjoint contraction matrices of the same size are substituted for the variables. These algebraic certificates involve sums of hermitian squares and commutators. We prove that they always exist for a similar nonnegativity condition where elements of separable II₁-factors are considered instead of matrices. Under the presence of Connes' conjecture, we derive degree bounds for the certificates.     

A mountain pass algorithm with projector

In this paper, we present an enhanced version of the minimax algorithm of Chen, Ni, and Zhou that offers the additional guarantee that the solution found is a fix-point of a projector on a cone. Positivity, negativity, and monotonicity can be expressed in this way. The convergence of the algorithm is proved by means of a “computational deformation lemma” instead of the usual deformation lemma used in the calculus of variations.     

Generalized hermitian operators

In this paper, the concept of generalized hermitian operators defined on a complex Hilbert space is introduced. It is shown that the spectrums and the Fredholm fields of generalized hermitian operators are both symmetric with respect to the real axis. Some other results on generalized hermitian operators are obtained.     

On some norm equalities in pre-Hilbert C*-modules

We characterize when the norm of the sum of two elements in a pre-Hilbert C*-module equals the sum of their norms. We also give the necessary and sufficient conditions for two orthogonal elements of a pre-Hilbert C*-module to satisfy Pythagoras’ equality.     

On combining feasibility,descent and superlinear convergence in inequality constrained optimization

Extension of quasi-Newton techniques from unconstrained to constrained optimization via Sequential Quadratic Programming (SQP) presents several difficulties. Among these are the possible inconsistency, away from the solution, of first order approximations to the constraints, resulting in infeasibility of the quadratic programs; and the task of selecting a suitable merit function, to induce global convergence. In ths case of inequality constrained optimization, both of these difficulties disappear if the algorithm is forced to generate iterates that all satisfy the constraints, and that yield monotonically decreasing objective function values. (Feasibility of the successive iterates is in fact required in many contexts such as in real-time applications or when the objective function is not well defined outside the feasible set.) It has been recently shown that this can be achieved while preserving local two-step superlinear convergence. In this note, the essential ingredients for an SQP-based method exhibiting the desired properties are highlighted. Correspondingly, a class of such algorithms is described and analyzed. Tests performed with an efficient implementation are discussed.This research was supported in part by NSF's Engineering Research Centers Program No. NSFD-CDR-88-03012, and by NSF grants No. DMC-84-51515 and DMC-88-15996.     

A coercive James’s weak compactness theorem and nonlinear variational problems

We discuss a perturbed version of James’s sup theorem for weak compactness that not only properly generalizes that classical statement, but also some recent extensions of this central result: the sublevel sets of an extended real valued and coercive function whose subdifferential is surjective are relatively weakly compact. Furthermore, we apply it to generalize and unify some facts in mathematical finance and to prove that the unique possible framework in the development of an existence theory for a wide class of nonlinear variational problems is the reflexive one.     

Dimension splitting for evolution equations

In this paper, we are concerned with splitting methods for the time integration of abstract evolution equations. We introduce an analytic framework which allows us to prove optimal convergence orders for various splitting methods, including the Lie and Peaceman–Rachford splittings. Our setting is applicable for a wide variety of linear equations and their dimension splittings. In particular, we analyze parabolic problems with Dirichlet boundary conditions, as well as degenerate equations on bounded domains. We further illustrate our theoretical results with a set of numerical experiments. This work was supported by the Austrian Science Fund under grant M961-N13.     

On polynomial variance functions

Summary Let be a natural exponential family on and (V, ) be its variance function. Here, is the mean domain of andV, defined on , is the variance of . A problem of increasing interest in the literature is the following: Given an open interval and a functionV defined on , is the pair (V, ) a variance function of some natural exponential family? Here, we consider the case whereV is a polynomial. We develop a complex-analytic approach to this problem and provide necessary conditions for (V, ) to be such a variance function. These conditions are also sufficient for the class of third degree polynomials and certain subclasses of polynomials of higher degree.     

A note on operator probability theory involving numerical ranges

In this note, the relationships between the expectation and variance in operator probability theory and numerical range of operators are considered.     

Galerkin-wavelet methods for two-point boundary value problems

Summary Anti-derivatives of wavelets are used for the numerical solution of differential equations. Optimal error estimates are obtained in the applications to two-point boundary value problems of second order. The orthogonal property of the wavelets is used to construct efficient iterative methods for the solution of the resultant linear algebraic systems. Numerical examples are given.This work was supported by National Science Foundation     

ON TOPOLOGICAL LINEAR CONTRACTIONS ON NORMED SPACES AND APPLICATION

51.IntroductionandPreliminariesThroughoutthispaper(X,11'if)denotesanormedspaceandN(11'II)denotesthecollectionofallnormsonXwhichareequivalentto11'11.Foreach11'if'6N(II'II)andeachr>0,letX.(ll'II')~{xEX:Ilxll'5r}andX?(ll'if')~{xEX.Ilxll'相似文献