One way of using a computer algebra system to do research in finite geometry is to use the system to construct "small" order examples of various constructions, and then hope to recognize a pattern that can be generalized and eventually proven. Of course, initially one does not know if the "small" or
โฆ LIBER โฆ
Algebraic geometry foundations for finite element computation
โ Scribed by E.L. Wachspress
- Publisher
- Elsevier Science
- Year
- 1980
- Weight
- 81 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0270-0255
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Constructions in Finite Geometry Using C
โ
G.L. Ebert
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 271 KB
Current research involving applications
โ
E.L. Wachspress
๐
Article
๐
1980
๐
Elsevier Science
โ 81 KB
The adjoint for an algebraic finite elem
โ
G. Dasgupta; E. Wachspress
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 494 KB
A deterrent to application of rational basis functions over algebraic elements has been the need to compute denominator polynomials (element adjoints) from multiple points of the element boundary. Dasgupta devised a simple algorithm for eliminating this problem for convex polygons. This algorithm is
Accuracy in finite element computation f
โ
P. Ladeveze; J. P. Pelle
๐
Article
๐
1989
๐
John Wiley and Sons
๐
English
โ 800 KB
Computing Ext Algebras for Finite Groups
โ
JON F. CARLSON; EDWARD L. GREEN; GERHARD J.A. SCHNIEDER
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 355 KB
Suppose that G is a finite group and k is a field of characteristic p > 0. In this paper we describe a scheme for computing the Ext algebra of kG, i.e. the algebra Ext \* kg (T, T ) where T is the sum of irreducible kG-modules.
FINSLER: A computer algebra package for
โ
Solange F. Rutz; Renato Portugal
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 519 KB