圆形弹性薄板非轴对称大挠度问题的一个解法

本文建议一个求解圆形弹性薄板非轴对称大挠度问题的方法.本文以周边固定受非轴对称载荷作用下圆形薄板的大挠度问题为例阐述所述方法的原理和解题步骤.文中所述方法可以用以求解其他边界及载荷作用下圆形薄板的非轴对称大挠度问题.     

强部分逆网络流问题

Abstract. In this paper,a new model for inverse network flow problems,robust partial inverseproblem is presented. For a given partial solution,the robust partial inverse problem is to modify the coefficients optimally such that all full solutions containing the partial solution becomeoptimal under new coefficients. It has been shown that the robust partial inverse spanning treeproblem can be formulated as a combinatorial linear program,while the robust partial inverseminimum cut problem and the robust partial inverse assignment problem can be solved by combinatorial strongly polynomial algorithms.     

On an inverse linear programming problem

A method for solving the following inverse linear programming (LP) problem is proposed. For a given LP problem and one of its feasible vectors, it is required to adjust the objective function vector as little as possible so that the given vector becomes optimal. The closeness of vectors is estimated by means of the Euclidean vector norm. The inverse LP problem is reduced to a problem of unconstrained minimization for a convex piecewise quadratic function. This minimization problem is solved by means of the generalized Newton method.     

Inverse analysis of an internal reforming solid oxide fuel cell system using simplex search method

An inverse problem is solved for estimating fuel cell operating parameters such as current density, pressure and fuel flow rate (FFR) separately and then simultaneously two parameters in an internal reforming solid oxide fuel cell (IRSOFC). Initially, a mathematical model for the forward problem is developed to simulate the IRSOFC steady state operation and its performance in terms of power output and then an inverse problem is solved for recovering the above parameters using a simplex search minimization algorithm. The objective function (IRSOFC power) and the estimation accuracy are studied for the effects of initial guess values of the operating parameters and the number of iterations required for retrieval of these parameters. The objective function is represented by the sum of square of the error between a given IRSOFC power and the power evaluated based on some arbitrary guessed values of the unknowns which is then regularized in an iterative manner for solution of the inverse fuel cell problem. The study reveals that a multiple combinations of parameters (current density, operating pressure and FFR) exist which provides guidelines for selecting feasible combinations of these parameters required for meeting a given power requirement. The results show relatively good agreement between the inverse and exact solutions.     

Exact solution of a model problem of subsurface sensing

An inverse electromagnetic wave radiation problem simulating subsurface radio sensing is considered. It is assumed that synchronous external currents with unknown spatial density emerge in the subsurface medium. It is shown that their distribution can be found from the pulsed radiation waveformes measured along the border of the examined half-space. In a model formulation, the problem is reduced to the reconstruction of a 2D function from its integrals over a set of semicircles. An explicit solution of that tomographic problem is found by means of the Darboux equation. Numerical examples are given. Bibliography: 13 titles.     

Cost-efficient numerical algorithm for solving the linear inverse problem of finding a variable magnetization

The paper is devoted to developing an original cost-efficient algorithm for solving the inverse problem of finding a variable magnetization in a rectangular parallelepiped. The problem is ill-posed and is described by the integral Fredholm equation. It is shown that after discretization of the area and approximation of the integral operator, this problem is reduced to solving a system of linear algebraic equations with the Toeplitz-block-Toeplitz matrix. We have constructed the memory efficient variant of the stabilized biconjugate gradient method BiCGSTABmem. This optimized algorithm exploits the special structure of the matrix to reduce the memory requirements and computing time. The efficient implementation is developed for multicore CPU and GPU. A series of the model problems with synthetic and real magnetic data are solved. Investigation of efficiency and speedup of parallel algorithm is performed.     

An inverse problem for the acoustics equations: A multilevel adaptive algorithm

A numerical solution to an inverse problem for the acoustic equations using an optimization method for a stratified medium is presented. With the distribution of an acoustic wave field on the medium’s surface, the 1D distributions of medium’s density, as well as the velocity and absorption coefficient of the acoustic wave, are determined. Absorption in a Voigt body model is considered. The conjugate gradients and the Newton method are used for minimization. To increase the efficiency of the numerical method, a multilevel adaptive algorithm is proposed. The algorithm is based on a division of the whole procedure of solving the inverse problem into a series of consecutive levels. Each level is characterized by the number of parameters to be determined at the level. In moving from one level to another, the number of parameters changes adaptively according to the functional minimized and the convergence rate. The minimization parameters are chosen as illustrated by results of solving the inverse problem in a spectral domain, where the desired quantities are presented as Chebyshev polynomial series and minimization is carried out with respect to the coefficients of these series. The method is compared in efficiency with a nonadaptive method. The optimal parameters of the multilevel method are chosen. It is shown that the multilevel algorithm offers several advantages over the one without partitioning into levels. The algorithm produces primarily a more accurate solution to 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.     

Method for Solving the Sine-Gordon Equation in Laboratory Coordinates

By solving the direct and inverse scattering problems for a rather ‘unconventional’ eigenvalue problem, we can solve the initial value problem for the sine-Gordon equation entirely in laboratory coordinates. This allows us to extend and accurately define the class of initial value problems which can be solved by ‘inverse scattering transforms.’ Simple examples are given to illustrate both the direct and the inverse scattering methods.     

A branch and bound network approach to the canonical constrained entropy problem

In this paper, we present a branch and bound algorithm for solving the constrained entropy mathematical programming problem. Unlike other methods for solving this problem, our method solves more general problems with inequality constraints. The advantage of the proposed technique is that the relaxed problem solved at each node is a singly constrained network problem. The disadvantage is that the relaxed problem has twice as many variables as the original problem. An application to regional planning is given, and an example problem is solved.     

Two sample Bayesian prediction intervals for order statistics based on the inverse exponential-type distributions using right censored sample

In this paper, two sample Bayesian prediction intervals for order statistics (OS) are obtained. This prediction is based on a certain class of the inverse exponential-type distributions using a right censored sample. A general class of prior density functions is used and the predictive cumulative function is obtained in the two samples case. The class of the inverse exponential-type distributions includes several important distributions such the inverse Weibull distribution, the inverse Burr distribution, the loglogistic distribution, the inverse Pareto distribution and the inverse paralogistic distribution. Special cases of the inverse Weibull model such as the inverse exponential model and the inverse Rayleigh model are considered.     

Numerical solution of the Gel'fand-Levitan equation

The inverse Sturm-Liouville problem is solved by using the Gel'fand-Levitan equation. The equation is discretized by the trapezoidal rule and the problem reduced to solving a sequence of systems of linear equations. The convergence of the method is established. It is shown that the problem can be arbitrarily ill conditioned. Finally, the accuracy of the method is illustrated by two numerical examples.     

环面薄膜的膨胀失稳

本文从有限弹性理论出发对超弹性薄膜轴对称大变形问题进行了一般的数学描述.基于本文所导出的基本方程,应用打靶法数值地分析了Mooney-Rivlin型类橡胶环面薄膜的大变形膨胀失稳问题.给出了上、下极限载荷和位移载荷曲线.     

Application of Tikhonov’s regularization method to solve inverse problems for two population models

Tikhonov’s regularization method is applied to numerical solution of inverse problems for two population models. For the first model we solve the inverse problem that involves simultaneous determination of the mortality rate and the initial distribution of individuals given supplementary information on population density. For the second model we determine the growth rate of the individuals given additional information about their density. Examples of numerical solution are presented for both inverse problems. __________ Translated from Prikladnaya Matematika i Informatika, No. 23, pp. 5–14, 2006.     

Inverse unitary eigenproblems and related orthogonal functions

Summary. This paper explores the relationship between certain inverse unitary eigenvalue problems and orthogonal functions. In particular, the inverse eigenvalue problems for unitary Hessenberg matrices and for Schur parameter pencils are considered. The Szeg? recursion is known to be identical to the Arnoldi process and can be seen as an algorithm for solving an inverse unitary Hessenberg eigenvalue problem. Reformulation of this inverse unitary Hessenberg eigenvalue problem yields an inverse eigenvalue problem for Schur parameter pencils. It is shown that solving this inverse eigenvalue problem is equivalent to computing Laurent polynomials orthogonal on the unit circle. Efficient and reliable algorithms for solving the inverse unitary eigenvalue problems are given which require only O() arithmetic operations as compared with O() operations needed for algorithms that ignore the structure of the problem. Received April 3, 1995 / Revised version received August 29, 1996     

Fatigue crack growth simulations of homogeneous and bi-material interfacial cracks using element free Galerkin method

In this paper, quasi-static fatigue crack growth simulations of homogeneous and bi-material interfacial cracks have been performed using element free Galerkin method (EFGM) under mechanical as well as thermo-elastic load. The thermo-elastic fracture problem is decoupled into thermal and elastic problems. The temperature distribution obtained by solving heat conduction equation is used as input in the elastic problem to get the displacement and stress fields. Discontinuities in the temperature and displacement fields are captured by extrinsic partition of unity enrichment technique. The values of stress intensity factors have been extracted from the EFGM solution by domain based interaction integral approach. The standard Paris fatigue crack growth law has been implemented for the life estimation of various model problems. The results obtained by EFGM under mechanical and thermo-elastic loads were compared with those obtained by FEM using remeshing approach.     

An inverse model for the most uniform problem

In this paper, we consider a kind of inverse model for the most uniform problem. This model has some practical background. It is shown that the model can be solved in polynomial time whenever an associated min-sum problem can be solved in polynomial time.     

An inverse eigenvalue problem and an associated approximation problem for generalized K-centrohermitian matrices

A partially described inverse eigenvalue problem and an associated optimal approximation problem for generalized K-centrohermitian matrices are considered. It is shown under which conditions the inverse eigenproblem has a solution. An expression of its general solution is given. In case a solution of the inverse eigenproblem exists, the optimal approximation problem can be solved. The formula of its unique solution is given.