scispace - formally typeset
Search or ask a question
Topic

Linear approximation

About: Linear approximation is a research topic. Over the lifetime, 3901 publications have been published within this topic receiving 74764 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, the authors introduce arbitrary frequency weighting into the optimal Hankel-norm approximation problem for scalar, finite-dimensional, linear, time-invariant systems.

150 citations

Journal ArticleDOI
W. H. Highleyman1
01 Jun 1962
TL;DR: This paper is concerned with the study of a particular class of categorizers, the linear decision function, which can be empirically designed without making any assumptions whatsoever about either the distribution of the receptor measurements or the a priori probabilities of occurrence of the pattern classes, providing an appropriate pattern source is available.
Abstract: Many pattern recognition machines may be considered to consist of two principal parts, a receptor and a categorizer. The receptor makes certain measurements on the unknown pattern to be recognized; the categorizer determines from these measurements the particular allowable pattern class to which the unknown pattern belongs. This paper is concerned with the study of a particular class of categorizers, the linear decision function. The optimum linear decision function is the best linear approximation to the optimum decision function in the following sense: 1) "Optimum" is taken to mean minimum loss (which includes minimum error systems). 2) "Linear" is taken to mean that each pair of pattern classes is separated by one and only one hyperplane in the measurement space. This class of categorizers is of practical interest for two reasons: 1) It can be empirically designed without making any assumptions whatsoever about either the distribution of the receptor measurements or the a priori probabilities of occurrence of the pattern classes, providing an appropriate pattern source is available. 2) Its implementation is quite simple and inexpensive. Various properties of linear decision functions are discussed. One such property is that a linear decision function is guaranteed to perform at least as well as a minimum distance categorizer. Procedures are then developed for the estimation (or design) of the optimum linear decision function based upon an appropriate sampling from the pattern classes to be categorized.

150 citations

Journal ArticleDOI
TL;DR: A novel approach to contour error calculation of an arbitrary smooth path is proposed in this paper, based on coordinate transformation and circular approximation and incorporated in a position loop-based cross-coupled control structure.
Abstract: Reduction of contour error is the main control objective in contour-following applications. A common approach to this objective is to design a controller based on the contour error directly. In this case, the contour error estimation is a key factor in the contour-following operation. Contour error can be approximated by the linear distance from the actual position to the tangent line or plane at the desired position. This approach suffers from a significant error due to linear approximation. A novel approach to contour error calculation of an arbitrary smooth path is proposed in this paper. The proposed method is based on coordinate transformation and circular approximation. In this method, the contour error is represented by the coordinate of the actual position with respect to a specific virtual coordinate frame. The method is incorporated in a position loop-based cross-coupled control structure. An equivalent robust control system is used to establish stability of the closed-loop system. Experimental results demonstrate the efficiency and performance of the proposed contour error estimation algorithm and the motion control strategy.

149 citations

Journal ArticleDOI
TL;DR: After introducing an appropriate metric in the dual space and restricting ourselves to special parametrizations of the surfaces involved, linear approximation algorithms for developable NURBS surfaces, including multiscale approximations are derived.

147 citations

Journal ArticleDOI
TL;DR: In this paper, the authors proposed a method to analyze systems in a time scale which is varied depending on the state such as dt/d\tau = s(x) (where t and τ are the actual time scale and that of new one, respectively, and s is the function which they call time scaling function).
Abstract: In this note, we propose a method to analyze systems in a time scale which is varied depending on the state such as dt/d\tau = s(x) (where t and τ are the actual time scale and that of new one, respectively, and s(x) is the function which we call time scaling function). Analysis of the system in the new time scale τ enables us to investigate the intrinsic structure of the system. A linearization problem in the new time scale is formulated as wide-sense feedback equivalence and is solved. It is also shown that the time scaling function which makes the system linear is derived as the solution of differential equations.

144 citations


Network Information
Related Topics (5)
Nonlinear system
208.1K papers, 4M citations
92% related
Robustness (computer science)
94.7K papers, 1.6M citations
88% related
Matrix (mathematics)
105.5K papers, 1.9M citations
88% related
Differential equation
88K papers, 2M citations
87% related
Optimization problem
96.4K papers, 2.1M citations
87% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20237
202229
202197
2020134
2019124
2018147