Squeezable Orthogonal Bases: Accuracy and Smoothness
نویسندگان
چکیده
منابع مشابه
Squeezable Orthogonal Bases: Accuracy and Smoothness
We present a method for generating local orthogonal bases on arbitrary partitions of R from a given local orthogonal shift-invariant basis via what we call a squeeze map. We give necessary and suÆcient conditions for a squeeze map to generate a non-uniform basis that preserves any smoothness and/or accuracy (polynomial reproduction) of the shift-invariant basis. When the shift-invariant basis h...
متن کاملOrthogonal Bases and the QRAlgorithm
Throughout, we work in the Euclidean vector space V = R, the space of column vectors with n real entries. As inner product, we will only use the dot product v ·w = vw and corresponding Euclidean norm ‖v ‖ = √v · v . Two vectors v,w ∈ V are called orthogonal if their inner product vanishes: v ·w = 0. In the case of vectors in Euclidean space, orthogonality under the dot product means that they m...
متن کاملShift-orthogonal wavelet bases
Shift-orthogonal wavelets are a new type of multiresolution wavelet bases that are orthogonal with respect to translation (or shifts) within one level but not with respect to dilations across scales. In this paper, we characterize these wavelets and investigate their main properties by considering two general construction methods. In the first approach, we start by specifying the analysis and s...
متن کاملHilbert Bases for Orthogonal Arrays
In this paper, we relate the problem of generating all 2-level orthogonal arrays of given dimension and force, i.e. elements in OA(n, m), where n is the number of factors and m the force, to the solution of an Integer Programming problem involving rational convex cones. We do not restrict the number of points in the array, i.e. we admit any number of replications. This problem can be theoretica...
متن کاملOn Nearly Orthogonal Lattice Bases
We study ”nearly orthogonal” lattice bases, or bases where the angle between any basis vector and the linear subspace spanned by the other basis vectors is greater than π 3 radians. We show that a nearly orthogonal lattice basis always contains a shortest lattice vector. Moreover, if the lengths of the basis vectors are “nearly equal”, then the basis is the unique nearly orthogonal lattice basi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 2002
ISSN: 0036-1429,1095-7170
DOI: 10.1137/s0036142900380868