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
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (28)

Search Parameters:
Keywords = division of polynomials

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
29 pages, 4203 KB  
Article
A Novel Recursive Algorithm for Inverting Matrix Polynomials via a Generalized Leverrier–Faddeev Scheme: Application to FEM Modeling of Wing Vibrations in a 4th-Generation Fighter Aircraft
by Belkacem Bekhiti, George F. Fragulis, George S. Maraslidis, Kamel Hariche and Karim Cherifi
Mathematics 2025, 13(13), 2101; https://doi.org/10.3390/math13132101 - 26 Jun 2025
Viewed by 328
Abstract
This paper introduces a novel recursive algorithm for inverting matrix polynomials, developed as a generalized extension of the classical Leverrier–Faddeev scheme. The approach is motivated by the need for scalable and efficient inversion techniques in applications such as system analysis, control, and FEM-based [...] Read more.
This paper introduces a novel recursive algorithm for inverting matrix polynomials, developed as a generalized extension of the classical Leverrier–Faddeev scheme. The approach is motivated by the need for scalable and efficient inversion techniques in applications such as system analysis, control, and FEM-based structural modeling, where matrix polynomials naturally arise. The proposed algorithm is fully numerical, recursive, and division free, making it suitable for large-scale computation. Validation is performed through a finite element simulation of the transverse vibration of a fighter aircraft wing. Results confirm the method’s accuracy, robustness, and computational efficiency in computing characteristic polynomials and adjugate-related forms, supporting its potential for broader application in control, structural analysis, and future extensions to structured or nonlinear matrix systems. Full article
Show Figures

Figure 1

19 pages, 566 KB  
Article
Bayesian FDOA Positioning with Correlated Measurement Noise
by Wenjun Zhang, Xi Li, Yi Liu, Le Yang and Fucheng Guo
Remote Sens. 2025, 17(7), 1266; https://doi.org/10.3390/rs17071266 - 2 Apr 2025
Viewed by 418
Abstract
In this paper, the problem of source localization using only frequency difference of arrival (FDOA) measurements is considered. A new FDOA-only localization technique is developed to determine the position of a narrow-band source. In this scenario, time difference of arrival (TDOA) measurements are [...] Read more.
In this paper, the problem of source localization using only frequency difference of arrival (FDOA) measurements is considered. A new FDOA-only localization technique is developed to determine the position of a narrow-band source. In this scenario, time difference of arrival (TDOA) measurements are not normally useful because they may have large errors due to the received signal having a small bandwidth. Conventional localization algorithms such as the two-stage weighted least squares (TSWLS) method, which jointly exploits TDOA and FDOA measurements for positioning, are thus no longer applicable since they will suffer from the thresholding effect and yield meaningless localization results. FDOA-only localization is non-trivial, mainly due to the high nonlinearity inherent in FDOA equations. Even with two FDOA measurements being available, FDOA-only localization still requires finding the roots of a high-order polynomial. For practical scenarios with more sensors, a divide-and-conquer (DAC) approach may be applied, but the positioning solution is suboptimal due to ignoring the correlation between FDOA measurements. To address these challenges, in this work, we propose a Bayesian approach for FDOA-only source positioning. The developed method, referred to as the Gaussian division method (GDM), first converts one FDOA measurement into a Gaussian mixture model (GMM) that specifies the prior distribution of the source position. Next, the GDM assumes uncorrelated FDOA measurements and fuses the remaining FDOAs sequentially by invoking nonlinear filtering techniques to obtain an initial positioning result. The GDM refines the solution by taking into account and compensating for the information loss caused by ignoring that the FDOAs are in fact correlated. Extensive simulations demonstrate that the proposed algorithm provides improved performance over existing methods and that it can attain the Cramér–Rao lower bound (CRLB) accuracy under moderate noise levels. Full article
Show Figures

Figure 1

9 pages, 944 KB  
Article
Generalizing the Classical Remainder Theorem: A Reflection-Based Methodological Strategy
by Salvador Cruz Rambaud
Foundations 2024, 4(4), 704-712; https://doi.org/10.3390/foundations4040044 - 6 Dec 2024
Viewed by 945
Abstract
The framework of this paper is the presentation of a case study in which university students are required to extend a particular problem of division of polynomials in one variable over the field of real numbers (as generalizing action) clearly influenced by prior [...] Read more.
The framework of this paper is the presentation of a case study in which university students are required to extend a particular problem of division of polynomials in one variable over the field of real numbers (as generalizing action) clearly influenced by prior strategies (as reflection generalization). Specifically, the objective of this paper is to present a methodology for generalizing the classical Remainder Theorem to the case in which the divisor is a product of binomials (xa1)n1(xa2)n2(xak)nk, where a1,a2,,akR and n1,n2,,nkN. A first approach to this issue is the Taylor expansion of the dividend P(x) at a point a, which clearly shows the quotient and the remainder of the division of P(x) by (xa)k, where the degree of P(x), say n, must be greater than or equal to k. The methodology used in this paper is the proof by induction which allows to obtain recurrence relations different from those obtained by other scholars dealing with the generalization of the classical Remainder Theorem. Full article
(This article belongs to the Section Mathematical Sciences)
Show Figures

Figure 1

13 pages, 2678 KB  
Article
A Systematic Approach to Determining the Kinetics of the Combustion of Biomass Char in a Fluidised Bed Reactor
by S. G. Newman, K. Y. Kwong and E. J. Marek
Processes 2024, 12(10), 2103; https://doi.org/10.3390/pr12102103 - 27 Sep 2024
Viewed by 1085
Abstract
The aim of this work was to investigate the combustion of biochar in a fluidised bed and determine the intrinsic kinetic parameters for combustion: pre-exponential constant Ai and activation energy Ei. When analysing the rates of reaction, Regimes I, II [...] Read more.
The aim of this work was to investigate the combustion of biochar in a fluidised bed and determine the intrinsic kinetic parameters for combustion: pre-exponential constant Ai and activation energy Ei. When analysing the rates of reaction, Regimes I, II and III were demonstrated, with values for the activation energy of 155, 57 and 9 kJ/mol, respectively, when combustion was limited by different factors: intrinsic kinetics, intraparticle and external mass transport phenomena. These mass transport phenomena were decoupled from a set of ‘apparent’ kinetics incorporating effectiveness factors, which we used as a starting point in the determination of the intrinsic kinetic parameters. We also investigated a simple approach to model the evolution of the char structure over the course of oxidation using an empirical function, fX, fitted with an O(7) polynomial. We then reassessed the division into three combustion regimes by exploring the changes in fX and the intraparticle effectiveness factor that occurred upon increasing the combustion temperature. Overall, we demonstrate that experiments in a fluidised bed can be used to determine biochar kinetics in a simplified but trustworthy way. Full article
(This article belongs to the Special Issue Biomass Pretreatment for Thermochemical Conversion)
Show Figures

Figure 1

16 pages, 2570 KB  
Article
A Subspace-Based Frequency Synchronization Algorithm for Multicarrier Communication Systems
by Yung-Yi Wang and Shih-Jen Yang
Mathematics 2024, 12(16), 2568; https://doi.org/10.3390/math12162568 - 20 Aug 2024
Cited by 1 | Viewed by 847
Abstract
We present a subspace-based polynomial rooting algorithm to estimate the frequency bias (FB) of generalized frequency division multiplexing (GFDM) systems employing null subcarriers and repetitive sub-symbols. The estimation process is classified into fractional FB (FFB) and integer FB (IFB) estimation. The use of [...] Read more.
We present a subspace-based polynomial rooting algorithm to estimate the frequency bias (FB) of generalized frequency division multiplexing (GFDM) systems employing null subcarriers and repetitive sub-symbols. The estimation process is classified into fractional FB (FFB) and integer FB (IFB) estimation. The use of repetitive sub-symbols creates a quasi-periodic structure in the FB-distorted received signal, allowing the proposed algorithm to estimate the FFB using the root-MUSIC algorithm. Based on this, the proposed algorithm compensates for the FFB in the received signal and then estimates the null subcarrier pattern (NSP) in the frequency domain. As a result, the IFB estimate can be obtained in a maximum likelihood (ML) manner. Before the NSP estimation, this study uses a sub-symbol combiner to enhance signal strength of the FFB-aligned signal, ensuring the reliability of the IFB estimate. Computer simulations show that the proposed subspace-based algorithm has several advantages over traditional FB estimation methods: 1. Unlike some existing algorithms that use a training sequence to estimate FB, the proposed approach is a semi-blind algorithm because it can deliver information through repeated sub-symbols while estimating FB; 2. The proposed algorithm demonstrates excellent estimation accuracy compared to most traditional FB estimation algorithms; and 3. The proposed algorithm is computationally efficient, making it applicable to real-time applications in future communication systems. Full article
(This article belongs to the Special Issue Intelligent Signal Processing and Intelligent Communication)
Show Figures

Figure 1

19 pages, 1253 KB  
Article
Optimizing Mixed-Model Synchronous Assembly Lines with Bipartite Sequence-Dependent Setup Times in Advanced Manufacturing
by Asieh Varyani, Mohsen Salehi and Meysam Heydari Gharahcheshmeh
Energies 2024, 17(12), 2865; https://doi.org/10.3390/en17122865 - 11 Jun 2024
Cited by 3 | Viewed by 1439
Abstract
In advanced manufacturing, optimizing mixed-model synchronous assembly lines (MMALs) is crucial for enhancing productivity and adhering to sustainability principles, particularly in terms of energy consumption and energy-efficient sequencing. This paper introduces a novel approach by categorizing sequence-dependent setup times into bipartite categories: workpiece-independent [...] Read more.
In advanced manufacturing, optimizing mixed-model synchronous assembly lines (MMALs) is crucial for enhancing productivity and adhering to sustainability principles, particularly in terms of energy consumption and energy-efficient sequencing. This paper introduces a novel approach by categorizing sequence-dependent setup times into bipartite categories: workpiece-independent and workpiece-dependent. This strategic division streamlines assembly processes, reduces idle times, and decreases energy consumption through more efficient machine usage. A new mathematical model is proposed to minimize the intervals at which workpieces are launched on an MMAL, aiming to reduce operational downtime that typically leads to excessive energy use. Given the Non-deterministic Polynomial-time hard (NP-hard) nature of this problem, a genetic algorithm (GA) is developed to efficiently find solutions, with performance compared against the traditional branch and bound technique (B&B). This method enhances the responsiveness of MMALs to variable production demands and contributes to energy conservation by optimizing the sequence of operations to align with energy-saving objectives. Computational experiments conducted on small and large-sized problems demonstrate that the proposed GA outperforms the conventional B&B method regarding solution quality, diversity level, and computational time, leading to energy reductions and enhanced cost-effectiveness in manufacturing settings. Full article
(This article belongs to the Section K: State-of-the-Art Energy Related Technologies)
Show Figures

Figure 1

10 pages, 299 KB  
Article
Bi-Unitary Superperfect Polynomials over 𝔽2 with at Most Two Irreducible Factors
by Haissam Chehade, Domoo Miari and Yousuf Alkhezi
Symmetry 2023, 15(12), 2134; https://doi.org/10.3390/sym15122134 - 30 Nov 2023
Viewed by 1116
Abstract
A divisor B of a nonzero polynomial A, defined over the prime field of two elements, is unitary (resp. bi-unitary) if gcd(B,A/B)=1 (resp. [...] Read more.
A divisor B of a nonzero polynomial A, defined over the prime field of two elements, is unitary (resp. bi-unitary) if gcd(B,A/B)=1 (resp. gcdu(B,A/B)=1), where gcdu(B,A/B) denotes the greatest common unitary divisor of B and A/B. We denote by σ**(A) the sum of all bi-unitary monic divisors of A. A polynomial A is called a bi-unitary superperfect polynomial over F2 if the sum of all bi-unitary monic divisors of σ**(A) equals A. In this paper, we give all bi-unitary superperfect polynomials divisible by one or two irreducible polynomials over F2. We prove the nonexistence of odd bi-unitary superperfect polynomials over F2. Full article
(This article belongs to the Special Issue Asymmetric and Symmetric Study on Number Theory and Cryptography)
25 pages, 12707 KB  
Article
Unsupervised Nonlinear Hyperspectral Unmixing with Reduced Spectral Variability via Superpixel-Based Fisher Transformation
by Zhangqiang Yin and Bin Yang
Remote Sens. 2023, 15(20), 5028; https://doi.org/10.3390/rs15205028 - 19 Oct 2023
Cited by 3 | Viewed by 1994
Abstract
In hyperspectral unmixing, dealing with nonlinear mixing effects and spectral variability (SV) is a significant challenge. Traditional linear unmixing can be seriously deteriorated by the coupled residuals of nonlinearity and SV in remote sensing scenarios. For the simplification of calculation, current unmixing studies [...] Read more.
In hyperspectral unmixing, dealing with nonlinear mixing effects and spectral variability (SV) is a significant challenge. Traditional linear unmixing can be seriously deteriorated by the coupled residuals of nonlinearity and SV in remote sensing scenarios. For the simplification of calculation, current unmixing studies usually separate the consideration of nonlinearity and SV. As a result, errors individually caused by the nonlinearity or SV still persist, potentially leading to overfitting and the decreased accuracy of estimated endmembers and abundances. In this paper, a novel unsupervised nonlinear unmixing method accounting for SV is proposed. First, an improved Fisher transformation scheme is constructed by combining an abundance-driven dynamic classification strategy with superpixel segmentation. It can enlarge the differences between different types of pixels and reduce the differences between pixels corresponding to the same class, thereby reducing the influence of SV. Besides, spectral similarity can be well maintained in local homogeneous regions. Second, the polynomial postnonlinear model is employed to represent observed pixels and explain nonlinear components. Regularized by a Fisher transformation operator and abundances’ spatial smoothness, data reconstruction errors in the original spectral space and the transformed space are weighed to derive the unmixing problem. Finally, this problem is solved by a dimensional division-based particle swarm optimization algorithm to produce accurate unmixing results. Extensive experiments on synthetic and real hyperspectral remote sensing data demonstrate the superiority of the proposed method in comparison with state-of-the-art approaches. Full article
(This article belongs to the Special Issue Advances in Hyperspectral Remote Sensing Image Processing)
Show Figures

Graphical abstract

12 pages, 409 KB  
Article
Exploring Limit Cycle Bifurcations in the Presence of a Generalized Heteroclinic Loop
by Erli Zhang and Stanford Shateyi
Mathematics 2023, 11(18), 3944; https://doi.org/10.3390/math11183944 - 17 Sep 2023
Cited by 1 | Viewed by 1212
Abstract
This work revisits the number of limit cycles (LCs) in a piecewise smooth system of Hamiltonian with a heteroclinic loop generalization, subjected to perturbed functions through polynomials of degree m. By analyzing the asymptotic expansion (AE) of the Melnikov function with first-order [...] Read more.
This work revisits the number of limit cycles (LCs) in a piecewise smooth system of Hamiltonian with a heteroclinic loop generalization, subjected to perturbed functions through polynomials of degree m. By analyzing the asymptotic expansion (AE) of the Melnikov function with first-order M(h) near the generalized heteroclinic loop (HL), we utilize the expansions of the corresponding generators. This approach allows us to establish both lower and upper bounds for the quantity of limit cycles in the perturbed system. Our analysis involves a combination of expansion techniques, derivations, and divisions to derive these findings. Full article
(This article belongs to the Special Issue Application of Mathematical Method and Models in Dynamic System)
Show Figures

Figure 1

17 pages, 3364 KB  
Article
In-Wheel Motor Fault Diagnosis Using Affinity Propagation Minimum-Distance Discriminant Projection and Weibull-Kernel-Function-Based SVDD
by Bingchen Liu, Hongtao Xue, Dianyong Ding, Ning Sun and Peng Chen
Sensors 2023, 23(8), 4021; https://doi.org/10.3390/s23084021 - 15 Apr 2023
Cited by 9 | Viewed by 2060
Abstract
To effectively ensure the operational safety of an electric vehicle with in-wheel motor drive, a novel diagnosis method is proposed to monitor each in-wheel motor fault, the creativity of which lies in two aspects. One aspect is that affinity propagation (AP) is introduced [...] Read more.
To effectively ensure the operational safety of an electric vehicle with in-wheel motor drive, a novel diagnosis method is proposed to monitor each in-wheel motor fault, the creativity of which lies in two aspects. One aspect is that affinity propagation (AP) is introduced into a minimum-distance discriminant projection (MDP) algorithm to propose a new dimension reduction algorithm, which is defined as APMDP. APMDP not only gathers the intra-class and inter-class information of high-dimensional data but also obtains information on the spatial structure. Another aspect is that multi-class support vector data description (SVDD) is improved using the Weibull kernel function, and its classification judgment rule is modified into a minimum distance from the intra-class cluster center. Finally, in-wheel motors with typical bearing faults are customized to collect vibration signals under four operating conditions, respectively, to verify the effectiveness of the proposed method. The results show that the APMDP’s performance is better than traditional dimension reduction methods, and the divisibility is improved by at least 8.35% over the LDA, MDP, and LPP. A multi-class SVDD classifier based on the Weibull kernel function has high classification accuracy and strong robustness, and the classification accuracies of the in-wheel motor faults in each condition are over 95%, which is higher than the polynomial and Gaussian kernel function. Full article
(This article belongs to the Special Issue Sensors for Machinery Condition Monitoring and Diagnosis)
Show Figures

Figure 1

13 pages, 746 KB  
Article
Valency-Based Indices for Some Succinct Drugs by Using M-Polynomial
by Muhammad Usman Ghani, Francis Joseph H. Campena, K. Pattabiraman, Rashad Ismail, Hanen Karamti and Mohamad Nazri Husin
Symmetry 2023, 15(3), 603; https://doi.org/10.3390/sym15030603 - 27 Feb 2023
Cited by 21 | Viewed by 2571
Abstract
A topological index, which is a number, is connected to a graph. It is often used in chemometrics, biomedicine, and bioinformatics to anticipate various physicochemical properties and biological activities of compounds. The purpose of this article is to encourage original research focused on [...] Read more.
A topological index, which is a number, is connected to a graph. It is often used in chemometrics, biomedicine, and bioinformatics to anticipate various physicochemical properties and biological activities of compounds. The purpose of this article is to encourage original research focused on topological graph indices for the drugs azacitidine, decitabine, and guadecitabine as well as an investigation of the genesis of symmetry in actual networks. Symmetry is a universal phenomenon that applies nature’s conservation rules to complicated systems. Although symmetry is a ubiquitous structural characteristic of complex networks, it has only been seldom examined in real-world networks. The M¯-polynomial, one of these polynomials, is used to create a number of degree-based topological coindices. Patients with higher-risk myelodysplastic syndromes, chronic myelomonocytic leukemia, and acute myeloid leukemia who are not candidates for intense regimens, such as induction chemotherapy, are treated with these hypomethylating drugs. Examples of these drugs are decitabine (5-aza-20-deoxycytidine), guadecitabine, and azacitidine. The M¯-polynomial is used in this study to construct a variety of coindices for the three brief medicines that are suggested. New cancer therapies could be developed using indice knowledge, specifically the first Zagreb index, second Zagreb index, F-index, reformulated Zagreb index, modified Zagreb, symmetric division index, inverse sum index, harmonic index, and augmented Zagreb index for the drugs azacitidine, decitabine, and guadecitabine. Full article
(This article belongs to the Special Issue Topological Indices and Symmetry in Complex Networks)
Show Figures

Figure 1

16 pages, 4289 KB  
Article
A Novel Space-Time Marching Method for Solving Linear and Nonlinear Transient Problems
by Li-Dan Hong, Cheng-Yu Ku and Chih-Yu Liu
Mathematics 2022, 10(24), 4694; https://doi.org/10.3390/math10244694 - 11 Dec 2022
Cited by 2 | Viewed by 2255
Abstract
In this study, a novel space-time (ST) marching method is presented to solve linear and nonlinear transient flow problems in porous media. The method divides the ST domain into subdomains along the time axis. The solutions are approximated using ST polyharmonic radial polynomial [...] Read more.
In this study, a novel space-time (ST) marching method is presented to solve linear and nonlinear transient flow problems in porous media. The method divides the ST domain into subdomains along the time axis. The solutions are approximated using ST polyharmonic radial polynomial basis functions (RPBFs) in the ST computational domain. In order to proceed along the time axis, we use the numerical solution at the current timespan of the two ST subdomains in the computational domain as the initial conditions of the next stage. The fictitious time integration method (FTIM) is subsequently employed to solve the nonlinear equations. The novelty of the proposed method is attributed to the division of the ST domain along the time axis into subdomains such that the dense and ill-conditioned matrices caused by the excessive number of boundary and interior points and the large ST radial distances can be avoided. The results demonstrate that the proposed method achieves a high accuracy in solving linear and nonlinear transient problems. Compared to the conventional time marching and ST methods, the proposed meshless approach provides more accurate solutions and reduces error accumulation. Full article
(This article belongs to the Special Issue Mathematics and Its Applications in Science and Engineering II)
Show Figures

Figure 1

23 pages, 799 KB  
Article
Towards Distributed Lexicographically Fair Resource Allocation with an Indivisible Constraint
by Chuanyou Li, Tianwei Wan, Junmei Han and Wei Jiang
Mathematics 2022, 10(3), 324; https://doi.org/10.3390/math10030324 - 20 Jan 2022
Cited by 2 | Viewed by 2496
Abstract
In the cloud computing and big data era, data analysis jobs are usually executed over geo-distributed data centers to make use of data locality. When there are not enough resources to fully meet the demands of all the jobs, allocating resources fairly becomes [...] Read more.
In the cloud computing and big data era, data analysis jobs are usually executed over geo-distributed data centers to make use of data locality. When there are not enough resources to fully meet the demands of all the jobs, allocating resources fairly becomes critical. Meanwhile, it is worth noting that in many practical scenarios, resources waiting to be allocated are not infinitely divisible. In this paper, we focus on fair resource allocation for distributed job execution over multiple sites, where resources allocated each time have a minimum requirement. Aiming at the problem, we propose a novel scheme named Distributed Lexicographical Fairness (DLF) targeting to well specify the meaning of fairness in the new scenario considered. To well study DLF, we follow a common research approach that first analyzes its economic properties and then proposes algorithms to output concrete DLF allocations. In our study, we leverage a creative idea that transforms DLF equivalently to a special max flow problem in the integral field. The transformation facilitates our study in that by generalizing basic properties of DLF from the view of network flow, we prove that DLF satisfies Pareto efficiency, envy-freeness, strategy-proofness, relaxed sharing incentive and 12-maximin share. After that, we propose two algorithms. One is a basic algorithm that stimulates a water-filling process. However, our analysis shows that the time complexity is not strongly polynomial. Aiming at such inefficiency, we then propose a new iterative algorithm that comprehensively leverages parametric flow and push-relabel maximal flow techniques. By analyzing the steps of the iterative algorithm, we show that the time complexity is strongly polynomial. Full article
(This article belongs to the Section E1: Mathematics and Computer Science)
Show Figures

Figure 1

16 pages, 4324 KB  
Article
A Novel OFDM Format and a Machine Learning Based Dimming Control for LiFi
by Itisha Nowrin, M. Rubaiyat Hossain Mondal, Rashed Islam and Joarder Kamruzzaman
Electronics 2021, 10(17), 2103; https://doi.org/10.3390/electronics10172103 - 30 Aug 2021
Cited by 2 | Viewed by 3851
Abstract
This paper proposes a new hybrid orthogonal frequency division multiplexing (OFDM) form termed as DC-biased pulse amplitude modulated optical OFDM (DPO-OFDM) by combining the ideas of the existing DC-biased optical OFDM (DCO-OFDM) and pulse amplitude modulated discrete multitone (PAM-DMT). The analysis indicates that [...] Read more.
This paper proposes a new hybrid orthogonal frequency division multiplexing (OFDM) form termed as DC-biased pulse amplitude modulated optical OFDM (DPO-OFDM) by combining the ideas of the existing DC-biased optical OFDM (DCO-OFDM) and pulse amplitude modulated discrete multitone (PAM-DMT). The analysis indicates that the required DC-bias for DPO-OFDM-based light fidelity (LiFi) depends on the dimming level and the components of the DPO-OFDM. The bit error rate (BER) performance and dimming flexibility of the DPO-OFDM and existing OFDM schemes are evaluated using MATLAB tools. The results show that the proposed DPO-OFDM is power efficient and has a wide dimming range. Furthermore, a switching algorithm is introduced for LiFi, where the individual components of the hybrid OFDM are switched according to a target dimming level. Next, machine learning algorithms are used for the first time to find the appropriate proportions of the hybrid OFDM components. It is shown that polynomial regression of degree 4 can reliably predict the constellation size of the DCO-OFDM component of DPO-OFDM for a given constellation size of PAM-DMT. With the component switching and the machine learning algorithms, DPO-OFDM-based LiFi is power efficient at a wide dimming range. Full article
(This article belongs to the Section Microwave and Wireless Communications)
Show Figures

Figure 1

17 pages, 4051 KB  
Article
Systematic Analysis of Wind Resources for Eolic Potential in Bangladesh
by Mariam Hussain and Seon Ki Park
Appl. Sci. 2021, 11(17), 7924; https://doi.org/10.3390/app11177924 - 27 Aug 2021
Cited by 13 | Viewed by 3721
Abstract
Energy consumption in Bangladesh increased for economic, industrial, and digitalization growth. Reductions in conventional sources such as natural gas (54%) and coal (5.6%) are calls to enhance renewable resources. This paper aims to investigate the atmospheric variables for potential wind zones and develop [...] Read more.
Energy consumption in Bangladesh increased for economic, industrial, and digitalization growth. Reductions in conventional sources such as natural gas (54%) and coal (5.6%) are calls to enhance renewable resources. This paper aims to investigate the atmospheric variables for potential wind zones and develop a statistical power-forecasting model. The study-site is Bangladesh, focusing on eight divisions across two regions. First, the southern zone includes Dhaka (Capital), Chittagong, Barishal, and Khulna. The northern regions are Rajshahi, Rangpur, Mymensingh, and Sylhet. This investigation illustrates wind (m/s) speeds at various heights (m) and analyzes the boundary layer height (BLH) from the European Center for Medium Range Weather Forecast reanalysis 5th generation (ERA5). The data is from a period of 40 years from 1979 to 2018, assessing with a climatic base of 20 years (1979 to 2000). The climatological analysis comprises trends, time series, anomalies, and linear correlations. The results for the wind speed (BLH) indicate that the weakest (lower) and strongest (higher) regions are Sylhet and Barishal, respectively. Based on power-curve relationships, a simple power predictive model (SPPM) is developed using global wind atlas (GWA) data (sample: 1100) to estimate the power density (W/m2) and found an accuracy of 0.918 and 0.892 for Exponential (EXP) and Polynomial (PN) with mean absolute percentage errors (MAPE) of 22.92 and 21.8%, respectively. For validation, SPPM also forecasts power incorporating historical observations for Chittagong and obtains correlations of 0.970 and 0.974 for EXP and PN with a MAPE of 10.26 and 7.69% individually. Furthermore, calculations for annual energy production reveal an average megawattage of 1748 and 1070 in the southern and northern regions, with an MAPE of 15.71 and 5.85% for EXP and PN models, except Sylhet. The SPPM’s predictability can be improved with observed wind speeds and turbine types. The research wishes to apply SPPM for estimating energy in operational power plants. Full article
(This article belongs to the Collection Wind Energy: Current Challenges and Future Perspectives)
Show Figures

Figure 1

Back to TopTop