{"title":"Numerical analysis of small-strain elasto-plastic deformation using local Radial Basis Function approximation with Picard iteration","authors":"Filip Strniša, Mitja Jančič, Gregor Kosec","doi":"arxiv-2405.04970","DOIUrl":"https://doi.org/arxiv-2405.04970","url":null,"abstract":"This paper deals with a numerical analysis of plastic deformation under\u0000various conditions, utilizing Radial Basis Function (RBF) approximation. The\u0000focus is on the elasto-plastic von Mises problem under plane-strain assumption.\u0000Elastic deformation is modelled using the Navier-Cauchy equation. In regions\u0000where the von Mises stress surpasses the yield stress, corrections are applied\u0000locally through a return mapping algorithm. The non-linear deformation problem\u0000in the plastic domain is solved using the Picard iteration. The solutions for the Navier-Cauchy equation are computed using the Radial\u0000Basis Function-Generated Finite Differences (RBF-FD) meshless method using only\u0000scattered nodes in a strong form. Verification of the method is performed\u0000through the analysis of an internally pressurized thick-walled cylinder\u0000subjected to varying loading conditions. These conditions induce states of\u0000elastic expansion, perfectly-plastic yielding, and plastic yielding with linear\u0000hardening. The results are benchmarked against analytical solutions and\u0000traditional Finite Element Method (FEM) solutions. The paper also showcases the\u0000robustness of this approach by solving case of thick-walled cylinder with\u0000cut-outs. The results affirm that the RBF-FD method produces results comparable\u0000to those obtained through FEM, while offering substantial benefits in managing\u0000complex geometries without the necessity for conventional meshing, along with\u0000other benefits of meshless methods.","PeriodicalId":501061,"journal":{"name":"arXiv - CS - Numerical Analysis","volume":"2016 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140942454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Unique continuation for the wave equation based on a discontinuous Galerkin time discretization","authors":"Erik Burman, Janosch Preuss","doi":"arxiv-2405.04615","DOIUrl":"https://doi.org/arxiv-2405.04615","url":null,"abstract":"We consider a stable unique continuation problem for the wave equation where\u0000the initial data is lacking and the solution is reconstructed using\u0000measurements in some subset of the bulk domain. Typically fairly sophisticated\u0000space-time methods have been used in previous work to obtain stable and\u0000accurate solutions to this reconstruction problem. Here we propose to solve the\u0000problem using a standard discontinuous Galerkin method for the temporal\u0000discretization and continuous finite elements for the space discretization.\u0000Error estimates are established under a geometric control condition. We also\u0000investigate two preconditioning strategies which can be used to solve the\u0000arising globally coupled space-time system by means of simple time-stepping\u0000procedures. Our numerical experiments test the performance of these strategies\u0000and highlight the importance of the geometric control condition for\u0000reconstructing the solution beyond the data domain.","PeriodicalId":501061,"journal":{"name":"arXiv - CS - Numerical Analysis","volume":"31 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140939007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
David A. Kopriva, Andrew R. Winters, Jan Nordström
{"title":"Energy Bounds for Discontinuous Galerkin Spectral Element Approximations of Well-Posed Overset Grid Problems for Hyperbolic Systems","authors":"David A. Kopriva, Andrew R. Winters, Jan Nordström","doi":"arxiv-2405.04668","DOIUrl":"https://doi.org/arxiv-2405.04668","url":null,"abstract":"We show that even though the Discontinuous Galerkin Spectral Element Method\u0000is stable for hyperbolic boundary-value problems, and the overset domain\u0000problem is well-posed in an appropriate norm, the energy of the approximation\u0000is bounded by data only for fixed polynomial order and time. In the absence of\u0000dissipation, coupling of the overlapping domains is destabilizing by allowing\u0000positive eigenvalues in the system to be integrated in time. This coupling can\u0000be stabilized in one space dimension by using the upwind numerical flux. To\u0000help provide additional dissipation, we introduce a novel penalty method that\u0000applies dissipation at arbitrary points within the overlap region and depends\u0000only on the difference between the solutions. We present numerical experiments\u0000in one space dimension to illustrate the implementation of the well-posed\u0000penalty formulation, and show spectral convergence of the approximations when\u0000dissipation is applied.","PeriodicalId":501061,"journal":{"name":"arXiv - CS - Numerical Analysis","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140939096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An adaptive heavy ball method for ill-posed inverse problems","authors":"Qinian Jin, Qin Huang","doi":"arxiv-2404.03218","DOIUrl":"https://doi.org/arxiv-2404.03218","url":null,"abstract":"In this paper we consider ill-posed inverse problems, both linear and\u0000nonlinear, by a heavy ball method in which a strongly convex regularization\u0000function is incorporated to detect the feature of the sought solution. We\u0000develop ideas on how to adaptively choose the step-sizes and the momentum\u0000coefficients to achieve acceleration over the Landweber-type method. We then\u0000analyze the method and establish its regularization property when it is\u0000terminated by the discrepancy principle. Various numerical results are reported\u0000which demonstrate the superior performance of our method over the\u0000Landweber-type method by reducing substantially the required number of\u0000iterations and the computational time.","PeriodicalId":501061,"journal":{"name":"arXiv - CS - Numerical Analysis","volume":"92 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140571666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Minglei Yang, Pengjun Wang, Ming Fan, Dan Lu, Yanzhao Cao, Guannan Zhang
{"title":"Conditional Pseudo-Reversible Normalizing Flow for Surrogate Modeling in Quantifying Uncertainty Propagation","authors":"Minglei Yang, Pengjun Wang, Ming Fan, Dan Lu, Yanzhao Cao, Guannan Zhang","doi":"arxiv-2404.00502","DOIUrl":"https://doi.org/arxiv-2404.00502","url":null,"abstract":"We introduce a conditional pseudo-reversible normalizing flow for\u0000constructing surrogate models of a physical model polluted by additive noise to\u0000efficiently quantify forward and inverse uncertainty propagation. Existing\u0000surrogate modeling approaches usually focus on approximating the deterministic\u0000component of physical model. However, this strategy necessitates knowledge of\u0000noise and resorts to auxiliary sampling methods for quantifying inverse\u0000uncertainty propagation. In this work, we develop the conditional\u0000pseudo-reversible normalizing flow model to directly learn and efficiently\u0000generate samples from the conditional probability density functions. The\u0000training process utilizes dataset consisting of input-output pairs without\u0000requiring prior knowledge about the noise and the function. Our model, once\u0000trained, can generate samples from any conditional probability density\u0000functions whose high probability regions are covered by the training set.\u0000Moreover, the pseudo-reversibility feature allows for the use of\u0000fully-connected neural network architectures, which simplifies the\u0000implementation and enables theoretical analysis. We provide a rigorous\u0000convergence analysis of the conditional pseudo-reversible normalizing flow\u0000model, showing its ability to converge to the target conditional probability\u0000density function using the Kullback-Leibler divergence. To demonstrate the\u0000effectiveness of our method, we apply it to several benchmark tests and a\u0000real-world geologic carbon storage problem.","PeriodicalId":501061,"journal":{"name":"arXiv - CS - Numerical Analysis","volume":"116 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140571802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Divergence conforming DG method for the optimal control of the Oseen equation with variable viscosity","authors":"Harpal Singh, Arbaz Khan","doi":"arxiv-2403.15783","DOIUrl":"https://doi.org/arxiv-2403.15783","url":null,"abstract":"This study introduces the divergence-conforming discontinuous Galerkin finite\u0000element method (DGFEM) for numerically approximating optimal control problems\u0000with distributed constraints, specifically those governed by stationary\u0000generalized Oseen equations. We provide optimal a priori error estimates in\u0000energy norms for such problems using the divergence-conforming DGFEM approach.\u0000Moreover, we thoroughly analyze $L^2$ error estimates for scenarios dominated\u0000by diffusion and convection. Additionally, we establish the new reliable and\u0000efficient a posteriori error estimators for the optimal control of the Oseen\u0000equation with variable viscosity. Theoretical findings are validated through\u0000numerical experiments conducted in both two and three dimensions.","PeriodicalId":501061,"journal":{"name":"arXiv - CS - Numerical Analysis","volume":"47 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140312713","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cross Algorithms for Cost-Effective Time Integration of Nonlinear Tensor Differential Equations on Low-Rank Tucker Tensor and Tensor Train Manifolds","authors":"Behzad Ghahremani, Hessam Babaee","doi":"arxiv-2403.12826","DOIUrl":"https://doi.org/arxiv-2403.12826","url":null,"abstract":"Dynamical low-rank approximation (DLRA) provides a rigorous, cost-effective\u0000mathematical framework for solving high-dimensional tensor differential\u0000equations (TDEs) on low-rank tensor manifolds. Despite their effectiveness,\u0000DLRA-based low-rank approximations lose their computational efficiency when\u0000applied to nonlinear TDEs, particularly those exhibiting non-polynomial\u0000nonlinearity. In this paper, we present a novel algorithm for the time\u0000integration of TDEs on the tensor train and Tucker tensor low-rank manifolds,\u0000which are the building blocks of many tensor network decompositions. This paper\u0000builds on our previous work (Donello et al., Proceedings of the Royal Society\u0000A, Vol. 479, 2023) on solving nonlinear matrix differential equations on\u0000low-rank matrix manifolds using CUR decompositions. The methodology we present\u0000offers multiple advantages: (i) it leverages cross algorithms based on the\u0000discrete empirical interpolation method to strategically sample sparse entries\u0000of the time-discrete TDEs to advance the solution in low-rank form. As a\u0000result, it offers near-optimal computational savings both in terms of memory\u0000and floating-point operations. (ii) The time integration is robust in the\u0000presence of small or zero singular values. (iii) The algorithm is remarkably\u0000easy to implement, as it requires the evaluation of the full-order model TDE at\u0000strategically selected entries and it does not use tangent space projections,\u0000whose efficient implementation is intrusive and time-consuming. (iv) We develop\u0000high-order explicit Runge-Kutta schemes for the time integration of TDEs on\u0000low-rank manifolds. We demonstrate the efficiency of the presented algorithm\u0000for several test cases, including a 100-dimensional TDE with non-polynomial\u0000nonlinearity.","PeriodicalId":501061,"journal":{"name":"arXiv - CS - Numerical Analysis","volume":"57 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140168638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Martin Berggren, Anders Bernland, André Massing, Daniel Noreland, Eddie Wadbro
{"title":"A better compression driver? CutFEM 3D shape optimization taking viscothermal losses into account","authors":"Martin Berggren, Anders Bernland, André Massing, Daniel Noreland, Eddie Wadbro","doi":"arxiv-2403.17963","DOIUrl":"https://doi.org/arxiv-2403.17963","url":null,"abstract":"The compression driver, the standard sound source for midrange acoustic\u0000horns, contains a cylindrical compression chamber connected to the horn throat\u0000through a system of channels known as a phase plug. The main challenge in the\u0000design of the phase plug is to avoid resonance and interference phenomena. The\u0000complexity of these phenomena makes it difficult to carry out this design task\u0000manually, particularly when the phase-plug channels are radially oriented.\u0000Therefore, we employ an algorithmic technique that combines numerical solutions\u0000of the governing equations with a gradient-based optimization algorithm that\u0000can deform the walls of the phase plug. A particular modeling challenge here is\u0000that viscothermal losses cannot be ignored, due to narrow chambers and slits in\u0000the device. Fortunately, a recently developed, accurate, but computationally\u0000inexpensive boundary-layer model is applicable. We use this model, a level-set\u0000geometry description, and the Cut Finite Element technique to avoid mesh\u0000changes when the geometry is modified by the optimization algorithm. Moreover,\u0000the shape calculus needed to compute derivatives for the optimization algorithm\u0000is carried out in the fully discrete case. Applying these techniques, the\u0000algorithm was able to successfully design the shape of a set of\u0000radially-directed phase plugs so that the final frequency response surprisingly\u0000closely matches the ideal response, derived by a lumped circuit model where\u0000wave interference effects are not accounted for. This result may serve to\u0000resuscitate the radial phase plug design, rarely used in today's commercial\u0000compression drivers.","PeriodicalId":501061,"journal":{"name":"arXiv - CS - Numerical Analysis","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140324991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Gradient-free neural topology optimization","authors":"Gawel Kus, Miguel A. Bessa","doi":"arxiv-2403.04937","DOIUrl":"https://doi.org/arxiv-2403.04937","url":null,"abstract":"Gradient-free optimizers allow for tackling problems regardless of the\u0000smoothness or differentiability of their objective function, but they require\u0000many more iterations to converge when compared to gradient-based algorithms.\u0000This has made them unviable for topology optimization due to the high\u0000computational cost per iteration and high dimensionality of these problems. We\u0000propose a pre-trained neural reparameterization strategy that leads to at least\u0000one order of magnitude decrease in iteration count when optimizing the designs\u0000in latent space, as opposed to the conventional approach without latent\u0000reparameterization. We demonstrate this via extensive computational experiments\u0000in- and out-of-distribution with the training data. Although gradient-based\u0000topology optimization is still more efficient for differentiable problems, such\u0000as compliance optimization of structures, we believe this work will open up a\u0000new path for problems where gradient information is not readily available (e.g.\u0000fracture).","PeriodicalId":501061,"journal":{"name":"arXiv - CS - Numerical Analysis","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140098975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Helmholtz preconditioning for the compressible Euler equations using mixed finite elements with Lorenz staggering","authors":"David Lee, Alberto Martin, Kieran Ricardo","doi":"arxiv-2403.04095","DOIUrl":"https://doi.org/arxiv-2403.04095","url":null,"abstract":"Implicit solvers for atmospheric models are often accelerated via the\u0000solution of a preconditioned system. For block preconditioners this typically\u0000involves the factorisation of the (approximate) Jacobian for the coupled system\u0000into a Helmholtz equation for some function of the pressure. Here we present a\u0000preconditioner for the compressible Euler equations with a flux form\u0000representation of the potential temperature on the Lorenz grid using mixed\u0000finite elements. This formulation allows for spatial discretisations that\u0000conserve both energy and potential temperature variance. By introducing the dry\u0000thermodynamic entropy as an auxiliary variable for the solution of the\u0000algebraic system, the resulting preconditioner is shown to have a similar block\u0000structure to an existing preconditioner for the material form transport of\u0000potential temperature on the Charney-Phillips grid, and to be more efficient\u0000and stable than either this or a previous Helmholtz preconditioner for the flux\u0000form transport of density weighted potential temperature on the Lorenz grid for\u0000a one dimensional thermal bubble configuration. The new preconditioner is\u0000further verified against standard two dimensional test cases in a vertical\u0000slice geometry.","PeriodicalId":501061,"journal":{"name":"arXiv - CS - Numerical Analysis","volume":"21 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140070847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}