Results 1  10
of
706,716
Decomposition Of Algebras Over R And C
"... We consider the boolean complexity of the decomposition of matrix algebras over C and R with bases consisting of matrices over a number field. Deterministic polynomial time algorithms for the decomposition of semisimple algebras over these fields and Las Vegas polynomial time algorithms for the dec ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
We consider the boolean complexity of the decomposition of matrix algebras over C and R with bases consisting of matrices over a number field. Deterministic polynomial time algorithms for the decomposition of semisimple algebras over these fields and Las Vegas polynomial time algorithms
Ktheory for operator algebras
 Mathematical Sciences Research Institute Publications
, 1998
"... p. XII line5: since p. 12: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The RieszFischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b] is a ..."
Abstract

Cited by 556 (0 self)
 Add to MetaCart
space is not σfinite. p. 13: add after I.2.6.16: I.2.6.17. If X is a compact subset of C not containing 0, and k ∈ N, there is in general no bound on the norm of T −1 as T ranges over all operators with ‖T ‖ ≤ k and σ(T) ⊆ X. For example, let Sn ∈ L(l 2) be the truncated shift: Sn(α1, α2,...) = (0
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 504 (2 self)
 Add to MetaCart
Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k
Symplectic reflection algebras, CalogeroMoser space, and deformed HarishChandra homomorphism
 Invent. Math
"... To any finite group Γ ⊂ Sp(V) of automorphisms of a symplectic vector space V we associate a new multiparameter deformation, Hκ, of the algebra C[V]#Γ, smash product of Γ with the polynomial algebra on V. The parameter κ runs over points of CP r, where r = number of conjugacy classes of symplectic ..."
Abstract

Cited by 280 (39 self)
 Add to MetaCart
To any finite group Γ ⊂ Sp(V) of automorphisms of a symplectic vector space V we associate a new multiparameter deformation, Hκ, of the algebra C[V]#Γ, smash product of Γ with the polynomial algebra on V. The parameter κ runs over points of CP r, where r = number of conjugacy classes of symplectic
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
Optimizing Matrix Multiply using PHiPAC: a Portable, HighPerformance, ANSI C Coding Methodology
, 1996
"... Modern microprocessors can achieve high performance on linear algebra kernels but this currently requires extensive machinespecific hand tuning. We have developed a methodology whereby nearpeak performance on a wide range of systems can be achieved automatically for such routines. First, by analyz ..."
Abstract

Cited by 262 (24 self)
 Add to MetaCart
given system. We report on a BLAS GEMM compatible multilevel cacheblocked matrix multiply generator which produces code that achieves around 90% of peak on the Sparcstation20/61, IBM RS/6000590, HP 712/80i, SGI Power Challenge R8k, and SGI Octane R10k, and over 80% of peak on the SGI Indigo R4k
Automated Consistency Checking of Requirements Specifications
, 1996
"... This paper describes a formal analysis technique, called consistency checking, for automatic detection of errors, such as type errors, nondeterminism, missing cases, and circular definitions, in requirements specifications. The technique is designed to analyze requirements specifications expressed i ..."
Abstract

Cited by 268 (33 self)
 Add to MetaCart
This paper describes a formal analysis technique, called consistency checking, for automatic detection of errors, such as type errors, nondeterminism, missing cases, and circular definitions, in requirements specifications. The technique is designed to analyze requirements specifications expressed in the SCR (Software Cost Reduction) tabular notation. As background, the SCR approach to specifying requirements is reviewed. To provide a formal semantics for the SCR notation and a foundation for consistency checking, a formal requirements model is introduced; the model represents a software system as a finite state automaton, which produces externally visible outputs in response to changes in monitored environmental quantities. Results are presented of two experiments which evaluated the utility and sealability of our technique for consistency checking in a realworld avionics application. The role of consistency checking during the requirements phase of software development is discussed.
decomposition
, 2006
"... This paper develops an identity for additive modivations of a singular value decomposition (SVD) to reflect updates, downdates, shifts, and edits of the data matrix. This sets the stage for fast and ememoryefficient sequential algorithms for tracking singular values and subspaces. In conjunction wi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper develops an identity for additive modivations of a singular value decomposition (SVD) to reflect updates, downdates, shifts, and edits of the data matrix. This sets the stage for fast and ememoryefficient sequential algorithms for tracking singular values and subspaces. In conjunction
Results 1  10
of
706,716