Résumé IA · arXiv: 2206.01541v1 · math.NA
A robust solution strategy for the Cahn-Larché equations
Posez des questions sur cet article à notre assistant IA
Comment discuter avec cet article ? Guide illustré
Vous pouvez aussi discutez avec plusieurs papiers à la fois ici.
Gardez cette conversation — un compte gratuit conserve vos questions et réponses, vos collections d’articles et vos alertes.
Créer un compte gratuitOutils pour cet article
Outils avancés Premium
Pour suivre un domaine de près : alertes de citations, diapositives de journal club, comparaison des versions et envoi vers Zotero. Découvrir Premium
Les articles autour de celui-ci
Les voir sur une carteClassés selon la proximité de leur titre et de leur résumé avec ceux de cet article. Sélectionnez-en pour les lire ensemble.
Les articles les plus proches
-
A robust monolithic solver for phase-field fracture integrated with fracture energy based arc-length method and under-relaxationRitukesh Bharali, Somdatta Goswami, Cosmin Anitescu et al. · 2021 · Analyse numérique · Résumé IA disponible
Résumé scientifique
The phase-field fracture free-energy functional is non-convex with respect to the displacement and the phase field. This results in a poor performance of the conventional monolithic solvers like the Newton-Raphson method. In order to circumvent this issue, researchers opt for the alternate minimization (staggered) solvers. Staggered solvers are robust for the phase-field based fracture simulations as the displacement and the phase-field sub-problems are convex in nature. Nevertheless, the staggered solver requires very large number of iterations (of the order of thousands) to converge. In this work, a robust monolithic solver is presented for the phase-field fracture problem. The solver adop…
-
Modeling martensitic transformation in shape memory alloys using multi-phase-field elasticity models based on partial rank-one energy relaxation on pairwise interfacesMohammad Sarhil, Oleg Shchyglo, Dominik Brands et al. · 2023 · Analyse numérique · Pas encore résumé
Résumé scientifique
To model the mechanically-driven phase transformations, e.g. martensitic transformation, using the phase-field theory, suitable models are needed for describing the mechanical fields of the individual non-vanishing phase-fields in the interface regions in order to obtain the mechanical driving forces of phase-field motion. Quantitative modeling requires satisfying the interfacial static equilibrium and kinematic compatibility conditions which have already been achieved in the literature for dual-phase-field materials by using the rank-one relaxation (or convexification) of the energy density. A direct generalization to the multi-phase-field case is not applicable without breaking these condi…
-
Smooth multi-patch scaled boundary isogeometric analysis for Kirchhoff-Love shellsMathias Reichle, Jeremias Arf, Bernd Simeon et al. · 2023 · Analyse numérique · Résumé IA disponible
Résumé scientifique
In this work, a linear Kirchhoff-Love shell formulation in the framework of scaled boundary isogeometric analysis is presented that aims to provide a simple approach to trimming for NURBS-based shell analysis. To obtain a global C1-regular test function space for the shell discretization, an inter-patch coupling is applied with adjusted basis functions in the vicinity of the scaling center to ensure the approximation ability. Doing so, the scaled boundary geometries are related to the concept of analysis-suitable G1 parametrizations. This yields a coupling of patch boundaries in a strong sense that is restricted to G1-smooth surfaces. The proposed approach is advantageous to trimmed geometri…
-
A Computationally Efficient Vectorized Implementation of Localizing Gradient Damage Method in MATLABSubrato Sarkar · 2023 · Analyse numérique · Résumé IA disponible
Résumé scientifique
In this work, a recently developed fracture modeling method called localizing gradient damage method (LGDM) is implemented in MATLAB. MATLAB is well-known in the computational research community for its simple and easy-to-learn coding interface. As a result, MATLAB is generally preferred for the initial development (prototyping) of computational models by researchers. However, MATLAB-developed codes are seldom used for large-scale simulations (after initial development is complete) due to their computational inefficiency. Hence, a computationally efficient implementation of LGDM using MATLAB vectorization is presented in this work. The choice of LGDM (as the fracture modeling method) is base…
-
An embedded corrector problem for homogenization. Part II: Algorithms and discretizationEric Cancès, Virginie Ehrlacher, Frederic Legoll et al. · 2018 · Analyse numérique · Pas encore résumé
Résumé scientifique
This contribution is the numerically oriented companion article of the work [E. Canc\`es, V. Ehrlacher, F. Legoll, B. Stamm and S. Xiang, arxiv preprint 1807.05131]. We focus here on the numerical resolution of the embedded corrector problem introduced in [E. Canc\`es, V. Ehrlacher, F. Legoll and B. Stamm, CRAS 2015; E. Canc\`es, V. Ehrlacher, F. Legoll, B. Stamm and S. Xiang, arxiv preprint 1807.05131] in the context of homogenization of diffusion equations. Our approach consists in considering a corrector-type problem, posed on the whole space, but with a diffusion matrix which is constant outside some bounded domain. In [E. Canc\`es, V. Ehrlacher, F. Legoll, B. Stamm and S. Xiang, arxiv p…
-
Thirty years of the finite volume method for solid mechanicsPhilip Cardiff, Ismet Demirdžić · 2018 · Analyse numérique · Résumé IA disponible
Résumé scientifique
Since early publications in the late 1980s and early 1990s, the finite volume method has been shown suitable for solid mechanics analyses. At present, there are several flavours of the method, which can be classified in a variety of ways, such as grid arrangement (cell-centred vs staggered vs vertex-centred), solution algorithm (implicit vs explicit), and stabilisation strategy (Rhie-Chow vs Jameson-Schmidt-Turkel vs Godunov upwinding). This article gives an overview, historical perspective, comparison and critical analysis of the different approaches where a close comparison with the de facto standard for computational solid mechanics, the finite element method, is given. The article finish…
-
Convergence of an adaptive $C^0$-interior penalty Galerkin method for the biharmonic problemAlexander Dominicus, Fernando Gaspoz, Christian Kreuzer · 2019 · Analyse numérique · Résumé IA disponible
Résumé scientifique
We develop a basic convergence analysis for an adaptive $\textsf{C}^0\textsf{IPG}$ method for the Biharmonic problem, which provides convergence without rates for all practically relevant marking strategies and all penalty parameters assuring coercivity of the method. The analysis hinges on embedding properties of (broken) Sobolev and BV spaces, and the construction of a suitable limit space. In contrast to the convergence result of adaptive discontinuous Galerkin methods for elliptic PDEs, by Kreuzer and Georgoulis [Math. Comp. 87 (2018), no.~314, 2611--2640], here we have to deal with the fact that the Lagrange finite element spaces may possibly contain no proper $C^1$-conforming subspace.…
-
Provably stable numerical method for the anisotropic diffusion equation in toroidally confined magnetic fieldsDean Muir, Kenneth Duru, Matthew Hole et al. · 2023 · Analyse numérique · Résumé IA disponible
Résumé scientifique
We present a novel numerical method for solving the anisotropic diffusion equation in toroidally confined magnetic fields which is efficient, accurate and provably stable. The continuous problem is written in terms of a derivative operator for the perpendicular transport and a linear operator, obtained through field line tracing, for the parallel transport. We derive energy estimates of the solution of the continuous initial boundary value problem. A discrete formulation is presented using operator splitting in time with the summation by parts finite difference approximation of spatial derivatives for the perpendicular diffusion operator. Weak penalty procedures are derived for implementing …
Aller plus loin
Comment ces articles sont-ils trouvés ?
Nous comparons le titre et le résumé de cet article avec ceux de tous les articles résumés sur ce site, et avec les articles que Semantic Scholar recommande, ceux qu’il cite et ceux qui le citent (pour un article très cité, ses citations les plus récentes et, depuis OpenAlex, les plus citées). Parmi les travaux antérieurs et les suites, les articles qui s’utilisent en profondeur, une méthode qu’il utilise et les suites très citées remontent un peu. Les niveaux (très proche, proche, apparenté) viennent de la similarité des textes, pas d’un jugement de qualité ; * signale un article sans résumé, comparé par son titre. La phrase sous un article est écrite par une IA à partir des deux résumés : vérifiez-la dans les articles. Un article jugé hors sujet par trois lecteurs quitte la liste.
Pour l’instant seulement parmi les articles résumés sur ce site : relancez la recherche pour ajouter les travaux antérieurs, les suites et les recommandations de Semantic Scholar.
Le résumé précédent a été créé il y a plus d'un an et peut être réexécuté (si nécessaire) en cliquant sur le bouton Exécuter ci-dessous.
Avertissement : Notre outil de synthèse basé sur l'IA et l'assistant virtuel fournis sur ce site Web peuvent ne pas toujours fournir des résumés complets ou des réponses exactes. Nous vous encourageons à examiner attentivement et à évaluer le contenu généré pour vous assurer de sa qualité et de sa pertinence par rapport à vos besoins.