A characterization of the approximation order for multivariate spline spaces
A compact variable metric algorithm for linearly constrained nonlinear minimax approximation
A descent algorithm for - approximation of continuous functions with values in unitary space
A fast iteration for uniform approximation
The paper gives such an iterative method for special Chebyshev approxiamtions that its order of convergence is . Somewhat comparable results are found in [1] and [2], based on another idea.
A method for determining constants in the linear combination of exponentials
Shifting a numerically given function we obtain a fundamental matrix of the linear differential system with a constant matrix . Using the fundamental matrix we calculate , calculating the eigenvalues of we obtain and using the least square method we determine .
A modification of Newton's method
A new formal approach to the rational interpolation problem.
A note on direct methods for approximations of sparse Hessian matrices
Necessity of computing large sparse Hessian matrices gave birth to many methods for their effective approximation by differences of gradients. We adopt the so-called direct methods for this problem that we faced when developing programs for nonlinear optimization. A new approach used in the frame of symmetric sequential coloring is described. Numerical results illustrate the differences between this method and the popular Powell-Toint method.
A parallel algorithm for discrete least squares rational approximation.
A remark on a class of universal hill functions
A Stable Method for the Evaluation of a Polynomial and of a Rational Function of One Variable
A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems
In this paper, we propose a method for the approximation of the solution of high-dimensional weakly coercive problems formulated in tensor spaces using low-rank approximation formats. The method can be seen as a perturbation of a minimal residual method with a measure of the residual corresponding to the error in a specified solution norm. The residual norm can be designed such that the resulting low-rank approximations are optimal with respect to particular norms of interest, thus allowing to take...
A Useful Identity for the Rational Hermite Interpolation Table.
Algorithm 50. Joining of Chebyshev series
Algorithms 52-53. Determination of an interpolating quintic spline function with equally spaced and double knots
Algorithms for Computing Shape Preserving Spline Approximations to Data.
An Algorithm for Discrete Linear Lp Approximation.
An Algorithm for Segment Approximation.
An algorithm for the computation of polynomial splines of odd degree
An Alternative Computational Method for the Approximation of Random Functions.