New Strategies Based on Hierarchical Matrices for Matrix Polynomial Evaluation in Exascale Computing Era

Advancements in computing platform deployment have acted as both push and pull elements for the advancement of engineering design and scientific knowledge. Historically, improvements in computing platforms were mostly dependent on simultaneous developments in hardware, software, architecture, and al...

Full description

Saved in:
Bibliographic Details
Main Authors: Luisa Carracciuolo, Valeria Mele
Format: Article
Language:English
Published: MDPI AG 2025-04-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/13/9/1378
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849312753842388992
author Luisa Carracciuolo
Valeria Mele
author_facet Luisa Carracciuolo
Valeria Mele
author_sort Luisa Carracciuolo
collection DOAJ
description Advancements in computing platform deployment have acted as both push and pull elements for the advancement of engineering design and scientific knowledge. Historically, improvements in computing platforms were mostly dependent on simultaneous developments in hardware, software, architecture, and algorithms (a process known as co-design), which raised the performance of computational models. But, there are many obstacles to using the Exascale Computing Era sophisticated computing platforms effectively. These include but are not limited to massive parallelism, effective exploitation, and high complexity in programming, such as heterogeneous computing facilities. So, now is the time to create new algorithms that are more resilient, energy-aware, and able to address the demands of increasing data locality and achieve much higher concurrency through high levels of scalability and granularity. In this context, some methods, such as those based on hierarchical matrices (HMs), have been declared among the most promising in the use of new computing resources precisely because of their strongly hierarchical nature. This work aims to start to assess the advantages, and limits, of the use of HMs in operations such as the evaluation of matrix polynomials, which are crucial, for example, in a Graph Convolutional Deep Neural Network (GC-DNN) context. A case study from the GCNN context provides some insights into the effectiveness, in terms of accuracy, of the employment of HMs.
format Article
id doaj-art-d33523f4afbd4f8ba7e78887e23ef592
institution Kabale University
issn 2227-7390
language English
publishDate 2025-04-01
publisher MDPI AG
record_format Article
series Mathematics
spelling doaj-art-d33523f4afbd4f8ba7e78887e23ef5922025-08-20T03:52:57ZengMDPI AGMathematics2227-73902025-04-01139137810.3390/math13091378New Strategies Based on Hierarchical Matrices for Matrix Polynomial Evaluation in Exascale Computing EraLuisa Carracciuolo0Valeria Mele1The Institute of Polymers, Composites, and Biomaterials (IPCB), National Research Council (CNR), 80078 Pozzuoli, ItalyDepartment of Mathematics, University of Naples Federico II, 80138 Napoli, ItalyAdvancements in computing platform deployment have acted as both push and pull elements for the advancement of engineering design and scientific knowledge. Historically, improvements in computing platforms were mostly dependent on simultaneous developments in hardware, software, architecture, and algorithms (a process known as co-design), which raised the performance of computational models. But, there are many obstacles to using the Exascale Computing Era sophisticated computing platforms effectively. These include but are not limited to massive parallelism, effective exploitation, and high complexity in programming, such as heterogeneous computing facilities. So, now is the time to create new algorithms that are more resilient, energy-aware, and able to address the demands of increasing data locality and achieve much higher concurrency through high levels of scalability and granularity. In this context, some methods, such as those based on hierarchical matrices (HMs), have been declared among the most promising in the use of new computing resources precisely because of their strongly hierarchical nature. This work aims to start to assess the advantages, and limits, of the use of HMs in operations such as the evaluation of matrix polynomials, which are crucial, for example, in a Graph Convolutional Deep Neural Network (GC-DNN) context. A case study from the GCNN context provides some insights into the effectiveness, in terms of accuracy, of the employment of HMs.https://www.mdpi.com/2227-7390/13/9/1378matrix polynomialshierarchical matriceshigh-performance computingexascale computinggraph convolutional deep neural network
spellingShingle Luisa Carracciuolo
Valeria Mele
New Strategies Based on Hierarchical Matrices for Matrix Polynomial Evaluation in Exascale Computing Era
Mathematics
matrix polynomials
hierarchical matrices
high-performance computing
exascale computing
graph convolutional deep neural network
title New Strategies Based on Hierarchical Matrices for Matrix Polynomial Evaluation in Exascale Computing Era
title_full New Strategies Based on Hierarchical Matrices for Matrix Polynomial Evaluation in Exascale Computing Era
title_fullStr New Strategies Based on Hierarchical Matrices for Matrix Polynomial Evaluation in Exascale Computing Era
title_full_unstemmed New Strategies Based on Hierarchical Matrices for Matrix Polynomial Evaluation in Exascale Computing Era
title_short New Strategies Based on Hierarchical Matrices for Matrix Polynomial Evaluation in Exascale Computing Era
title_sort new strategies based on hierarchical matrices for matrix polynomial evaluation in exascale computing era
topic matrix polynomials
hierarchical matrices
high-performance computing
exascale computing
graph convolutional deep neural network
url https://www.mdpi.com/2227-7390/13/9/1378
work_keys_str_mv AT luisacarracciuolo newstrategiesbasedonhierarchicalmatricesformatrixpolynomialevaluationinexascalecomputingera
AT valeriamele newstrategiesbasedonhierarchicalmatricesformatrixpolynomialevaluationinexascalecomputingera