Pole-Swapping Algorithms for the Eigenvalue Problem (Paperback)

Daan Camps

ISBN 10: 161197836X / ISBN 13: 9781611978360

Editore: Society for Industrial & Applied Mathematics,U.S., New York, 2025

Riguardo questo articolo

Paperback. Matrix eigenvalue problems arise in a wide variety of fields in science and engineering, so it is important to have reliable and efficient methods for solving them. Of the methods devised, bulge-chasing algorithms, such as the famous QR and QZ algorithms, are the most important. This book focuses on pole-swapping algorithms, a new class of methods that are generalizations of bulge-chasing algorithms and a bit faster and more accurate owing to their inherent flexibility. The pole-swapping theory developed by the authors sheds light on the functioning of the whole class of algorithms, including QR and QZ.The only book on the topic, Pole-Swapping Algorithms for the Eigenvalue Problem describes the state of the art on eigenvalue methods and provides an improved understanding and explanation of why these important algorithms work.AudienceThis book is for researchers and students in the field of matrix computations, software developers, and anyone in academia or industry who needs to understand how to solve eigenvalue problems, which are ubiquitous in science and engineering. Pole-swapping algorithms offer a refined generalization of traditional bulge-chasing methods such as QR and QZ, achieving higher speed and accuracy in solving matrix eigenvalue problems. This work unveils the underlying theory, equipping researchers, developers, and students to tackle complex computational challenges in science and engineering. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Codice articolo 9781611978360

Dati bibliografici

• Titolo: Pole-Swapping Algorithms for the Eigenvalue Problem (Paperback)
• Editore: Society for Industrial & Applied Mathematics,U.S., New York
• Data di pubblicazione: 2025
• Lingua: Inglese
• ISBN 10: 161197836X
• ISBN 13: 9781611978360
• Rilegatura: Paperback
• Condizione: new

Descrizione articolo

Riassunto

Matrix eigenvalue problems arise in a wide variety of fields in science and engineering, so it is important to have reliable and efficient methods for solving them. Of the methods devised, bulge-chasing algorithms, such as the famous QR and QZ algorithms, are the most important. This book focuses on pole-swapping algorithms, a new class of methods that are generalizations of bulge-chasing algorithms and a bit faster and more accurate owing to their inherent flexibility. The pole-swapping theory developed by the authors sheds light on the functioning of the whole class of algorithms, including QR and QZ.

The only book on the topic, Pole-Swapping Algorithms for the Eigenvalue Problem describes the state of the art on eigenvalue methods and provides an improved understanding and explanation of why these important algorithms work.

Audience
This book is for researchers and students in the field of matrix computations, software developers, and anyone in academia or industry who needs to understand how to solve eigenvalue problems, which are ubiquitous in science and engineering.

Informazioni sugli autori

Daan Camps is a quantum computing and HPC engineer in the Advanced Technologies Group at the National Energy Research Scientific Computing Center (NERSC) at Lawrence Berkeley National Laboratory. He worked as a postdoctoral researcher in the Applied Mathematics and Computational Research Division at Lawrence Berkeley National Laboratory and as a Ph.D. researcher in computer science at KU Leuven. His research interests span numerical linear algebra with an emphasis on eigenvalue problems, quantum computing and algorithms, high performance computing, and machine learning.

Thomas Mach is a postdoctoral researcher at the University of Potsdam, Germany. He has worked at KU Leuven, NU Astana, Kent State University, and the Max Planck Institute for Dynamics of Complex Technical Systems Magdeburg. His primary research interests are eigenvalue problems, structure matrices, ill-posed problems, and data assimilation.

Raf Vandebril is a professor at KU Leuven, Belgium. He has a passion for teaching, and his primary research interests link to numerical linear algebra and numerical analysis, with an emphasis on the design of fast algorithms for structured rank matrices and eigenvalue problems.

David S. Watkins is a professor emeritus of mathematics at Washington State University. He is the author or coauthor of four books and numerous research and expository papers in the field of matrix computations, with an emphasis on eigenvalue problems. He has also published in physics and chemistry journals on various topics, including ionospheric physics and nonlinear optics.