2,242 research outputs found
A general approach to transforming finite elements
The use of a reference element on which a finite element basis is constructed
once and mapped to each cell in a mesh greatly expedites the structure and
efficiency of finite element codes. However, many famous finite elements such
as Hermite, Morley, Argyris, and Bell, do not possess the kind of equivalence
needed to work with a reference element in the standard way. This paper gives a
generalizated approach to mapping bases for such finite elements by means of
studying relationships between the finite element nodes under push-forward.Comment: 28 page
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts
We compute minimal bases of solutions for a general interpolation problem,
which encompasses Hermite-Pad\'e approximation and constrained multivariate
interpolation, and has applications in coding theory and security.
This problem asks to find univariate polynomial relations between vectors
of size ; these relations should have small degree with respect to an
input degree shift. For an arbitrary shift, we propose an algorithm for the
computation of an interpolation basis in shifted Popov normal form with a cost
of field operations, where
is the exponent of matrix multiplication and the notation
indicates that logarithmic terms are omitted.
Earlier works, in the case of Hermite-Pad\'e approximation and in the general
interpolation case, compute non-normalized bases. Since for arbitrary shifts
such bases may have size , the cost bound
was feasible only with restrictive
assumptions on the shift that ensure small output sizes. The question of
handling arbitrary shifts with the same complexity bound was left open.
To obtain the target cost for any shift, we strengthen the properties of the
output bases, and of those obtained during the course of the algorithm: all the
bases are computed in shifted Popov form, whose size is always . Then, we design a divide-and-conquer scheme. We recursively reduce
the initial interpolation problem to sub-problems with more convenient shifts
by first computing information on the degrees of the intermediate bases.Comment: 8 pages, sig-alternate class, 4 figures (problems and algorithms
A framework for structured linearizations of matrix polynomials in various bases
We present a framework for the construction of linearizations for scalar and
matrix polynomials based on dual bases which, in the case of orthogonal
polynomials, can be described by the associated recurrence relations. The
framework provides an extension of the classical linearization theory for
polynomials expressed in non-monomial bases and allows to represent polynomials
expressed in product families, that is as a linear combination of elements of
the form , where and
can either be polynomial bases or polynomial families
which satisfy some mild assumptions. We show that this general construction can
be used for many different purposes. Among them, we show how to linearize sums
of polynomials and rational functions expressed in different bases. As an
example, this allows to look for intersections of functions interpolated on
different nodes without converting them to the same basis. We then provide some
constructions for structured linearizations for -even and
-palindromic matrix polynomials. The extensions of these constructions
to -odd and -antipalindromic of odd degree is discussed and
follows immediately from the previous results
Conforming finite element methods for the clamped plate problem
Finite element methods for solving biharmonic boundary value problems are considered. The particular problem discussed is that of a clamped thin plate. This problem is reformulated in a weak, form in the Sobolev space Techniques for setting up conforming trial
Functions are utilized in a Galerkin technique to produce finite element solutions. The shortcomings of various trial function formulations are discussed, and a macro—element approach to local mesh refinement using rectangular elements is given
Recommended from our members
Smooth parametric surfaces and n-sided patches
The theory of 'geometric continuity' within the subject of CAGD is reviewed. In particular, we are concerned with how parametric surface patches for CAGD can be pieced together to form a smooth Ck surface. The theory is applied to the problem of filling an n-sided hole occurring within a smooth rectangular patch complex. A number of solutions to this problem are surveyed
Recommended from our members
Compatable smooth interpolation in triangles
Boolean sum smooth interpolation to boundary data on a triangle is described. Sufficient conditions are given so that the functions when pieced together form a CN-1(Ω) function over a triangular subdivision of a polygonal region Ω and the precision sets of the interpolation functions are derived. The interpolants are modified so that the compatability conditions on the function which is interpolated can be removed and a C1 interpolant is used to illustrate the theory. The generation of interpolation schemes for discrete boundary data is also discussed
- …