arXiv subjects
Publications and source records attributed to Olavi Nevanlinna.
We use metric functionals to build a weak topology associated with $d$-weak convergence on metric spaces. We also show the existence of a sequence in the space $C[0,1]$ that is unbounded in the sup-norm yet converges $d$-weakly. This points out an error in an earlier work.
In multicentric representation of piecewise holomorphic functions one combines Lagrange interpolation at roots of a polynomial $p$ with convergent power series of $p$ as the "coefficients" multiplying the Lagrange basis polynomials. When these power series are truncated one obtains Hermite interpolation polynomials. In this paper we first review different approaches to obtain multicentric representations with emphasis in piecewise constant holomorphic functions. When the polynomial is of degree $d$ and all power series are truncated after $n^{th}$ power, we formally arrive into a Hermite interpolation polynomial of degree $d(n+1)-1$. The natural way to represent Hermite interpolation is to have for each interpolation condition a basis polynomial which in this case leads to $d(n+1)$ basis polynomials. We then consider the numerical accumulation of errors in the different ways to represent and evaluate the Hermite interpolation. In the multicentric representation due to the convergence of the power series, numerical errors stay bounded as $n$ grows. When we assume that the piecewise constant holomorphic function takes the value $1$ in one of the components and vanishes in the other so that the Hermite interpolation agrees with just one basis polynomial, even then the truncated multicentric representation is favorable. In the general case one would take a linear combination of all $d(n+1)$ basis polynomials.
We introduce a notion of weak convergence in arbitrary metric spaces. Metric functionals are key in our analysis: weak convergence of sequences in a given metric space is tested against all the metric functionals defined on said space. When restricted to bounded sequences in normed linear spaces, we prove that our notion of weak convergence agrees with the standard one.
We investigate the existence of subinvariant metric functionals for commuting families of nonexpansive mappings in noncompact subsets of Banach spaces. Our findings underscore the practicality of metric functionals when searching for fixed points of nonexpansive mappings. To demonstrate this, we additionally investigate subsets of Banach spaces that have only nontrivial metric functionals. We particularly show that in certain cases every metric functional has a unique minimizer; thus, subinvariance implies the existence of a fixed point.
Intertwining analysis, algebra, numerical analysis and optimization, computing conjugate co-gradients of real-valued quotients gives rise to eigenvalue problems. In the linear Hermitian case, by inspecting optimal quotients in terms of taking the conjugate co-gradient for their critical points, a generalized folded spectrum eigenvalue problem arises. Replacing the Euclidean norm in optimal quotients with the $p$-norm, a matrix version of the so-called $p$-Laplacian eigenvalue problem arises. Such nonlinear eigenvalue problems seem to be naturally classified as being a special case of homogeneous problems. Being a quite general class, tools are developed for recovering whether a given homogeneous eigenvalue problem is a gradient eigenvalue problem. It turns out to be a delicate issue to come up with a valid quotient. A notion of nonlinear Hermitian eigenvalue problem is suggested. Cauchy-Schwarz quotients are introduced.
We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The motivation for organising these is the following. Suppose a particular functional calculus is applicable to p(A) but not directly to A. Using "multicentric calculus" one can represent functions using p(z) as a new variable allowing the functional calculus to be extended to apply to A. Classes of operators considered are increasing chains like finite rank, compact , Riesz, almost algebraic, quasialgebraic, biquasitriangular, quasitriangular, bounded.
We give an iteration scheme for finding zeros of maximal monotone operators in Hilbert spaces. We assume that the operator is defined in the whole space. The iterates converge strongly to a solution if there exists any, otherwise they tend to infinity. As an application we get a strongly convergent minimization scheme for convex functionals in Hilbert spaces.
In multicentric calculus one takes a polynomial $p$ with distinct roots as a new variable and represents complex valued functions by $\mathbb C^d$-valued functions, where $d$ is the degree of $p$. An application is e.g. the possibility to represent a piecewise constant holomorphic function as a convergent power series, simultaneously in all components of $|p(z)| \le ρ$. In this paper we study the necessary modifications needed, if we take a rational function $r=p/q$ as the new variable instead. This allows to consider functions defined in neighborhoods of any compact set as opposed to the polynomial case where the domains $|p(z)| \le ρ$ are always polynomially convex. Two applications are formulated. One giving a convergent power series expression for Sylvester equations $AX-XB =C$ in the general case of $A,B$ being bounded operators in Banach spaces with distinct spectra. The other application formulates a K-spectral result for bounded operators in Hilbert spaces.
This paper establishes some of the fundamental barriers in the theory of computations and finally settles the long-standing computational spectral problem. That is to determine the existence of algorithms that can compute spectra $\mathrm{sp}(A)$ of classes of bounded operators $A = \{a_{ij}\}_{i,j \in \mathbb{N}} \in \mathcal{B}(l^2(\mathbb{N}))$, given the matrix elements $\{a_{ij}\}_{i,j \in \mathbb{N}}$, that are sharp in the sense that they achieve the boundary of what a digital computer can achieve. Similarly, for a Schrödinger operator $H = -Δ+V$, determine the existence of algorithms that can compute the spectrum $\mathrm{sp}(H)$ given point samples of the potential function $V$. In order to solve these problems, we establish the Solvability Complexity Index (SCI) hierarchy and provide a collection of new algorithms that allow for problems that were previously out of reach. The SCI is the smallest number of limits needed in the computation, yielding a classification hierarchy for all types of problems in computational mathematics that determines the boundaries of what computers can achieve in scientific computing. In addition, the SCI hierarchy provides classifications of computational problems that can be used in computer-assisted proofs. The SCI hierarchy captures many key computational issues in the history of mathematics including the insolvability of the quintic, Smale's problem on the existence of iterative generally convergent algorithm for polynomial root finding, the computational spectral problem, inverse problems, optimisation etc.
Sylvester equations $AX-XB=C$ have unique solutions for all $C$ when the spectra of $A$ and $B$ are disjoint. Here $A$ and $B$ are bounded operators in Banach spaces. We discuss the existence of polynomials $p$ such that the spectra of $p(A)$ and $p(B)$ are well separated, either inside and outside of a circle or separated into different half planes. Much of the discussion is based on the following inclusion sets for the spectrum: $V_p(T)=\{λ\in \mathbb C \ : \ |p(λ)| \le \|p(T)\| \}$ where $T$ is a bounded operator. We also give an explicit series expansion for the solution in terms of $p(M)$, where $M=\begin{pmatrix} A&C\\ &B\end{pmatrix}$, in the case where the spectra of $A$ and $B$ lie in different components of $V_p(M)$ .
Based on Stokes' theorem we derive a non-holomorphic functional calculus for matrices, assuming sufficient smoothness near eigenvalues, corresponding to the size of related Jordan blocks. It is then applied to the complex conjugation function $τ: z \mapsto \overline z$. The resulting matrix agrees with the hermitian transpose if and only if the matrix is normal. Two other, as such elementary, approaches to define the complex conjugate of a matrix yield the same result.
We display methods that allow for computations of spectra, pseudospectra and resolvents of linear operators on Hilbert spaces and also elements in unital Banach algebras. The paper considers two different approaches, namely, pseudospectral techniques and polynomial numerical hull theory. The former is used for Hilbert space operators whereas the latter can handle the general case of elements in a Banach algebra. This approach leads to multicentric holomorphic calculus. We also discuss some new types of pseudospectra and the recently defined Solvability Complexity Index
In multicentric holomorphic calculus one represents the function $φ$ using a new polynomial variable $w=p(z)$ in such a way that when it is evaluated at the operator $A,$ then $p(A)$ is small in norm. Usually it is assumed that $p$ has distinct roots. In this paper we discuss two related problems, the separation of a compact set (such as the spectrum) into different components by a polynomial lemniscate, respectively the application of the Calculus to the computation and the estimation of the Riesz spectral projection. It may then become desirable the use of $p(z)^n$ as a new variable. We also develop the necessary modifications to incorporate the multiplicities in the roots.
Given any square matrix or a bounded operator $A$ in a Hilbert space such that $p(A)$ is normal (or similar to normal), we construct a Banach algebra, depending on the polynomial $p$, for which a simple functional calculus holds. When the polynomial is of degree $d$, then the algebra deals with continuous $\mathbb C^d$-valued functions, defined on the spectrum of $p(A)$. In particular, the calculus provides a natural approach to deal with nontrivial Jordan blocks and one does not need differentiability at such eigenvalues.
We develop a microspectral theory for quasinilpotent linear operators $Q$ (i.e., those with $σ(Q) = \{0}$) in a Banach space. When such $Q$ is not compact, normal, or nilpotent, the classical spectral theory gives little information, and a somewhat deeper structure can be recovered from microspectral sets in $\C$. Such sets describe, e.g., semigroup generation, resolvent properties, power boundedness as well as Tauberian properties associated to $zQ$ for $z \in \C$.