Results 21 to 30 of about 86 (84)

A binary encoding of spinors and applications

open access: yesComplex Manifolds, 2020
We present a binary code for spinors and Clifford multiplication using non-negative integers and their binary expressions, which can be easily implemented in computer programs for explicit calculations.
Arizmendi Gerardo, Herrera Rafael
doaj   +1 more source

α‐Derivations and their norm in projective tensor products of Γ‐Banach algebras

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 21, Issue 2, Page 359-368, 1998., 1996
Let (V, Γ) and (V′, Γ′) be Gamma‐Banach algebras over the fields F1 and F2 isomorphic to a field F which possesses a real valued valuation, and (V, Γ)⊗p(V′, Γ′), their projective tensor product. It is shown that if D1 and D2 are α ‐ derivation and α′ ‐ derivation on (V, Γ) and (V′, Γ′) respectively and , is an arbitrary element of (V, Γ)⊗p(V′, Γ ...
T. K. Dutta, H. K. Nath, R. C. Kalita
wiley   +1 more source

A note on the three-way generalization of the Jordan canonical form

open access: yesOpen Mathematics, 2018
The limit point 𝓧 of an approximating rank-R sequence of a tensor Ƶ can be obtained by fitting a decomposition (S, T, U) ⋅ 𝓖 to Ƶ. The decomposition of the limit point 𝓧 = (S, T, U) ⋅ 𝓖 with 𝓖 = blockdiag(𝓖1, … , 𝓖m) can be seen as a three order ...
Cui Lu-Bin, Li Ming-Hui
doaj   +1 more source

A concise proof to the spectral and nuclear norm bounds through tensor partitions

open access: yesOpen Mathematics, 2019
On estimations of the lower and upper bounds for the spectral and nuclear norm of a tensor, Li established neat bounds for the two norms based on regular tensor partitions, and proposed a conjecture for the same bounds to be hold based on general tensor ...
Kong Xu
doaj   +1 more source

Bound for the largest singular value of nonnegative rectangular tensors

open access: yesOpen Mathematics, 2016
In this paper, we give a new bound for the largest singular value of nonnegative rectangular tensors when m = n, which is tighter than the bound provided by Yang and Yang in “Singular values of nonnegative rectangular tensors”, Front. Math.
He Jun   +4 more
doaj   +1 more source

Two new eigenvalue localization sets for tensors and theirs applications

open access: yesOpen Mathematics, 2017
A new eigenvalue localization set for tensors is given and proved to be tighter than those presented by Qi (J. Symbolic Comput., 2005, 40, 1302-1324) and Li et al. (Numer. Linear Algebra Appl., 2014, 21, 39-50).
Zhao Jianxing, Sang Caili
doaj   +1 more source

Some inequalities on the spectral radius of nonnegative tensors

open access: yesOpen Mathematics, 2020
The eigenvalues and the spectral radius of nonnegative tensors have been extensively studied in recent years. In this paper, we investigate the analytic properties of nonnegative tensors and give some inequalities on the spectral radius.
Ma Chao   +3 more
doaj   +1 more source

Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints

open access: yes, 2010
Bi-quadratic optimization, Semidefinite programming relaxation, Approximation solution, Probabilistic solution, 15A69, 90C22, 90C26, 90C59,
Liqun Qi, Chen Ling, Xinzhen Zhang
core   +1 more source

An S-type upper bound for the largest singular value of nonnegative rectangular tensors

open access: yesOpen Mathematics, 2016
An S-type upper bound for the largest singular value of a nonnegative rectangular tensor is given by breaking N = {1, 2, … n} into disjoint subsets S and its complement. It is shown that the new upper bound is smaller than that provided by Yang and Yang (
Zhao Jianxing, Sang Caili
doaj   +1 more source

New bounds for the minimum eigenvalue of 𝓜-tensors

open access: yesOpen Mathematics, 2017
A new lower bound and a new upper bound for the minimum eigenvalue of an 𝓜-tensor are obtained. It is proved that the new lower and upper bounds improve the corresponding bounds provided by He and Huang (J. Inequal.
Zhao Jianxing, Sang Caili
doaj   +1 more source

Home - About - Disclaimer - Privacy