Miroslav Fiedler

Miroslav Fiedler (7 April 1926 – 20 November 2015) was a Czech mathematician known for his contributions to linear algebra, graph theory and algebraic graph theory.

Miroslav Fiedler
Born7 April 1926
Prague, Czechoslovakia[1]
Died20 November 2015(2015-11-20) (aged 89)
Alma materCharles University, Prague
Scientific career
Fieldslinear algebra[2]
graph theory
Euclidean geometry
InstitutionsInstitute of Computer Science, The Czech Academy of Sciences
Websitewww.cs.cas.cz/fiedler/

His article, "Algebraic Connectivity of Graphs", published in the Czechoslovak Math Journal in 1973, established the use of the eigenvalues of the Laplacian matrix of a graph to create tools for measuring algebraic connectivity in algebraic graph theory.[3] Fiedler is honored by the Fiedler eigenvalue (the second smallest eigenvalue of the graph Laplacian), with its associated Fiedler eigenvector, as the names for the quantities that characterize algebraic connectivity. Since Fiedler's original contribution, this structure has become essential to large areas of research in network theory, flocking, distributed control, clustering, multi-robot applications and image segmentation.[4]

References
  1. http://www-groups.dcs.st-and.ac.uk/~history/Biographies/Fiedler.html
  2. http://www.cs.cas.cz/fiedler/
  3. Algebraic connectivity of graphs. Czechoslovak Math. J. 23(98):298 - 305 (1973).
  4. prof. RNDr. Miroslav Fiedler, DrSc. Archived 2015-12-07 at the Wayback Machine (in Czech)
  • Home page at the Academy of Sciences of the Czech Republic.
  • O'Connor, John J.; Robertson, Edmund F., "Miroslav Fiedler", MacTutor History of Mathematics archive, University of St Andrews.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.