Results 31 to 40 of about 316 (181)
High-resolution X-ray scanning with a diffuse Huffman-patterned probe to reduce radiation damage. [PDF]
This paper introduces high‐resolution imaging using diffuse probes, which allow for lower energy deposition per unit area per unit time, by encoding Huffman‐like patterns onto them, enabling a tighter impulse response. The approach, demonstrated in X‐ray imaging, involves using specially fabricated masks to shape the probe and recover sharp object ...
Aminzadeh A +5 more
europepmc +2 more sources
Melham's sums for some Lucas polynomial sequences [PDF]
A Lucas polynomial sequence is a pair of generalized polynomial sequences that satisfy the Lucas recurrence relation. Special cases include Fibonacci polynomials, Lucas polynomials, and Balancing polynomials.
Chan-Liang Chung, Chunmei Zhong
doaj +1 more source
On quaternion-Gaussian Fibonacci polynomials
Summary: In this paper, we define Gaussian Fibonacci quaternion polynomials and Gaussian Lucas quaternion polynomials. We also investigate some properties of these quaternion polynomials.
openaire +3 more sources
Fibonacci Operational Matrix Algorithm For Solving Differential Equations Of Lane-Emden Type
The aim of this study is presentan effective and correct technique for solving differential equations ofLane-Emden type as initial value problems. In this work, a numerical method namedas the Fibonacci polynomial approximation method, for the approximate
Musa Çakmak
doaj +1 more source
Fibonacci, tribonacci, …, hexanacci and parallel “error-free” machine arithmetic [PDF]
The paper proposes a new method of synthesis of machine arithmetic systems for “error-free” parallel computations. The difference of the proposed approach from calculations in traditional Residue Number Systems (RNS) for the direct sum of rings is the ...
Vladimir Chernov
doaj +1 more source
Note on some representations of general solutions to homogeneous linear difference equations
It is known that every solution to the second-order difference equation x n = x n − 1 + x n − 2 = 0 $x_{n}=x_{n-1}+x_{n-2}=0$ , n ≥ 2 $n\ge 2$ , can be written in the following form x n = x 0 f n − 1 + x 1 f n $x_{n}=x_{0}f_{n-1}+x_{1}f_{n}$ , where f n $
Stevo Stević +3 more
doaj +1 more source
Fibonacci self-reciprocal polynomials and Fibonacci permutation polynomials
20 pages, a section on self-reciprocal polynomials added, the first moment and second moment (q even) of Fibonacci polynomials ...
Fernando, Neranga, Rashid, Mohammad
openaire +2 more sources
AI in Neurology: Everything, Everywhere, All at Once Part 1: Principles and Practice. [PDF]
Artificial intelligence (AI) is rapidly transforming healthcare, yet it often remains opaque to clinicians, scientists, and patients alike. This review, part 1 of a 3‐part series, provides neurologists and neuroscientists with a foundational understanding of AI's key concepts, terminology, and applications.
Rizzo M, Dawson JD.
europepmc +2 more sources
Herein, two numerical algorithms for solving some linear and nonlinear fractional-order differential equations are presented and analyzed. For this purpose, a novel operational matrix of fractional-order derivatives of Fibonacci polynomials was ...
Waleed M. Abd-Elhameed +1 more
doaj +1 more source
Some fundamental Fibonacci number congruences [PDF]
This paper investigates a number of congruence properties related to the coefficients of a generalized Fibonacci polynomial. This polynomial was defined to produce properties comparable with those of the standard polynomials of some special functions ...
Anthony G. Shannon +3 more
doaj +1 more source

