Computable upper and lower bounds on eigenfrequencies

Wang Li; Chamoin Ludovic; Ladeveze Pierre; Zhong Hongzhi

首页> 外文期刊>Computer Methods in Applied Mechanics and Engineering >Computable upper and lower bounds on eigenfrequencies

【24h】

Computable upper and lower bounds on eigenfrequencies

机译：本征频率的可计算上限和下限

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

This paper is a revisit of the work [Ladeveze and Pelle, Int. J. Numer. Methods Engrg. 28 ( 1989)] where the goal here is to acquire guaranteed, accurate and computable bounds of eigenfrequencies through post-processing of conventional finite element results. To this end, a new theoretical quotient is introduced and thereafter, a practical way to deal with the new quotient is developed where the constitutive relation error estimation featured with guaranteed bounding property acts as a key role. Academic numerical examples are performed to check the accuracy of the bounds. (C) 2016 Elsevier B.V. All rights reserved.

机译：本文是对这项工作的回顾[Ladeveze和Pelle，Int。 J.纽默方法工程。 28（1989）]，此处的目标是通过对常规有限元结果进行后处理来获得有保证的，准确的和可计算的特征频率边界。为此，引入了一种新的理论商，此后，开发了一种处理新商的实用方法，其中以具有保证的边界性质为特征的本构关系误差估计起着关键作用。执行学术数值示例以检查边界的准确性。（C）2016 Elsevier B.V.保留所有权利。

著录项

来源
《Computer Methods in Applied Mechanics and Engineering》 |2016年第15期|27-43|共17页
作者
Wang Li; Chamoin Ludovic; Ladeveze Pierre; Zhong Hongzhi;
展开▼
作者单位

Tsinghua Univ, Dept Civil Engn, Beijing 100084, Peoples R China;

Univ Paris Saclay, CNRS, ENS Cachan, LMT, 61 Ave President Wilson, F-94235 Cachan, France;

Univ Paris Saclay, CNRS, ENS Cachan, LMT, 61 Ave President Wilson, F-94235 Cachan, France;

Tsinghua Univ, Dept Civil Engn, Beijing 100084, Peoples R China;

展开▼
收录信息美国《科学引文索引》(SCI);美国《工程索引》(EI);
原文格式 PDF
正文语种 eng
中图分类
关键词
Model verification; Guaranteed bounds; Eigenfrequency; Constitutive relation error (CRE); Finite element method;

机译：模型验证;保证边界;特征频率;本构关系误差（CRE）;有限元法;

相似文献

外文文献
中文文献
专利

1. An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem [J] . Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, INFORMS journal on computing . 2020,第4期

机译：一种自适应启发式方法来计算近足够的旅行推销员问题的上下边界
2. Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price [J] . Horvath Marko, Kis Tamas Central European journal of operations research: CEJOR . 2019,第1期

机译：计算集成的多仓库车辆和分支机构的船员调度问题强大的下限
3. A Polynomial-Time Algorithm Computing Lower and Upper Bounds of the Rooted Subtree Prune and Regraft Distance [J] . LAVANYA KANNAN, HUA LI, ARCADY MUSHEGIAN Journal of computational biology: A journal of computational molecular cell biology . 2011,第5期

机译：多项式时间算法，用于计算根子树修剪的下界和上界
4. Computing Upper and Lower Bounds of Graph Edit Distance in Cubic Time [C] . Kaspar Riesen, Andreas Fischer, Horst Bunke Artificial neural networks in pattern recognition . 2014

机译：计算立方时间内图编辑距离的上下界
5. A fast parallel algorithm to numerically compute the Markov renewal kernel via tight lower and upper bounds. [D] . Elkins, Debra Ann. 2000

机译：一种快速的并行算法，用于通过严格的上下限来数值计算马尔可夫更新内核。
6. Maximum common subgraph: some upper bound and lower bound results [O] . Xiuzhen Huang, Jing Lai, Steven F Jennings 2006

机译：最大公共子图：一些上限和下限结果
7. Computing strong lower and upper bounds for the integratedudmultiple-depot vehicle and crew scheduling problem withudbranch-and-price [O] . Horváth Markó, Kis Tamás 2017

机译：计算积分 ud的强大上下限 ud的多点车辆和人员调度问题分支与价格

Computable upper and lower bounds on eigenfrequencies

摘要

著录项

相似文献

相关主题

期刊订阅