On uniform convergence of approximation methods for operator equations of the second kind

Schock (1985) has considered the convergence properties of various Galerkin-like methods for the approximate solution of the operator equation of the second kind x - Tx = y, where T is a bounded linear operator on a Banach space X, and x and y belong to X, and proved that the classical Galerkin method and in certain cases, the iterated Galerkin method are arbitrarily slowly convergent whereas the Kantororich method studied by him is uniformly convergent. It is the purpose of this paper to introduce a general class of approximations methods for x - Tx = y which includes the well-known methods of projection and the quadrature methods, and to characterize its uniform convergence, so that an arbitrarily slowly convergent method can be modified to obtain a uniformly convergent method.     

Fast conformal mapping of multiply connected regions

An iterative method is presented which constructs for an unbounded region G with m holes and sufficiently smooth boundary a circular region H and a conformal mapping Φ from H to G. With the usual normalization both H and Φ are uniquely determined by G. With a few modifications the method can also be applied to a bounded region G with m holes. The canonical region H is then the unit disc with m circular holes. The proposed method also determines the centers and radii of the boundary circles of H and requires, at each iterative step, the solution of a Riemann–Hilbert (RH) problem, which has a unique solution. Numerically, the RH problem can be treated efficiently by the method of successive conjugation using the fast Fourier transform (FFT). The iteration for the solution of the RH problem converges linearly. The conformal mapping method converges quadratically. The results of some test calculations exemplify the performance of the method.     

A Method of Deducing L-Polyhedra for n-Lattices

We suggest a method for selecting an L-simplex in an L-polyhedron of an n-lattice in Euclidean space. By taking into account the specific form of the condition that a simplex in the lattice is an L-simplex and by considering a simplex selected from an L-polyhedron, we present a new method for describing all types of L-polyhedra in lattices of given dimension n. We apply the method to deduce all types of L-polyhedra in n-dimensional lattices for n=2,3,4, which are already known from previous results.     

Crossing numbers of sequences of graphs II: Planar tiles

We describe a method of creating an infinite family of crossing‐critical graphs from a single small planar map, the tile, by gluing together many copies of the tile together in a circular fashion. This method yields all known infinite families of k‐crossing‐critical graphs. Furthermore, the method yields new infinite families, which extend from (4,6) to (3.5,6) the interval of rationals r for which there is, for some k, an infinite sequence of k‐crossing‐critical graphs all having average degree r. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 332–341, 2003     

Algebras of Approximation Sequences: Finite Sections of Band-Dominated Operators

We develop the stability theory for the finite section method for general band-dominated operators on l ^p spaces over Z ^k . The main result says that this method is stable if and only if each member of a whole family of operators – the so-called limit operators of the method – is invertible and if the norms of these inverses are uniformly bounded.     

Matrix transformations of summability domains of generalized matrix methods in Banach spaces

The necessary and sufficient conditions for a matrix M to be a transform from the summability domain of generalized matrix method A into the summability domain of another generalized matrix method B are proved. The elements of Mare continuous linear operators from a Banach space X into another Banach space Y, and the elements of A and B are continuous linear operators from X into X and from Y into Y, respectively. As a special case there are considered the case when A is the generalized Riesz method.     

An efficient algorithm for range computation of polynomials using the Bernstein form

We present a novel optimization algorithm for computing the ranges of multivariate polynomials using the Bernstein polynomial approach. The proposed algorithm incorporates four accelerating devices, namely the cut-off test, the simplified vertex test, the monotonicity test, and the concavity test, and also possess many new features, such as, the generalized matrix method for Bernstein coefficient computation, a new subdivision direction selection rule and a new subdivision point selection rule. The features and capabilities of the proposed algorithm are compared with those of other optimization techniques: interval global optimization, the filled function method, a global optimization method for imprecise problems, and a hybrid approach combining simulated annealing, tabu search and a descent method. The superiority of the proposed method over the latter methods is illustrated by numerical experiments and qualitative comparisons.     

An interpolation method to characterize domains of generators of semigroups

We describe a method for characterizing the domains of generators of semigroups enjoying suitable smoothing properties. Among the applications, such a method allows to prove new Schauder type theorems for elliptic equations in ℝ ⁿ and for parabolic equations in [0,T] x ℝ ⁿ .     

Convergence Analysis of the Finite Section Method and Banach Algebras of Matrices

The finite section method is a classical scheme to approximate the solution of an infinite system of linear equations. Based on an axiomatic framework we present a convergence analysis of the finite section method for unstructured matrices on weighted ℓ ^p -spaces. In particular, the stability of the finite section method on ℓ ² implies its stability on weighted ℓ ^p -spaces. Our approach uses recent results from the theory of Banach algebras of matrices with off-diagonal decay. Furthermore, we demonstrate that Banach algebra theory provides a natural framework for deriving a finite section method that is applicable to large classes of unstructured non-hermitian matrices as well as to least squares problems.     

Numerical analysis of a modified finite element nonlinear Galerkin method

Summary. A fully discrete modified finite element nonlinear Galerkin method is presented for the two-dimensional equation of Navier-Stokes type. The spatial discretization is based on two finite element spaces X_H and X_h defined on a coarse grid with grid size H and a fine grid with grid size h << H, respectively; the time discretization is based on the Euler explicit scheme with respect to the nonlinear term. We analyze the stability and convergence rate of the method. Comparing with the standard finite element Galerkin method and the nonlinear Galerkin method, this method can admit a larger time step under the same convergence rate of same order. Hence this method can save a large amount of computational time. Finally, we provide some numerical tests on this method, the standard finite element Galerkin method, and the nonlinear Galerkin method, which are in a good agreement with the theoretical analysis.Mathematics Subject Classification (2000): 35Q30, 65M60, 65N30, 76D05     

Numerical solution of linear algebraic equations where the coefficient matrix is a polynomial of a square matrix

To solve the linear algebraic equationP(A)x=y whereP is a real polynomial of degree two, we shall use a stationary iterative method. It is shown that this method converges for all matrices with eigenvalues in a sector in the right complex half plane provided that the zeros ofP are not in the same sector.     

Convergence Rate of Galerkin Method for a Certain Class of Nonlinear Operator-Differential Equations

In this article, we study a Galerkin method for a nonstationary operator equation with a leading self-adjoint operator A(t) and a subordinate nonlinear operator F. The existence of the strong solutions of the Cauchy problem for differential and approximate equations are proved. New error estimates for the approximate solutions and their derivatives are obtained. The developed method is applied to an initial boundary value problem for a partial differential equation of parabolic type.     

Proof of the bieberbach conjecture for a certain class of univalent functions

In the following we prove that for a given univalent function such that |a ₂| <0.867, |a _n |≦n for eachn. The method of proof is closely related to Milin’s method.     

A note on the efficiency of the conjugate gradient method for a class of time‐dependent problems

We discuss the efficiency of the conjugate gradient (CG) method for solving a sequence of linear systems; Auⁿ⁺¹ = uⁿ, where A is assumed to be sparse, symmetric, and positive definite. We show that under certain conditions the Krylov subspace, which is generated when solving the first linear system Au¹ = u⁰, contains the solutions {uⁿ} for subsequent time steps. The solutions of these equations can therefore be computed by a straightforward projection of the right‐hand side onto the already computed Krylov subspace. Our theoretical considerations are illustrated by numerical experiments that compare this method with the order‐optimal scheme obtained by applying the multigrid method as a preconditioner for the CG‐method at each time step. Copyright © 2007 John Wiley & Sons, Ltd.     

Combination of standard Galerkin and subspace methods for the time‐dependent Navier‐Stokes equations with nonsmooth initial data

We consider a combination of the standard Galerkin method and the subspace decomposition methods for the numerical solution of the two‐dimensional time‐dependent incompressible Navier‐Stokes equations with nonsmooth initial data. Because of the poor smoothness of the solution near t = 0, we use the standard Galerkin method for time interval [0, 1] and the subspace decomposition method time interval [1, ∞). The subspace decomposition method is based on the solution into the sum of a low frequency component integrated using a small time step Δt and a high frequency integrated using a larger time step pΔt with p > 1. From the H¹‐stability and L²‐error analysis, we show that the subspace decomposition method can yield a significant gain in computing time. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2009     

Conformal mapping of doubly-connected domains

This paper describes an integral equation method for computing the conformal mapping of a finite doubly-connected domain ontoR <|w|<1, whereR is uniquely determined. The method is illustrated by numerical examples.     

A series of unitary irreducible representations induced from a symmetric subgroup of a semisimple Lie group

LetG/H be a semisimple symmetric space. Generalizing results of Flensted-Jensen we give a sufficient condition for the existence of irreducible closed invariant subspaces of the unitary representations ofG induced from unitary finite dimensional representations ofH. This provides a method of constructing unitary irreducible representations ofG, and we show by examples that for some irreducible admissible representations ofG, this method exhibits not previously known unitarity.This work was supported by the Danish Natural Science Research Council.     

Lower Bounds on Genera of Subvarieties of Generic Hypersurfaces

Abstract

A second-order invariant of C. Voisin gives a powerful method for bounding from below the geometric genus of a k-dimensional subvariety of a degree dhypersurface in complex projective n-space. This work uses the Voisin method to establish a general bound, which lies behind recent results of G. Pacienza and Z. Ran.     

A general construction of nonseparable multivariate orthonormal wavelet bases

The construction of nonseparable and compactly supported orthonormal wavelet bases of L ²(R ⁿ ); n ≥ 2, is still a challenging and an open research problem. In this paper, we provide a special method for the construction of such wavelet bases. The wavelets constructed by this method are dyadic wavelets. Also, we show that our proposed method can be adapted for an eventual construction of multidimensional orthogonal multiwavelet matrix masks, candidates for generating multidimensional multiwavelet bases.      

An implicit one-step method of high-order accuracy for the numerical integration of ordinary differential equations

For a differential equationdx/dt=f(t, x) withf _t (t, x),f _x (t, x) computable, the author presents a new one-step method of high-order accuracy. A rule of controlling the mesh size is given and the method is compared with the Runge-Kutta method in two numerical examples.Dedicated to Professor Dr. Dr. h. c. L. Collatz for his 60^th birthday