Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (9)

Search Parameters:
Keywords = classical discrete orthogonal polynomials

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
29 pages, 8974 KiB  
Article
Fast and Efficient Lunar Finite Element Gravity Model
by Giaky Nguyen, Ahmad Bani Younes and Ahmed Atallah
Appl. Sci. 2024, 14(22), 10364; https://doi.org/10.3390/app142210364 - 11 Nov 2024
Cited by 1 | Viewed by 1080
Abstract
In this paper, the finite element method (FEM) is integrated with orthogonal polynomial approximation in high-dimensional spaces to innovatively model the Moon’s surface gravity anomaly. The aim is to approximate solutions to Laplace’s classical differential equations of gravity, employing classical Chebyshev polynomials as [...] Read more.
In this paper, the finite element method (FEM) is integrated with orthogonal polynomial approximation in high-dimensional spaces to innovatively model the Moon’s surface gravity anomaly. The aim is to approximate solutions to Laplace’s classical differential equations of gravity, employing classical Chebyshev polynomials as basis functions. Using classical Chebyshev polynomials as basis functions, the least-squares approximation was used to approximate discrete samples of the approximation function. These test functions provide an understanding of errors in approximation and corresponding errors due to differentiation and integration. These test functions provide an understanding of errors in approximation and corresponding errors due to differentiation and integration. The first application of this project is to substitute the globally valid classical spherical harmonic series of approximations with locally valid series of orthogonal polynomial approximations (i.e., using the FEM approach). With an error tolerance set at 109ms2, this method is used to adapt the gravity model radially upwards from the lunar surface. The results showcase a need for a higher degree of approximation on and near the lunar surface, with the necessity decreasing as the radius increases. Notably, this method achieves a computational speedup of five orders of magnitude when applying the method to radial adaptation. More intrinsically, the second application involves using the methodology as an effective tool in solving boundary value problems. Specifically, this approach is implemented to solve classical differential equations involved with high-precision, long-term orbit propagation. This application provides a four-order-of-magnitude speedup in computational time while maintaining an error within the 1010ms2 error range for various orbit propagation tests. Alongside the advancements in orthogonal approximation theory, the FEM enables revolutionary speedups in orbit propagation without compromising accuracy. Full article
(This article belongs to the Section Aerospace Science and Engineering)
Show Figures

Figure 1

23 pages, 361 KiB  
Article
A Discrete Cramér–Von Mises Statistic Related to Hahn Polynomials with Application to Goodness-of-Fit Testing for Hypergeometric Distributions
by Jean-Renaud Pycke
Axioms 2024, 13(6), 369; https://doi.org/10.3390/axioms13060369 - 30 May 2024
Viewed by 742
Abstract
We give the Karhunen–Loève expansion of the covariance function of a family of discrete weighted Brownian bridges, appearing as discrete analogues of continuous Gaussian processes related to Cramér –von Mises and Anderson–Darling statistics. This analogy enables us to introduce a discrete Cramér–von Mises [...] Read more.
We give the Karhunen–Loève expansion of the covariance function of a family of discrete weighted Brownian bridges, appearing as discrete analogues of continuous Gaussian processes related to Cramér –von Mises and Anderson–Darling statistics. This analogy enables us to introduce a discrete Cramér–von Mises statistic and show that this statistic satisfies a property of local asymptotic Bahadur optimality for a statistical test involving the classical hypergeometric distributions. Our statistic and the goodness-of-fit problem we deal with are based on basic properties of Hahn polynomials and are, therefore, subject to some extension to all families of classical orthogonal polynomials, as well as their q-analogues. Due probably to computational difficulties, the family of discrete Cramér–von Mises statistics has received less attention than its continuous counterpart—the aim of this article is to bridge part of this gap. Full article
(This article belongs to the Special Issue New Trends in Discrete Probability and Statistics)
11 pages, 269 KiB  
Article
Discrete Entropies of Chebyshev Polynomials
by Răzvan-Cornel Sfetcu, Sorina-Cezarina Sfetcu and Vasile Preda
Mathematics 2024, 12(7), 1046; https://doi.org/10.3390/math12071046 - 30 Mar 2024
Cited by 2 | Viewed by 1403
Abstract
Because of its flexibility and multiple meanings, the concept of information entropy in its continuous or discrete form has proven to be very relevant in numerous scientific branches. For example, it is used as a measure of disorder in thermodynamics, as a measure [...] Read more.
Because of its flexibility and multiple meanings, the concept of information entropy in its continuous or discrete form has proven to be very relevant in numerous scientific branches. For example, it is used as a measure of disorder in thermodynamics, as a measure of uncertainty in statistical mechanics as well as in classical and quantum information science, as a measure of diversity in ecological structures and as a criterion for the classification of races and species in population dynamics. Orthogonal polynomials are a useful tool in solving and interpreting differential equations. Lately, this subject has been intensively studied in many areas. For example, in statistics, by using orthogonal polynomials to fit the desired model to the data, we are able to eliminate collinearity and to seek the same information as simple polynomials. In this paper, we consider the Tsallis, Kaniadakis and Varma entropies of Chebyshev polynomials of the first kind and obtain asymptotic expansions. In the particular case of quadratic entropies, there are given concrete computations. Full article
19 pages, 358 KiB  
Article
Nearest Neighbor Recurrence Relations for Meixner–Angelesco Multiple Orthogonal Polynomials of the Second Kind
by Jorge Arvesú and Alejandro J. Quintero Roba
Mathematics 2024, 12(1), 62; https://doi.org/10.3390/math12010062 - 24 Dec 2023
Viewed by 1116
Abstract
This paper studies a new family of Angelesco multiple orthogonal polynomials with shared orthogonality conditions with respect to a system of weight functions, which are complex analogs of Pascal distributions on a legged star-like set. The emphasis is placed on the algebraic properties, [...] Read more.
This paper studies a new family of Angelesco multiple orthogonal polynomials with shared orthogonality conditions with respect to a system of weight functions, which are complex analogs of Pascal distributions on a legged star-like set. The emphasis is placed on the algebraic properties, such as the raising operators, the Rodrigues-type formula, the explicit expression of the polynomials, and the nearest neighbor recurrence relations. Full article
(This article belongs to the Special Issue Fourier Analysis, Approximation Theory and Applications)
15 pages, 349 KiB  
Article
Sequentially Ordered Sobolev Inner Product and Laguerre–Sobolev Polynomials
by Abel Díaz-González, Juan Hernández and Héctor Pijeira-Cabrera
Mathematics 2023, 11(8), 1956; https://doi.org/10.3390/math11081956 - 20 Apr 2023
Cited by 2 | Viewed by 1684
Abstract
We study the sequence of polynomials {Sn}n0 that are orthogonal with respect to the general discrete Sobolev-type inner product [...] Read more.
We study the sequence of polynomials {Sn}n0 that are orthogonal with respect to the general discrete Sobolev-type inner product f,gs=f(x)g(x)dμ(x)+j=1Nk=0djλj,kf(k)(cj)g(k)(cj), where μ is a finite Borel measure whose support suppμ is an infinite set of the real line, λj,k0, and the mass points ci, i=1,,N are real values outside the interior of the convex hull of suppμ (ciR\Ch(supp(μ))). Under some restriction of order in the discrete part of ·,·s, we prove that Sn has at least nd* zeros on Ch(suppμ), being d* the number of terms in the discrete part of ·,·s. Finally, we obtain the outer relative asymptotic for {Sn} in the case that the measure μ is the classical Laguerre measure, and for each mass point, only one order derivative appears in the discrete part of ·,·s. Full article
27 pages, 511 KiB  
Article
On Perfectness of Systems of Weights Satisfying Pearson’s Equation with Nonstandard Parameters
by Alexander Aptekarev, Alexander Dyachenko and Vladimir Lysov
Axioms 2023, 12(1), 89; https://doi.org/10.3390/axioms12010089 - 15 Jan 2023
Cited by 2 | Viewed by 1562
Abstract
Measures generating classical orthogonal polynomials are determined by Pearson’s equation, whose parameters usually provide the positivity of the measures. The case of general complex parameters (nonstandard) is also of interest; the non-Hermitian orthogonality with respect to (now complex-valued) measures is considered on curves [...] Read more.
Measures generating classical orthogonal polynomials are determined by Pearson’s equation, whose parameters usually provide the positivity of the measures. The case of general complex parameters (nonstandard) is also of interest; the non-Hermitian orthogonality with respect to (now complex-valued) measures is considered on curves in C. Some applications lead to multiple orthogonality with respect to a number of such measures. For a system of r orthogonality measures, the perfectness is an important property: in particular, it implies the uniqueness for the whole family of corresponding multiple orthogonal polynomials and the (r+2)-term recurrence relations. In this paper, we introduce a unified approach which allows to prove the perfectness of the systems of complex measures satisfying Pearson’s equation with nonstandard parameters. We also study the polynomials satisfying multiple orthogonality relations with respect to a system of discrete measures. The well-studied families of multiple Charlier, Krawtchouk, Meixner and Hahn polynomials correspond to the systems of measures defined by the difference Pearson’s equation with standard real parameters. Using the same approach, we verify the perfectness of such systems for general parameters. For some values of the parameters, discrete measures should be replaced with the continuous measures with non-real supports. Full article
(This article belongs to the Special Issue Orthogonal Polynomials, Special Functions and Applications)
Show Figures

Figure 1

9 pages, 326 KiB  
Article
Stable Calculation of Krawtchouk Functions from Triplet Relations
by Albertus C. den Brinker
Mathematics 2021, 9(16), 1972; https://doi.org/10.3390/math9161972 - 18 Aug 2021
Cited by 5 | Viewed by 1873
Abstract
Deployment of the recurrence relation or difference equation to generate discrete classical orthogonal polynomials is vulnerable to error propagation. This issue is addressed for the case of Krawtchouk functions, i.e., the orthonormal basis derived from the Krawtchouk polynomials. An algorithm is proposed for [...] Read more.
Deployment of the recurrence relation or difference equation to generate discrete classical orthogonal polynomials is vulnerable to error propagation. This issue is addressed for the case of Krawtchouk functions, i.e., the orthonormal basis derived from the Krawtchouk polynomials. An algorithm is proposed for stable determination of these functions. This is achieved by defining proper initial points for the start of the recursions, balancing the order of the direction in which recursions are executed and adaptively restricting the range over which equations are applied. The adaptation is controlled by a user-specified deviation from unit norm. The theoretical background is given, the algorithmic concept is explained and the effect of controlled accuracy is demonstrated by examples. Full article
(This article belongs to the Section E1: Mathematics and Computer Science)
Show Figures

Figure 1

8 pages, 246 KiB  
Article
Discrete Quantum Harmonic Oscillator
by Alina Dobrogowska and David J. Fernández C.
Symmetry 2019, 11(11), 1362; https://doi.org/10.3390/sym11111362 - 3 Nov 2019
Cited by 1 | Viewed by 3537
Abstract
In this paper, we propose a discrete model for the quantum harmonic oscillator. The eigenfunctions and eigenvalues for the corresponding Schrödinger equation are obtained through the factorization method. It is shown that this problem is also connected with the equation for Meixner polynomials. [...] Read more.
In this paper, we propose a discrete model for the quantum harmonic oscillator. The eigenfunctions and eigenvalues for the corresponding Schrödinger equation are obtained through the factorization method. It is shown that this problem is also connected with the equation for Meixner polynomials. Full article
(This article belongs to the Special Issue Differential and Difference Equations and Symmetry)
12 pages, 620 KiB  
Article
On Sister Celine’s Polynomials of Several Variables
by HSP Shrivastava
Math. Comput. Appl. 2004, 9(2), 309-320; https://doi.org/10.3390/mca9020309 - 1 Aug 2004
Cited by 1 | Viewed by 1291
Abstract
The aim of the present paper is to define Sister Celine's polynomials of two and more variables. We reduce the two variables Sister Celine's polynomials into many classical orthogonal polynomials and their product also such as – Jacobi, Gegenbauer, Legendre, Laguerre, Bessel and [...] Read more.
The aim of the present paper is to define Sister Celine's polynomials of two and more variables. We reduce the two variables Sister Celine's polynomials into many classical orthogonal polynomials and their product also such as – Jacobi, Gegenbauer, Legendre, Laguerre, Bessel and some discrete polynomials Bateman, Pasternak, Hahn, Krawtchouk, Meixner, Poisson-Charlier & others. Many integral representations and generating function relations are also established. Full article
Back to TopTop