Strongly coupling of partitioned fluid–solid interaction solvers using reduced-order models

In this work a powerful technique is described which allows the implicit coupling of partitioned solvers in fluid–structure interaction (FSI) problems. The flow under consideration is governed by the Navier–Stokes equations for incompressible viscous fluids and modeled with the finite volume method. The structure is represented by a finite element formulation. The method allows the use of a black box fluid and structural solver because it builds up a reduced order model of the fluid and structural problem during the coupling process. Each solution of the fluid/structural solver in the coupling process can be seen as a sensitivity response of an applied displacement/pressure mode. The applied modes and their responses are used to build up a reduced-order model. The proposed model is used to predict the unsteady flow fields of a particular flow-induced vibrational phenomenon – a fixed cubic rigid body is submerged in an incompressible fluid flow (water), an elastic plate is attached to the rigid body in the centre of the downstream face, and the vortices, which separate from the corners of the rigid body upstream, generate lift forces which excite continuous oscillations of the elastic plate downstream. The computational results show that a fairly good convergence solution is achieved by using the reduced-order model that is based on only a few displacement and stress modes, which largely reduces the computational cost, compared with traditional approaches. At the same time, comparison of the numerical results of the model with available experimental data validates the methodology and assesses its accuracy.     

Graphical operations on projective spaces

Motivated by the work of Crapo and Rota [6] on the lifting of a projective complex, we introduce a class of invariant operations associated to integral-weighted graphs, which we call graphical operations. Such operations generalize the sixth harmonic of a quadranguler set on a projective line. We determine the expansion of the graphical operations in terms of multi-linear bracket polynomials in a Grassmann-Cayley algebra. Reducibility and compositions of such invariant operations are also investigated with a number of examples.Supported by Courant Instructorship, New York University.     

Cutting planes for mixed-integer knapsack polyhedra

An algorithm for generating cutting planes for mixed-integer knapsack polyhedra is described. The algorithm represents an exact separation procedure and is based on a general methodology proposed by one of the authors in an earlier paper. Computational results are presented. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.     

Finding Postal Carrier Walk Paths in Mixed Graphs

The postman problem requires finding a lowest cost tour in a connected graph that traverses each edge at least once. In this paper we first give a brief survey of the literature on postman problems including, the original Chinese postman problem on undirected graphs, the windy Chinese postman problem on graphs where the cost of an arc depends on the direction the arc is transversed, the directed postman problem on graphs with directed edges, and the mixed postman problem on graphs in which there are some directed and some undirected arcs.We show how the mixed postman problem can be solved as an integer program, using the formulation of Gendreau, Laporte and Zhao, by a new row addition branch and bound algorithm, which is a modification of the column subtraction algorithm for set partitioning problems of Harche and Thompson. Computational experience shows that a slack variable heuristic is very effective in finding good solutions that are frequently optimal for these problems.     

Blocking analysis andT(1) theorem

TheT(1) theorem with a weak condition on the distribution kernel is proved by using a new method—blocking analysis. It improves a result of Meyer’s. Project supported by the National Natural Science Foundation of China (Grant No. 19631080) and the Foundation of Advanced Research Center, Zhongshan University.     

ASYMPTOTIC ERROR EXPANSION AND DEFECT CORRECTION FOR SOBOLEV AND VISCOELASTICITY TYPE EQUATIONS

1.IntroductionLetObearectangulardomain.WeareconcernedwiththeRichardsonextrapolationanddefectcorrectionofthefiniteelementapproximationstothesolutionsofthefollowingsimpleSobolevtypeequationandviscoelasticitytypeequationTheextrapolationtechniqueusedforthefin…     

轴对称问题的Wilson四边形单元

给出了一族轴对称问题的改进Ｗｉｌｓｏｎ元，利用强分片检验证明了其收敛性，讨论了单元函数结构·从而给出了一种构造收敛的轴对称非协调元方法·     

受L\''evy噪声扰动的Logistic方程的全局吸引性

本文考虑了受L\''evy噪声扰动的Logistic方程. 在合适的条件下, 我们得到了解的全局存在性与唯一性; 我们证明了当初始值小于环境的容纳量时, 唯一的正的平衡态具有全局吸引性.     

代数函数域上的局部恢复码

假设C是有限域Fq上的[n,k]线性码,如果码字的每个坐标是其它至多r个坐标的函数,称C是(n,k,r)线性码,这里r是较小的数.本文在代数函数域上构造出了局部恢复码,它的码长不受字符集大小的限制,实际上,它的码长可以远远大于字符集的大小;并将此方法应用于广义Hermite函数域,得到了一类广义Hermite函数域上的...     

Convergence of the viscosity solution of non-autonomous Hamilton-Jacobi equations

In this paper,we investigate the non-autonomous Hamilton-Jacobi equation ■ where H is 1-periodic with respect to t and M is a compact Riemannian manifold without boundary.We obtain the viscosity solution denoted by T_(t_0)~tφ(x) and show T_(t_0)~tφ(x) converges uniformly to a time-periodic viscosity solution u~*(x,t) of ?_tu+H(t,x,?_xu,u)=0.