We consider a bitangential interpolation problem for operatorvalued functions defined on a general class of domains in Cn (including as particular cases, Cartan domains of types I, II and III) which satisfy a type of von Neumann inequality associated with the domain. The compact formulation of the interpolation conditions via a functional calculus with operator argument includes prescription of...

Approximation and Interpolation Employing Divergence–free Radial Basis Functions with Applications. (May 2002) Svenja Lowitzsch, Dipl., Georg-August University, Göttingen Co–Chairs of Advisory Committee: Dr. Francis J. Narcowich Dr. Joseph D. Ward Approximation and interpolation employing radial basis functions has found important applications since the early 1980’s in areas such as signal proc...

High-dimensional visualization is usually connected with large data processing. Because of dimensionality, it is nearly impossible to make a tessellation, like the Delaunay tessellation in E, followed by data interpolation. One possibility of data interpolation is the use of the Radial Basis Functions (RBF) interpolation. The RBF interpolation supports the interpolation of scattered data in d-d...

The spline-interpolation-based fast Fourier transform FFT algorithm, designated as the SFFT algorithm, is proposed in the present paper to further enhance the computational speed of simulating the multivariate stochastic processes. The proposed SFFT algorithm first introduces the spline interpolation technique to reduce the number of the Cholesky decomposition of a spectral density matrix and s...

We consider some algorithms for unconstrained minimization without derivatives that form linear or quadratic models by interpolation to values of the objective function. Then a new vector of variables is calculated by minimizing the current model within a trust region. Techniques are described for adjusting the trust region radius, and for choosing positions of the interpolation points that mai...

Radial basis function methods for interpolation to values of a function of several variables are particularly useful when the data points are in general positions, but hardly any sparsity occurs in the matrix of the linear system of interpolation equations. Therefore an iterative procedure for solving the system is studied. The k-th iteration calculates the element in a k-dimensional linear sub...

In traditional adaptive frequency sampling (AFS) techniques, it is inevitable to invert an matrix in order to solve for the coefficients of targeted rational interpolation functions, where is the number of samples. The ill-conditioned matrix of a large restricts traditional AFS techniques to an electromagnetic simulation accelerator for a circuit with few poles or narrow bandwidth responses. In...

In this paper, a Crank–Nicolson finite difference scheme based on cubic B-spline quasi-interpolation has been derived for the solution of coupled Burgers equations with Caputo–Fabrizio derivative. The first- and second-order spatial derivatives have approximated by first second quasi-interpolation. discrete obtained in way constitutes system algebraic associated bi-pentadiagonal matrix. We show...

High-resolution direction-of-arrival (DOA) estimation requires an accurate array response model, which is usually achieved by measuring the response for given directions of the sources and employing interpolation. This paper considers the array response interpolation and DOA estimation by coherently combing parametric modeling and interpolation techniques. The proposed method is to decompose th...