ترغب بنشر مسار تعليمي؟ اضغط هنا

Scalable solvers for complex electromagnetics problems

120   0   0.0 ( 0 )
 نشر من قبل Alberto F. Mart\\'in
 تاريخ النشر 2019
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

In this work, we present scalable balancing domain decomposition by constraints methods for linear systems arising from arbitrary order edge finite element discretizations of multi-material and heterogeneous 3D problems. In order to enforce the continuity across subdomains of the method, we use a partition of the interface objects (edges and faces) into sub-objects determined by the variation of the physical coefficients of the problem. For multi-material problems, a constant coefficient condition is enough to define this sub-partition of the objects. For arbitrarily heterogeneous problems, a relaxed version of the method is defined, where we only require that the maximal contrast of the physical coefficient in each object is smaller than a predefined threshold. Besides, the addition of perturbation terms to the preconditioner is empirically shown to be effective in order to deal with the case where the two coefficients of the model problem jump simultaneously across the interface. The new method, in contrast to existing approaches for problems in curl-conforming spaces does not require spectral information whilst providing robustness with regard to coefficient jumps and heterogeneous materials. A detailed set of numerical experiments, which includes the application of the preconditioner to 3D realistic cases, shows excellent weak scalability properties of the implementation of the proposed algorithms.



قيم البحث

اقرأ أيضاً

The objective of this paper is twofold. First, we propose two composable block solver methodologies to solve the discrete systems that arise from finite element discretizations of the double porosity/permeability (DPP) model. The DPP model, which is a four-field mathematical model, describes the flow of a single-phase incompressible fluid in a porous medium with two distinct pore-networks and with a possibility of mass transfer between them. Using the composable solvers feature available in PETSc and the finite element libraries available under the Firedrake Project, we illustrate two different ways by which one can effectively precondition these large systems of equations. Second, we employ the recently developed performance model called the Time-Accuracy-Size (TAS) spectrum to demonstrate that the proposed composable block solvers are scalable in both the parallel and algorithmic sense. Moreover, we utilize this spectrum analysis to compare the performance of three different finite element discretizations (classical mixed formulation with H(div) elements, stabilized continuous Galerkin mixed formulation, and stabilized discontinuous Galerkin mixed formulation) for the DPP model. Our performance spectrum analysis demonstrates that the composable block solvers are fine choices for any of these three finite element discretizations. Sample computer codes are provided to illustrate how one can easily implement the proposed block solver methodologies through PETSc command line options.
We present an arbitrarily high-order, conditionally stable, partitioned spectral deferred correction (SDC) method for solving multiphysics problems using a sequence of pre-existing single-physics solvers. This method extends the work in [1, 2], which used implicit-explicit Runge-Kutta methods (IMEX) to build high-order, partitioned multiphysics solvers. We consider a generic multiphysics problem modeled as a system of coupled ordinary differential equations (ODEs), coupled through coupling terms that can depend on the state of each subsystem; therefore the method applies to both a semi-discretized system of partial differential equations (PDEs) or problems naturally modeled as coupled systems of ODEs. The sufficient conditions to build arbitrarily high-order partitioned SDC schemes are derived. Based on these conditions, various of partitioned SDC schemes are designed. The stability of the first-order partitioned SDC scheme is analyzed in detail on a coupled, linear model problem. We show that the scheme is conditionally stable, and under conditions on the coupling strength, the scheme can be unconditionally stable. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems including a simple linear system of ODEs, advection-diffusion-reaction systems, and fluid-structure interaction problems with both incompressible and compressible flows, where we verify the design order of the SDC schemes and study various stability properties. We also directly compare the accuracy, stability, and cost of the proposed partitioned SDC solver with the partitioned IMEX method in [1, 2] on this suite of test problems. The results suggest that the high-order partitioned SDC solvers are more robust than the partitioned IMEX solvers for the numerical examples considered in this work, while the IMEX methods require fewer implicit solves.
Most efficient linear solvers use composable algorithmic components, with the most common model being the combination of a Krylov accelerator and one or more preconditioners. A similar set of concepts may be used for nonlinear algebraic systems, wher e nonlinear composition of different nonlinear solvers may significantly improve the time to solution. We describe the basic concepts of nonlinear composition and preconditioning and present a number of solvers applicable to nonlinear partial differential equations. We have developed a software framework in order to easily explore the possible combinations of solvers. We show that the performance gains from using composed solvers can be substantial compared with gains from standard Newton-Krylov methods.
88 - Zhongjie Lu 2021
The main difficulty in solving the discrete constrained problem is its poor and even ill condition. In this paper, we transform the discrete constrained problems on de Rham complex to Laplace-like problems. This transformation not only make the const rained problems solvable, but also make it easy to use the existing iterative methods and preconditioning techniques to solving large-scale discrete constrained problems.
Motivation: Agent-based modeling is an indispensable tool for studying complex biological systems. However, existing simulators do not always take full advantage of modern hardware and often have a field-specific software design. Results: We presen t a novel simulation platform called BioDynaMo that alleviates both of these problems. BioDynaMo features a general-purpose and high-performance simulation engine. We demonstrate that BioDynaMo can be used to simulate use cases in: neuroscience, oncology, and epidemiology. For each use case we validate our findings with experimental data or an analytical solution. Our performance results show that BioDynaMo performs up to three orders of magnitude faster than the state-of-the-art baseline. This improvement makes it feasible to simulate each use case with one billion agents on a single server, showcasing the potential BioDynaMo has for computational biology research. Availability: BioDynaMo is an open-source project under the Apache 2.0 license and is available at www.biodynamo.org. Instructions to reproduce the results are available in supplementary information. Contact: [email protected], [email protected], [email protected], [email protected] Supplementary information: Available at https://doi.org/10.5281/zenodo.4501515
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا