3,695 research outputs found
A Meshfree Generalized Finite Difference Method for Surface PDEs
In this paper, we propose a novel meshfree Generalized Finite Difference
Method (GFDM) approach to discretize PDEs defined on manifolds. Derivative
approximations for the same are done directly on the tangent space, in a manner
that mimics the procedure followed in volume-based meshfree GFDMs. As a result,
the proposed method not only does not require a mesh, it also does not require
an explicit reconstruction of the manifold. In contrast to existing methods, it
avoids the complexities of dealing with a manifold metric, while also avoiding
the need to solve a PDE in the embedding space. A major advantage of this
method is that all developments in usual volume-based numerical methods can be
directly ported over to surfaces using this framework. We propose
discretizations of the surface gradient operator, the surface Laplacian and
surface Diffusion operators. Possibilities to deal with anisotropic and
discontinous surface properties (with large jumps) are also introduced, and a
few practical applications are presented
On Meshfree GFDM Solvers for the Incompressible Navier-Stokes Equations
Meshfree solution schemes for the incompressible Navier--Stokes equations are
usually based on algorithms commonly used in finite volume methods, such as
projection methods, SIMPLE and PISO algorithms. However, drawbacks of these
algorithms that are specific to meshfree methods have often been overlooked. In
this paper, we study the drawbacks of conventionally used meshfree Generalized
Finite Difference Method~(GFDM) schemes for Lagrangian incompressible
Navier-Stokes equations, both operator splitting schemes and monolithic
schemes. The major drawback of most of these schemes is inaccurate local
approximations to the mass conservation condition. Further, we propose a new
modification of a commonly used monolithic scheme that overcomes these problems
and shows a better approximation for the velocity divergence condition. We then
perform a numerical comparison which shows the new monolithic scheme to be more
accurate than existing schemes
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space
We present a logspace algorithm that constructs a canonical intersection
model for a given proper circular-arc graph, where `canonical' means that
models of isomorphic graphs are equal. This implies that the recognition and
the isomorphism problems for this class of graphs are solvable in logspace. For
a broader class of concave-round graphs, that still possess (not necessarily
proper) circular-arc models, we show that those can also be constructed
canonically in logspace. As a building block for these results, we show how to
compute canonical models of circular-arc hypergraphs in logspace, which are
also known as matrices with the circular-ones property. Finally, we consider
the search version of the Star System Problem that consists in reconstructing a
graph from its closed neighborhood hypergraph. We solve it in logspace for the
classes of proper circular-arc, concave-round, and co-convex graphs.Comment: 19 pages, 3 figures, major revisio
Global Hotspots of Conflict Risk between Food Security and Biodiversity Conservation
This work contributes to the Belmont Forum/FACCE-JPI DEVIL project (grant number NE/M021327/1), and AM is supported by a BBSRC EastBio Studentship (http://www.eastscotbiodtp.ac.uk/). The Conservation Biology Institute are acknowledged for provision of data as well as BirdLife International, IUCN, NatureServe, and USGS for their contribution of the species range map data used in producing data available from the Biodiversity Mapping website (http://biodiversitymapping.org).Peer reviewedPublisher PD
Formy i funkcje strony biernej w polszczyinie z perspektywy glottodydaktycznej
Zadanie pt. Digitalizacja i udostępnienie w Cyfrowym Repozytorium Uniwersytetu Łódzkiego kolekcji czasopism naukowych wydawanych przez Uniwersytet Łódzki nr 885/P-DUN/2014 zostało dofinansowane ze środków MNiSW w ramach działalności upowszechniającej naukę
- …