Direct methods
Numerical algorithms for solving large systems
Article REF: AF502 V1
Direct methods
Numerical algorithms for solving large systems

Author : Pierre SPITERI

Publication date: October 10, 2002 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

2. Direct methods

The first conceivable method for solving the above linear system is Gauss's method of elimination (or its variants, such as Crout's method or Cholesky's method, etc.).), whose complexity, i.e. the number of arithmetic operations, is of the order of 23(dim(A))3 ; if A is a symmetrical matrix, the number of arithmetic operations reduces to 13(dim(A))3...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?

Article included in this offer

"Mathematics"

( 165 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details
Contact our team FAQ