109,734 research outputs found
Ordered Statistics Vertex Extraction and Tracing Algorithm (OSVETA)
We propose an algorithm for identifying vertices from three dimensional (3D)
meshes that are most important for a geometric shape creation. Extracting such
a set of vertices from a 3D mesh is important in applications such as digital
watermarking, but also as a component of optimization and triangulation. In the
first step, the Ordered Statistics Vertex Extraction and Tracing Algorithm
(OSVETA) estimates precisely the local curvature, and most important
topological features of mesh geometry. Using the vertex geometric importance
ranking, the algorithm traces and extracts a vector of vertices, ordered by
decreasing index of importance.Comment: Accepted for publishing and Copyright transfered to Advances in
Electrical and Computer Engineering, November 23th 201
Efficient computation of high index Sturm-Liouville eigenvalues for problems in physics
Finding the eigenvalues of a Sturm-Liouville problem can be a computationally
challenging task, especially when a large set of eigenvalues is computed, or
just when particularly large eigenvalues are sought. This is a consequence of
the highly oscillatory behaviour of the solutions corresponding to high
eigenvalues, which forces a naive integrator to take increasingly smaller
steps. We will discuss some techniques that yield uniform approximation over
the whole eigenvalue spectrum and can take large steps even for high
eigenvalues. In particular, we will focus on methods based on coefficient
approximation which replace the coefficient functions of the Sturm-Liouville
problem by simpler approximations and then solve the approximating problem. The
use of (modified) Magnus or Neumann integrators allows to extend the
coefficient approximation idea to higher order methods
Adaptive meshless centres and RBF stencils for Poisson equation
We consider adaptive meshless discretisation of the Dirichlet problem for Poisson equation based on numerical differentiation stencils obtained with the help of radial basis functions. New meshless stencil selection and adaptive refinement algorithms are proposed in 2D. Numerical experiments show that the accuracy of the solution is comparable with, and often better than that achieved by the mesh-based adaptive finite element method
An improved method for solving quasilinear convection diffusion problems on a coarse mesh
A method is developed for solving quasilinear convection diffusion problems
starting on a coarse mesh where the data and solution-dependent coefficients
are unresolved, the problem is unstable and approximation properties do not
hold. The Newton-like iterations of the solver are based on the framework of
regularized pseudo-transient continuation where the proposed time integrator is
a variation on the Newmark strategy, designed to introduce controllable
numerical dissipation and to reduce the fluctuation between the iterates in the
coarse mesh regime where the data is rough and the linearized problems are
badly conditioned and possibly indefinite. An algorithm and updated marking
strategy is presented to produce a stable sequence of iterates as boundary and
internal layers in the data are captured by adaptive mesh partitioning. The
method is suitable for use in an adaptive framework making use of local error
indicators to determine mesh refinement and targeted regularization. Derivation
and q-linear local convergence of the method is established, and numerical
examples demonstrate the theory including the predicted rate of convergence of
the iterations.Comment: 21 pages, 8 figures, 1 tabl
- ā¦