Publications Server of the Weierstrass Institute for Applied Analysis and Stochastics
Not a member yet
    7600 research outputs found

    Variational Methods for Evolution

    No full text
    Variational principles for evolutionary systems take advantage of the rich toolbox provided by the theory of the calculus of variations. Such principles are available for Hamiltonian systems in classical mechanics, gradient flows for dissipative systems, but also time-incremental minimization techniques for more general evolutionary problems. The new challenges arise via the interplay of two or more functionals (e.g. a free energy and a dissipation potential), new structures (systems with nonlocal transport, gradient flows on graphs, kinetic equations, systems of equations) thus encompassing a large variety of applications in the modeling of materials and fluids, in biology, in multi-agent systems, and in data science. This workshop brought together a broad spectrum of researchers from calculus of variations, partial differential equations, metric geometry, and stochastics, as well as applied and computational scientists to discuss and exchange ideas. It focused on variational tools such as minimizing movement schemes, optimal transport, gradient flows, and large-deviation principles for time-continuous Markov processes, Γ-convergence and homogenization

    Investigating apparent differences between standard DKI and axisymmetric DKI and its consequences for biophysical parameter estimates.

    Get PDF
    Purpose The purpose of the study is to identify differences between axisymmetric diffusion kurtosis imaging (DKI) and standard DKI, their consequences for biophysical parameter estimates, and the protocol choice influence on parameter estimation. Methods Noise-free and noisy, synthetic diffusion MRI human brain data is simulated using standard DKI for a standard and the fast "199" acquisition protocol. First the noise-free "baseline" difference between both DKI models is estimated and the influence of fiber complexity is investigated. Noisy data is used to establish the signal-to-noise ratio at which the baseline difference exceeds noise variability. The influence of protocol choices and denoising is investigated. The five axisymmetric DKI tensor metrics (AxTM), the parallel and perpendicular diffusivity and kurtosis and mean of the kurtosis tensor are used to compare both DKI models. Additionally, the baseline difference is also estimated for the five parameters of the WMTI-Watson model. Results The parallel and perpendicular kurtosis and all of the WMTI-Watson parameters had large baseline differences. Using a Westin or FA mask reduced the number of voxels with large baseline difference, that is, by selecting voxels with less complex fibers. For the noisy data, precision was worsened by the fast "199" protocol but adaptive denoising can help counteract these effects. Conclusion For the diffusivities and mean of the kurtosis tensor, axisymmetric DKI with a standard protocol delivers similar results as standard DKI. Fiber complexity is one main driver of the baseline differences. Using the "199" protocol worsens precision in noisy data but adaptive denoising mitigates these effects

    Gradient-robust hybrid DG discretizations for the compressible Stokes equations

    Get PDF
    This paper studies two hybrid discontinuous Galerkin (HDG) discretizations for the velocity-density formulation of the compressible Stokes equations with respect to several desired structural properties, namely provable convergence, the preservation of non-negativity and mass constraints for the density, and gradient-robustness. The later property dramatically enhances the accuracy in well-balanced situations, such as the hydrostatic balance where the pressure gradient balances the gravity force. One of the studied schemes employs an H(div)-conforming velocity ansatz space which ensures all mentioned properties, while a fully discontinuous method is shown to satisfy all properties but the gradient-robustness. Also higher-order schemes for both variants are presented and compared in three numerical benchmark problems. The final example shows the importance also for non-hydrostatic well-balanced states for the compressible Navier-Stokes equations

    Macroscopic Loops in the 3d3d Double-Dimer Model

    No full text
    The double dimer model is defined as the superposition of two independent uniformly distributed dimer covers of a graph. Its configurations can be viewed as disjoint collections of self-avoiding loops. Our first result is that in ℤ d, d>2, the loops in the double dimer model are macroscopic. These are shown to behave qualitatively differently than in two dimensions. In particular, we show that, given two distant points of a large box, with uniformly positive probability there exists a loop visiting both points. Our second result involves the monomer double-dimer model, namely the double-dimer model in the presence of a density of monomers. These are vertices which are not allowed to be touched by any loop. This model depends on a parameter, the monomer activity, which controls the density of monomers. It is known from [Betz, Taggi] that a finite critical threshold of the monomer activity exists, below which a self-avoiding walk forced through the system is macroscopic. Our paper shows that, when d >2, such a critical threshold is strictly positive. In other words, the self-avoiding walk is macroscopic even in the presence of a positive density of monomers

    Temporal Cavity Soliton Interaction in Passively Mode-Locked Semiconductor Lasers

    No full text
    Weak interaction due to gain saturation and recovery of temporal cavity solitons in a delay differential model of a long cavity semiconductor laser is studied numerically and analytically using an asymptotic approach. It is shown that apart from usual soliton repulsion leading to a harmonic mode-locking regime a soliton attraction is also possible in a laser with nonzero linewidth enhancement factor. It is shown numerically that the attraction can lead either to a soliton merging or to a pulse bound state formation

    Adaptive Nonintrusive Reconstruction of Solutions to High-Dimensional Parametric PDEs

    No full text
    Numerical methods for random parametric PDEs can greatly benefit from adaptive refinement schemes, in particular when functional approximations are computed as in stochastic Galerkin and stochastic collocations methods. This work is concerned with a nonintrusive generalization of the adaptive Galerkin finite element method with residual-based error estimation. It combines the nonintrusive character of a randomized least squares method with the a posteriori error analysis of stochastic Galerkin methods. The proposed approach uses the variational Monte Carlo method to obtain a quasi-optimal low-rank approximation of the Galerkin projection in a highly efficient hierarchical tensor format. We derive an adaptive refinement algorithm which is steered by a reliable error estimator. Opposite to stochastic Galerkin methods, the approach is easily applicable to a wide range of problems, enabling a fully automated adjustment of all discretization parameters. Benchmark examples with affine and (unbounded) lognormal coefficient fields illustrate the performance of the nonintrusive adaptive algorithm, showing the expected convergence rates of single-level strategies

    Annual Research Report 2023

    Get PDF

    Efficient Approximation of High-Dimensional Exponentials by Tensor Networks

    No full text
    In this work a general approach to compute a compressed representation of the exponential exp(h) of a high-dimensional function h is presented. Such exponential functions play an important role in several problems in Uncertainty Quantification, e.g. the approximation of log-normal random fields or the evaluation of Bayesian posterior measures. Usually, these high-dimensional objects are intractable numerically and can only be accessed pointwise in sampling methods. In contrast, the proposed method constructs a functional representation of the exponential by exploiting its nature as a solution of an ordinary differential equation. The application of a Petrov--Galerkin scheme to this equation provides a tensor train representation of the solution for which we derive an efficient and reliable a posteriori error estimator. Numerical experiments with a log-normal random field and a Bayesian likelihood illustrate the performance of the approach in comparison to other recent low-rank representations for the respective applications. Although the present work considers only a specific differential equation, the presented method can be applied in a more general setting. We show that the composition of a generic holonomic function and a high-dimensional function corresponds to a differential equation that can be used in our method. Moreover, the differential equation can be modified to adapt the norm in the a posteriori error estimates to the problem at hand

    3,936

    full texts

    7,600

    metadata records
    Updated in last 30 days.
    Publications Server of the Weierstrass Institute for Applied Analysis and Stochastics
    Access Repository Dashboard
    Do you manage Open Research Online? Become a CORE Member to access insider analytics, issue reports and manage access to outputs from your repository in the CORE Repository Dashboard! 👇