๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Complexity theory of numerical linear algebra

โœ Scribed by Eric Kostlan

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
834 KB
Volume
22
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

C*-Algebras and Numerical Linear Algebra
C*-Algebras and Numerical Linear Algebra
โœ W. Arveson ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 956 KB

Given a self-adjoint operator \(A\) on a Hilbert space, suppose that one wishes to compute the spectrum of \(A\) numerically. In practice, these problems often arise in such a way that the matrix of \(A\) relative to a natural basis is "sparse." For example, discretized second-order differential ope

The Computational Complexity of Some Pro
The Computational Complexity of Some Problems of Linear Algebra
โœ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=

Galois theory and linear algebra
Galois theory and linear algebra
โœ Rod Gow; Rachel Quinlan ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 124 KB

Let K be a field admitting a Galois extension L of degree n with Galois group G. Artin's lemma on the independence of characters implies that the algebra of K-linear endomorphisms of L is identical with the set of L-linear combinations of the elements of G. This paper examines some consequences of t