On Constrained Nonlinear Hermite Subdivision

We determine shape-preserving regions and we describe a general setting to generate shape-preserving families for the 2-points Hermite subdivision scheme introduced by Merrien (Numer. Algorithms 2:187–200, [1992]). This general construction includes the shape-preserving families presented in Merrien and Sablonníere (Constr. Approx. 19:279–298, [2003]) and Pelosi and Sablonníere (C ¹ GP Hermite Interpolants Generated by a Subdivision Scheme, Prépublication IRMAR 06–23, Rennes, [2006]). New special families are presented as particular examples. Nonstationary and nonuniform versions of such schemes, which produce smoother limits, are discussed.      

A convergent simplicial algorithm with ω-subdivision and ω-bisection strategies

The simplicial algorithm is a kind of branch-and-bound method for computing a globally optimal solution of a convex maximization problem. Its convergence under the ω-subdivision strategy was an open question for some decades until Locatelli and Raber proved it (J Optim Theory Appl 107:69–79, 2000). In this paper, we modify their linear programming relaxation and give a different and simpler proof of the convergence. We also develop a new convergent subdivision strategy, and report numerical results of comparing it with existing strategies.     

Analysis of a class of nonlinear subdivision schemes and associated multiresolution transforms

This paper is devoted to the convergence and stability analysis of a class of nonlinear subdivision schemes and associated multiresolution transforms. As soon as a nonlinear scheme can be written as a specific perturbation of a linear and convergent subdivision scheme, we show that if some contractivity properties are satisfied, then stability and convergence can be achieved. This approach is applied to various schemes, which give different new results. More precisely, we study uncentered Lagrange interpolatory linear schemes, WENO scheme (Liu et al., J Comput Phys 115:200–212, 1994), PPH and Power-P schemes (Amat and Liandrat, Appl Comput Harmon Anal 18(2):198–206, 2005; Serna and Marquina, J Comput Phys 194:632–658, 2004) and a nonlinear scheme using local spherical coordinates (Aspert et al., Comput Aided Geom Des 20:165–187, 2003). Finally, a stability proof is given for the multiresolution transform associated to a nonlinear scheme of Marinov et al. (2005).     

On the weak Freese–Nation property of ?(ω)

Continuing [6], [8] and [16], we study the consequences of the weak Freese-Nation property of (?(ω),⊆). Under this assumption, we prove that most of the known cardinal invariants including all of those appearing in Cichoń's diagram take the same value as in the corresponding Cohen model. Using this principle we could also strengthen two results of W. Just about cardinal sequences of superatomic Boolean algebras in a Cohen model. These results show that the weak Freese-Nation property of (?(ω),⊆) captures many of the features of Cohen models and hence may be considered as a principle axiomatizing a good portion of the combinatorics available in Cohen models. Received: 7 June 1999 / Revised version: 17 October 1999 /?Published online: 15 June 2001     

Adaptive Isotopic Approximation of Nonsingular Curves: the Parameterizability and Nonlocal Isotopy Approach

We consider domain subdivision algorithms for computing isotopic approximations of a nonsingular algebraic curve. The curve is given by a polynomial equation f(X,Y)=0. Two algorithms in this area are from Snyder (1992) SIGGRAPH Comput. Graphics, 26(2), 121 and Plantinga and Vegter (2004) In Proc. Eurographics Symposium on Geometry Processing, pp. 245–254. We introduce a new algorithm that combines the advantages of these two algorithms: like Snyder, we use the parameterizability criterion for subdivision, and like Plantinga and Vegter, we exploit nonlocal isotopy. We further extend our algorithm in two important and practical directions: first, we allow subdivision cells to be rectangles with arbitrary but bounded aspect ratios. Second, we extend the input domains to be regions R ₀ with arbitrary geometry and which might not be simply connected. Our algorithm halts as long as the curve has no singularities in the region, and intersects the boundary of R ₀ transversally. Our algorithm is practical and easy to implement exactly. We report some very encouraging experimental results, showing that our algorithms can be much more efficient than the algorithms of Plantinga–Vegter and Snyder.     

Multiscale preconditioning for the coupling of FEM–BEM

We apply multiscale methods to the coupling of finite and boundary element methods to solve an exterior two‐dimensional Laplacian. The matrices belonging to the boundary terms of the coupled FEM–BEM system are compressed by using biorthogonal wavelet bases developed from A. Cohen, I. Daubechies and J.‐C. Feauveau (Comm. Proc. Appl. Math. 1992; 45 :485). The coupling yields a linear equation system which corresponds to a saddle point problem. As favourable solver, the Bramble–Pasciak–CG (Math. Comp. 1988; 50 :1) is utilized. A suitable preconditioner is developed by combining the BPX (Math. Comp. 1990; 55 :1) with the wavelet preconditioning (Numer. Math. 1992; 63 :315). Through numerical experiments we provide results which corroborate the theory of the present paper. Copyright © 2002 John Wiley & Sons, Ltd.     

Iterative methods based on the signum function approach for solving nonlinear equations

For finding a root of an equation f(x) = 0 on an interval (a, b), we develop an iterative method using the signum function and the trapezoidal rule for numerical integrations based on the recent work (Yun, Appl Math Comput 198:691–699, 2008). This method, so-called signum iteration method, depends only on the signum function sgn(f(x)){\rm{sgn}}\left(f(x)\right) independently of the behavior of f(x), and the error bound of the kth approximation is (b − a)/(2N ^k ), where N is the number of integration points for the trapezoidal rule in each iteration. In addition we suggest hybrid methods which combine the signum iteration method with usual methods such as Newton, Ostrowski and secant methods. In particular the hybrid method combined with the signum iteration and the secant method is a predictor-corrector type method (Noor and Ahmad, Appl Math Comput 180:167–172, 2006). The proposed methods result in the rapidly convergent approximations, without worry about choosing a proper initial guess. By some numerical examples we show the superiority of the presented methods over the existing iterative methods.     

Stable Subconstructs: A Correction and New Results

In Lowen and Wuyts (Appl Categ Struct 8:235–245, 2000) the authors studied the simultaneously concretely reflective and concretely coreflective subconstructs of the category Ap of approach spaces. For the sake of shortness we call such subconstructs stable. Using a technique introduced in Herrlich and Lowen (1999) it was possible to explicitly describe such stable subconstructs by a condition on the objects which used certain subsets of [0, ∞ ]. Thus each stable subconstruct Ap _m described in [9] corresponds to the subset {0} ∪ [m, ∞ ] ⊂ [0, ∞ ] for m ∈ [0, ∞ ]. Although this characterization is correct, Theorem 4.7 in [9] stating that the subconstructs Ap _m were the only stable subconstructs of Ap is not. The main results, which together prove that the only stable subconstructs are those where a restriction is put on the range of the distances of the objects, are upheld, but it turns out that not only the sets {0} ∪ [m, ∞ ], but actually each closed subsemigroup of [0, ∞ ] determines a stable subconstruct (albeit again in exactly the same way as characterized in [9]). In the first part of our paper, Sections 1 and 2, we develop the general technique, which is totally different to the one from [3], and in Theorem 2.13 we prove the main result for the case of approach spaces. The technique which we develop is also applicable to other cases. Thus, in Section 3, more precisely in Theorems 3.9 and 3.11, we give the complete solution to the corresponding characterization problem for the constructs pq Met ^∞ of pseudo-quasi-metric spaces and p Met ^∞ of pseudometric spaces and in Section 4 we briefly sketch how the technique can be adapted and used to also completely solve the problem in the case of more general types of approach spaces and metric spaces. At the same time, in all cases, we are able to give necessary and sufficient conditions under which two stable subconstructs of one of these topological constructs are concretely isomorphic. It turns out that in all cases there are 2^à₀2^{\aleph_0} non-concretely isomorphic stable subconstructs.     

Subdivision schemes inL p spaces

Subdivision schemes play an important role in computer graphics and wavelet analysis. In this paper we are mainly concerned with convergence of subdivision schemes inL _p spaces (1≤p≤∞). We characterize theL _p -convergence of a subdivision scheme in terms of thep-norm joint spectral radius of two matrices associated with the corresponding mask. We also discuss various properties of the limit function of a subdivision scheme, such as stability, linear independence, and smoothness.     

Growth-type invariants for ℤ<Superscript><Emphasis Type="Italic">d</Emphasis></Superscript> subshifts of finite type and arithmetical classes of real numbers

We discuss some numerical invariants of multidimensional shifts of finite type (SFTs) which are associated with the growth rates of the number of admissible finite configurations. Extending an unpublished example of Tsirelson (A strange two-dimensional symbolic system, 1992), we show that growth complexities of the form exp (n ^α+o(1)) are possible for non-integer α’s. In terminology of de Carvalho (Port. Math. 54(1):19–40, 1997), such subshifts have entropy dimension α. The class of possible α’s are identified in terms of arithmetical classes of real numbers of Weihrauch and Zheng (Math. Log. Q. 47(1):51–65, 2001).     

Orders on Multisets and Discrete Cones

We study additive representability of orders on multisets (of size k drawn from a set of size n) which satisfy the condition of independence of equal submultisets (IES) introduced by Sertel and Slinko (Ranking committees, words or multisets. Nota di Laboro 50.2002. Center of Operation Research and Economics. The Fundazione Eni Enrico Mattei, Milan, 2002, Econ. Theory 30(2):265–287, 2007). Here we take a geometric view of those orders, and relate them to certain combinatorial objects which we call discrete cones. Following Fishburn (J. Math. Psychol., 40:64–77, 1996) and Conder and Slinko (J. Math. Psychol., 48(6):425–431, 2004), we define functions f(n,k) and g(n,k) which measure the maximal possible deviation of an arbitrary order satisfying the IES and an arbitrary almost representable order satisfying the IES, respectively, from a representable order. We prove that g(n,k) = n − 1 whenever n ≥ 3 and (n, k) ≠ (5, 2). In the exceptional case, g(5,2) = 3. We also prove that g(n,k) ≤ f(n,k) ≤ n and establish that for small n and k the functions g(n,k) and f(n,k) coincide.      

Congruences for Ramanujan’s <Emphasis Type="Italic">ω</Emphasis>(<Emphasis Type="Italic">q</Emphasis>)

Recently, Bruinier and Ono investigated the arithmetic of the coefficients of Ramanujan’s mock theta function ω(q). In Ramanujan J. (submitted) they obtained congruences with respect to the modulus 512. Here we show that ω(q) modulo 5 is dictated by an elliptic curve.     

A superatomic Boolean algebra with few automorphisms

Assuming GCH, we prove that for every successor cardinal μ > ω₁, there is a superatomic Boolean algebra B such that |B| = 2^μ and |Aut B| = μ. Under ◊_ω1, the same holds for μ = ω₁. This answers Monk's Question 80 in [Mo]. Received: 1 January 1998 / Revised version: 18 May 1999 / Published online: 21 December 2000     

A unified framework for interpolating and approximating univariate subdivision

In this paper we show that the refinement rules of interpolating and approximating univariate subdivision schemes with odd-width masks of finite support can be derived ones from the others by simple operations on the mask coefficients. These operations are formalized as multiplication/division of the associated generating functions by a proper link polynomial.We then apply the proposed result to some families of stationary and non-stationary subdivision schemes, showing that it also provides a constructive method for the definition of novel refinement algorithms.     

From Hermite to stationary subdivision schemes in one and several variables

Vector and Hermite subdivision schemes both act on vector data, but since the latter one interprets the vectors as function values and consecutive derivatives they differ by the “renormalization” of the Hermite scheme in any step. In this paper we give an algebraic factorization method in one and several variables to relate any Hermite subdivision scheme that satisfies the so–called spectral condition to a vector subdivision scheme. These factorizations are natural extensions of the “zero at π” condition known for the masks of refinable functions. Moreover, we show how this factorization can be used to investigate different forms of convergence of the Hermite scheme and why the multivariate situation is conceptionally more intricate than the univariate one. Finally, we give some examples of such factorizations.     

K-area, Hofer metric and geometry of conjugacy classes in Lie groups

Given a closed symplectic manifold (M,ω) we introduce a certain quantity associated to a tuple of conjugacy classes in the universal cover of the group Ham (M,ω) by means of the Hofer metric on Ham (M,ω). We use pseudo-holomorphic curves involved in the definition of the multiplicative structure on the Floer cohomology of a symplectic manifold (M,ω) to estimate this quantity in terms of actions of some periodic orbits of related Hamiltonian flows. As a corollary we get a new way to obtain Agnihotri-Belkale-Woodward inequalities for eigenvalues of products of unitary matrices. As another corollary we get a new proof of the geodesic property (with respect to the Hofer metric) of Hamiltonian flows generated by certain autonomous Hamiltonians. Our main technical tool is K-area defined for Hamiltonian fibrations over a surface with boundary in the spirit of L. Polterovich’s work on Hamiltonian fibrations over S ². Oblatum 23-II-2001 & 9-V-2001?Published online: 20 July 2001     

Global Heat Kernel Estimates for Relativistic Stable Processes in Half-space-like Open Sets

In this paper, by using probabilistic methods, we establish sharp two-sided large time estimates for the transition densities of relativistic α-stable processes with mass m ∈ (0, 1] (i.e., for the Dirichlet heat kernels of m − (m ^2/α  − Δ) ^α/2 with m ∈ (0, 1]) in half-space-like C ^{1, 1} open sets. The estimates are uniform in m in the sense that the constants are independent of m ∈ (0, 1]. Combining with the sharp two-sided small time estimates, established in Chen et al. (Ann Probab, 2011), valid for all C ^{1, 1} open sets, we have now sharp two-sided estimates for the transition densities of relativistic α-stable processes with mass m ∈ (0, 1] in half-space-like C ^{1, 1} open sets for all times. Integrating the heat kernel estimates with respect to the time variable, one can recover the sharp two-sided Green function estimates for relativistic α-stable processes with mass m ∈ (0, 1] in half-space-like C ^{1, 1} open sets established recently in Chen et al. (Stoch Process their Appl, 2011).     

An Optimal Wavelet Series Expansion of the Riemann–Liouville Process

Consider the Riemann–Liouville process R ^α ={R ^α (t)} _t∈[0,1] with parameter α>1/2. Depending on α, wavelet series representations for R ^α (t) of the form ∑ _k=1^∞ u _k (t)ε _k are given, where the u _k are deterministic functions, and {ε _k } _k≥1 is a sequence of i.i.d. standard normal random variables. The expansion is based on a modified Daubechies wavelet family, which was originally introduced in Meyer (Rev. Mat. Iberoam. 7:115–133, 1991). It is shown that these wavelet series representations are optimal in the sense of Kühn–Linde (Bernoulli 8:669–696, 2002) for all values of α>1/2.     

On high order symmetric and symplectic trigonometrically fitted Runge-Kutta methods with an even number of stages

The existence and construction of symplectic 2s-stage variable coefficients Runge-Kutta (RK) methods that integrate exactly IVPs whose solution is a trigonometrical polynomial of order s with a given frequency ω is considered. The resulting methods, that can be considered as trigonometrical collocation methods, are fully implicit, symmetric and symplectic RK methods with variable nodes and coefficients that are even functions of ν=ω h (h is the step size), and for ω→0 they tend to the conventional RK Gauss methods. The present analysis extends previous results on two-stage symplectic exponentially fitted integrators of Van de Vyver (Comput. Phys. Commun. 174: 255–262, 2006) and Calvo et al. (J. Comput. Appl. Math. 218: 421–434, 2008) to symmetric and symplectic trigonometrically fitted methods of high order. The algebraic order of the trigonometrically fitted symmetric and symplectic 2s-stage methods is shown to be 4s like in conventional RK Gauss methods. Finally, some numerical experiments with oscillatory Hamiltonian systems are presented.