1717 search results - page 87 / 344 » A Computable Spectral Theorem |
146
click to vote
SIAMSC
2010
14 years 11 months ago
2010
Abstract. BDDC algorithms are constructed and analyzed for the system of almost incompressible elasticity discretized with Gauss-Lobatto-Legendre spectral elements in three dimensi...
142
click to vote
CADE
2004
Springer
16 years 4 months ago
2004
Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
130
click to vote
KBSE
1998
IEEE
15 years 7 months ago
1998
IEEE
Starting from a graphical data model (a subset of the OMT object model), a skeleton of formal specification can be generated and completed to express several constraints and provi...
116
click to vote
BIRTHDAY
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a rst-order sentence is preserved b...
129
click to vote
FCT
2007
Springer
15 years 8 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...