We introduce a general Fibonacci sequence that generalizes, between others, both the
classic Fibonacci sequence and the Pell sequence. These general kth Fibonacci numbers …

Sparse matrixlization, an innovative programming style for MATLAB, is introduced and used
to develop an efficient software package, iFEM, on adaptive finite element methods. In this …

In this paper I introduce a new mathematical tool for dealing with the refinement and/or the
improvement of unstructured triangulations: the Longest‐Edge Propagation Path associated …

Current formulations of adaptive finite element mesh refinement seem simple enough, but
their implementations prove to be a formidable task. We offer an alternative point of …

We give an overview of multilevel methods, such as V-cycle multigrid and BPX
preconditioner, for solving various partial differential equations (including H (grad), H (curl) …

In this paper we discuss, study and compare two linear algorithms for the triangulation
refinement problem: the known longest‐side (triangle bisection) refinement algorithm, as …

The terminal-edge Delaunay algorithm, initially called Lepp–Delaunay algorithm, deals with
the construction of size-optimal (adapted to the geometry) quality triangulation of complex …

ABSTRACT The 8-tetrahedra longest-edge (8T-LE) partition of any tetrahedron is defined in
terms of three consecutive edge bisections, the first one performed by the longest-edge. The …

The finite element method usually requires regular or strongly regular families of partitions in
order to get guaranteed a priori or a posteriori error estimates. In this paper we examine the …

The triangulation refinement problem, as formulated in the adaptive finite element setting
(also useful in the rendering of complex scenes), is discussed. This can be formulated as …