The presented method, based on combining symbolic and numerical steps to the approximation problem, provides approximate parameterizations of space algebraic curves from a small number of approximating arcs.
It also can be cast as a function approximation problem in which a complex target function is approximated by a weighted sum of multiple simpler functions, such as radial basis functions or wavelets.
Hence, we first discuss the corresponding analog approximation problem.
We will construct an approximation problem of (1.1a - 1.3 1.1a - 1.3
In Section 3 we construct an approximation problem of (1.1) and establish the uniform estimates of solutions for the approximation problem.
The superscript τ is used here to indicate that this is the τ th approximation problem, θ is a fixed value in τ th approximation problem.
It will be proved that, by updating θ and solving the approximation problem many times, the solution to the approximation problem converges.
Major open problems include the approximation problem and computer-algebra algorithms for checking identifiability.
This paper addresses the approximation problem of functions affected by unknown periodically time-varying disturbances.
In addition, the approximation problem of time-variant fuzzy systems is discussed.
System identification of polynomial and of rational systems is inherently an approximation problem.
