Search
Now showing items 71-80 of 80
Preprint
Construction of recurrent fractal interpolation surfaces(RFISs) on rectangular grids
(2008)
A recurrent iterated function system (RIFS) is a genaralization of an IFS and provides
nonself-affine fractal sets which are closer to natural objects. In general, it's attractor
is not a continuous surface in R3. A recurrent fractal interpolation surface (RFIS) is an
attractor of RIFS which is a graph of bivariate continuous interpolation function. We
introduce a general method of generating recurrent interpolation surface which are at-
tractors of RIFSs about any data set on a grid.
Preprint
Construction of fractal interpolation surfaces on rectangular grids
(2008)
We present a general method of generating continuous fractal interpolation surfaces
by iterated function systems on an arbitrary data set over rectangular grids and estimate
their Box-counting dimension.
Preprint
A generic formula for the values at the boundary points of monic classical orthogonal polynomials
(2005)
In a previous paper we have determined a generic formula for the polynomial solution families of the well-known differential equation of hypergeometric type σ(x)y"n(x)+τ(x)y'n(x)-λnyn(x)=0. In this paper, we give another such formula which enables us to present a generic formula for the values of monic classical orthogonal polynomials at their boundary points of definition.
Preprint
Spacelike maximal surfaces in 3D Lorentz-Minkowski space
(2006)
We investigate spacelike maximal surfaces in 3-dimensional Lorentz-Minkowski space,
give an Enneper-Weierstrass representation of such surfaces and classify those with a Lorentzian or Euclidian rotation symmetry.
Preprint
Computing Generators of Free Modules over Orders in Group Algebras
(2007)
Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case that the Wedderburn decomposition E[G] \cong \oplus_xM_x is explicitly computable and each M_x is in fact a matrix ring over a field, this leads to an algorithm that either gives elements \alpha_1,...,\alpha_d \in X such that X = A\alpha_1 \oplus ... \oplusA\alpha_d or determines ...
Dissertation
Some New Classes of Orthogonal Polynomials and Special Functions
(2006-11-01)
In dieser Dissertation präsentieren wir zunächst eine Verallgemeinerung der üblichen Sturm-Liouville-Probleme mit symmetrischen Lösungen und erklären eine umfassendere Klasse. Dann führen wir einige neue Klassen orthogonaler Polynome und spezieller Funktionen ein, welche sich aus dieser symmetrischen Verallgemeinerung ableiten lassen. Als eine spezielle Konsequenz dieser Verallgemeinerung führen wir ein Polynomsystem mit vier freien Parametern ein und zeigen, dass in diesem System fast alle klassischen symmetrischen ...
Dissertation
Gröbnerbasen in Ore-Algebren
(2006-06-19)
In dieser Arbeit werden grundlegende Algorithmen für Ore-Algebren in Mathematica realisiert. Dabei entsteht eine Plattform um die speziellen Beschränkungen und Möglichkeiten dieser Algebren insbesondere im Zusammenhang mit Gröbnerbasen an praktischen Beispielen auszuloten. Im Gegensatz zu den existierenden Paketen wird dabei explizit die Struktur der Ore-Algebra benutzt. Kandri-Rody und Weispfenning untersuchten 1990 Verallgemeinerungen von Gröbnerbasen auf Algebren ordnungserhaltender Art (``algebras of solvable ...
Preprint
Church-Rosser groups and growing context-sensitive groups
(2006)
A finitely generated group is called a Church-Rosser group (growing context-sensitive group) if it admits a finitely generated presentation for which the word problem is a Church-Rosser (growing context-sensitive) language. Although the Church-Rosser languages are incomparable to the context-free languages under set inclusion, they strictly contain the class of deterministic context-free languages. As each context-free group language is actually deterministic context-free, it follows that all context-free groups are ...
Preprint
Functions satisfying holonomic q-differential equations
(2007-05-21)
In a similar manner as in some previous papers, where explicit algorithms for finding the differential equations satisfied by holonomic functions were given, in this paper we deal with the space of the q-holonomic functions which are the solutions of linear q-differential equations with polynomial coefficients. The sum, product and the composition with power functions of q-holonomic functions are also q-holonomic and the resulting q-differential equations can be computed algorithmically.
Preprint
On the Computation of Fourier Coefficients
(2006-11-16)
In this paper we derive an identity for the Fourier coefficients of a differentiable function f(t) in terms of the Fourier coefficients of its derivative f'(t). This yields an algorithm to compute the Fourier coefficients of f(t) whenever the Fourier coefficients of f'(t) are known, and vice versa. Furthermore this generates an iterative scheme for N times differentiable functions complementing the direct computation of Fourier coefficients via the defining integrals which can be also treated automatically in certain cases.