: a much smaller matrix called the Schur complement of .
In mathematics, the Lehmer–Schur algorithm (named after Derrick Henry Lehmer and Issai Schur) is a root-finding algorithm extending the idea of enclosing roots like in the one-dimensional bisection method to the complex plane.
Issai Schur (1875–1941), Lithuanian-German-Israeli mathematician
In numerical analysis, the Schur complement method, named after Issai Schur, is the basic and the earliest version of non-overlapping domain decomposition method, also called iterative substructuring.
This property was named after the early 20th century mathematician Issai Schur who showed that ℓ1 had the above property in his 1921 paper.
Schur function | Issai Schur | Michael Schur | Sylvia Schur | Schur's lemma | Schur complement method | Schur | Gustav-Adolf Schur |