3,154 research outputs found
Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure
The numerical solution of partial differential equations on high-dimensional
domains gives rise to computationally challenging linear systems. When using
standard discretization techniques, the size of the linear system grows
exponentially with the number of dimensions, making the use of classic
iterative solvers infeasible. During the last few years, low-rank tensor
approaches have been developed that allow to mitigate this curse of
dimensionality by exploiting the underlying structure of the linear operator.
In this work, we focus on tensors represented in the Tucker and tensor train
formats. We propose two preconditioned gradient methods on the corresponding
low-rank tensor manifolds: A Riemannian version of the preconditioned
Richardson method as well as an approximate Newton scheme based on the
Riemannian Hessian. For the latter, considerable attention is given to the
efficient solution of the resulting Newton equation. In numerical experiments,
we compare the efficiency of our Riemannian algorithms with other established
tensor-based approaches such as a truncated preconditioned Richardson method
and the alternating linear scheme. The results show that our approximate
Riemannian Newton scheme is significantly faster in cases when the application
of the linear operator is expensive.Comment: 24 pages, 8 figure
Recommended from our members
Multigrid methods for complex engineering geometries and unstructured meshes
The convergence of standard multigrid methods decays significantly if locally poor quality cells are present, and it is found that the poor convergence is due to the local failure of the smoothing property. The high frequency error localised in regions of low quality cells is not eliminated by standard multigrid smoothers and persists through multigrid cycles. We propose a global–local combined smoother for the geometric multigrid to deal with engineering meshes with a small number of poor quality cells, which includes two steps: a global smoother on the whole domain, followed by a local correction on the subdomains with low quality cells. The high frequency error remaining in the low quality regions can be damped out completely by the local correction.
The idea is extended to the algebraic multigrid (AMG), including both classical AMG and smoothed aggregation AMG. It is suggested that the high frequency error produced by the smoother propagates outward the low quality region on the fine grid to the neighbouring areas on the coarse grid. An algorithm to track low quality regions on the abstract coarse grid of AMG has been developed based on the information transfer between grid levels via the transfer operators. With the local correction applied on low quality regions tracked on the abstract coarse grid, the high frequency error due to low grid quality can be removed. In the smoothed aggregation AMG, the construction of the smoothed prolongation operator depends on the spectral radius of the system. However, regions of low quality cells in a mesh increase the largest eigenvalue of the linear system. We propose a shifted largest eigenvalue strategy to approximate a reasonable spectral radius to construct the smoothed prolongation.
Two and three dimensional numerical experiments, from illustrate to complicated, are demonstrated to validate the proposed smoother. Elliptic type PDEs, including Poisson and elasticity problems, are solved. For each example, the performance of multigrid on a high quality mesh is also presented as a reference case, and it is shown that the poor convergence of multigrid for low quality meshes can be recovered to the reference case by the proposed smoother. A realistic thermomechanical simulation of turbomachinery problem has also been successfully solved
A Multigrid Method for the Efficient Numerical Solution of Optimization Problems Constrained by Partial Differential Equations
We study the minimization of a quadratic functional subject to constraints given by a linear or semilinear elliptic partial differential equation with distributed control. Further, pointwise inequality constraints on the control are accounted for. In the linear-quadratic case, the discretized optimality conditions yield a large, sparse, and indefinite system with saddle point structure. One main contribution of this thesis consists in devising a coupled multigrid solver which avoids full constraint elimination. To this end, we define a smoothing iteration incorporating elements from constraint preconditioning. A local mode analysis shows that for discrete optimality systems, we can expect smoothing rates close to those obtained with respect to the underlying constraint PDE. Our numerical experiments include problems with constraints where standard pointwise smoothing is known to fail for the underlying PDE. In particular, we consider anisotropic diffusion and convection-diffusion problems. The framework of our method allows to include line smoothers or ILU-factorizations, which are suitable for such problems. In all cases, numerical experiments show that convergence rates do not depend on the mesh size of the finest level and discrete optimality systems can be solved with a small multiple of the computational cost which is required to solve the underlying constraint PDE. Employing the full multigrid approach, the computational cost is proportional to the number of unknowns on the finest grid level. We discuss the role of the regularization parameter in the cost functional and show that the convergence rates are robust with respect to both the fine grid mesh size and the regularization parameter under a mild restriction on the next to coarsest mesh size. Incorporating spectral filtering for the reduced Hessian in the control smoothing step allows us to weaken the mesh size restriction. As a result, problems with near-vanishing regularization parameter can be treated efficiently with a negligible amount of additional computational work. For fine discretizations, robust convergence is obtained with rates which are independent of the regularization parameter, the coarsest mesh size, and the number of levels. In order to treat linear-quadratic problems with pointwise inequality constraints on the control, the multigrid approach is modified to solve subproblems generated by a primal-dual active set strategy (PDAS). Numerical experiments demonstrate the high efficiency of this approach due to mesh-independent convergence of both the outer PDAS method and the inner multigrid solver. The PDAS-multigrid method is incorporated in the sequential quadratic programming (SQP) framework. Inexact Newton techniques further enhance the computational efficiency. Globalization is implemented with a line search based on the augmented Lagrangian merit function. Numerical experiments highlight the efficiency of the resulting SQP-multigrid approach. In all cases, locally superlinear convergence of the SQP method is observed. In combination with the mesh-independent convergence rate of the inner solver, a solution method with optimal efficiency is obtained
Regularized Newton Methods for X-ray Phase Contrast and General Imaging Problems
Like many other advanced imaging methods, x-ray phase contrast imaging and
tomography require mathematical inversion of the observed data to obtain
real-space information. While an accurate forward model describing the
generally nonlinear image formation from a given object to the observations is
often available, explicit inversion formulas are typically not known. Moreover,
the measured data might be insufficient for stable image reconstruction, in
which case it has to be complemented by suitable a priori information. In this
work, regularized Newton methods are presented as a general framework for the
solution of such ill-posed nonlinear imaging problems. For a proof of
principle, the approach is applied to x-ray phase contrast imaging in the
near-field propagation regime. Simultaneous recovery of the phase- and
amplitude from a single near-field diffraction pattern without homogeneity
constraints is demonstrated for the first time. The presented methods further
permit all-at-once phase contrast tomography, i.e. simultaneous phase retrieval
and tomographic inversion. We demonstrate the potential of this approach by
three-dimensional imaging of a colloidal crystal at 95 nm isotropic resolution.Comment: (C)2016 Optical Society of America. One print or electronic copy may
be made for personal use only. Systematic reproduction and distribution,
duplication of any material in this paper for a fee or for commercial
purposes, or modifications of the content of this paper are prohibite
Comparing solution methods for dynamic equilibrium economies
This paper compares solution methods for dynamic equilibrium economies. The authors compute and simulate the stochastic neoclassical growth model with leisure choice using Undetermined Coefficients in levels and in logs, Finite Elements, Chebyshev Polynomials, Second and Fifth Order Perturbations and Value Function Iteration for several calibrations. The authors document the performance of the methods in terms of computing time, implementation complexity and accuracy and they present some conclusions about their preferred approaches based on the reported evidence.
- …