Results 171 to 180 of about 396,340 (217)

Group Convolutions and Matrix Transforms

SIAM Journal on Algebraic Discrete Methods, 1987
Given a finite group G (possibly noncommutative) and a field \({\mathbb{F}}\), group convolutions are constructed based on the group algebra of G over \({\mathbb{F}}\). Matrices with entries in the group algebra are constructed so that they have a convolution property relative to G.
Eberly, David, Hartung, Paul
openaire   +2 more sources

Matrix Transformations on Köthe Spaces

Results in Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Pericellular Matrix in Malignant Transformation

1982
Publisher Summary This chapter describes the properties of the major defined matrix components, and considers their role for the cell phenotype. The principal function of the matrix is to give mechanical support and to anchor cells in tissue type-specific structures, but it may also have other duties, such as that of a selective permeability barrier.
K, Alitalo, A, Vaheri
openaire   +2 more sources

The Transformation Matrix of Vibrational Waves

Journal of Mathematical Sciences, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kouzov, D. P., Nikitin, G. L., Yakovleva, V. G.   +2 more
openaire   +2 more sources

Canonical Transformations and Matrix Elements

Journal of Mathematical Physics, 1971
We use the ideas on linear canonical transformations developed previously to calculate the matrix elements of the multipole operators between single-particle states in a three-dimensional oscillator potential. We characterize first the oscillator states in the chain of groups Sp(6)⊃Sp(2)×O(3), Sp(2)⊃OS(2), and O(3)⊃OL(2), and then expand the multipole ...
Quesne, Christiane, Moshinsky, Marcos
openaire   +3 more sources

Summability of Matrix Transforms of Subsequences

Canadian Mathematical Bulletin, 1981
AbstractD. F. Dawson has considered several questions of the following nature. Suppose T is a regular matrix summability method. If A is a regular matrix and x is a sequence having a finite limit point, then there exists a subsequence y of x such that each finite limit point of x is a T-limit point of Ay.
openaire   +1 more source

Matrix Transformations in an Incomplete Space

Canadian Journal of Mathematics, 1968
Let X = (X, p) be a seminormed complex linear space with zero θ. Natural definitions of convergent sequence, Cauchy sequence, absolutely convergent series, etc., can be given in terms of the seminorm p. Let us write C = C(X) for the set of all convergent sequences for the set of Cauchy sequences; and L∞ for the set of all bounded sequences.
openaire   +1 more source

The generalized matrix product and the wavelet transform

Journal of Mathematical Imaging and Vision, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huixia Zhu, Gerhard X. Ritter
openaire   +2 more sources

Matrix Transformation Is Complete for the Average Case

SIAM Journal on Computing, 1995
Summary: In the theory of worst case complexity, NP completeness is used to establish that, for all practical purposes, the given NP problem is not decidable in polynomial time. In the theory of average case complexity, average case completeness is supposed to play the role of NP completeness.
Andreas Blass, Yuri Gurevich
openaire   +2 more sources

Unified Matrix Treatment of Discrete Transforms

IEEE Transactions on Computers, 1979
An unified matrix treatment is developed for some discrete transforms such as Haar (HT), rationalized Haar (RHT), rapid (RT), modified Wash–Hadamard (MWHT), Hadamard– Haar (HHT)r, and rationalized Hadamard–Haar (RHHT)r. For RT a technique for recovering the data sequence from the transform vector is presented.
V. Vlasenko, K. R. Rao
openaire   +2 more sources