Related papers: Multiple multivariate subdivision schemes: matrix …
In this paper, we present a new matrix approach for the analysis of subdivision schemes whose non-stationarity is due to linear dependency on parameters whose values vary in a compact set. Indeed, we show how to check the convergence in…
Stationary subdivision schemes have been extensively studied and have numerous applications in CAGD and wavelet analysis. To have high-order smoothness of the scheme, it is usually inevitable to enlarge the support of the mask that is used,…
In this paper, we study scalar multivariate non-stationary subdivision schemes with integer dilation matrix M=mI, m >=2, and present a general approach for checking their convergence and for determining their H\"older regularity. The…
We study in this paper nonlinear subdivision schemes in a multivariate setting allowing arbitrary dilation matrix. We investigate the convergence of such iterative process to some limit function. Our analysis is based on some conditions on…
We study scalar $d$-variate subdivision schemes, with dilation matrix 2I, satisfying the sum rules of order $k$. Using the results of M\"oller and Sauer, stated for general expanding dilation matrices, we characterize the structure of the…
We study scalar multivariate non-stationary subdivision schemes with a general dilation matrix. We characterize the capability of such schemes to reproduce exponential polynomials in terms of simple algebraic conditions on their symbols.…
The convergence rate of a multigrid method depends on the properties of the smoother and the so-called grid transfer operator. In this paper we define and analyze new grid transfer operators with a generic cutting size which are applicable…
This paper is devoted to the convergence and stability analysis of a class of nonlinear subdivision schemes and associated multi-resolution transforms. These schemes are defined as a perturbation of a linear subdivision scheme. Assuming a…
We study multivariate trigonometric polynomials, satisfying a set of constraints close to the known Strung-Fix conditions. Based on the polyphase representation of these polynomials relative to a general dilation matrix, we develop a simple…
Subdivision schemes are closely related to splines and wavelets and have numerous applications in CAGD and numerical differential equations. Subdivision schemes employ a scalar filter; that is, scalar subdivision schemes, have been…
In this paper we study scalar multivariate subdivision schemes with general integer expanding dilation matrix. Our main result yields simple algebraic conditions on the symbols of such schemes that characterize their polynomial…
The generation of curves and surfaces from given data is a well-known problem in Computer-Aided Design that can be approached using subdivision schemes. They are powerful tools that allow obtaining new data from the initial one by means of…
Gradient schemes is a framework which enables the unified convergence analysis of many different methods -- such as finite elements (conforming, non-conforming and mixed) and finite volumes methods -- for $2^{\rm nd}$ order diffusion…
Matrix double splitting iterations are simple in implementation while solving real non-singular (rectangular) linear systems. In this paper, we present two Alternating Double Splitting (ADS) schemes formulated by two double splittings and…
A new family of combined subdivision schemes with one tension parameter is proposed by the interpolatory and approximating subdivision schemes. The displacement vectors between the points of interpolatory and approximating subdivision…
In this paper, we propose a solution for a fundamental problem in computational harmonic analysis, namely, the construction of a multiresolution analysis with directional components. We will do so by constructing subdivision schemes which…
In this work we construct subdivision schemes refining general subsets of R^n and study their applications to the approximation of set-valued functions. Differently from previous works on set-valued approximation, our methods are developed…
A method is introduced for the construction of meshless discretization schemes which preserve Lie symmetries of the differential equations that these schemes approximate. The method exploits the fact that equivariant moving frames provide a…
We study the convergence properties of the Gibbs Sampler in the context of posterior distributions arising from Bayesian analysis of conditionally Gaussian hierarchical models. We develop a multigrid approach to derive analytic expressions…
The solution of systems of linear(ized) equations lies at the heart of many problems in Scientific Computing. In particular for systems of large dimension, iterative methods are a primary approach. Stationary iterative methods are generally…