Menu

SVN archive Commit Log


Commit Date  
[r24045] by bugman

Merged revisions 24040 via svnmerge from
svn+ssh://bugman@.../svn/relax/trunk

........
r24040 | bugman | 2014-06-17 15:56:47 +0200 (Tue, 17 Jun 2014) | 9 lines

Fixes for all of the relaxation dispersion system tests which were failing with the new minfx code.

Due to the tuning of the log barrier constraint algorithm in minfx in the commit at
http://article.gmane.org/gmane.science.mathematics.minfx.scm/25, many system tests needed to be
slightly adjusted. Two of the Relax_disp.test_tp02_data_to_* system tests were also failing as the
optimisation can no longer move out of the minimum at pA = 0.5 for one spin (due to the low quality
grid search in the auto-analysis).
........

2014-06-17 15:24:54 Tree
[r24044] by tlinnet

Merged revisions 24040,24043 via svnmerge from
svn+ssh://tlinnet@.../svn/relax/trunk

........
r24040 | bugman | 2014-06-17 15:56:47 +0200 (Tue, 17 Jun 2014) | 9 lines

Fixes for all of the relaxation dispersion system tests which were failing with the new minfx code.

Due to the tuning of the log barrier constraint algorithm in minfx in the commit at
http://article.gmane.org/gmane.science.mathematics.minfx.scm/25, many system tests needed to be
slightly adjusted. Two of the Relax_disp.test_tp02_data_to_* system tests were also failing as the
optimisation can no longer move out of the minimum at pA = 0.5 for one spin (due to the low quality
grid search in the auto-analysis).
........
r24043 | bugman | 2014-06-17 17:02:17 +0200 (Tue, 17 Jun 2014) | 3 lines

Updated the release checklist document for the new 1.0.7 release of minfx.
........

2014-06-17 15:06:56 Tree
[r24043] by bugman

Updated the release checklist document for the new 1.0.7 release of minfx.

2014-06-17 15:02:17 Tree
[r24042] by tlinnet

First attempt to implement lib function for ns r1rho 2site.

But it does not work yet.

Task #7807 (https://gna.org/task/index.php?7807): Speed-up of dispersion models for Clustered analysis.

2014-06-17 14:51:47 Tree
[r24041] by tlinnet

First attempt to implement target function for ns_r1rho_2site.

But it does not work yet.

Task #7807 (https://gna.org/task/index.php?7807): Speed-up of dispersion models for Clustered analysis.

2014-06-17 14:51:45 Tree
[r24040] by bugman

Fixes for all of the relaxation dispersion system tests which were failing with the new minfx code.

Due to the tuning of the log barrier constraint algorithm in minfx in the commit at
http://article.gmane.org/gmane.science.mathematics.minfx.scm/25, many system tests needed to be
slightly adjusted. Two of the Relax_disp.test_tp02_data_to_* system tests were also failing as the
optimisation can no longer move out of the minimum at pA = 0.5 for one spin (due to the low quality
grid search in the auto-analysis).

2014-06-17 13:56:47 Tree
[r24039] by tlinnet

Fix for shortening the variables names.

Task #7807 (https://gna.org/task/index.php?7807): Speed-up of dispersion models for Clustered analysis.

2014-06-17 13:49:54 Tree
[r24038] by tlinnet

Documentation fix for the initial data structure of cpmg_frqs, spin_lock_nu1, r1.

They were incorrect.

Task #7807 (https://gna.org/task/index.php?7807): Speed-up of dispersion models for Clustered analysis.

2014-06-17 13:08:26 Tree
[r24037] by tlinnet

Merged revisions 24028 via svnmerge from
svn+ssh://tlinnet@.../svn/relax/trunk

........
r24028 | bugman | 2014-06-17 14:03:14 +0200 (Tue, 17 Jun 2014) | 6 lines

Fix for bug #22210 (https://gna.org/bugs/?22210), the failure of the 'LM63 3-site' dispersion model.

The problem is described in the bug report - the multiplication in the tanh() function is a mistake,
it must be a division.
........

2014-06-17 12:57:33 Tree
[r24036] by tlinnet

Documentation fix for which dimensionality number of points have.

Task #7807 (https://gna.org/task/index.php?7807): Speed-up of dispersion models for Clustered analysis.

2014-06-17 12:53:54 Tree
Older >
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.