Results 181 to 190 of about 440,251 (233)
Some of the next articles are maybe not open access.
Applied Mathematics and Computation, 2011
Some properties of the matricial expression of the Fourier-Wiener transform are considered. Here the referred properties are a composition formula, Parceval formula and an inversion formula which is the extension an unitary explicit integral representation of the second quantization for one integral operator of the Wiener transform.
Nácere Hayek +2 more
openaire +2 more sources
Some properties of the matricial expression of the Fourier-Wiener transform are considered. Here the referred properties are a composition formula, Parceval formula and an inversion formula which is the extension an unitary explicit integral representation of the second quantization for one integral operator of the Wiener transform.
Nácere Hayek +2 more
openaire +2 more sources
Analysis, 1986
Summary: Let a probability space (\(\Omega\),\(\Sigma\),P) and sequences of r.v.'s \((X_ n(\omega))_ 1^{\infty}\), \((Y_ n(\omega))_ 1^{\infty}\), and a matrix of r.v.'s \(A=(A_{nk}(\omega))^{\infty}_{n,k=1}\) be given. We ask for the exact conditions for A which guarantee that each sequence \((X_ n(\omega))_ 1^{\infty}\), which is a.s. an element of \(
Stadtmüller, U., Trautner, Rolf
openaire +2 more sources
Summary: Let a probability space (\(\Omega\),\(\Sigma\),P) and sequences of r.v.'s \((X_ n(\omega))_ 1^{\infty}\), \((Y_ n(\omega))_ 1^{\infty}\), and a matrix of r.v.'s \(A=(A_{nk}(\omega))^{\infty}_{n,k=1}\) be given. We ask for the exact conditions for A which guarantee that each sequence \((X_ n(\omega))_ 1^{\infty}\), which is a.s. an element of \(
Stadtmüller, U., Trautner, Rolf
openaire +2 more sources
The Matrix Transform Processor
IEEE Transactions on Computers, 1976A matrix transform processor (MTP) for an Evans and Sutherland LDS-2 graphics system has been designed and built at the University of North Carolina. The MTP performs all the important functions of a matrix multiplier, clipper, and perspective divider.
openaire +1 more source
Periodica Mathematica Hungarica, 1982
Let \(\delta\) be the space of all sequences \((x_ n)_{n\in {\mathbb{N}}}\) for which \(| x_ n|^{1/n}\to 0\) as \(n\to \infty\). The matrices \(A=[a_{ij}]_{i,j\in {\mathbb{N}}}\) are characterized which define a matrix transformation \(A:\ell^ 1\to \delta\). The main theorem and its proof are improvements of results of \textit{K. C. Rao}, Glasg.
Gupta, M., Kamthan, P. K.
openaire +2 more sources
Let \(\delta\) be the space of all sequences \((x_ n)_{n\in {\mathbb{N}}}\) for which \(| x_ n|^{1/n}\to 0\) as \(n\to \infty\). The matrices \(A=[a_{ij}]_{i,j\in {\mathbb{N}}}\) are characterized which define a matrix transformation \(A:\ell^ 1\to \delta\). The main theorem and its proof are improvements of results of \textit{K. C. Rao}, Glasg.
Gupta, M., Kamthan, P. K.
openaire +2 more sources
Boletín de la Sociedad Matemática Mexicana, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
O. E. Yaremko, K. R. Zababurin
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
O. E. Yaremko, K. R. Zababurin
openaire +2 more sources
Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2003
The matrix transform chip (MTC) is designed to perform matrix computations of the form Y=UDV where D is the input data matrix of 16-bit twos complement fixed-point numbers and U, V, are arbitrary coefficient matrices of the same precision. The data matrix D is input to the chip in raster scanned order at a maximum sample rate of 40 MHz, and the output ...
openaire +1 more source
The matrix transform chip (MTC) is designed to perform matrix computations of the form Y=UDV where D is the input data matrix of 16-bit twos complement fixed-point numbers and U, V, are arbitrary coefficient matrices of the same precision. The data matrix D is input to the chip in raster scanned order at a maximum sample rate of 40 MHz, and the output ...
openaire +1 more source
Group Convolutions and Matrix Transforms
SIAM Journal on Algebraic Discrete Methods, 1987Given 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, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Canonical Transformations and Matrix Elements
Journal of Mathematical Physics, 1971We 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
Pericellular Matrix in Malignant Transformation
1982Publisher 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