Local convergence in a generalized Fermat-Weber problem

In the Fermat-Weber problem, the location of a source point in ^N is sought which minimizes the sum of weighted Euclidean distances to a set of destinations. A classical iterative algorithm known as the Weiszfeld procedure is used to find the optimal location. Kuhn proves global convergence except for a denumerable set of starting points, while Katz provides local convergence results for this algorithm. In this paper, we consider a generalized version of the Fermat-Weber problem, where distances are measured by anl _p norm and the parameterp takes on a value in the closed interval [1, 2]. This permits the choice of a continuum of distance measures from rectangular (p=1) to Euclidean (p=2). An extended version of the Weiszfeld procedure is presented and local convergence results obtained for the generalized problem. Linear asymptotic convergence rates are typically observed. However, in special cases where the optimal solution occurs at a singular point of the iteration functions, this rate can vary from sublinear to quadratic. It is also shown that for sufficiently large values ofp exceeding 2, convergence of the Weiszfeld algorithm will not occur in general.     

LIMITS OF SOLUTIONS TO THE GENERALIZED GINZBURG-LANDAU FUNCTIONAL

ABSTRACT

We discuss the convergence issue for the generalized Ginzburg-Landau functional which penalizes the L^p -energy. We prove the strong convergence for non-integer p and obtain the obstruction for strong convergence for integer p. In the presence of obstruction, we show the limiting couple varifold is a (generalized) stationary (n ? p)-varifold.     

Iterated hard-thresholding for linear inverse problems with sparsity constraints

We describe an iterative algorithm for the minimization of Tikhonov type functionals which involve sparsity constraints in form of ℓ^p -penalties which have been proposed recently for the regularization of ill-posed problems. In contrast to the well-known algorithm considered by Daubechies, Defrise and De Mol, it uses hard instead of soft thresholding. This hard thresholding algorithm is based on the generalized conditional gradient method. General results on the convergence of the generalized conditional gradient method enable us to prove strong convergence of the iterates. Furthermore we are able to establish convergence rates of O (n^–1/2) and O (λⁿ) for p = 1 and 1 < p ≤ 2 respectively. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Hardy Approximation to L p Functions on Subsets of the Circle with 1< =p< = infinity

We consider approximation of L ^p functions by Hardy functions on subsets of the circle for . After some preliminaries on the possibility of such an approximation which are connected to recovery problems of the Carleman type, we prove existence and uniqueness of the solution to a generalized extremal problem involving norm constraints on the complementary subset. December 6, 1995. Date revised: August 26, 1996.     

On MAC schemes on triangular delaunay meshes,their convergence and application to coupled flow problems

We study the convergence of two generalized marker‐and‐cell covolume schemes for the incompressible Stokes and Navier–Stokes equations introduced by Cavendish, Hall, Nicolaides, and Porsching. The schemes are defined on unstructured triangular Delaunay meshes and exploit the Delaunay–Voronoi duality. The study is motivated by the fact that the related discrete incompressibility condition allows to obtain a discrete maximum principle for the finite volume solution of an advection–diffusion problem coupled to the flow. The convergence theory uses discrete functional analysis and compactness arguments based on recent results for finite volume discretizations for the biharmonic equation. For both schemes, we prove the strong convergence in L² for the velocities and the discrete rotations of the velocities for the Stokes and the Navier–Stokes problem. Further, for one of the schemes, we also prove the strong convergence of the pressure in L². These predictions are confirmed by numerical examples presented in the article. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1397–1424, 2014     

Nonlinear approximation by renormalized trigonometric system

We study the convergence of greedy algorithmwith regard to renormalized trigonometric system. Necessary and sufficient conditions are found for system’s normalization to guarantee almost everywhere convergence, and convergence in L ^p (T) for 1 < p < ∞ of the greedy algorithm, where T is the unit torus. Also the non existence is proved for normalization which guarantees convergence almost everywhere for functions from L ¹(T), or uniform convergence for continuous functions.     

On an open problem in spherical facility location

In this paper we partially resolve an open problem in spherical facility location. The spherical facility location problem is a generalization of the planar Euclidean facility location problem. This problem was first studied by Katz and Cooper and by Drezner and Wesolowsky where a Weszfeld-like algorithm was proposed. This algorithm is very simple and does not require a line search. However, its convergence has been an open problem for more than ten years. In this paper, we prove that the sequence generated by the algorithm converges to the unique optimal solution under the condition that the oscillation of the sequence converges to zero. We conjecture that the algorithm is a descent algorithm and prove that the sequence generated by the algorithm converges to the optimal solution under this conjecture.     

Convolution operator and maximal function for the Dunkl transform

For a family of weight functionsh _K invariant under a finite reflection group onR ^d, analysis related to the Dunkl transform is carried out for the weightedL ^p spaces. Making use of the generalized translation operator and the weighted convolution, we study the summability of the inverse Dunkl transform, including as examples the Poisson integrals and the Bochner-Riesz means. We also define a maximal function and use it to prove the almost everywhere convergence. ST wishes to thank YX for the warm hospitality during his stay in Eugene. The work of YX was supported in part by the National Science Foundation under Grant DMS-0201669.     

Refinable Functions with Exponential Decay: An?Approach via Cascade Algorithms

Refinable functions with exponential decay arise from applications such as the Butterworth filters in signal processing. Refinable functions with exponential decay also play an important role in the study of Riesz bases of wavelets generated from multiresolution analysis. A fundamental problem is whether the standard solution of a refinement equation with an exponentially decaying mask has exponential decay. We investigate this fundamental problem by considering cascade algorithms in weighted L _p spaces (1≤p≤∞). We give some sufficient conditions for the cascade algorithm associated with an exponentially decaying mask to converge in weighted L _p spaces. Consequently, we prove that the refinable functions associated with the Butterworth filters are continuous functions with exponential decay. By analyzing spectral properties of the transition operator associated with an exponentially decaying mask, we find a characterization for the corresponding refinable function to lie in weighted L ₂ spaces. The general theory is applied to an interesting example of bivariate refinable functions with exponential decay, which can be viewed as an extension of the Butterworth filters.     

A probabilistic interpretation and stochastic particle approximations of the 3-dimensional Navier-Stokes equations

We develop a probabilistic interpretation of local mild solutions of the three dimensional Navier-Stokes equation in the L^p spaces, when the initial vorticity field is integrable. This is done by associating a generalized nonlinear diffusion of the McKean-Vlasov type with the solution of the corresponding vortex equation. We then construct trajectorial (chaotic) stochastic particle approximations of this nonlinear process. These results provide the first complete proof of convergence of a stochastic vortex method for the Navier-Stokes equation in three dimensions, and rectify the algorithm conjectured by Esposito and Pulvirenti in 1989. Our techniques rely on a fine regularity study of the vortex equation in the supercritical L^p spaces, and on an extension of the classic McKean-Vlasov model, which incorporates the derivative of the stochastic flow of the nonlinear process to explain the vortex stretching phenomenon proper to dimension three. Supported by Fondecyt Project 1040689 and Nucleus Millennium Information and Randomness ICM P01-005.     

A new bounding method for single facility location models

This paper develops a new lower bound for single facility location problems withl _p distances. We prove that the method produces superior results to other known procedures. The new bound is also computationally efficient. Numerical results are given for a range of examples with varying numbers of existing facilities andp values.     

L p -norms of Hermite polynomials and an extremal problem on Wiener chaos

We establish sharp asymptotics for theL ^p -norm of Hermite polynomials and prove convergence in distribution of suitably normalized Wick powers. The results are combined with numerical integration to study an extremal problem on Wiener chaos.     

Estimates for Littlewood-Paley Functions and Extrapolation

We prove certain L ^p -estimates for Littlewood-Paley functions arising from rough kernels. The estimates are useful for extrapolation to prove L ^p -boundedness of the Littlewood-Paley functions under a sharp kernel condition.      

Approximation by means of nonlinear Kantorovich sampling type operators in Orlicz spaces

In this paper we introduce a nonlinear version of the Kantorovich sampling type series in a nonuniform setting. By means of the above series we are able to reconstruct signals (functions) which are continuous or uniformly continuous. Moreover, we study the problem of the convergence in the setting of Orlicz spaces: this allows us to treat signals which are not necessarily continuous. Our theory applies to L^p-spaces, interpolation spaces, exponential spaces and many others. Several graphical examples are provided.     

Some Fourier-type operators for functions on unbounded intervals

In order to approximate functions defined on the real line or on the real semiaxis by polynomials, we introduce some new Fourier-type operators, connected to the Fourier sums of generalized Freud or Laguerre orthonormal systems. We prove necessary and sufficient conditions for the boundedness of these operators in suitable weighted L ^p -spaces, with 1 < p < ∞. Moreover, we give error estimates in weighted L ^p and uniform norms.     

Correlation between pole location and asymptotic behavior for Painlevé I solutions

We extend the technique of asymptotic series matching to exponential asymptotics expansions (transseries) and show by using asymptotic information that the extension provides a method of finding singularities of solutions of nonlinear differential equations. This transasymptotic matching method is applied to Painlevé's first equation, P1. The solutions of P1 that are bounded in some direction towards infinity can be expressed as series of functions obtained by generalized Borel summation of formal transseries solutions; the series converge in a neighborhood of infinity. We prove (under certain restrictions) that the boundary of the region of convergence contains actual poles of the associated solution. As a consequence, the position of these exterior poles is derived from asymptotic data. In particular, we prove that the location of the outermost pole x_p(C) on ℝ⁺ of a solution is monotonic in a parameter C describing its asymptotics on anti‐Stokes lines and obtain rigorous bounds for x_p(C). We also derive the behavior of x_p(C) for large C ∈ ℂ. The appendix gives a detailed classical proof that the only singularities of solutions of P1 are poles. © 1999 John Wiley & Sons, Inc.     

On the convergence of Fourier series of computable Lebesgue integrable functions

This paper studies how well computable functions can be approximated by their Fourier series. To this end, we equip the space of L^p‐computable functions (computable Lebesgue integrable functions) with a size notion, by introducing L^p‐computable Baire categories. We show that L^p‐computable Baire categories satisfy the following three basic properties. Singleton sets {f } (where f is L^p‐computable) are meager, suitable infinite unions of meager sets are meager, and the whole space of L^p‐computable functions is not meager. We give an alternative characterization of meager sets via Banach‐Mazur games. We study the convergence of Fourier series for L^p‐computable functions and show that whereas for every p > 1, the Fourier series of every L^p‐computable function f converges to f in the L^p norm, the set of L¹‐computable functions whose Fourier series does not diverge almost everywhere is meager (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

We study the convergence of the proximal algorithm applied to nonsmooth functions that satisfy the ?jasiewicz inequality around their generalized critical points. Typical examples of functions complying with these conditions are continuous semialgebraic or subanalytic functions. Following ?jasiewicz’s original idea, we prove that any bounded sequence generated by the proximal algorithm converges to some generalized critical point. We also obtain convergence rate results which are related to the flatness of the function by means of ?jasiewicz exponents. Apart from the sharp and elliptic cases which yield finite or geometric convergence, the decay estimates that are derived are of the type O(k ^?s ), where s ∈ (0, + ∞) depends on the flatness of the function.     

Algebraic analysis of multigrid algorithms

We study the convergence rate of multilevel algorithms from an algebraic point of view. This requires a detailed analysis of the constant in the strengthened Cauchy–Schwarz inequality between the coarse‐grid space and a so‐called complementary space. This complementary space may be spanned by standard hierarchical basis functions, prewavelets or generalized prewavelets. Using generalized prewavelets, we are able to derive a constant in the strengthened Cauchy–Schwarz inequality which is less than 0.31 for the L² and H¹ bilinear form. This implies a convergence rate less than 0.15. So, we are able to prove fast multilevel convergence. Furthermore, we obtain robust estimations of the convergence rate for a large class of anisotropic ellipic equations, even for some that are not H¹‐elliptic. Copyright © 1999 John Wiley & Sons, Ltd.