Author
Ángel Plaza
Other affiliations: University of Salamanca
Bio: Ángel Plaza is an academic researcher from University of Las Palmas de Gran Canaria. The author has contributed to research in topics: Fibonacci number & Tetrahedron. The author has an hindex of 16, co-authored 86 publications receiving 1303 citations. Previous affiliations of Ángel Plaza include University of Salamanca.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this paper, the authors introduced a general kth Fibonacci sequence that generalizes, between others, both the classic FIFO sequence and the Pell sequence, by studying the recursive application of two geometrical transformations used in the well-known 4TLE partition.
Abstract: We introduce a general Fibonacci sequence that generalizes, between others, both the classic Fibonacci sequence and the Pell sequence. These general kth Fibonacci numbers { F k , n } n = 0 ∞ were found by studying the recursive application of two geometrical transformations used in the well-known four-triangle longest-edge (4TLE) partition. Many properties of these numbers are deduce directly from elementary matrix algebra.
280 citations
TL;DR: In this paper, the general k-Fibonacci sequence was found by studying the recursive application of two geometrical transformations used in the well-known 4-triangle longest-edge partition.
Abstract: The general k-Fibonacci sequence { F k , n } n = 0 ∞ were found by studying the recursive application of two geometrical transformations used in the well-known 4-triangle longest-edge (4TLE) partition. This sequence generalizes, between others, both the classical Fibonacci sequence and the Pell sequence. In this paper many properties of these numbers are deduced and related with the so-called Pascal 2-triangle.
205 citations
TL;DR: In this paper, the derivatives of k-Fibonacci polynomials are presented in the form of convolution of KF-FBNs and their properties admit a straightforward proof.
Abstract: The k-Fibonacci polynomials are the natural extension of the k-Fibonacci numbers and many of their properties admit a straightforward proof. Here in particular, we present the derivatives of these polynomials in the form of convolution of k-Fibonacci polynomials. This fact allows us to present in an easy form a family of integer sequences in a new and direct way. Many relations for the derivatives of Fibonacci polynomials are proven. � 2007 Elsevier Ltd. All rights reserved.
122 citations
TL;DR: A novel approach to the development of a class of local simplicial refinement strategies and the numerical results obtained appear to confirm that the measure of degeneracy of subtetrahedra is bounded, and converges asymptotically to a fixed value when the refinement proceeds.
101 citations
TL;DR: The sums of k-Fibonacci numbers with indexes in an arithmetic sequence, say an þ r for fixed integers a and r, are studied to give in a straightforward way several formulas for the sums of such numbers.
54 citations
Cited by
More filters
DOI•
07 Dec 2015
TL;DR: The FEniCS Project is a collaborative project for the development of innovative concepts and tools for automated scientific computing, with a particular focus on the solution of differential equations by finite element methods.
Abstract: The FEniCS Project is a collaborative project for the development of innovative concepts and tools for automated scientific computing, with a particular focus on the solution of differential equations by finite element methods. The FEniCS Projects software consists of a collection of interoperable software components, including DOLFIN, FFC, FIAT, Instant, UFC, UFL, and mshr. This note describes the new features and changes introduced in the release of FEniCS version 1.5.
1,628 citations
TL;DR: The main goals of this article are to provide a basic reference source that describes libMesh and the underlying philosophy and software design approach, and to give sufficient detail and references on the adaptive mesh refinement and coarsening (AMR/C) scheme for applications analysts and developers.
Abstract: In this paper we describe the libMesh (http://libmesh.sourceforge.net) framework for parallel adaptive finite element applications. libMesh is an open-source software library that has been developed to facilitate serial and parallel simulation of multiscale, multiphysics applications using adaptive mesh refinement and coarsening strategies. The main software development is being carried out in the CFDLab (http://cfdlab.ae.utexas.edu) at the University of Texas, but as with other open-source software projects; contributions are being made elsewhere in the US and abroad. The main goals of this article are: (1) to provide a basic reference source that describes libMesh and the underlying philosophy and software design approach; (2) to give sufficient detail and references on the adaptive mesh refinement and coarsening (AMR/C) scheme for applications analysts and developers; and (3) to describe the parallel implementation and data structures with supporting discussion of domain decomposition, message passing, and details related to dynamic repartitioning for parallel AMR/C. Other aspects related to C++ programming paradigms, reusability for diverse applications, adaptive modeling, physics-independent error indicators, and similar concepts are briefly discussed. Finally, results from some applications using the library are presented and areas of future research are discussed.
761 citations
01 Jan 2010
TL;DR: The work is giving estimations of the discrepancy between solutions of the initial and the homogenized problems for a one{dimensional second order elliptic operators with random coeecients satisfying strong or uniform mixing conditions by introducing graphs representing the domain of integration of the integrals in each term.
Abstract: The work is giving estimations of the discrepancy between solutions of the initial and the homogenized problems for a one{dimensional second order elliptic operators with random coeecients satisfying strong or uniform mixing conditions. We obtain several sharp estimates in terms of the corresponding mixing coeecient. Abstract. In the theory of homogenisation it is of particular interest to determine the classes of problems which are stable on taking the homogenisation limits. A notable situation where the limit enlarges the class of original problems is known as memory (nonlocal) eeects. A number of results in that direction has been obtained for linear problems. Tartar (1990) innitiated the study of the eeective equation corresponding to nonlinear equation: @ t u n + a n u 2 n = f: Signiicant progress has been hampered by the complexity of required computations needed in order to obtain the terms in power{series expansion. We propose a method which overcomes that diiculty by introducing graphs representing the domain of integration of the integrals in each term. The graphs are relatively simple, it is easy to calculate with them and they give us a clear image of the form of each term. The method allows us to discuss the form of the eeective equation and the convergence of power{series expansions. The feasibility of our method for other types of nonlinearities will be discussed as well.
550 citations
TL;DR: In this paper, the authors introduced a general kth Fibonacci sequence that generalizes, between others, both the classic FIFO sequence and the Pell sequence, by studying the recursive application of two geometrical transformations used in the well-known 4TLE partition.
Abstract: We introduce a general Fibonacci sequence that generalizes, between others, both the classic Fibonacci sequence and the Pell sequence. These general kth Fibonacci numbers { F k , n } n = 0 ∞ were found by studying the recursive application of two geometrical transformations used in the well-known four-triangle longest-edge (4TLE) partition. Many properties of these numbers are deduce directly from elementary matrix algebra.
280 citations
TL;DR: In this paper, the general k-Fibonacci sequence was found by studying the recursive application of two geometrical transformations used in the well-known 4-triangle longest-edge partition.
Abstract: The general k-Fibonacci sequence { F k , n } n = 0 ∞ were found by studying the recursive application of two geometrical transformations used in the well-known 4-triangle longest-edge (4TLE) partition. This sequence generalizes, between others, both the classical Fibonacci sequence and the Pell sequence. In this paper many properties of these numbers are deduced and related with the so-called Pascal 2-triangle.
205 citations