Reprint

Polynomial Sequences and Their Applications

Edited by
March 2024
326 pages
  • ISBN978-3-7258-0191-6 (Hardback)
  • ISBN978-3-7258-0192-3 (PDF)

This book is a reprint of the Special Issue Polynomial Sequences and Their Applications that was published in

Computer Science & Mathematics
Engineering
Physical Sciences
Public Health & Healthcare
Summary

The present reprint contains the articles accepted and published in the Special Issue “Polynomial Sequences and Their Applications” of the MDPI journal Mathematics. This reprint aims to present, albeit partially, the state of the art on the theory and application of polynomial sequences. Polynomials are incredibly useful mathematical tools, as they are simply defined and can be calculated quickly on computer systems. They can be differentiated and integrated easily and can be pieced together to form spline curves. Sequences of polynomials perform an important role in several branches of science, including mathematics, physics, and engineering. This volume contains both theoretical works and practical applications in the field of polynomial sequences and their applications.

Format
  • Hardback
License and Copyright
© 2022 by the authors; CC BY-NC-ND license
Keywords
polyexponential function; Fubini polynomials; poly-Fubini polynomials; unipoly function; Stirling numbers; formal power series; composition of generation functions; bivariate generating function; composita; explicit formula; orthogonal polynomials; Meixner; perturbed Meixner–Pollaczek; moments; recurrence coefficients; difference equations; differential equations; zeros; Polynomial sequences; Appell polynomials; bivariate Appell sequence; orthogonal polynomials; extrapolation methods; Padé approximation; continued fractions; rational interpolation; complex analysis; software; abstract algebra; Jacobi polynomials; generalized hypergeometric functions; Chebyshev polynomials; linearization coefficients; connection formulas; moments formulas; symbolic computation; Riccati differential equation; tau method; polynomial computability; p-computability; Gandy’s fixed point theorem; semantic programming; polynomial operators; Δ0p; computer science; block cyclic reduction; block tridiagonal matrix; characteristic polynomial; linear system; Chebyshev polynomials; Chebyshev interpolation operator; the Legendre norm; Legendre–Chebyshev spectral method; Clenshaw–Curtis quadrature; multidomain; multi-dimensions; polynomiality; polynomial function; polynomial algorithm; Turing machine; logical programming language; semantic programming; smart contract; blockchain; AI; ordinary differential equations; fractional differential equations; multistep methods; collocation; convergence; stability; polynomial sequences; central factorial polynomials; odd and even polynomials; discrete operators; Hessenberg determinant; recurrence; weighted ℬ-statistical convergence; shape parameter α; shape parameter λ; blending-type operators; computer graphics; extended dynamic mode decomposition; Koopman operator; orthogonal polynomials; mathematical modeling; dynamic systems; sheffer sequence; recurrence relation; polynomial sequences; generating functions; umbral calculus; n/a

Related Books