標(biāo)題: Titlebook: Domain Decomposition Methods in Science and Engineering XX; Randolph Bank,Michael Holst,Jinchao Xu Conference proceedings 2013 Springer-Ve [打印本頁(yè)] 作者: LANK 時(shí)間: 2025-3-21 19:36
書目名稱Domain Decomposition Methods in Science and Engineering XX影響因子(影響力)
書目名稱Domain Decomposition Methods in Science and Engineering XX影響因子(影響力)學(xué)科排名
書目名稱Domain Decomposition Methods in Science and Engineering XX網(wǎng)絡(luò)公開度
書目名稱Domain Decomposition Methods in Science and Engineering XX網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Domain Decomposition Methods in Science and Engineering XX被引頻次
書目名稱Domain Decomposition Methods in Science and Engineering XX被引頻次學(xué)科排名
書目名稱Domain Decomposition Methods in Science and Engineering XX年度引用
書目名稱Domain Decomposition Methods in Science and Engineering XX年度引用學(xué)科排名
書目名稱Domain Decomposition Methods in Science and Engineering XX讀者反饋
書目名稱Domain Decomposition Methods in Science and Engineering XX讀者反饋學(xué)科排名
作者: Femish 時(shí)間: 2025-3-21 21:52 作者: 債務(wù) 時(shí)間: 2025-3-22 04:13
https://doi.org/10.1007/978-3-031-79582-4verlapping subspaces that serves as a basis for devising a uniformly convergent subspace correction algorithm. We consider the equations of linear elasticity in primal variables. For nearly incompressible materials, i.e., when the Poisson ratio ., this problem becomes ill-posed and the resulting discrete problem is nearly singular.作者: deface 時(shí)間: 2025-3-22 06:05 作者: 安裝 時(shí)間: 2025-3-22 08:46 作者: 仔細(xì)閱讀 時(shí)間: 2025-3-22 13:47
Conference proceedings 2013s are iterative methods for solving the often very large linearor nonlinear systems of algebraic equations that arise when various problems in continuum mechanics are discretized using finite elements. They are designed for massively parallel computers and take the memory hierarchy of such systems i作者: 仔細(xì)閱讀 時(shí)間: 2025-3-22 18:35 作者: Awning 時(shí)間: 2025-3-22 23:54
A Subspace Correction Method for Nearly Singular Linear Elasticity Problemsverlapping subspaces that serves as a basis for devising a uniformly convergent subspace correction algorithm. We consider the equations of linear elasticity in primal variables. For nearly incompressible materials, i.e., when the Poisson ratio ., this problem becomes ill-posed and the resulting discrete problem is nearly singular.作者: Inelasticity 時(shí)間: 2025-3-23 04:39 作者: Isolate 時(shí)間: 2025-3-23 09:30 作者: 館長(zhǎng) 時(shí)間: 2025-3-23 13:43 作者: 匍匐 時(shí)間: 2025-3-23 16:31 作者: llibretto 時(shí)間: 2025-3-23 18:28
Equidistribution and Optimal Approximation Classension. In recent years, mathematicians start to prove the convergence and optimal complexity of the adaptive procedure in multi-dimensions. D?rfler [11] first proved an error reduction in the energy norm for the Poisson equation provided the initial mesh is fine enough.作者: fluffy 時(shí)間: 2025-3-24 01:39
Some Recent Tools and a BDDC Algorithm for 3D Problems in H(curl)ition lemma which allows us to obtain improved estimates for a BDDC algorithm under less restrictive assumptions than have appeared previously in the literature. Numerical results are also presented to confirm the theory and to provide additional insights.作者: Flounder 時(shí)間: 2025-3-24 05:50
Symbolic Techniques for Domain Decomposition Methodsant since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today’s standard applications, it is necessary to rely on iterative Krylov methods that are scalable (i.e., weakly dependent on the number of degrees on freedom and number of subdoma作者: Fermentation 時(shí)間: 2025-3-24 08:56
Scalable Domain Decomposition Algorithms for Contact Problems: Theory, Numerical Experiments, and Reasticity. The algorithms combine the Total FETI/BETI based domain decomposition method adapted to the solution of 2D and 3D multibody contact problems of elasticity, both frictionless and with friction, with our in a sense optimal algorithms for the solution of resulting quadratic programming and QP作者: Paleontology 時(shí)間: 2025-3-24 12:43 作者: 相信 時(shí)間: 2025-3-24 17:17 作者: 猛擊 時(shí)間: 2025-3-24 20:48
A Two-Level Schwarz Preconditioner for Heterogeneous Problemsce for Schwarz– type preconditioners for elliptic problems with highly heterogeneous coefficients when the discontinuities are not just across but also along subdomain interfaces, where classical results break down [3, 6, 9, 15].作者: Offensive 時(shí)間: 2025-3-25 01:17
Heterogeneous Domain Decomposition Methods for Eddy Current Problemsor the numerical approximation of this heterogeneous problem it is very natural to use iterative substructuring methods based on transmission conditions at the interface. We analyze the convergence of the Dirichlet-Neumann iterative method for two different formulations of the eddy current problem: 作者: 松馳 時(shí)間: 2025-3-25 06:01
Robust Parameter-Free Multilevel Methods for Neumann Boundary Control Problemsa on the boundary of a convex polygonal domain. The optimal control unknown is the one for which the harmonic extension approximates best a specified target in the interior of the domain. We propose a multilevel preconditioner for the reduced Hessian resulting from the application of the Schur compl作者: etiquette 時(shí)間: 2025-3-25 10:59 作者: MORT 時(shí)間: 2025-3-25 15:17
A Subspace Correction Method for Nearly Singular Linear Elasticity Problemsuations arising from a nonconforming finite element discretization based on reduced integration.We introduce a specific space decomposition into two overlapping subspaces that serves as a basis for devising a uniformly convergent subspace correction algorithm. We consider the equations of linear ela作者: nugatory 時(shí)間: 2025-3-25 18:05 作者: cipher 時(shí)間: 2025-3-25 22:07
https://doi.org/10.1007/978-3-031-67165-4In this work, we study mesh regularization in Bank-Holst parallel adaptive paradigm when adaptive enrichment in both . (geometry) and . (degree) is used. The paradigm was first introduced by Bank and Holst in [1–3] and later extended to .-adaptivity in [5]. In short, the paradigm can be summarized in the following steps.作者: Somber 時(shí)間: 2025-3-26 03:10 作者: companion 時(shí)間: 2025-3-26 07:36
”: An Overview of AI and Human NatureLet . be a bounded polygonal domain, . and .作者: 不幸的人 時(shí)間: 2025-3-26 12:04
Lecture Notes in Computer ScienceWe present an Algebraic Multigrid (AMG) method for graph Laplacian problems. The coarse graphs are constructed recursively by pair-wise aggregation, or matching as in [3] and we use an Algebraic Multilevel Iterations (AMLI) [1, 6] for the solution phase.作者: boisterous 時(shí)間: 2025-3-26 13:36 作者: Sciatica 時(shí)間: 2025-3-26 17:59
Robust Coarsening in Multiscale PDEsConsider a variationally–posed second–order elliptic boundary value problem . with solution . and domain . where the coefficient tensor . is highly . (possibly in a spatially complicated way).作者: 羅盤 時(shí)間: 2025-3-27 01:00
Mesh Regularization in Bank-Holst Parallel ,-Adaptive MeshingIn this work, we study mesh regularization in Bank-Holst parallel adaptive paradigm when adaptive enrichment in both . (geometry) and . (degree) is used. The paradigm was first introduced by Bank and Holst in [1–3] and later extended to .-adaptivity in [5]. In short, the paradigm can be summarized in the following steps.作者: 增減字母法 時(shí)間: 2025-3-27 03:55 作者: 腫塊 時(shí)間: 2025-3-27 07:22
Multigrid Methods for the Biharmonic Problem with Cahn-Hilliard Boundary ConditionsLet . be a bounded polygonal domain, . and .作者: 執(zhí)拗 時(shí)間: 2025-3-27 12:14 作者: Felicitous 時(shí)間: 2025-3-27 16:31
Shifted Laplacian RAS Solvers for the Helmholtz EquationWe consider the Helmholtz equation: . where . is a bounded polygonal region in k., and the . correspond to subsets of . where the Dirichlet, Neumann and Sommerfeld boundary conditions are imposed.作者: Negligible 時(shí)間: 2025-3-27 18:29
Equidistribution and Optimal Approximation Classension. In recent years, mathematicians start to prove the convergence and optimal complexity of the adaptive procedure in multi-dimensions. D?rfler [11] first proved an error reduction in the energy norm for the Poisson equation provided the initial mesh is fine enough.作者: 沒有準(zhǔn)備 時(shí)間: 2025-3-27 23:31 作者: appall 時(shí)間: 2025-3-28 04:51 作者: 控制 時(shí)間: 2025-3-28 07:46 作者: 紅腫 時(shí)間: 2025-3-28 10:29 作者: 美麗的寫 時(shí)間: 2025-3-28 15:28 作者: frozen-shoulder 時(shí)間: 2025-3-28 20:37 作者: Resistance 時(shí)間: 2025-3-29 00:56 作者: 扔掉掐死你 時(shí)間: 2025-3-29 06:14 作者: gregarious 時(shí)間: 2025-3-29 10:03
Danielle S. Rudes,Jason R. Ingramension. In recent years, mathematicians start to prove the convergence and optimal complexity of the adaptive procedure in multi-dimensions. D?rfler [11] first proved an error reduction in the energy norm for the Poisson equation provided the initial mesh is fine enough.作者: Surgeon 時(shí)間: 2025-3-29 14:34 作者: POLYP 時(shí)間: 2025-3-29 15:57
Introduction: People, Place, Cancerant since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today’s standard applications, it is necessary to rely on iterative Krylov methods that are scalable (i.e., weakly dependent on the number of degrees on freedom and number of subdomains) and have limited memory requirements.作者: Reverie 時(shí)間: 2025-3-29 22:11
Research, Education, and Practice of the grand challenges of applied mathematics. High-dimensional problems arise in many fields of application such as data analysis and statistics, but first of all in the sciences. One of the most notorious and complicated problems of this type is the Schr?dinger equation.作者: FOLD 時(shí)間: 2025-3-30 02:45 作者: arboretum 時(shí)間: 2025-3-30 05:08 作者: 松軟無(wú)力 時(shí)間: 2025-3-30 09:43
Lecture Notes in Computer Scienceitions with Cahn-Hilliard type. We show that the condition number of the preconditioned system is bounded by .(1 + (.. ∕ ..)), where . is the typical diameter of a subdomain, . measures the overlap among the subdomains, and the positive constant . is independent of the mesh sizes and the number of subdomains.作者: 樹木中 時(shí)間: 2025-3-30 15:31
Danielle S. Rudes,Jason R. Ingramension. In recent years, mathematicians start to prove the convergence and optimal complexity of the adaptive procedure in multi-dimensions. D?rfler [11] first proved an error reduction in the energy norm for the Poisson equation provided the initial mesh is fine enough.作者: 染色體 時(shí)間: 2025-3-30 16:47
Danielle S. Rudes,Jason R. Ingramition lemma which allows us to obtain improved estimates for a BDDC algorithm under less restrictive assumptions than have appeared previously in the literature. Numerical results are also presented to confirm the theory and to provide additional insights.作者: 拋物線 時(shí)間: 2025-3-30 22:47 作者: disparage 時(shí)間: 2025-3-31 03:43
Nathalie Saint-Jacques,Trevor Dummerasticity. The algorithms combine the Total FETI/BETI based domain decomposition method adapted to the solution of 2D and 3D multibody contact problems of elasticity, both frictionless and with friction, with our in a sense optimal algorithms for the solution of resulting quadratic programming and QP作者: INCH 時(shí)間: 2025-3-31 08:32
Research, Education, and Practice of the grand challenges of applied mathematics. High-dimensional problems arise in many fields of application such as data analysis and statistics, but first of all in the sciences. One of the most notorious and complicated problems of this type is the Schr?dinger equation.作者: narcissism 時(shí)間: 2025-3-31 11:42 作者: 悶熱 時(shí)間: 2025-3-31 14:07 作者: 挖掘 時(shí)間: 2025-3-31 21:18 作者: evanescent 時(shí)間: 2025-4-1 01:12 作者: Melatonin 時(shí)間: 2025-4-1 04:44
Lecture Notes in Computer Scienceitions with Cahn-Hilliard type. We show that the condition number of the preconditioned system is bounded by .(1 + (.. ∕ ..)), where . is the typical diameter of a subdomain, . measures the overlap among the subdomains, and the positive constant . is independent of the mesh sizes and the number of s作者: 喊叫 時(shí)間: 2025-4-1 09:24 作者: 金盤是高原 時(shí)間: 2025-4-1 10:47
https://doi.org/10.1007/978-3-642-35275-1Domain Decomposition; Finite Elements; Parallel Computation; Preconditioned Conjugate Gradients; partial作者: 直覺好 時(shí)間: 2025-4-1 16:32
978-3-642-42919-4Springer-Verlag Berlin Heidelberg 2013作者: 笨拙的你 時(shí)間: 2025-4-1 21:00 作者: 征兵 時(shí)間: 2025-4-2 00:34
Die Grundlagen der Kunstsoziologie,zeitig eine Geschichte vom Wandel der Anschauungen vom Sch?nen und von der Kunst als der vollendeten Erscheinung des Sch?nen. Einer Einführung in die Kunstsoziologie müssen daher einige Betrachtungen über die Entwicklung der ?sthetik vorangehen.
