Concurrent Gaussian elimination

05/17/2023
by   Ulrich Berger, et al.
0

Working in a semi-constructive logical system that supports the extraction of concurrent programs, we extract a program inverting non-singular real valued matrices from a constructive proof based on Gaussian elimination. Concurrency is used for efficient pivoting, that is, for finding an entry that is apart from zero in a non-null vector of real numbers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/11/2018

Formalizing Constructive Quantifier Elimination in Agda

In this paper a constructive formalization of quantifier elimination is ...
research
05/04/2022

Constructive Analysis in the Agda Proof Assistant

Proof assistant software has recently been used to verify proofs of majo...
research
09/22/2017

Subjective Simulation as a Notion of Morphism for Composing Concurrent Resources

Recent approaches to verifying programs in separation logics for concurr...
research
07/29/2009

An Explicit Construction of Gauss-Jordan Elimination Matrix

A constructive approach to get the reduced row echelon form of a given m...
research
03/22/2021

Functional Pearl: Witness Me – Constructive Arguments Must Be Guided with Concrete Witness

Beloved Curry–Howard correspondence tells that types are intuitionistic ...
research
12/31/2021

Elimination (a,b)-trees with fast, durable updates

Many concurrent dictionary implementations are designed and optimized fo...
research
05/17/2018

Property and structure in constructive analysis

Real numbers such as Dedekind reals or (quotiented) Cauchy reals (as opp...

Please sign up or login with your details

Forgot password? Click here to reset