On Polya Frequency Function. III. The Positivity of Translation Determinants With an Application to the Interpolation Problem by Spline Curves

1953 ◽  
Vol 74 (2) ◽  
pp. 246 ◽  
Author(s):  
I. J. Schoenberg ◽  
Anne Whitney
Keyword(s):  
Interpolation Problem ◽  
Frequency Function ◽  
Spline Curves

scholarly journals Lidstone–Euler Second-Type Boundary Value Problems: Theoretical and Computational Tools

2021 ◽  
Vol 18 (5) ◽  
Author(s):  
Francesco Aldo Costabile ◽  
Maria Italia Gualtieri ◽  
Anna Napoli
Keyword(s):  
Boundary Value Problem ◽  
Boundary Conditions ◽  
Existence And Uniqueness ◽  
Interpolation Problem ◽  
Boundary Value ◽  
Computational Tools ◽  
Numerical Examples ◽  
Odd Order ◽  
Uniqueness Of The Solution ◽  
Type Boundary

AbstractGeneral nonlinear high odd-order differential equations with Lidstone–Euler boundary conditions of second type are treated both theoretically and computationally. First, the associated interpolation problem is considered. Then, a theorem of existence and uniqueness of the solution to the Lidstone–Euler second-type boundary value problem is given. Finally, for a numerical solution, two different approaches are illustrated and some numerical examples are included to demonstrate the validity and applicability of the proposed algorithms.

scholarly journals Chaotic Path Planning for 3D Area Coverage Using a Pseudo-Random Bit Generator from a 1D Chaotic Map

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1821
Author(s):  
Lazaros Moysis ◽  
Karthikeyan Rajagopal ◽  
Aleksandra V. Tutueva ◽  
Christos Volos ◽  
Beteley Teka ◽  
...  
Keyword(s):  
Path Planning ◽  
Chaotic Map ◽  
Dynamical Behavior ◽  
Area Coverage ◽  
Phase Portraits ◽  
Planning Strategy ◽  
Spline Curves ◽  
Key Space ◽  
Aerial Vehicle ◽  
Discrete Motion

This work proposes a one-dimensional chaotic map with a simple structure and three parameters. The phase portraits, bifurcation diagrams, and Lyapunov exponent diagrams are first plotted to study the dynamical behavior of the map. It is seen that the map exhibits areas of constant chaos with respect to all parameters. This map is then applied to the problem of pseudo-random bit generation using a simple technique to generate four bits per iteration. It is shown that the algorithm passes all statistical NIST and ENT tests, as well as shows low correlation and an acceptable key space. The generated bitstream is applied to the problem of chaotic path planning, for an autonomous robot or generally an unmanned aerial vehicle (UAV) exploring a given 3D area. The aim is to ensure efficient area coverage, while also maintaining an unpredictable motion. Numerical simulations were performed to evaluate the performance of the path planning strategy, and it is shown that the coverage percentage converges exponentially to 100% as the number of iterations increases. The discrete motion is also adapted to a smooth one through the use of B-Spline curves.

Rethinking factor analysis as an interpolation problem

Statistics ◽  
1988 ◽  
Vol 19 (3) ◽  
pp. 359-367 ◽  
Author(s):  
A. Van der linde
Keyword(s):  
Factor Analysis ◽  
Interpolation Problem

scholarly journals An interpolation problem on the circle between Lagrange and Hermite problems

2017 ◽  
Vol 215 ◽  
pp. 118-144 ◽  
Author(s):  
E. Berriochoa ◽  
A. Cachafeiro ◽  
J.M. García Amor
Keyword(s):  
Interpolation Problem
Sign in / Sign up

Export Citation Format

Share Document