27,551 research outputs found
The geometric mean of two matrices from a computational viewpoint
The geometric mean of two matrices is considered and analyzed from a
computational viewpoint. Some useful theoretical properties are derived and an
analysis of the conditioning is performed. Several numerical algorithms based
on different properties and representation of the geometric mean are discussed
and analyzed and it is shown that most of them can be classified in terms of
the rational approximations of the inverse square root functions. A review of
the relevant applications is given
An algebraic multigrid method for mixed discretizations of the Navier-Stokes equations
Algebraic multigrid (AMG) preconditioners are considered for discretized
systems of partial differential equations (PDEs) where unknowns associated with
different physical quantities are not necessarily co-located at mesh points.
Specifically, we investigate a mixed finite element discretization of
the incompressible Navier-Stokes equations where the number of velocity nodes
is much greater than the number of pressure nodes. Consequently, some velocity
degrees-of-freedom (dofs) are defined at spatial locations where there are no
corresponding pressure dofs. Thus, AMG approaches leveraging this co-located
structure are not applicable. This paper instead proposes an automatic AMG
coarsening that mimics certain pressure/velocity dof relationships of the
discretization. The main idea is to first automatically define coarse
pressures in a somewhat standard AMG fashion and then to carefully (but
automatically) choose coarse velocity unknowns so that the spatial location
relationship between pressure and velocity dofs resembles that on the finest
grid. To define coefficients within the inter-grid transfers, an energy
minimization AMG (EMIN-AMG) is utilized. EMIN-AMG is not tied to specific
coarsening schemes and grid transfer sparsity patterns, and so it is applicable
to the proposed coarsening. Numerical results highlighting solver performance
are given on Stokes and incompressible Navier-Stokes problems.Comment: Submitted to a journa
Bivariate Hermite subdivision
A subdivision scheme for constructing smooth surfaces interpolating scattered data in is proposed. It is also possible to impose derivative constraints in these points. In the case of functional data, i.e., data are given in a properly triangulated set of points from which none of the pairs and with coincide, it is proved that the resulting surface (function) is . The method is based on the construction of a sequence of continuous splines of degree 3. Another subdivision method, based on constructing a sequence of splines of degree 5 which are once differentiable, yields a function which is if the data are not 'too irregular'. Finally the approximation properties of the methods are investigated
Handling convexity-like constraints in variational problems
We provide a general framework to construct finite dimensional approximations
of the space of convex functions, which also applies to the space of c-convex
functions and to the space of support functions of convex bodies. We give
estimates of the distance between the approximation space and the admissible
set. This framework applies to the approximation of convex functions by
piecewise linear functions on a mesh of the domain and by other
finite-dimensional spaces such as tensor-product splines. We show how these
discretizations are well suited for the numerical solution of problems of
calculus of variations under convexity constraints. Our implementation relies
on proximal algorithms, and can be easily parallelized, thus making it
applicable to large scale problems in dimension two and three. We illustrate
the versatility and the efficiency of our approach on the numerical solution of
three problems in calculus of variation : 3D denoising, the principal agent
problem, and optimization within the class of convex bodies.Comment: 23 page
- …