确定应力强度因子的光弹性法与焦散线法

以光弹性法及焦散线法的基本原理为基础,对两种方法在确定应力强度因子方面进行了比较。发现对于纯I型裂纹问题,光弹性法的精度低于焦散线法的精度;对于I－Ⅱ混合型裂纹问题,就张开型应力强度因子而言,光弹性法的精度低于焦散线法的精度,而就滑移型应力强度因子而言,光弹性法的精度高于焦散线法的精度。     

焦散线法确定应力强度因子的条件

基于焦散线的形成原理及含裂纹受力试件在裂尖附近区域的应力分布,得到了焦散线法确定应力强度因子的条件：初始曲线半径与试件厚度之比大于0．5。当满足该条件时,对光学各向同性材料及光学各向异性材料前表面反射的情形,只需测量焦散线沿横向的最大尺寸便可较精确地确定应力强度因子;而对于光学各向异性材料的透射或后表面反射情形,只有在忽略远场非奇异应力的影响后,才可借助焦散线的横向尺寸近似确定应力强度因子。     

最优步长因子法在桁架结构尺寸优化方面的应用

针对桁架结构尺寸优化的特性,依据原约束优化问题的对偶函数关于KKT乘子的一阶偏导数确定乘子的寻优方向;依据对偶函数的极值必要条件和约束优化问题的KKT条件,推导乘子迭代的最优步长因子;依据广义Lagrange函数关于各杆横截面积一阶偏导数应为零的极值必要条件,推导出求解该非线性方程组的优化迭代求解式及其步长因子;通过2种不同约束条件的10杆桁架结构尺寸优化算例验证了本文方法可自动确定各迭代求解式中的步长因子;与已有文献采用序列二次规划法的算例相比,本文方法无需采用一维搜索法寻找步长因子,可大幅度减少计算时间。     

一种光弹性法确定应力强度因子的简便方法

在考虑远场非奇异应力σａｘ影响的基础上,建立了Ⅰ－Ⅱ混合型裂纹问题应力强度因子Ｋ１、ＫⅡ与等差线条纹图上点的极坐标间的非线性方程,为确定ＫⅠ、ＫⅡ及σａ,本文将θ＝０及θ＝π／２两级轴与两级不同条纹交点的坐标代入方程,从而得到了一种光强弹性法确定Ⅰ－Ⅱ混合型裂纹问题应力强度因子的简便方法。作为实例,本文一了环树脂及聚碳酸脂材料在不同载荷、不同裂纹条件下的应力强度因子,并将所得结果与相应的理论计算值     

多困难度几何规划的一个简单解法

推导出方向因子的计算式和一维搜索的迭代式,为求解多困难度几何规划问题提供了一个简单的计算方法。     

用散斑照相法确定界面裂纹的应力强度因子

文中采用激光散斑照相法确定了异弹模界面裂纹尖端的应力强度因子。实验结果与计算结果一致,说明采用的方法是成功的。     

弯矩图确定后轴力不能直接解算问题的探讨

某些超静定结构,当弯矩图确立后,应用静力平衡条件无法实现对整个结构的支座反力 及内力的完全解算. 通过对此类结构受力特征的分析,定义出现此类情况结构的基本特征, 并在结构力学范畴内,对比可以解决此类问题的计算方法,提出解决思路,给出简便的解算 公式.     

数值积分法求解厚壁筒的动态应力强度因子

用数值积分法求解了厚壁筒表面裂纹的动态应力强度因子，其结果与有限元的计算结果作了比较，表明该方法简单有效，对工程应用极有参考价值     

求解界面裂纹应力强度因子的高次权函数法

从界面裂纹完备的特征展开式出发,利用伪正交特性,提出了计算界面裂纹特征展开式系数和应力强度因子的高次权函数法.文中计算的均匀材料应力强度因子,与已有结果吻合得非常好.并给出了界面裂纹的应力强度因子K1/K0和K2/K0随材料弹性模量比及裂纹长度的变化.     

一种确定结合材料界面端应力强度因子的数值方法

基于弹性力平面问题的基本方程,给出了结合材料界面端的应力奇异性特征方程以及位移场和奇异应力场。提出了一种确定结合材料界面端应力强度因子的数值外插方法。对界面端区域进行了有限元网格单元划分。经过具体实例检验进一步确定了求解应力强度因子的最佳方向,该数值外插法的计算结果精度符合工程应用的要求,为工程材料强度的评价提供了有效的计算途径。     

Asynchronous relaxed iterative methods for solving linear systems of equations

I.AsynchronousRelaxedIterativeMethodsMoreandmorelargeorverylargescaleproblemsofscientificcomputationhavebeenproposedandarebeingproposedinmanyimportantfieldsofscienceandengineering.Manyoftheseproblemsresultinsolvinglargeorverylargelinearalgebraicsystemsofe…     

An iterative parallel algorithm of finite element method

In this paper, a parallel algorithm with iterative form for solving finite element equation is presented. Based on the iterative solution of linear algebra equations, the parallel computational steps are introduced in this method. Also by using the weighted residual method and choosing the appropriate weighting functions, the finite element basic form of parallel algorithm is deduced. The program of this algorithm has been realized on the ELXSI-6400 parallel computer of Xi'an Jiaotong University. The computational results show the operational speed will be raised and the CPU time will be cut down effectively. So this method is one kind of effective parallel algorithm for solving the finite element equations of large-scale structures.     

APPLICATIONS OF STAIR MATRICES AND THEIR GENERALIZATIONS TO ITERATIVE METHODS

Stair matrices and their generalizations are introduced. The definitions and some properties of the matrices were first given by Lu Hao. This class of matrices provide bases of matrix splittings for iterative methods. The remarkable feature of iterative methods based on the new class of matrices is that the methods are easily implemented for parallel computation. In particular, a generalization of the accelerated overrelaxation method (GAOR) is introduced. Some theories of the AOR method are extended to the generalized method to include a wide class of matrices. The convergence of the new method is derived for Hermitian positive definite matrices. Finally, some examples are given in order to show the superiority of the new method.     

Investigation of relaxation properties of polymer melts by comparison of relaxation time spectra calculated with different algorithms

In this paper a recently introduced algorithm (Brabec and Schausberger, 1995) for the calculation of relaxation time spectra is compared with two standard methods, i.e., Weese's regularization, and Baumgaertel's and Winter's regression algorithm. A reasonable agreement between those three algorithms is found for the relaxation properties of mono-, polydisperse, bi-, and multimodal polystyrene samples. All three numerical methods reproduce the relaxation properties for long and medium times correctly, but they show some disagreement at short times because of sparse experimental data. The high numerical accuracy opens the possibility to test and improve the physical models which underlie the calculations. The good agreement of the different algorithms suggests that small inconsistencies to physical models are not due to a failure of the numerical methods, but due to an insufficiency of the generalized Maxwell model.     

Arnoldi and Crank–Nicolson methods for integration in time of the transport equation

A comparison is made between the Arnoldi reduction method and the Crank–Nicolson method for the integration in time of the advection–diffusion equation. This equation is first discretized in space by the classic finite element (FE) approach, leading to an unsymmetric first‐order differential system, which is then solved by the aforementioned methods. Arnoldi reduces the native FE equations to a much smaller set to be efficiently integrated in the Arnoldi vector space by the Crank–Nicolson scheme, with the solution recovered back by a standard Rayleigh–Ritz procedure. Crank–Nicolson implements a time marching scheme directly on the original first‐order differential system. The computational performance of both methods is investigated in two‐ and three‐dimensional sample problems with a size up 30 000. The results show that in advection‐dominated problems less then 100 Arnoldi vectors generally suffice to give results with a 10⁻³–10⁻⁴ difference relative to the direct Crank–Nicolson solution. However, while the CPU time with the Crank–Nicolson starts from zero and increases linearly with the number of time steps used in the simulation, the Arnoldi requires a large initial cost to generate the Arnoldi vectors with subsequently much less expensive dynamics for the time integration. The break‐even point is problem‐dependent at a number of time steps which may be for some problems up to one order of magnitude larger than the number of Arnoldi vectors. A serious limitation of Arnoldi is the requirement of linearity and time independence of the flow field. It is concluded that Arnoldi can be cheaper than Crank–Nicolson in very few instances, i.e. when the solution is needed for a large number of time values, say several hundreds or even 1000, depending on the problem. Copyright © 2001 John Wiley & Sons, Ltd.     

Transient behaviour of the mechanical loss factor of high density polyethylene during creep and relaxation

The mechanical loss factor of high density polyethylene has been measured during creep and stress relaxation experiments. The application of a constant stress (creep) or strain (relaxation) resulted in an instantaneous increase in tan above the value obtained in absence of the creep or relaxation process. During the flow the tan-value decreased and approached an apparent equilibrium value slightly above the value obtained without the static load or deformation. This behaviour was observed both at 1 and 10 Hz and at 23 and 60 °C. It is suggested that this time dependence of the mechanical loss factor is associated with the basic mechanisms responsible for the creep or relaxation process itself.     

Assessment of some iterative methods for non-symmetric linear systems arising in computational fluid dynamics

Various tests have been carried out in order to compare the performances of several methods used to solve the non-symmetric linear systems of equations arising from implicit discretizations of CFD problems, namely the scalar advection-diffusion equation and the compressible Euler equations. The iterative schemes under consideration belong to three families of algorithms: relaxation (Jacobi and Gauss-Seidel), gradient and Newton methods. Two gradient methods have been selected: a Krylov subspace iteration method (GMRES) and a non-symmetric extension of the conjugate gradient method (CGS). Finally, a quasi-Newton method has also been considered (Broyden). The aim of this paper is to provide indications of which appears to be the most adequate method according to the particular circumstances as well as to discuss the implementation aspects of each scheme.     

An iterative stabilized fractional step algorithm for numerical solution of incompressible N–S equations

Stabilized fractional step algorithm has been widely employed for numerical solution of incompressible Navier–Stokes equations. However, smaller time step sizes are required to use for existing explicit and semi‐implicit versions of the algorithm due to their fully or partially explicit nature particularly for highly viscous flow problems. The purpose of this paper is to present two modified versions of the fractional step algorithm using characteristic based split and Taylor–Galerkin like based split. The proposed modified versions of the algorithm are based on introducing an iterative procedure into the algorithm and allow much larger time step sizes than those required to the preceding ones. A numerical study of stability at acceptable convergence rate and accuracy as well as capability in circumventing the restriction imposed by the LBB condition for the proposed iterative versions of the algorithm is carried out with the plane Poisseuille flow problem under different Reynolds numbers ranging from low to high viscosities. Numerical experiments in the plane Poisseuille flow and the lid‐driven cavity flow problems demonstrate the improved performance of the proposed versions of the algorithm, which are further applied to numerical simulation of the polymer injection moulding process. Copyright © 2005 John Wiley & Sons, Ltd.     

AN ITERATIVE METHOD FOR THE DISCRETE PROBLEMS OF A CLASS OF ELLIPTICAL VARIATIONAL INEQUALITIES

ＡＮＩＴＥＲＡＴＩＶＥＭＥＴＨＯＤＦＯＲＴＨＥＤＩＳＣＲＥＴＥＰＲＯＢＬＥＭＳＯＦＡＣＬＡＳＳＯＦＥＬＬＩＰＴＩＣＡＬＶＡＲＩＡＴＩＯＮＡＬＩＮＥＱＵＡＬＩＴＩＥＳＺｈｅｎｇＴｉｅ－ｓｈｅｎｓ（郑铁生）ＬｉＬｉ（李立）ＸｕＱｉｎｇ－ｙｕ（许庆余）（Ｄ...     

On the use of stretched-exponential functions for both linear viscoelastic creep and stress relaxation

The use of the stretched-exponential function to represent both the relaxation function g(t)=(G(t)-G _∞)/(G ₀-G _∞) and the retardation function r(t) = (J _∞+t/η-J(t))/(J _∞-J ₀) of linear viscoelasticity for a given material is investigated. That is, if g(t) is given by exp (?(t/τ)^β), can r(t) be represented as exp (?(t/λ)^µ) for a linear viscoelastic fluid or solid? Here J(t) is the creep compliance, G(t) is the shear modulus, η is the viscosity (η^?1 is finite for a fluid and zero for a solid), G _∞ is the equilibrium modulus G _e for a solid or zero for a fluid, J _∞ is 1/G _e for a solid or the steady-state recoverable compliance for a fluid, G ₀= 1/J ₀ is the instantaneous modulus, and t is the time. It is concluded that g(t) and r(t) cannot both exactly by stretched-exponential functions for a given material. Nevertheless, it is found that both g(t) and r(t) can be approximately represented by stretched-exponential functions for the special case of a fluid with exponents β=µ in the range 0.5 to 0.6, with the correspondence being very close with β=µ=0.5 and λ=2τ. Otherwise, the functions g(t) and r(t) differ, with the deviation being marked for solids. The possible application of a stretched-exponential to represent r(t) for a critical gel is discussed.