Loading…
Loading grant details…
| Funder | Swedish Research Council |
|---|---|
| Recipient Organization | Kth, Royal Institute of Technology |
| Country | Sweden |
| Start Date | Dec 01, 2023 |
| End Date | Nov 30, 2027 |
| Duration | 1,460 days |
| Number of Grantees | 1 |
| Roles | Principal Investigator |
| Data Source | Swedish Research Council |
| Grant ID | 2023-03762_VR |
The proposed research project aims to address the challenge of efficiently and reliably computing matrix functions for large matrices with particular structures.
Matrix functions are essential in a variety of fields, including natural science, systems and control, signal processing, data science, and quantum chemistry.
The project will develop new and efficient algorithms with a focus on evaluating polynomials and rational functions using a minimal number of matrix multiplications and left divisions.
To achieve this, the project will characterize a complete set of approximations and develop novel approximation theory methods that generalize classical methods. The project will also provide error analysis for both approximation and rounding errors.
Furthermore, the project will explore efficient and reliable algorithms for specific matrix structures, including hierarchical matrices and sparse matrices with decay properties. The developed algorithms will be publicly available as software for use by researchers in the relevant fields.
Kth, Royal Institute of Technology
Complete our application form to express your interest and we'll guide you through the process.
Apply for This Grant