Search

In this paper, a stability analysis and the controller improvement of T-S fuzzy Descriptor system are studied. Firstly, by making full use of the related theory of fuzzy affiliation function and combining the design method of fuzzy Lyapunov function with the method of inequality deflation, a stability condition with wider admissibility and less system conservatism is proposed. The advantage of this method is that it is not necessary to ensure that each fuzzy subsystem is progressively stable. We also maximise the boundary of the derivatives of the affiliation function mined. Secondly, a PDC controller and a Non-PDC controller are designed, and the deflation conditions for the linear matrix inequalities of the two controllers are constructed. Finally, some arithmetic simulations and practical examples are given to demonstrate the effectiveness of the method studied in this paper, and the results obtained are less conservative and have larger feasible domains than previous methods. [ABSTRACT FROM AUTHOR]

This paper attempts to develop a unified model predictive control (MPC) method for integrated path planning and trajectory tracking of autonomous underwater vehicles (AUVs). To deal with the computational burden of online path planning, an event-triggered model predictive control (EMPC) method is introduced by using the environmental change as a triggering mechanism. A collision hazard function utilizing the changing rate of hazard as a triggering threshold is proposed to guarantee safety. We further give an illustration of how to calculate this threshold. Then, a Lyapunov-based model predictive control (LMPC) framework is developed for the AUV to solve the trajectory tracking problem. Leveraging a nonlinear integral sliding mode control strategy, we construct the contraction constraint within the formulated LMPC framework, thereby theoretically ensuring closed-loop stability. We derive the necessary and sufficient conditions for recursive feasibility, which are subsequently used to prove the closed-loop stability of the system. In the simulations, the proposed path planning and tracking control are verified separately and integrated and combined with static and dynamic obstacles. [ABSTRACT FROM AUTHOR]

The work proves that under conditions of instability of the second derivatives of the function in the minimization region, the estimate of the convergence rate of Newton's method is determined by the parameters of the irreducible part of the conditionality degree of the problem. These parameters represent the degree of difference between eigenvalues of the matrices of the second derivatives in the coordinate system, where this difference is minimal, and the resulting estimate of the convergence rate subsequently acts as a standard. The paper studies the convergence rate of the relaxation subgradient method (RSM) with optimization of the parameters of two-rank correction of metric matrices on smooth strongly convex functions with a Lipschitz gradient without assumptions about the existence of second derivatives of the function. The considered RSM is similar in structure to quasi-Newton minimization methods. Unlike the latter, its metric matrix is not an approximation of the inverse matrix of second derivatives but is adjusted in such a way that it enables one to find the descent direction that takes the method beyond a certain neighborhood of the current minimum as a result of one-dimensional minimization along it. This means that the metric matrix enables one to turn the current gradient into a direction that is gradient-consistent with the set of gradients of some neighborhood of the current minimum. Under broad assumptions on the parameters of transformations of metric matrices, an estimate of the convergence rate of the studied RSM and an estimate of its ability to exclude removable linear background are obtained. The obtained estimates turn out to be qualitatively similar to estimates for Newton's method. In this case, the assumption of the existence of second derivatives of the function is not required. A computational experiment was carried out in which the quasi-Newton BFGS method and the subgradient method under study were compared on various types of smooth functions. The testing results indicate the effectiveness of the subgradient method in minimizing smooth functions with a high degree of conditionality of the problem and its ability to eliminate the linear background that worsens the convergence. [ABSTRACT FROM AUTHOR]

K-essence theories are usually studied in the framework of a single scalar field ϕ. Namely, the Lagrangian of K-essence is the function of the single scalar field ϕ and its covariant derivative. However, in this paper, we explore a double-field pure K-essence, i.e., the corresponding Lagrangian is the function of covariant derivatives of double scalar fields without a dependency on scalar fields themselves. This is why we call it double-field pure K-essence. The novelty of this K-essence is that its Lagrangian contains the quotient term of the kinetic energies from the two scalar fields. This results in the presence of many interesting features; for example, the equation of state can be arbitrarily small and arbitrarily large. In comparison, the range of the equation of state for quintessence is − 1 to + 1 . Interestingly, this novel K-essence can play the role of an inflation field, dark matter, or dark energy by appropriately selecting the expressions of Lagrangian. [ABSTRACT FROM AUTHOR]

This paper considers the estimation of SOC and SOH for lithium batteries using multi-innovation Levenberg–Marquardt and adaptive weighting unscented Kalman filter algorithms. For parameter identification, the second-order derivative of the objective function to optimize the traditional gradient descent algorithm is used. For SOC estimation, an adaptive weighting unscented Kalman filter algorithm is proposed to deal with the nonlinear update problem of the mean and covariance, which can substantially improve the estimation accuracy of the internal state of the lithium battery. Compared with fixed weights in the traditional unscented Kalman filtering algorithm, this algorithm adaptively adjusts the weights according to the state and measured values to improve the state estimation update accuracy. Finally, according to simulations, the errors of this algorithm are all lower than 1.63 %, which confirms the effectiveness of this algorithm. [ABSTRACT FROM AUTHOR]

This paper presents a topology optimization (TopO) method for conjugate heat transfer (CHT), with turbulent flows. Topological changes are controlled by an artificial material distribution field (design variables), defined at the cells of a background grid and used to distinguish a fluid from a solid material. To effectively solve the CHT problem, it is crucial to impose exact boundary conditions at the computed fluid–solid interface (FSI); this is the purpose of introducing the cut-cell method. On the grid, including also cut cells, the incompressible Navier–Stokes equations, coupled with the Spalart–Allmaras turbulence model with wall functions, and the temperature equation are solved. The continuous adjoint method computes the derivatives of the objective function(s) and constraints with respect to the material distribution field, starting from the computation of derivatives with respect to the positions of nodes on the FSI and then applying the chain rule of differentiation. In this work, the continuous adjoint PDEs are discretized using schemes that are consistent with the primal discretization, and this will be referred to as the "Think Discrete–Do Continuous" (TDDC) adjoint. The accuracy of the gradient computed by the TDDC adjoint is verified and the proposed method is assessed in the optimization of two 2D cases, both in turbulent flow conditions. The performance of the TopO designs is investigated in terms of the number of required refinement steps per optimization cycle, the Reynolds number of the flow, and the maximum allowed power dissipation. To illustrate the benefits of the proposed method, the first case is also optimized using a density-based TopO that imposes Brinkman penalization terms in solid areas, and comparisons are made. [ABSTRACT FROM AUTHOR]

Oscillations in option price convergence have long been a problematic aspect of tree methods, inhibiting the use of repeated Richardson extrapolation that could otherwise greatly accelerate convergence, a feature integral to some of the most efficient modern methods. These oscillations are typically caused by the fluctuating positions of nodes around the discontinuities in the payoff function or its derivatives. Our paper addresses this crucial gap that typically prohibits the use of lattice methods when high efficiency is needed. Focusing on double barrier options, we develop a trinomial tree in which the positions of the nodes are precisely adjusted to align with these discontinuities throughout the option's lifespan and across various time steps. This alignment enables the use of repeated extrapolation to achieve high order convergence, including near barriers, a well-known challenge in many tree methods. Maintaining the inherent simplicity and adaptability of tree methods, our approach is easily applicable to other models and option types. [ABSTRACT FROM AUTHOR]

In this article, we consider the correction of metric matrices in quasi-Newton methods (QNM) from the perspective of machine learning theory. Based on training information for estimating the matrix of the second derivatives of a function, we formulate a quality functional and minimize it by using gradient machine learning algorithms. We demonstrate that this approach leads us to the well-known ways of updating metric matrices used in QNM. The learning algorithm for finding metric matrices performs minimization along a system of directions, the orthogonality of which determines the convergence rate of the learning process. The degree of learning vectors' orthogonality can be increased both by choosing a QNM and by using additional orthogonalization methods. It has been shown theoretically that the orthogonality degree of learning vectors in the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method is higher than in the Davidon–Fletcher–Powell (DFP) method, which determines the advantage of the BFGS method. In our paper, we discuss some orthogonalization techniques. One of them is to include iterations with orthogonalization or an exact one-dimensional descent. As a result, it is theoretically possible to detect the cumulative effect of reducing the optimization space on quadratic functions. Another way to increase the orthogonality degree of learning vectors at the initial stages of the QNM is a special choice of initial metric matrices. Our computational experiments on problems with a high degree of conditionality have confirmed the stated theoretical assumptions. [ABSTRACT FROM AUTHOR]

In this paper, a Newton-type iterative scheme for solving nonlinear systems is designed. In the process of proving the convergence order, we use the higher derivatives of the function and show that the convergence order of this iterative method is six. In order to avoid the influence of the existence of higher derivatives on the proof of convergence, we mainly discuss the convergence of this iterative method under weak conditions. In Banach space, the local convergence of the iterative scheme is established by using the ω -continuity condition of the first-order Fréchet derivative, and the application range of the iterative method is extended. In addition, we also give the radius of a convergence sphere and the uniqueness of its solution. Finally, the superiority of the new iterative method is illustrated by drawing attractive basins and comparing them with the average iterative times of other same-order iterative methods. Additionally, we utilize this iterative method to solve both nonlinear systems and nonlinear matrix sign functions. The applicability of this study is demonstrated by solving practical chemical problems. [ABSTRACT FROM AUTHOR]

The aim of this paper is to propose an enhancement to the primary frequency control (PFC) of the San Cristobal Island hybrid wind–diesel power system (WDPS). Naturally, variable speed wind turbines (VSWT) provide negligible inertia. Therefore, various control strategies, i.e., modified synthetic inertial control, droop control and traditional inertial control, if introduced into VSWT, enable them to release hidden inertia. Based on these strategies, a WDPS has been simulated under seven different control strategies, to evaluate the power system performance for frequency regulation (FR). Furthermore, the student psychology-based algorithm (SBPA) methodology is used to optimize the WDPS control. The results show that modified synthetic inertial control is the most suitable approach to provide FR. However, further exhaustive research validates that droop control is a better alternative than modified synthetic inertial control due to the negligible system performance differences. In addition, droop control does not require a frequency derivative function in the control system. Therefore, the hybrid system is more robust. Moreover, it reduces the steady state error, which makes the power system more stable. In addition, a pitch compensation control is introduced in blade pitch angle control (BPAC) to enhance the pitch angle smoothness and to help the power system to return to normal after perturbations. Moreover, to justify the performance of hybrid WDPS, it is tested under certain real-world contingency events, i.e., loss of a wind generator, increased wind speed, fluctuating wind speed, and simultaneously fluctuating load demand and wind speed. The simulation results validate the proposed WDPS control strategy performance. [ABSTRACT FROM AUTHOR]

Quantum calculus can provide new insights into the nonlinear behaviour of functions and equations, addressing problems that may be difficult to tackle by classical calculus due to high nonlinearity. Iterative methods for solving nonlinear equations can benefit greatly from the mathematical theory and tools provided by quantum calculus, e.g., using the concept of q-derivatives, which extends beyond classical derivatives. In this paper, we develop parallel numerical root-finding algorithms that approximate all distinct roots of nonlinear equations by utilizing q-analogies of the function derivative. Furthermore, we utilize neural networks to accelerate the convergence rate by providing accurate initial guesses for our parallel schemes. The global convergence of the q-parallel numerical techniques is demonstrated using random initial approximations on selected biomedical applications, and the efficiency, stability, and consistency of the proposed hybrid numerical schemes are analyzed. [ABSTRACT FROM AUTHOR]

For derivative function estimation, conventional research only focuses on the derivative estimation of one-dimensional functions. This paper considers partial derivatives estimation of a multivariate variance function in a heteroscedastic model. A wavelet estimator of partial derivatives of a multivariate variance function is proposed. The convergence rates of a wavelet estimator under different estimation errors are discussed. It turns out that the strong convergence rate of the wavelet estimator is the same as the optimal uniform almost sure convergence rate of nonparametric function problems. [ABSTRACT FROM AUTHOR]

This study presents an efficient method using the local radial basis function finite difference scheme (RBF-FD). The innovative coefficients are derived from the integrals of the multiquadric (MQ) function. Theoretical convergence rates for the coefficients used in function derivative approximation are provided. The proposed scheme utilizes RBF-FD estimations on three-point non-uniform stencils to construct the final approximation on a tensor grid for the 3D Heston–Hull–White (HHW) PDE, which is relevant in economics and mathematical finance. Numerical evidence and comparative analyses validate the results and the proposed scheme. [ABSTRACT FROM AUTHOR]

Naturally occurring substances and their derivatives function as vital resources for pesticides that can be used in fields, such as insecticide production and fungicide development. As a botanical entity displaying multifaceted biological functions, wormwood has received thorough scrutiny across multiple sectors. The insect repellency potency combined with antibacterial and antifungal activities of wormwood position it as a potential candidate for prospective development into eco-friendly chemical pesticides. In this research, Wormwood essential oil was procured via ethanol water under ultrasonic scenarios and subsequently diluted with PEG 400 to formulate green chemical pesticides. The defensive efficacy of this green pesticide on plants was validated through 2 weeks of clustered plant growth experiments. Active constituents that exerted their effects were scrutinized by GC-MS. Furthermore, this green pesticide also displays efficacious effects on the prevention and management of aphids, exhibiting a dose-dependent relationship. 4-terpenol, eucalyptol, carvacrol, and L-borneol were identified by GC-MS as the predominant active constituents in this green chemical pesticide. Wormwood can be leveraged to develop green chemical pesticides, which can protect plants without contaminating the environment. [ABSTRACT FROM AUTHOR]

In this study, we introduce an iterative approach exhibiting sixth-order convergence for the solution of nonlinear equations. The method attains sixth-order convergence by using three evaluations of the function and two evaluations of the first-order derivative per iteration. We examined the theoretical convergence of our method through the convergence theorem, which substantiates the convergence order. Furthermore, we analyzed the local convergence of our proposed technique by employing a hypothesis that involves the first-order derivative of the function Θ alongside the Lipschitz conditions. To evaluate the performance and efficacy of our iterative method, we provide a comparative analysis against existing methods based on various standard numerical problems. Finally, graphical comparisons employing basins of attraction are presented to illustrate the dynamic behavior of the iterative method in the complex plane. [ABSTRACT FROM AUTHOR]

Water-soluble ligands based on a 1,10-phenanthroline core are relatively poorly studied compounds. Developing efficient and convenient syntheses of them would result in new interesting applications because of the importance of 1,10-phenanthrolines. In this manuscript, we describe novel and practical ways to introduce a carboxyl and, for the first time, a phenol and dithiocarboxyl group under mild reaction conditions. This strategy enables highly efficient and practical synthesis of suitable organosulfur compounds with high added value, high chemoselectivity, and a broad substrate range. We present the selective conversion of a hydroxydialdehyde in the form of 10-hydroxybenzo[h]quinoline-7,9-dicarbaldehyde into its derivative, unique hydroxydicarboxylic acid, by an oxidation procedure, giving 10-hydroxybenzo[h]quinoline-7,9-dicarboxylic acid. A similar procedure resulted in the formation of 9-methyl-1,10-phenanthroline-2-carboxylic acid by oxidation of commercially available neocuproine. An alternative method of obtaining 1,10-phenanthroline derivatives possessing carboxylic acid group can be based on the hydrolysis of ester or nitrile groups; however, this synthesis leads to unexpected products. Moreover, we apply Perkin condensation to synthesize a vinyl (or styryl) analog of 1,10-phenanthroline derivatives with phenol function. This reaction also demonstrates a new, simple, and efficient strategy for converting methyl derivatives of 1,10-phenanthroline. We anticipate that the new way of converting methyl will find wide application in chemical synthesis. [ABSTRACT FROM AUTHOR]