標(biāo)題: Titlebook: Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations; Tarek Poonithara Abraham Mathew Book 2008 Sprin [打印本頁] 作者: DUMMY 時(shí)間: 2025-3-21 17:34
書目名稱Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations影響因子(影響力)
書目名稱Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations影響因子(影響力)學(xué)科排名
書目名稱Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations網(wǎng)絡(luò)公開度
書目名稱Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations被引頻次
書目名稱Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations被引頻次學(xué)科排名
書目名稱Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations年度引用
書目名稱Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations年度引用學(xué)科排名
書目名稱Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations讀者反饋
書目名稱Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations讀者反饋學(xué)科排名
作者: 會(huì)議 時(shí)間: 2025-3-21 23:58
https://doi.org/10.1007/978-3-540-77209-5algorithm; algorithms; differential equation; finite elements; linear algebra; numerical analysis; optimiz作者: 尖叫 時(shí)間: 2025-3-22 00:58
978-3-540-77205-7Springer-Verlag Berlin Heidelberg 2008作者: doxazosin 時(shí)間: 2025-3-22 06:20 作者: brassy 時(shí)間: 2025-3-22 10:13
https://doi.org/10.1007/978-3-031-41550-0 continuous and discrete versions of maximum principles and comparison theorems for elliptic equations, as well as methods for estimating the maximum norm error . factor on subdomains. From a matrix viewpoint, these tools are applicable when the discretization of the given elliptic equation results in a strictly diagonally dominant ..作者: 幻想 時(shí)間: 2025-3-22 15:01
https://doi.org/10.1007/978-3-031-40165-7In our discussion, we focus on a . subdomain decomposition of the domain of the elliptic equation, into overlapping or non-overlapping subdomains, and introduce the notion of a . of the elliptic equation. A hybrid formulation is a . system of elliptic equations which is . to the original elliptic eq作者: 幻想 時(shí)間: 2025-3-22 20:30
Understanding Evolution in Darwin‘s "Origin"its parallel extensions, such as the additive, hybrid and restricted Schwarz methods. Schwarz methods are based on an . decomposition of the domain, and we describe its formulation to iteratively solve a discretization of a . and . elliptic equation. In contrast with iterative algorithms formulated 作者: Antagonist 時(shí)間: 2025-3-23 00:37
Lubnaa Hossenbaccus,Sarah Garvey,Anne Ellis arising from the discretization of a . and . elliptic equation, based on a decomposition of its domain into .. In the ., the solution to an elliptic equation can be parameterized in terms of its unknown Dirichlet values on the subdomain boundaries. This parameterization enables reducing the origina作者: violate 時(shí)間: 2025-3-23 01:47 作者: meditation 時(shí)間: 2025-3-23 06:11 作者: 永久 時(shí)間: 2025-3-23 12:32
https://doi.org/10.1007/978-3-031-41542-5cture. Such grids are obtained by the successive refinement of an initial coarse grid, either globally or locally. When the refinement is global, the resulting grid is ., while if the refinement is restricted to subregions, the resulting grid will . be quasi-uniform. We describe preconditioners form作者: Jingoism 時(shí)間: 2025-3-23 17:16
https://doi.org/10.1007/978-3-031-41542-5e of discretizations. Chap. 9.2 describes iterative solvers, while Chap. 9.3 describes noniterative solvers. Chap. 9.4 describes the .method for solving a parabolic equation on a time interval [0.]. It corresponds to a .method on [0.], and is suited for applications to parabolic optimal control prob作者: 佛刊 時(shí)間: 2025-3-23 20:17 作者: 改變 時(shí)間: 2025-3-24 00:42
Update in Autism Spectrum Disorderthe subdomains, without requirement to match with the grids adjacent to it, see Fig. 11.1. In this chapter, we describe several methods for the . of a self adjoint and coercive . on a non-matching grid:.Each non-matching grid discretization is based on a . of the underlying elliptic equation on its 作者: 征服 時(shí)間: 2025-3-24 03:22 作者: appall 時(shí)間: 2025-3-24 07:32 作者: Predigest 時(shí)間: 2025-3-24 13:14 作者: stress-response 時(shí)間: 2025-3-24 16:48 作者: PAD416 時(shí)間: 2025-3-24 21:53 作者: 雜役 時(shí)間: 2025-3-25 01:26
https://doi.org/10.1007/978-3-031-41933-1ds correspond to block generalizations of the Gauss-Seidel and Jacobi relaxation methods for minimization problems. In general terms, domain decomposition and multilevel methodology can be applied to minimization problems in two alternative ways. In the first approach, domain decomposition methods c作者: Painstaking 時(shí)間: 2025-3-25 06:54
Web and Social Media Analytics Strategyhe discretization of the reduced wave equation. In Chap. 18.1, we discuss background on the reduced wave equation. Chap. 18.2 describes variants of non-overlapping and overlapping domain decomposition iterative methods for the reduced wave equation. Chap. 18.3 outlines an iterative method based on f作者: 條街道往前推 時(shí)間: 2025-3-25 08:14 作者: Cumulus 時(shí)間: 2025-3-25 15:10
Lecture Notes in Computational Science and Engineeringhttp://image.papertrans.cn/e/image/282489.jpg作者: scotoma 時(shí)間: 2025-3-25 16:24
Decomposition Frameworks,In our discussion, we focus on a . subdomain decomposition of the domain of the elliptic equation, into overlapping or non-overlapping subdomains, and introduce the notion of a . of the elliptic equation. A hybrid formulation is a . system of elliptic equations which is . to the original elliptic eq作者: 輕率看法 時(shí)間: 2025-3-25 20:52 作者: seduce 時(shí)間: 2025-3-26 03:17 作者: Arteriography 時(shí)間: 2025-3-26 05:45
Lagrange Multiplier Based Substructuring: FETI Method,ed . method for solving a finite element discretization of a self adjoint and coercive elliptic equation, based on a . decomposition of its domain. In traditional substructuring, each subdomain solution is parameterized by its Dirichlet value on the boundary of the subdomain. The global solution is 作者: 山頂可休息 時(shí)間: 2025-3-26 11:30
Computational Issues and Parallelization,ns the choice of a decomposition of a domain into non-overlapping or overlapping subdomains. When an algorithm is implemented using multiple processors, the number of interior unknowns per subdomain must be approximately the same, to ensure load balancing, while the number of boundary unknowns must 作者: 濃縮 時(shí)間: 2025-3-26 13:03 作者: outset 時(shí)間: 2025-3-26 17:32 作者: 壟斷 時(shí)間: 2025-3-26 23:37
Saddle Point Problems,formulation and .. Chap. 10.3 describes the .method for obtaining an approximate solution. Chap. 10.4 describes .. Chap. 10.5 describes .preconditioners and Krylov algorithms. Applications to Navier-Stokes equations, mixed formulations of elliptic equations, and to optimal control problems, are desc作者: 比賽用背帶 時(shí)間: 2025-3-27 01:37
Non-Matching Grid Discretizations,the subdomains, without requirement to match with the grids adjacent to it, see Fig. 11.1. In this chapter, we describe several methods for the . of a self adjoint and coercive . on a non-matching grid:.Each non-matching grid discretization is based on a . of the underlying elliptic equation on its 作者: 吸引力 時(shí)間: 2025-3-27 07:05
Heterogeneous Domain Decomposition Methods,eterogeneous character by equations of heterogeneous type. In applications, equations of heterogeneous type may sometimes be solved numerically at reduced computational cost, and this motivates their use [GL13, GA15, QU5, QU3, AS2, QU4, BO8, LE7, QU6]. Applications include the approximation of the B作者: incision 時(shí)間: 2025-3-27 13:20 作者: Ancestor 時(shí)間: 2025-3-27 14:25
Variational Inequalities and Obstacle Problems,, an elliptic (or parabolic) equation or inequality is posed on a domain, however, the desired solution is constrained to lie above a specified function, referred to as an obstacle [CR2, GL, FR6, KI4]. Applications arise in elasticity theory [GL10, GL], heat conduction (Stefan problems) and mathemat作者: 表示向下 時(shí)間: 2025-3-27 19:55 作者: 澄清 時(shí)間: 2025-3-27 22:20
Eigenvalue Problems,n algorithms which . approximate the . eigenvalue and corresponding eigenvector of a matrix, though most such methods can also be extended to simultaneously approximate several eigenvalues, and their associated eigenvectors, see [KR, KU2, BO10, BO11, BO12, BR10, MA9, LU5] and [LU6, KN2, BO13, KN3, C作者: Accessible 時(shí)間: 2025-3-28 04:11 作者: OPINE 時(shí)間: 2025-3-28 10:07 作者: 盡管 時(shí)間: 2025-3-28 10:41 作者: 分發(fā) 時(shí)間: 2025-3-28 15:57
1439-7358 , non-matching grid discretizations, heterogeneous models, fictitious domain methods, variational inequalities, maximum norm theory, eigenvalue problems, optimization problems and the Helmholtz scattering problem. Selected convergence theory is also included..978-3-540-77205-7978-3-540-77209-5Series ISSN 1439-7358 Series E-ISSN 2197-7100 作者: 盡責(zé) 時(shí)間: 2025-3-28 20:26 作者: 戰(zhàn)役 時(shí)間: 2025-3-29 02:35 作者: giggle 時(shí)間: 2025-3-29 06:28
Melissa Anna Murphy,Pavel Grabalov elliptic equation. Our discussion will be organized as follows. In §12.1, we describe the vanishing viscosity approach of [GA15] for constructing an elliptic-hyperbolic approximation on a non-overlapping decomposition. In §12.2, we describe an elliptic-hyperbolic approximation on overlapping subdom作者: 名字 時(shí)間: 2025-3-29 07:52 作者: 我正派 時(shí)間: 2025-3-29 12:16
Schwarz Iterative Algorithms,bdomains decreases, provided a . residual correction term is employed [DR11, KU6, XU3, MA15, CA19, CA17]..Our focus in this chapter will be on describing the .of Schwarz algorithms for iteratively solving the linear system .u = f obtained by the discretization of an elliptic equation. The matrix ver作者: 腐敗 時(shí)間: 2025-3-29 17:26
Schur Complement and Iterative Substructuring Algorithms,describes FFT based fast .solvers for Schur complement systems on rectangular domains with stripwise constant coefficients. Chap. 3.4 describes several preconditioners for two subdomain Schur complement matrices, while Chap. 3.5 and Chap. 3.6 describe multi-subdomain preconditioners for Schur comple作者: intimate 時(shí)間: 2025-3-29 20:31 作者: 動(dòng)物 時(shí)間: 2025-3-30 03:56 作者: falsehood 時(shí)間: 2025-3-30 04:36 作者: 休戰(zhàn) 時(shí)間: 2025-3-30 08:39 作者: 沒有希望 時(shí)間: 2025-3-30 14:03
Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations作者: keloid 時(shí)間: 2025-3-30 20:17
Multilevel and Local Grid Refinement Methods,ulated using multigrid methodology [BR22, HA4, HA2, BR36]. Multilevel preconditioners can yield optimal order performance, like multigrid methods, however, they are convergent only with Krylov space acceleration.作者: Invigorate 時(shí)間: 2025-3-30 23:10
Variational Inequalities and Obstacle Problems,ical finance (option pricing) [CR2, EL, WI10, WI11]. Even when the underlying elliptic (or parabolic) equation is linear, an obstacle problem is . due to the unknown region of . between the solution and the obstacle. However, once the contact set is known, the problem is linear on its complementary set.作者: olfction 時(shí)間: 2025-3-31 03:35
1439-7358 tial differential equations of elliptic or parabolic type. The methodology includes iterative algorithms, and techniques for non-matching grid discretizations and heterogeneous approximations. This book serves as a matrix oriented introduction to domain decomposition methodology. The topics discusse作者: aesthetic 時(shí)間: 2025-3-31 05:05 作者: 注入 時(shí)間: 2025-3-31 12:45
Lubnaa Hossenbaccus,Sarah Garvey,Anne Ellisrs and Krylov algorithms. Applications to Navier-Stokes equations, mixed formulations of elliptic equations, and to optimal control problems, are described in Chaps. 10.6, 10.7 and 10.8, respectively. For a more detailed discussion of saddle point problems, readers are referred to [CI4, GI3, BE12].作者: 取消 時(shí)間: 2025-3-31 13:29 作者: 同步左右 時(shí)間: 2025-3-31 18:17
Lubnaa Hossenbaccus,Sarah Garvey,Anne Ellisexpected parallel computation time and speed up when implementing a domain decomposition preconditioner on an idealized parallel computer architecture. We outline . estimate for this using idealized models for the computational time and inter-processor data transfer times.作者: 擴(kuò)音器 時(shí)間: 2025-3-31 21:54 作者: 過分自信 時(shí)間: 2025-4-1 05:38 作者: 怎樣才咆哮 時(shí)間: 2025-4-1 09:46 作者: 擁擠前 時(shí)間: 2025-4-1 12:05 作者: evanescent 時(shí)間: 2025-4-1 14:22 作者: PIZZA 時(shí)間: 2025-4-1 21:56
Helmholtz Scattering Problem,method for determining the standing wave solution to a wave equation. In some sections, we shall formulate some algorithms in their continuous form, omitting matrix implementation. For a discussion of applications to Maxwell‘s equations, readers are referred to [TO10].作者: 手勢(shì) 時(shí)間: 2025-4-2 01:57
