Related papers: Randomized Verblunsky Parameters in Steklov's Prob…

We study the space of orthogonally additive $n$-homogeneous polynomials on $C(K)$. There are two natural norms on this space. First, there is the usual supremum norm of uniform convergence on the closed unit ball. As every orthogonally…

In this paper we introduce and discuss some classes of orthogonal polynomials in several non-commuting variables. The emphasis is on a non-commutative version of the orthogonal polynomials on the real line. We introduce recurrence equations…

Spectral approximation by polynomials on the unit ball is studied in the frame of the Sobolev spaces $W^{s}_p(\ball)$, $1<p<\infty$. The main results give sharp estimates on the order of approximation by polynomials in the Sobolev spaces…

Let $d\nu$ be a measure in $\mathbb{R}^d$ obtained from adding a set of mass points to another measure $d\mu$. Orthogonal polynomials in several variables associated with $d\nu$ can be explicitly expressed in terms of orthogonal polynomials…

We consider the dependence of non-zero Steklov eigenvalues on smooth perturbations of the domain boundary. We prove that these eigenvalues are generically simple under such boundary perturbations. This result complements our previous work…

This paper contains some estimates for the {\it integral-uniform} norm and the uniform norm of a wide class of random polynomials. The family of integral-uniform norms introduced by Kasin and Tzafriri is a natural generalization of the…

We establish a direct correspondence between the Lanczos approach and the orthogonal polynomials approach in random matrix theory. In the large-$N$ and continuum limits, the average Lanczos coefficients and the recursion coefficients become…

By using a generalization of Sturm-Liouville problems in discrete spaces, a basic class of symmetric orthogonal polynomials of a discrete variable with four free parameters, which generalizes all classical discrete symmetric orthogonal…

Randomized orthogonal projection methods (ROPMs) can be used to speed up the computation of Krylov subspace methods in various contexts. Through a theoretical and numerical investigation, we establish that these methods produce…

This publication is an exercise which extends to two variables the Christoffel's construction of orthogonal polynomials for potentials of one variable with external sources. We generalize the construction to biorthogonal polynomials. We…

A classical theorem of Wendroff shows that one may reconstructs a sequence of orthogonal polynomials on the real line from two non-constant polynomials of consecutive degrees whose zeros strictly interlace on the real line. In this note we…

We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show…

This paper is devoted to present new error bounds of regularized gap functions for polynomial variational inequalities with exponents explicitly determined by the dimension of the underlying space and the number/degree of the involved…

This paper introduces a new strategy for setting the regularization parameter when solving large-scale discrete ill-posed linear problems by means of the Arnoldi-Tikhonov method. This new rule is essentially based on the discrepancy…

We consider the most general class of linear boundary-value problems for higher-order ordinary differential systems whose solutions and right-hand sides belong to the corresponding Sobolev spaces. For parameter-dependent problems from this…

Orthogonal polynomials appear naturally in the study of compositions of M\"obius transformations. In this paper, we consider several classes of orthogonal polynomials associated to non-autonomous perturbations of a parabolic M\"obius map.…

Randomized Krylov subspace methods that employ the sketch-and-solve paradigm to substantially reduce orthogonalization cost have recently shown great promise in speeding up computations for many core linear algebra tasks (e.g., solving…

In this paper we consider random block matrices, which generalize the general beta ensembles, which were recently investigated by Dumitriu and Edelmann (2002, 2005). We demonstrate that the eigenvalues of these random matrices can be…

We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…

Error estimates for approximations of harmonic functions on planar regions by subspaces spanned by the first harmonic Steklov eigenfunctions are found. They are based on the explicit representation of harmonic functions in terms of these…