Results 1 to 10 of about 334,289 (236)
Generalization of the Kimeldorf-Wahba correspondence for constrained interpolation [PDF]
, 2016 In this paper, we extend the correspondence between Bayes' estimation and optimal interpolation in a Reproducing Kernel Hilbert Space (RKHS) to the case of linear inequality constraints such as boundedness, monotonicity or convexity. In the unconstrained
Bay, Xavier +2 more
core +7 more sources
Equidistribution of the Fekete points on the sphere [PDF]
, 2008 The Fekete points are the points that maximize a Vandermonde-type determinant that appears in the polynomial Lagrange interpolation formula. They are well suited points for interpolation formulas and numerical integration.
D.P. Hardin +10 more
core +2 more sources
Guaranteed passive parameterized admittance-based macromodeling [PDF]
, 2010 We propose a novel parametric macromodeling technique for admittance and impedance input-output representations parameterized by design variables such as geometrical layout or substrate features. It is able to build accurate multivariate macromodels that
Dhaene, Tom +2 more
core +2 more sources
The Leja method revisited: backward error analysis for the matrix exponential [PDF]
, 2016 The Leja method is a polynomial interpolation procedure that can be used to compute matrix functions. In particular, computing the action of the matrix exponential on a given vector is a typical application.
Caliari, Marco +3 more
core +2 more sources
Numerical Chebyshev Approximation by Interpolating Rationals [PDF]
Mathematics of Computation, 1972 The paper is concerned with the Chebyshev approximation of decay-type functions f ( x ) f(x) by interpolating rationals. The interpolating points are chosen to be the zeros of f ( x ) f(x) .
openaire +1 more source
Bivariate Hermite Interpolation and Numerical Curves
Journal of Approximation Theory, 1996 Here the authors return to their favorite theme of Hermite interpolation by bivariate algebraic polynomials of degree \(n\) given by a scheme \({\mathcal N}=\{m_1,\dots,m_s;n\}\) where \(m_1,\dots,m_s\) are non-negative integers, \(n\) is the degree of the polynomial and \(s\) is the length of \(\mathcal N\).
Gevorgian, Hovik V +2 more
openaire +2 more sources
Symbolic-numeric sparse interpolation of multivariate polynomials [PDF]
Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 2006 Prony's and other methods are used for symbolic interpolation using multivariate polynomials. The work includes an error analysis and an analysis of both the stability and the sensitivity of the process with the use of bounds on generalized eigenvalues. This is all for floating-point arithmetic and fixed precision.
Giesbrecht, Mark +2 more
openaire +5 more sources
Interpolation inequalities and spectral estimates for magnetic operators [PDF]
, 2018 We prove magnetic interpolation inequalities and Keller-Lieb-Thir-ring estimates for the principal eigenvalue of magnetic Schr{\"o}dinger operators. We establish explicit upper and lower bounds for the best constants and show by numerical methods that ...
Dolbeault, Jean +3 more
core +2 more sources
, 2017 A robust finite volume method for viscoelastic flow analysis on general unstructured meshes is developed. It is built upon a general-purpose stabilization framework for high Weissenberg number flows.
Bothe, Dieter +3 more
core +1 more source
Interpolation inequalities of numerical radius
Journal of Mathematical Inequalities, 2022 Summary: In this paper, we give several generalization and refinement of numerical radius inequalities of bounded linear operators on a complex Hilbert space. It is shown that the bounds obtained here are stronger than the known bounds of numerical radius inequalities.
openaire +1 more source