๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Using Net Refinement to Compute the Fixpoint of a Recursive Expression

โœ Scribed by Eike Best; Maciej Koutny

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
112 KB
Volume
2
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

โœฆ Synopsis

The talk illustrates the general Petri net semantics of equations such a s X = term(X) using a basic CCS-like process algebra without restriction, synchronisation and relabelling.

๐Ÿ“œ SIMILAR VOLUMES

A BSP Recursive Divide and Conquer Algor
A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix
โœ Joan-Josep Climent; Leandro Tortosa; Antonio Zamora ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 253 KB

In this paper we discuss a recursive divide and conquer algorithm to compute the inverse of an unreduced tridiagonal matrix. It is based on the recursive application of the Sherman Morrison formula to a diagonally dominant tridiagonal matrix to avoid numerical stability problems. A theoretical study

Using semiseparable matrices to compute
Using semiseparable matrices to compute the SVD of a general matrix product/quotient
โœ Marc Van Barel; Yvette Vanberghen; Paul Van Dooren ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 364 KB

In this work we reduce the computation of the singular values of a general product/quotient of matrices to the computation of the singular values of an upper triangular semiseparable matrix. Compared to the reduction into a bidiagonal matrix the reduction into semiseparable form exhibits a nested su