Results 261 to 270 of about 92,081 (302)

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

A new transformation matrix for bilinear transformation

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bapeswara Rao, V. V., Sankara Rao, K.
openaire   +1 more source

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

Matrix differential transformations

Applicable Analysis, 1997
Differential transformations can be used in order to transform solutions of a simple differential equation into solutions of a more complicated differential equation. That way one gets explicit representations for solutions of some special differential equations.
H. Florian, J. Püngel, W. Tutschke
openaire   +1 more source

A new method of matrix transformation. I. Matrix diagonalizations via involutional transformations

Journal of Mathematical Physics, 1979
It is shown that two matrices A and B of order n×n which satisfy a monic quadratic equation with two roots λ1 and λ2 are connected by ATAB=TABB where TAB=A+B−(λ1+λ2) I with I being the n×n unit matrix (Theorem 1). The condition for TAB to be involutional is that the anticommutator of ?=A−(1/2)(λ1+λ2) I and ?=B−(1/2)(λ1+λ2) is a c number (Theorem 2).
openaire   +2 more sources

Matrix Transformations

2021
Gokulananda Das, Sudarsan Nanda
openaire   +1 more source