Ampol Duangpan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ampol Duangpan has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Ratinan Boonklurb
Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University, Bangkok 10330, Thailand
9 shared publications - Phiraphat Sutthimat
Department of Mathematics, Faculty of Science, Kasetsart University, Bangkok 10900, Thailand
6 shared publications - Udomsak Rakwongwan
Department of Mathematics, Faculty of Science, Kasetsart University, Bangkok, Thailand
3 shared publications - Kittisak Chumpong
Division of Computational Science, Faculty of Science, Prince of Songkla University, Songkhla 90110, Thailand
1 shared publication - Lalita Apisornpanich
Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University, Bangkok 10330, Thailand
1 shared publication - Matinee Juytai
Winitsuksa School, Lopburi 15000, Thailand
1 shared publication
Latest Publications
- Open Access
- 7 August 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (16) , 2866
Computable Derivative-Twisted Intersection Dimensions of Repeated-Root Cyclic Codes via Lucas-Refined Truncation
The Hasse derivative image of a repeated-root cyclic code is typically non-cyclic. This prevents a direct ideal-theoretic calculation of derivative-twisted intersections and first leads to cyclic containers and two-sided bounds. This paper shows that, after expanding codewords in Hasse–Taylor coordinates at the roots of the underlying polynomial, the higher-order Hasse derivative operator decomposes into independent local blocks and its image becomes a coordinate subspace. This yields exact closed-form dimensions, expressed entirely in terms of the generator multiplicities and the base-prime digits of the derivative order, for the derivative image, for the derivative-twisted intersection of two codes and its self-intersection specialization, and for the smallest cyclic code containing the image together with its non-cyclic defect. As a consequence, for every positive derivative order in the admissible range, the derivative image is cyclic only when it is zero, and the multiplicity-drop and Lucas-refined containers developed here, as well as the rank of the derivative operator, are recovered as immediate relaxations or special cases. Applying the intersection-pair construction to a code paired with its derivative image produces entanglement-assisted quantum error-correcting codes whose dimension and entanglement cost are exact functions of the multiplicity digits and the derivative order, so that the derivative order tunes the entanglement consumption. For the minimum distance, a punctured matrix-product decomposition gives an exact formula for the derivative image in terms of the minimum distances of a finite family of simple-root constituents of length . Combining this formula with the corresponding constituent formula for the dual gives the complete distance parameter of the resulting EAQECCs without enumerating the non-cyclic derivative images.- 7 August 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (16) , 2866
Open AccessComputable Derivative-Twisted Intersection Dimensions of Repeated-Root Cyclic Codes via Lucas-Refined Truncation
The Hasse derivative image of a repeated-root cyclic code is typically non-cyclic. This prevents a direct ideal-theoretic calculation of derivative-twisted intersections and first leads to cyclic containers and two-sided bounds. This paper shows that, after expanding codewords in Hasse–Taylor coordinates at the roots of the underlying polynomial, the higher-order Hasse derivative operator decomposes into independent local blocks and its image becomes a coordinate subspace. This yields exact closed-form dimensions, expressed entirely in terms of the generator multiplicities and the base-prime digits of the derivative order, for the derivative image, for the derivative-twisted intersection of two codes and its self-intersection specialization, and for the smallest cyclic code containing the image together with its non-cyclic defect. As a consequence, for every positive derivative order in the admissible range, the derivative image is cyclic only when it is zero, and the multiplicity-drop and Lucas-refined containers developed here, as well as the rank of the derivative operator, are recovered as immediate relaxations or special cases. Applying the intersection-pair construction to a code paired with its derivative image produces entanglement-assisted quantum error-correcting codes whose dimension and entanglement cost are exact functions of the multiplicity digits and the derivative order, so that the derivative order tunes the entanglement consumption. For the minimum distance, a punctured matrix-product decomposition gives an exact formula for the derivative image in terms of the minimum distances of a finite family of simple-root constituents of length . Combining this formula with the corresponding constituent formula for the dual gives the complete distance parameter of the resulting EAQECCs without enumerating the non-cyclic derivative images. - Open Access
- 2 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (15) , 2492
Finite Integration Method with Chebyshev Expansion for Shallow Water Equations over Variable Topography
The shallow water equations (SWEs) model fluid flow in rivers, coasts, and tsunamis. Their nonlinearity challenges analytical solutions. We present a numerical algorithm combining the finite integration method with Chebyshev polynomial expansion (FIM-CPE) to solve one- and two-dimensional SWEs. The method transforms partial differential equations into integral equations, approximates spatial terms via Chebyshev polynomials, and uses forward differences for time discretization. Validated on stationary lakes, dam breaks, and Gaussian pulses, the scheme achieved errors below for water height and velocity, while conserving mass with volume deviations under . Comparisons showed superior shock-capturing versus finite difference methods. For two-dimensional cases, it accurately resolved wave interactions over complex topographies. Though limited to wet beds and small-scale two-dimensional problems, the method provides a robust simulation tool.- 2 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (15) , 2492
Open AccessFinite Integration Method with Chebyshev Expansion for Shallow Water Equations over Variable Topography
The shallow water equations (SWEs) model fluid flow in rivers, coasts, and tsunamis. Their nonlinearity challenges analytical solutions. We present a numerical algorithm combining the finite integration method with Chebyshev polynomial expansion (FIM-CPE) to solve one- and two-dimensional SWEs. The method transforms partial differential equations into integral equations, approximates spatial terms via Chebyshev polynomials, and uses forward differences for time discretization. Validated on stationary lakes, dam breaks, and Gaussian pulses, the scheme achieved errors below for water height and velocity, while conserving mass with volume deviations under . Comparisons showed superior shock-capturing versus finite difference methods. For two-dimensional cases, it accurately resolved wave interactions over complex topographies. Though limited to wet beds and small-scale two-dimensional problems, the method provides a robust simulation tool. - Open Access
- 11 July 2024
- Published by MDPI AG in Fractal and Fractional
- Vol. 8 (7) , 406
Derivation of Closed-Form Expressions in Apéry-like Series Using Fractional Calculus and Applications
This paper explores the Apéry-like series and demonstrates the derivation of closed-form expressions using fractional calculus. We consider a variety of Apéry-like functions, which were categorized by their functional forms and coefficients by applying the Riemann–Liouville fractional integral and derivative to examine their properties across various domains. The study focuses on establishing rigorous mathematical frameworks that unveil new insights into the behaviors of these series, contributing to a deeper understanding of number theory and mathematical analysis. Key results include proofs of convergence and divergence within specified intervals and the derivation of closed-form solutions through fractional integration and differentiation. This paper also introduces a method aimed at conjecturing mathematical constants through continued fractions as an application of our results. Finally, we provide the proof of validation for three unproven conjectures of continued fractions obtained from the Ramanujan Machine.
- 11 July 2024
- Published by MDPI AG in Fractal and Fractional
- Vol. 8 (7) , 406
Open AccessDerivation of Closed-Form Expressions in Apéry-like Series Using Fractional Calculus and Applications
This paper explores the Apéry-like series and demonstrates the derivation of closed-form expressions using fractional calculus. We consider a variety of Apéry-like functions, which were categorized by their functional forms and coefficients by applying the Riemann–Liouville fractional integral and derivative to examine their properties across various domains. The study focuses on establishing rigorous mathematical frameworks that unveil new insights into the behaviors of these series, contributing to a deeper understanding of number theory and mathematical analysis. Key results include proofs of convergence and divergence within specified intervals and the derivation of closed-form solutions through fractional integration and differentiation. This paper also introduces a method aimed at conjecturing mathematical constants through continued fractions as an application of our results. Finally, we provide the proof of validation for three unproven conjectures of continued fractions obtained from the Ramanujan Machine.
- Open Access
Analytical Formulas Using Affine Transformation for Pricing Generalized Swaps in Commodity Markets with Stochastic Convenience Yields
This paper presents analytical formulas for pricing generalized swaps, including the moment swap, gamma swap, entropy swap and self-quantoed variance swap. The formulas are based on closed-form formulas for the conditional expectations of the product of the price and its logarithm and the product of the price and the convenience yield obtained by solving a partial differential equation corresponding to the infinitesimal generator for the two-dimensional diffusion process. In this respect, the formulas obtained are combinatorial in nature and are solved via an affine transformation involving the complete Bell polynomials. The formulas are quite suitable for practical usage with symmetric and skew-symmetric properties, i.e., they are simpler and more compact compared with those existing in the literature. Moreover, for moments swaps, we show in general that the strike price does not depend on the initial spot price but depends only on the initial convenience yield, which highlights the resulting versatility in this respect.
Open AccessAnalytical Formulas Using Affine Transformation for Pricing Generalized Swaps in Commodity Markets with Stochastic Convenience Yields
This paper presents analytical formulas for pricing generalized swaps, including the moment swap, gamma swap, entropy swap and self-quantoed variance swap. The formulas are based on closed-form formulas for the conditional expectations of the product of the price and its logarithm and the product of the price and the convenience yield obtained by solving a partial differential equation corresponding to the infinitesimal generator for the two-dimensional diffusion process. In this respect, the formulas obtained are combinatorial in nature and are solved via an affine transformation involving the complete Bell polynomials. The formulas are quite suitable for practical usage with symmetric and skew-symmetric properties, i.e., they are simpler and more compact compared with those existing in the literature. Moreover, for moments swaps, we show in general that the strike price does not depend on the initial spot price but depends only on the initial convenience yield, which highlights the resulting versatility in this respect.
- Open Access
Analytical Formulas for Conditional Mixed Moments of Generalized Stochastic Correlation Process
This paper proposes a simple and novel approach based on solving a partial differential equation (PDE) to establish the concise analytical formulas for a conditional moment and mixed moment of the Jacobi process with constant parameters, accomplished by including random fluctuations with an asymmetric Wiener process and without any knowledge of the transition probability density function. Our idea involves a system with a recurrence differential equation which leads to the PDE by involving an asymmetric matrix. Then, by using Itô’s lemma, all formulas for the Jacobi process with constant parameters as well as time-dependent parameters are extended to the generalized stochastic correlation processes. In addition, their statistical properties are provided in closed forms. Finally, to illustrate applications of the proposed formulas in practice, estimations of parametric methods based on the moments are mentioned, particularly in the method of moments estimators.
Open AccessAnalytical Formulas for Conditional Mixed Moments of Generalized Stochastic Correlation Process
This paper proposes a simple and novel approach based on solving a partial differential equation (PDE) to establish the concise analytical formulas for a conditional moment and mixed moment of the Jacobi process with constant parameters, accomplished by including random fluctuations with an asymmetric Wiener process and without any knowledge of the transition probability density function. Our idea involves a system with a recurrence differential equation which leads to the PDE by involving an asymmetric matrix. Then, by using Itô’s lemma, all formulas for the Jacobi process with constant parameters as well as time-dependent parameters are extended to the generalized stochastic correlation processes. In addition, their statistical properties are provided in closed forms. Finally, to illustrate applications of the proposed formulas in practice, estimations of parametric methods based on the moments are mentioned, particularly in the method of moments estimators.
- Open Access
- 24 January 2022
- Published by MDPI AG in Fractal and Fractional
- Vol. 6 (2) , 58
A Novel Analytical Formula for the Discounted Moments of the ECIR Process and Interest Rate Swaps Pricing
This paper presents an explicit formula of conditional expectation for a product of polynomial functions and the discounted characteristic function based on the Cox–Ingersoll–Ross (CIR) process. We also propose an analytical formula as well as a very efficient and accurate approach, based on the finite integration method with shifted Chebyshev polynomial, to evaluate this expectation under the Extended CIR (ECIR) process. The formulas are derived by solving the equivalent partial differential equations obtained by utilizing the Feynman–Kac representation. In addition, we extend our results to derive an analytical formula of conditional expectation of a product of mixed polynomial functions and the discounted characteristic function. The accuracy and efficiency of the proposed scheme are also numerically shown for various modeling parameters by comparing them with those obtained from Monte Carlo simulations. In addition, to illustrate applications of the obtained formulas in finance, analytical pricing formulas for arrears and vanilla interest rate swaps under the ECIR process are derived. The pricing formulas become explicit under the CIR process. Finally, the fractional ECIR process is also studied as an extended case of our main results.
- 24 January 2022
- Published by MDPI AG in Fractal and Fractional
- Vol. 6 (2) , 58
Open AccessA Novel Analytical Formula for the Discounted Moments of the ECIR Process and Interest Rate Swaps Pricing
This paper presents an explicit formula of conditional expectation for a product of polynomial functions and the discounted characteristic function based on the Cox–Ingersoll–Ross (CIR) process. We also propose an analytical formula as well as a very efficient and accurate approach, based on the finite integration method with shifted Chebyshev polynomial, to evaluate this expectation under the Extended CIR (ECIR) process. The formulas are derived by solving the equivalent partial differential equations obtained by utilizing the Feynman–Kac representation. In addition, we extend our results to derive an analytical formula of conditional expectation of a product of mixed polynomial functions and the discounted characteristic function. The accuracy and efficiency of the proposed scheme are also numerically shown for various modeling parameters by comparing them with those obtained from Monte Carlo simulations. In addition, to illustrate applications of the obtained formulas in finance, analytical pricing formulas for arrears and vanilla interest rate swaps under the ECIR process are derived. The pricing formulas become explicit under the CIR process. Finally, the fractional ECIR process is also studied as an extended case of our main results.
- Open Access
- 25 August 2021
- Published by MDPI AG in Fractal and Fractional
- Vol. 5 (3) , 103
Numerical Solutions for Systems of Fractional and Classical Integro-Differential Equations via Finite Integration Method Based on Shifted Chebyshev Polynomials
In this paper, the finite integration method and the operational matrix of fractional integration are implemented based on the shifted Chebyshev polynomial. They are utilized to devise two numerical procedures for solving the systems of fractional and classical integro-differential equations. The fractional derivatives are described in the Caputo sense. The devised procedure can be successfully applied to solve the stiff system of ODEs. To demonstrate the efficiency, accuracy and numerical convergence order of these procedures, several experimental examples are given. As a consequence, the numerical computations illustrate that our presented procedures achieve significant improvement in terms of accuracy with less computational cost.
- 25 August 2021
- Published by MDPI AG in Fractal and Fractional
- Vol. 5 (3) , 103
Open AccessNumerical Solutions for Systems of Fractional and Classical Integro-Differential Equations via Finite Integration Method Based on Shifted Chebyshev Polynomials
In this paper, the finite integration method and the operational matrix of fractional integration are implemented based on the shifted Chebyshev polynomial. They are utilized to devise two numerical procedures for solving the systems of fractional and classical integro-differential equations. The fractional derivatives are described in the Caputo sense. The devised procedure can be successfully applied to solve the stiff system of ODEs. To demonstrate the efficiency, accuracy and numerical convergence order of these procedures, several experimental examples are given. As a consequence, the numerical computations illustrate that our presented procedures achieve significant improvement in terms of accuracy with less computational cost.
- Open Access
Numerical Solution of Direct and Inverse Problems for Time-Dependent Volterra Integro-Differential Equation Using Finite Integration Method with Shifted Chebyshev Polynomials
In this article, the direct and inverse problems for the one-dimensional time-dependent Volterra integro-differential equation involving two integration terms of the unknown function (i.e., with respect to time and space) are considered. In order to acquire accurate numerical results, we apply the finite integration method based on shifted Chebyshev polynomials (FIM-SCP) to handle the spatial variable. These shifted Chebyshev polynomials are symmetric (either with respect to the point or the vertical line depending on their degree) over , and their zeros in the interval are distributed symmetrically. We use these zeros to construct the main tool of FIM-SCP: the Chebyshev integration matrix. The forward difference quotient is used to deal with the temporal variable. Then, we obtain efficient numerical algorithms for solving both the direct and inverse problems. However, the ill-posedness of the inverse problem causes instability in the solution and, so, the Tikhonov regularization method is utilized to stabilize the solution. Furthermore, several direct and inverse numerical experiments are illustrated. Evidently, our proposed algorithms for both the direct and inverse problems give a highly accurate result with low computational cost, due to the small number of iterations and discretization.Open AccessNumerical Solution of Direct and Inverse Problems for Time-Dependent Volterra Integro-Differential Equation Using Finite Integration Method with Shifted Chebyshev Polynomials
In this article, the direct and inverse problems for the one-dimensional time-dependent Volterra integro-differential equation involving two integration terms of the unknown function (i.e., with respect to time and space) are considered. In order to acquire accurate numerical results, we apply the finite integration method based on shifted Chebyshev polynomials (FIM-SCP) to handle the spatial variable. These shifted Chebyshev polynomials are symmetric (either with respect to the point or the vertical line depending on their degree) over , and their zeros in the interval are distributed symmetrically. We use these zeros to construct the main tool of FIM-SCP: the Chebyshev integration matrix. The forward difference quotient is used to deal with the temporal variable. Then, we obtain efficient numerical algorithms for solving both the direct and inverse problems. However, the ill-posedness of the inverse problem causes instability in the solution and, so, the Tikhonov regularization method is utilized to stabilize the solution. Furthermore, several direct and inverse numerical experiments are illustrated. Evidently, our proposed algorithms for both the direct and inverse problems give a highly accurate result with low computational cost, due to the small number of iterations and discretization. - Open Access
- 7 December 2019
- Published by MDPI AG in Mathematics
- Vol. 7 (12) , 1201
Finite Integration Method with Shifted Chebyshev Polynomials for Solving Time-Fractional Burgers’ Equations
The Burgers’ equation is one of the nonlinear partial differential equations that has been studied by many researchers, especially, in terms of the fractional derivatives. In this article, the numerical algorithms are invented to obtain the approximate solutions of time-fractional Burgers’ equations both in one and two dimensions as well as time-fractional coupled Burgers’ equations which their fractional derivatives are described in the Caputo sense. These proposed algorithms are constructed by applying the finite integration method combined with the shifted Chebyshev polynomials to deal the spatial discretizations and further using the forward difference quotient to handle the temporal discretizations. Moreover, numerical examples demonstrate the ability of the proposed method to produce the decent approximate solutions in terms of accuracy. The rate of convergence and computational cost for each example are also presented.
- 7 December 2019
- Published by MDPI AG in Mathematics
- Vol. 7 (12) , 1201
Open AccessFinite Integration Method with Shifted Chebyshev Polynomials for Solving Time-Fractional Burgers’ Equations
The Burgers’ equation is one of the nonlinear partial differential equations that has been studied by many researchers, especially, in terms of the fractional derivatives. In this article, the numerical algorithms are invented to obtain the approximate solutions of time-fractional Burgers’ equations both in one and two dimensions as well as time-fractional coupled Burgers’ equations which their fractional derivatives are described in the Caputo sense. These proposed algorithms are constructed by applying the finite integration method combined with the shifted Chebyshev polynomials to deal the spatial discretizations and further using the forward difference quotient to handle the temporal discretizations. Moreover, numerical examples demonstrate the ability of the proposed method to produce the decent approximate solutions in terms of accuracy. The rate of convergence and computational cost for each example are also presented.