Search results for "Partial"

A comparison analysis between unsymmetric and symmetric radial basis function collocation methods for the numerical solution of partial differential …

2002

Abstract In this article, we present a thorough numerical comparison between unsymmetric and symmetric radial basis function collocation methods for the numerical solution of boundary value problems for partial differential equations. A series of test examples was solved with these two schemes, different problems with different type of governing equations, and boundary conditions. Particular emphasis was paid to the ability of these schemes to solve the steady-state convection-diffusion equation at high values of the Peclet number. From the examples tested in this work, it was observed that the system of algebraic equations obtained with the symmetric method was in general simpler to solve …

Permutation properties and the fibonacci semigroup

1989

Spaces of typen on partially ordered sets

1989

This paper contains a generalized approach to incidence geometry on partially ordered sets. A difference to the usual geometrical concepts is that points may have different size. Our main result states that a large class of spaces allows lattice theoretic characterizations. Especially, a generalized version of the Veblen-Young axiom of projective geometry has a lattice theoretic equivalent, called then-generation property (which is a generalization of the ‘Verbindungssatz’). Modularity and distributivity of a lattice of subspaces are reflected in the underlying space. Finally we give specializations and examples.

Parabolic Equations Minimizing Linear Growth Functionals: L1-Theory

2004

Let Ω be a bounded set in ℝN with boundary of class C1. We are interested in the problem $$ \left\{ \begin{gathered} \frac{{\partial u}} {{\partial t}} = diva\left( {x,Du} \right)in Q = \left( {0,\infty } \right) \times \Omega , \hfill \\ u\left( {t,x} \right) = \phi \left( x \right)on S = \left( {0,\infty } \right) \times \partial \Omega , \hfill \\ u\left( {0,x} \right) = u_0 \left( x \right)in x \in \Omega \hfill \\ \end{gathered} \right. $$ (1) where ϕ ∈ L1(∂Ω), u0 ∈ L2(Ω) and a(x, ξ) = ∇ξ f(x, ξ, f being a function with linear growth in ‖ξ‖ as ‖ξ‖ → ∞. One of the classical examples is the nonparametric area integrand for which \( f(x,\xi ) = \sqrt {1 + \left\| \xi \right\|^2 } \). Prob…

Completion of partially ordered sets

2007

A Group-theoretical Finiteness Theorem

2008

We start with the universal covering space $${\*M^n}$$ of a closed n-manifold and with a tree of fundamental domains which zips it $${T\longrightarrow\*M^n}$$ . Our result is that, between T and $${\* M^n}$$ , is an intermediary object, $${T\stackrel{p} {\longrightarrow} G \stackrel{F}{\longrightarrow} \*M^n}$$ , obtained by zipping, such that each fiber of p is finite and $${T\stackrel{p}{\longrightarrow}G\stackrel{F}{\longrightarrow} \*M^n}$$ admits a section.

The complex of words and Nakaoka stability

2005

We give a new simple proof of the exactness of the complex of injective words and use it to prove Nakaoka's homology stability for symmetric groups. The methods are generalized to show acyclicity in low degrees for the complex of words in "general position". Hm(§ni1;Z) = Hm(§n;Z) for n=2 > m where §n denotes the permutation group of n elements. An elementary proof of this fact has not been available in the literature. In the first section the complex C⁄(m) of abelian groups is studied which in de- gree n is freely generated by injective words of length n. The alphabet consists of m letters. The complex C⁄(m) has the only non vanishing homology in degree m (Theorem 1). This is a result of F.…

GENERALITY OF GRAPHIC VARIABLES ACROSS DRAWING TASKS

1968

Konttinen, R. & Olkinuora, E. Generality of graphic variables across drawing tasks. Scund. J. Psychol., 1968, 9, 161–168.—As a partial replication of the Takala & Rantanen (1964) study, the correlations between 6 graphic variables extracted from 6 drawing tasks differing in complexity were investigated. Four graphic trait factors were obtained I Size, II Pressure, III Discontinuous lines, and IV Angularity. Other graphic variables (nuancity and reinforcement) loaded factors II and III. The data lend support to the hypothesis that the same graphic traits should be interpreted in the same way irrespective of the complexity of the test. However, the complexity of the drawing task may make a di…

V11. Functional hierarchy within an overall network for visual motion processing and ocular-motor control at rest

2015

Introduction Visual motion processing on one hand and ocular motor functions on the other are rarely studied together in vivo in humans. The interrelation of these functional networks is rather unclear, even though their functional dependence seems obvious. In several fMRI studies the essential nodes of both networks could be localized using voluntary optokinetic ('look') nystagmus (OKN) in the horizontal plane incorporating visual motion tracking (Dieterich et al., 2009). Here, functional connectivity (FC) between these nodes representing both networks was studies using resting-state FC. Methods Resting-state fMRI data of 200 healthy adults (age 44.1±17.9; 79 male) were included in the cro…

Identification of small inhomogeneities: Asymptotic factorization

2007

We consider the boundary value problem of calculating the electrostatic potential for a homogeneous conductor containing finitely many small insulating inclusions. We give a new proof of the asymptotic expansion of the electrostatic potential in terms of the background potential, the location of the inhomogeneities and their geometry, as the size of the inhomogeneities tends to zero. Such asymptotic expansions have already been used to design direct (i.e. noniterative) reconstruction algorithms for the determination of the location of the small inclusions from electrostatic measurements on the boundary, e.g. MUSIC-type methods. Our derivation of the asymptotic formulas is based on integral …