Algorithm 16: crout with pivoting
s e a t t e n d i n g c a m e from m a n u-facturers, universities, and c o m p u t e r-u s i n g laboratories. All t h o s e a t t e n d i n g h a v e written, are writing, Or p l a n t,o write ALc~oL-like c o m p i l e r s or are a c t i v e l y e n g a g e d in writing p r o g r a m s in the ALGOL 60 language. T h e a t t e n d e e s , r e p r e s e n t i n g 22 o r g a n i z a t i o n s , a g r e e d to f o r m a s u b c o m m i t t e e of t h e A C M C o m p u t e r L a n g u a g e s C o m m i t t e e for t h e p u r p o s e of m a i n t a i n i n g a n d i n t e r p r e t i n g the AL(IOL 60 language. T h i s group is e x p a n d a b l e and it is h o p e d t h a t a E u r o-pean c o u n t e r p a r t m a y be f o r m e d so t h a t actions agreed u p o n b y b o t h groups m a y be regarded as ofiieial i n t e r p r e t a-tions a n d c h a n g e s to ALGOL 60. corn m e n t This is Crout's method with row interchanges, as formulated in reference [l], for solving Ay = b and transforming the augmented matrix [A b] into its triangular decomposition LU with all L[k, k] = 1. If A is singular we exit to 'singular,' a non-local label, pivot[k] becomes …