scientific article; zbMATH DE number 3300288
From MaRDI portal
Publication:5582046
zbMath0188.22604MaRDI QIDQ5582046
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Degeneracy of tetrahedral partitions produced by randomly generated red refinements, Several notes on the circumradius condition., On degenerating tetrahedra resulting from red refinements of tetrahedral partitions, On the maximum angle condition for the conforming longest-edge \(n\)-section algorithm for large values of \(n\), An ``immersed finite element method based on a locally anisotropic remeshing for the incompressible Stokes problem, On degenerating finite element tetrahedral partitions, Sharp geometric requirements in the Wachspress interpolation error estimate, Improved Maximum Angle Estimate for Longest-Edge Bisection, The minimum angle condition for \(d\)-simplices, On the Use of Anisotropic Triangles with Mixed Finite Elements: Application to an “Immersed” Approach for Incompressible Flow Problems, On Equivalence of Maximum Angle Conditions for Tetrahedral Finite Element Meshes, Numerical simulation of nonlinear nonstationary processes with discontinuous characteristics of fields, A priori error estimates for Lagrange interpolation on triangles., On Mesh Regularity Conditions for Simplicial Finite Elements, On the generalization of the Synge-Křížek maximum angle condition for \(d\)-simplices, Professor Alexander Ženíšek passed away., Finite element method with local damage of the mesh, Longest-edge \(n\)-section algorithms: properties and open problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The convergence of finite element method in solving linear elastic problems
- On the finite element method
- Numerical Analysis vs. Mathematics
- Numerical solution of initial boundary value problems involving maxwell's equations in isotropic media
- Variational methods for the solution of problems of equilibrium and vibrations
- On The Computational Solution of Linear Programming Problems Involving Almost-Block-Diagonal Matrices