FIRST PRINCIPLE CALCULATION WITH INTERPOLATING SCALING FUNCTION ON ADAPTIVE GRIDDING

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interpolating Scaling Vectors

In this paper we construct a one–parameter family of interpolating multigenerators which generalize the scalar generators constructed in [2] in a natural way. Furthermore we extend this approach to design a family of interpolating orthonormal multigenerators. The construction is based on the factorization techniques introduced in [21].

متن کامل

Symmetric Interpolating Scaling Functions

In many applications, wavelets are usually expected to have the following properties: compact support, orthogonality, linear-phase, regularity, and interpolation. To construct such wavelets, it is crucial designing scaling functions with the above properties. In twoand three-band cases, except for the Haar functions, there exists no scaling function with the above five properties. In -band case...

متن کامل

Multivariate Symmetric Interpolating Scaling Vectors with Duals

In this paper we introduce an algorithm for the construction of compactly supported interpolating scaling vectors on Rd with certain symmetry properties. In addition, we give an explicit construction method for corresponding symmetric dual scaling vectors and multiwavelets. As the main ingredients of our recipe we derive some implementable conditions for accuracy, symmetry, and biorthogonality ...

متن کامل

Nonseparable Orthonormal Interpolating Scaling Vectors

In this paper we introduce an algorithm for the construction of interpolating scaling vectors on Rd with compact support and orthonormal integer translates. Our method is substantiated by constructing several examples of bivariate scaling vectors for quincunx and box– spline dilation matrices. As the main ingredients of our recipe we derive some implementable conditions for accuracy and orthono...

متن کامل

Adaptive Constraint Satisfaction: The Quickest First Principle

The choice of a particular algorithm for solving a given class of constraint satisfaction problems is often confused by exceptional behaviour of algorithms. One method of reducing the impact of this exceptional behaviour is to adopt an adaptive philosophy to constraint satisfaction problem solving. In this paper we describe one such adaptive algorithm based on the principle of chaining and desi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Modern Physics C

سال: 2007

ISSN: 0129-1831,1793-6586

DOI: 10.1142/s0129183107011650