|
|
On mathematical modelling of gust response using the finite element method
Sváček, P. ; Horáček, Jaromír
In this paper the numerical approximation of aeroelastic response to sudden gust is presented. The fully coupled formulation of two dimensional incompressible viscous fluid flow over a flexibly supported structure is used. The flow is modelled with the system of Navier-Stokes equations written in Arbitrary Lagrangian-Eulerian form and coupled with system of ordinary differential equations describing the airfoil vibrations with two degrees of freedom. The Navier-Stokes equations are spatially discretized by the fully stabilized finite element method. The numerical results are shown.
|
|
|
On simplicial red refinement in three and higher dimensions
Korotov, S. ; Křížek, Michal
We show that in dimensions higher than two, the popular “red refinement” tech- nique, commonly used for simplicial mesh refinements and adaptivity in the finite element analysis and practice, never yields subsimplices which are all acute even for an acute father element as opposed to the two-dimensional case. In the three-dimensional case we prove that there exists only one tetrahedron that can be partitioned by red refinement into eight congruent subtetrahedra that are all similar to the original one.
|
|
| |
|
|
A direct solver for finite element matrices requiring O(N log N) memory places
Vejchodský, Tomáš
We present a method that in certain sense stores the inverse of the stiffness matrix in O(N log N) memory places, where N is the number of degrees of freedom and hence the matrix size. The setup of this storage format requires O(N^(3/2)) arithmetic operations. However, once the setup is done, the multiplication of the inverse matrix and a vector can be performed with O(N log N) operations. This approach applies to the first order finite element discretization of linear elliptic and parabolic problems in triangular domains, but it can be generalized to higher-order elements, variety of problems, and general domains. The method is based on a special hierarchical enumeration of vertices and on a hierarchical elimination of suitable degrees of freedom. Therefore, we call it hierarchical condensation of degrees of freedom.
|
host ::
RSS.