15,074 research outputs found
Representing complex data using localized principal components with application to astronomical data
Often the relation between the variables constituting a multivariate data
space might be characterized by one or more of the terms: ``nonlinear'',
``branched'', ``disconnected'', ``bended'', ``curved'', ``heterogeneous'', or,
more general, ``complex''. In these cases, simple principal component analysis
(PCA) as a tool for dimension reduction can fail badly. Of the many alternative
approaches proposed so far, local approximations of PCA are among the most
promising. This paper will give a short review of localized versions of PCA,
focusing on local principal curves and local partitioning algorithms.
Furthermore we discuss projections other than the local principal components.
When performing local dimension reduction for regression or classification
problems it is important to focus not only on the manifold structure of the
covariates, but also on the response variable(s). Local principal components
only achieve the former, whereas localized regression approaches concentrate on
the latter. Local projection directions derived from the partial least squares
(PLS) algorithm offer an interesting trade-off between these two objectives. We
apply these methods to several real data sets. In particular, we consider
simulated astrophysical data from the future Galactic survey mission Gaia.Comment: 25 pages. In "Principal Manifolds for Data Visualization and
Dimension Reduction", A. Gorban, B. Kegl, D. Wunsch, and A. Zinovyev (eds),
Lecture Notes in Computational Science and Engineering, Springer, 2007, pp.
180--204,
http://www.springer.com/dal/home/generic/search/results?SGWID=1-40109-22-173750210-
Darboux cyclides and webs from circles
Motivated by potential applications in architecture, we study Darboux
cyclides. These algebraic surfaces of order a most 4 are a superset of Dupin
cyclides and quadrics, and they carry up to six real families of circles.
Revisiting the classical approach to these surfaces based on the spherical
model of 3D Moebius geometry, we provide computational tools for the
identification of circle families on a given cyclide and for the direct design
of those. In particular, we show that certain triples of circle families may be
arranged as so-called hexagonal webs, and we provide a complete classification
of all possible hexagonal webs of circles on Darboux cyclides.Comment: 34 pages, 20 figure
An embedding technique for the solution of reaction-fiffusion equations on algebraic surfaces with isolated singularities
In this paper we construct a parametrization-free embedding technique for numerically evolving reaction-diffusion PDEs defined on algebraic curves that possess an isolated singularity. In our approach, we first desingularize the curve by appealing to techniques from algebraic geometry.\ud
We create a family of smooth curves in higher dimensional space that correspond to the original curve by projection. Following this, we pose the analogous reaction-diffusion PDE on each member of this family and show that the solutions (their projection onto the original domain) approximate the solution of the original problem. Finally, we compute these approximants numerically by applying the Closest Point Method which is an embedding technique for solving PDEs on smooth surfaces of arbitrary dimension or codimension, and is thus suitable for our situation. In addition, we discuss the potential to generalize the techniques presented for higher-dimensional surfaces with multiple singularities
Manifold interpolation and model reduction
One approach to parametric and adaptive model reduction is via the
interpolation of orthogonal bases, subspaces or positive definite system
matrices. In all these cases, the sampled inputs stem from matrix sets that
feature a geometric structure and thus form so-called matrix manifolds. This
work will be featured as a chapter in the upcoming Handbook on Model Order
Reduction (P. Benner, S. Grivet-Talocia, A. Quarteroni, G. Rozza, W.H.A.
Schilders, L.M. Silveira, eds, to appear on DE GRUYTER) and reviews the
numerical treatment of the most important matrix manifolds that arise in the
context of model reduction. Moreover, the principal approaches to data
interpolation and Taylor-like extrapolation on matrix manifolds are outlined
and complemented by algorithms in pseudo-code.Comment: 37 pages, 4 figures, featured chapter of upcoming "Handbook on Model
Order Reduction
JIGSAW-GEO (1.0): locally orthogonal staggered unstructured grid generation for general circulation modelling on the sphere
An algorithm for the generation of non-uniform, locally-orthogonal staggered
unstructured spheroidal grids is described. This technique is designed to
generate very high-quality staggered Voronoi/Delaunay meshes appropriate for
general circulation modelling on the sphere, including applications to
atmospheric simulation, ocean-modelling and numerical weather prediction. Using
a recently developed Frontal-Delaunay refinement technique, a method for the
construction of high-quality unstructured spheroidal Delaunay triangulations is
introduced. A locally-orthogonal polygonal grid, derived from the associated
Voronoi diagram, is computed as the staggered dual. It is shown that use of the
Frontal-Delaunay refinement technique allows for the generation of very
high-quality unstructured triangulations, satisfying a-priori bounds on element
size and shape. Grid-quality is further improved through the application of
hill-climbing type optimisation techniques. Overall, the algorithm is shown to
produce grids with very high element quality and smooth grading
characteristics, while imposing relatively low computational expense. A
selection of uniform and non-uniform spheroidal grids appropriate for
high-resolution, multi-scale general circulation modelling are presented. These
grids are shown to satisfy the geometric constraints associated with
contemporary unstructured C-grid type finite-volume models, including the Model
for Prediction Across Scales (MPAS-O). The use of user-defined mesh-spacing
functions to generate smoothly graded, non-uniform grids for multi-resolution
type studies is discussed in detail.Comment: Final revisions, as per: Engwirda, D.: JIGSAW-GEO (1.0): locally
orthogonal staggered unstructured grid generation for general circulation
modelling on the sphere, Geosci. Model Dev., 10, 2117-2140,
https://doi.org/10.5194/gmd-10-2117-2017, 201
Fast B-spline Curve Fitting by L-BFGS
We propose a novel method for fitting planar B-spline curves to unorganized
data points. In traditional methods, optimization of control points and foot
points are performed in two very time-consuming steps in each iteration: 1)
control points are updated by setting up and solving a linear system of
equations; and 2) foot points are computed by projecting each data point onto a
B-spline curve. Our method uses the L-BFGS optimization method to optimize
control points and foot points simultaneously and therefore it does not need to
perform either matrix computation or foot point projection in every iteration.
As a result, our method is much faster than existing methods
- …