Yousef Saad
YOU?
Author Swipe
View article: Deep learning, transformers and graph neural networks: a linear algebra perspective
Deep learning, transformers and graph neural networks: a linear algebra perspective Open
In an age where Artificial Intelligence (AI) is being integrated into nearly every domain of science and engineering, it has become essential for experts in Numerical Linear Algebra to explore the foundational elements of deep learning and…
View article: Acceleration methods for fixed point iterations
Acceleration methods for fixed point iterations Open
A pervasive approach in scientific computing is to express the solution to a given problem as the limit of a sequence of vectors or other mathematical objects. In many situations these sequences are generated by slowly converging iterative…
View article: Acceleration methods for fixed-point iterations
Acceleration methods for fixed-point iterations Open
A pervasive approach in scientific computing is to express the solution to a given problem as the limit of a sequence of vectors or other mathematical objects. In many situations these sequences are generated by slowly converging iterative…
View article: Coffee waste utilization as an eco-friendly disposal for pollutants removal from wastewater
Coffee waste utilization as an eco-friendly disposal for pollutants removal from wastewater Open
View article: Mixed Precision Orthogonalization-Free Projection Methods for Eigenvalue and Singular Value Problems
Mixed Precision Orthogonalization-Free Projection Methods for Eigenvalue and Singular Value Problems Open
Mixed-precision arithmetic offers significant computational advantages for large-scale matrix computation tasks, yet preserving accuracy and stability in eigenvalue problems and the singular value decomposition (SVD) remains challenging. T…
View article: Combinative model compression approach for enhancing 1D CNN efficiency for EIT-based Hand Gesture Recognition on IoT edge devices
Combinative model compression approach for enhancing 1D CNN efficiency for EIT-based Hand Gesture Recognition on IoT edge devices Open
View article: Joint Approximate Partial Diagonalization of Large Matrices
Joint Approximate Partial Diagonalization of Large Matrices Open
Given a set of $p$ symmetric (real) matrices, the Orthogonal Joint Diagonalization (OJD) problem consists of finding an orthonormal basis in which the representation of each of these $p$ matrices is as close as possible to a diagonal matri…
View article: Straggler-tolerant stationary methods for linear systems
Straggler-tolerant stationary methods for linear systems Open
In this paper, we consider the iterative solution of linear algebraic equations under the condition that matrix-vector products with the coefficient matrix are computed only partially. At the same time, non-computed entries are set to zero…
View article: Anderson Acceleration with Truncated Gram-Schmidt
Anderson Acceleration with Truncated Gram-Schmidt Open
Anderson Acceleration (AA) is a popular algorithm designed to enhance the convergence of fixed-point iterations. In this paper, we introduce a variant of AA based on a Truncated Gram-Schmidt process (AATGS) which has a few advantages over …
View article: Gradient-type subspace iteration methods for the symmetric eigenvalue problem
Gradient-type subspace iteration methods for the symmetric eigenvalue problem Open
This paper explores variants of the subspace iteration algorithm for computing approximate invariant subspaces. The standard subspace iteration approach is revisited and new variants that exploit gradient-type techniques combined with a Gr…
View article: NLTGCR: A class of Nonlinear Acceleration Procedures based on Conjugate Residuals
NLTGCR: A class of Nonlinear Acceleration Procedures based on Conjugate Residuals Open
This paper develops a new class of nonlinear acceleration algorithms based on extending conjugate residual-type procedures from linear to nonlinear equations. The main algorithm has strong similarities with Anderson acceleration as well as…
View article: On the tubular eigenvalues of third-order tensors
On the tubular eigenvalues of third-order tensors Open
This paper introduces the notion of tubular eigenvalues of third-order tensors with respect to T-products of tensors and analyzes their properties. A focus of the paper is to discuss relations between tubular eigenvalues and two alternativ…
View article: An Efficient Nonlinear Acceleration method that Exploits Symmetry of the Hessian
An Efficient Nonlinear Acceleration method that Exploits Symmetry of the Hessian Open
Nonlinear acceleration methods are powerful techniques to speed up fixed-point iterations. However, many acceleration methods require storing a large number of previous iterates and this can become impractical if computational resources ar…
View article: parGeMSLR: A parallel multilevel Schur complement low-rank preconditioning and solution package for general sparse matrices
parGeMSLR: A parallel multilevel Schur complement low-rank preconditioning and solution package for general sparse matrices Open
View article: Table of Contents
Table of Contents Open
View article: parGeMSLR: A Parallel Multilevel Schur Complement Low-Rank Preconditioning and Solution Package for General Sparse Matrices
parGeMSLR: A Parallel Multilevel Schur Complement Low-Rank Preconditioning and Solution Package for General Sparse Matrices Open
This paper discusses parGeMSLR, a C++/MPI software library for the solution of sparse systems of linear algebraic equations via preconditioned Krylov subspace methods in distributed-memory computing environments. The preconditioner impleme…
View article: A Non-perturbative Approach to Computing Seismic Normal Modes in Rotating Planets
A Non-perturbative Approach to Computing Seismic Normal Modes in Rotating Planets Open
View article: Graph coarsening: from scientific computing to machine learning
Graph coarsening: from scientific computing to machine learning Open
The general method of graph coarsening or graph reduction has been a remarkably useful and ubiquitous tool in scientific computing and it is now just starting to have a similar impact in machine learning. The goal of this paper is to take …
View article: GDA-AM: On the effectiveness of solving minimax optimization via Anderson Acceleration
GDA-AM: On the effectiveness of solving minimax optimization via Anderson Acceleration Open
Many modern machine learning algorithms such as generative adversarial networks (GANs) and adversarial training can be formulated as minimax optimization. Gradient descent ascent (GDA) is the most commonly used algorithm due to its simplic…
View article: Solve Minimax Optimization by Anderson Acceleration
Solve Minimax Optimization by Anderson Acceleration Open
Many modern machine learning algorithms such as generative adversarial networks (GANs) and adversarial training can be formulated as minimax optimization. Gradient descent ascent (GDA) is the most commonly used algorithm due to its simplic…
View article: Table of Contents
Table of Contents Open
View article: Shanks and Anderson-type acceleration techniques for systems of nonlinear equations
Shanks and Anderson-type acceleration techniques for systems of nonlinear equations Open
This paper examines a number of extrapolation and acceleration methods and introduces a few modifications of the standard Shanks transformation that deal with general sequences. One of the goals of the paper is to lay out a general framewo…
View article: Graph coarsening: From scientific computing to machine learning
Graph coarsening: From scientific computing to machine learning Open
The general method of graph coarsening or graph reduction has been a remarkably useful and ubiquitous tool in scientific computing and it is now just starting to have a similar impact in machine learning. The goal of this paper is to take …
View article: Planetary Normal Mode Computation: Parallel Algorithms, Performance, and Reproducibility
Planetary Normal Mode Computation: Parallel Algorithms, Performance, and Reproducibility Open
This report is an extension of work entitled “Computing planetary interior normal modes with a highly parallel polynomial filtering eigensolver.” by Shi et al., [1] originally presented at the SC18 conference. A highly parallel polynomial …
View article: Spectrum-Adapted Polynomial Approximation for Matrix Functions with Applications in Graph Signal Processing
Spectrum-Adapted Polynomial Approximation for Matrix Functions with Applications in Graph Signal Processing Open
We propose and investigate two new methods to approximate f(A)b for large, sparse, Hermitian matrices A. Computations of this form play an important role in numerous signal processing and machine learning tasks. The main idea behind both m…
View article: Shanks and Anderson-type acceleration techniques for systems of\n nonlinear equations
Shanks and Anderson-type acceleration techniques for systems of\n nonlinear equations Open
This paper examines a number of extrapolation and acceleration methods, and\nintroduces a few modifications of the standard Shanks transformation that deal\nwith general sequences. One of the goals of the paper is to lay out a general\nfra…
View article: Shanks and Anderson-type acceleration techniques for systems of nonlinear equations
Shanks and Anderson-type acceleration techniques for systems of nonlinear equations Open
This paper examines a number of extrapolation and acceleration methods, and introduces a few modifications of the standard Shanks transformation that deal with general sequences. One of the goals of the paper is to lay out a general framew…
View article: A power Schur complement Low-Rank correction preconditioner for general sparse linear systems
A power Schur complement Low-Rank correction preconditioner for general sparse linear systems Open
An effective power based parallel preconditioner is proposed for general large sparse linear systems. The preconditioner combines a power series expansion method with some low-rank correction techniques, where the Sherman-Morrison-Woodbury…
View article: Iterative methods for linear systems of equations: A brief historical journey
Iterative methods for linear systems of equations: A brief historical journey Open
This paper presents a brief historical survey of iterative methods for solving linear systems of equations. The journey begins with Gauss who developed the first known method that can be termed iterative. The early 20th century saw good pr…
View article: The computation of seismic normal modes with rotation as a quadratic eigenvalue problem
The computation of seismic normal modes with rotation as a quadratic eigenvalue problem Open
A new approach is presented to compute the seismic normal modes of a fully heterogeneous, rotating planet. Special care is taken to separate out the essential spectrum in the presence of a fluid outer core. The relevant elastic-gravitation…