Orthonormal rational function vectors

Summary In this paper, we develop a matrix framework to solve the problem of finding orthonormal rational function vectors with prescribed poles with respect to a certain discrete inner product that is defined by a set of data points and corresponding weight vectors w_i,j. Our algorithm for solving the problem is recursive, and it is of complexity If all data points are real or lie on the unit circle, then the complexity is reduced by an order of magnitude.     

On the coupling of MIXED-FEM and BEM for an exterior Helmholtz problem in the plane

Summary This paper deals with an elliptic boundary value problem posed in the plane, with variable coefficients, but whose restriction to the exterior of a bounded domain reduces to a Helmholtz equation. We consider a mixed variational formulation in a bounded domain that contains the heterogeneous medium, coupled with a boundary integral method applied to the Helmholtz equation in . We utilize suitable auxiliary problems, duality arguments, and Fredholm alternative to show that the resulting formulation of the problem is well posed. Then, we define a corresponding Galerkin scheme by using rotated Raviart-Thomas subspaces and spectral elements (on the interface). We show that the discrete problem is uniquely solvable and convergent and prove optimal error estimates. Finally we illustrate our analysis with some results from computational experiments.     

Multi-level spectral galerkin method for the navier-stokes problem I : spatial discretization

A multi-level spectral Galerkin method for the two-dimensional non-stationary Navier-Stokes equations is presented. The method proposed here is a multiscale method in which the fully nonlinear Navier-Stokes equations are solved only on a low-dimensional space subsequent approximations are generated on a succession of higher-dimensional spaces j=2, . . . ,J, by solving a linearized Navier-Stokes problem around the solution on the previous level. Error estimates depending on the kinematic viscosity 0<ν<1 are also presented for the J-level spectral Galerkin method. The optimal accuracy is achieved when We demonstrate theoretically that the J-level spectral Galerkin method is much more efficient than the standard one-level spectral Galerkin method on the highest-dimensional space . The work of this author was supported in part by the NSF of China 10371095, City University of Hong Kong Research Project 7001093 Hong Kong and the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. CityU 1084/02P)     

Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations

Summary We introduce a class of n×n structured matrices which includes three well-known classes of generalized companion matrices: tridiagonal plus rank-one matrices (comrade matrices), diagonal plus rank-one matrices and arrowhead matrices. Relying on the structure properties of , we show that if A then A=RQ , where A=QR is the QR decomposition of A. This allows one to implement the QR iteration for computing the eigenvalues and the eigenvectors of any A with O(n) arithmetic operations per iteration and with O(n) memory storage. This iteration, applied to generalized companion matrices, provides new O(n²) flops algorithms for computing polynomial zeros and for solving the associated (rational) secular equations. Numerical experiments confirm the effectiveness and the robustness of our approach.The results of this paper were presented at the Workshop on Nonlinear Approximations in Numerical Analysis, June 22 – 25, 2003, Moscow, Russia, at the Workshop on Operator Theory and Applications (IWOTA), June 24 – 27, 2003, Cagliari, Italy, at the Workshop on Numerical Linear Algebra at Universidad Carlos III in Leganes, June 16 – 17, 2003, Leganes, Spain, at the SIAM Conference on Applied Linear Algebra, July 15 – 19, 2003, Williamsburg, VA and in the Technical Report [8]. This work was partially supported by MIUR, grant number 2002014121, and by GNCS-INDAM. This work was supported by NSF Grant CCR 9732206 and PSC CUNY Awards 66406-0033 and 65393-0034.     

Preconditioning Landweber iteration in Hilbert scales

In this paper we investigate convergence of Landweber iteration in Hilbert scales for linear and nonlinear inverse problems. As opposed to the usual application of Hilbert scales in the framework of regularization methods, we focus here on the case s≤0, which (for Tikhonov regularization) corresponds to regularization in a weaker norm. In this case, the Hilbert scale operator L^−2s appearing in the iteration acts as a preconditioner, which significantly reduces the number of iterations needed to match an appropriate stopping criterion. Additionally, we carry out our analysis under significantly relaxed conditions, i.e., we only require instead of which is the usual condition for regularization in Hilbert scales. The assumptions needed for our analysis are verified for several examples and numerical results are presented illustrating the theoretical ones. supported by the Austrian Science Foundation (FWF) under grant SFB/F013     

A numerical algorithm for the nonlinear Kirchhoff string equation

The initial boundary value problem is considered for the dynamic string equation . Its solution is found by means of an algorithm, the constituent parts of which are the Galerkin method, the modified Crank-Nicolson difference scheme used to perform approximation with respect to spatial and time variables, and also a Picard type iteration process for solving the system of nonlinear equations obtained by discretization. Errors of the three parts of the algorithm are estimated and, as a result, its total error estimate is obtained.     

Interior penalty method for the indefinite time-harmonic Maxwell equations

Summary In this paper, we introduce and analyze the interior penalty discontinuous Galerkin method for the numerical discretization of the indefinite time-harmonic Maxwell equations in the high-frequency regime. Based on suitable duality arguments, we derive a-priori error bounds in the energy norm and the L²-norm. In particular, the error in the energy norm is shown to converge with the optimal order (h^min{s,}) with respect to the mesh size h, the polynomial degree , and the regularity exponent s of the analytical solution. Under additional regularity assumptions, the L²-error is shown to converge with the optimal order (h⁺¹). The theoretical results are confirmed in a series of numerical experiments.Supported by the EPSRC (Grant GR/R76615).Supported by the Swiss National Science Foundation under project 21-068126.02.Supported in part by the Natural Sciences and Engineering Council of Canada.     

Rate of convergence of regularization procedures and finite element approximations for the total variation flow

Summary We derive rates of convergence for regularization procedures (characterized by a parameter ) and finite element approximations of the total variation flow, which arises from image processing, geometric analysis and materials sciences. Practically useful error estimates, which depend on only in low polynomial orders, are established for the proposed fully discrete finite element approximations. As a result, scaling laws which relate mesh parameters to the regularization parameter are also obtained. Numerical experiments are provided to validate the theoretical results and show efficiency of the proposed numerical methods.     

On a class of weak Tchebycheff systems

In this paper we study the approximation power, the existence of a normalized B-basis and the structure of a degree-raising process for spaces of the formrequiring suitable assumptions on the functions u and v. The results about degree raising are detailed for special spaces of this form which have been recently introduced in the area of CAGD.     

Besov regularity and new error estimates for finite volume approximations of the p-laplacian

Summary. In [1], we have constructed a family of finite volume schemes on rectangular meshes for the p-laplacian and we proved error estimates in case the exact solution lies in W^2,p. Actually, W^2,p is not a natural space for solutions of the p-laplacian in the case p>2. Indeed, for general L^p data it can be shown that the solution only belongs to the Besov space In this paper, we prove Besov kind a priori estimates on the approximate solution for any data in L^p. We then obtain new error estimates for such solutions in the case of uniform meshes     

Fast Runge-Kutta approximation of inhomogeneous parabolic equations

The result after N steps of an implicit Runge-Kutta time discretization of an inhomogeneous linear parabolic differential equation is computed, up to accuracy ɛ, by solving only linear systems of equations. We derive, analyse, and numerically illustrate this fast algorithm.     

Hybrid cross approximation of integral operators

The efficient treatment of dense matrices arising, e.g., from the finite element discretisation of integral operators requires special compression techniques. In this article we use the -matrix representation that approximates the dense stiffness matrix in admissible blocks (corresponding to subdomains where the underlying kernel function is smooth) by low-rank matrices. The low-rank matrices are assembled by a new hybrid algorithm (HCA) that has the same proven convergence as standard interpolation but also the same efficiency as the (heuristic) adaptive cross approximation (ACA).     

Adaption allows efficient integration of functions with unknown singularities

We study numerical integration for functions f with singularities. Nonadaptive methods are inefficient in this case, and we show that the problem can be efficiently solved by adaptive quadratures at cost similar to that for functions with no singularities. Consider first a class of functions whose derivatives of order up to r are continuous and uniformly bounded for any but one singular point. We propose adaptive quadratures Q*_n, each using at most n function values, whose worst case errors are proportional to n^−r. On the other hand, the worst case error of nonadaptive methods does not converge faster than n⁻¹. These worst case results do not extend to the case of functions with two or more singularities; however, adaption shows its power even for such functions in the asymptotic setting. That is, let F^∞_r be the class of r-smooth functions with arbitrary (but finite) number of singularities. Then a generalization of Q*_n yields adaptive quadratures Q**_n such that |I(f)−Q**_n(f)|=O(n^−r) for any f ∈ F^∞_r. In addition, we show that for any sequence of nonadaptive methods there are `many' functions in F^∞_r for which the errors converge no faster than n⁻¹. Results of numerical experiments are also presented. The authors were partially supported, respectively, by the State Committee for Scientific Research of Poland under Project 1 P03A 03928 and by the National Science Foundation under Grant CCR-0095709.     

Mean-value theorems for multiplicative functions on Beurling’s generalized integers (I)

Halász’s general mean-value theorem for multiplicative functions on ℕ is classical in probabilistic number theory. We extend this theorem to functions f, defined on a set of generalized integers associated with a set of generalized primes in Beurling’s sense, which satisfies Halász’s conditions, in particular,Assume that the distribution function N(x) of satisfieswith γ>γ₀, where ρ₁<ρ₂<···<ρ_m are constants with ρ_m≥1 and A₁,···,A_m are real constants with A_m>0. Also, assume that the Chebyshev function ψ(x) of satisfieswith M>M₀. Then the asymptoticimplieswhere τ is a positive constant with τ≥1 and L(u) is a slowly oscillating function with |L(u)|=1.     

Bubble finite elements for the primitive equations of the ocean

We introduce in this paper two original Mixed methods for the numerical resolution of the (stationary) Primitive Equations (PE) of the Ocean. The PE govern the behavior of oceanic flows in shallow domains for large time scales. We use a reduced formulation (Lions et al. [28]) involving horizontal velocities and surface pressures. By using bubble functions constructed ad-hoc, we are able to define two stable Mixed Methods requiring a low number of degrees of freedom. The first one is based on the addition of bubbles of reduced support to velocities elementwise. The second one makes use of conic bubbles of extended support along the vertical coordinate. The latter constitutes a genuine mini-element for the PE, e.g., it requires the least number of extra degrees of freedom to stabilize piecewise linear hydrostatic pressures. Both methods verify a specific inf-sup condition and provide stability and convergence. Finally, we compare several numerical features of the proposed pairs in the context of other FE methods found in the literature.     

The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families

Let be an n-uniform hypergraph on 2n vertices. Suppose that and holds for all F₁,F₂,F₃ ∈ . We prove that the size of is at most . The second author was supported by MEXT Grant-in-Aid for Scientific Research (B) 16340027     

Approximation of Integral Operators by Variable-Order Interpolation

Summary. We employ a data-sparse, recursive matrix representation, so-called -matrices, for the efficient treatment of discretized integral operators. We obtain this format using local tensor product interpolants of the kernel function and replacing high-order approximations with piecewise lower-order ones. The scheme has optimal, i.e., linear, complexity in the memory requirement and time for the matrix-vector multiplication. We present an error analysis for integral operators of order zero. In particular, we show that the optimal convergence (h) is retained for the classical double layer potential discretized with piecewise constant functions.Corrigendum This revised version was published online in February 2005 due to typesetting mistakes in the author correction process.     

Spectral multipliers for sub-Laplacians with drift on Lie groups

We study spectral multipliers of right invariant sub-Laplacians with drift on a connected Lie group G. The operators we consider are self-adjoint with respect to a positive measure , whose density with respect to the left Haar measure λ_G is a nontrivial positive character of G. We show that if p≠2 and G is amenable, then every spectral multiplier of extends to a bounded holomorphic function on a parabolic region in the complex plane, which depends on p and on the drift. When G is of polynomial growth we show that this necessary condition is nearly sufficient, by proving that bounded holomorphic functions on the appropriate parabolic region which satisfy mild regularity conditions on its boundary are spectral multipliers of . Work partially supported by the EC HARP Network “Harmonic Analysis and Related Problems”, the Progetto Cofinanziato MURST “Analisi Armonica” and the Gruppo Nazionale INdAM per l'Analisi Matematica, la Probabilità e le loro Applicazioni. Part of this work was done while the second and the third author were visiting the “Centro De Giorgi” at the Scuola Normale Superiore di Pisa, during a special trimester in Harmonic Analysis. They would like to express their gratitude to the Centro for the hospitality.     

On the approximation order of extremal point methods for hyperbolic minimal energy problems

Summary. Let be an analytic Jordan curve in the unit disk We regard the hyperbolic minimal energy problem where () denotes the set of all probability measures on . There exist several extremal point discretizations of *, among others introduced by M. Tsuji (Tsuji points) or by K. Menke (hyperbolic Menke points). In the present article, it is proven that hyperbolic Menke points approach the images of roots of unity under a conformal map from onto geometrically fast if the number of points tends to infinity. This establishes a conjecture of K. Menke. In particular, explicit bounds for the approximation error are given. Finally, an effective method for the numerical determination of * providing a geometrically shrinking error bound is presented.Mathematics Subject Classification (1991): 30C85, 30E10, 31C20The notation Menke points has been introduced by D. Gaier.     

Holomorphic dynamics near germs of singular curves

Let M be a two dimensional complex manifold, p ∈ M and a germ of holomorphic foliation of M at p. Let be a germ of an irreducible, possibly singular, curve at p in M which is a separatrix for . We prove that if the Camacho-Sad-Suwa index Ind then there exists another separatrix for at p. A similar result is proved for the existence of parabolic curves for germs of holomorphic diffeomorphisms near a curve of fixed points.