AI Chat AI Image Generator AI Video Text to Speech

Formal Derivation of LU Factorization with Pivoting

04/06/2023

∙

by Robert van de Geijn, et al.

∙

∙

The FLAME methodology for deriving linear algebra algorithms from specification, first introduced around 2000, has been successfully applied to a broad cross section of operations. An open question has been whether it can yield algorithms for the best-known operation in linear algebra, LU factorization with partial pivoting (Gaussian elimination with row swapping). This paper shows that it can.

Robert van de Geijn
3 publications
Maggie Myers
1 publication

research

∙ 10/11/2017

Deriving Correct High-Performance Algorithms

Dijkstra observed that verifying correctness of a program is difficult a...

0 Devangi N. Parikh, et al. ∙

research

∙ 03/01/2017

Systematic Generation of Algorithms for Iterative Methods

The FLAME methodology makes it possible to derive provably correct algor...

0 Henrik Barthels, et al. ∙

research

∙ 08/20/2018

A Simple Methodology for Computing Families of Algorithms

Discovering "good" algorithms for an operation is often considered an ar...

0 Devangi N. Parikh, et al. ∙

research

∙ 02/21/2022

I/O-Optimal Algorithms for Symmetric Linear Algebra Kernels

In this paper, we consider two fundamental symmetric kernels in linear a...

0 Olivier Beaumont, et al. ∙

research

∙ 10/26/2020

Expressive power of linear algebra query languages

Linear algebra algorithms often require some sort of iteration or recurs...

0 Floris Geerts, et al. ∙

research

∙ 11/19/2016

A Case for Malleable Thread-Level Linear Algebra Libraries: The LU Factorization with Partial Pivoting

We propose two novel techniques for overcoming load-imbalance encountere...

0 Sandra Catalán, et al. ∙

research

∙ 10/12/2020

On the Parallel I/O Optimality of Linear Algebra Kernels: Near-Optimal LU Factorization

Dense linear algebra kernels, such as linear solvers or tensor contracti...

0 Grzegorz Kwasniewski, et al. ∙