Subspace-Based Reduced-Order Modeling Methods for Structural Dynamic Systems

Computational costs for detailed Finite Element approximations can be reduced by using reduced-order models instead. In this contribution, four subspace-based reduced-order modeling methods are compared. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Krylov Subspace Methods for Model Order Reduction of Bilinear Discrete-Time Control Systems

In this paper, we propose a projection technique for model order reduction of discrete-time bilinear control systems based on the concept of so-called multimoments. We will make use of an explicit solution formula of the system and consider its Z-transform which allows us to characterize the system output by generalized transfer functions. (© 2010 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Spectral Variants of Krylov Subspace Methods

Krylov iterative methods usually solve an optimization problem, per iteration, to obtain a vector whose components are the step lengths associated with the previous search directions. This vector can be viewed as the solution of a multiparameter optimization problem. In that sense, Krylov methods can be combined with the spectral choice of step length that has recently been developed to accelerate descent methods in optimization. In this work, we discuss different spectral variants of Krylov methods and present encouraging preliminary numerical experiments, with and without preconditioning.     

常用连接结构在简化有限元模型中的模拟方法

连接部位容易成为结构中的薄弱环节,针对各种连接技术,建立能合理模拟其传力特性的有限元模型是保证求解正确的关键环节。本文总结了常用的点焊、胶接、螺栓联接和缝焊连接技术在简化有限元模型中的建模方法,并从其连接原理、模型特点、精度比较等方面进行综合评价,最后给出各自的使用准则和建议。     

解非光滑方程组的Krylov子空间迭代法

给出了求解非光滑方程组的Newton-FOM算法和Newton-GMRES算法,证明了这些Krylov子空间方法的局部平方收敛性．数值结果表明了算法的有效性．     

求解大规模非Hermite线性方程组的Krylov子空间型方法的收敛性分析

本文用统一的方式研究了当系数矩阵Ａ亏损且其谱位于右（左）半开平面时很多求解大规模非Ｈｅｒｍｉｔｅ线性方程组的Ｋｒｙｌｏｖ子空间型方法的收敛性，建立了有关的理论收敛界，揭示了收敛速度和Ａ的谱之间的内在联系．结果证明，当如下三种情形之一出现时，这些方法的收敛速度将会减慢：Ａ亏损，其谱的分布不理想，或Ａ的Ｊｏｒｄａｎ基病态．在证明中，我们给出了Ｃｈｅｂｙｓｈｅｖ多项式的高阶导数在复平面中某椭圆域上的若干新性质，其中之一修正了文献中广泛使用的一个结果．     

Block Krylov Subspace Methods for Large Algebraic Riccati Equations

In the present paper, we present numerical methods for the computation of approximate solutions to large continuous-time and discrete-time algebraic Riccati equations. The proposed methods are projection methods onto block Krylov subspaces. We use the block Arnoldi process to construct an orthonormal basis of the corresponding block Krylov subspace and then extract low rank approximate solutions. We consider the sequential version of the block Arnoldi algorithm by incorporating a deflation technique which allows us to delete linearly and almost linearly dependent vectors in the block Krylov subspace sequences. We give some theoretical results and present numerical experiments for large problems.     

Block Krylov Subspace Methods for Solving Large Sylvester Equations

In the present paper, we propose block Krylov subspace methods for solving the Sylvester matrix equation AX–XB=C. We first consider the case when A is large and B is of small size. We use block Krylov subspace methods such as the block Arnoldi and the block Lanczos algorithms to compute approximations to the solution of the Sylvester matrix equation. When both matrices are large and the right-hand side matrix is of small rank, we will show how to extract low-rank approximations. We give some theoretical results such as perturbation results and bounds of the norm of the error. Numerical experiments will also be given to show the effectiveness of these block methods.     

Stopping Criterion in Order Reduction of Large Scale Systems Using Krylov Subspace Methods

We show that order reduction by a two‐sided Krylov subspace method is equivalent to an approximate TBR in the sense of Galerkin type conditions. The Hankel Singular Values of the original system are thereby approximated by the Hankel singular values of the Krylov reduced model which are used as a stopping criterion to find a suitable order of the reduced model. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Hamilton系统的连续有限元法

利用常微分方程的连续有限元法,对非线性Hamilton系统证明了连续一次、二次有限元法分别是2阶和3阶的拟辛格式,且保持能量守恒;连续有限元法是辛算法对线性Hamilton系统,且保持能量守恒．在数值计算上探讨了辛性质和能量守恒性,与已有的辛算法进行对比,结果与理论相吻合．     

非线性抛物型方程组的二次有限体积元方法及其误差估计

讨论基于三角形网格的二维非线性抛物型方程组的有限体积元方法,其中试探函数空间为二次Lagrange元,检验函数空间为分片常数函数空间,对问题的全离散格式证明了最优的能量模误差估计。最后给出一个相关数值算例以验证格式的有效性。     

一类反应扩散方程组的隐-显多步有限元方法及其分析

考虑一类非线性反应扩散方程组，提出了隐-显多步有限元格式逼近，证明了格式最优的L^2模误差估计．     

hp-Adaptive Finite Element Methods for Variational Inequalities

In this work, we combine an hp–adaptive strategy with a posteriori error estimates for variational inequalities, which are given by contact problems. The a posteriori error estimates are obtained using a general approach based on the saddle point formulation of contact problems and making use of a yposteriori error estimates for variational equations. Error estimates are presented for obstacle problems and Signorini problems with friction. Numerical experiments confirm the reliability of the error estimates for finite elements of higher order. The use of the hp–adaptive strategy leads to meshes with the same characteristics as geometric meshes and to exponential convergence. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

High Accuracy for Mixes Finite Element Methods in Raviart-Thomas Element

1.IntroductionWeconsiderthemixedmethodsoftheNeumannboundaryvaJueproblemp+7u=oinfl,divp=jinfl,(1)p'n=Oonofl,whereflCR2isaboundeddomainwithboundariesparaJleltoaxes,nistheouterunitnormaJtoOfl.DenoteHo(div)={qEH(div),q'n=oonofl},thenwecanwritetheweakformulationof(1)asfollows:Find(u,p)EL'(n)xHo(div)suchthat(p,q)-(u,divq)+(v,divp)=(f,v),V(v,q)eL'(fl)xHo(div).(2)LetVhxPhCL'(fl)xHo(div)beapairoffiniteelementspaceswithrespecttoTh,auinformrectangularmeshwiththesize2h.Thenthemiredfiniteelementa…     

Robust Bounds for Krylov Methods

In this paper we give bounds for polynomials of operators. These bounds are robust in low rank perturbations. This problem is encountered in the study of the convergence of Krylov methods. The central idea here is to view the resolvent as a meromorphic function.     

On Finite Element Methods for Inhomogeneous Dielectric Waveguides

We investigate the problem of computing electromagnetic guided waves in a closed,inhomogeneous, pillared three-dimensional waveguide at a given frequency. The problem is formulated as a generalized eigenvalue problem. By modifying the sesquilinear form associated with the eigenvalue problem, we provide a new convergence analysis for the finite element approximations. Numerical results are reported to illustrate the performance of the method.     

对流-扩散型问题Bubble-稳定有限元分析

本文针对形如σu α·u-kΔu=f对流—扩散型的模型问题,发展耦合局部bubble-函数的有限元方法,我们就α=0和σ=0两种情形证明了方法的与“影响因素”σ和pedlet-数无关稳定性及全局最佳收敛阶。     

美式回望期权定价的有限元超收敛分析

考虑美式回望看跌期权的有限元方法．在把原问题转化成等价的变分不等式的基础上,研究了半离散格式在L^2和L^∞范数意义下的最优误差估计．此外,为了进一步提高逼近解的精度,借助超收敛分析技术和插值后处理方法,研究了H^1范数意义下的整体超收敛以及后验误差估计。     

用有限元方法求解界面特征值问题

用有限元方法计算椭圆型界面特征值问题,实验数据显示近似特征值的变化规律:界面特征值问题中系数的间断性对协调和非协调Crouzeix-Raviart有限元特征值的收敛性并无影响,而且对协调有限元特征值外推以后得到高精度的解,相应的外推值还提供特征值下界;Crouzeix-Raviart元特征值提供特征值下界,这对一般有界区域如"镂空"型区域也成立.另外,还展示近似特征函数的图形.     

TVD-based Finite Volume Methods for Sound-Advection-Buyancy Systems

Split-explicit Runge-Kutta methods provide an efficient integration procedure for hyperbolic systems with coupled slow and fast wave phenomena. They are generalized to multirate infinitesimal step methods (MIS) in order to develop an order to provide order conditions and to establish stability properties. The construction of MIS methods is based on an underlying Runge-Kutta method. This method is choosen to be total variation diminishing (TVD) to improve the stability properties of the method. Here, the maximum Courant number is improved by a factor of 4. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)