Results 271 to 280 of about 21,477 (310)
Some of the next articles are maybe not open access.
The Sparse Basis Problem and Multilinear Algebra
SIAM Journal on Matrix Analysis and Applications, 1995Let \(A\) be a \(k\times n\) undetermined matrix. The sparse basis problem for the row space \(W\) of \(A\) is to find a basis of \(W\) with the fewest number of nonzeros. Suppose that all the entries of \(A\) are nonzero, and that they are algebraically independent over the rational number field. Then every nonzero vector in \(W\) has at least \(n- k+
Richard A. Brualdi +2 more
openaire +1 more source
Algebraic Analysis of the Hierarchical Basis Preconditioner
SIAM Journal on Matrix Analysis and Applications, 1995Considering the standard conforming P1 approximation of two-dimensional elliptic boundary value problems, it is well known that Yserentant's hierarchical basis preconditioner results in a spectral condition number of the preconditioned stiffness matrix of order \(O((\log h^{-1})^2)\) [cf. \textit{H. Yserentant}, Numer. Math. 49, 379-412 (1986; Zbl 0608.
Howard C. Elman, Xuejun Zhang
openaire +2 more sources
On the existence of a disk algebra basis
Signal Processing, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On lie algebras with monomial basis
Siberian Mathematical Journal, 1993Finite groups generated by 3-transpositions have been introduced and investigated in depth by \textit{B. Fischer} [Invent. Math. 13, 232-246 (1971; Zbl 0232.20040)]. Motivated by this remarkable result, the author attempts to study Lie algebras \(L\) over a field \(\Phi\) with a monomial basis \({\mathcal D}\) (that is, \(\forall a,b \in {\mathcal D}\),
openaire +2 more sources
n-Algebras admitting a multiplicative basis
Journal of Algebra and Its Applications, 2018Let [Formula: see text] be an [Formula: see text]-algebra of arbitrary dimension and over an arbitrary base field [Formula: see text]. A basis [Formula: see text] of [Formula: see text] is said to be multiplicative if for any [Formula: see text], we have either [Formula: see text] or [Formula: see text] for some (unique) [Formula: see text].
Calderón Martín, Antonio J. +2 more
openaire +2 more sources
PBW-basis for the composition algebra of the Kronecker algebra
Journal für die reine und angewandte Mathematik (Crelles Journal), 2000The Hall algebra of a finite-dimensional associative algebra \(A\) with unit over a finite field \(k\) is a \(\mathbb{Q}\)-vector space with basis the isomorphism classes of all finite modules, with multiplication given by \([M]\cdot[N]:=\sum_{[L]}g_{M,N}^L[L]\), where \(g^L_{M,N}\) is the number of submodules \(V\) of \(L\) isomorphic to \(N\) with ...
openaire +1 more source
Independence algebras, basis algebras and semigroups of quotients
Proceedings of the Edinburgh Mathematical Society, 2010AbstractWe show that ifAis a stable basis algebra satisfying thedistributivity condition, thenBis a reduct of an independence algebraAhaving the same rank. If this rank is finite, then the endomorphism monoid ofBis a left order in the endomorphism monoid ofA.
openaire +2 more sources
Leibniz Algebras Admitting a Multiplicative Basis
Bulletin of the Malaysian Mathematical Sciences Society, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A Unique Decomposition for Algebras with Multiplicative Basis
Results in MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Bouarroudj +2 more
openaire +2 more sources
The basis of a computer system for modern algebra
Proceedings of the fourth ACM symposium on Symbolic and algebraic computation - SYMSAC '81, 1981So-called general purpose systems for algebraic computation such as ALTRAN, MACSYMA, SAC, SCRATCHPAD and REDUCE are almost exclusively concerned with what is usually known as “classical algebra”, that is, rings of real or complex polynomials and rings of real or complex functions.
openaire +1 more source