Related papers: An operator approach to multipoint Pade approximat…
We describe a strategy for solving nonlinear eigenproblems numerically. Our approach is based on the approximation of a vector-valued function, defined as solution of a non-homogeneous version of the eigenproblem. This approximation step is…
Multipoint polynomial evaluation and interpolation are fundamental for modern symbolic and numerical computing. The known algorithms solve both problems over any field of constants in nearly linear arithmetic time, but the cost grows to…
We describe the set of inner functions of finite order in a multi-connected domain, then we consider an optimization formulation of the Pick-Nevanlinna interpolation problem, and we generalize it to Hermite type interpolation.
In this paper, we propose a method to approximate the fixed point of an operator in a Banach space. Using biorthogonal systems, this method is applied to build an approximation of the solution of a class of nonlinear partial…
Multipoint secant and interpolation methods are effective tools for solving systems of nonlinear equations. They use quasi-Newton updates for approximating the Jacobian matrix. Owing to their ability to more completely utilize the…
We prove that the Nevalinna-Pick algorithm provides different homeomorphisms between certain topological spaces of measures, analytic functions and sequences of complex numbers. This algorithm also yields a continued fraction expansion of…
In this paper we introduce a family of rational approximations of the reciprocal of a $\phi$-function involved in the explicit solutions of certain linear differential equations, as well as in integration schemes evolving on manifolds. The…
We give a characterization for the existence of a holomorphic interpolant on the unit polydisc $\mathbb{D}^n,$ $n\geq 2,$ for prescribed three-point Pick--Nevanlinna data. One of the key steps is a characterization for the existence of an…
A method is suggested for treating the well-known deficiency in the use of Pade approximants that are well suited for approximating rational functions, but confront problems in approximating irrational functions. We develop the approach of…
The main goal of the paper is to connect matrix polynomial biorthogonality on a contour in the plane with a suitable notion of scalar, multi-point Pad\'e approximation on an arbitrary Riemann surface endowed with a rational map to the…
We consider matrix orthogonal polynomials related to Jacobi type matrices of weights that can be defined in terms of a given matrix Pearson equation. Stating a Riemann-Hilbert problem we can derive first and second order differential…
Given a set of matrices, modeled as samples of a matrix-valued function, we suggest a method to approximate the underline function using a product approximation operator. This operator extends known approximation methods by exploiting the…
Nevanlinna-Pick interpolation and moment problems use the analytic structures provided by causality in order to provide rigorous bounds on smeared spectral functions. This proceedings discusses Nevanlinna-Pick interpolation and moment…
We consider the problem of finding approximate analytical solutions for nonlinear equations typical of physics applications. The emphasis is on the modification of the method of Pad\'e approximants that are known to provide the best…
Following ideas by Beardon, Minda and Baribeau, Rivard, Wegert in the context of the complex Schwarz-Pick Lemma, we use iterated hyperbolic difference quotients to prove a quaternionic multipoint Schwarz-Pick Lemma, in the context of the…
This paper concerns a commutant lifting theorem and a Nevanlinna-Pick type interpolation result in the setting of multipliers from vector-valued Drury-Arveson space to a large class of vector-valued reproducing kernel Hilbert spaces over…
In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.
The problem of computing recurrence coefficients of sequences of rational functions orthogonal with respect to a discrete inner product is formulated as an inverse eigenvalue problem for a pencil of Hessenberg matrices. Two procedures are…
We consider a framework for the construction of iterative schemes for operator equations that combine low-rank approximation in tensor formats and adaptive approximation in a basis. Under fairly general assumptions, we obtain a rigorous…
If $\fA$ is a unital weak-$*$ closed algebra of multiplication operators on a reproducing kernel Hilbert space which has the property $\bA_1(1)$, then the cyclic invariant subspaces index a Nevanlinna-Pick family of kernels. This yields an…