In this paper, the steepest descent algorithm without line search is proposed for p-Laplacian. Its search direction is the weighted preconditioned steepestdescent one, and step length is estimated by a formula except...
详细信息
In this paper, the steepest descent algorithm without line search is proposed for p-Laplacian. Its search direction is the weighted preconditioned steepestdescent one, and step length is estimated by a formula except the first iteration. Continuation method is applied for solving the p-Laplacian with very large p. Lots of numerical experiments are carried out on these algorithms. All numerical results show the algorithm without line search can cut down some computational time. Fast convergence of these new algorithms is displayed by their step length figures. These figures show that if search direction is the steepestdescent one, exact step lengths can be substituted properly with step lengths obtained by the formula. (C) 2013 Elsevier Inc. All rights reserved.
Aerodynamic characteristics of sub-orbital reusable launch Vehicle(SRLV) is *** algorithm of trimming is not applicable for *** paper studies on the optimal method using the steepestdescent *** the optimal object fun...
详细信息
ISBN:
(纸本)9781479970179
Aerodynamic characteristics of sub-orbital reusable launch Vehicle(SRLV) is *** algorithm of trimming is not applicable for *** paper studies on the optimal method using the steepestdescent *** the optimal object function by squaring the moment coefficient of the three *** the searching method through gradient *** the trimming result through iteration *** comparing different trimming algorithm,it proved validity and advantage of the trimming algorithm based on the steepest descent algorithm.
A feedforward amplifier, which is composed of several components, is an open loop system. Therefore, feedforward amplifiers are apt to deteriorate its performance according to the environmental changes even though the...
详细信息
ISBN:
(纸本)0780382552
A feedforward amplifier, which is composed of several components, is an open loop system. Therefore, feedforward amplifiers are apt to deteriorate its performance according to the environmental changes even though the cancellation performance and the linearization bandwidth of feedforward systems are superior to other linearization methods. A control method is needed for maintaining the original performance of feedforward amplifiers or to keep the desired performance within a little error bounds. In this paper, an adaptive control method using the steepest descent algorithm, which has a good convergence characteristic and is easy to implement, is suggested. The characteristics of the suggested control method compare with the characteristics of other control methods and the simulation results are presented.
Design and Simulation of the yaw steering algorithms are considered in this paper. Based on the adaptive filter theory, the algorithms by design may provide very encouraging numerical results to spaceborne Synthetic A...
详细信息
ISBN:
(纸本)9781728163741
Design and Simulation of the yaw steering algorithms are considered in this paper. Based on the adaptive filter theory, the algorithms by design may provide very encouraging numerical results to spaceborne Synthetic Aperture Radar (SAR) systems. the steepest descent algorithm is highly efficient in nature. Its yaw steering precision to Doppler centroid may reach to the level of 1e-12 Hz. The Kalman Filter based algorithm is particularly suitable to the situation when attitude errors of spacecraft platform should be considered. We compare the algorithms by design to the traditional method with computer simulations incorporating the SEASAT parameters. The numerical results demonstrate the performance gains to spaceborne SAR yaw steering.
In this paper, a steepestdescentalgorithm of Independent Component Analysis (ICA) is proposed. In contrast to most blind source separation algorithms, the method does not employ higher order statistics. A pre-whiten...
详细信息
ISBN:
(纸本)7900081585
In this paper, a steepestdescentalgorithm of Independent Component Analysis (ICA) is proposed. In contrast to most blind source separation algorithms, the method does not employ higher order statistics. A pre-whiten procedure is performed to de-correlating the sensor (mixed) signals before extracting vector. The proposed method is verified with computer simulation.
In this paper, we consider an iterative algorithm of parameter estimation suitable to precision SAR processing using chirp scaling. The parameters include Doppler centroid and effective radar speed. They are solved by...
详细信息
ISBN:
(纸本)9781728121680
In this paper, we consider an iterative algorithm of parameter estimation suitable to precision SAR processing using chirp scaling. The parameters include Doppler centroid and effective radar speed. They are solved by minimizing the total cost of both image contrast and energy balance to the image azimuth spectrum. The algorithm is based on the steepestdescent principle. To achieve stable convergence, the estimates are iterated in a turbo manner. We demonstrate its performance by computer simulations with the Chirp Scaling algorithm. It is verified that Doppler centroid and effective radar speed may converge to the optimum in a limited number of iterations.
In this paper, we study a variational inequality problem which is defined over the the solution of multiple set split common fixed point problem for a finite family of generalized demimetric mappings. We present an ac...
详细信息
In this paper, we study a variational inequality problem which is defined over the the solution of multiple set split common fixed point problem for a finite family of generalized demimetric mappings. We present an accelerated steepestdescentalgorithm for solving this problem and then establish strong convergence of the proposed method under standard and mild conditions. We apply our proposed algorithm to solve some problems, including variational inequalities over multiple set split feasibility problem, variational inequalities over multiple set split zero point problem and the convex optimization problem.
暂无评论