๐”– Bobbio Scriptorium
โœฆ   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

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

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

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.