Changes between Initial Version and Version 1 of Ticket #4460


Ignore:
Timestamp:
2017-07-11T15:28:11Z (8 years ago)
Author:
Francesco Casella
Comment:

Legend:

Unmodified
Added
Removed
Modified

  • Ticket #4460 – Description

    initial v1  
    44
    55||N || M || Time [s] ||
    6 || 40 || 40 || 4.0||
    7 || 56 || 56 || 30.7||
    8 || 80 || 80 || 206.2||
     6|| 56 || 56 || 3.34||
     7|| 80 || 80 || 35.4||
     8||112 || 112 || 203.7||
    99
    1010Given the sparsity pattern of the equations, which have only O(N) nonzero entries in the A-matrix, I'm not sure what is the theoretical complexity of the underlying algorithm. It may be O(N^2^), but it is probably not O(N^3^).