1997American Mathematical Society CONVERGENCE OF CASCADE ALGORITHMS ASSOCIATED WITH NONHOMOGENEOUS REFINEMENT EQUATIONS
نویسندگان
چکیده
This paper is devoted to a study of multivariate nonhomogeneous reenement equations of the form (x) = g(x) +
منابع مشابه
Convergence of Cascade Algorithms Associated with Nonhomogeneous Refinement Equations
This paper is devoted to a study of multivariate nonhomogeneous refinement equations of the form φ(x) = g(x) + ∑ α∈Zs a(α)φ(Mx − α), x ∈ R, where φ = (φ1, . . . , φr) is the unknown, g = (g1, . . . , gr) is a given vector of functions on Rs, M is an s× s dilation matrix, and a is a finitely supported refinement mask such that each a(α) is an r × r (complex) matrix. Let φ0 be an initial vector i...
متن کاملCharacterization of Smoothness of Multivariate Refinable Functions and Convergence of Cascade Algorithms of Nonhomogeneous Refinement Equations
where ' = ('1; : : : ; 'r) T is the unknown, M is an s£s dilation matrix with m = jdetM j, g = (g1; : : : ; gr) is a given compactly supported vector-valued functions on IR and a is a ̄nitely supported re ̄nement mask such that each a(®) is an r£ r (complex) matrix. In this paper, we characterize the optimal smoothness of a multiple re ̄nable function associated with homogeneous re ̄nement equation...
متن کاملSpectral Factorization of 2-block Toeplitz Matrices and Refinement Equations
Pairs of 2-block Toeplitz (N×N)-matrices (Ts)ij = p2i−j+s−1, s = 0, 1, i, j ∈ {1, . . . , N}, are considered for arbitrary sequences of complex coefficients p0, . . . , pN . A complete spectral resolution of the matrices T0, T1 in the system of their common invariant subspaces is obtained. A criterion of nondegeneracy and of irreducibility of these matrices is derived, and their kernels, root s...
متن کاملAPPROXIMATION OF STOCHASTIC PARABOLIC DIFFERENTIAL EQUATIONS WITH TWO DIFFERENT FINITE DIFFERENCE SCHEMES
We focus on the use of two stable and accurate explicit finite difference schemes in order to approximate the solution of stochastic partial differential equations of It¨o type, in particular, parabolic equations. The main properties of these deterministic difference methods, i.e., convergence, consistency, and stability, are separately developed for the stochastic cases.
متن کاملResidual norm steepest descent based iterative algorithms for Sylvester tensor equations
Consider the following consistent Sylvester tensor equation[mathscr{X}times_1 A +mathscr{X}times_2 B+mathscr{X}times_3 C=mathscr{D},]where the matrices $A,B, C$ and the tensor $mathscr{D}$ are given and $mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007