Results 291 to 300 of about 582,534 (335)
Some of the next articles are maybe not open access.
2012
This chapter is a short review of linear algebra leading to a discussion of the singular value decomposition.
openaire +2 more sources
This chapter is a short review of linear algebra leading to a discussion of the singular value decomposition.
openaire +2 more sources
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015
In this paper we present a novel data structure for sparse vectors based on Cuckoo hashing. It is highly memory efficient and allows for random access at near dense vector level rates. This allows us to solve sparse l1 programming problems exactly and without preprocessing at a cost that is identical to dense linear algebra both in terms of memory and ...
Li Zhou 0006 +3 more
openaire +1 more source
In this paper we present a novel data structure for sparse vectors based on Cuckoo hashing. It is highly memory efficient and allows for random access at near dense vector level rates. This allows us to solve sparse l1 programming problems exactly and without preprocessing at a cost that is identical to dense linear algebra both in terms of memory and ...
Li Zhou 0006 +3 more
openaire +1 more source
Canadian Mathematical Bulletin, 1966
The primordial problems of linear algebra are the solution of a system of linear equations and the solution of the eigenvalue problem for the eigenvalues λk, and corresponding ...
openaire +1 more source
The primordial problems of linear algebra are the solution of a system of linear equations and the solution of the eigenvalue problem for the eigenvalues λk, and corresponding ...
openaire +1 more source
Numerical Linear Algebra [PDF]
, 2011 Many methods of computational statistics lead to matrix-algebra or numerical-mathematics problems. For example, the least squares method in linear regression reduces to solving a system of linear equations, see Chap. III.8. The principal components method is based on finding eigenvalues and eigenvectors of a matrix, see Chap. III.6.
Čížek, Pavel, Čížková, Lenka
openaire +3 more sources
Geometric Algebra in Linear Algebra and Geometry
Acta Applicandae Mathematica, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pozo, José María, Sobczyk, Garret
openaire +1 more source
Communications to SIMAI Congress, 2006
Tipografia Samperi ...
RESTUCCIA, Gaetana, CARFI', Vito
openaire +3 more sources
Tipografia Samperi ...
RESTUCCIA, Gaetana, CARFI', Vito
openaire +3 more sources
European Journal of Operational Research
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dimitris Bertsimas, Thodoris Koukouvinos
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dimitris Bertsimas, Thodoris Koukouvinos
openaire +1 more source
2011
A linear process is a system of events and states related by an inner product, on which are defined the behaviorally motivated operations of tensor product or orthocurrence, sum or concurrence, sequence, and choice. Linear process algebra or LPA is the theory of this framework.
openaire +1 more source
A linear process is a system of events and states related by an inner product, on which are defined the behaviorally motivated operations of tensor product or orthocurrence, sum or concurrence, sequence, and choice. Linear process algebra or LPA is the theory of this framework.
openaire +1 more source
The Fundamental Theorem of Algebra and Linear Algebra
The American Mathematical Monthly, 2003The first widely accepted proof of the Fundamental Theorem of Algebra was published by Gaus in 1799 in his Ph.D. thesis, although to current standards this proof has gaps. Argand gave a proof (with only small gaps) in 1814 which was based on a flawed proof of d’Alembert of 1746. Many more proofs followed, including three more proofs by Gaus. For a more
openaire +2 more sources
Reports Math. Log., 2020
The notion of equivalential algebra was introduced by J. K. Kabziński and A. Wroński as an algebraic counterpart of the equivalential fragment of intuitionistic logic. In earlier work [Equivalential algebras, Ph.D. Thesis, Jag. Univ. Kraków; Algebra Univers. 35, No.
openaire +1 more source
The notion of equivalential algebra was introduced by J. K. Kabziński and A. Wroński as an algebraic counterpart of the equivalential fragment of intuitionistic logic. In earlier work [Equivalential algebras, Ph.D. Thesis, Jag. Univ. Kraków; Algebra Univers. 35, No.
openaire +1 more source