Adaptive wavelet methods for elliptic operator equations: Convergence rates

This paper is concerned with the construction and analysis of wavelet-based adaptive algorithms for the numerical solution of elliptic equations. These algorithms approximate the solution of the equation by a linear combination of wavelets. Therefore, a benchmark for their performance is provided by the rate of best approximation to by an arbitrary linear combination of wavelets (so called -term approximation), which would be obtained by keeping the largest wavelet coefficients of the real solution (which of course is unknown). The main result of the paper is the construction of an adaptive scheme which produces an approximation to with error in the energy norm, whenever such a rate is possible by -term approximation. The range of 0$"> for which this holds is only limited by the approximation properties of the wavelets together with their ability to compress the elliptic operator. Moreover, it is shown that the number of arithmetic operations needed to compute the approximate solution stays proportional to . The adaptive algorithm applies to a wide class of elliptic problems and wavelet bases. The analysis in this paper puts forward new techniques for treating elliptic problems as well as the linear systems of equations that arise from the wavelet discretization.

     

Adaptive Wavelet Methods II—Beyond the Elliptic Case

This paper is concerned with the design and analysis of adaptive wavelet methods for systems of operator equations. Its main accomplishment is to extend the range of applicability of the adaptive wavelet-based method developed in [17] for symmetric positive definite problems to indefinite or unsymmetric systems of operator equations. This is accomplished by first introducing techniques (such as the least squares formulation developed in [26]) that transform the original (continuous) problem into an equivalent infinite system of equations which is now well-posed in the Euclidean metric. It is then shown how to utilize adaptive techniques to solve the resulting infinite system of equations. This second step requires a significant modification of the ideas from [17]. The main departure from [17] is to develop an iterative scheme that directly applies to the infinite-dimensional problem rather than finite subproblems derived from the infinite problem. This rests on an adaptive application of the infinite-dimensional operator to finite vectors representing elements from finite-dimensional trial spaces. It is shown that for a wide range of problems, this new adaptive method performs with asymptotically optimal complexity, i.e., it recovers an approximate solution with desired accuracy at a computational expense that stays proportional to the number of terms in a corresponding wavelet-best N -term approximation. An important advantage of this adaptive approach is that it automatically stabilizes the numerical procedure so that, for instance, compatibility constraints on the choice of trial spaces, like the LBB condition, no longer arise.     

Approximation characteristics for diagonal operators in different computational settings

First we study several extremal problems on minimax, and prove that they are equivalent. Then we connect this result with the exact values of some approximation characteristics of diagonal operators in different settings, such as the best n-term approximation, the linear average and stochastic n-widths, and the Kolmogorov and linear n-widths. Most of these exact values were known before, but in terms of equivalence of these extremal problems, we present a unified approach to give them a direct proof.     

Optimal solvers for linear systems with fractional powers of sparse SPD matrices

In this paper, we consider efficient algorithms for solving the algebraic equation , 0<α<1, where is a properly scaled symmetric and positive definite matrix obtained from finite difference or finite element approximations of second‐order elliptic problems in , d=1,2,3. This solution is then written as with with β positive integer. The approximate solution method we propose and study is based on the best uniform rational approximation of the function t^β−α for 0<t≤1 and on the assumption that one has at hand an efficient method (e.g., multigrid, multilevel, or other fast algorithms) for solving equations such as , c≥0. The provided numerical experiments confirm the efficiency of the proposed algorithms.     

Ridge Functions and Orthonormal Ridgelets

Orthonormal ridgelets provide an orthonormal basis for L²(R²) built from special angularly-integrated ridge functions. In this paper we explore the relationship between orthonormal ridgelets and true ridge functions r(x₁ cos θ+x₂ sin θ). We derive a formula for the ridgelet coefficients of a ridge function in terms of the 1-D wavelet coefficients of the ridge profile r(t). The formula shows that the ridgelet coefficients of a ridge function are heavily concentrated in ridge parameter space near the underlying scale, direction, and location of the ridge function. It also shows that the rearranged weighted ridgelet coefficients of a ridge function decay at essentially the same rate as the rearranged weighted 1-D wavelet coefficients of the 1-D ridge profile r(t). In short, the full ridgelet expansion of a ridge function is in a certain sense equally as sparse as the 1-D wavelet expansion of the ridge profile. It follows that partial ridgelet expansions can give good approximations to objects which are countable superpositions of well-behaved ridge functions. We study the nonlinear approximation operator which “kills” coefficients below certain thresholds (depending on angular- and ridge-scale); we show that for approximating objects which are countable superpositions of ridge functions with 1-D ridge profiles in the Besov space B^1/p_p, p(R), 0<p<1, the thresholded ridgelet approximation achieves optimal rates of N-term approximation. This implies that appropriate thresholding in the ridgelet basis is equally as good, for certain purposes, as an ideally-adapted N-term nonlinear ridge approximation, based on perfect choice of N-directions.     

OnM-ideals and best approximation

In this paper we will prove some theorems on theM-ideals of compact operators and the best approximation of quasitriangular operator algebras. These results improve and extend the known results in [4, 5, 7].This work is supported in part by the National Natural Science Foundation of China.     

Matrix and vector models in the strong coupling limit

We consider matrix and vector models in the large-N limit: we study N × N matrices and vectors with N² components. In the case of a zero-dimensional model (D = 0), we prove that in the strong coupling limit (g → ∞), the partition functions of the two models coincide up to a coefficient. This also holds for D = 1. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 155, No. 2, pp. 236–243, May, 2008.     

Asymptotic analysis of nonselfadjoint operators generated by coupled Euler‐Bernoulli and Timoshenko beam model

In the current paper, we present a series of results on the asymptotic and spectral analysis of coupled Euler‐Bernoulli and Timoshenko beam model. The model is well‐known in the different branches of the engineering sciences, such as in mechanical and civil engineering (in modelling of responses of the suspended bridges to a strong wind), in aeronautical engineering (in predicting and suppressing flutter in aircraft wings, tails, and control surfaces), in engineering and practical aspects of the computer science (in suppressing bending‐torsional flutter of a new generation of hard disk drives, which is expected to pack high track densities (20,000+TPI) and rotate at very high speeds (25,000+RPM)), in medical science (in bio mechanical modelling of bloodcarrying vessels in the body, which are elastic and collapsible). The aforementioned mathematical model is governed by a system of two coupled differential equations and a two parameter family of boundary conditions representing the action of the self‐straining actuators. This linear hyperbolic system is equivalent to a single operator evolution equation in the energy space. That equation defines a semigroup of bounded operators and a dynamics generator of the semigroup is our main object of interest. We formulate and proof the following results: (a) the dynamics generator is a nonselfadjoint operator with compact resolvent from the class ??p with p > 1; (b) precise spectral asymptotics for the two‐branch discrete spectrum; (c) a nonselfadjoint operator, which is the inverse of the dynamics generator, is a finite‐rank perturbation of a selfadjoint operator. The latter fact is crucial for the proof that the root vectors of the dynamics generator form a complete and minimal set. In our forthcoming paper, we will use the spectral results to prove that the dynamics generator is Riesz spectral, which will allow us to solve several boundary and distributed controllability problems via the spectral decomposition method. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Strong uniqueness of best approximations in spaces of bounded linear operators

The present paper is concerned with problems of the strong uniqueness of thebest approximation and the characterization of a uniqueness element in operator spaces.Some results on the strong uniqueness of the best approximation operator from RS-setsare proved and the uniqueness element of a sun in the compact operator space from c_0to c_0 is characterized by the strict Kolmogorov's condition. Some recent results due toLewicki and others are extended and improved.     

Adaptive methods for boundary integral equations: Complexity and convergence estimates

This paper is concerned with developing numerical techniques for the adaptive application of global operators of potential type in wavelet coordinates. This is a core ingredient for a new type of adaptive solvers that has so far been explored primarily for PDEs. We shall show how to realize asymptotically optimal complexity in the present context of global operators. ``Asymptotically optimal' means here that any target accuracy can be achieved at a computational expense that stays proportional to the number of degrees of freedom (within the setting determined by an underlying wavelet basis) that would ideally be necessary for realizing that target accuracy if full knowledge about the unknown solution were given. The theoretical findings are supported and quantified by the first numerical experiments.

     

Weak Type Inequalities for Best Simultaneous Approximation in Banach Spaces

For arbitrary Banach spaces Butzer and Scherer in 1968 showed that the approximation order of best approximation can characterized by the order of certain K-functionals. This general theorem has many applications such as the characterization of the best approximation of algebraic polynomials by moduli of smoothness involving the Legendre, Chebyshev, or more general the Jacobi transform. In this paper we introduce a family of seminorms on the underlying approximation space which leads to a generalization of the Butzer–Scherer theorems. Now the characterization of the weighted best algebraic approximation in terms of the so-called main part modulus of Ditzian and Totik is included in our frame as another particular application. The goal of the paper is to show that for the characterization of the orders of best approximation, simultaneous approximation (in different spaces), reduction theorems, and K-functionals one has (essentially) only to verify three types of inequalities, namely inequalities of Jackson-, Bernstein-type and an equivalence condition which guarantees the equivalence of the seminorm and the underlying norm on certain subspaces. All the results are given in weak-type estimates for almost arbitrary approximation orders, the proofs use only functional analytic methods.     

Pointwise characterization for combinations of Szász-Mirakjan operators

The purpose of this paper is to characterize the pointwise rate of convergence for the combinations of Szász-Mirakjan operators using Ditzian-Totik modulus of smoothness.     

On the usage of refined linear models for determiningN-way classification designs which are optimal for comparing test treatments with a standard treatment

Summary In this paper we consider experimental settings in whichv test treatments are to be compared to some control or standard treatment and where heterogeneity needs to be eliminated inn-directions. Using techniques similar to those used by Kunnert (1983,Ann. Statist.,11, 247–257) concerning the determination of optimal designs under a refined linear model, some methods are given for constructingn-way classification designs which areA- andMV-optimal for estimating elementary treatment differences involving the standard treatment fromm-way classification designs,m<n, which areA- andMV-optimal for estimating the same treatment differences. Examples are given for the casen=2 to show how the results obtained can be applied. This research was supported by NSF grant No. DMS-8401943.     

Properties of a Family of Operators

In this paper we define a family of new nonsymmetric operators of generalized translation and describe their properties. For each of these operators, we introduce a generalized modulus of smoothness, for which the direct and inverse theorems of approximation theory are given.     

Optimal approximation of elliptic problems by linear and nonlinear mappings III: Frames

We study the optimal approximation of the solution of an operator equation by certain n-term approximations with respect to specific classes of frames. We consider worst case errors, where f is an element of the unit ball of a Sobolev or Besov space and is a bounded Lipschitz domain; the error is always measured in the H^s-norm. We study the order of convergence of the corresponding nonlinear frame widths and compare it with several other approximation schemes. Our main result is that the approximation order is the same as for the nonlinear widths associated with Riesz bases, the Gelfand widths, and the manifold widths. This order is better than the order of the linear widths iff p<2. The main advantage of frames compared to Riesz bases, which were studied in our earlier papers, is the fact that we can now handle arbitrary bounded Lipschitz domains—also for the upper bounds.     

The spectra and singular values of multidimensional integral operators with bihomogeneous kernels

We consider the multidimensional integral operators with bihomogeneous kernel invariant under all rotations. For truncated operators of the type we describe the limit behavior of the set of singular values and in the case when these operators are selfadjoint we describe the limit behavior of their spectra.     

Index theory of geometric Fredholm operators on varieties with isolated singularities

It sometimes happens that geometric elliptic differential operators on a noncompact Riemannian manifold are Fredholm. The smooth parts of singular algebraic varieties provide examples of complete and incomplete manifolds where this can happen. The indices of such operators often provide topological or geometric information about the singular variety. This paper shows that the operators of the title represent K homology elements and solves the index problem for these operators by exhibiting equivalent K homology cycles in topological form.This material is based upon work supported by the National Science Foundation under Grant No. DMS-8501513.     

Integral representation of the W-weighted Drazin inverse for Hilbert space operators

This paper studies the integral representation of the W-weighted Drazin inverse for bounded linear operators between Hilbert spaces. By using operator matrix blocks, some integral representations of the W-weighted Drazin inverse for Hilbert space operators are established.     

λ-central BMO estimates for commutators of singular integral operators with rough kernels

The authors establish λ-central BMO estimates for commutators of singular integral operators with rough kernels on central Morrey spaces. Moreover, the boundedness of a class of multisublinear operators on the product of central Morrey spaces is discussed. As its special cases, the corresponding results of multilinear Calderon-Zygmund operators and multilinear fractional integral operators can be deduced, resDectivelv.