Asymptotic Properties of One-Step Estimator Obtained from an Optimal Step Size

1987 ◽  
Vol 3 (2) ◽  
pp. 305-306 ◽  
Author(s):  
Whitney K. Newey
Keyword(s):  
Asymptotic Properties ◽  
Step Size ◽  
Optimal Step Size ◽  
One Step

scholarly journals Optimal Method for Catastrophic Faults Diagnosis in RC Ladder Network

2016 ◽  
Vol 2016 ◽  
pp. 1-15
Author(s):  
Abhilasha Rani Goel ◽  
Mohd Wajid
Keyword(s):  
Integrated Circuit ◽  
Testing Procedure ◽  
Circuit Testing ◽  
Step Size ◽  
Optimal Method ◽  
Optimal Step Size ◽  
One Step ◽  
Ladder Network ◽  
Faults Diagnosis ◽  
Catastrophic Faults

The RC ladder network has been analyzed for various catastrophic fault detection using minimal number of measurements. Generally, electronic circuit testing procedure is very exhaustive and includes higher cost; the presented approach will save fault diagnosis time. It is not possible to analyze the big RC ladder network to give the good fault coverage, so the ladder network has been broken into segments of different sizes. However, if segment size is small, it will cause more area overhead compared to bigger step size in terms of the interconnections and pins on the integrated circuit. A systematic and detailed analysis for one-step, two-step, three-step, and four-step RC ladder networks has been carried out for various faults and optimal step size is proposed. It has been investigated that three measurements are optimal to localize different catastrophic faults in a RC ladder network.

scholarly journals SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure

2018 ◽  
Vol 12 (1) ◽  
pp. 224-243 ◽  
Author(s):  
Abdellah Bnouhachem ◽  
Themistocles Rassias
Keyword(s):  
Variational Inequality ◽  
Alternating Direction Method ◽  
Convex Programming Problem ◽  
Descent Direction ◽  
Computational Results ◽  
Step Size ◽  
Sqp Method ◽  
Separable Structure ◽  
Alternating Direction ◽  
Optimal Step Size

In this paper, we suggest and analyze a new alternating direction scheme for the separable constrained convex programming problem. The theme of this paper is twofold. First, we consider the square-quadratic proximal (SQP) method. Next, by combining the alternating direction method with SQP method, we propose a descent SQP alternating direction method by using the same descent direction as in [6] with a new step size ?k. Under appropriate conditions, the global convergence of the proposed method is proved. We show the O(1/t) convergence rate for the SQP alternating direction method. Some preliminary computational results are given to illustrate the efficiency of the proposed method.

THE FORWARD MAGNETOTELLURIC PROBLEM FOR AN INHOMOGENEOUS AND ANISOTROPIC STRUCTURE

Geophysics ◽  
1974 ◽  
Vol 39 (1) ◽  
pp. 56-68 ◽  
Author(s):  
Flavian Abramovici
Keyword(s):  
Three Dimensional ◽  
Middle Layer ◽  
Conductivity Tensor ◽  
Dimensional Structure ◽  
Impedance Tensor ◽  
Variable Step Size ◽  
Step Size ◽  
Variable Step ◽  
One Step ◽  
Numerical Integration Procedure

The impedance tensor corresponding to the magnetotelluric field for a nonisotropic one‐dimensional structure is given in terms of the solutions of a sixth‐order differential system. The conductivity tensor is three‐dimensional. Its components depend upon depth only in an arbitrary manner such that the corresponding matrix is positive definite. The impedance tensor components are found by a numerical integration procedure based on a set of one‐step methods and a variable step‐size to insure a given accuracy in the final result. Calculations were made for three models having sharp boundaries and also transitional layers. The first of these models has a middle layer of high conductivity, sandwiched between two layers of linearly varying conductivity, while in the second model the middle layer has a very low conductivity. In the third model the conductivity tensor is three‐dimensional and is linearly varying in one of the layers.

Sign in / Sign up

Export Citation Format

Share Document