GLORIA

GEOMAR Library Ocean Research Information Access

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Online-Ressource
    Online-Ressource
    Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik Leibniz-Institut im Forschungsverbund Berlin e.V.
    Schlagwort(e): Forschungsbericht
    Beschreibung / Inhaltsverzeichnis: Ensemble methods have become ubiquitous for the solution of Bayesian inference problems. State-of-the-art Langevin samplers such as the Ensemble Kalman Sampler (EKS), Affine Invariant Langevin Dynamics (ALDI) or its extension using weighted covariance estimates rely on successive evaluations of the forward model or its gradient. A main drawback of these methods hence is their vast number of required forward calls as well as their possible lack of convergence in the case of more involved posterior measures such as multimodal distributions. The goal of this paper is to address these challenges to some extend. First, several possible adaptive ensemble enrichment strategies that successively enlarge the number of particles in the underlying Langevin dynamics are discusses that in turn lead to a significant reduction of the total number of forward calls. Second, analytical consistency guarantees of the ensemble enrichment method are provided for linear forward models. Third, to address more involved target distributions, the method is extended by applying adapted Langevin dynamics based on a homotopy formalism for which convergence is proved. Finally, numerical investigations of several benchmark problems illustrates the possible gain of the proposed method, comparing it to state-of-the-art Langevin samplers.
    Materialart: Online-Ressource
    Seiten: 1 Online-Ressource (54 Seiten, 1,40 MB) , Illustrationen, Diagramme
    Serie: Preprint / Weierstraß-Institut für Angewandte Analysis und Stochastik no. 2987
    Sprache: Englisch
    Anmerkung: Literaturverzeichnis: Seite 35-38
    Standort Signatur Einschränkungen Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Online-Ressource
    Online-Ressource
    Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik Leibniz-Institut im Forschungsverbund Berlin e.V.
    Schlagwort(e): Forschungsbericht
    Beschreibung / Inhaltsverzeichnis: We propose a new kernel learning approach based on efficient low-rank tensor compression for Gaussian process (GP) regression. The central idea is to compose a low-rank function represented in a hierarchical tensor format with a GP covariance function. Compared to similar deep neural network architectures, this approach facilitates to learn significantly more expressive features at lower computational costs as illustrated in the examples. Additionally, over-fitting is avoided with this compositional model by taking advantage of its inherent regularisation properties. Estimates of the generalisation error are compared to five baseline models on three synthetic and six real-world data sets. The experimental results show that the incorporated tensor network enables a highly accurate GP regression with a comparatively low number of trainable parameters. The observed performance is clearly superior (usually by an order of magnitude in mean squared error) to all examined standard models, in particular to deep neural networks with more than 1000 times as many parameters.
    Materialart: Online-Ressource
    Seiten: 1 Online-Ressource (22 Seiten, 360,70 KB)
    Serie: Preprint / Weierstraß-Institut für Angewandte Analysis und Stochastik no. 2981
    Sprache: Englisch
    Anmerkung: Literaturverzeichnis: Seite 10-14
    Standort Signatur Einschränkungen Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Online-Ressource
    Online-Ressource
    Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik Leibniz-Institut im Forschungsverbund Berlin e.V.
    Schlagwort(e): Forschungsbericht
    Beschreibung / Inhaltsverzeichnis: Imperfections and inaccuracies in real technical products often influence the mechanical behavior and the overall structural reliability. The prediction of real stress states and possibly resulting failure mechanisms is essential and a real challenge, e.g. in the design process. In this contribution, imperfections in elastic materials such as air voids in adhesive bonds between fiberreinforced composites are investigated. They are modeled as arbitrarily shaped and positioned. The focus is on local displacement values as well as on associated stress concentrations caused by the imperfections. For this purpose, the resulting complex random one-scale finite element model is numerically solved by a new developed surrogate model using an overlapping domain decomposition scheme based on Schwarz alternating method. Here, the actual response of local subproblems associated with isolated material imperfections is determined by a single appropriate surrogate model, that allows for an accelerated propagation of randomness. The efficiency of the method is demonstrated for imperfections with elliptical and ellipsoidal shape in 2D and 3D and extended to arbitrarily shaped voids. For the latter one, a local surrogate model based on artificial neural networks (ANN) is constructed. Finally, a comparison to experimental results validates the numerical predictions for a real engineering problem.
    Materialart: Online-Ressource
    Seiten: 1 Online-Ressource (22 Seiten, 9,16 MB) , Illustrationen, Diagramme
    Serie: Preprint / Weierstraß-Institut für Angewandte Analysis und Stochastik no. 2928
    Sprache: Englisch
    Anmerkung: Literaturverzeichnis: Seite 19-20
    Standort Signatur Einschränkungen Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Online-Ressource
    Online-Ressource
    Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik Leibniz-Institut im Forschungsverbund Berlin e.V.
    Schlagwort(e): Forschungsbericht
    Beschreibung / Inhaltsverzeichnis: A unsupervised learning approach for the computation of an explicit functional representation of a random vector Y is presented, which only relies on a finite set of samples with unknown distribution. Motivated by recent advances with computational optimal transport for estimating Wasserstein distances, we develop a newWasserstein multi-element polynomial chaos expansion (WPCE). It relies on the minimization of a regularized empirical Wasserstein metric known as debiased Sinkhorn divergence.
    Materialart: Online-Ressource
    Seiten: 1 Online-Ressource (37 Seiten, 10,17 MB) , Diagramme
    Serie: Preprint / Weierstraß-Institut für Angewandte Analysis und Stochastik no. 2927
    Sprache: Englisch
    Anmerkung: Literaturverzeichnis: Seite 30-35
    Standort Signatur Einschränkungen Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Online-Ressource
    Online-Ressource
    Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik Leibniz-Institut im Forschungsverbund Berlin e.V.
    Schlagwort(e): Forschungsbericht
    Beschreibung / Inhaltsverzeichnis: We combine concepts from multilevel solvers for partial differential equations (PDEs) with neural network based deep learning and propose a new methodology for the efficient numerical solution of high-dimensional parametric PDEs. An in-depth theoretical analysis shows that the proposed architecture is able to approximate multigrid V-cycles to arbitrary precision with the number of weights only depending logarithmically on the resolution of the finest mesh. As a consequence, approximation bounds for the solution of parametric PDEs by neural networks that are independent on the (stochastic) parameter dimension can be derived. The performance of the proposed method is illustrated on high-dimensional parametric linear elliptic PDEs that are common benchmark problems in uncertainty quantification. We find substantial improvements over state-of-the-art deep learning-based solvers. As particularly challenging examples, random conductivity with high-dimensional non-affine Gaussian fields in 100 parameter dimensions and a random cookie problem are examined. Due to the multilevel structure of our method, the amount of training samples can be reduced on finer levels, hence significantly lowering the generation time for training data and the training time of our method.
    Materialart: Online-Ressource
    Seiten: 1 Online-Ressource (41 Seiten, 1,47 MB) , Illustrationen, Diagramme
    Serie: Preprint / Weierstraß-Institut für Angewandte Analysis und Stochastik no. 3035
    Sprache: Englisch
    Anmerkung: Literaturverzeichnis: Seite 19-25
    Standort Signatur Einschränkungen Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Online-Ressource
    Online-Ressource
    Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik Leibniz-Institut im Forschungsverbund Berlin e.V.
    Schlagwort(e): Forschungsbericht
    Beschreibung / Inhaltsverzeichnis: The statistical Bayesian approach is a natural setting to resolve the ill-posedness of inverse problems by assigning probability densities to the considered calibration parameters. Based on a parametric deterministic representation of the forward model, a sampling-free approach to Bayesian inversion with an explicit representation of the parameter densities is developed. The approximation of the involved randomness inevitably leads to several high dimensional expressions, which are often tackled with classical sampling methods such as MCMC. To speed up these methods, the use of a surrogate model is beneficial since it allows for faster evaluation with respect to calibration parameters. However, the inherently slow convergence can not be remedied by this. As an alternative, a complete functional treatment of the inverse problem is feasible as demonstrated in this work, with functional representations of the parametric forward solution as well as the probability densities of the calibration parameters, determined by Bayesian inversion. The proposed sampling-free approach is discussed in the context of hierarchical tensor representations, which are employed for the adaptive evaluation of a random PDE (the forward problem) in generalized chaos polynomials and the subsequent high-dimensional quadrature of the log-likelihood. This modern compression technique alleviates the curse of dimensionality by hierarchical subspace approximations of the involved low rank (solution) manifolds. All required computations can be carried out efficiently in the low-rank format. A priori convergence is examined, considering all approximations that occur in the method. Numerical experiments demonstrate the performance and verify the theoretical results.
    Materialart: Online-Ressource
    Seiten: 1 Online-Ressource (28 Seiten, 813 kB) , Illustrationen, Diagramme
    Serie: Preprint / Weierstraß-Institut für Angewandte Analysis und Stochastik no. 2363
    Sprache: Englisch
    Anmerkung: Literaturverzeichnis: Seite 25-26
    Standort Signatur Einschränkungen Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Online-Ressource
    Online-Ressource
    Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik Leibniz-Institut im Forschungsverbund Berlin e.V.
    Schlagwort(e): Forschungsbericht
    Beschreibung / Inhaltsverzeichnis: Solving high-dimensional random parametric PDEs poses a challenging computational problem. It is well-known that numerical methods can greatly benefit from adaptive refinement algorithms, in particular when functional approximations in polynomials are computed as in stochastic Galerkin and stochastic collocations methods. This work investigates a residual based adaptive algorithm used to approximate the solution of the stationary diffusion equation with lognormal coefficients. It is known that the refinement procedure is reliable, but the theoretical convergence of the scheme for this class of unbounded coefficients remains a challenging open question. This paper advances the theoretical results by providing a quasi-error reduction results for the adaptive solution of the lognormal stationary diffusion problem. A computational example supports the theoretical statement.
    Materialart: Online-Ressource
    Seiten: 1 Online-Ressource (26 Seiten, 407,69 KB) , Illustrationen, Diagramme
    Serie: Preprint / Weierstraß-Institut für Angewandte Analysis und Stochastik no. 3036
    Sprache: Englisch
    Anmerkung: Literaturverzeichnis: Seite 21-24
    Standort Signatur Einschränkungen Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Online-Ressource
    Online-Ressource
    Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik Leibniz-Institut im Forschungsverbund Berlin e.V.
    Schlagwort(e): Forschungsbericht
    Beschreibung / Inhaltsverzeichnis: In this paper we investigate and compare different gradient algorithms designed for the domain expression of the shape derivative. Our main focus is to examine the usefulness of kernel reproducing Hilbert spaces for PDE constrained shape optimisation problems. We show that radial kernels provide convenient formulas for the shape gradient that can be efficiently used in numerical simulations. The shape gradients associated with radial kernels depend on a so called smoothing parameter that allows a smoothness adjustment of the shape during the optimisation process. Besides, this smoothing parameter can be used to modify the movement of the shape. The theoretical findings are verified in a number of numerical experiments.
    Materialart: Online-Ressource
    Seiten: 1 Online-Ressource (33 Seiten, 6.275 kB) , Diagramme
    Serie: Preprint / Weierstraß-Institut für Angewandte Analysis und Stochastik No. 2244
    Sprache: Englisch
    Anmerkung: Literaturverzeichnis: Seite 29-31
    Standort Signatur Einschränkungen Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Online-Ressource
    Online-Ressource
    Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik Leibniz-Institut im Forschungsverbund Berlin e.V.
    Schlagwort(e): Forschungsbericht
    Beschreibung / Inhaltsverzeichnis: A hierarchical a posteriori error estimator for the first-order finite element method (FEM) on a red-refined triangular mesh is presented for the 2D Poisson model problem. Reliability and efficiency with some explicit constant is proved for triangulations with inner angles smaller than or equal to π/2 . The error estimator does not rely on any saturation assumption and is valid even in the pre-asymptotic regime on arbitrarily coarse meshes. The evaluation of the estimator is a simple post-processing of the piecewise linear FEM without any extra solve plus a higher-order approximation term. The results also allows the striking observation that arbitrary local averaging of the primal variable leads to a reliable and efficient error estimation. Several numerical experiments illustrate the performance of the proposed a posteriori error estimator for computational benchmarks.
    Materialart: Online-Ressource
    Seiten: 1 Online-Ressource (27 Seiten, 1.713 kB) , Diagramme
    Serie: Preprint / Weierstraß-Institut für Angewandte Analysis und Stochastik No. 2251
    Sprache: Englisch
    Anmerkung: Literaturverzeichnis: Seite 23-25
    Standort Signatur Einschränkungen Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    Online-Ressource
    Online-Ressource
    Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik Leibniz-Institut im Forschungsverbund Berlin e.V.
    Schlagwort(e): Forschungsbericht
    Materialart: Online-Ressource
    Seiten: 1 Online-Ressource (54 Seiten, 983,53 KB) , Diagramme
    Serie: Preprint / Weierstraß-Institut für Angewandte Analysis und Stochastik no. 3049
    Sprache: Englisch
    Anmerkung: Literaturverzeichnis: Seite 42-46
    Standort Signatur Einschränkungen Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...