2,450 research outputs found
A multidomain spectral method for solving elliptic equations
We present a new solver for coupled nonlinear elliptic partial differential
equations (PDEs). The solver is based on pseudo-spectral collocation with
domain decomposition and can handle one- to three-dimensional problems. It has
three distinct features. First, the combined problem of solving the PDE,
satisfying the boundary conditions, and matching between different subdomains
is cast into one set of equations readily accessible to standard linear and
nonlinear solvers. Second, touching as well as overlapping subdomains are
supported; both rectangular blocks with Chebyshev basis functions as well as
spherical shells with an expansion in spherical harmonics are implemented.
Third, the code is very flexible: The domain decomposition as well as the
distribution of collocation points in each domain can be chosen at run time,
and the solver is easily adaptable to new PDEs. The code has been used to solve
the equations of the initial value problem of general relativity and should be
useful in many other problems. We compare the new method to finite difference
codes and find it superior in both runtime and accuracy, at least for the
smooth problems considered here.Comment: 31 pages, 8 figure
IGA-based Multi-Index Stochastic Collocation for random PDEs on arbitrary domains
This paper proposes an extension of the Multi-Index Stochastic Collocation
(MISC) method for forward uncertainty quantification (UQ) problems in
computational domains of shape other than a square or cube, by exploiting
isogeometric analysis (IGA) techniques. Introducing IGA solvers to the MISC
algorithm is very natural since they are tensor-based PDE solvers, which are
precisely what is required by the MISC machinery. Moreover, the
combination-technique formulation of MISC allows the straight-forward reuse of
existing implementations of IGA solvers. We present numerical results to
showcase the effectiveness of the proposed approach.Comment: version 3, version after revisio
Solving the Monge-Amp\`ere Equations for the Inverse Reflector Problem
The inverse reflector problem arises in geometrical nonimaging optics: Given
a light source and a target, the question is how to design a reflecting
free-form surface such that a desired light density distribution is generated
on the target, e.g., a projected image on a screen. This optical problem can
mathematically be understood as a problem of optimal transport and equivalently
be expressed by a secondary boundary value problem of the Monge-Amp\`ere
equation, which consists of a highly nonlinear partial differential equation of
second order and constraints. In our approach the Monge-Amp\`ere equation is
numerically solved using a collocation method based on tensor-product
B-splines, in which nested iteration techniques are applied to ensure the
convergence of the nonlinear solver and to speed up the calculation. In the
numerical method special care has to be taken for the constraint: It enters the
discrete problem formulation via a Picard-type iteration. Numerical results are
presented as well for benchmark problems for the standard Monge-Amp\`ere
equation as for the inverse reflector problem for various images. The designed
reflector surfaces are validated by a forward simulation using ray tracing.Comment: 28 pages, 8 figures, 2 tables; Keywords: Inverse reflector problem,
elliptic Monge-Amp\`ere equation, B-spline collocation method, Picard-type
iteration; Minor revision: reference [59] to a recent preprint has been added
and a few typos have been correcte
- …