Nothing Special   »   [go: up one dir, main page]

You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
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

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (124)

Search Parameters:
Keywords = Newton type methods

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
25 pages, 7192 KiB  
Article
Quaternion-Based Non-Singular Terminal Sliding Mode Control of Quadrotor with a Two-Degree-of-Freedom Deformable Arm for Narrow Environments
by Luwei Liao, Zhong Yang, Xu Chen, Haoze Zhuo, Hongyu Xu, Nuo Xu and Danguo Cheng
Drones 2024, 8(11), 629; https://doi.org/10.3390/drones8110629 - 31 Oct 2024
Viewed by 436
Abstract
Conventional multi-rotors with limited deformation capability are unable to meet the traversal capability of complex and narrow environments. In order to solve the above problems, a novel type of deformable quadrotor with a two-degree-of-freedom arm, named QTDA, is proposed. Firstly, the overall structural [...] Read more.
Conventional multi-rotors with limited deformation capability are unable to meet the traversal capability of complex and narrow environments. In order to solve the above problems, a novel type of deformable quadrotor with a two-degree-of-freedom arm, named QTDA, is proposed. Firstly, the overall structural design of the QTDA is introduced, and its movement strategy is analyzed. Secondly, the Newton–Euler equations based on a quaternion are utilized to model the omnidirectional dynamics and kinematics of the system. Next, to tackle the multi-actuator control problem, a pseudo-inverse control allocation method is developed, along with an analysis of control allocation singularities. Furthermore, non-singular terminal sliding mode position control law and non-singular terminal sliding mode attitude control law based on a quaternion are designed. Finally, simulations are conducted to verify the effectiveness of the proposed control methods. The results demonstrate the QTDA’s ability to traverse both narrow horizontal and vertical environments, thereby validating the effectiveness of the approach presented in this paper. Full article
Show Figures

Figure 1

Figure 1
<p>Multi-rotors in different complex and narrow environments. (<b>a</b>) Multi-rotors in pipeline environments. (<b>b</b>) Multi-rotors in jungle environments.</p>
Full article ">Figure 2
<p>Different deformable multi-rotors. (<b>a</b>) Falanga’s [<a href="#B4-drones-08-00629" class="html-bibr">4</a>] multi-rotor. (<b>b</b>) Riviere’s [<a href="#B5-drones-08-00629" class="html-bibr">5</a>] multi-rotor. (<b>c</b>) Zhao’s [<a href="#B6-drones-08-00629" class="html-bibr">6</a>] multi-rotor. (<b>d</b>) Kamel’s [<a href="#B8-drones-08-00629" class="html-bibr">8</a>] multi-rotor. (<b>e</b>) Brescianini’s [<a href="#B9-drones-08-00629" class="html-bibr">9</a>] multi-rotor. (<b>f</b>) Li’s [<a href="#B10-drones-08-00629" class="html-bibr">10</a>] multi-rotor.</p>
Full article ">Figure 3
<p>The structure of the QTDA and the QTDA’s arm. (<b>a</b>) The structure of the QTDA. (<b>b</b>) The QTDA’s arm.</p>
Full article ">Figure 4
<p>QTDA traverses horizontal and vertical complex and narrow environment. (<b>a</b>) QTDA traverses horizontal complex and narrow environment. (<b>b</b>) QTDA traverses vertical complex and narrow environment.</p>
Full article ">Figure 5
<p>XY-axis singularity deformation flight of QTDA. (<b>a</b>) X-axis singularity deformation flight of QTDA. (<b>b</b>) Y-axis singularity deformation flight of QTDA.</p>
Full article ">Figure 6
<p>The whole control system framework of QTDA.</p>
Full article ">Figure 7
<p>Quaternion curves in omnidirectional attitude simulation. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>q</mi> <mn>0</mn> </msub> </semantics></math> of quaternion curves in omnidirectional attitude simulation. (<b>b</b>) <math display="inline"><semantics> <msub> <mi>q</mi> <mn>1</mn> </msub> </semantics></math> of quaternion curves in omnidirectional attitude simulation. (<b>c</b>) <math display="inline"><semantics> <msub> <mi>q</mi> <mn>2</mn> </msub> </semantics></math> of quaternion curves in omnidirectional attitude simulation. (<b>d</b>) <math display="inline"><semantics> <msub> <mi>q</mi> <mn>3</mn> </msub> </semantics></math> of quaternion curves in omnidirectional attitude simulation.</p>
Full article ">Figure 8
<p>Euler angle curves in omnidirectional attitude simulation. (<b>a</b>) Roll angle curve in omnidirectional attitude simulation. (<b>b</b>) Pitch angle curve in omnidirectional attitude simulation. (<b>c</b>) Yaw angle curve in omnidirectional attitude simulation.</p>
Full article ">Figure 9
<p>Motor <math display="inline"><semantics> <msub> <mi>n</mi> <mi>i</mi> </msub> </semantics></math> curves in attitude simulation. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>n</mi> <mn>1</mn> </msub> </semantics></math> curve in attitude simulation. (<b>b</b>) <math display="inline"><semantics> <msub> <mi>n</mi> <mn>2</mn> </msub> </semantics></math> curve in attitude simulation. (<b>c</b>) <math display="inline"><semantics> <msub> <mi>n</mi> <mn>3</mn> </msub> </semantics></math> curve in attitude simulation. (<b>d</b>) <math display="inline"><semantics> <msub> <mi>n</mi> <mn>4</mn> </msub> </semantics></math> curve in attitude simulation.</p>
Full article ">Figure 10
<p>Servo <math display="inline"><semantics> <msub> <mi>γ</mi> <mi>i</mi> </msub> </semantics></math> curves in attitude simulation. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>γ</mi> <mn>1</mn> </msub> </semantics></math> curve in attitude simulation. (<b>b</b>) <math display="inline"><semantics> <msub> <mi>γ</mi> <mn>2</mn> </msub> </semantics></math> curve in attitude simulation. (<b>c</b>) <math display="inline"><semantics> <msub> <mi>γ</mi> <mn>3</mn> </msub> </semantics></math> curve in attitude simulation. (<b>d</b>) <math display="inline"><semantics> <msub> <mi>γ</mi> <mn>4</mn> </msub> </semantics></math> curve in attitude simulation.</p>
Full article ">Figure 11
<p>Three−dimensional position simulation curve of QTDA.</p>
Full article ">Figure 12
<p>Position simulation curves of QTDA. (<b>a</b>) X−axis curve in position simulation of QTDA. (<b>b</b>) Y−axis curve in position simulation of QTDA. (<b>c</b>) Z−axis curve in position simulation of QTDA.</p>
Full article ">Figure 13
<p>Position simulation curves of QTDA in disturbance simulation. (<b>a</b>) X−axis simulation curves of QTDA in disturbance simulation. (<b>b</b>) Y−axis simulation curves of QTDA in disturbance simulation. (<b>c</b>) Z−axis simulation curves of QTDA in disturbance simulation.</p>
Full article ">Figure 14
<p>Quaternion curves in disturbance simulation. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>q</mi> <mn>0</mn> </msub> </semantics></math> of quaternion curves in disturbance simulation. (<b>b</b>) <math display="inline"><semantics> <msub> <mi>q</mi> <mn>1</mn> </msub> </semantics></math> of quaternion curves in disturbance simulation. (<b>c</b>) <math display="inline"><semantics> <msub> <mi>q</mi> <mn>2</mn> </msub> </semantics></math> of quaternion curves in disturbance simulation. (<b>d</b>) <math display="inline"><semantics> <msub> <mi>q</mi> <mn>3</mn> </msub> </semantics></math> of quaternion curves in disturbance simulation.</p>
Full article ">Figure 15
<p>Euler angle curves in disturbance simulation. (<b>a</b>) Roll curve in disturbance simulation. (<b>b</b>) Pitch curve in disturbance simulation. (<b>c</b>) Yaw curve in disturbance simulation.</p>
Full article ">Figure 16
<p>Different deformations simulation at <math display="inline"><semantics> <mrow> <mi>θ</mi> <mo>=</mo> <msup> <mn>90</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>β</mi> <mi>i</mi> </msub> </semantics></math> curve at <math display="inline"><semantics> <mrow> <mi>θ</mi> <mo>=</mo> <msup> <mn>90</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>. (<b>b</b>) Quaternion curve at <math display="inline"><semantics> <mrow> <mi>θ</mi> <mo>=</mo> <msup> <mn>90</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>. (<b>c</b>) Motor <math display="inline"><semantics> <msub> <mi>n</mi> <mi>i</mi> </msub> </semantics></math> curve at <math display="inline"><semantics> <mrow> <mi>θ</mi> <mo>=</mo> <msup> <mn>90</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>. (<b>d</b>) Servo <math display="inline"><semantics> <msub> <mi>γ</mi> <mi>i</mi> </msub> </semantics></math> curve at <math display="inline"><semantics> <mrow> <mi>θ</mi> <mo>=</mo> <msup> <mn>90</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 17
<p>Different deformations simulation at <math display="inline"><semantics> <mrow> <mi>ϕ</mi> <mo>=</mo> <msup> <mn>90</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>β</mi> <mi>i</mi> </msub> </semantics></math> curve at <math display="inline"><semantics> <mrow> <mi>ϕ</mi> <mo>=</mo> <msup> <mn>90</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>. (<b>b</b>) Quaternion curve at <math display="inline"><semantics> <mrow> <mi>ϕ</mi> <mo>=</mo> <msup> <mn>90</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>. (<b>c</b>) Motor <math display="inline"><semantics> <msub> <mi>n</mi> <mi>i</mi> </msub> </semantics></math> curve at <math display="inline"><semantics> <mrow> <mi>ϕ</mi> <mo>=</mo> <msup> <mn>90</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>. (<b>d</b>) Servo <math display="inline"><semantics> <msub> <mi>γ</mi> <mi>i</mi> </msub> </semantics></math> curve at <math display="inline"><semantics> <mrow> <mi>ϕ</mi> <mo>=</mo> <msup> <mn>90</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 18
<p>Three−dimensional curve of XY−axis deformation in horizontal narrow environment. (a) First step in horizontal narrow environment. (b) Second step in horizontal narrow environment. (c) Third step in horizontal narrow environment. (d) Fourth step in horizontal narrow environment.</p>
Full article ">Figure 19
<p>Deformation simulation in horizontal narrow environment. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>β</mi> <mi>i</mi> </msub> </semantics></math> curves at deformation simulation in horizontal narrow environment. (<b>b</b>) Quaternion curves at deformation simulation in horizontal narrow environment. (<b>c</b>) Euler angle curves at deformation simulation in horizontal narrow environment. (<b>d</b>) Position curves at deformation simulation in horizontal narrow environment.</p>
Full article ">Figure 20
<p>Three−dimensional curve of XY-axis deformation in vertical narrow environment. (a) First step in vertical narrow environment. (b) Second step in vertical narrow environment. (c) Third step in vertical narrow environment. (d) Fourth step in vertical narrow environment. (e) Fifth step in vertical narrow environment. (f) Sixth step in vertical narrow environment.</p>
Full article ">Figure 21
<p>Deformation simulation in vertical narrow environment. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>β</mi> <mi>i</mi> </msub> </semantics></math> curves at deformation simulation in vertical narrow environment. (<b>b</b>) Quaternion curves at deformation simulation in vertical narrow environment. (<b>c</b>) Euler angle curves at deformation simulation in vertical narrow environment. (<b>d</b>) Position curves at deformation simulation in vertical narrow environment.</p>
Full article ">
22 pages, 1273 KiB  
Article
Estimation of Lifetime Performance Index for Generalized Inverse Lindley Distribution Under Adaptive Progressive Type-II Censored Lifetime Test
by Shixiao Xiao, Xue Hu and Haiping Ren
Axioms 2024, 13(10), 727; https://doi.org/10.3390/axioms13100727 - 18 Oct 2024
Viewed by 525
Abstract
The lifetime performance index (LPI) is an important metric for evaluating product quality, and research on the statistical inference of the LPI is of great significance. This paper discusses both the classical and Bayesian estimations of the LPI under an adaptive progressive type-II [...] Read more.
The lifetime performance index (LPI) is an important metric for evaluating product quality, and research on the statistical inference of the LPI is of great significance. This paper discusses both the classical and Bayesian estimations of the LPI under an adaptive progressive type-II censored lifetime test, assuming that the product’s lifetime follows a generalized inverse Lindley distribution. At first, the maximum likelihood estimator of the LPI is derived, and the Newton–Raphson iterative method is adopted to solve the numerical solution due to the log-likelihood equations having no analytical solutions. If the exact distribution of the LPI is not available, then the asymptotic confidence interval and bootstrap confidence interval of the LPI are constructed. For the Bayesian estimation, the Bayesian estimators of the LPI are derived under three different loss functions. Due to the complex multiple integrals involved in these estimators, the MCMC method is used to draw samples and further construct the HPD credible interval of the LPI. Finally, Monte Carlo simulations are used to observe the performance of these estimators in terms of the average bias and mean squared error, and two practical examples are used to illustrate the application of the proposed estimation method. Full article
Show Figures

Figure 1

Figure 1
<p>Schematic representation of the adaptive progressive type-II censored test.</p>
Full article ">Figure 2
<p>(<b>a</b>) The diagram of the PDF. (<b>b</b>) The diagram of the HF.</p>
Full article ">Figure 3
<p>(<b>a</b>) Fitting of GILD on duration of remission. (<b>b</b>) Fitting of GILD on failure time.</p>
Full article ">Figure 4
<p>The partial derivatives of the log-likelihood function.</p>
Full article ">
17 pages, 4487 KiB  
Article
Multi-Body Dynamics Modeling and Simulation of Maglev Satellites
by Zongyu Li, Weijie Wang and Lifen Wang
Appl. Sci. 2024, 14(17), 7588; https://doi.org/10.3390/app14177588 - 28 Aug 2024
Viewed by 756
Abstract
The Lorentz force magnetic levitation gim2bal stabilized platform (LFMP), as a new generation of high-precision turntable for maglev satellites, can meet the requirements of future spacecraft for ultra-high attitude pointing accuracy and stability. To solve the problem of three-module multi-body attitude control under [...] Read more.
The Lorentz force magnetic levitation gim2bal stabilized platform (LFMP), as a new generation of high-precision turntable for maglev satellites, can meet the requirements of future spacecraft for ultra-high attitude pointing accuracy and stability. To solve the problem of three-module multi-body attitude control under maneuvering conditions, the platform subsystem is first dynamically modeled based on the second type of Lagrangian equation, and the payload subsystem is dynamically modeled based on the Newton–Euler method. Secondly, a multi-loop control system is designed, consisting of high-precision and fast attitude pointing control for the payload, position tracking control for the platform subsystem, and tracking control for the maglev module. The final simulation results verified the feasibility and effectiveness of the payload-centered control method. An evaluation of the stability with a specific model has been performed, and the attitude accuracy of the payload is within 0.00002° and the attitude stability is within 0.00005°/s. Full article
Show Figures

Figure 1

Figure 1
<p>Structure diagram of maglev satellite.</p>
Full article ">Figure 2
<p>A multi-body dynamic modeling scheme for LMFPs.</p>
Full article ">Figure 3
<p>Coordinate system definition diagram.</p>
Full article ">Figure 4
<p>Position vector definition diagram.</p>
Full article ">Figure 5
<p>Three-body High-precision attitude control scheme centered on payload.</p>
Full article ">Figure 6
<p>Control expectations. (<b>a</b>) Expected angle; (<b>b</b>) expected angular velocity; (<b>c</b>) expected angular acceleration.</p>
Full article ">Figure 6 Cont.
<p>Control expectations. (<b>a</b>) Expected angle; (<b>b</b>) expected angular velocity; (<b>c</b>) expected angular acceleration.</p>
Full article ">Figure 7
<p>Attitude accuracy of payload subsystem.</p>
Full article ">Figure 8
<p>Attitude stability of payload subsystem.</p>
Full article ">Figure 9
<p>Platform subsystem position control accuracy.</p>
Full article ">Figure 10
<p>Error in driving control of MM.</p>
Full article ">
20 pages, 351 KiB  
Article
Finite Element Method for a Fractional-Order Filtration Equation with a Transient Filtration Law
by Nurlana Alimbekova, Abdumauvlen Berdyshev, Muratkan Madiyarov and Yerlan Yergaliyev
Mathematics 2024, 12(16), 2519; https://doi.org/10.3390/math12162519 - 15 Aug 2024
Viewed by 708
Abstract
In this article, a numerical method is proposed and investigated for an initial boundary value problem governed by a fractional differential generalization of the nonlinear transient filtration law which describes fluid motion in a porous medium. This type of equation is widely used [...] Read more.
In this article, a numerical method is proposed and investigated for an initial boundary value problem governed by a fractional differential generalization of the nonlinear transient filtration law which describes fluid motion in a porous medium. This type of equation is widely used to describe complex filtration processes such as fluid movement in horizontal wells in fractured geological formations. To construct the numerical method, a high-order approximation formula for the fractional derivative in the sense of Caputo is applied, and a combination of the finite difference method with the finite element method is used. The article proves the uniqueness and continuous dependence of the solution on the input data in differential form, as well as the stability and convergence of the proposed numerical scheme. The linearization of nonlinear terms is carried out by the Newton method, which allows for achieving high accuracy in solving complex problems. The research results are confirmed by a series of numerical tests that demonstrate the applicability of the developed method in real engineering problems. The practical significance of the presented approach lies in its ability to accurately and effectively model filtration processes in shale formations, which allows engineers and geologists to make more informed decisions when designing and operating oil fields. Full article
Show Figures

Figure 1

Figure 1
<p>Error plots obtained for different orders of fractional derivatives.</p>
Full article ">
19 pages, 7143 KiB  
Article
Theoretical Evaluation of Lubrication Performance of Thrust-Type Foil Bearings in Liquid Nitrogen
by Hang Dou, Tao Jiang, Longgui He, Shuo Cheng, Xiaoliang Fang and Jimin Xu
Lubricants 2024, 12(7), 257; https://doi.org/10.3390/lubricants12070257 - 17 Jul 2024
Viewed by 691
Abstract
The development of reusable liquid rocket turbopumps has gradually highlighted the disadvantages of rolling bearings, particularly the contradiction between long service life and high rotational speed. It is critical to explore a feasible bearing scheme offering a long wear life and high stability [...] Read more.
The development of reusable liquid rocket turbopumps has gradually highlighted the disadvantages of rolling bearings, particularly the contradiction between long service life and high rotational speed. It is critical to explore a feasible bearing scheme offering a long wear life and high stability to replace the existing rolling bearings. In this study, liquid nitrogen is adopted to simulate the ultra-low temperature environment of liquid rocket turbopumps, and theoretical evaluations of the lubrication performance of thrust-type foil bearings in liquid nitrogen are conducted. A link-spring model for the bump foil structure and a thin-plate finite element model for the top foil structure are established. The static and dynamic characteristics of the bearings are analyzed using methods including the finite difference method, the Newton–Raphson iteration method, and the finite element method. Detailed analysis includes the effects of factors such as rotational speed, fluid film thickness, thrust disk tilt angle, and the friction coefficient of the bump foil interface on the static and dynamic characteristics of thrust-type foil bearings. The research results indicate that thrust-type foil bearings have a good load-carrying capacity and low frictional power consumption. The adaptive deformation of the foil structure increases the fluid film thickness, preventing dry friction due to direct contact between the rotor journal and the bearing surface. When faced with thrust disk tilt, the direct translational stiffness and damping coefficient of the bearing do not undergo significant changes, ensuring system stability. Based on the results of this study, the exceptional performance characteristics of thrust-type foil bearings make them a promising alternative to rolling bearings for the development of reusable liquid rocket turbopumps. Full article
(This article belongs to the Special Issue Aerospace Tribology)
Show Figures

Figure 1

Figure 1
<p>(<b>a</b>) Structural diagram of the thrust-type foil bearing, and (<b>b</b>) schematic diagram of the fluid film.</p>
Full article ">Figure 2
<p>Coordinate system of thrust-type bearing considering rotor misalignment.</p>
Full article ">Figure 3
<p>Link-spring model of bump foils.</p>
Full article ">Figure 4
<p>Flow diagram for calculating the static and dynamic characteristics of thrust-type foil bearings.</p>
Full article ">Figure 5
<p>Comparison between theoretical calculation results using analysis method developed in this study and experimental results in Dickman, 2010 [<a href="#B37-lubricants-12-00257" class="html-bibr">37</a>].</p>
Full article ">Figure 6
<p>Effect of (<b>a</b>) friction coefficient and (<b>b</b>) rotational speed on bump foil stiffness (<span class="html-italic">N</span> = 5, <span class="html-italic">h</span><sub>2</sub> = 10 μm).</p>
Full article ">Figure 7
<p>Distributions of (<b>a</b>) fluid film pressure and (<b>b</b>) foil deformation with thrust disk inclined at <math display="inline"><semantics> <mrow> <msub> <mi>φ</mi> <mi>x</mi> </msub> </mrow> </semantics></math> = 0.004° (speed = 2.5 × 10<sup>4</sup> r·min<sup>−1</sup>, <span class="html-italic">N</span> = 5, <span class="html-italic">h</span><sub>2</sub> = 10 μm, <span class="html-italic">μ</span> = 0.1, <span class="html-italic">η</span> = 0.1).</p>
Full article ">Figure 8
<p>Impact of friction coefficient on (<b>a</b>) static load and (<b>b</b>) friction torque of thrust pads (<span class="html-italic">N</span> = 5, <span class="html-italic">h</span><sub>2</sub> = 10 μm, <span class="html-italic">η</span> = 0.1).</p>
Full article ">Figure 9
<p>Impact of minimum initial fluid film thickness on (<b>a</b>) static load and (<b>b</b>) friction torque of thrust pads (<span class="html-italic">h<sub>t</sub></span> = 26 μm, <span class="html-italic">μ</span> = 0.1, <span class="html-italic">η</span> = 0.1).</p>
Full article ">Figure 10
<p>Impact of wedge height on (<b>a</b>) static load and (<b>b</b>) friction torque of thrust pads (<span class="html-italic">h</span><sub>2</sub> = 10 μm, <span class="html-italic">μ</span> = 0.1, <span class="html-italic">η</span> = 0.1).</p>
Full article ">Figure 11
<p>Impact of thrust disk inclination angle on (<b>a</b>) static load and (<b>b</b>) friction torque of thrust pads (speed = 2.5 × 10<sup>4</sup> r·min<sup>−1</sup>, <span class="html-italic">N</span> = 5, <span class="html-italic">h<sub>2</sub></span> = 10 μm, <span class="html-italic">μ</span> = 0.1, <span class="html-italic">η</span> = 0.1).</p>
Full article ">Figure 12
<p>Impact of thrust disk inclination angle on (<b>a</b>) static load and (<b>b</b>) friction torque of thrust-type foil bearings (speed = 2.5 × 10<sup>4</sup> r·min<sup>−1</sup>, <span class="html-italic">N</span> = 5, <span class="html-italic">h</span><sub>2</sub> = 10 μm, <span class="html-italic">μ</span> = 0.1, <span class="html-italic">η</span> = 0.1).</p>
Full article ">Figure 13
<p>Effect of excitation frequency ratio on (<b>a</b>) direct translational stiffness and (<b>b</b>) damping coefficients of thrust pads (<span class="html-italic">N</span> = 5, <span class="html-italic">h</span><sub>2</sub> = 10 μm, <span class="html-italic">μ</span> = 0.1, <span class="html-italic">η</span> = 0.1).</p>
Full article ">Figure 14
<p>Effect of friction coefficient on (<b>a</b>) direct translational stiffness and (<b>b</b>) damping coefficients of thrust pads (<span class="html-italic">N</span> = 5, <span class="html-italic">h</span><sub>2</sub> = 10 μm, <span class="html-italic">μ</span> = 0.1, <span class="html-italic">η</span> = 0.1).</p>
Full article ">Figure 15
<p>Effect of minimum initial fluid film thickness on (<b>a</b>) direct translational stiffness and (<b>b</b>) damping coefficients of thrust pads (<span class="html-italic">h<sub>t</sub></span> = 26 μm, <span class="html-italic">μ</span> = 0.1, <span class="html-italic">η</span> = 0.1).</p>
Full article ">Figure 16
<p>Effect of wedge height on (<b>a</b>) direct translational stiffness and (<b>b</b>) damping coefficients of thrust pads (<span class="html-italic">h</span><sub>2</sub> = 10 μm, <span class="html-italic">μ</span> = 0.1, <span class="html-italic">η</span> = 0.1).</p>
Full article ">Figure 17
<p>Effect of thrust disk inclination angle on the dynamic stiffness and dynamic damping coefficients of thrust-type foil bearings (speed = 2.5 × 10<sup>4</sup> r·min<sup>−1</sup>, <span class="html-italic">N</span> = 5, <span class="html-italic">h</span><sub>2</sub> = 10 μm, <span class="html-italic">μ</span> = 0.1, <span class="html-italic">η</span> = 0.1): (<b>a</b>,<b>b</b>) dynamic stiffness coefficients; (<b>c</b>,<b>d</b>) dynamic damping coefficients.</p>
Full article ">Figure 18
<p>Effect of thrust disk inclination angle on the (<b>a</b>) direct translational stiffness and (<b>b</b>) damping coefficients of the thrust-type foil bearings under different bump foil thickness ratios (rotational speed = 2.5 × 10<sup>4</sup> r·min<sup>−1</sup>, <span class="html-italic">N</span> = 5, <span class="html-italic">h</span><sub>2</sub> = 10 μm, <span class="html-italic">μ</span> = 0.1, <span class="html-italic">η</span> = 0.1).</p>
Full article ">
16 pages, 773 KiB  
Article
Data-Driven Method for Robust Recovery in 1-Bit Compressive Sensing with the Minimax Concave Penalty
by Cui Jia and Li Zhu
Mathematics 2024, 12(14), 2168; https://doi.org/10.3390/math12142168 - 10 Jul 2024
Viewed by 714
Abstract
With the advent of large-scale data, the demand for information is increasing, which makes signal sampling technology and digital processing methods particularly important. The utilization of 1-bit compressive sensing in sparse recovery has garnered significant attention due to its cost-effectiveness in hardware implementation [...] Read more.
With the advent of large-scale data, the demand for information is increasing, which makes signal sampling technology and digital processing methods particularly important. The utilization of 1-bit compressive sensing in sparse recovery has garnered significant attention due to its cost-effectiveness in hardware implementation and storage. In this paper, we first leverage the minimax concave penalty equipped with the least squares to recover a high-dimensional true signal xRp with k-sparse from n-dimensional 1-bit measurements and discuss the regularization by combing the nonconvex sparsity-inducing penalties. Moreover, we give an analysis of the complexity of the method with minimax concave penalty in certain conditions and derive the general theory for the model equipped with the family of sparsity-inducing nonconvex functions. Then, our approach employs a data-driven Newton-type method with stagewise steps to solve the proposed method. Numerical experiments on the synthesized and real data verify the competitiveness of the proposed method. Full article
Show Figures

Figure 1

Figure 1
<p>The robustness of MCPWP for various <span class="html-italic">k</span>, <math display="inline"><semantics> <mi>ϵ</mi> </semantics></math>, <math display="inline"><semantics> <mi>η</mi> </semantics></math> under <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>1000</mn> <mo>,</mo> <mo> </mo> <mi>n</mi> <mo>=</mo> <mn>500</mn> <mo>,</mo> <mo> </mo> <mi>μ</mi> <mo>=</mo> <mn>0.3</mn> </mrow> </semantics></math>. (<b>a</b>) <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> <mo>:</mo> <mn>2</mn> <mo>:</mo> <mn>20</mn> <mo>,</mo> <mo> </mo> </mrow> </semantics></math><math display="inline"><semantics> <mrow> <mi>ϵ</mi> <mo>=</mo> <mn>0.01</mn> <mo>,</mo> <mo> </mo> <mi>η</mi> <mo>=</mo> <mn>0.05</mn> </mrow> </semantics></math>; (<b>b</b>) <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>5</mn> <mo>,</mo> <mo> </mo> <mi>ϵ</mi> <mo>=</mo> <mn>0</mn> <mo>:</mo> <mn>0.1</mn> <mo>:</mo> <mn>1</mn> <mo>,</mo> <mo> </mo> <mi>η</mi> <mo>=</mo> <mn>0.05</mn> </mrow> </semantics></math>; (<b>c</b>) <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>5</mn> <mo>,</mo> <mo> </mo> <mi>μ</mi> <mo>=</mo> <mn>0.3</mn> <mo>,</mo> <mo> </mo> <mi>ϵ</mi> <mo>=</mo> <mn>0.01</mn> <mo>,</mo> <mo> </mo> <mi>η</mi> </mrow> </semantics></math> = 0:0.03:0.15.</p>
Full article ">Figure 2
<p>The SNR for different methods with different sparsities. <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>1000</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>n</mi> <mo>=</mo> <mn>500</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>k</mi> </mrow> </semantics></math> = 2:2:6, <math display="inline"><semantics> <mrow> <mi>μ</mi> <mo>=</mo> <mn>0.1</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>ϵ</mi> <mo>=</mo> <mn>0.05</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>η</mi> <mo>=</mo> <mn>0.01</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 3
<p>The exact probability and CPU time for different methods with different sparsities. <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>1000</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>n</mi> <mo>=</mo> <mn>500</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>k</mi> </mrow> </semantics></math> = 2:2:6, <math display="inline"><semantics> <mrow> <mi>μ</mi> <mo>=</mo> <mn>0.1</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>ϵ</mi> <mo>=</mo> <mn>0.05</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>η</mi> <mo>=</mo> <mn>0.01</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p>The SNR for different methods with different sparsities. <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>1000</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>n</mi> <mo>=</mo> <mn>500</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>k</mi> <mo>=</mo> <mn>5</mn> <mo>,</mo> </mrow> </semantics></math><math display="inline"><semantics> <mrow> <mi>μ</mi> <mo>=</mo> <mn>0.1</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>ϵ</mi> <mo>=</mo> <mn>0.1</mn> <mo>:</mo> <mn>0.2</mn> <mo>:</mo> <mn>0.05</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>η</mi> <mo>=</mo> <mn>0.01</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p>The exact probability and CPU time for different methods with different sparsities. <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>1000</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>n</mi> <mo>=</mo> <mn>500</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>k</mi> <mo>=</mo> <mn>5</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>μ</mi> <mo>=</mo> <mn>0.1</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>ϵ</mi> <mo>=</mo> <mn>0.1</mn> <mo>:</mo> <mn>0.2</mn> <mo>:</mo> <mn>0.5</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>η</mi> <mo>=</mo> <mn>0.01</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>The SNR for different methods with different sparsities. <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>1000</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>n</mi> <mo>=</mo> <mn>500</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>k</mi> <mo>=</mo> <mn>5</mn> <mo>,</mo> <mspace width="3.33333pt"/> </mrow> </semantics></math><math display="inline"><semantics> <mrow> <mi>μ</mi> <mo>=</mo> <mn>0.1</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>ϵ</mi> <mo>=</mo> <mn>0.05</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>η</mi> </mrow> </semantics></math> = 0.05:0.05:0.15.</p>
Full article ">Figure 7
<p>The exact probability and CPU time for different methods on the different sparsity. <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>1000</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>n</mi> <mo>=</mo> <mn>500</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>k</mi> <mo>=</mo> <mn>5</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>μ</mi> <mo>=</mo> <mn>0.1</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>ϵ</mi> <mo>=</mo> <mn>0.05</mn> <mo>,</mo> <mspace width="3.33333pt"/> <mi>η</mi> </mrow> </semantics></math> = 0.05:0.05:0.15.</p>
Full article ">Figure 8
<p>Comparison of different methods under 1-D real signal. <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>8000</mn> <mo>,</mo> <mo> </mo> <mi>n</mi> <mo>=</mo> <mn>2500</mn> <mo>,</mo> <mo> </mo> <mi>k</mi> <mo>=</mo> <mn>15</mn> <mo>,</mo> <mo> </mo> </mrow> </semantics></math><math display="inline"><semantics> <mrow> <mi>μ</mi> <mo>=</mo> <mn>0.1</mn> <mo>,</mo> <mo> </mo> <mi>ϵ</mi> <mo>=</mo> <mn>0.5</mn> <mo>,</mo> <mo> </mo> <mi>η</mi> <mo>=</mo> <mn>0.04</mn> </mrow> </semantics></math>.</p>
Full article ">
32 pages, 1967 KiB  
Article
Different Statistical Inference Algorithms for the New Pareto Distribution Based on Type-II Progressively Censored Competing Risk Data with Applications
by Essam A. Ahmed, Tariq S. Alshammari and Mohamed S. Eliwa
Mathematics 2024, 12(13), 2136; https://doi.org/10.3390/math12132136 - 7 Jul 2024
Viewed by 759
Abstract
In this research, the statistical inference of unknown lifetime parameters is proposed in the presence of independent competing risks using a progressive Type-II censored dataset. The lifetime distribution associated with a failure mode is assumed to follow the new Pareto distribution, with consideration [...] Read more.
In this research, the statistical inference of unknown lifetime parameters is proposed in the presence of independent competing risks using a progressive Type-II censored dataset. The lifetime distribution associated with a failure mode is assumed to follow the new Pareto distribution, with consideration given to two distinct competing failure reasons. Maximum likelihood estimators (MLEs) for the unknown model parameters, as well as reliability and hazard functions, are derived, noting that they are not expressible in closed form. The Newton–Raphson, expectation maximization (EM), and stochastic expectation maximization (SEM) methods are employed to generate maximum likelihood (ML) estimations. Approximate confidence intervals for the unknown parameters, reliability, and hazard rate functions are constructed using the normal approximation of the MLEs and the normal approximation of the log-transformed MLEs. Additionally, the missing information principle is utilized to derive the closed form of the Fisher information matrix, which, in turn, is used with the delta approach to calculate confidence intervals for reliability and hazards. Bayes estimators are derived under both symmetric and asymmetric loss functions, with informative and non-informative priors considered, including independent gamma distributions for informative priors. The Monte Carlo Markov Chain sampling approach is employed to obtain the highest posterior density credible intervals and Bayesian point estimates for unknown parameters and reliability characteristics. A Monte Carlo simulation is conducted to assess the effectiveness of the proposed techniques, with the performances of the Bayes and maximum likelihood estimations examined using average values and mean squared errors as benchmarks. Interval estimations are compared in terms of average lengths and coverage probabilities. Real datasets are considered and examined for each topic to provide illustrative examples. Full article
(This article belongs to the Special Issue Application of the Bayesian Method in Statistical Modeling)
Show Figures

Figure 1

Figure 1
<p>The effects of parameters <math display="inline"><semantics> <mi>α</mi> </semantics></math> and <math display="inline"><semantics> <mi>β</mi> </semantics></math> on the hazard function of <math display="inline"><semantics> <mrow> <mi>N</mi> <mi>P</mi> <mo>(</mo> <mi>α</mi> <mo>,</mo> <mi>β</mi> <mo>)</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p>Fitted and empirical CDFs associated with NP distribution for two causes.</p>
Full article ">Figure 3
<p>Q-Q plots associated with NP distribution for two causes.</p>
Full article ">Figure 4
<p>T-T plots associated with NP distribution for two causes.</p>
Full article ">Figure 5
<p>The MLE shape parameters with NP distribution.</p>
Full article ">Figure 6
<p>Contour plot of the log-likelihood function of <math display="inline"><semantics> <msub> <mi>α</mi> <mn>1</mn> </msub> </semantics></math> and <math display="inline"><semantics> <msub> <mi>α</mi> <mn>2</mn> </msub> </semantics></math>.</p>
Full article ">Figure 7
<p>MCMC trace plot (<b>first row</b>) and histogram (<b>second row</b>) of <math display="inline"><semantics> <mrow> <msub> <mi>α</mi> <mn>1</mn> </msub> <msub> <mi>α</mi> <mn>2</mn> </msub> <mo>,</mo> <mi>β</mi> <mo>,</mo> <mi>S</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <mi>H</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math> for electrical appliance dataset. Dashed lines (---) represent the posterior means and soled lines (—) represent the lower and upper bounds of the 95% probability interval.</p>
Full article ">Figure 8
<p>Relationship between the three censoring schemes, bias, and MSE values for different estimates of <math display="inline"><semantics> <msub> <mi>α</mi> <mn>1</mn> </msub> </semantics></math> at different sample sizes.</p>
Full article ">Figure 9
<p>Relationship between the three censoring schemes, bias, and MSE values for different estimates of <math display="inline"><semantics> <msub> <mi>α</mi> <mn>2</mn> </msub> </semantics></math> at different sample sizes.</p>
Full article ">Figure 10
<p>Relationship between the three censoring schemes, bias, and MSE values for different estimates of <math display="inline"><semantics> <mi>β</mi> </semantics></math> at different sample sizes.</p>
Full article ">Figure 11
<p>Relationship between the three censoring schemes, bias, and MSE values for different estimates of <math display="inline"><semantics> <mrow> <mi>S</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math> at different sample sizes.</p>
Full article ">Figure 12
<p>Relationship between the three censoring schemes, bias, and MSE values for different estimates of <math display="inline"><semantics> <mrow> <mi>H</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math> at different sample sizes.</p>
Full article ">
20 pages, 1485 KiB  
Article
Portfolio Optimization with Multi-Trend Objective and Accelerated Quasi-Newton Method
by Caiming Lin and Xinyi He
Symmetry 2024, 16(7), 821; https://doi.org/10.3390/sym16070821 - 30 Jun 2024
Viewed by 897
Abstract
We propose a portfolio optimization method with a multi-trend objective and an accelerated quasi-Newton method (MTO-AQNM). It leverages a BFGS-based quasi-Newton algorithm and incorporates an 1 regularization term and the self-funding constraint. The MTO is designed to identify multiple trend reversals. Different [...] Read more.
We propose a portfolio optimization method with a multi-trend objective and an accelerated quasi-Newton method (MTO-AQNM). It leverages a BFGS-based quasi-Newton algorithm and incorporates an 1 regularization term and the self-funding constraint. The MTO is designed to identify multiple trend reversals. Different trend reversals are asymmetric, and we hoped to extract rich and effective information from them. The AQNM adopts the BFGS method with the Wolfe conditions, which reduces computational complexity and improves convergence speed. We wanted to evaluate the performance of our algorithm through financial markets that were asymmetric in all respects. To this end, we conducted comprehensive experimental approaches on six benchmark data sets of real-world financial markets that were asymmetric in time, frequency, and asset type. Our method demonstrated superior performance over other state-of-the-art competitors across several mainstream evaluation metrics. Full article
(This article belongs to the Special Issue Symmetry or Asymmetry in Machine Learning)
Show Figures

Figure 1

Figure 1
<p>Flowchart of the whole MTO-AQNM strategy.</p>
Full article ">Figure 2
<p>Final cumulative wealths of MTO-AQNM with respect to <math display="inline"><semantics> <mi>τ</mi> </semantics></math> on six benchmark data sets (fix <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>0.005</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>η</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.8</mn> </mrow> </semantics></math>).</p>
Full article ">Figure 3
<p>Final cumulative wealths of MTO-AQNM with respect to <math display="inline"><semantics> <mi>γ</mi> </semantics></math> on six benchmark data sets (fix <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>η</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.8</mn> </mrow> </semantics></math>).</p>
Full article ">Figure 4
<p>Final cumulative wealths of MTO-AQNM with respect to <math display="inline"><semantics> <msub> <mi>η</mi> <mn>0</mn> </msub> </semantics></math> on six benchmark data sets (fix <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>0.005</mn> </mrow> </semantics></math>).</p>
Full article ">Figure 4 Cont.
<p>Final cumulative wealths of MTO-AQNM with respect to <math display="inline"><semantics> <msub> <mi>η</mi> <mn>0</mn> </msub> </semantics></math> on six benchmark data sets (fix <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>0.005</mn> </mrow> </semantics></math>).</p>
Full article ">Figure 5
<p>Cumulative wealth plots of portfolio optimization systems on six benchmark data sets.</p>
Full article ">Figure 6
<p>Final cumulative wealths of portfolio optimization systems with respect to transaction cost rate <math display="inline"><semantics> <mi>ρ</mi> </semantics></math> on six benchmark data sets.</p>
Full article ">
22 pages, 2411 KiB  
Article
Experimental Identification of the Translational Dynamics of a Novel Two-Layer Octocopter
by Mohamed Elhesasy, Rashed Khader, Tarek N. Dief, Mohamed M. Kamra, Mohamed Okasha and Saeed K. Alnuaimi
Drones 2024, 8(7), 286; https://doi.org/10.3390/drones8070286 - 26 Jun 2024
Viewed by 1595
Abstract
This paper proposes a systematic approach for identifying the translational dynamics of a novel two-layer octocopter. Initially, we derive the non-linear theoretical dynamic model of the conventional octocopter using the Newton–Euler formulation, aimed at obtaining a simplified model suitable for tuning PID gains [...] Read more.
This paper proposes a systematic approach for identifying the translational dynamics of a novel two-layer octocopter. Initially, we derive the non-linear theoretical dynamic model of the conventional octocopter using the Newton–Euler formulation, aimed at obtaining a simplified model suitable for tuning PID gains necessary for controller implementation. Following this, a controller is designed and tested in the Matlab/Simulink environment to ensure stable flight performance of the octocopter. Subsequently, the novel octocopter prototype is developed, fabricated, and assembled, followed by a series of outdoor flight tests conducted under various environmental conditions to collect data representing the flight characteristics of the two-layer vehicle in different scenarios. Based on the data recorded during flights, we identify the transfer functions of the translational dynamics of the modified vehicle using the prediction error method (PEM). The empirical model is then validated through different flight tests. The results presented in this study exhibit a high level of agreement and demonstrate the efficacy of the proposed approach to predict the octocopter’s position based only on motor inputs and initial states of the system. Despite the inherent non-linearity, significant aerodynamic interactions, and strongly coupled nature of the system, our findings highlight the robustness and reliability of the proposed approach, which can be used to identify the model of any type of multi-rotor or fixed-wing UAV, specifically when you have a challenging design. Full article
(This article belongs to the Section Drone Design and Development)
Show Figures

Figure 1

Figure 1
<p>The inertial and body frames of the octocopter.</p>
Full article ">Figure 2
<p>Octocopter model in Simulink.</p>
Full article ">Figure 3
<p>Controller architecture for octocopter.</p>
Full article ">Figure 4
<p>Roll state controller.</p>
Full article ">Figure 5
<p>Position state controller.</p>
Full article ">Figure 6
<p>Octocopter CAD model.</p>
Full article ">Figure 7
<p>Octocopter prototype.</p>
Full article ">Figure 8
<p>Flight test scenario.</p>
Full article ">Figure 9
<p>Comparison between measured and predicted data.</p>
Full article ">Figure 10
<p>Time history of the prediction error.</p>
Full article ">Figure A1
<p>Validation results of flight tests.</p>
Full article ">Figure A2
<p>Validation results of flight tests.</p>
Full article ">
13 pages, 287 KiB  
Article
On the Kantorovich Theory for Nonsingular and Singular Equations
by Ioannis K. Argyros, Santhosh George, Samundra Regmi and Michael I. Argyros
Axioms 2024, 13(6), 358; https://doi.org/10.3390/axioms13060358 - 28 May 2024
Viewed by 663
Abstract
We develop a new Kantorovich-like convergence analysis of Newton-type methods to solve nonsingular and singular nonlinear equations in Banach spaces. The outer or generalized inverses are exchanged by a finite sum of linear operators making the implementation of these methods easier than in [...] Read more.
We develop a new Kantorovich-like convergence analysis of Newton-type methods to solve nonsingular and singular nonlinear equations in Banach spaces. The outer or generalized inverses are exchanged by a finite sum of linear operators making the implementation of these methods easier than in earlier studies. The analysis uses relaxed generalized continuity of the derivatives of operators involved required to control the derivative and on real majorizing sequences. The same approach can also be implemented on other iterative methods with inverses. The examples complement the theory by verifying the convergence conditions and demonstrating the performance of the methods. Full article
(This article belongs to the Special Issue Differential Equations and Inverse Problems)
27 pages, 1020 KiB  
Article
Newtonian Property of Subgradient Method with Optimization of Metric Matrix Parameter Correction
by Elena Tovbis, Vladimir Krutikov and Lev Kazakovtsev
Mathematics 2024, 12(11), 1618; https://doi.org/10.3390/math12111618 - 22 May 2024
Viewed by 808
Abstract
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 [...] Read more.
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. Full article
(This article belongs to the Section Mathematics and Computer Science)
Show Figures

Figure 1

Figure 1
<p>The set <span class="html-italic">G</span> and its characteristics [<a href="#B28-mathematics-12-01618" class="html-bibr">28</a>].</p>
Full article ">Figure 2
<p>Selection of subgradient vectors for inexact one-dimensional descent in the method of solving systems of inequalities.</p>
Full article ">Figure 3
<p>Properties of vectors <span class="html-italic">a</span>, <span class="html-italic">b</span>, <span class="html-italic">c</span>, <span class="html-italic">p</span>.</p>
Full article ">
23 pages, 1168 KiB  
Article
Numerical Analysis for Sturm–Liouville Problems with Nonlocal Generalized Boundary Conditions
by Chein-Shan Liu, Chih-Wen Chang and Chung-Lun Kuo
Mathematics 2024, 12(8), 1265; https://doi.org/10.3390/math12081265 - 22 Apr 2024
Viewed by 907
Abstract
For the generalized Sturm–Liouville problem (GSLP), a new formulation is undertaken to reduce the number of unknowns from two to one in the target equation for the determination of eigenvalue. The eigenparameter-dependent shape functions are derived for using in a variable transformation, such [...] Read more.
For the generalized Sturm–Liouville problem (GSLP), a new formulation is undertaken to reduce the number of unknowns from two to one in the target equation for the determination of eigenvalue. The eigenparameter-dependent shape functions are derived for using in a variable transformation, such that the GSLP becomes an initial value problem for a new variable. For the uniqueness of eigenfunction an extra condition is imposed, which renders the right-end value of the new variable available; a derived implicit nonlinear equation is solved by an iterative method without using the differential; we can achieve highly precise eigenvalues. For the nonlocal Sturm–Liouville problem (NSLP), we consider two types of integral boundary conditions on the right end. For the first type of NSLP we can prove sufficient conditions for the positiveness of the eigenvalue. Negative eigenvalues and multiple solutions may exist for the second type of NSLP. We propose a boundary shape function method, a two-dimensional fixed-quasi-Newton method and a combination of them to solve the NSLP with fast convergence and high accuracy. From the aspect of numerical analysis the initial value problem of ordinary differential equations and scalar nonlinear equations are more easily treated than the original GSLP and NSLP, which is the main novelty of the paper to provide the mathematically equivalent and simpler mediums to determine the eigenvalues and eigenfunctions. Full article
(This article belongs to the Special Issue Numerical Analysis in Computational Mathematics)
Show Figures

Figure 1

Figure 1
<p>For example 6 of the first type nonlocal Sturm–Liouville problem, (<b>a</b>) the residuals and (<b>b</b>) numerical and exact solutions and error for the first eigenfunction; (<b>c</b>) the residuals and (<b>d</b>) numerical solution for the second eigenfunction.</p>
Full article ">Figure 2
<p>For example 7 of the first type nonlocal Sturm–Liouville problem, (<b>a</b>) the residuals and (<b>b</b>) numerical and exact solutions and errors.</p>
Full article ">Figure 3
<p>For example 8 of the second type nonlocal Sturm–Liouville problem, (<b>a</b>) the residuals and (<b>b</b>) numerical and exact solutions and error.</p>
Full article ">Figure 4
<p>For example 9 of the second type nonlocal Sturm–Liouville problem, (<b>a</b>) the residuals and (<b>b</b>) numerical and exact solutions and error.</p>
Full article ">Figure 5
<p>For example 9 comparing three solutions with different ended values.</p>
Full article ">Figure 6
<p>For example 6 solved by the FQNM, the improvements of (<b>a</b>) the residuals and (<b>b</b>) numerical and exact solutions and error.</p>
Full article ">Figure 7
<p>For example 7 solved by the FQNM, the improvements of (<b>a</b>) the residuals and (<b>b</b>) numerical and exact solutions and error.</p>
Full article ">Figure 8
<p>For example 8 comparing four solutions with different ended values. The first solution is obtained by the BSFM, while other solutions are obtained by the BSFM and FQNM.</p>
Full article ">
18 pages, 5664 KiB  
Article
A Numerical Method for Unstable Propagation of Damage in Fiber-Reinforced Plastics with an Implicit Static FE Solver
by Atsushi Kondo, Yutaro Watanabe, Kentaro Sakai, Yutaka Iwahori, Eiichi Hara and Hisaya Katoh
J. Compos. Sci. 2024, 8(4), 130; https://doi.org/10.3390/jcs8040130 - 2 Apr 2024
Viewed by 1036
Abstract
Finite element analyses of the propagation of damage such as fiber compressive failure and delamination have greatly contributed to the understanding of failure mechanisms of fiber-reinforced plastics owing to extensive studies on methodologies using Continuum Damage Mechanics and Fracture Mechanics. Problems without the [...] Read more.
Finite element analyses of the propagation of damage such as fiber compressive failure and delamination have greatly contributed to the understanding of failure mechanisms of fiber-reinforced plastics owing to extensive studies on methodologies using Continuum Damage Mechanics and Fracture Mechanics. Problems without the need for consideration of inertia, such as Double-Cantilever Beam tests, are usually solved by implicit FE solvers, and explicit FE solvers are appropriate for phenomena that progress with very high velocity such as impact problems. However, quasi-static problems with unstable damage propagation observed in experiments such as Open-Hole Compression tests are still not easy to solve for both types of solvers. We propose a method to enable the static FE solver to solve problems with unstable propagation of damage. In the present method, an additional process of convergence checks on the averaged energy release rate of damaged elements is incorporated in a conventional Newton–Raphson scheme. The feasibility of the present method was validated by two numerical examples consisting of analyses of Open-Hole Compression tests and Double-Cantilever Beam tests. The results of the analyses of OHC tests showed that the present method was applicable to problems with unstable damage propagation. In addition, the results from the analyses of DCB tests with the present method indicated that mesh density and loading history are not significantly influential to the solution. Full article
(This article belongs to the Special Issue Feature Papers in Journal of Composites Science in 2024)
Show Figures

Figure 1

Figure 1
<p>Stress distribution after failure path tracking is conducted.</p>
Full article ">Figure 2
<p>Modified program flow of implicit static FE solver.</p>
Full article ">Figure 3
<p>Three principal planes of potential failure in fiber-reinforced plastics.</p>
Full article ">Figure 4
<p>Numerical Integration in an element coordinate system.</p>
Full article ">Figure 5
<p>FEA model of an Open-Hole Compression Test.</p>
Full article ">Figure 6
<p>Damaged region in 0-degree layer before and after the crack propagation.</p>
Full article ">Figure 7
<p>Damaged region in 45-degree layer before and after the crack propagation.</p>
Full article ">Figure 8
<p>Typical damage of OHC specimen after failure.</p>
Full article ">Figure 9
<p>Relationship between Nominal Stress and Nominal Strain.</p>
Full article ">Figure 10
<p>FEA Model of a Double-Cantilever Beam Test.</p>
Full article ">Figure 11
<p>Deformed Shape and Damaged Region before and after the Crack Propagation.</p>
Full article ">Figure 12
<p>Relationship between Load and Displacement with Different Mesh Densities.</p>
Full article ">Figure 13
<p>Relationship between Load and Displacement with Different Lengths of Initial Crack.</p>
Full article ">
19 pages, 323 KiB  
Article
Asymptotically Newton-Type Methods without Inverses for Solving Equations
by Ioannis K. Argyros, Santhosh George, Stepan Shakhno, Samundra Regmi, Mykhailo Havdiak and Michael I. Argyros
Mathematics 2024, 12(7), 1069; https://doi.org/10.3390/math12071069 - 2 Apr 2024
Cited by 1 | Viewed by 1273
Abstract
The implementation of Newton’s method for solving nonlinear equations in abstract domains requires the inversion of a linear operator at each step. Such an inversion may be computationally very expensive or impossible to find. That is why alternative iterative methods are developed in [...] Read more.
The implementation of Newton’s method for solving nonlinear equations in abstract domains requires the inversion of a linear operator at each step. Such an inversion may be computationally very expensive or impossible to find. That is why alternative iterative methods are developed in this article that require no inversion or only one inversion of a linear operator at each step. The inverse of the operator is replaced by a frozen sum of linear operators depending on the Fréchet derivative of an operator. The numerical examples illustrate that for all practical purposes, the new methods are as effective as Newton’s but much cheaper to implement. The same methodology can be used to create similar alternatives to other methods using inversions of linear operators such as divided differences or other linear operators. Full article
21 pages, 370 KiB  
Article
Updating to Optimal Parametric Values by Memory-Dependent Methods: Iterative Schemes of Fractional Type for Solving Nonlinear Equations
by Chein-Shan Liu and Chih-Wen Chang
Mathematics 2024, 12(7), 1032; https://doi.org/10.3390/math12071032 - 29 Mar 2024
Viewed by 766
Abstract
In the paper, two nonlinear variants of the Newton method are developed for solving nonlinear equations. The derivative-free nonlinear fractional type of the one-step iterative scheme of a fourth-order convergence contains three parameters, whose optimal values are obtained by a memory-dependent updating method. [...] Read more.
In the paper, two nonlinear variants of the Newton method are developed for solving nonlinear equations. The derivative-free nonlinear fractional type of the one-step iterative scheme of a fourth-order convergence contains three parameters, whose optimal values are obtained by a memory-dependent updating method. Then, as the extensions of a one-step linear fractional type method, we explore the fractional types of two- and three-step iterative schemes, which possess sixth- and twelfth-order convergences when the parameters’ values are optimal; the efficiency indexes are 6 and 123, respectively. An extra variable is supplemented into the second-degree Newton polynomial for the data interpolation of the two-step iterative scheme of fractional type, and a relaxation factor is accelerated by the memory-dependent method. Three memory-dependent updating methods are developed in the three-step iterative schemes of linear fractional type, whose performances are greatly strengthened. In the three-step iterative scheme, when the first step involves using the nonlinear fractional type model, the order of convergence is raised to sixteen. The efficiency index also increases to 163, and a third-degree Newton polynomial is taken to update the values of optimal parameters. Full article
Back to TopTop