標(biāo)題: Titlebook: Domain Decomposition Methods in Science and Engineering XVI; Olof B. Widlund,David E. Keyes Conference proceedings 2007 Springer-Verlag Be [打印本頁(yè)] 作者: VER 時(shí)間: 2025-3-21 17:44
書目名稱Domain Decomposition Methods in Science and Engineering XVI影響因子(影響力)
書目名稱Domain Decomposition Methods in Science and Engineering XVI影響因子(影響力)學(xué)科排名
書目名稱Domain Decomposition Methods in Science and Engineering XVI網(wǎng)絡(luò)公開度
書目名稱Domain Decomposition Methods in Science and Engineering XVI網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Domain Decomposition Methods in Science and Engineering XVI被引頻次
書目名稱Domain Decomposition Methods in Science and Engineering XVI被引頻次學(xué)科排名
書目名稱Domain Decomposition Methods in Science and Engineering XVI年度引用
書目名稱Domain Decomposition Methods in Science and Engineering XVI年度引用學(xué)科排名
書目名稱Domain Decomposition Methods in Science and Engineering XVI讀者反饋
書目名稱Domain Decomposition Methods in Science and Engineering XVI讀者反饋學(xué)科排名
作者: FEMUR 時(shí)間: 2025-3-21 21:14
1439-7358 and decoupling strategies in mathematical and computational models of natural and engineered systems. Since the advent of hierarchical distributed memory computers, it has been motivated by considerations of concurrency and locality in a wide variety of large-scale problems, continuous and discrete作者: 管理員 時(shí)間: 2025-3-22 02:55 作者: 拘留 時(shí)間: 2025-3-22 06:40
https://doi.org/10.1007/978-3-031-57176-3perties of the iteration operator [6]. We show how to evaluate the best relaxation parameter and what is the influence of patches size on the convergence of the method. Several numerical results in 2D and 3D are presented.作者: 易彎曲 時(shí)間: 2025-3-22 11:43
Fallstudie II Enterprise Risk Management. We distinguish approaches that solve the eigenproblem algebraically (with minimal connections to the underlying partial differential equation) from approaches that couple tightly the eigensolver with the partial differential equation.作者: 軍火 時(shí)間: 2025-3-22 15:34 作者: 軍火 時(shí)間: 2025-3-22 17:55 作者: Inoperable 時(shí)間: 2025-3-23 00:12 作者: 跳脫衣舞的人 時(shí)間: 2025-3-23 05:25 作者: 靦腆 時(shí)間: 2025-3-23 09:26 作者: Cerebrovascular 時(shí)間: 2025-3-23 13:36
1439-7358 rth new contributions in areas of numerical analysis, computer science, scientific and industrial applications, and software development..978-3-540-34468-1978-3-540-34469-8Series ISSN 1439-7358 Series E-ISSN 2197-7100 作者: 提升 時(shí)間: 2025-3-23 16:06
Wie erkennbar ist der Schwarze Schwan? the slowness of the original Schwarz method is to use more general interface conditions, Robin conditions were proposed in [19] and pseudo-differential ones in [17]. These methods are well-suited for indefinite problems [5] and as we shall see to heterogeneous problems.作者: Override 時(shí)間: 2025-3-23 18:52 作者: Collision 時(shí)間: 2025-3-23 22:54
Lower Bounds in Domain Decomposition have a fair comparison of two preconditioners, the sharpness of the respective upper bounds must first be established, which means that we need to derive lower bounds for the condition numbers of the preconditioned systems.作者: Agility 時(shí)間: 2025-3-24 02:26
Finite Element Methods with Patches and Applicationsperties of the iteration operator [6]. We show how to evaluate the best relaxation parameter and what is the influence of patches size on the convergence of the method. Several numerical results in 2D and 3D are presented.作者: 組裝 時(shí)間: 2025-3-24 10:27 作者: 平庸的人或物 時(shí)間: 2025-3-24 12:37
Schur Complement Preconditioners for Distributed General Sparse Linear Systems is to give a brief overview of recent progress made in using these techniques for solving general, irregularly structured, sparse linear systems. The emphasis is to point out the impact of Domain Decomposition ideas on the design of general purpose sparse system solution methods, as well as to show ideas that are of a purely algebraic nature.作者: Resign 時(shí)間: 2025-3-24 16:45
MINISYMPOSIUM 1: Domain Decomposition Methods for Simulation-constrained Optimizationn problems. In such problems we wish to determine various parameters that typically consist the data of a simulation: boundary and initial conditions, material properties, distributed forces, or shape.作者: ACME 時(shí)間: 2025-3-24 21:45
Sergey Svetunkov,Ivan Svetunkov aimed to minimize the trace of the coarse-level operator. The variational multigrid solver resulting from the presented setup procedure is shown to be effective, without the need for parameter tuning, for some problems where current algorithms exhibit degraded performance.作者: 南極 時(shí)間: 2025-3-25 00:19 作者: puzzle 時(shí)間: 2025-3-25 03:47
A Domain Decomposition Solver for a Parallel Adaptive Meshing Paradigm makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. Numerical examples illustrate the effectiveness of the procedure.作者: 天文臺(tái) 時(shí)間: 2025-3-25 09:45 作者: 詞根詞綴法 時(shí)間: 2025-3-25 12:36 作者: 壟斷 時(shí)間: 2025-3-25 19:26
Preconditioning of Saddle Point Systems by Substructuring and a Penalty Approachzation approach of Axelsson in which a related linear system, differing only in the (2,2) block of the coefficient matrix, is introduced. By choosing this block to be negative definite, the dual unknowns of the related system can be eliminated resulting in a positive definite primal Schur complement作者: 監(jiān)禁 時(shí)間: 2025-3-25 21:40
Nonconforming Methods for Nonlinear Elasticity Problemss. In order to retain as much flexibility as possible, we do not require the subdomain grids to match along their common interfaces. Dual Lagrange multipliers are employed to generate efficient and robust transmission operators between the subdomains. Various numerical examples are presented to illu作者: Inoperable 時(shí)間: 2025-3-26 03:32
Finite Element Methods with Patches and Applicationsuse a relaxation method that consists of calculating successive corrections to the solution in patches of finite elements. We analyse the spectral properties of the iteration operator [6]. We show how to evaluate the best relaxation parameter and what is the influence of patches size on the converge作者: 追蹤 時(shí)間: 2025-3-26 06:37
On Preconditioned Uzawa-type Iterations for a Saddle Point Problem with Inequality Constraintsthe Cahn-Hilliard equation with an obstacle potential. We present a new class of preconditioners based on linear Schur complements associated with successive approximations of the coincidence set. In numerical experiments, we found superlinear convergence and finite termination.作者: 護(hù)身符 時(shí)間: 2025-3-26 11:24
Multilevel Methods for Eigenspace Computations in Structural Dynamicsdreds or thousands of eigenpairs.We review in this paper methods based on domain decomposition for such eigenspace computations in structural dynamics. We distinguish approaches that solve the eigenproblem algebraically (with minimal connections to the underlying partial differential equation) from 作者: 泄露 時(shí)間: 2025-3-26 13:50
Recent Developments on Optimized Schwarz Methodswhen overlap is small, typically one mesh size, convergence of the algorithm is slow. A first possible remedy is the introduction of Neumann boundary conditions in the coupling between the local solutions. This idea has led to the development of the Dirichlet-Neuman algorithm [10], Neumann-Neumann m作者: 暴露他抗議 時(shí)間: 2025-3-26 17:53
Schur Complement Preconditioners for Distributed General Sparse Linear Systemsds are pervasive in numerical linear algebra where they represent a canonical way of implementing divide-and-conquer principles. The goal of this note is to give a brief overview of recent progress made in using these techniques for solving general, irregularly structured, sparse linear systems. The作者: lambaste 時(shí)間: 2025-3-27 00:09 作者: CAPE 時(shí)間: 2025-3-27 02:45
MINISYMPOSIUM 1: Domain Decomposition Methods for Simulation-constrained Optimizationgorithms and hardware have provided the framework for high fidelity simulations, to the point that it is now practical to consider complex optimization problems. In such problems we wish to determine various parameters that typically consist the data of a simulation: boundary and initial conditions,作者: 嘮叨 時(shí)間: 2025-3-27 06:47
Robust Multilevel Restricted Schwarz Preconditioners and Applicationsner works extremely well for some difficult large systems of linear equations arising from some optimization problems constrained by the incompressible Navier-Stokes equations. Performance of the preconditioner is reported for parameters including number of processors, mesh sizes and Reynolds number作者: notion 時(shí)間: 2025-3-27 12:16 作者: hemoglobin 時(shí)間: 2025-3-27 13:47 作者: 沙文主義 時(shí)間: 2025-3-27 20:05 作者: 放大 時(shí)間: 2025-3-27 22:30 作者: 呼吸 時(shí)間: 2025-3-28 03:45
Erdressourcen: Die Herausforderungens. In order to retain as much flexibility as possible, we do not require the subdomain grids to match along their common interfaces. Dual Lagrange multipliers are employed to generate efficient and robust transmission operators between the subdomains. Various numerical examples are presented to illustrate the applicability of the approach.作者: COLIC 時(shí)間: 2025-3-28 09:41
https://doi.org/10.1007/978-3-031-57176-3the Cahn-Hilliard equation with an obstacle potential. We present a new class of preconditioners based on linear Schur complements associated with successive approximations of the coincidence set. In numerical experiments, we found superlinear convergence and finite termination.作者: COLIC 時(shí)間: 2025-3-28 12:55
Penicillin and Beta-Lactam Drug Allergy,coarse level consists of the lowest order finite element space. On the fine level, we investigate several decompositions with large or small overlap leading to optimal or close to optimal condition numbers. The analysis is confirmed by numerical experiments for a model problem.作者: 落葉劑 時(shí)間: 2025-3-28 17:21
Margarida Queirós,Joana Pestana Lagesner works extremely well for some difficult large systems of linear equations arising from some optimization problems constrained by the incompressible Navier-Stokes equations. Performance of the preconditioner is reported for parameters including number of processors, mesh sizes and Reynolds numbers.作者: 晚間 時(shí)間: 2025-3-28 20:40
Margarida Queirós,Joana Pestana Lagesssion conditions between subdomains to enhance the convergence speed, to permit methods to be used without overlap, and to obtain convergent methods for problems for which the classical Schwarz method is not convergent, such as, for example, for the Helmholtz problem from acoustics.作者: Muscularis 時(shí)間: 2025-3-29 01:06
Differential Geometry and Tensors,These new interface conditions are designed to improve the convergence properties of the Schwarz algorithm. These conditions depend on a few parameters and they generalize the classical ones. Numerical results illustrate the effectiveness of the new interface conditions.作者: glucagon 時(shí)間: 2025-3-29 04:51
https://doi.org/10.1007/978-3-031-56677-6In this note, we propose Steklov-Poincaré iterative algorithms (mutuated from the analogy with heterogeneous domain decomposition) to solve fluidstructure interaction problems. Although our framework is very general, the driving application is concerned with the interaction of blood flow and vessel walls in large arteries.作者: motor-unit 時(shí)間: 2025-3-29 07:40 作者: 情感脆弱 時(shí)間: 2025-3-29 14:54
Heterogeneous Domain Decomposition Methods for Fluid-Structure Interaction ProblemsIn this note, we propose Steklov-Poincaré iterative algorithms (mutuated from the analogy with heterogeneous domain decomposition) to solve fluidstructure interaction problems. Although our framework is very general, the driving application is concerned with the interaction of blood flow and vessel walls in large arteries.作者: progestin 時(shí)間: 2025-3-29 19:19 作者: 令人苦惱 時(shí)間: 2025-3-29 23:33
https://doi.org/10.1007/978-3-540-34469-8Natur; Software; computer; computer science; development; numerical analysis; science作者: tooth-decay 時(shí)間: 2025-3-30 00:02 作者: Condense 時(shí)間: 2025-3-30 06:33
Lecture Notes in Computational Science and Engineeringhttp://image.papertrans.cn/e/image/282493.jpg作者: deforestation 時(shí)間: 2025-3-30 11:21 作者: 欺騙世家 時(shí)間: 2025-3-30 15:44
Sergey Svetunkov,Ivan Svetunkovial differential equations. The proposed method uses . to select the set of coarse variables. The nonzero supports for the coarse-space basis are determined by approximation of the so-called two-level “ideal” interpolation operator. Then, an energy minimizing coarse basis is formed using an approach作者: irreparable 時(shí)間: 2025-3-30 16:58
Nikolay Didenko,Djamilia Skripnukor the condition numbers of the preconditioned systems have been the focus of most analyses in domain decomposition [21, 20, 23]. However, in order to have a fair comparison of two preconditioners, the sharpness of the respective upper bounds must first be established, which means that we need to de作者: Onerous 時(shí)間: 2025-3-30 22:44 作者: 搖曳的微光 時(shí)間: 2025-3-31 03:14
Erdressourcen: Die Herausforderungens. In order to retain as much flexibility as possible, we do not require the subdomain grids to match along their common interfaces. Dual Lagrange multipliers are employed to generate efficient and robust transmission operators between the subdomains. Various numerical examples are presented to illu作者: 門閂 時(shí)間: 2025-3-31 07:20 作者: 征稅 時(shí)間: 2025-3-31 11:13 作者: nauseate 時(shí)間: 2025-3-31 15:10
Fallstudie II Enterprise Risk Managementdreds or thousands of eigenpairs.We review in this paper methods based on domain decomposition for such eigenspace computations in structural dynamics. We distinguish approaches that solve the eigenproblem algebraically (with minimal connections to the underlying partial differential equation) from 作者: Proclaim 時(shí)間: 2025-3-31 20:08
Wie erkennbar ist der Schwarze Schwan?when overlap is small, typically one mesh size, convergence of the algorithm is slow. A first possible remedy is the introduction of Neumann boundary conditions in the coupling between the local solutions. This idea has led to the development of the Dirichlet-Neuman algorithm [10], Neumann-Neumann m作者: SNEER 時(shí)間: 2025-4-1 00:28
https://doi.org/10.1007/978-3-031-58075-8ds are pervasive in numerical linear algebra where they represent a canonical way of implementing divide-and-conquer principles. The goal of this note is to give a brief overview of recent progress made in using these techniques for solving general, irregularly structured, sparse linear systems. The作者: DEI 時(shí)間: 2025-4-1 04:55 作者: Junction 時(shí)間: 2025-4-1 09:17 作者: Expurgate 時(shí)間: 2025-4-1 13:11
Margarida Queirós,Joana Pestana Lagesner works extremely well for some difficult large systems of linear equations arising from some optimization problems constrained by the incompressible Navier-Stokes equations. Performance of the preconditioner is reported for parameters including number of processors, mesh sizes and Reynolds number作者: correspondent 時(shí)間: 2025-4-1 15:37
Margarida Queirós,Joana Pestana Lagesssion conditions between subdomains to enhance the convergence speed, to permit methods to be used without overlap, and to obtain convergent methods for problems for which the classical Schwarz method is not convergent, such as, for example, for the Helmholtz problem from acoustics.
