First presenter 

Copresenter(s) 
Name : 
Benoit Lacelle * 

Name: 
Eric Schost * 
Email: 


Email: 

Affiliation: 
University of Western Ontario 

Name: 

Department: 
Computer Science Department 

Email: 

City: 


Name: 

State/Province: 


Email: 

Country: 
Canada 

Name: 

Talk Number: 
1102 

Email: 

Session: 
11 HighPerformance Computer Algebra 

Schedule: Room: 
Thursday, 16:30 B2624 
Related website: 

Title of presentation: 
Towards an efficient implementation for the resolution of structured linear system 
Abstract: 
Lots of linear algebra problems can be reduced to the resolution of a linear system:
A.X = B. When they are expressed in such a form, it appears that A often admits a
pattern : it is said to be a structured matrix. To accelerate its resolution, one
can take advantage of that structure. This talk will present our efficient implementation
of the MorfBitmeadAnderson algorithm for the inversion of scalar structured matrices :
its time complexity is quasilinear in the size of A. That implementation has been
associated with a Newton Iteration taking advantage of the structure of A : it is
able to inverse polynomial structured matrices with again a time complexity quasilinear
in the size of A. 