65-XX NUMERICAL ANALYSIS
Refine
Year of publication
Document Type
- ZIB-Report (35)
- Master's Thesis (5)
- Doctoral Thesis (2)
- Software (2)
Is part of the Bibliography
- no (44)
Keywords
- finite element method (5)
- optimal control (4)
- reduced basis method (4)
- rigorous optical modeling (3)
- Algebraic multigrid (2)
- Automatic Differentiation (2)
- Lipschitz Continuity (2)
- Monte Carlo (2)
- Nonsmooth (2)
- PDE (2)
Institute
- Numerical Mathematics (23)
- Computational Medicine (7)
- Mathematical Optimization (6)
- Modeling and Simulation of Complex Processes (6)
- Visual and Data-centric Computing (6)
- Computational Nano Optics (5)
- Visual Data Analysis (5)
- Computational Systems Biology (4)
- Energy Network Optimization (3)
- Mathematical Optimization Methods (3)
It is shown how piecewise differentiable functions \(F: R^n → R^m\) that are defined by evaluation programs can be approximated locally by a piecewise linear model based on a pair of sample points x̌ and x̂. We show that the discrepancy between function and model at any point x is of the bilinear order O(||x − x̌|| ||x − x̂||). This is a little surprising since x ∈ R^n may vary over the whole Euclidean space, and we utilize only two function samples F̌ = F(x̌) and F̂ = F(x̂), as well as the intermediates computed during their evaluation. As an application of the piecewise linearization procedure we devise a generalized Newton’s method based on successive piecewise linearization and prove for it sufficient conditions for convergence and convergence rates equaling those of semismooth Newton. We conclude with the derivation of formulas for the numerically stable implementation of the aforedeveloped piecewise linearization methods.
In many applications one is interested to compute transition probabilities of a Markov chain.
This can be achieved by using Monte Carlo methods with local or global sampling points.
In this article, we analyze the error by the difference in the $L^2$ norm between the true transition probabilities and the approximation
achieved through a Monte Carlo method.
We give a formula for the error for Markov chains with locally computed sampling points. Further, in the case of reversible Markov chains, we will deduce a formula for the error when sampling points are computed globally.
We will see that in both cases the error itself can be approximated with Monte Carlo methods.
As a consequence of the result, we will derive surprising properties of reversible Markov chains.
This article extends the framework of Bayesian inverse problems in infinite-dimensional parameter spaces, as advocated by Stuart (Acta Numer. 19:451–559, 2010) and others, to the case of a heavy-tailed prior measure in the family of stable distributions, such as an infinite-dimensional Cauchy distribution, for which polynomial moments are infinite or undefined. It is shown that analogues of the Karhunen–Loève expansion for square-integrable random variables can be used to sample such measures. Furthermore, under weaker regularity assumptions than those used to date, the Bayesian posterior measure is shown to depend Lipschitz continuously in the Hellinger metric upon perturbations of the misfit function and observed data.
Traditionally, Lagrangian fields such as finite-time Lyapunov exponents (FTLE)
are precomputed on a discrete grid and are ray casted afterwards. This, however,
introduces both grid discretization errors and sampling errors during ray marching.
In this work, we apply a progressive, view-dependent Monte Carlo-based approach
for the visualization of such Lagrangian fields in time-dependent flows. Our ap-
proach avoids grid discretization and ray marching errors completely, is consistent,
and has a low memory consumption. The system provides noisy previews that con-
verge over time to an accurate high-quality visualization. Compared to traditional
approaches, the proposed system avoids explicitly predefined fieldline seeding
structures, and uses a Monte Carlo sampling strategy named Woodcock tracking
to distribute samples along the view ray. An acceleration of this sampling strategy
requires local upper bounds for the FTLE values, which we progressively acquire
during the rendering. Our approach is tailored for high-quality visualizations of
complex FTLE fields and is guaranteed to faithfully represent detailed ridge surface
structures as indicators for Lagrangian coherent structures (LCS). We demonstrate
the effectiveness of our approach by using a set of analytic test cases and real-world numerical simulations.
One of the main goals of mathematical modelling in systems biology related to medical applications is to obtain patient-specific parameterisations and model predictions.
In clinical practice, however, the number of available measurements for single patients is usually limited due to time and cost restrictions. This hampers the process of making patient-specific predictions about the outcome of a treatment. On the other hand, data are often available for many patients, in particular if extensive clinical studies have been performed. Using these population data, we propose an iterative algorithm for contructing an informative prior distribution, which then serves as the basis for computing patient-specific posteriors and obtaining individual predictions. We demonsrate the performance of our method by applying it to a low-dimensional parameter estimation problem in a toy model as well as to a high-dimensional ODE model of the human menstrual cycle, which represents a typical example from systems biology modelling.
Optical 3D simulations in many-query and real-time contexts require new solution strategies. We study an adaptive, error controlled reduced basis method for solving parametrized time-harmonic optical scattering problems. Application fields are, among others, design and optimization problems of nano-optical devices as well as inverse problems for parameter reconstructions occuring e. g. in optical metrology. The reduced basis method presented here relies on a finite element modeling of the scattering problem with parametrization of materials, geometries and sources.
Reconstruction of photonic crystal geometries using a reduced basis method for nonlinear outputs
(2016)
Maxwell solvers based on the hp-adaptive finite element method allow for accurate geometrical modeling and high numerical accuracy. These features are indispensable for the optimization of optical properties or reconstruction of parameters through inverse processes. High computational complexity prohibits the evaluation of the solution for many parameters. We present a reduced basis method (RBM) for the time-harmonic electromagnetic scattering problem allowing to compute solutions for a parameter configuration orders of magnitude faster. The RBM allows to evaluate linear and nonlinear outputs of interest like Fourier transform or the enhancement of the electromagnetic field in milliseconds. We apply the RBM to compute light-scattering off two dimensional photonic crystal structures made of silicon and reconstruct geometrical parameters.
Model order reduction for the time-harmonic Maxwell equation applied to complex nanostructures
(2016)
Fields such as optical metrology and computational lithography require fast and efficient methods for solving
the time-harmonic Maxwell’s equation. Highly accurate geometrical modeling and numerical accuracy atcomputational costs are a prerequisite for any simulation study of complex nano-structured photonic devices.
We present a reduced basis method (RBM) for the time-harmonic electromagnetic scattering problem based
on the hp-adaptive finite element solver JCMsuite capable of handling geometric and non-geometric parameter
dependencies allowing for online evaluations in milliseconds. We apply the RBM to compute light-scatteringoptical wavelengths off periodic arrays of fin field-effect transistors (FinFETs) where geometrical properties such
as the width and height of the fin and gate can vary in a large range.
Rigorous optical simulations of 3-dimensional nano-photonic structures are an important tool in the analysis and optimization of scattering properties of nano-photonic devices or parameter reconstruction. To construct geometrically accurate models of complex structured nano-photonic devices the finite element method (FEM) is ideally suited due to its flexibility in the geometrical modeling and superior convergence properties. Reduced order models such as the reduced basis method (RBM) allow to construct self-adaptive, error-controlled, very low dimensional approximations for input-output relationships which can be evaluated orders of magnitude faster than the full model. This is advantageous in applications requiring the solution of Maxwell's equations for multiple parameters or a single parameter but in real time. We present a reduced basis method for 3D Maxwell's equations based on the finite element method which allows variations of geometric as well as material and frequency parameters. We demonstrate accuracy and efficiency of the method for a light scattering problem exhibiting a resonance in the electric field.
In many experimentally realized applications, e.g. photonic crystals, solar cells and light-emitting diodes, nano-photonic systems are coupled to a thick substrate layer, which in certain cases has to be included as a part of the optical system. The finite element method (FEM) yields rigorous, high accuracy solutions of full 3D vectorial Maxwell's equations [1] and allows for great flexibility and accuracy in the geometrical modelling. Time-harmonic FEM solvers have been combined with Fourier methods in domain decomposition algorithms to compute coherent solutions of these coupled system. [2,3] The basic idea of a domain decomposition approach lies in a decomposition of the domain into smaller subdomains, separate calculations of the solutions and coupling of these solutions on adjacent subdomains.
In experiments light sources are often not perfectly monochromatic and hence a comparision to simulation results might only be justified if the simulation results, which include interference patterns in the substrate, are spectrally averaged.
In this contribution we present a scattering matrix domain decomposition algorithm for Maxwell's equations based on FEM. We study its convergence and advantages in the context of optical simulations of silicon thin film multi-junction solar cells. This allows for substrate light-trapping to be included in optical simulations and leads to a more realistic estimation of light path enhancement factors in thin-film devices near the band edge.