Wavelet Techniques for the Fictitious-Domain-Lagrange-Multiplier-Approach

We consider second order elliptic boundary value problems when essential boundary conditions are enforced with the aid of Lagrange multipliers. This is combined with a fictitious domain approach into which the physical domain is embedded. The resulting saddle point problem will be discretized in terms of wavelets, resulting in an operator equation in ₂. Stability of the discretization and consequently the uniform boundedness of the condition number of the finite-dimensional operator independent of the discretization is guaranteed by an appropriate LBB condition. For the iterative solution of the saddle point system, an incomplete Uzawa algorithm is employed. It can be shown that the iterative scheme combined with a nested iteration strategy is asymptotically optimal in the sense that it provides the solution up to discretization error on discretization level J in an overall amount of iterations of order O(N _J ), where N _J is the number of unknowns on level J. Finally, numerical results are provided.     

Adaptive wavelet schemes for an elliptic control problem with Dirichlet boundary control

An adaptive algorithm based on wavelets is proposed for the fast numerical solution of control problems governed by elliptic boundary value problems with Dirichlet boundary control. A quadratic cost functional representing Sobolev norms of the state and a regularization in terms of the control is to be minimized subject to linear constraints in weak form. In particular, the constraints are formulated as a saddle point problem that allows to handle the varying boundary conditions explicitly. In the framework of (biorthogonal) wavelets, a representer for the functional is derived in terms of ₂-norms of wavelet expansion coefficients and the constraints are written in form of an ₂ automorphism. Standard techniques from optimization are then used to deduce the resulting first order necessary conditions as a (still infinite) system in ₂. Applying the machinery developed in [8,9] which has been extended to control problems in [14], an adaptive method is proposed which can be interpreted as an inexact gradient method for the control. In each iteration step, in turn the primal and the adjoint saddle point system are solved up to a prescribed accuracy by an adaptive iterative Uzawa algorithm for saddle point problems which has been proposed in [10]. Under these premises, it can be shown that the adaptive algorithm containing now three layers of iterations is asymptotically optimal. This means that the convergence rate achieved for computing the solution up to a desired target tolerance is asymptotically the same as the wavelet-best N-term approximation of the solution, and the total computational work is proportional to the number of computational unknowns. AMS subject classification 65K10, 65N99, 93B40Angela Kunoth: This work has been supported partly by the Deutsche Forschungsgemeinschaft (SFB 611) at the Universität Bonn and by the European Communitys Human Potential Programme under contract HPRN-CT-2002-00286 Breaking Complexity.     

Subspaces of Lp Isometric to Subspaces of ℓ p

We present three results on isometric embeddings of a (closed, linear) subspace X of L_p=L_p[0,1] into _p . First we show that if p 2N, then X is isometrically isomorphic to a subspace of _p if and only if some, equivalently every, subspace of L_p which contains the constant functions and which is isometrically isomorphic to X, consists of functions having discrete distribution. In contrast, if p 2N; and X is finite-dimensional, then X is isometrically isomorphic to a subspace of _p , where the positive integer N depends on the dimension of X, on p , and on the chosen scalar field. The third result, stated in local terms, shows in particular that if p is not an even integer, then no finite-dimensional Banach space can be isometrically universal for the 2-dimensional subspaces of L_p .     

A new theorem of the alternative

Although the theorems of the alternative have been well known for a long time, their relationship to linear least squares problems and steepest descent directions was revealed only recently. This relationship was used by the author to derive a new theorem of the alternative. The present research extends this theorem to the _p norm,p > 1.     

ℓ1-Rigid Graphs

An ₁-graph is a graph whose nodes can be labeled by binary vectors in such a way that the Hamming distance between the binary addresses is, up to scale, the distance in the graph between the corresponding nodes. We show that many interesting graphs are ₁-rigid, i.e., that they admit an essentially unique such binary labeling.     

Spaces with Dual Order-Isomorphic to ℓ1

We establish that an ordered Banach space is order-isomorphic to c₀ if and only if it is a -Dedekind complete vector lattice and its norm dual is order-isomorphic to ₁.     

Weak-Polynomial Convergence on Spaces ℓ<Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> and <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>

This paper is concerned with the study of the set P ^-1(0), when P varies over all orthogonally additive polynomials on _p and L _p spaces. We apply our results to obtain characterizations of the weak-polynomial topologies associated to this class of polynomials.     

Transfer Function Optimization Procedure for the H 2/H ∞ Problem

In this paper, the H ₂/H problem is considered in a transfer-function setting, i.e., without a priori chosen bounds on the controller order. An optimization procedure is described which is based on a parametrization of all feasible descending directions stemming from a given point of the feasible transfer-function set. A search direction at each such point can be obtained on the basis of the solution of a convex finite-dimensional problem which can be converted into a LMI problem. Moving along the chosen direction in each step, the procedure in question generates a sequence of feasible points whose cost functional values converge to the optimal value of the H ₂/H problem. Moreover, this sequence of feasible points is shown to converge in the sense of a weighted H ₂ norm; and it does so to the solution of the H ₂/H problem whenever such a solution exists.     

Convergence Theorems for ℓ<Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-Norm Minimizers with Respect to <Emphasis Type="Italic">p</Emphasis>

Let C be a fixed compact convex subset of and let x_p be the unique minimal _p-norm element in C for any . In this paper, we study the convergence of x_p as p or , respectively. We characterize also the limit point as the minimal element of C with respect to the lexical minimax order relation or the lexical minitotal order relation, respectively.Communicated by D. G. LuenbergerThe author thanks Professor H. Komiya for valuable advice and an anonymous referee for kind comments.     

ℓ-norm and its Application to Learning Theory

We investigate connections between an important parameter in the theory of Banach spaces called the -norm, and two properties of classes of functions which are essential in Learning Theory – the uniform law of large numbers and the Vapnik–Chervonenkis (VC) dimension. We show that if the -norm of a set of functions is bounded in some sense, then the set satisfies the uniform law of large numbers. Applying this result, we show that if X is a Banach space which has a nontrivial type, then the unit ball of its dual satisfies the uniform law of large numbers. Next, we estimate the -norm of a set of {0,1}-functions in terms of its VC dimension. Finally, we present a `Gelfand number' like estimate of certain classes of functions. We use this estimate to formulate a learning rule, which may be used to approximate functions from the unit balls of several Banach spaces.     

On invexity-type nonlinear programming problems

In this paper, we propose a new class of nonlinear programing, called SFJ-invex programming. The optimality characterization shows that a problem is SFJ-invex if and only if a Fritz John point together with its multiplier, is a Fritz John saddle point of the problem. Under any constraint qualification assumption, a problem is SFJ-invex if and only if a Kuhn-Tucker point together with its multiplier is a Kuhn-Tucker saddle point of the problem. Furthermore, a generalization of the SFJ-invex, class is developed; the applications to (h, )-convex programming, particularly geometric programming, and to generalized fractional programming provide a relaxation in constraint qualification for differentiable problems to get saddle-point type optimality criteria.The author wishes to thank the referee for helpful comments.     

Interpolation problems of Pick-Nevanlinna and Loewner types for meromorphic matrix functions

Classical interpolation problems are concerned with the problem of finding an analytic function on the unit disk bounded by one which takes on prescribed values at certain prescribed points inside the disk (Pick-Nevanlinna) or on the boundary of the disk (Loewner). We consider the problem for matrix-valued functions having as many as poles ( a nonnegative integer) inside the disk but still uniformly bounded by one on the boundary of the disk. Our technique is an adaptation of that of Sz.-Nagy and Koranyi to spaces with an indefinite inner product. The problem arises in the broadband matching problem for electrical circuits and certain multichannel scattering problems in physics.Research supported by US National Science Foundation Grant MCS-8101678.     

M-ideals of compact operators into ℓp

We show for 2 p < and subspaces X of quotients of L _p with a 1-unconditional finite-dimensional Schauder decomposition that K(X, _p) is an M-ideal in L(X, _p).     

Polarizations on Abelian Varieties and Self-dual ℓ-adic Representations of Inertia Groups

It is well known that every finite subgroup of GL _d (Q ) is conjugate to a subgroup of GL _d (Z ). However, this does not remain true if we replace general linear groups by symplectic groups. We say that G is a group of inertia type of G is a finite group which has a normal Sylow-p-subgroup with cyclic quotient. We show that if >d+1, and G is a subgroup of Sp _2d (Q ) of inertia type, then G is conjugate in GL _2d (Q ) to a subgroup of Sp _2d (Z ). We give examples which show that the bound is sharp. We apply these results to construct, for every odd prime , isogeny classes of Abelian varieties all of whose polarizations have degree divisible by ². We prove similar results for Euler characteristic of invertible sheaves on Abelian varieties over fields of positive characteristic.     

Spaces with Vanishing ℓ2-Homology and their Fundamental Groups (after Farber and Weinberger)

We characterize those groups which can occur as the fundamental groups of finite CW-complexes with vanishing ²-homology (the first examples of such groups were obtained by Farber and Weinberger).     

Galois modular representation of associated Jacobians in the tamely ramified cyclic case

Let L/K be an ℓ-cyclic extension with Galois group G of algebraic function fields over an algebraically closed field k of characteristic p ≠  ℓ. In this paper, the -module structure of the ℓ-torsion of the Jacobian associated to L is explicitly determined.     

Hulls for Various Kinds of α-Completeness in Archimedean Lattice-Ordered Groups

Within Archimedean -groups, and with an infinite cardinal or , we consider X-hulls where X stands for any of the following classes of -groups: -projectable; laterally -complete; boundedly laterally -complete; conditionally -complete; combinations of the preceding, together with divisibility and/or relative uniform completeness. All these hulls exist, and may be obtained by iterated adjunction of the required extra elements, within the essential hull. When the -groups is relatively -complemented one step in the iteration suffices for several crucial properties. We derive from the above a considerable number of equations involving combinations of these hull operators.     

The Eta Invariant and the Real Connective K-Theory of the Classifying Space for Quaternion Groups

We express the real connective K-theory groups o_4k–1(B Q ) ofthe quaternion group Q of order = 2 ^j 8 in terms of therepresentation theory of Q by showing o_4k–1(B Q ) = Sp(S ^4k+3/Q )where is any fixed point free representation of Q in U(2k + 2).     

On Cross-intersecting Families of Sets

A family of -element subsets and a family of k-element subsets of an n-element set are cross-intersecting if every set from has a nonempty intersection with every set from . We compare two previously established inequalities each related to the maximization of the product , and give a new and short proof for one of them. We also determine the maximum of for arbitrary positive weights ,_k.     

Uniqueness of the Unconditional Basis of ?1 (?p) and ?p (?1), 0 < p < 1

We prove that the quasi-Banach spaces ₁ (_p) and _p (₁), 0 < p < 1 have a unique unconditional basis up to permutation