Results 71 to 80 of about 5,897 (225)
The connection problem for orthogonal polynomials is, given a polynomial expressed in the basis of one set of orthogonal polynomials, computing the coefficients with respect to a different set of orthogonal polynomials.
Tom Bella, Jenna Reis
doaj +1 more source
Optimal Gain Selection for the Arbitrary‐Order Homogeneous Differentiator
ABSTRACT Differentiation of noisy signals is a relevant and challenging task. Widespread approaches are the linear high‐gain observer acting as a differentiator and Levant's robust exact differentiator with a discontinuous right‐hand side. We consider the family of arbitrary‐order homogeneous differentiators, which includes these special cases.
Benjamin Calmbach +2 more
wiley +1 more source
The Hahn-Exton q-Bessel function as the characteristic function of a Jacobi matrix
A family T(ν), ν ∈ ℝ, of semiinfinite positive Jacobi matrices is introduced with matrix entries takenfrom the Hahn-Exton q-difference equation. The corresponding matrix operators defined on the linear hullof the canonical basis in ℓ2(ℤ+) are essentially
Štampach F., Šťovíček P.
doaj +1 more source
An operational approach for solving fractional pantograph differential equation [PDF]
The aim of the current paper is to construct the shifted fractional-order Jacobi functions (SFJFs) based on the Jacobi polynomials to numerically solve the fractional-order pantograph differential equations. To achieve this purpose, first the operational
H. Ebrahimi, K. Sadri
doaj +1 more source
Key Technical Fields and Future Outlooks of Space Manipulators: A Survey
This paper systematically reviews the technological development of space manipulators, emphasizing the unique challenges posed by space environments. It examines four areas: structural design, modeling, planning, and control, while introducing typical ground test platforms.
Gang Chen +12 more
wiley +1 more source
Hamilton–Jacobi equations for finite-rank matrix inference [PDF]
We compute the large-scale limit of the free energy associated with the problem of inference of a finite-rank matrix. The method follows the principle put forward in arXiv:1811.01432 which consists in identifying a suitable Hamilton-Jacobi equation satisfied by the limit free energy.
openaire +4 more sources
Establishing Shape Correspondences: A Survey
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley +1 more source
A Scalable Architecture For Hardware Acceleration of Large Sparse Matrix Calculations [PDF]
The task of implementing the Jacobi method has been looked at from several research works over the years. The Jacobi method is considered the most ideal Iterative method for implementation on FPGAs because of its inherent parallelism and lack of data ...
Hamlett, Matthew Issiah
core
Convergence of Object Focused Simultaneous Estimation of Optical Flow and State Dynamics
The purpose of this study is to prove the convergence of the simultaneous estimation of the optical flow and object state (SEOS) method. The SEOS method utilizes dynamic object parameter information when calculating optical flow in tracking a moving ...
Nicholas Bauer +3 more
doaj +1 more source
Inversion of Jacobi's tridiagonal matrix
Explicit formulae are given for the elements of the inverse of a tridiagonal matrix (symmetric or not). The expressions contain elements of the original matrix, determinants of its principal minors and a related sequence of quantities defined inductively from the elements of the original matrix.
openaire +2 more sources

