7 views

Uploaded by linchi

123

- Algebra 2 Final Exam Review.doc
- Transformations
- 07-08geom2d
- Gaussian Elemination
- Advanced Problem solving (APS) Record
- A New Formulae Method for Solving the Simultaneous Equations
- precalculus unit 1 matrices 2
- jurnal - gauss newton
- Lecture2, Matrices
- Guassian Elimination
- Matrices
- Numerical Methods Notes
- MA1 Wks2-7
- 1 Determinants
- DMC_A_2009
- Basics of matlab
- ActaCarolinae_015-1974-1_40
- UT Dallas Syllabus for math2333.001.11f taught by William Scott (wms016100)
- alg06p4
- rr320203-modelling-of-power-system-components

You are on page 1of 3

VOLKER ~TRASSEN*

Received December 12, t 968

t. Below we will give an algorithm which computes the coefficients of the

product of two square matrices A and B of order n from the coefficients of A

and B with tess t h a n 4 . 7 - n lg7 arithmetical operations (all logarithms in this

paper are for base 2, thus tog 7 ~ 2.8; the usual m e t h o d requires approximately

2n 3 arithmetical operations). The algorithm induces algorithms for inverting a

matrix of order n, solving a system of n linear equations in n unknowns, computing a determinant of order n etc. all requiring less than const n lg 7 arithmetical

operations.

This fact should be compared with the result of KLYUYEV and KOKOVKINSHCHERBAK [1 ] that Gaussian elimination for solving a system of linearequations

is optimal if one restricts oneself to operations upon rows and columns as a

whole. We also note t h a t WlNOGRAD [21 modifies the usual algorithms for matrix

multiplication and inversion and for solving systems of linear equations, trading

roughly half of the multiplications for additions and subtractions.

It is a pleasure to thank D. BRILLINGERfor inspiring discussions about the present

subject and ST. COOK and B. PARLETT for encouraging me to write this paper.

2. We define algorithms e~, ~ which multiply matrices of order m 2 ~, b y induction on k: ~ , 0 is the usual algorithm, for matrix multiplication (requiring

m a multiplications and m 2 ( m - t) additions), e~,k already being known, define

~ , ~+t as follows:

If A, B are matrices of order m 2 k ~ to be multiplied, write

(All A~2t

A = \A21 A~2],

where the

(B~I B12~

B --- \B.21 B2~],

(Cll C1~

A B = \C21 C22],

I

II

= ( A ~ I + A ~ 2 )BlI,

I I I = A l l (Bt~ -- B~.~),

I V = A ~ (-- B l l + B21),

V

= (Alx+AI~)B~2,

V I I = (AI~--A~2 ) (B21 + B22),

* The results have been found while the author was at the Department of Statistics

of the University of California, Berkeley. The author wishes to thank the National

Science Foundation for their support (NSF GP-7454).

Gaussian E l i m i n a t i o n is n o t O p t i m a l

3 55

C~=I+IV--V+VII,

C~x=II+IV,

Qs=III+V,

Css=I+III--II+VI,

using ~ , k for multiplication and the usual algorithm for addition and subtraction

of matrices of order m 2 ~.

B y induction on k one easily sees

Fact 1. ~ , ~ computes the product of two matrices of order m 2 * with m ~7k multiplications and (5 + m) m s 7 ~ -- 6 (m2k) s additions and subtractions of numbers.

Thus one m a y multiply two matrices of order 2 k with 7 k numbermultiplications

and less than 6 . 7 ~ additions and subtractions.

~ 4 . 7 - n 1g7 arithmetical operations.

Proo]. Put

k = [log n -- 4],

m= [n2-*l +t,

then

n ~ m 2 k.

Imbedding matrices of order n into matrices of order m 2 k reduces our task to

t h a t of estimating the number of operations of ~ , k. B y Fact t this number is

(5 + 2m) mS7 k -- 6 (m2k) s

< (5 + 2 ( n 2 - ~ + 1))(n2 - ~ + t ) s 7 k

< 2n 3 (7/8) * + t 2.03 n s (7/4) k

(here we have used 16- 2 ' ~ n)

= (2 (8/7) lgn-k + t2.03 (4/7) lgn-k) n/g7

=< m a x (2 (8/7) t + t2.03 (4/7) *) n 1g7

4<t<5

=< 4 . 7 "

n lg 7

by a convexity argument.

We now turn to matrix inversion. To apply the algorithms below it is necessary

to assume not only t h a t the matrix is invertible b u t t h a t all occurring divisions

m a k e sense (a similar assumption is of course necessary for Gaussian elimination).

We define algorithms fl~,~ which invert matrices of order m 2 k, b y induction

on k: fl~, o is the usual Gaussian elimination algorithm, fl,~,k already being known,

define fl,~,k +1 as follows:

If A is a matrix of order m 2 ~+t to be inverted, write

All Alai,

A = \As1

As2/

Cli CI \

356

I

=A~-xx,

II =A2tI,

I I I = IAI~,

IV = A 2 t l I I ,

V

= IV--A2~,

VI = V -1,

Cx~ = I I I -

VI,

C~1 = V I - I I ,

VII =III-

C2~,

ClI = I -- VII,

C~2 = - - V I

using ~ , k for multiplication, tim,k for inversion a n d the usual a l g o r i t h m for addition or s u b t r a c t i o n of two m a t r i c e s of order m 2 k.

B y i n d u c t i o n on k one easily sees

=~ ....

m 2 k m u l t i p l i c a t i o n s a n d _--<~(5 +m)m~7k--7(m2k) s a d d i t i o n s a n d

s u b t r a c t i o n s of numbers. T h e n e x t F a c t follows in t h e same w a y as F a c t 2.

Fact 4. T h e inverse of a m a t r i x of order n m a y be c o m p u t e d with < 5.64 n lg 7

a r i t h m e t i c a l operations.

S i m i l a r results h o l d for solving a s y s t e m of linear equations or c o m p u t i n g a

d e t e r m i n a n t (use D e t A : ( D e t A i l ) D e t ( A ~ --A21A~Al~)).

References

1. KLYUYEV, V.V., and N. I. KOKOVKIN-SHcHERBAK: On the minimization of the

equations. Translation b y G. I. TEE: Technical Report CS 24, June t4, t965,

Computer Science Dept., Stanford University.

2. WINOGRAD, S. : A new algorithm for inner product. IBM Research Report RC-t943,

Nov. 2t, t967.

Prof. VOLKER STRASSEN

Seminar fiir angewandte Mathematik

der Universit~tt

8032 Ziirich, Freie Str. 36

- Algebra 2 Final Exam Review.docUploaded byMark Abion Valladolid
- TransformationsUploaded bymfbaranow
- 07-08geom2dUploaded byPra Praktyk
- Gaussian EleminationUploaded byMuhammad Rahmandani
- Advanced Problem solving (APS) RecordUploaded bymukesh427
- A New Formulae Method for Solving the Simultaneous EquationsUploaded byIJSTR Research Publication
- precalculus unit 1 matrices 2Uploaded byapi-287816312
- jurnal - gauss newtonUploaded byJulham Efendi Nasution
- Lecture2, MatricesUploaded byHisham Mostafa
- Guassian EliminationUploaded byIo Man Ng
- MatricesUploaded byJinTao
- Numerical Methods NotesUploaded byfuwad84
- MA1 Wks2-7Uploaded byErin Gallagher
- 1 DeterminantsUploaded byshaannivas
- DMC_A_2009Uploaded byVamsi Krishna
- Basics of matlabUploaded byWaqas Ahmed
- ActaCarolinae_015-1974-1_40Uploaded byD.n.Prasad
- UT Dallas Syllabus for math2333.001.11f taught by William Scott (wms016100)Uploaded byUT Dallas Provost's Technology Group
- alg06p4Uploaded bySarthak Garg
- rr320203-modelling-of-power-system-componentsUploaded bySrinivasa Rao G
- Connectivity MatriciesUploaded byDarren Kuropatwa
- 0898719909 GraphUploaded byNirmanaFernando
- Lecture_2Uploaded byAleep YoungBae
- Property of DeterminantsUploaded byabd_ren_ren
- Linear-Algebra.pdfUploaded byckvirtualize
- Modeling Interconnected Systems - A Functioal PrespectiveUploaded byAaron Merrill
- UT Dallas Syllabus for math2333.005.11f taught by Anatoly Eydelzon (axe031000)Uploaded byUT Dallas Provost's Technology Group
- LQR and H2 Control ProblemsUploaded byiraj214
- Matlab Training in JalandharUploaded bye2matrix
- Passed by ReferenceUploaded byElbert Leo Astillero

- The Cloud ComputingUploaded bylinchi
- Component Ranges From 0Uploaded bylinchi
- About This CourseUploaded bylinchi
- Lecture ScheduleUploaded bylinchi
- TextbookUploaded bylinchi
- About This SpecializationUploaded bylinchi
- Course OutlineUploaded bylinchi
- Course ObjectivesUploaded bylinchi
- 1Uploaded bylinchi
- ObjectivesUploaded bylinchi
- Course DescriptionUploaded bylinchi
- PART BUploaded bylinchi
- TopicsUploaded bylinchi
- Algorithms Are the Heart of Computer ScienceUploaded bylinchi
- AnteUploaded bylinchi
- Course Descriptio1Uploaded bylinchi
- Spring 2006Uploaded bylinchi
- Å ×× Ù× ØØ× ÁÒ×Ø ØÙØ ÓUploaded by23wings
- Mit Exercise paper 1Uploaded byCălin Gabriel
- Mit Exercise paper 1Uploaded byCălin Gabriel
- Mit Exercise paper 1Uploaded byCălin Gabriel
- Mit Exercise paper 1Uploaded byCălin Gabriel
- GradingUploaded bylinchi
- GradingUploaded bylinchi
- Å ×× Ù× ØØ× ÁÒ×Ø ØÙØ ÓUploaded by23wings
- T11anonymity.pdfUploaded bylinchi
- Course DescriptionUploaded bylinchi
- UE 141 Wireless Sensor Networks.docxUploaded bylinchi
- Final GuideUploaded bylinchi
- final-2004.pdfUploaded bylinchi

- DA-FIR-SPUploaded byApurva Singh Chauhan
- Robotic GoalkeeperUploaded bystudsudzzz
- Dynamic Reservoir Well InteractionsUploaded bymartin_montana55_479
- 54B.docxUploaded byJamie Schultz
- PHOTO DETECTORS.pdfUploaded bydevendrakphy
- 3. Orthogonal MachiningUploaded bymwasfy_1
- CT Safety ManualUploaded byFranklyn Frank
- Husserl & PhenomenologyUploaded byAugustu Ray Anthony Laurena
- An Analysis of Multilevel Medium-Voltage Inverter for Single Phase Grid Connected Photovoltaic Power SystemUploaded byIJARTET
- WINER, Ethan - Acoustic Treatment and Design for Recording StudiosUploaded byvkris71
- IJETR Paper TemplateUploaded bysudhacarhr
- Structural Analysis II Question PaperUploaded byAnusha Adavikottu
- Course_notes.pptUploaded byANMOL
- Ssp379 the Eos 2006 Part 3Uploaded bypsychoreality
- planos-qeg-motorUploaded byVimlor
- FibonacciUploaded byNagesh Einstein
- Md22s1Uploaded byAnonymous CKJIMFKS
- bscphysicsUploaded bySagar Sharma
- Principles Of Linear Systems And Signals_B. P. Lathi.pdfUploaded byMrigya Jain
- Http___www.jobs.Ac Marie Curie Early Stage Researcher - MICROMAN ProjectUploaded byAnonymous afPplXbc
- Arabian-plate Tektonik MapUploaded byGökay Yıldız
- Chbi502 Chapter 1Uploaded byTriMapTrimapcase
- Laterally Loaded Piles - User manualUploaded bymyplaxis
- Hand Brian FYP2014Uploaded byPhanHatham
- Shulman, Homotopy Type Theory - The Logic of SpaceUploaded byJason Payne
- Chemistry ProjectUploaded bySubiksha Ravi
- Math 569Uploaded byMichael Vu
- 1-02 Rheology of Drilling and Completion FluidsUploaded bySeputra Paramasidi
- Pipe Jacking and Microtunneling Design Guide National Utility Contractors AssociationUploaded bymahmoudbadwy
- Steel Vessel Under 90m - ABS SMR_Part_4_e-July10Uploaded byBao Tan Dang