جستجوی استاد راهنمای دانشگاهی

Peter Benner is a Professor and Director at the Max Planck Institute for Dynamics of Complex Technical Systems in Magdeburg, where he leads the Computational Methods in Systems and Control Theory group. He also holds an Honorarprofessor position for Mathematics at Otto-von-Guericke Universität Magdeburg since 2011. Benner has previously served as Managing Director of the Max Planck Institute during multiple periods (2013-2014, 2021-2022, and 2025-2026), demonstrating his leadership in the field. Benner's research focuses on Scientific Machine Learning, Numerical Linear and Multilinear Algebra, Model Order Reduction and Reduced-order Modeling, Numerical Methods in Systems and Control Theory, PDE Constrained Optimization, High-performance and Power-aware Computing, and Mathematical Software development. His work bridges theoretical mathematics with practical engineering applications, particularly addressing challenges in large-scale dynamical systems. Analysis of his recent publications reveals a strong emphasis on developing efficient computational methods for complex systems. Benner has pioneered approaches combining model order reduction with tensor methods to tackle high-dimensional problems in uncertainty quantification and PDE-constrained optimization. His work shows a consistent trend toward integrating data-driven techniques with traditional model-based approaches, particularly for nonlinear and parametric systems. Throughout his career, Benner has actively mentored students and collaborated with researchers worldwide, delivering numerous invited talks at prestigious institutions and conferences across Europe, North America, and Asia. His research has received significant funding, supporting the development of mathematical software and computational methods for industrial applications. Benner leads the Computational Methods in Systems and Control Theory department at the Max Planck Institute, which focuses on developing and implementing advanced numerical methods for large-scale dynamical systems. The group maintains strong connections with both theoretical mathematics and practical engineering applications, particularly in fluid dynamics, energy systems, and control theory.

• Scientific Machine Learning
• Numerical Linear Algebra
• Numerical Multilinear Algebra
• +۷ مورد دیگر

Lars Grasedyck is a Professor of Numerical Analysis at RWTH Aachen University. His research focuses on hierarchical matrices, tensor approximation, and numerical methods for partial differential equations and matrix equations. He has contributed to applications in biomedical engineering, particularly EEG/MEG inverse problems, and is involved in software development (HLIB, HLIB-pro). Education: Diploma and Ph.D. in Mathematics at Christian-Albrechts-Universität zu Kiel (1998, 2001), Postdoctoral work at Max Planck Institute, Leipzig (2002-2010). Research: Specializes in high-dimensional numerical methods, low-rank matrices, and tensors with applications in PDEs, uncertainty quantification, and biomedical modeling. Projects: Leads DFG-funded initiatives on adaptive tensor networks for parametric PDEs and tumor progression modeling. Advising: Supervises doctoral students including Thong Le, Maren Klever, and Dieter Moser. Software: Developed HLib and HLib-pro for hierarchical matrix computations. Conferences: Active in GAMM Fachausschuss Numerische Analysis, organizing workshops and symposia globally.

• Numerical Analysis
• Hierarchical Matrices
• Tensor Approximation
• +۷ مورد دیگر

Prof. Dr. André Uschmajew is a full professor and holds the Chair of Mathematical Data Science at the Institute of Mathematics, Faculty of Mathematics, Natural Sciences, and Materials Engineering, University of Augsburg, Germany. He has held prominent research and academic positions at institutions including the Max Planck Institute for Mathematics in the Sciences (Leipzig), University of Bonn, and EPF Lausanne. 2022–present: Chair of Mathematical Data Science, University of Augsburg 2017–2022: Research Group Leader, Max Planck Institute MiS Leipzig 2014–2017: Bonn Junior Fellow Professorship, University of Bonn 2013: Ph.D. in Mathematics, TU Berlin His research centers on the theoretical and computational aspects of low-rank tensor and matrix approximations, with deep connections to Riemannian optimization, functional analysis, and high-dimensional scientific computing. He investigates the geometry of low-rank varieties, convergence of alternating algorithms, and applications in data science and dynamical systems. His work combines rigorous mathematical analysis with algorithmic innovation. The recent publications (2023–2025) reflect a strong focus on optimization methods for low-rank structures, dynamical low-rank approximation for PDEs like the Vlasov-Poisson equation, randomized SVD, Sinkhorn-type algorithms with overrelaxation, and Kronecker product operator approximation. Key themes include convergence analysis, algorithmic acceleration, and applications in scientific computing and signal processing. Although no specific awards are listed, his publication record in top-tier journals such as Numerische Mathematik , SIAM Journal on Optimization , and Foundations of Computational Mathematics indicates significant recognition in applied mathematics and numerical analysis. He advises students and researchers in mathematical data science and numerical analysis, though specific advisees are not named. He teaches courses such as Kernel Methods and Linear Algebra II. He has collaborated with leading researchers including Bart Vandereycken, Daniel Kressner, and Wolfgang Hackbusch. His work is supported through institutional affiliations and likely research grants, though specific grants are not listed. He is actively involved in the development of numerical methods for high-dimensional problems, particularly using tensor networks and manifold optimization. He is affiliated with research teams at the University of Augsburg and previously led a group at the Max Planck Institute MiS Leipzig, focusing on mathematical aspects of data science and tensor methods.

• Numerical Analysis
• Tensor Methods
• Low-Rank Approximation
• +۷ مورد دیگر

Kathryn Lund is a Senior Computational Mathematician at the STFC Rutherford Appleton Laboratory in Didcot, UK, and a guest member of the Numerical Linear and Multilinear Algebra Team at the Max Planck Institute for Dynamics of Complex Technical Systems in Magdeburg, Germany. Her work aligns with the Mathematical Research Data Initiative (MaRDI) and focuses on numerical linear algebra, scientific computing, and high-performance computing. Education: Joint PhD in Mathematics (2015-2018) from Temple University and Bergische Universität Wuppertal. Her research interests include: Rounding-error analysis of algorithms Krylov subspace methods Matrix functions applied to multiple vectors Tensor t-product operations Recent work highlights advancements in reorthogonalized block Gram-Schmidt methods, with publications in SIMAX and arXiv. She also contributes to software development, including the BlockStab project. Active in international collaborations, Kathryn held postdoctoral positions at EPFL, Charles University, and the Max Planck Institute. She joined STFC in June 2024 after a career break in Zurich.

• Numerical Linear Algebra
• Scientific Computing
• High-Performance Computing
• +۵ مورد دیگر

Paul Breiding is a Professor for Mathematical Methods in Data Science at the University of Osnabrück, within the Faculty of Mathematics/Computer Science/Physics. He is part of the Applied Algebra and Data Analysis working group and the Research Unit Data Science. His research focuses on nonlinear algebra, metric algebraic geometry, and their applications in numerical methods and data science. He is a Fellow of the Junge Akademie Mainz and co-authored the book 'Metric Algebraic Geometry' with Kathlen Kohn and Bernd Sturmfels. His work includes developing the software HomotopyContinuation.jl (v.2.11), which is widely used for numerical algebraic geometry. His research interests span algebraic geometry, tensor decompositions, and computational methods. Recent publications investigate geometric properties of algebraic varieties, condition numbers in tensor approximations, and probabilistic aspects of algebraic structures. Key contributions include studies on the reach of algebraic manifolds, typical ranks of random tensors, and sensitivity analysis in numerical algorithms. His work bridges theoretical algebraic geometry with practical computational tools for data science applications. Software: HomotopyContinuation.jl (v.2.11) Labs/Teams: Applied Algebra and Data Analysis, Research Unit Data Science

• Nonlinear Algebra
• Metric Algebraic Geometry
• Numerical Algebraic Geometry
• +۳ مورد دیگر

Dr. Peter Lewintan is a researcher at the Faculty of Mathematics, Universität Duisburg-Essen. His work focuses on partial differential equations, Korn inequalities, elasticity theory, and mathematical analysis. He has contributed extensively to the study of continuum mechanics and applied mathematics, with a particular emphasis on foundational inequalities and their applications in material science. Research Interests: Partial Differential Equations Korn Inequalities and Functional Analysis Elasticity Theory and Nonlinear Mechanics Continuum Mechanics and Micromorphic Models Teaching and Academic Contributions: Lewintan has taught supplementary lectures for Analysis I and II courses, emphasizing rigorous mathematical foundations. His pedagogical approach includes detailed supplementary materials and live recordings for students. Key Publications: His recent work includes advancements in Korn-Maxwell-Sobolev inequalities, computational approaches to micromorphic models, and optimal inequality frameworks. These contributions highlight his expertise in both theoretical and applied mathematical research.

• Partial Differential Equations
• Continuum Mechanics
• Mathematical Analysis
• +۳ مورد دیگر

Sebastian Krämer is a researcher at the Institute for Geometry and Practical Mathematics at RWTH Aachen University, working under the supervision of Prof. Markus Bachmayr and Prof. Lars Grasedyck. His research focuses on tensor networks, low-rank approximations, and numerical methods for high-dimensional problems. He has made significant contributions to the field of tensor train formats and rank minimization techniques. Dr. Krämer's research interests span tensor networks, low-rank approximations, numerical linear algebra, high-dimensional approximation, tensor train formats, and machine learning optimization. His work centers on developing efficient algorithms for tensor decompositions, particularly focusing on alternating least squares methods, iteratively reweighted least squares approaches, and geometric constraints for tensor singular values. His research bridges theoretical numerical analysis with practical applications in high-dimensional data processing and scientific computing. His publication record shows a consistent output of high-quality work in top numerical analysis journals, with recent publications in 2024 demonstrating ongoing active research. His work demonstrates expertise in both theoretical aspects of tensor decompositions and practical implementation of numerical algorithms. He has developed several open-source toolboxes for tensor network arithmetic and tensor train feasibility problems, which have been widely used by the research community. Dr. Krämer has been actively involved in teaching, serving as a lecturer and assistant for various mathematics courses at RWTH Aachen, including Numerical Mathematics for mathematicians and civil engineers. He has also contributed to specialized research schools on high-dimensional approximation and deep learning, developing course materials and providing instruction. His professional activities include regular participation in the GAMM conference since 2017 and peer review activities for SIAM journals since 2015.

• Tensor Networks
• Low-Rank Approximations
• Numerical Linear Algebra
• +۴ مورد دیگر

Prof. Dr. rer. nat. Patrick Kürschner is a faculty member at the Mathematisch-Naturwissensch. Zentrum of Leipzig University of Applied Sciences (HTWK Leipzig) . He teaches mathematics and programming for engineering programs including Civil Engineers, BIM, INB, INM, and BIK. His office hours are on Tuesdays from 2:00-3:00 p.m. and by appointment. Research Focus : His work centers on Numerical and applied multilinear algebra with applications to large-scale eigenvalue problems, systems of equations, matrix equations, and matrix functions. He specializes in preconditioning techniques and low-rank approaches for matrix/tensor methods, solution methods for polynomial equations, mathematical systems and control theory (particularly model order reduction and linear-quadratic control), numerical optimization, digital signal processing, data science, and machine learning. Publication Trends : Dr. Kürschner's research spans Numerical Linear Algebra , Control Theory , and Scientific Computing . His work addresses problems in Large-scale Matrix Equations , Model Order Reduction , Polynomial System Solutions , and Low-rank Approximation for applications in Engineering and Data Science . Recent publications focus on efficient numerical methods for Lyapunov and Sylvester equations, time-limited balanced truncation, and connectome regression techniques.

• Numerical and applied multilinear algebra
• Large-scale eigenvalue problems
• Systems of equations
• +۱۱ مورد دیگر

Prof. Ehrhard Behrends is a Professor of Mathematics at the Department of Mathematics and Computer Science, Freie Universität Berlin. His research focuses on functional analysis, probability theory, and stochastic processes. He is also deeply involved in mathematical education and public outreach, having authored numerous popular mathematics books and articles. Key roles include leading the European Mathematical Society's Raising Public Awareness committee (2009–2015) and developing the mathematics portal mathematics-in-europe.eu . Behrends has organized major exhibitions like 'Mathematics for all the Senses' and contributed to initiatives such as the Year of Mathematics 2008. His work bridges advanced research with accessible communication, reflected in his books on Markov chains, analysis textbooks, and the Five Minutes of Mathematics column.

• Functional Analysis
• Probability Theory
• Stochastic Processes
• +۴ مورد دیگر

Yann Strozecki is an Associate Professor (Maître de Conférences HDR) at the University of Versailles Saint-Quentin, where he is based in the DAVID Laboratory and leads the ALMOST research team focused on algorithms and stochastic models. He is currently on a part-time assignment at LIGM, Gustave Eiffel University, and has previously held positions at LIP6 (RO team), Paris-Sud University (ALGO team), and completed a postdoctoral fellowship at the University of Toronto's Theory Group. He earned his PhD from Paris Diderot (Paris 7) under Arnaud Durand. His research lies at the intersection of theoretical computer science and discrete mathematics, with core interests in: Enumeration complexity, especially delay and space constraints Algorithmic game theory, particularly simple stochastic games (SSGs) Graph and matroid algorithms Cheminformatics and molecular structure generation Sparse polynomials and algebraic complexity Analysis of his recent publications reveals a strong trend in developing efficient enumeration algorithms with provable delay and space bounds, advancing the theoretical foundations of output-sensitive computation. He also contributes to practical algorithms for Cloud RAN scheduling and cheminformatics, often combining theoretical rigor with real-world applications. His work on geometric amortization and strategy improvement in SSGs demonstrates innovation in algorithm design. Notable scientific contributions include: Generic strategy improvement methods for SSGs Polynomial-delay enumeration via closure operations Efficient deterministic scheduling for low-latency networks Tools for molecular cage generation in chemistry Yann Strozecki actively supervises PhD and master’s students, including Noé Demange, Maël Guiraud, and Xavier Badin de Montjoye. He co-organizes the ALMOST team seminar and has advised numerous interns in algorithmics and game theory. His research has been supported through collaborations with Nokia Bell Labs (CIFRE thesis) and interdisciplinary projects in cheminformatics and networking.

• Enumeration Complexity
• Algorithmic Game Theory
• Simple Stochastic Games
• +۷ مورد دیگر

Terence Tao is an Australian-American mathematician and professor of mathematics at the University of California, Los Angeles (UCLA), where he holds the James and Carol Collins Chair in the College of Letters and Sciences. Widely regarded as one of the greatest living mathematicians, Tao has received numerous prestigious awards including the Fields Medal, the Breakthrough Prize in Mathematics, and the MacArthur Fellowship. Dr. Tao's educational background includes: Bachelor's and Master's degrees from Flinders University (1991) Ph.D. from Princeton University (1996) under Elias M. Stein Tao's research spans an extraordinary breadth of mathematical fields. He is particularly known for his work in harmonic analysis, partial differential equations, combinatorics, and analytic number theory. His research has included groundbreaking contributions to compressed sensing, the Green-Tao theorem on arithmetic progressions in prime numbers, and progress on the Navier-Stokes equations. Tao is renowned for his collaborative approach, having worked with over 60 co-authors throughout his career. Tao's publications demonstrate remarkable diversity across mathematical disciplines. His work shows strong trends in connecting seemingly disparate areas of mathematics, often bringing techniques from one field to solve problems in another. He has made significant contributions to both theoretical and applied mathematics, with applications ranging from signal processing to number theory. Among his numerous scientific achievements, Tao has received: Fields Medal (2006) Breakthrough Prize in Mathematics (2014) Royal Medal (2014) MacArthur Fellowship (2006) Crafoord Prize (2012) Princess of Asturias Award (2020) Tao has mentored numerous students throughout his career, with Monica Vișan among his doctoral students. He has secured significant research funding through prestigious awards including the Packard Fellowship, Sloan Fellowship, and Simons Investigator award. His collaborative research has been supported by multiple National Science Foundation grants. Tao maintains an active research group at UCLA and frequently collaborates with mathematicians worldwide. His blog and public lectures have made advanced mathematical concepts accessible to broader audiences, demonstrating his commitment to mathematical education and outreach.

• Harmonic analysis
• Partial differential equations
• Algebraic combinatorics
• +۵ مورد دیگر

Bin Gao is an Associate Professor at the Academy of Mathematics and Systems Science (AMSS), Chinese Academy of Sciences. He holds a Ph.D. in Applied Mathematics (2019, University of Chinese Academy of Sciences) and a B.Sc. in Mathematics (2014, Sichuan University). His postdoctoral experience includes positions at UCLouvain (2019-2021) and the University of Münster (2021-2022). Research Interests: Riemannian optimization, tensor computation, parallel/distributed algorithms for orthogonality constraints, machine learning applications. Key Contributions: Development of retraction-free methods on Stiefel manifolds, preconditioned Riemannian algorithms, and geometric frameworks for symplectic eigenvalue problems. Article Trends: Recent work focuses on overcoming the curse of dimensionality via manifold-based optimization, including distributed algorithms for Stiefel manifolds, graph-regularized tensor completion, and second-order methods for symplectic structures. Keywords span numerical analysis, quantum information, and machine learning. Scientific Awards: 2021 Zhong Jiaqing Mathematics Award 2018 Best Student Paper Award (CSIAM) 2018 CAS Special President Scholarship 2017 National Scholarship for Doctoral Students (China) 2016 Honor Student Award (International Workshop on Modern Optimization and Application) Advising & Collaborations: Collaborates with researchers from UCLouvain, University of Münster, and AMSS. Mentors students in Riemannian optimization and tensor computation. Leads the popman research group.

• Riemannian Optimization
• Tensor Computation
• Parallel/Distributed Computing
• +۵ مورد دیگر