Pick matrix
Pick matrix is a problem in complex analysis.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 18, 2026 · revision 2495593678
- Described as
- problem in complex analysis
- What it is
- mathematical concept
- Wikipedias with a page
- 3
Wikidata item Q7190737 (wikidata.org/wiki/Q7190737), public domain (CC0). Copied 2026-11-18.
What Wikipedia says · copied November 18, 2026 · revision 1364563439
In complex analysis, given initial data consisting of n points λ1,…,λn in the complex unit disk 𝔻 and target data consisting of n points z1,…,zn in 𝔻, the Nevanlinna–Pick interpolation problem is to find a holomorphic function φ that interpolates the data, that is for all i∈{1,...,n},
φ(λi)=zi,
subject to the constraint |φ(λ)|≤1 for all λ∈𝔻.
Georg Pick and Rolf Nevanlinna solved the problem independently in 1916 and 1919 respectively, showing that an interpolating function exists if and only if a matrix defined in terms of the initial and target data is positive semi-definite.
From the Wikipedia article “Nevanlinna–Pick interpolation” (en.wikipedia.org/wiki/Nevanlinna–Pick_interpolation), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
