Search Results (19)

The optimization of computational algorithms is one of the main problems of computational mathematics. This optimization is well demonstrated by the example of the theory of quadrature and cubature formulas. It is known that the numerical integration of definite integrals is of great importance in basic and applied sciences. In this paper we consider the optimization problem of weighted quadrature formulas with derivatives in Sobolev space. Using the extremal function, the square of the norm of the error functional of the considered quadrature formula is calculated. Then, minimizing this norm by coefficients, we obtain a system to find the optimal coefficients of this quadrature formula. The uniqueness of solutions of this system is proved, and an algorithm for solving this system is given. The proposed algorithm is used to obtain the optimal coefficients of the derivative weight quadrature formulas. It should be noted that the optimal weighted quadrature formulas constructed in this work are optimal for the approximate calculation of regular, singular, fractional and strongly oscillating integrals. The constructed optimal quadrature formulas are applied to the approximate solution of linear Fredholm integral equations of the second kind. Finally, the numerical results are compared with the known results of other authors. Full article

This paper considers a numerical method for solving the stochastic semilinear subdiffusion equation which is driven by integrated fractional Gaussian noise and the Hurst parameter $H\in (1/2,1)$. The finite element method is employed for spatial discretization, while the L1 scheme and Lubich’s first-order convolution quadrature formula are used to approximate the Caputo time-fractional derivative of order $\alpha \in (0,1)$ and the Riemann–Liouville time-fractional integral of order $\gamma \in (0,1)$, respectively. Using the semigroup approach, we establish the temporal and spatial regularity of the mild solution to the problem. The fully discrete solution is expressed as a convolution of a piecewise constant function with the inverse Laplace transform of a resolvent-related function. Based on the Laplace transform method and resolvent estimates, we prove that the proposed numerical scheme has the optimal convergence order $O({\tau }^{min\{H+\alpha +\gamma -1-\epsilon ,\alpha \}}),\epsilon >0$. Numerical experiments are presented to validate these theoretical convergence orders and demonstrate the effectiveness of this method. Full article

A damped iterative explicit guidance (DIEG) algorithm is proposed to address the problem of the insufficient convergence of classical explicit guidance methods in the event of thrust drop faults in multistage rockets. Based on the iterative guidance mode (IGM) and powered explicit guidance (PEG), this method is enhanced in three aspects: (1) an accurate transversality condition is derived and applied in the dimension-reduction framework instead of using a simplified assumption; (2) the Gauss–Legendre quadrature formula (GLQF) is adopted to increase the accuracy of the method by addressing the issue of excessive errors in calculating thrust integration using linearization methods based on a small quantity assumption under fault conditions; and (3) a damping factor for solving the time-to-go is introduced to avoid the chattering phenomenon and enhance convergence. A numerical simulation was conducted in single- and multistage mission scenarios by gradually reducing the engine thrust to compare the performance of DIEG and PEG. The results show that DIEG has a much larger convergence range than PEG and has fuel optimality similar to that of the optimization method in most fault scenarios. Finally, the robustness of DIEG under various deviations is verified through Monte Carlo simulation. Full article

We analyze the error estimates of a fully discrete scheme for solving a semilinear stochastic subdiffusion problem driven by integrated fractional Gaussian noise with a Hurst parameter $H\in (0,1)$. The covariance operator Q of the stochastic fractional Wiener process satisfies $\parallel A^{-\rho }{Q}^{1/2}{\parallel }_{HS}<\infty$ for some $\rho \in [0,1)$, where ${\parallel ·\parallel }_{HS}$ denotes the Hilbert–Schmidt norm. The Caputo fractional derivative and Riemann–Liouville fractional integral are approximated using Lubich’s convolution quadrature formulas, while the noise is discretized via the Euler method. For the spatial derivative, we use the spectral Galerkin method. The approximate solution of the fully discrete scheme is represented as a convolution between a piecewise constant function and the inverse Laplace transform of a resolvent-related function. By using this convolution-based representation and applying the Burkholder–Davis–Gundy inequality for fractional Gaussian noise, we derive the optimal convergence rates for the proposed fully discrete scheme. Numerical experiments confirm that the computed results are consistent with the theoretical findings. Full article

In this article, we develop multiplicative fractional versions of Simpson’s and Newton’s formula-type inequalities for differentiable generalized convex functions with the help of established identities. The main motivation for using generalized convex functions lies in their ability to extend results beyond traditional convex functions, encompassing a broader class of functions, and providing optimal approximations for both lower and upper bounds. These inequalities are very useful in finding the error bounds for the numerical integration formulas in multiplicative calculus. Applying these results to the Quadrature formulas demonstrates their practical utility in numerical integration. Furthermore, numerical analysis provides empirical evidence of the effectiveness of the derived findings. It is also demonstrated that the newly proven inequalities extend certain existing results in the literature. Full article

The underwater acoustic (UWA) channel causes large propagation delays and reduces the bit error rate (BER) of wireless communication systems. The t-distribution is the optimal distribution to perform UWA noise. In this study, polar-coded differential chaos shift keying (DCSK) and quadrature chaos shift keying (QCSK) communication with UWA noise are considered. First, we have proposed a PDF for the UWA noise channel, and based on this PDF, the theoretical BER is derived. Second, polar coding’s performance is determined to demonstrate the improvement in the BER performance compared to the uncoded UWA system by means of Monte Carlo simulations. The experimental results prove that the nearest model that is applicable to the UWA channel is a t-distribution with five and six degrees of freedom. The BER formulas of the proposed systems are derived and compared with the simulation results. The results confirm the performance improvement of the polar-coded chaotic modulation systems over uncoded systems in UWA channels. Full article

In this paper, a multi-patch weakly singular isogeometric boundary element method (WSIGABEM) for two-dimensional elastostatics is proposed. Since the method is based on the weakly singular boundary integral equation, quadrature techniques, dedicated to the weakly singular and regular integrals, are applied in the method. A new formula for the generation of collocation points is suggested to take full advantage of the multi-patch technique. The generated collocation points are essentially inside the patches without any correction. If the boundary conditions are assumed to be continuous in every patch, no collocation point lies on the discontinuous boundaries, thus simplifying the implementation. The multi-patch WSIGABEM is verified by simple examples with analytical solutions. The features of the present multi-patch WSIGABEM are investigated by comparison with the traditional IGABEM. Furthermore, the combination of the present multi-patch WSIGABEM and the particle swarm optimization algorithm results in a shape optimization method in two-dimensional elastostatics. By changing some specific control points and their weights, the shape optimizations of the fillet corner, the spanner, and the arch bridge are verified to be effective. Full article

Solutions to problems arising from much scientific and applied research conducted at the world level lead to integral and differential equations. They are approximately solved, mainly using quadrature, cubature, and difference formulas. Therefore, in the current work, we consider a discrete analogue of the differential operator ${\left[1-\frac{1}{{\left(2\pi \right)}^2}\frac{d^2}{d{x}^2}\right]}^{\left[m\right]}$ in the Hilbert space $H_2^{\mu }\left(R\right)$, called $D_m\left[\beta \right]$. We modify the Sobolev algorithm to construct optimal quadrature formulas using a discrete operator. We provide a weighted optimal quadrature formula, using this algorithm for the case where $m=1$. Finally, we construct an optimal quadrature formula in the Hilbert space $H_2^{\mu }\left(R\right)$ for the weight functions $p\left(x\right)=1$ and $p\left(x\right)=e^{2\pi i\omega x}$ when $m=1$. Full article

A nonlinear equation $f\left(x\right)=0$ is mathematically transformed to a coupled system of quasi-linear equations in the two-dimensional space. Then, a linearized approximation renders a fractional iterative scheme $x_{n+1}=x_n-f\left(x_n\right)/[a+bf\left(x_n\right)]$, which requires one evaluation of the given function per iteration. A local convergence analysis is adopted to determine the optimal values of a and b. Moreover, upon combining the fractional iterative scheme to the generalized quadrature methods, the fourth-order optimal iterative schemes are derived. The finite differences based on three data are used to estimate the optimal values of a and b. We recast the Newton iterative method to two types of derivative-free iterative schemes by using the finite difference technique. A three-point generalized Hermite interpolation technique is developed, which includes the weight functions with certain constraints. Inserting the derived interpolation formulas into the triple Newton method, the eighth-order optimal iterative schemes are constructed, of which four evaluations of functions per iteration are required. Full article

The armature reaction of the hybrid excitation starter generator (HESG) under load conditions will affect the distribution of the main magnetic field and the output performance. However, using the conventional field-circuit combination method to study the armature reaction has the problem of low accuracy and inaccurate influencing factors. Therefore, this paper proposed a graphical method to analyze the armature reaction and a new type of HESG with a combined-pole permanent magnet (PM) rotor and claw-pole electromagnetic rotor. The analytical formula of the voltage regulation rate under the armature reaction was derived using the graphical method. The main influencing parameters of the armature reaction magnetic field (ARMF) were analyzed, and the overall output performance was analyzed using finite element software. On this basis, comparison analyses before and after optimization and the prototype test were carried out. The results show that the direct-axis armature reaction reactance, quadrature-axis armature reaction reactance, and voltage regulation rate of the optimized HESG were significantly reduced, the output voltage range of the whole machine was wide, and the voltage regulation performance was good. Full article

It is known that discrete analogs of differential operators play an important role in constructing optimal quadrature, cubature, and difference formulas. Using discrete analogs of differential operators, optimal interpolation, quadrature, and difference formulas exact for algebraic polynomials, trigonometric and exponential functions can be constructed. In this paper, we construct a discrete analogue $D_m\left(h\beta \right)$ of the differential operator $\frac{d^{2m}}{d{x}^{2m}}+2\frac{d^m}{d{x}^m}+1$ in the Hilbert space $W_2^{(m,0)}$. We develop an algorithm for constructing optimal quadrature formulas exact on exponential-trigonometric functions using a discrete operator. Based on this algorithm, in $m=2$, we give an optimal quadrature formula exact for trigonometric functions. Finally, we present the rate of convergence of the optimal quadrature formula in the Hilbert space $W_2^{(2,0)}$ for the case $m=2$. Full article

In this paper, elliptic optimal control problems with $L^1$-control cost and box constraints on the control are considered. To numerically solve the optimal control problems, we use the First optimize, then discretize approach. We focus on the inexact alternating direction method of multipliers (iADMM) and employ the standard piecewise linear finite element approach to discretize the subproblems in each iteration. However, in general, solving the subproblems is expensive, especially when the discretization is at a fine level. Motivated by the efficiency of the multigrid method for solving large-scale problems, we combine the multigrid strategy with the iADMM algorithm. Instead of fixing the mesh size before the computation process, we propose the strategy of gradually refining the grid. Moreover, to overcome the difficulty whereby the $L^1$-norm does not have a decoupled form, we apply nodal quadrature formulas to approximately discretize the $L^1$-norm and $L^2$-norm. Based on these strategies, an efficient multilevel heterogeneous ADMM (mhADMM) algorithm is proposed. The total error of the mhADMM consists of two parts: the discretization error resulting from the finite-element discretization and the iteration error resulting from solving the discretized subproblems. Both errors can be regarded as the error of inexactly solving infinite-dimensional subproblems. Thus, the mhADMM can be regarded as the iADMM in function space. Furthermore, theoretical results on the global convergence, as well as the iteration complexity results $o(1/k)$ for the mhADMM, are given. Numerical results show the efficiency of the mhADMM algorithm. Full article

This paper is devoted to the problem of the thermal fracture of a functionally graded coating (FGC) on a homogeneous substrate (H), i.e., FGC/H structures. The FGC/H structure was subjected to thermo-mechanical loadings. Systems of interacting cracks were located in the FGC. Typical cracks in such structures include edge cracks, internal cracks, and edge/internal cracks. The material properties and fracture toughness of the FGC were modeled by formulas based on the rule of mixtures. The FGC comprised two constituents, a ceramic on the top and a metal as a homogeneous substrate, with their volume fractions determined by a power law function with the power coefficient λ as the gradation parameter for the FGC. For this study, the method of singular integral equations was used, and the integral equations were solved numerically by the mechanical quadrature method based on the Chebyshev polynomials. Attention was mainly paid to the determination of critical loads and energy release rates for the systems of interacting cracks in the FGCs in order to find ways to increase the fracture resistance of FGC/H structures. As an illustrative example, a system of three edge cracks in the FGC was considered. The crack shielding effect was demonstrated for this system of cracks. Additionally, it was shown that the gradation parameter λ had a great effect on the fracture characteristics. Thus, the proposed model provided a sound basis for the optimization of FGCs in order to improve the fracture resistance of FGC/H structures. Full article

Iterative processes are a powerful tool for providing numerical methods for integral equations of the second kind. Integral equations with symmetric kernels are extensively used to model problems, e.g., optimization, electronic and optic problems. We analyze iterative methods for Fredholm–Hammerstein integral equations with modified argument. The approximation consists of two parts, a fixed point result and a quadrature formula. We derive a method that uses a Picard iterative process and the trapezium numerical integration formula, for which we prove convergence and give error estimates. Numerical experiments show the applicability of the method and the agreement with the theoretical results. Full article