用3个向量对构造梁振动系统的刚度矩阵

针对梁的离散化模型的刚度矩阵是五对角矩阵,梁振动反问题的实质是实对称五对角矩阵的特征值反问题.该文利用向量对、Moore-Penrose广义逆给出了实对称五对角矩阵向量对反问题存在唯一解的条件,并结合矩阵分块讨论了双对称五对角矩阵向量对反问题解存在唯一的条件,进而计算了次对角线位置元素为负,其它位置元素均为正的实对称五对角矩阵特征值反问题.由于构造梁的离散模型需要的数据可由测试得到,故而其结果适合于模态分析、系统结构的分析与设计等方面应用.最后给出了数值算例,通过数值讨论说明方法的有效性.     

A smoothing Newton's method for the construction of a damped vibrating system from noisy test eigendata

In this paper we consider an inverse problem for a damped vibration system from the noisy measured eigendata, where the mass, damping, and stiffness matrices are all symmetric positive‐definite matrices with the mass matrix being diagonal and the damping and stiffness matrices being tridiagonal. To take into consideration the noise in the data, the problem is formulated as a convex optimization problem involving quadratic constraints on the unknown mass, damping, and stiffness parameters. Then we propose a smoothing Newton‐type algorithm for the optimization problem, which improves a pre‐existing estimate of a solution to the inverse problem. We show that the proposed method converges both globally and quadratically. Numerical examples are also given to demonstrate the efficiency of our method. Copyright © 2008 John Wiley & Sons, Ltd.     

A wavelets method for plane elasticity problem

A Neumann boundary value problem of plane elasticity problem in the exterior circular domain is reduced into an equivalent natural boundary integral equation and a Poisson integral formula with the DtN method. Using the trigonometric wavelets and Galerkin method, we obtain a fast numerical method for the natural boundary integral equation which has an unique solution in the quotient space. We decompose the stiffness matrix in our numerical method into four circulant and symmetrical or antisymmetrical submatrices, and hence the solution of the associated linear algebraic system can be solved with the fast Fourier transform (FFT) and the inverse fast Fourier transform (IFFT) instead of the inverse matrix. Examples are given for demonstrating our method has good accuracy of our method even though the exact solution is almost singular.     

The inverse eigenvalue problem for symmetric quasi anti-bidiagonal matrices

In this paper we construct the symmetric quasi anti-bidiagonal matrix that its eigenvalues are given, and show that the problem is also equivalent to the inverse eigenvalue problem for a certain symmetric tridiagonal matrix which has the same eigenvalues. Not only elements of the tridiagonal matrix come from quasi anti-bidiagonal matrix, but also the places of elements exchange based on some conditions.     

有限元模型修正中的最佳矩阵逼近

1引言 在飞行器、船舶、桥梁等结构设计中,要定量、准确地进行结构动力学分析,解决飞行器、船舶、桥梁等工程结构中普遍存在的振动问题,首先必须建立结构的动力学模型.     

Static reanalysis of discrete elastic structures with reflexive inverse

This paper presents a direct method for the static reanalysis of structures. We use the concept of the reflexive inverse in the sense of Moore–Penrose generalized inverse to express a general solution of discrete systems without any boundary condition. We use a simple decomposition of the stiffness matrix to avoid its inversion. We give a comparison of the processing time of this method with the duration of a complete analysis with finite elements. The reanalysis of the stiffness is based on the mixed conditions linking displacements and related efforts. In the second part we concentrate on this reanalysis and we give as an application the reanalysis of the geometry and the reanalysis for mesh refining.This method is general, enabling the reanalysis of structures with variation of the boundary conditions in loading and displacement. It also enables reanalysis of the structural stiffness and makes it possible to add or remove structural elements. It can easily be applied to the study of nonlinear behavior (case of damaging, plasticity, nonlinear elasticity…).     

The Inverse Problem Method on the Half-Line and a Nested System of Riccati Equations

A mixed problem for the nonlinear Bogoyavlenskii system on the half-line is studied by the inverse problem method. The solution of the mixed problem is reduced to the solution of the inverse spectral problem of recovering a forth-order differential operator on the half-line from the Weyl matrix. We derive evolution equations for the elements of the Weyl matrix and give an algorithm for the solution of the mixed problem. Evolution equations of the elements of the Weyl matrix are nonlinear. It is shown that they can be reduced to a nested system of three successively solvable matrix Riccati equations.     

约束矩阵方程的中心对称解及其在振动理论反问题中的应用

研究了中心主子矩阵约束下矩阵方程的中心对称解. 利用矩阵向量化、Kronecker乘积及奇异值分解方法,得到了有解的充分必要条件及解的一般表达形式．同时,考虑了与之相关的对任意给定矩阵的最佳逼近问题．进而,给出在振动理论反问题中的应用, 利用截断的主质量矩阵（或主刚度矩阵）、截断模态矩阵以及质量矩阵（或刚度矩阵）的中心主子阵,求系统的质量矩阵（或刚度矩阵）．最后用两个例子说明文中方法的有效性.     

Properties of the inverses of a set of band matrices

Those regions where the elements of the inverse of a Toeplitz matrix of band width four and order nalternate in sign are determined. A similar result concerning the elements of the inverse of a commonly occurring symmetric positive definite Toeplitz matrix of band width five and order nis extended to cover the case when the first and last rows of the matrix are modified through a change in the boundary conditions of the associated application. A method for economically obtaining the infinity norm of the pent-diagonal symmetric positive definite Toeplitz matrix is then derived.     

Dual approaches to finite element model updating

The problem of finding the least change adjustment to a stiffness matrix modeled by finite element method is considered in this paper. Desired stiffness matrix properties such as symmetry, sparsity, positive semidefiniteness, and satisfaction of the characteristic equation are imposed as side constraints of the constructed optimal matrix approximation for updating the stiffness matrix, which matches measured data better. The dual problems of the original constrained minimization are presented and solved by subgradient algorithms with different line search strategies. Some numerical results are included to illustrate the performance and application of the proposed methods.     

Sufficient conditions for the solubility of inverse eigenvalue problems

We define an inverse eigenvalue problem, which contains as special cases the classical additive and multiplicative inverse eigenvalue problems. Using some results on the distance of eigenvalues from matrix diagonal elements and Brouwer's fixed-point theorem, we give sufficient conditions for the solubility of the problem.     

A fast numerical method for harmonic equation based on natural boundary integral

Based on the coupling of the natural boundary integral method and the finite elements method, we mainly investigate the numerical solution of Neumann problem of harmonic equation in an exterior elliptic. Using our trigonometric wavelets and Galerkin method, there obtained stiffness matrix is symmetrical and circulant, which lead us to a fast numerical method based on fast Fourier transform. Furthermore, we do not need to compute the entries of the stiffness matrix. On the other hand, we prove that the numerical solution possesses exponential convergence rate. Especially, examples state that our method still has good accuracy for small j when the solution u ₀(θ) is almost singular.     

三维电阻抗成像的体积元方法的数值模拟和分析

电阻抗成像是一类椭圆方程反问题,本文在三维区域上对其进行数值模拟和分析.对于椭圆方程Neumann边值正问题,本文提出了四面体单元上的一类对称体积元格式,并证明了格式的半正定性及解的存在性;引入单元形状矩阵的概念,简化了系数矩阵的计算;提出了对电阻率进行拼接逼近的方法来降低反问题求解规模,使之与正问题的求解规模相匹配;导出了误差泛函的Jacobi矩阵的计算公式,利用体积元格式的对称性和特殊的电流基向量,将每次迭代中需要求解的正问题的个数降到最低.一系列数值实验的结果验证了数学模型的可靠性和算法的可行性.本文所提出的这些方法,已成功应用于三维电阻抗成像的实际数值模拟.     

Discretization by finite elements of a model parameter dependent problem

The discretization by finite elements of a model variational problem for a clamped loaded beam is studied with emphasis on the effect of the beam thickness, which appears as a parameter in the problem, on the accuracy. It is shown that the approximation achieved by a standard finite element method degenerates for thin beams. In contrast a large family of mixed finite element methods are shown to yield quasioptimal approximation independent of the thickness parameter. The most useful of these methods may be realized by replacing the integrals appearing in the stiffness matrix of the standard method by Gauss quadratures.     

On some issues related to the moment problem for the band matrices with operator elements

The connection between the classical moment problem and the spectral theory of second order difference operators (or Jacobi matrices) is a thoroughly studied topic. Here we examine a similar connection in the case of the second order operator replaced by an operator generated by an infinite band matrix with operator elements. For such operators, we obtain an analog of the Stone theorem and consider the inverse spectral problem which amounts to restoring the operator from the moment sequence of its Weyl matrix. We establish the solvability criterion for such problems, find the conditions ensuring that the elements of the moment sequence admit an integral representation with respect to an operator valued measure and discuss an algorithm for the recovery of the operator. We also indicate a connection between the inverse problem method and the Hermite-Padé approximations.     

A high order discontinuous Galerkin Nitsche method for elliptic problems with fictitious boundary

We present a discontinuous Galerkin method, based on the classical method of Nitsche, for elliptic problems with an immersed boundary representation on a structured grid. In such methods very small elements typically occur at the boundary, leading to breakdown of the discrete coercivity as well as numerical instabilities. In this work we propose a method that avoids using very small elements on the boundary by associating them to a neighboring element with a sufficiently large intersection with the domain. This construction allows us to prove the crucial inverse inequality that leads to a coercive bilinear form and as a consequence we obtain optimal order a priori error estimates. Furthermore, we prove a bound of the condition number of the stiffness matrix. All the results are valid for polynomials of arbitrary order. We also discuss the implementation of the method and present numerical examples in three dimensions.     

Trigonometric wavelet method for some elliptic boundary value problems

In this paper, we apply trigonometric wavelet method to investigate the numerical solution of elliptic boundary value problem in an exterior unit disk. The simple computation formulae of the entries in the stiffness matrix are obtained. It shows that we only need to compute 2(j²+1) elements of one ²j+2ײj+2 stiffness matrix. Moreover, the error estimates of the approximation solutions are given and some test examples are presented.     

MULTI-SCALE METHODS FOR INVERSE MODELING IN 1-D MOS CAPACITOR

In this paper,we investigate multi-scale methods for the inverse modeling in 1-D Metal-Oxide-Silicon(MOS) capactior,First,the mathematical model of the device is given and the numerical simulation for the forward problem of the model is implemented using finite element method with adaptive moving mesh. Then numerical analysis of these parameters in the model for the inverse problems is presented .Some matrix analysis tools are applied to explore the parameters‘ sensitivities,And thired,the parameters are extracted using Levenberg-Marquardt optimization method.The essential difficulty arises from the effect of multi-scale physical differeence of the parameters.We explore the relationship between the parameters‘ sensitivitites and the sequencs for optimization,which can seriously affect the final inverse modeling results.An optimal sequence can efficiently overcome the multip-scale problem of these parameters,Numerical experiments show the efficiency of the proposed methods.     

A Riemannian variant of the Fletcher–Reeves conjugate gradient method for stochastic inverse eigenvalue problems with partial eigendata

In this paper, we focus on the stochastic inverse eigenvalue problem with partial eigendata of constructing a stochastic matrix from the prescribed partial eigendata. A Riemannian variant of the Fletcher–Reeves conjugate gradient method is proposed for solving a general unconstrained minimization problem on a Riemannian manifold, and the corresponding global convergence is established under some assumptions. Then, we reformulate the inverse problem as a nonlinear least squares problem over a matrix oblique manifold, and the application of the proposed geometric method to the nonlinear least squares problem is investigated. The proposed geometric method is also applied to the case of prescribed entries and the case of column stochastic matrix. Finally, some numerical tests are reported to illustrate that the proposed geometric method is effective for solving the inverse problem.     

Efficient numerical algorithm for solving the gravimetry problem of finding a lateral density in a layer: Parallel implementation

The paper is devoted to developing the new time- and memory-efficient algorithm BiCGSTABmem for solving the inverse gravimetry problem of determination of a variable density in a layer using the gravitational data. The problem is in solving the linear Fredholm integral equation of the first kind. After discretization of the domain and approximation of the integral operator, this problem is reduced to solving a large system of linear algebraic equations. It is shown that the matrix of coefficients is the Toeplitz-block-Toeplitz one in the case of the horizontal layer. For calculating and storing the elements of this matrix, we construct an efficient method, which significantly reduces the required memory and time. For the case of the curvilinear layer, we construct a method for approximating the parts of the matrix by a Toeplitz-block-Toeplitz one. This allows us to exploit the same efficient method for storing and processing the coefficient matrix in the case of a curvilinear layer. To solve the system of linear equations, we constructed the parallel algorithm on the basis of the stabilized biconjugated gradient method with using the Toeplitz-block-Toeplitz structure of the matrix. We implemented the BiCGSTAB and BiCGSTABmem algorithms for the Uran cluster supercomputer using the hybrid MPI + OpenMP technology. A model problem with synthetic data was solved for a large grid. It was shown that the new BiCGSTABmem algorithm reduces the computation time in comparison with the BiCGSTAB. Scalability of the parallel algorithm was studied.