检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

661 篇 会议
203 册 图书

馆藏范围

815 篇 电子文献
89 种 纸本馆藏

日期分布

学科分类号

638 篇 理学
- 627 篇 数学
- 42 篇 物理学
- 19 篇 系统科学
- 18 篇 统计学（可授理学、...
- 3 篇 化学
- 3 篇 大气科学
- 2 篇 生物学
- 1 篇 地质学
394 篇 工学
- 350 篇 计算机科学与技术...
- 144 篇 电气工程
- 52 篇 软件工程
- 36 篇 力学（可授工学、理...
- 16 篇 控制科学与工程
- 7 篇 材料科学与工程（可...
- 7 篇 动力工程及工程热...
- 7 篇 电子科学与技术（可...
- 5 篇 信息与通信工程
- 5 篇 土木工程
- 3 篇 机械工程
- 3 篇 水利工程
- 3 篇 石油与天然气工程
- 2 篇 仪器科学与技术
- 2 篇 化学工程与技术
- 2 篇 航空宇航科学与技...
- 1 篇 冶金工程
6 篇 管理学
- 4 篇 管理科学与工程(可...
- 2 篇 图书情报与档案管...
2 篇 农学
- 2 篇 作物学
1 篇 经济学
- 1 篇 应用经济学
1 篇 教育学
- 1 篇 体育学

主题

53 篇 computational ma...
39 篇 domain decomposi...
36 篇 computational sc...
24 篇 numerical analys...
24 篇 finite element m...
22 篇 mathematical and...
21 篇 partial differen...
21 篇 galerkin methods
21 篇 numerical method...
20 篇 fluid structure ...
19 篇 numerical and co...
17 篇 theoretical, mat...
16 篇 computational in...
14 篇 mathematics of c...
13 篇 iterative method...
12 篇 eigenvalues and ...
11 篇 navier stokes eq...
11 篇 perturbation tec...
10 篇 analysis
10 篇 boundary conditi...

机构

11 篇 univ colorado de...
9 篇 univ cologne mat...
8 篇 univ geneva sect...
8 篇 univ paris 13 la...
7 篇 univ geneva gene...
7 篇 penn state univ ...
6 篇 texas a&m univ d...
6 篇 univ geneva sect...
5 篇 graduate school ...
5 篇 technical univer...
5 篇 johannes kepler ...
5 篇 courant institut...
5 篇 univ zaragoza de...
4 篇 charles univ pra...
4 篇 univ milan dipar...
4 篇 university of os...
4 篇 univ geneva 2-4 ...
4 篇 middle east tech...
4 篇 univ warsaw fac ...
3 篇 northeast normal...

作者

40 篇 gander martin j.
13 篇 halpern laurence
12 篇 cai xiao-chuan
12 篇 michael griebel
11 篇 rheinbach oliver
10 篇 dolean victorita
10 篇 klawonn axel
8 篇 olof widlund
8 篇 krause rolf
8 篇 kwok felix
8 篇 hans-joachim bun...
7 篇 marc alexander s...
6 篇 lube gert
6 篇 björn engquist
6 篇 lee chang-ock
6 篇 dryja maksymilia...
6 篇 japhet caroline
6 篇 marcinkowski les...
6 篇 michael schäfer
6 篇 sarkis marcus

语言

831 篇 英文
33 篇 中文

检索条件"丛书名=Lecture Notes in Computational Science and Engineering"

共 864 条记录，以下是701-710 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

From the Boundary Element Domain Decomposition Methods to Local Trefftz Finite Element Methods on Polyhedral Meshes

From the Boundary Element Domain Decomposition Methods to Lo...

引用

18th International Conference on Domain Decomposition Methods

作者： Copeland, Dylan Langer, Ulrich Pusch, David Johannes Kepler Univ Linz Inst Computat Math Linz Austria Austrian Acad Sci RICAM A-1010 Vienna Austria

ISBN: (纸本)9783642026775;9783642026768

We derive and analyze new boundary element (BE) based finite element discretizations of potential-type, Helmholtz and Maxwell equations on arbitrary polygonal and polyhedral meshes. The starting point of this discretization technique is the symmetric BE Domain Decomposition Method (DDM), where the subdomains are the finite elements. This can be interpreted as a local Trefftz method that uses PDE-harmonic basis functions. This discretization technique leads to large-scale sparse linear systems of algebraic equations which can efficiently be solved by Algebraic Multigrid (AMG) methods or AMG preconditioned conjugate gradient methods in the case of the potential equation and by Krylov subspace iterative methods in general.

关键词： Domain decomposition methods

来源：评论

学校读者我要写书评

暂无评论

An Extended Mathematical Framework for Barrier Methods in Function Space

An Extended Mathematical Framework for Barrier Methods in Fu...

引用

18th International Conference on Domain Decomposition Methods

作者： Schiela, Anton Zuse Inst Berlin D-14195 Berlin Germany

ISBN: (纸本)9783642026775

In this note, we extend the mathematical framework in [7] of barrier methods for state constrained optimal control problems with PDEs to a more general setting. In [7] we modelled the state equation by Ly = u with L a closed, densely defined, surjective operator. This restricts the applicability of our theory mainly to certain distributed control problems. Motivated by the discussion in [6], we consider in this work operator equations of the more general form Ay-Bu = 0, where A is closed, densely defined and with closed range and B is continuous. While this change in framework only neccessitates minor modificatios in the theory, it extends its applicability to large additional classes of control problems, such as boundary control and finite dimensional control. To make this paper as self contained as possible, assumptions and results of [7] are recapitulated, but for brevity proofs and more detailed information are only given when there are differences to [7]. This is possible, because our extension has only a very local effect. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： Functions

来源：评论

学校读者我要写书评

暂无评论

computational Tool for a Mini-Windmill Study with SOFT

Computational Tool for a Mini-Windmill Study with SOFT

引用

18th International Conference on Domain Decomposition Methods

作者： Garbey, M. Smaoui, M. De Brye, N. Picard, C. Univ Houston Dept Comp Sci Houston TX 77204 USA

ISBN: (纸本)9783642026775;9783642026768

In this paper, we present a parallel computational framework for the completely automated design of a Vertical Axis Fluid Turbine (VAFT). Simulation, Optimum design, Fabrication and Testing (SOFT) of the VAFT is integrated into a hardware/software environment that can fit into a small office space. The components of the four steps design loop are as follows Simulation: We use a parallel CFD algorithm to run a direct simulation of the fluid structure interaction problem. We derive from that computation the torque and the average rotation speed for a given friction coefficient on the rotor shaft and an average flow speed. Our objective is to get the most power out of the windmill, consequently the highest rotation speed possible. Optimization: We optimize the shape of the blade section with a genetic algorithm and/or a surface response. The evaluation of the objective function (average rotation speed) corresponds to the direct simulation of the Navier Stokes flow interacting with the rotating turbine, until reaching a stationary regime. Because this simulation is compute-intensive, we distribute the evaluation of the objective function for the different shapes (gene or parameter combinations) on a network of computers using an embarrassingly parallel algorithm. Fabrication: The optimization procedure results in a supposedly optimum shape in the chosen design space. This shape is sent to a 3-D printer that fabricates the real turbine. This turbine is set up such that it can be easily mounted on a standard base equipped with an electric alternator/generator. Testing: The windmill is tested in a mini wind tunnel. The electric output is measured and a video camera can directly monitor the windmill rotation through the transparent wall of the wind tunnel. This information can be analyzed by the computer system and comparison with the simulation is assessed. Figure 1 gives a graphical overview of the SOFT concept. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

Distributed Decomposition Over Hyperspherical Domains

Distributed Decomposition Over Hyperspherical Domains

引用

18th International Conference on Domain Decomposition Methods

作者： Ahmadia, Aron Keyes, David Melville, David Rosenbluth, Alan Tian, Kehan Columbia Univ Dept Appl Phys & Appl Math New York NY 10027 USA IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA

ISBN: (纸本)9783642026775;9783642026768

We are motivated by an optimization problem arising in computational scaling for optical lithography that reduces to finding the point of minimum radius that lies outside of the union of a set of diamonds centered at the origin of Euclidean space of arbitrary dimension. A decomposition of the feasible region into convex regions suggests a heuristic sampling approach to finding the global minimum. We describe a technique for decomposing the surface of a hypersphere of arbitrary dimension, both exactly and approximately, into a specific number of regions of equal area and small diameter. The decomposition generalizes to any problem posed on a spherical domain where regularity of the decomposition is an important concern. We specifically consider a storage-optimized decomposition and analyze its performance. We also show how the decomposition can parallelize the sampling process by assigning each processor a subset of points on the hypersphere to sample. Finally, we describe a freely available C++ software package that implements the storage-optimized decomposition.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Parallelization of a Constrained Three-Dimensional Maxwell Solver

Parallelization of a Constrained Three-Dimensional Maxwell S...

引用

18th International Conference on Domain Decomposition Methods

作者： Assous, F. Segre, J. Sonnendruecker, E. Bar Ilan Univ Dept Math & Stat IL-52100 Ramat Gan Israel CEA DEN DM2S SFME Saclay France Univ Strasbourg CNRS IRMA F-67070 Strasbourg France

ISBN: (纸本)9783642026775;9783642026768

The numerical solution of very large 3D electromagnetic field problems are challenging for various applications in the industry. In this paper, we propose a nonoverlapping domain decomposition approach for solving the 3D Maxwell equations on MIMD computers, based on a mixed variational formulation. It is especially well adapted for the solution of the Vlasov-Maxwell equations, widely used to simulate complex devices like particle injectors or accelerators. This approach in particular leads to reuse without modification most of an existing sequential code.

关键词： Particle injectors

来源：评论

学校读者我要写书评

暂无评论

Patch Smoothers for Saddle Point Problems with Applications to PDE-Constrained Optimization Problems

Patch Smoothers for Saddle Point Problems with Applications ...

引用

18th International Conference on Domain Decomposition Methods

作者： Simon, Rene Zulehner, Walter Univ Linz SFB 013Altenbergerstr69 A-4040 Linz Austria Johannes Kepler Univ Linz Inst Computat Math A-4040 Linz Austria

ISBN: (纸本)9783642026775;9783642026768

We consider a multigrid method for solving the discretized optimality system of a PDE-constrained optimization problem. In particular, we discuss the construction of an additive Schwarz-type smoother for a class of elliptic optimal control problems. A rigorous multigrid convergence analysis yields level-independent convergence rates. Numerical experiments indicate that the convergence rates are also independent of the involved regularization parameter.

关键词： Optimal control systems

来源：评论

学校读者我要写书评

暂无评论

An Algorithm for Non-Matching Grid Projections with Linear Complexity

An Algorithm for Non-Matching Grid Projections with Linear C...

引用

18th International Conference on Domain Decomposition Methods

作者： Gander, Martin J. Japhet, Caroline Univ Geneva Sect Math 2-4 Rue LievreCP 64 CH-1211 Geneva 4 Switzerland Univ Paris 13 LAGA F-93430 Villetaneuse France

ISBN: (纸本)9783642026775;9783642026768

Non-matching grids are becoming more and more common in scientific computing. Examples are the Chimera methods proposed by [20] and analyzed in [2], the mortar methods in domain decomposition by [1], and the patch method for local refinement by [6], and [17], which is also known under the name 'numerical zoom', see [9]. In the patch method, one has a large scale solver for a particular partial differential equation, and wants to add more precision in certain areas, without having to change the large scale code. One thus introduces refined, possibly non-matching patches in these regions, and uses a residual correction iteration between solutions on the patches and solutions on the entire domain, in order to obtain a more refined solution in the patch regions. The mortar method is a domain decomposition method that permits an entirely parallel grid generation, and local adaptivity independently of neighboring subdomains, because grids do not need to match at interfaces. The Chimera method is also a domain decomposition method, specialized for problems with moving parts, which inevitably leads to non-matching grids, if one wants to avoid regridding at each step. Contact problems in general lead naturally to nonmatching grids. In all these cases, one needs to transfer approximate solutions from one grid to a non-matching second grid by projection. This operation is known in the literature under the name mesh intersection problem in [12], intergrid communication problem in [16], grid transfer problem in [18], and similar algorithms are also needed when one has to interpolate discrete approximations, see [13, Chap. 13]. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： Domain decomposition methods

来源：评论

学校读者我要写书评

暂无评论

On Preconditioners for Generalized Saddle Point Problems with an Indefinite Block

On Preconditioners for Generalized Saddle Point Problems wit...

引用

18th International Conference on Domain Decomposition Methods

作者： Krzyzanowski, Piotr Univ Warsaw PL-02097 Warsaw Poland

In many applications one needs to solve a discrete system of linear equations with a symmetric block matrix M (u/p) ≡ (A BT/B O) (u/p) = (f/g,) where the block A =AT is not necessarily positive definite and may even ... 详细信息

ISBN: (纸本)9783642026775

In many applications one needs to solve a discrete system of linear equations with a symmetric block matrix M (u/p) ≡ (A B^T/B O) (u/p) = (f/g,) where the block A =A^T is not necessarily positive definite and may even be singular. Such situation occurs, for example, after suitable finite element discretization of the generalized Stokes problem, cf. [5], -Delta;u -ωu + ∇_p = f, div u = 0, when for large enough ω one cannot preserve the ellipticity of -Δ -ω. Another example is the time-harmonicMaxwell equation, see [7], ∇ × ∇ × u -ωu + ∇_p = f, div u = 0, where large enough ω again results in an indefinite A. Although the whole system matrix (1) remains invertible when ω = 0, the matrix A which then corresponds to the discrete curl-curl operator, has a large kernel. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A FETI-2LM Method for Non-Matching Grids

A FETI-2LM Method for Non-Matching Grids

引用

18th International Conference on Domain Decomposition Methods

作者： Roux, Francois-Xavier Off Natl Etud & Rech Aerosp High Performance Comp Unit F-92320 Chatillon France

ISBN: (纸本)9783642026775

In this paper, a new solution methodology based on the FETI-2LM method for non conforming grids is introduced. Thanks to the regularizing properties of the Robin interface matching conditions of the FETI-2LM method, each non conforming condition can be localized inside one subdomain, in such a way that the FETI-2LM method applies exactly in the same way as in the conforming case. The paper is organized as follows: section 2 recalls the principle of FETI-2LM method, section 3 briefly describes the mortar method for non conforming domains, the new methodology for localizing the multi-point constraints on the non conforming interface derived from the mortar method is introduced in section 4 and section 5 generalizes the methodology in the case of multi-level splitting of a mesh including a non conforming interface. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： Mortar

来源：评论

学校读者我要写书评

暂无评论

A Maximum Principle for L²-Trace Norms with an Application to Optimized Schwarz Methods

A Maximum Principle for <i>L</i><SUP>2</SUP>-Trace Norms wit...

引用

18th International Conference on Domain Decomposition Methods

作者： Loisel, Sebastien Szyld, Daniel B. Temple Univ Philadelphia PA 19122 USA

ISBN: (纸本)9783642026775

Harmonic functions attain their pointwise maximum on the boundary of the domain. In this article, we analyze the relationship between various norms of nearly harmonic functions and we show that the trace norm is maximized on the boundary of the domain. One application is that the Optimized Schwarz Method with two subdomains converges for all Robin parameters alpha > 0.

关键词： Harmonic functions

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共87页 << < 67 68 69 70 71 72 73 74 75 76 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：